diff options
Diffstat (limited to 'src/share/algebra/browse.daase')
| -rw-r--r-- | src/share/algebra/browse.daase | 2850 |
1 files changed, 1423 insertions, 1427 deletions
diff --git a/src/share/algebra/browse.daase b/src/share/algebra/browse.daase index ad6dab06..2a8d53ee 100644 --- a/src/share/algebra/browse.daase +++ b/src/share/algebra/browse.daase @@ -1,12 +1,12 @@ -(2275976 . 3524556579) +(2274390 . 3524578950) (-18 A S) ((|constructor| (NIL "One-dimensional-array aggregates serves as models for one-dimensional arrays. Categorically,{} these aggregates are finite linear aggregates with the \\spadatt{shallowlyMutable} property,{} that is,{} any component of the array may be changed without affecting the identity of the overall array. Array data structures are typically represented by a fixed area in storage and therefore cannot efficiently grow or shrink on demand as can list structures (see however \\spadtype{FlexibleArray} for a data structure which is a cross between a list and an array). Iteration over,{} and access to,{} elements of arrays is extremely fast (and often can be optimized to open-code). Insertion and deletion however is generally slow since an entirely new data structure must be created for the result."))) NIL NIL (-19 S) ((|constructor| (NIL "One-dimensional-array aggregates serves as models for one-dimensional arrays. Categorically,{} these aggregates are finite linear aggregates with the \\spadatt{shallowlyMutable} property,{} that is,{} any component of the array may be changed without affecting the identity of the overall array. Array data structures are typically represented by a fixed area in storage and therefore cannot efficiently grow or shrink on demand as can list structures (see however \\spadtype{FlexibleArray} for a data structure which is a cross between a list and an array). Iteration over,{} and access to,{} elements of arrays is extremely fast (and often can be optimized to open-code). Insertion and deletion however is generally slow since an entirely new data structure must be created for the result."))) -((-4425 . T) (-4424 . T)) +((-4424 . T) (-4423 . T)) NIL (-20 S) ((|constructor| (NIL "The class of abelian groups,{} \\spadignore{i.e.} additive monoids where each element has an additive inverse. \\blankline")) (- (($ $ $) "\\spad{x-y} is the difference of \\spad{x} and \\spad{y} \\spadignore{i.e.} \\spad{x + (-y)}.") (($ $) "\\spad{-x} is the additive inverse of \\spad{x}"))) @@ -38,7 +38,7 @@ NIL NIL (-27) ((|constructor| (NIL "Model for algebraically closed fields.")) (|zerosOf| (((|List| $) (|SparseUnivariatePolynomial| $) (|Symbol|)) "\\spad{zerosOf(p, y)} returns \\spad{[y1,...,yn]} such that \\spad{p(yi) = 0}. The \\spad{yi}'s are expressed in radicals if possible,{} and otherwise as implicit algebraic quantities which display as \\spad{'yi}. The returned symbols \\spad{y1},{}...,{}yn are bound in the interpreter to respective root values.") (((|List| $) (|SparseUnivariatePolynomial| $)) "\\spad{zerosOf(p)} returns \\spad{[y1,...,yn]} such that \\spad{p(yi) = 0}. The \\spad{yi}'s are expressed in radicals if possible,{} and otherwise as implicit algebraic quantities. The returned symbols \\spad{y1},{}...,{}yn are bound in the interpreter to respective root values.") (((|List| $) (|Polynomial| $)) "\\spad{zerosOf(p)} returns \\spad{[y1,...,yn]} such that \\spad{p(yi) = 0}. The \\spad{yi}'s are expressed in radicals if possible. Otherwise they are implicit algebraic quantities. The returned symbols \\spad{y1},{}...,{}yn are bound in the interpreter to respective root values. Error: if \\spad{p} has more than one variable \\spad{y}.")) (|zeroOf| (($ (|SparseUnivariatePolynomial| $) (|Symbol|)) "\\spad{zeroOf(p, y)} returns \\spad{y} such that \\spad{p(y) = 0}; if possible,{} \\spad{y} is expressed in terms of radicals. Otherwise it is an implicit algebraic quantity which displays as \\spad{'y}.") (($ (|SparseUnivariatePolynomial| $)) "\\spad{zeroOf(p)} returns \\spad{y} such that \\spad{p(y) = 0}; if possible,{} \\spad{y} is expressed in terms of radicals. Otherwise it is an implicit algebraic quantity.") (($ (|Polynomial| $)) "\\spad{zeroOf(p)} returns \\spad{y} such that \\spad{p(y) = 0}. If possible,{} \\spad{y} is expressed in terms of radicals. Otherwise it is an implicit algebraic quantity. Error: if \\spad{p} has more than one variable \\spad{y}.")) (|rootsOf| (((|List| $) (|SparseUnivariatePolynomial| $) (|Symbol|)) "\\spad{rootsOf(p, y)} returns \\spad{[y1,...,yn]} such that \\spad{p(yi) = 0}; The returned roots display as \\spad{'y1},{}...,{}\\spad{'yn}. Note: the returned symbols \\spad{y1},{}...,{}yn are bound in the interpreter to respective root values.") (((|List| $) (|SparseUnivariatePolynomial| $)) "\\spad{rootsOf(p)} returns \\spad{[y1,...,yn]} such that \\spad{p(yi) = 0}. Note: the returned symbols \\spad{y1},{}...,{}yn are bound in the interpreter to respective root values.") (((|List| $) (|Polynomial| $)) "\\spad{rootsOf(p)} returns \\spad{[y1,...,yn]} such that \\spad{p(yi) = 0}. Note: the returned symbols \\spad{y1},{}...,{}yn are bound in the interpreter to respective root values. Error: if \\spad{p} has more than one variable \\spad{y}.")) (|rootOf| (($ (|SparseUnivariatePolynomial| $) (|Symbol|)) "\\spad{rootOf(p, y)} returns \\spad{y} such that \\spad{p(y) = 0}. The object returned displays as \\spad{'y}.") (($ (|SparseUnivariatePolynomial| $)) "\\spad{rootOf(p)} returns \\spad{y} such that \\spad{p(y) = 0}.") (($ (|Polynomial| $)) "\\spad{rootOf(p)} returns \\spad{y} such that \\spad{p(y) = 0}. Error: if \\spad{p} has more than one variable \\spad{y}."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-28 S R) ((|constructor| (NIL "Model for algebraically closed function spaces.")) (|zerosOf| (((|List| $) $ (|Symbol|)) "\\spad{zerosOf(p, y)} returns \\spad{[y1,...,yn]} such that \\spad{p(yi) = 0}. The \\spad{yi}'s are expressed in radicals if possible,{} and otherwise as implicit algebraic quantities which display as \\spad{'yi}. The returned symbols \\spad{y1},{}...,{}yn are bound in the interpreter to respective root values.") (((|List| $) $) "\\spad{zerosOf(p)} returns \\spad{[y1,...,yn]} such that \\spad{p(yi) = 0}. The \\spad{yi}'s are expressed in radicals if possible. The returned symbols \\spad{y1},{}...,{}yn are bound in the interpreter to respective root values. Error: if \\spad{p} has more than one variable.")) (|zeroOf| (($ $ (|Symbol|)) "\\spad{zeroOf(p, y)} returns \\spad{y} such that \\spad{p(y) = 0}. The value \\spad{y} is expressed in terms of radicals if possible,{}and otherwise as an implicit algebraic quantity which displays as \\spad{'y}.") (($ $) "\\spad{zeroOf(p)} returns \\spad{y} such that \\spad{p(y) = 0}. The value \\spad{y} is expressed in terms of radicals if possible,{}and otherwise as an implicit algebraic quantity. Error: if \\spad{p} has more than one variable.")) (|rootsOf| (((|List| $) $ (|Symbol|)) "\\spad{rootsOf(p, y)} returns \\spad{[y1,...,yn]} such that \\spad{p(yi) = 0}; The returned roots display as \\spad{'y1},{}...,{}\\spad{'yn}. Note: the returned symbols \\spad{y1},{}...,{}yn are bound in the interpreter to respective root values.") (((|List| $) $) "\\spad{rootsOf(p, y)} returns \\spad{[y1,...,yn]} such that \\spad{p(yi) = 0}; Note: the returned symbols \\spad{y1},{}...,{}yn are bound in the interpreter to respective root values. Error: if \\spad{p} has more than one variable \\spad{y}.")) (|rootOf| (($ $ (|Symbol|)) "\\spad{rootOf(p,y)} returns \\spad{y} such that \\spad{p(y) = 0}. The object returned displays as \\spad{'y}.") (($ $) "\\spad{rootOf(p)} returns \\spad{y} such that \\spad{p(y) = 0}. Error: if \\spad{p} has more than one variable \\spad{y}."))) @@ -46,7 +46,7 @@ NIL NIL (-29 R) ((|constructor| (NIL "Model for algebraically closed function spaces.")) (|zerosOf| (((|List| $) $ (|Symbol|)) "\\spad{zerosOf(p, y)} returns \\spad{[y1,...,yn]} such that \\spad{p(yi) = 0}. The \\spad{yi}'s are expressed in radicals if possible,{} and otherwise as implicit algebraic quantities which display as \\spad{'yi}. The returned symbols \\spad{y1},{}...,{}yn are bound in the interpreter to respective root values.") (((|List| $) $) "\\spad{zerosOf(p)} returns \\spad{[y1,...,yn]} such that \\spad{p(yi) = 0}. The \\spad{yi}'s are expressed in radicals if possible. The returned symbols \\spad{y1},{}...,{}yn are bound in the interpreter to respective root values. Error: if \\spad{p} has more than one variable.")) (|zeroOf| (($ $ (|Symbol|)) "\\spad{zeroOf(p, y)} returns \\spad{y} such that \\spad{p(y) = 0}. The value \\spad{y} is expressed in terms of radicals if possible,{}and otherwise as an implicit algebraic quantity which displays as \\spad{'y}.") (($ $) "\\spad{zeroOf(p)} returns \\spad{y} such that \\spad{p(y) = 0}. The value \\spad{y} is expressed in terms of radicals if possible,{}and otherwise as an implicit algebraic quantity. Error: if \\spad{p} has more than one variable.")) (|rootsOf| (((|List| $) $ (|Symbol|)) "\\spad{rootsOf(p, y)} returns \\spad{[y1,...,yn]} such that \\spad{p(yi) = 0}; The returned roots display as \\spad{'y1},{}...,{}\\spad{'yn}. Note: the returned symbols \\spad{y1},{}...,{}yn are bound in the interpreter to respective root values.") (((|List| $) $) "\\spad{rootsOf(p, y)} returns \\spad{[y1,...,yn]} such that \\spad{p(yi) = 0}; Note: the returned symbols \\spad{y1},{}...,{}yn are bound in the interpreter to respective root values. Error: if \\spad{p} has more than one variable \\spad{y}.")) (|rootOf| (($ $ (|Symbol|)) "\\spad{rootOf(p,y)} returns \\spad{y} such that \\spad{p(y) = 0}. The object returned displays as \\spad{'y}.") (($ $) "\\spad{rootOf(p)} returns \\spad{y} such that \\spad{p(y) = 0}. Error: if \\spad{p} has more than one variable \\spad{y}."))) -((-4421 . T) (-4419 . T) (-4418 . T) ((-4426 "*") . T) (-4417 . T) (-4422 . T) (-4416 . T)) +((-4420 . T) (-4418 . T) (-4417 . T) ((-4425 "*") . T) (-4416 . T) (-4421 . T) (-4415 . T)) NIL (-30) ((|constructor| (NIL "\\indented{1}{Plot a NON-SINGULAR plane algebraic curve \\spad{p}(\\spad{x},{}\\spad{y}) = 0.} Author: Clifton \\spad{J}. Williamson Date Created: Fall 1988 Date Last Updated: 27 April 1990 Keywords: algebraic curve,{} non-singular,{} plot Examples: References:")) (|refine| (($ $ (|DoubleFloat|)) "\\spad{refine(p,x)} \\undocumented{}")) (|makeSketch| (($ (|Polynomial| (|Integer|)) (|Symbol|) (|Symbol|) (|Segment| (|Fraction| (|Integer|))) (|Segment| (|Fraction| (|Integer|)))) "\\spad{makeSketch(p,x,y,a..b,c..d)} creates an ACPLOT of the curve \\spad{p = 0} in the region {\\em a <= x <= b, c <= y <= d}. More specifically,{} 'makeSketch' plots a non-singular algebraic curve \\spad{p = 0} in an rectangular region {\\em xMin <= x <= xMax},{} {\\em yMin <= y <= yMax}. The user inputs \\spad{makeSketch(p,x,y,xMin..xMax,yMin..yMax)}. Here \\spad{p} is a polynomial in the variables \\spad{x} and \\spad{y} with integer coefficients (\\spad{p} belongs to the domain \\spad{Polynomial Integer}). The case where \\spad{p} is a polynomial in only one of the variables is allowed. The variables \\spad{x} and \\spad{y} are input to specify the the coordinate axes. The horizontal axis is the \\spad{x}-axis and the vertical axis is the \\spad{y}-axis. The rational numbers xMin,{}...,{}yMax specify the boundaries of the region in which the curve is to be plotted."))) @@ -56,14 +56,14 @@ 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 -3494) +(-32 R -3493) ((|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 -1058) (QUOTE (-558))))) +((|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-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 \\%")) (|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 -4424))) +((|HasAttribute| |#1| (QUOTE -4423))) (-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 \\%")) (|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 @@ -74,7 +74,7 @@ NIL NIL (-36 |Key| |Entry|) ((|constructor| (NIL "An association list is a list of key entry pairs which may be viewed as a table. It is a poor mans version of a table: searching for a key is a linear operation.")) (|assoc| (((|Union| (|Record| (|:| |key| |#1|) (|:| |entry| |#2|)) "failed") |#1| $) "\\spad{assoc(k,u)} returns the element \\spad{x} in association list \\spad{u} stored with key \\spad{k},{} or \"failed\" if \\spad{u} has no key \\spad{k}."))) -((-4424 . T) (-4425 . T)) +((-4423 . T) (-4424 . T)) NIL (-37 S R) ((|constructor| (NIL "The category of associative algebras (modules which are themselves rings). \\blankline"))) @@ -82,20 +82,20 @@ NIL NIL (-38 R) ((|constructor| (NIL "The category of associative algebras (modules which are themselves rings). \\blankline"))) -((-4418 . T) (-4419 . T) (-4421 . T)) +((-4417 . T) (-4418 . T) (-4420 . T)) NIL (-39 UP) ((|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 -3494 UP UPUP -3012) +(-40 -3493 UP UPUP -3011) ((|constructor| (NIL "Function field defined by \\spad{f}(\\spad{x},{} \\spad{y}) = 0.")) (|knownInfBasis| (((|Void|) (|NonNegativeInteger|)) "\\spad{knownInfBasis(n)} \\undocumented{}"))) -((-4417 |has| (-419 |#2|) (-376)) (-4422 |has| (-419 |#2|) (-376)) (-4416 |has| (-419 |#2|) (-376)) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| (-419 |#2|) (QUOTE (-147))) (|HasCategory| (-419 |#2|) (QUOTE (-149))) (|HasCategory| (-419 |#2|) (QUOTE (-363))) (-3956 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (QUOTE (-363)))) (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (QUOTE (-381))) (-3956 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-240))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (|HasCategory| (-419 |#2|) (QUOTE (-363)))) (-3956 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-240))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-239))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (|HasCategory| (-419 |#2|) (QUOTE (-363)))) (-3956 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-363))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -916) (QUOTE (-1197)))))) (-3956 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -918) (QUOTE (-1197)))))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -657) (QUOTE (-558)))) (-3956 (|HasCategory| (-419 |#2|) (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-239))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -918) (QUOTE (-1197))))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-240))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -916) (QUOTE (-1197)))))) -(-41 R -3494) +((-4416 |has| (-419 |#2|) (-376)) (-4421 |has| (-419 |#2|) (-376)) (-4415 |has| (-419 |#2|) (-376)) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| (-419 |#2|) (QUOTE (-147))) (|HasCategory| (-419 |#2|) (QUOTE (-149))) (|HasCategory| (-419 |#2|) (QUOTE (-363))) (-3955 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (QUOTE (-363)))) (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (QUOTE (-381))) (-3955 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-240))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (|HasCategory| (-419 |#2|) (QUOTE (-363)))) (-3955 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-240))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-239))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (|HasCategory| (-419 |#2|) (QUOTE (-363)))) (-3955 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-363))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -915) (QUOTE (-1196)))))) (-3955 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -917) (QUOTE (-1196)))))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -656) (QUOTE (-557)))) (-3955 (|HasCategory| (-419 |#2|) (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-239))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -917) (QUOTE (-1196))))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-240))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -915) (QUOTE (-1196)))))) +(-41 R -3493) ((|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 (-464))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#2| (|%list| (QUOTE -433) (|devaluate| |#1|))))) +((-12 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#2| (|%list| (QUOTE -433) (|devaluate| |#1|))))) (-42 OV E P) ((|constructor| (NIL "This package factors multivariate polynomials over the domain of \\spadtype{AlgebraicNumber} by allowing the user to specify a list of algebraic numbers generating the particular extension to factor over.")) (|factor| (((|Factored| (|SparseUnivariatePolynomial| |#3|)) (|SparseUnivariatePolynomial| |#3|) (|List| (|AlgebraicNumber|))) "\\spad{factor(p,lan)} factors the polynomial \\spad{p} over the extension generated by the algebraic numbers given by the list \\spad{lan}. \\spad{p} is presented as a univariate polynomial with multivariate coefficients.") (((|Factored| |#3|) |#3| (|List| (|AlgebraicNumber|))) "\\spad{factor(p,lan)} factors the polynomial \\spad{p} over the extension generated by the algebraic numbers given by the list \\spad{lan}."))) NIL @@ -106,31 +106,31 @@ NIL ((|HasCategory| |#1| (QUOTE (-319)))) (-44 R |n| |ls| |gamma|) ((|constructor| (NIL "AlgebraGivenByStructuralConstants implements finite rank algebras over a commutative ring,{} given by the structural constants \\spad{gamma} with respect to a fixed basis \\spad{[a1,..,an]},{} where \\spad{gamma} is an \\spad{n}-vector of \\spad{n} by \\spad{n} matrices \\spad{[(gammaijk) for k in 1..rank()]} defined by \\spad{ai * aj = gammaij1 * a1 + ... + gammaijn * an}. The symbols for the fixed basis have to be given as a list of symbols.")) (|coerce| (($ (|Vector| |#1|)) "\\spad{coerce(v)} converts a vector to a member of the algebra by forming a linear combination with the basis element. Note: the vector is assumed to have length equal to the dimension of the algebra."))) -((-4421 |has| |#1| (-569)) (-4419 . T) (-4418 . T)) -((|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) +((-4420 |has| |#1| (-568)) (-4418 . T) (-4417 . T)) +((|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (-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."))) -((-4424 . T) (-4425 . T)) -((-3956 (-12 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4289) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2285) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-860)))) (-12 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4289) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2285) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121))))) (-3956 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-860))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -630) (QUOTE (-547)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-3956 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-860))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-860))) (-3956 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-860))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121))) (-3956 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876))))) (-3956 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102))) (-12 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4289) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2285) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121))))) +((-4423 . T) (-4424 . T)) +((-3955 (-12 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4288) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2284) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-859)))) (-12 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4288) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2284) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120))))) (-3955 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-859))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -629) (QUOTE (-546)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-3955 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-859))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-859))) (-3955 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-859))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120))) (-3955 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875))))) (-3955 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102))) (-12 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4288) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2284) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120))))) (-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 -((|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376)))) +((|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376)))) (-47 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.")) (/ (($ $ |#1|) "\\spad{p/c} divides \\spad{p} by the coefficient \\spad{c}.")) (|coefficient| ((|#1| $ |#2|) "\\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| (($ |#1| |#2|) "\\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| |#1| |#1|) $) "\\spad{map(fn,u)} maps function \\spad{fn} onto the coefficients of the non-zero monomials of \\spad{u}.")) (|degree| ((|#2| $) "\\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| ((|#1| $) "\\spad{leadingCoefficient(p)} returns the coefficient highest degree term of \\spad{p}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4418 . T) (-4419 . T) (-4421 . T)) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-48) ((|constructor| (NIL "Algebraic closure of the rational numbers,{} with mathematical =")) (|norm| (($ $ (|List| (|Kernel| $))) "\\spad{norm(f,l)} computes the norm of the algebraic number \\spad{f} with respect to the extension generated by kernels \\spad{l}") (($ $ (|Kernel| $)) "\\spad{norm(f,k)} computes the norm of the algebraic number \\spad{f} with respect to the extension generated by kernel \\spad{k}") (((|SparseUnivariatePolynomial| $) (|SparseUnivariatePolynomial| $) (|List| (|Kernel| $))) "\\spad{norm(p,l)} computes the norm of the polynomial \\spad{p} with respect to the extension generated by kernels \\spad{l}") (((|SparseUnivariatePolynomial| $) (|SparseUnivariatePolynomial| $) (|Kernel| $)) "\\spad{norm(p,k)} computes the norm of the polynomial \\spad{p} with respect to the extension generated by kernel \\spad{k}")) (|reduce| (($ $) "\\spad{reduce(f)} simplifies all the unreduced algebraic numbers present in \\spad{f} by applying their defining relations.")) (|denom| (((|SparseMultivariatePolynomial| (|Integer|) (|Kernel| $)) $) "\\spad{denom(f)} returns the denominator of \\spad{f} viewed as a polynomial in the kernels over \\spad{Z}.")) (|numer| (((|SparseMultivariatePolynomial| (|Integer|) (|Kernel| $)) $) "\\spad{numer(f)} returns the numerator of \\spad{f} viewed as a polynomial in the kernels over \\spad{Z}.")) (|coerce| (($ (|SparseMultivariatePolynomial| (|Integer|) (|Kernel| $))) "\\spad{coerce(p)} returns \\spad{p} viewed as an algebraic number."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| $ (QUOTE (-1069))) (|HasCategory| $ (|%list| (QUOTE -1058) (QUOTE (-558))))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| $ (QUOTE (-1068))) (|HasCategory| $ (|%list| (QUOTE -1057) (QUOTE (-557))))) (-49) ((|constructor| (NIL "This domain implements anonymous functions")) (|body| (((|Syntax|) $) "\\spad{body(f)} returns the body of the unnamed function `f'.")) (|parameters| (((|List| (|Identifier|)) $) "\\spad{parameters(f)} returns the list of parameters bound by `f'."))) NIL NIL (-50 R |lVar|) ((|constructor| (NIL "The domain of antisymmetric polynomials.")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(f,p)} changes each coefficient of \\spad{p} by the application of \\spad{f}.")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(p)} returns the homogeneous degree of \\spad{p}.")) (|retractable?| (((|Boolean|) $) "\\spad{retractable?(p)} tests if \\spad{p} is a 0-form,{} \\spadignore{i.e.} if degree(\\spad{p}) = 0.")) (|homogeneous?| (((|Boolean|) $) "\\spad{homogeneous?(p)} tests if all of the terms of \\spad{p} have the same degree.")) (|exp| (($ (|List| (|Integer|))) "\\spad{exp([i1,...in])} returns \\spad{u_1\\^{i_1} ... u_n\\^{i_n}}")) (|generator| (($ (|NonNegativeInteger|)) "\\spad{generator(n)} returns the \\spad{n}th multiplicative generator,{} a basis term.")) (|coefficient| ((|#1| $ $) "\\spad{coefficient(p,u)} returns the coefficient of the term in \\spad{p} containing the basis term \\spad{u} if such a term exists,{} and 0 otherwise. Error: if the second argument \\spad{u} is not a basis element.")) (|reductum| (($ $) "\\spad{reductum(p)},{} where \\spad{p} is an antisymmetric polynomial,{} returns \\spad{p} minus the leading term of \\spad{p} if \\spad{p} has at least two terms,{} and 0 otherwise.")) (|leadingBasisTerm| (($ $) "\\spad{leadingBasisTerm(p)} returns the leading basis term of antisymmetric polynomial \\spad{p}.")) (|leadingCoefficient| ((|#1| $) "\\spad{leadingCoefficient(p)} returns the leading coefficient of antisymmetric polynomial \\spad{p}."))) -((-4421 . T)) +((-4420 . T)) NIL (-51) ((|constructor| (NIL "\\spadtype{Any} implements a type that packages up objects and their types in objects of \\spadtype{Any}. Roughly speaking that means that if \\spad{s : S} then when converted to \\spadtype{Any},{} the new object will include both the original object and its type. This is a way of converting arbitrary objects into a single type without losing any of the original information. Any object can be converted to one of \\spadtype{Any}. The original object can be recovered by `is-case' pattern matching as exemplified here and \\spad{AnyFunctions1}.")) (|obj| (((|None|) $) "\\spad{obj(a)} essentially returns the original object that was converted to \\spadtype{Any} except that the type is forced to be \\spadtype{None}.")) (|dom| (((|SExpression|) $) "\\spad{dom(a)} returns a \\spadgloss{LISP} form of the type of the original object that was converted to \\spadtype{Any}.")) (|any| (($ (|SExpression|) (|None|)) "\\spad{any(type,object)} is a technical function for creating an \\spad{object} of \\spadtype{Any}. Arugment \\spad{type} is a \\spadgloss{LISP} form for the \\spad{type} of \\spad{object}."))) @@ -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 -3494) +(-54 |Base| R -3493) ((|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 @@ -158,77 +158,77 @@ NIL NIL (-57 R |Row| |Col|) ((|constructor| (NIL "\\indented{1}{TwoDimensionalArrayCategory is a general array category which} allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and columns returned as objects of type Col. The index of the 'first' row may be obtained by calling the function 'minRowIndex'. The index of the 'first' column may be obtained by calling the function 'minColIndex'. The index of the first element of a 'Row' is the same as the index of the first column in an array and vice versa.")) (|map!| (($ (|Mapping| |#1| |#1|) $) "\\spad{map!(f,a)} assign \\spad{a(i,j)} to \\spad{f(a(i,j))} for all \\spad{i, j}")) (|map| (($ (|Mapping| |#1| |#1| |#1|) $ $ |#1|) "\\spad{map(f,a,b,r)} returns \\spad{c},{} where \\spad{c(i,j) = f(a(i,j),b(i,j))} when both \\spad{a(i,j)} and \\spad{b(i,j)} exist; else \\spad{c(i,j) = f(r, b(i,j))} when \\spad{a(i,j)} does not exist; else \\spad{c(i,j) = f(a(i,j),r)} when \\spad{b(i,j)} does not exist; otherwise \\spad{c(i,j) = f(r,r)}.") (($ (|Mapping| |#1| |#1| |#1|) $ $) "\\spad{map(f,a,b)} returns \\spad{c},{} where \\spad{c(i,j) = f(a(i,j),b(i,j))} for all \\spad{i, j}") (($ (|Mapping| |#1| |#1|) $) "\\spad{map(f,a)} returns \\spad{b},{} where \\spad{b(i,j) = f(a(i,j))} for all \\spad{i, j}")) (|setColumn!| (($ $ (|Integer|) |#3|) "\\spad{setColumn!(m,j,v)} sets to \\spad{j}th column of \\spad{m} to \\spad{v}")) (|setRow!| (($ $ (|Integer|) |#2|) "\\spad{setRow!(m,i,v)} sets to \\spad{i}th row of \\spad{m} to \\spad{v}")) (|qsetelt!| ((|#1| $ (|Integer|) (|Integer|) |#1|) "\\spad{qsetelt!(m,i,j,r)} sets the element in the \\spad{i}th row and \\spad{j}th column of \\spad{m} to \\spad{r} NO error check to determine if indices are in proper ranges")) (|setelt| ((|#1| $ (|Integer|) (|Integer|) |#1|) "\\spad{setelt(m,i,j,r)} sets the element in the \\spad{i}th row and \\spad{j}th column of \\spad{m} to \\spad{r} error check to determine if indices are in proper ranges")) (|parts| (((|List| |#1|) $) "\\spad{parts(m)} returns a list of the elements of \\spad{m} in row major order")) (|column| ((|#3| $ (|Integer|)) "\\spad{column(m,j)} returns the \\spad{j}th column of \\spad{m} error check to determine if index is in proper ranges")) (|row| ((|#2| $ (|Integer|)) "\\spad{row(m,i)} returns the \\spad{i}th row of \\spad{m} error check to determine if index is in proper ranges")) (|qelt| ((|#1| $ (|Integer|) (|Integer|)) "\\spad{qelt(m,i,j)} returns the element in the \\spad{i}th row and \\spad{j}th column of the array \\spad{m} NO error check to determine if indices are in proper ranges")) (|elt| ((|#1| $ (|Integer|) (|Integer|) |#1|) "\\spad{elt(m,i,j,r)} returns the element in the \\spad{i}th row and \\spad{j}th column of the array \\spad{m},{} if \\spad{m} has an \\spad{i}th row and a \\spad{j}th column,{} and returns \\spad{r} otherwise") ((|#1| $ (|Integer|) (|Integer|)) "\\spad{elt(m,i,j)} returns the element in the \\spad{i}th row and \\spad{j}th column of the array \\spad{m} error check to determine if indices are in proper ranges")) (|ncols| (((|NonNegativeInteger|) $) "\\spad{ncols(m)} returns the number of columns in the array \\spad{m}")) (|nrows| (((|NonNegativeInteger|) $) "\\spad{nrows(m)} returns the number of rows in the array \\spad{m}")) (|maxColIndex| (((|Integer|) $) "\\spad{maxColIndex(m)} returns the index of the 'last' column of the array \\spad{m}")) (|minColIndex| (((|Integer|) $) "\\spad{minColIndex(m)} returns the index of the 'first' column of the array \\spad{m}")) (|maxRowIndex| (((|Integer|) $) "\\spad{maxRowIndex(m)} returns the index of the 'last' row of the array \\spad{m}")) (|minRowIndex| (((|Integer|) $) "\\spad{minRowIndex(m)} returns the index of the 'first' row of the array \\spad{m}")) (|fill!| (($ $ |#1|) "\\spad{fill!(m,r)} fills \\spad{m} with \\spad{r}'s")) (|new| (($ (|NonNegativeInteger|) (|NonNegativeInteger|) |#1|) "\\spad{new(m,n,r)} is an \\spad{m}-by-\\spad{n} array all of whose entries are \\spad{r}")) (|finiteAggregate| ((|attribute|) "two-dimensional arrays are finite")) (|shallowlyMutable| ((|attribute|) "one may destructively alter arrays"))) -((-4424 . T) (-4425 . T)) +((-4423 . T) (-4424 . T)) 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}"))) -((-4425 . T) (-4424 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| |#1| (QUOTE (-860))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4424 . T) (-4423 . T)) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (-3955 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| |#1| (QUOTE (-859))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|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 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."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) -(-61 -3969) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102)))) +(-61 -3968) ((|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 -3969) +(-62 -3968) ((|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 -3969) +(-63 -3968) ((|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 -3969) +(-64 -3968) ((|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 -3969) +(-65 -3968) ((|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 -3969) +(-66 -3968) ((|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 -3969) +(-67 -3968) ((|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 -3969) +(-68 -3968) ((|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 -3969) +(-69 -3968) ((|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 -3969) +(-70 -3968) ((|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 -3969) +(-71 -3968) ((|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 -3969) +(-72 -3968) ((|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 -3969) +(-73 -3968) ((|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 -3969) +(-74 -3968) ((|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 -3969) +(-75 -3968) ((|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 -3969) +(-78 -3968) ((|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 -3969) +(-79 -3968) ((|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 -3969) +(-80 -3968) ((|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 -3969) +(-81 -3968) ((|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 -3969) +(-82 -3968) ((|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 -3969) +(-83 -3968) ((|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 -3969) +(-84 -3968) ((|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 -3969) +(-85 -3968) ((|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 -3969) +(-86 -3968) ((|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 -3969) +(-87 -3968) ((|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 -3969) +(-88 -3968) ((|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 -3969) +(-89 -3968) ((|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 @@ -294,8 +294,8 @@ NIL ((|HasCategory| |#1| (QUOTE (-376)))) (-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}."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102)))) (-92 S) ((|constructor| (NIL "This is the category of Spad abstract syntax trees."))) NIL @@ -318,15 +318,15 @@ NIL NIL (-97) ((|constructor| (NIL "\\axiomType{AttributeButtons} implements a database and associated adjustment mechanisms for a set of attributes. \\blankline For ODEs these attributes are \"stiffness\",{} \"stability\" (\\spadignore{i.e.} how much affect the cosine or sine component of the solution has on the stability of the result),{} \"accuracy\" and \"expense\" (\\spadignore{i.e.} how expensive is the evaluation of the ODE). All these have bearing on the cost of calculating the solution given that reducing the step-length to achieve greater accuracy requires considerable number of evaluations and calculations. \\blankline The effect of each of these attributes can be altered by increasing or decreasing the button value. \\blankline For Integration there is a button for increasing and decreasing the preset number of function evaluations for each method. This is automatically used by ANNA when a method fails due to insufficient workspace or where the limit of function evaluations has been reached before the required accuracy is achieved. \\blankline")) (|setButtonValue| (((|Float|) (|String|) (|String|) (|Float|)) "\\axiom{setButtonValue(attributeName,{}routineName,{}\\spad{n})} sets the value of the button of attribute \\spad{attributeName} to routine \\spad{routineName} to \\spad{n}. \\spad{n} must be in the range [0..1]. \\blankline \\axiom{attributeName} should be one of the values \"stiffness\",{} \"stability\",{} \"accuracy\",{} \"expense\" or \"functionEvaluations\".") (((|Float|) (|String|) (|Float|)) "\\axiom{setButtonValue(attributeName,{}\\spad{n})} sets the value of all buttons of attribute \\spad{attributeName} to \\spad{n}. \\spad{n} must be in the range [0..1]. \\blankline \\axiom{attributeName} should be one of the values \"stiffness\",{} \"stability\",{} \"accuracy\",{} \"expense\" or \"functionEvaluations\".")) (|setAttributeButtonStep| (((|Float|) (|Float|)) "\\axiom{setAttributeButtonStep(\\spad{n})} sets the value of the steps for increasing and decreasing the button values. \\axiom{\\spad{n}} must be greater than 0 and less than 1. The preset value is 0.5.")) (|resetAttributeButtons| (((|Void|)) "\\axiom{resetAttributeButtons()} resets the Attribute buttons to a neutral level.")) (|getButtonValue| (((|Float|) (|String|) (|String|)) "\\axiom{getButtonValue(routineName,{}attributeName)} returns the current value for the effect of the attribute \\axiom{attributeName} with routine \\axiom{routineName}. \\blankline \\axiom{attributeName} should be one of the values \"stiffness\",{} \"stability\",{} \"accuracy\",{} \"expense\" or \"functionEvaluations\".")) (|decrease| (((|Float|) (|String|)) "\\axiom{decrease(attributeName)} decreases the value for the effect of the attribute \\axiom{attributeName} with all routines. \\blankline \\axiom{attributeName} should be one of the values \"stiffness\",{} \"stability\",{} \"accuracy\",{} \"expense\" or \"functionEvaluations\".") (((|Float|) (|String|) (|String|)) "\\axiom{decrease(routineName,{}attributeName)} decreases the value for the effect of the attribute \\axiom{attributeName} with routine \\axiom{routineName}. \\blankline \\axiom{attributeName} should be one of the values \"stiffness\",{} \"stability\",{} \"accuracy\",{} \"expense\" or \"functionEvaluations\".")) (|increase| (((|Float|) (|String|)) "\\axiom{increase(attributeName)} increases the value for the effect of the attribute \\axiom{attributeName} with all routines. \\blankline \\axiom{attributeName} should be one of the values \"stiffness\",{} \"stability\",{} \"accuracy\",{} \"expense\" or \"functionEvaluations\".") (((|Float|) (|String|) (|String|)) "\\axiom{increase(routineName,{}attributeName)} increases the value for the effect of the attribute \\axiom{attributeName} with routine \\axiom{routineName}. \\blankline \\axiom{attributeName} should be one of the values \"stiffness\",{} \"stability\",{} \"accuracy\",{} \"expense\" or \"functionEvaluations\"."))) -((-4424 . T)) +((-4423 . T)) NIL (-98) ((|constructor| (NIL "This category exports the attributes in the AXIOM Library")) (|canonical| ((|attribute|) "\\spad{canonical} is \\spad{true} if and only if distinct elements have distinct data structures. For example,{} a domain of mathematical objects which has the \\spad{canonical} attribute means that two objects are mathematically equal if and only if their data structures are equal.")) (|multiplicativeValuation| ((|attribute|) "\\spad{multiplicativeValuation} implies \\spad{euclideanSize(a*b)=euclideanSize(a)*euclideanSize(b)}.")) (|additiveValuation| ((|attribute|) "\\spad{additiveValuation} implies \\spad{euclideanSize(a*b)=euclideanSize(a)+euclideanSize(b)}.")) (|noetherian| ((|attribute|) "\\spad{noetherian} is \\spad{true} if all of its ideals are finitely generated.")) (|central| ((|attribute|) "\\spad{central} is \\spad{true} if,{} given an algebra over a ring \\spad{R},{} the image of \\spad{R} is the center of the algebra,{} \\spadignore{i.e.} the set of members of the algebra which commute with all others is precisely the image of \\spad{R} in the algebra.")) (|partiallyOrderedSet| ((|attribute|) "\\spad{partiallyOrderedSet} is \\spad{true} if a set with \\spadop{<} which is transitive,{} but \\spad{not(a < b or a = b)} does not necessarily imply \\spad{b<a}.")) (|arbitraryPrecision| ((|attribute|) "\\spad{arbitraryPrecision} means the user can set the precision for subsequent calculations.")) (|canonicalsClosed| ((|attribute|) "\\spad{canonicalsClosed} is \\spad{true} if \\spad{unitCanonical(a)*unitCanonical(b) = unitCanonical(a*b)}.")) (|canonicalUnitNormal| ((|attribute|) "\\spad{canonicalUnitNormal} is \\spad{true} if we can choose a canonical representative for each class of associate elements,{} that is \\spad{associates?(a,b)} returns \\spad{true} if and only if \\spad{unitCanonical(a) = unitCanonical(b)}.")) (|noZeroDivisors| ((|attribute|) "\\spad{noZeroDivisors} is \\spad{true} if \\spad{x * y \\~~= 0} implies both \\spad{x} and \\spad{y} are non-zero.")) (|rightUnitary| ((|attribute|) "\\spad{rightUnitary} is \\spad{true} if \\spad{x * 1 = x} for all \\spad{x}.")) (|leftUnitary| ((|attribute|) "\\spad{leftUnitary} is \\spad{true} if \\spad{1 * x = x} for all \\spad{x}.")) (|unitsKnown| ((|attribute|) "\\spad{unitsKnown} is \\spad{true} if a monoid (a multiplicative semigroup with a 1) has \\spad{unitsKnown} means that the operation \\spadfun{recip} can only return \"failed\" if its argument is not a unit.")) (|shallowlyMutable| ((|attribute|) "\\spad{shallowlyMutable} is \\spad{true} if its values have immediate components that are updateable (mutable). Note: the properties of any component domain are irrevelant to the \\spad{shallowlyMutable} proper.")) (|commutative| ((|attribute| "*") "\\spad{commutative(\"*\")} is \\spad{true} if it has an operation \\spad{\"*\": (D,D) -> D} which is commutative.")) (|finiteAggregate| ((|attribute|) "\\spad{finiteAggregate} is \\spad{true} if it is an aggregate with a finite number of elements."))) -((-4424 . T) ((-4426 "*") . T) (-4425 . T) (-4421 . T) (-4419 . T) (-4418 . T) (-4417 . T) (-4422 . T) (-4416 . T) (-4415 . T) (-4414 . T) (-4413 . T) (-4412 . T) (-4420 . T) (-4423 . T) (|NullSquare| . T) (|JacobiIdentity| . T) (-4411 . T)) +((-4423 . T) ((-4425 "*") . T) (-4424 . T) (-4420 . T) (-4418 . T) (-4417 . T) (-4416 . T) (-4421 . T) (-4415 . T) (-4414 . T) (-4413 . T) (-4412 . T) (-4411 . T) (-4419 . T) (-4422 . T) (|NullSquare| . T) (|JacobiIdentity| . T) (-4410 . T)) NIL (-99 R) ((|constructor| (NIL "Automorphism \\spad{R} is the multiplicative group of automorphisms of \\spad{R}.")) (|morphism| (($ (|Mapping| |#1| |#1| (|Integer|))) "\\spad{morphism(f)} returns the morphism given by \\spad{f^n(x) = f(x,n)}.") (($ (|Mapping| |#1| |#1|) (|Mapping| |#1| |#1|)) "\\spad{morphism(f, g)} returns the invertible morphism given by \\spad{f},{} where \\spad{g} is the inverse of \\spad{f}..") (($ (|Mapping| |#1| |#1|)) "\\spad{morphism(f)} returns the non-invertible morphism given by \\spad{f}."))) -((-4421 . T)) +((-4420 . T)) NIL (-100 R UP) ((|constructor| (NIL "This package provides balanced factorisations of polynomials.")) (|balancedFactorisation| (((|Factored| |#2|) |#2| (|List| |#2|)) "\\spad{balancedFactorisation(a, [b1,...,bn])} returns a factorisation \\spad{a = p1^e1 ... pm^em} such that each \\spad{pi} is balanced with respect to \\spad{[b1,...,bm]}.") (((|Factored| |#2|) |#2| |#2|) "\\spad{balancedFactorisation(a, b)} returns a factorisation \\spad{a = p1^e1 ... pm^em} such that each \\spad{pi} is balanced with respect to \\spad{b}."))) @@ -342,15 +342,15 @@ NIL 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}."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|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 -((|HasAttribute| |#1| (QUOTE (-4426 "*")))) +((|HasAttribute| |#1| (QUOTE (-4425 "*")))) (-105) ((|bfEntry| (((|Record| (|:| |zeros| (|Stream| (|DoubleFloat|))) (|:| |ones| (|Stream| (|DoubleFloat|))) (|:| |singularities| (|Stream| (|DoubleFloat|)))) (|Symbol|)) "\\spad{bfEntry(k)} returns the entry in the \\axiomType{BasicFunctions} table corresponding to \\spad{k}")) (|bfKeys| (((|List| (|Symbol|))) "\\spad{bfKeys()} returns the names of each function in the \\axiomType{BasicFunctions} table"))) -((-4424 . T)) +((-4423 . T)) NIL (-106 A S) ((|constructor| (NIL "A bag aggregate is an aggregate for which one can insert and extract objects,{} and where the order in which objects are inserted determines the order of extraction. Examples of bags are stacks,{} queues,{} and dequeues.")) (|inspect| ((|#2| $) "\\spad{inspect(u)} returns an (random) element from a bag.")) (|insert!| (($ |#2| $) "\\spad{insert!(x,u)} inserts item \\spad{x} into bag \\spad{u}.")) (|extract!| ((|#2| $) "\\spad{extract!(u)} destructively removes a (random) item from bag \\spad{u}.")) (|bag| (($ (|List| |#2|)) "\\spad{bag([x,y,...,z])} creates a bag with elements \\spad{x},{}\\spad{y},{}...,{}\\spad{z}.")) (|shallowlyMutable| ((|attribute|) "shallowlyMutable means that elements of bags may be destructively changed."))) @@ -358,23 +358,23 @@ NIL NIL (-107 S) ((|constructor| (NIL "A bag aggregate is an aggregate for which one can insert and extract objects,{} and where the order in which objects are inserted determines the order of extraction. Examples of bags are stacks,{} queues,{} and dequeues.")) (|inspect| ((|#1| $) "\\spad{inspect(u)} returns an (random) element from a bag.")) (|insert!| (($ |#1| $) "\\spad{insert!(x,u)} inserts item \\spad{x} into bag \\spad{u}.")) (|extract!| ((|#1| $) "\\spad{extract!(u)} destructively removes a (random) item from bag \\spad{u}.")) (|bag| (($ (|List| |#1|)) "\\spad{bag([x,y,...,z])} creates a bag with elements \\spad{x},{}\\spad{y},{}...,{}\\spad{z}.")) (|shallowlyMutable| ((|attribute|) "shallowlyMutable means that elements of bags may be destructively changed."))) -((-4425 . T)) +((-4424 . T)) 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."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| (-558) (QUOTE (-928))) (|HasCategory| (-558) (|%list| (QUOTE -1058) (QUOTE (-1197)))) (|HasCategory| (-558) (QUOTE (-147))) (|HasCategory| (-558) (QUOTE (-149))) (|HasCategory| (-558) (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-558) (QUOTE (-1040))) (|HasCategory| (-558) (QUOTE (-841))) (|HasCategory| (-558) (QUOTE (-860))) (-3956 (|HasCategory| (-558) (QUOTE (-841))) (|HasCategory| (-558) (QUOTE (-860)))) (|HasCategory| (-558) (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| (-558) (QUOTE (-1172))) (|HasCategory| (-558) (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-558) (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-558) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-558) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-558) (QUOTE (-239))) (|HasCategory| (-558) (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| (-558) (QUOTE (-240))) (|HasCategory| (-558) (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| (-558) (|%list| (QUOTE -526) (QUOTE (-1197)) (QUOTE (-558)))) (|HasCategory| (-558) (|%list| (QUOTE -321) (QUOTE (-558)))) (|HasCategory| (-558) (|%list| (QUOTE -298) (QUOTE (-558)) (QUOTE (-558)))) (|HasCategory| (-558) (QUOTE (-319))) (|HasCategory| (-558) (QUOTE (-557))) (|HasCategory| (-558) (|%list| (QUOTE -657) (QUOTE (-558)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-558) (QUOTE (-928)))) (-3956 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-558) (QUOTE (-928)))) (|HasCategory| (-558) (QUOTE (-147))))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| (-557) (QUOTE (-927))) (|HasCategory| (-557) (|%list| (QUOTE -1057) (QUOTE (-1196)))) (|HasCategory| (-557) (QUOTE (-147))) (|HasCategory| (-557) (QUOTE (-149))) (|HasCategory| (-557) (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-557) (QUOTE (-1039))) (|HasCategory| (-557) (QUOTE (-840))) (|HasCategory| (-557) (QUOTE (-859))) (-3955 (|HasCategory| (-557) (QUOTE (-840))) (|HasCategory| (-557) (QUOTE (-859)))) (|HasCategory| (-557) (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| (-557) (QUOTE (-1171))) (|HasCategory| (-557) (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-557) (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-557) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-557) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-557) (QUOTE (-239))) (|HasCategory| (-557) (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| (-557) (QUOTE (-240))) (|HasCategory| (-557) (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| (-557) (|%list| (QUOTE -526) (QUOTE (-1196)) (QUOTE (-557)))) (|HasCategory| (-557) (|%list| (QUOTE -321) (QUOTE (-557)))) (|HasCategory| (-557) (|%list| (QUOTE -298) (QUOTE (-557)) (QUOTE (-557)))) (|HasCategory| (-557) (QUOTE (-319))) (|HasCategory| (-557) (QUOTE (-556))) (|HasCategory| (-557) (|%list| (QUOTE -656) (QUOTE (-557)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-557) (QUOTE (-927)))) (-3955 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-557) (QUOTE (-927)))) (|HasCategory| (-557) (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 NIL (-110) ((|constructor| (NIL "\\spadtype{Bits} provides logical functions for Indexed Bits.")) (|bits| (($ (|NonNegativeInteger|) (|Boolean|)) "\\spad{bits(n,b)} creates bits with \\spad{n} values of \\spad{b}"))) -((-4425 . T) (-4424 . T)) -((-12 (|HasCategory| (-114) (QUOTE (-1121))) (|HasCategory| (-114) (|%list| (QUOTE -321) (QUOTE (-114))))) (|HasCategory| (-114) (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-114) (QUOTE (-860))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| (-114) (QUOTE (-1121))) (|HasCategory| (-114) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-114) (QUOTE (-102)))) +((-4424 . T) (-4423 . T)) +((-12 (|HasCategory| (-114) (QUOTE (-1120))) (|HasCategory| (-114) (|%list| (QUOTE -321) (QUOTE (-114))))) (|HasCategory| (-114) (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-114) (QUOTE (-859))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| (-114) (QUOTE (-1120))) (|HasCategory| (-114) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-114) (QUOTE (-102)))) (-111 R S) ((|constructor| (NIL "A \\spadtype{BiModule} is both a left and right module with respect to potentially different rings. \\blankline")) (|rightUnitary| ((|attribute|) "\\spad{x * 1 = x}")) (|leftUnitary| ((|attribute|) "\\spad{1 * x = x}"))) -((-4419 . T) (-4418 . T)) +((-4418 . T) (-4417 . T)) NIL (-112 S) ((|constructor| (NIL "This is the category of Boolean logic structures.")) (|or| (($ $ $) "\\spad{x or y} returns the disjunction of \\spad{x} and \\spad{y}.")) (|and| (($ $ $) "\\spad{x and y} returns the conjunction of \\spad{x} and \\spad{y}.")) (|not| (($ $) "\\spad{not x} returns the complement or negation of \\spad{x}."))) @@ -396,22 +396,22 @@ 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 -3494 UP) +(-117 -3493 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 (-118 |p|) ((|constructor| (NIL "Stream-based implementation of Zp: \\spad{p}-adic numbers are represented as sum(\\spad{i} = 0..,{} a[\\spad{i}] * p^i),{} where the a[\\spad{i}] lie in -(\\spad{p} - 1)\\spad{/2},{}...,{}(\\spad{p} - 1)\\spad{/2}."))) -((-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) 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}."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| (-118 |#1|) (QUOTE (-928))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -1058) (QUOTE (-1197)))) (|HasCategory| (-118 |#1|) (QUOTE (-147))) (|HasCategory| (-118 |#1|) (QUOTE (-149))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-118 |#1|) (QUOTE (-1040))) (|HasCategory| (-118 |#1|) (QUOTE (-841))) (|HasCategory| (-118 |#1|) (QUOTE (-860))) (-3956 (|HasCategory| (-118 |#1|) (QUOTE (-841))) (|HasCategory| (-118 |#1|) (QUOTE (-860)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| (-118 |#1|) (QUOTE (-1172))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| (-118 |#1|) (QUOTE (-239))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| (-118 |#1|) (QUOTE (-240))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -526) (QUOTE (-1197)) (|%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 (-557))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-118 |#1|) (QUOTE (-928)))) (-3956 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-118 |#1|) (QUOTE (-928)))) (|HasCategory| (-118 |#1|) (QUOTE (-147))))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| (-118 |#1|) (QUOTE (-927))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -1057) (QUOTE (-1196)))) (|HasCategory| (-118 |#1|) (QUOTE (-147))) (|HasCategory| (-118 |#1|) (QUOTE (-149))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-118 |#1|) (QUOTE (-1039))) (|HasCategory| (-118 |#1|) (QUOTE (-840))) (|HasCategory| (-118 |#1|) (QUOTE (-859))) (-3955 (|HasCategory| (-118 |#1|) (QUOTE (-840))) (|HasCategory| (-118 |#1|) (QUOTE (-859)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| (-118 |#1|) (QUOTE (-1171))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| (-118 |#1|) (QUOTE (-239))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| (-118 |#1|) (QUOTE (-240))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -526) (QUOTE (-1196)) (|%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 (-556))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-118 |#1|) (QUOTE (-927)))) (-3955 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-118 |#1|) (QUOTE (-927)))) (|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 -((|HasAttribute| |#1| (QUOTE -4425))) +((|HasAttribute| |#1| (QUOTE -4424))) (-121 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 @@ -422,15 +422,15 @@ NIL 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"))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|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 NIL (-125) ((|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}}."))) -((-4425 . T) (-4424 . T)) +((-4424 . T) (-4423 . T)) NIL (-126 A S) ((|constructor| (NIL "\\spadtype{BinaryTreeCategory(S)} is the category of binary trees: a tree which is either empty or else is a \\spadfun{node} consisting of a value and a \\spadfun{left} and \\spadfun{right},{} both binary trees.")) (|node| (($ $ |#2| $) "\\spad{node(left,v,right)} creates a binary tree with value \\spad{v},{} a binary tree \\spad{left},{} and a binary tree \\spad{right}.")) (|finiteAggregate| ((|attribute|) "Binary trees have a finite number of components")) (|shallowlyMutable| ((|attribute|) "Binary trees have updateable components"))) @@ -438,24 +438,24 @@ NIL NIL (-127 S) ((|constructor| (NIL "\\spadtype{BinaryTreeCategory(S)} is the category of binary trees: a tree which is either empty or else is a \\spadfun{node} consisting of a value and a \\spadfun{left} and \\spadfun{right},{} both binary trees.")) (|node| (($ $ |#1| $) "\\spad{node(left,v,right)} creates a binary tree with value \\spad{v},{} a binary tree \\spad{left},{} and a binary tree \\spad{right}.")) (|finiteAggregate| ((|attribute|) "Binary trees have a finite number of components")) (|shallowlyMutable| ((|attribute|) "Binary trees have updateable components"))) -((-4424 . T) (-4425 . T)) +((-4423 . T) (-4424 . T)) 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."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|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."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|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 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."))) -((-4425 . T) (-4424 . T)) -((-3956 (-12 (|HasCategory| (-130) (QUOTE (-860))) (|HasCategory| (-130) (|%list| (QUOTE -321) (QUOTE (-130))))) (-12 (|HasCategory| (-130) (QUOTE (-1121))) (|HasCategory| (-130) (|%list| (QUOTE -321) (QUOTE (-130)))))) (-3956 (-12 (|HasCategory| (-130) (QUOTE (-1121))) (|HasCategory| (-130) (|%list| (QUOTE -321) (QUOTE (-130))))) (|HasCategory| (-130) (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| (-130) (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| (-130) (QUOTE (-860))) (|HasCategory| (-130) (QUOTE (-1121)))) (|HasCategory| (-130) (QUOTE (-860))) (-3956 (|HasCategory| (-130) (QUOTE (-102))) (|HasCategory| (-130) (QUOTE (-860))) (|HasCategory| (-130) (QUOTE (-1121)))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| (-130) (QUOTE (-1121))) (|HasCategory| (-130) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-130) (QUOTE (-102))) (-12 (|HasCategory| (-130) (QUOTE (-1121))) (|HasCategory| (-130) (|%list| (QUOTE -321) (QUOTE (-130)))))) +((-4424 . T) (-4423 . T)) +((-3955 (-12 (|HasCategory| (-130) (QUOTE (-859))) (|HasCategory| (-130) (|%list| (QUOTE -321) (QUOTE (-130))))) (-12 (|HasCategory| (-130) (QUOTE (-1120))) (|HasCategory| (-130) (|%list| (QUOTE -321) (QUOTE (-130)))))) (-3955 (-12 (|HasCategory| (-130) (QUOTE (-1120))) (|HasCategory| (-130) (|%list| (QUOTE -321) (QUOTE (-130))))) (|HasCategory| (-130) (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| (-130) (|%list| (QUOTE -629) (QUOTE (-546)))) (-3955 (|HasCategory| (-130) (QUOTE (-859))) (|HasCategory| (-130) (QUOTE (-1120)))) (|HasCategory| (-130) (QUOTE (-859))) (-3955 (|HasCategory| (-130) (QUOTE (-102))) (|HasCategory| (-130) (QUOTE (-859))) (|HasCategory| (-130) (QUOTE (-1120)))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| (-130) (QUOTE (-1120))) (|HasCategory| (-130) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-130) (QUOTE (-102))) (-12 (|HasCategory| (-130) (QUOTE (-1120))) (|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 @@ -474,13 +474,13 @@ NIL NIL (-136) ((|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."))) -(((-4426 "*") . T)) +(((-4425 "*") . T)) NIL -(-137 |minix| -3019 R) +(-137 |minix| -3018 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| -3019 S T$) +(-138 |minix| -3018 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 @@ -502,8 +502,8 @@ NIL 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}."))) -((-4424 . T) (-4414 . T) (-4425 . T)) -((-3956 (-12 (|HasCategory| (-146) (QUOTE (-381))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146))))) (-12 (|HasCategory| (-146) (QUOTE (-1121))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (|HasCategory| (-146) (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-146) (QUOTE (-381))) (|HasCategory| (-146) (QUOTE (-860))) (|HasCategory| (-146) (QUOTE (-1121))) (|HasCategory| (-146) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-146) (QUOTE (-102))) (-12 (|HasCategory| (-146) (QUOTE (-1121))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) +((-4423 . T) (-4413 . T) (-4424 . T)) +((-3955 (-12 (|HasCategory| (-146) (QUOTE (-381))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146))))) (-12 (|HasCategory| (-146) (QUOTE (-1120))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (|HasCategory| (-146) (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-146) (QUOTE (-381))) (|HasCategory| (-146) (QUOTE (-859))) (|HasCategory| (-146) (QUOTE (-1120))) (|HasCategory| (-146) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-146) (QUOTE (-102))) (-12 (|HasCategory| (-146) (QUOTE (-1120))) (|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 @@ -518,7 +518,7 @@ NIL NIL (-147) ((|constructor| (NIL "Rings of Characteristic Non Zero")) (|charthRoot| (((|Maybe| $) $) "\\spad{charthRoot(x)} returns the \\spad{p}th root of \\spad{x} where \\spad{p} is the characteristic of the ring."))) -((-4421 . T)) +((-4420 . T)) NIL (-148 R) ((|constructor| (NIL "This package provides a characteristicPolynomial function for any matrix over a commutative ring.")) (|characteristicPolynomial| ((|#1| (|Matrix| |#1|) |#1|) "\\spad{characteristicPolynomial(m,r)} computes the characteristic polynomial of the matrix \\spad{m} evaluated at the point \\spad{r}. In particular,{} if \\spad{r} is the polynomial 'x,{} then it returns the characteristic polynomial expressed as a polynomial in 'x."))) @@ -526,9 +526,9 @@ NIL NIL (-149) ((|constructor| (NIL "Rings of Characteristic Zero."))) -((-4421 . T)) +((-4420 . T)) NIL -(-150 -3494 UP UPUP) +(-150 -3493 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 @@ -539,14 +539,14 @@ NIL (-152 A S) ((|constructor| (NIL "A collection is a homogeneous aggregate which can built from list of members. The operation used to build the aggregate is generically named \\spadfun{construct}. However,{} each collection provides its own special function with the same name as the data type,{} except with an initial lower case letter,{} \\spadignore{e.g.} \\spadfun{list} for \\spadtype{List},{} \\spadfun{flexibleArray} for \\spadtype{FlexibleArray},{} and so on.")) (|removeDuplicates| (($ $) "\\spad{removeDuplicates(u)} returns a copy of \\spad{u} with all duplicates removed.")) (|select| (($ (|Mapping| (|Boolean|) |#2|) $) "\\spad{select(p,u)} returns a copy of \\spad{u} containing only those elements such \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}. Note: \\axiom{select(\\spad{p},{}\\spad{u}) == [\\spad{x} for \\spad{x} in \\spad{u} | \\spad{p}(\\spad{x})]}.")) (|remove| (($ |#2| $) "\\spad{remove(x,u)} returns a copy of \\spad{u} with all elements \\axiom{\\spad{y} = \\spad{x}} removed. Note: \\axiom{remove(\\spad{y},{}\\spad{c}) == [\\spad{x} for \\spad{x} in \\spad{c} | \\spad{x} ~= \\spad{y}]}.") (($ (|Mapping| (|Boolean|) |#2|) $) "\\spad{remove(p,u)} returns a copy of \\spad{u} removing all elements \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}. Note: \\axiom{remove(\\spad{p},{}\\spad{u}) == [\\spad{x} for \\spad{x} in \\spad{u} | not \\spad{p}(\\spad{x})]}.")) (|reduce| ((|#2| (|Mapping| |#2| |#2| |#2|) $ |#2| |#2|) "\\spad{reduce(f,u,x,z)} reduces the binary operation \\spad{f} across \\spad{u},{} stopping when an \"absorbing element\" \\spad{z} is encountered. As for \\axiom{reduce(\\spad{f},{}\\spad{u},{}\\spad{x})},{} \\spad{x} is the identity operation of \\spad{f}. Same as \\axiom{reduce(\\spad{f},{}\\spad{u},{}\\spad{x})} when \\spad{u} contains no element \\spad{z}. Thus the third argument \\spad{x} is returned when \\spad{u} is empty.") ((|#2| (|Mapping| |#2| |#2| |#2|) $ |#2|) "\\spad{reduce(f,u,x)} reduces the binary operation \\spad{f} across \\spad{u},{} where \\spad{x} is the identity operation of \\spad{f}. Same as \\axiom{reduce(\\spad{f},{}\\spad{u})} if \\spad{u} has 2 or more elements. Returns \\axiom{\\spad{f}(\\spad{x},{}\\spad{y})} if \\spad{u} has one element \\spad{y},{} \\spad{x} if \\spad{u} is empty. For example,{} \\axiom{reduce(+,{}\\spad{u},{}0)} returns the sum of the elements of \\spad{u}.") ((|#2| (|Mapping| |#2| |#2| |#2|) $) "\\spad{reduce(f,u)} reduces the binary operation \\spad{f} across \\spad{u}. For example,{} if \\spad{u} is \\axiom{[\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]} then \\axiom{reduce(\\spad{f},{}\\spad{u})} returns \\axiom{\\spad{f}(..\\spad{f}(\\spad{f}(\\spad{x},{}\\spad{y}),{}...),{}\\spad{z})}. Note: if \\spad{u} has one element \\spad{x},{} \\axiom{reduce(\\spad{f},{}\\spad{u})} returns \\spad{x}. Error: if \\spad{u} is empty.")) (|find| (((|Union| |#2| "failed") (|Mapping| (|Boolean|) |#2|) $) "\\spad{find(p,u)} returns the first \\spad{x} in \\spad{u} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true},{} and \"failed\" otherwise.")) (|construct| (($ (|List| |#2|)) "\\axiom{construct(\\spad{x},{}\\spad{y},{}...,{}\\spad{z})} returns the collection of elements \\axiom{\\spad{x},{}\\spad{y},{}...,{}\\spad{z}} ordered as given. Equivalently written as \\axiom{[\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]\\$\\spad{D}},{} where \\spad{D} is the domain. \\spad{D} may be omitted for those of type List."))) NIL -((|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasAttribute| |#1| (QUOTE -4424))) +((|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasAttribute| |#1| (QUOTE -4423))) (-153 S) ((|constructor| (NIL "A collection is a homogeneous aggregate which can built from list of members. The operation used to build the aggregate is generically named \\spadfun{construct}. However,{} each collection provides its own special function with the same name as the data type,{} except with an initial lower case letter,{} \\spadignore{e.g.} \\spadfun{list} for \\spadtype{List},{} \\spadfun{flexibleArray} for \\spadtype{FlexibleArray},{} and so on.")) (|removeDuplicates| (($ $) "\\spad{removeDuplicates(u)} returns a copy of \\spad{u} with all duplicates removed.")) (|select| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{select(p,u)} returns a copy of \\spad{u} containing only those elements such \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}. Note: \\axiom{select(\\spad{p},{}\\spad{u}) == [\\spad{x} for \\spad{x} in \\spad{u} | \\spad{p}(\\spad{x})]}.")) (|remove| (($ |#1| $) "\\spad{remove(x,u)} returns a copy of \\spad{u} with all elements \\axiom{\\spad{y} = \\spad{x}} removed. Note: \\axiom{remove(\\spad{y},{}\\spad{c}) == [\\spad{x} for \\spad{x} in \\spad{c} | \\spad{x} ~= \\spad{y}]}.") (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{remove(p,u)} returns a copy of \\spad{u} removing all elements \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}. Note: \\axiom{remove(\\spad{p},{}\\spad{u}) == [\\spad{x} for \\spad{x} in \\spad{u} | not \\spad{p}(\\spad{x})]}.")) (|reduce| ((|#1| (|Mapping| |#1| |#1| |#1|) $ |#1| |#1|) "\\spad{reduce(f,u,x,z)} reduces the binary operation \\spad{f} across \\spad{u},{} stopping when an \"absorbing element\" \\spad{z} is encountered. As for \\axiom{reduce(\\spad{f},{}\\spad{u},{}\\spad{x})},{} \\spad{x} is the identity operation of \\spad{f}. Same as \\axiom{reduce(\\spad{f},{}\\spad{u},{}\\spad{x})} when \\spad{u} contains no element \\spad{z}. Thus the third argument \\spad{x} is returned when \\spad{u} is empty.") ((|#1| (|Mapping| |#1| |#1| |#1|) $ |#1|) "\\spad{reduce(f,u,x)} reduces the binary operation \\spad{f} across \\spad{u},{} where \\spad{x} is the identity operation of \\spad{f}. Same as \\axiom{reduce(\\spad{f},{}\\spad{u})} if \\spad{u} has 2 or more elements. Returns \\axiom{\\spad{f}(\\spad{x},{}\\spad{y})} if \\spad{u} has one element \\spad{y},{} \\spad{x} if \\spad{u} is empty. For example,{} \\axiom{reduce(+,{}\\spad{u},{}0)} returns the sum of the elements of \\spad{u}.") ((|#1| (|Mapping| |#1| |#1| |#1|) $) "\\spad{reduce(f,u)} reduces the binary operation \\spad{f} across \\spad{u}. For example,{} if \\spad{u} is \\axiom{[\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]} then \\axiom{reduce(\\spad{f},{}\\spad{u})} returns \\axiom{\\spad{f}(..\\spad{f}(\\spad{f}(\\spad{x},{}\\spad{y}),{}...),{}\\spad{z})}. Note: if \\spad{u} has one element \\spad{x},{} \\axiom{reduce(\\spad{f},{}\\spad{u})} returns \\spad{x}. Error: if \\spad{u} is empty.")) (|find| (((|Union| |#1| "failed") (|Mapping| (|Boolean|) |#1|) $) "\\spad{find(p,u)} returns the first \\spad{x} in \\spad{u} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true},{} and \"failed\" otherwise.")) (|construct| (($ (|List| |#1|)) "\\axiom{construct(\\spad{x},{}\\spad{y},{}...,{}\\spad{z})} returns the collection of elements \\axiom{\\spad{x},{}\\spad{y},{}...,{}\\spad{z}} ordered as given. Equivalently written as \\axiom{[\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]\\$\\spad{D}},{} where \\spad{D} is the domain. \\spad{D} may be omitted for those of type List."))) NIL NIL (-154 |n| K Q) ((|constructor| (NIL "CliffordAlgebra(\\spad{n},{} \\spad{K},{} \\spad{Q}) defines a vector space of dimension \\spad{2**n} over \\spad{K},{} given a quadratic form \\spad{Q} on \\spad{K**n}. \\blankline If \\spad{e[i]},{} \\spad{1<=i<=n} is a basis for \\spad{K**n} then \\indented{3}{1,{} \\spad{e[i]} (\\spad{1<=i<=n}),{} \\spad{e[i1]*e[i2]}} (\\spad{1<=i1<i2<=n}),{}...,{}\\spad{e[1]*e[2]*..*e[n]} is a basis for the Clifford Algebra. \\blankline The algebra is defined by the relations \\indented{3}{\\spad{e[i]*e[j] = -e[j]*e[i]}\\space{2}(\\spad{i \\~~= j}),{}} \\indented{3}{\\spad{e[i]*e[i] = Q(e[i])}} \\blankline Examples of Clifford Algebras are: gaussians,{} quaternions,{} exterior algebras and spin algebras.")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(x)} computes the multiplicative inverse of \\spad{x} or \"failed\" if \\spad{x} is not invertible.")) (|coefficient| ((|#2| $ (|List| (|PositiveInteger|))) "\\spad{coefficient(x,[i1,i2,...,iN])} extracts the coefficient of \\spad{e(i1)*e(i2)*...*e(iN)} in \\spad{x}.")) (|monomial| (($ |#2| (|List| (|PositiveInteger|))) "\\spad{monomial(c,[i1,i2,...,iN])} produces the value given by \\spad{c*e(i1)*e(i2)*...*e(iN)}.")) (|e| (($ (|PositiveInteger|)) "\\spad{e(n)} produces the appropriate unit element."))) -((-4419 . T) (-4418 . T) (-4421 . T)) +((-4418 . T) (-4417 . T) (-4420 . T)) NIL (-155) ((|constructor| (NIL "\\indented{1}{The purpose of this package is to provide reasonable plots of} functions with singularities.")) (|clipWithRanges| (((|Record| (|:| |brans| (|List| (|List| (|Point| (|DoubleFloat|))))) (|:| |xValues| (|Segment| (|DoubleFloat|))) (|:| |yValues| (|Segment| (|DoubleFloat|)))) (|List| (|List| (|Point| (|DoubleFloat|)))) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "\\spad{clipWithRanges(pointLists,xMin,xMax,yMin,yMax)} performs clipping on a list of lists of points,{} \\spad{pointLists}. Clipping is done within the specified ranges of \\spad{xMin},{} \\spad{xMax} and \\spad{yMin},{} \\spad{yMax}. This function is used internally by the \\fakeAxiomFun{iClipParametric} subroutine in this package.")) (|clipParametric| (((|Record| (|:| |brans| (|List| (|List| (|Point| (|DoubleFloat|))))) (|:| |xValues| (|Segment| (|DoubleFloat|))) (|:| |yValues| (|Segment| (|DoubleFloat|)))) (|Plot|) (|Fraction| (|Integer|)) (|Fraction| (|Integer|))) "\\spad{clipParametric(p,frac,sc)} performs two-dimensional clipping on a plot,{} \\spad{p},{} from the domain \\spadtype{Plot} for the parametric curve \\spad{x = f(t)},{} \\spad{y = g(t)}; the fraction parameter is specified by \\spad{frac} and the scale parameter is specified by \\spad{sc} for use in the \\fakeAxiomFun{iClipParametric} subroutine,{} which is called by this function.") (((|Record| (|:| |brans| (|List| (|List| (|Point| (|DoubleFloat|))))) (|:| |xValues| (|Segment| (|DoubleFloat|))) (|:| |yValues| (|Segment| (|DoubleFloat|)))) (|Plot|)) "\\spad{clipParametric(p)} performs two-dimensional clipping on a plot,{} \\spad{p},{} from the domain \\spadtype{Plot} for the parametric curve \\spad{x = f(t)},{} \\spad{y = g(t)}; the default parameters \\spad{1/2} for the fraction and \\spad{5/1} for the scale are used in the \\fakeAxiomFun{iClipParametric} subroutine,{} which is called by this function.")) (|clip| (((|Record| (|:| |brans| (|List| (|List| (|Point| (|DoubleFloat|))))) (|:| |xValues| (|Segment| (|DoubleFloat|))) (|:| |yValues| (|Segment| (|DoubleFloat|)))) (|List| (|List| (|Point| (|DoubleFloat|))))) "\\spad{clip(ll)} performs two-dimensional clipping on a list of lists of points,{} \\spad{ll}; the default parameters \\spad{1/2} for the fraction and \\spad{5/1} for the scale are used in the \\fakeAxiomFun{iClipParametric} subroutine,{} which is called by this function.") (((|Record| (|:| |brans| (|List| (|List| (|Point| (|DoubleFloat|))))) (|:| |xValues| (|Segment| (|DoubleFloat|))) (|:| |yValues| (|Segment| (|DoubleFloat|)))) (|List| (|Point| (|DoubleFloat|)))) "\\spad{clip(l)} performs two-dimensional clipping on a curve \\spad{l},{} which is a list of points; the default parameters \\spad{1/2} for the fraction and \\spad{5/1} for the scale are used in the \\fakeAxiomFun{iClipParametric} subroutine,{} which is called by this function.") (((|Record| (|:| |brans| (|List| (|List| (|Point| (|DoubleFloat|))))) (|:| |xValues| (|Segment| (|DoubleFloat|))) (|:| |yValues| (|Segment| (|DoubleFloat|)))) (|Plot|) (|Fraction| (|Integer|)) (|Fraction| (|Integer|))) "\\spad{clip(p,frac,sc)} performs two-dimensional clipping on a plot,{} \\spad{p},{} from the domain \\spadtype{Plot} for the graph of one variable \\spad{y = f(x)}; the fraction parameter is specified by \\spad{frac} and the scale parameter is specified by \\spad{sc} for use in the \\spadfun{clip} function.") (((|Record| (|:| |brans| (|List| (|List| (|Point| (|DoubleFloat|))))) (|:| |xValues| (|Segment| (|DoubleFloat|))) (|:| |yValues| (|Segment| (|DoubleFloat|)))) (|Plot|)) "\\spad{clip(p)} performs two-dimensional clipping on a plot,{} \\spad{p},{} from the domain \\spadtype{Plot} for the graph of one variable,{} \\spad{y = f(x)}; the default parameters \\spad{1/4} for the fraction and \\spad{5/1} for the scale are used in the \\spadfun{clip} function."))) @@ -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 -3494) +(-160 R -3493) ((|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 @@ -599,10 +599,10 @@ NIL (-167 S R) ((|constructor| (NIL "This category represents the extension of a ring by a square root of \\spad{-1}.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(x)} returns \\spad{x} as a rational number,{} or \"failed\" if \\spad{x} is not a rational number.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(x)} returns \\spad{x} as a rational number. Error: if \\spad{x} is not a rational number.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(x)} tests if \\spad{x} is a rational number.")) (|polarCoordinates| (((|Record| (|:| |r| |#2|) (|:| |phi| |#2|)) $) "\\spad{polarCoordinates(x)} returns (\\spad{r},{} phi) such that \\spad{x} = \\spad{r} * exp(\\%\\spad{i} * phi).")) (|argument| ((|#2| $) "\\spad{argument(x)} returns the angle made by (0,{}1) and (0,{}\\spad{x}).")) (|abs| (($ $) "\\spad{abs(x)} returns the absolute value of \\spad{x} = sqrt(norm(\\spad{x})).")) (|exquo| (((|Union| $ "failed") $ |#2|) "\\spad{exquo(x, r)} returns the exact quotient of \\spad{x} by \\spad{r},{} or \"failed\" if \\spad{r} does not divide \\spad{x} exactly.")) (|norm| ((|#2| $) "\\spad{norm(x)} returns \\spad{x} * conjugate(\\spad{x})")) (|real| ((|#2| $) "\\spad{real(x)} returns real part of \\spad{x}.")) (|imag| ((|#2| $) "\\spad{imag(x)} returns imaginary part of \\spad{x}.")) (|conjugate| (($ $) "\\spad{conjugate(x + \\%i y)} returns \\spad{x} - \\%\\spad{i} \\spad{y}.")) (|imaginary| (($) "\\spad{imaginary()} = sqrt(\\spad{-1}) = \\%\\spad{i}.")) (|complex| (($ |#2| |#2|) "\\spad{complex(x,y)} constructs \\spad{x} + \\%i*y.") ((|attribute|) "indicates that \\% has sqrt(\\spad{-1})"))) NIL -((|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| |#2| (QUOTE (-557))) (|HasCategory| |#2| (QUOTE (-1022))) (|HasCategory| |#2| (QUOTE (-1223))) (|HasCategory| |#2| (QUOTE (-1080))) (|HasCategory| |#2| (QUOTE (-1040))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4420)) (|HasAttribute| |#2| (QUOTE -4423)) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (QUOTE (-569)))) +((|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| |#2| (QUOTE (-556))) (|HasCategory| |#2| (QUOTE (-1021))) (|HasCategory| |#2| (QUOTE (-1222))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1039))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4419)) (|HasAttribute| |#2| (QUOTE -4422)) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (QUOTE (-568)))) (-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})"))) -((-4417 -3956 (|has| |#1| (-569)) (-12 (|has| |#1| (-319)) (|has| |#1| (-928)))) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) (-4420 |has| |#1| (-6 -4420)) (-4423 |has| |#1| (-6 -4423)) (-1489 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 -3955 (|has| |#1| (-568)) (-12 (|has| |#1| (-319)) (|has| |#1| (-927)))) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) (-4419 |has| |#1| (-6 -4419)) (-4422 |has| |#1| (-6 -4422)) (-1488 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . 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}."))) -((-4417 -3956 (|has| |#1| (-569)) (-12 (|has| |#1| (-319)) (|has| |#1| (-928)))) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) (-4420 |has| |#1| (-6 -4420)) (-4423 |has| |#1| (-6 -4423)) (-1489 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-363))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-3956 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-363)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#1| (|%list| (QUOTE -918) (QUOTE (-1197))))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558)))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-928)))) (-12 (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-376)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-928)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-928)))) (-12 (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-928))))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasCategory| |#1| (QUOTE (-1022))) (|HasCategory| |#1| (QUOTE (-1223)))) (|HasCategory| |#1| (QUOTE (-1223))) (|HasCategory| |#1| (QUOTE (-1040))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-569)))) (-3956 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| |#1| (|%list| (QUOTE -526) (QUOTE (-1197)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-1080))) (-12 (|HasCategory| |#1| (QUOTE (-1080))) (|HasCategory| |#1| (QUOTE (-1223)))) (|HasCategory| |#1| (QUOTE (-557))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-928))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-376)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-569)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-239)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| |#1| (QUOTE (-240))) (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-928)))) (|HasAttribute| |#1| (QUOTE -4420)) (|HasAttribute| |#1| (QUOTE -4423)) (-12 (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -918) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-363)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) +((-4416 -3955 (|has| |#1| (-568)) (-12 (|has| |#1| (-319)) (|has| |#1| (-927)))) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) (-4419 |has| |#1| (-6 -4419)) (-4422 |has| |#1| (-6 -4422)) (-1488 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-363))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-3955 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-363)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#1| (|%list| (QUOTE -917) (QUOTE (-1196))))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557)))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-927)))) (-12 (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-376)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-927)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-927)))) (-12 (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-927))))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (QUOTE (-1021))) (|HasCategory| |#1| (QUOTE (-1222)))) (|HasCategory| |#1| (QUOTE (-1222))) (|HasCategory| |#1| (QUOTE (-1039))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (-3955 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-568)))) (-3955 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| |#1| (|%list| (QUOTE -526) (QUOTE (-1196)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-1079))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-1222)))) (|HasCategory| |#1| (QUOTE (-556))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-927))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-376)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-568)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-239)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| |#1| (QUOTE (-240))) (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-927)))) (|HasAttribute| |#1| (QUOTE -4419)) (|HasAttribute| |#1| (QUOTE -4422)) (-12 (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -917) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-363)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) (-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 @@ -630,7 +630,7 @@ NIL NIL (-175) ((|constructor| (NIL "The category of commutative rings with unity,{} \\spadignore{i.e.} rings where \\spadop{*} is commutative,{} and which have a multiplicative identity. element.")) (|commutative| ((|attribute| "*") "multiplication is commutative."))) -(((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +(((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-176) ((|constructor| (NIL "This category is the root of the I/O conduits.")) (|close!| (($ $) "\\spad{close!(c)} closes the conduit \\spad{c},{} changing its state to one that is invalid for future read or write operations."))) @@ -638,7 +638,7 @@ NIL NIL (-177 R) ((|constructor| (NIL "\\spadtype{ContinuedFraction} implements general \\indented{1}{continued fractions.\\space{2}This version is not restricted to simple,{}} \\indented{1}{finite fractions and uses the \\spadtype{Stream} as a} \\indented{1}{representation.\\space{2}The arithmetic functions assume that the} \\indented{1}{approximants alternate below/above the convergence point.} \\indented{1}{This is enforced by ensuring the partial numerators and partial} \\indented{1}{denominators are greater than 0 in the Euclidean domain view of \\spad{R}} \\indented{1}{(\\spadignore{i.e.} \\spad{sizeLess?(0, x)}).}")) (|complete| (($ $) "\\spad{complete(x)} causes all entries in \\spadvar{\\spad{x}} to be computed. Normally entries are only computed as needed. If \\spadvar{\\spad{x}} is an infinite continued fraction,{} a user-initiated interrupt is necessary to stop the computation.")) (|extend| (($ $ (|Integer|)) "\\spad{extend(x,n)} causes the first \\spadvar{\\spad{n}} entries in the continued fraction \\spadvar{\\spad{x}} to be computed. Normally entries are only computed as needed.")) (|denominators| (((|Stream| |#1|) $) "\\spad{denominators(x)} returns the stream of denominators of the approximants of the continued fraction \\spadvar{\\spad{x}}. If the continued fraction is finite,{} then the stream will be finite.")) (|numerators| (((|Stream| |#1|) $) "\\spad{numerators(x)} returns the stream of numerators of the approximants of the continued fraction \\spadvar{\\spad{x}}. If the continued fraction is finite,{} then the stream will be finite.")) (|convergents| (((|Stream| (|Fraction| |#1|)) $) "\\spad{convergents(x)} returns the stream of the convergents of the continued fraction \\spadvar{\\spad{x}}. If the continued fraction is finite,{} then the stream will be finite.")) (|approximants| (((|Stream| (|Fraction| |#1|)) $) "\\spad{approximants(x)} returns the stream of approximants of the continued fraction \\spadvar{\\spad{x}}. If the continued fraction is finite,{} then the stream will be infinite and periodic with period 1.")) (|reducedForm| (($ $) "\\spad{reducedForm(x)} puts the continued fraction \\spadvar{\\spad{x}} in reduced form,{} \\spadignore{i.e.} the function returns an equivalent continued fraction of the form \\spad{continuedFraction(b0,[1,1,1,...],[b1,b2,b3,...])}.")) (|wholePart| ((|#1| $) "\\spad{wholePart(x)} extracts the whole part of \\spadvar{\\spad{x}}. That is,{} if \\spad{x = continuedFraction(b0, [a1,a2,a3,...], [b1,b2,b3,...])},{} then \\spad{wholePart(x) = b0}.")) (|partialQuotients| (((|Stream| |#1|) $) "\\spad{partialQuotients(x)} extracts the partial quotients in \\spadvar{\\spad{x}}. That is,{} if \\spad{x = continuedFraction(b0, [a1,a2,a3,...], [b1,b2,b3,...])},{} then \\spad{partialQuotients(x) = [b0,b1,b2,b3,...]}.")) (|partialDenominators| (((|Stream| |#1|) $) "\\spad{partialDenominators(x)} extracts the denominators in \\spadvar{\\spad{x}}. That is,{} if \\spad{x = continuedFraction(b0, [a1,a2,a3,...], [b1,b2,b3,...])},{} then \\spad{partialDenominators(x) = [b1,b2,b3,...]}.")) (|partialNumerators| (((|Stream| |#1|) $) "\\spad{partialNumerators(x)} extracts the numerators in \\spadvar{\\spad{x}}. That is,{} if \\spad{x = continuedFraction(b0, [a1,a2,a3,...], [b1,b2,b3,...])},{} then \\spad{partialNumerators(x) = [a1,a2,a3,...]}.")) (|reducedContinuedFraction| (($ |#1| (|Stream| |#1|)) "\\spad{reducedContinuedFraction(b0,b)} constructs a continued fraction in the following way: if \\spad{b = [b1,b2,...]} then the result is the continued fraction \\spad{b0 + 1/(b1 + 1/(b2 + ...))}. That is,{} the result is the same as \\spad{continuedFraction(b0,[1,1,1,...],[b1,b2,b3,...])}.")) (|continuedFraction| (($ |#1| (|Stream| |#1|) (|Stream| |#1|)) "\\spad{continuedFraction(b0,a,b)} constructs a continued fraction in the following way: if \\spad{a = [a1,a2,...]} and \\spad{b = [b1,b2,...]} then the result is the continued fraction \\spad{b0 + a1/(b1 + a2/(b2 + ...))}.") (($ (|Fraction| |#1|)) "\\spad{continuedFraction(r)} converts the fraction \\spadvar{\\spad{r}} with components of type \\spad{R} to a continued fraction over \\spad{R}."))) -(((-4426 "*") . T) (-4417 . T) (-4422 . T) (-4416 . T) (-4418 . T) (-4419 . T) (-4421 . T)) +(((-4425 "*") . T) (-4416 . T) (-4421 . T) (-4415 . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-178) ((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: January 18,{} 2008. A `Contour' a list of bindings making up a `virtual scope'.")) (|findBinding| (((|Maybe| (|Binding|)) (|Identifier|) $) "\\spad{findBinding(c,n)} returns the first binding associated with `n'. Otherwise `nothing.")) (|push| (($ (|Binding|) $) "\\spad{push(c,b)} augments the contour with binding `b'.")) (|bindings| (((|List| (|Binding|)) $) "\\spad{bindings(c)} returns the list of bindings in countour \\spad{c}."))) @@ -655,7 +655,7 @@ NIL (-181 R S CS) ((|constructor| (NIL "This package supports matching patterns involving complex expressions")) (|patternMatch| (((|PatternMatchResult| |#1| |#3|) |#3| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#3|)) "\\spad{patternMatch(cexpr, pat, res)} matches the pattern \\spad{pat} to the complex expression \\spad{cexpr}. res contains the variables of \\spad{pat} which are already matched and their matches."))) NIL -((|HasCategory| (-964 |#2|) (|%list| (QUOTE -900) (|devaluate| |#1|)))) +((|HasCategory| (-963 |#2|) (|%list| (QUOTE -899) (|devaluate| |#1|)))) (-182 R) ((|constructor| (NIL "This package \\undocumented{}")) (|multiEuclideanTree| (((|List| |#1|) (|List| |#1|) |#1|) "\\spad{multiEuclideanTree(l,r)} \\undocumented{}")) (|chineseRemainder| (((|List| |#1|) (|List| (|List| |#1|)) (|List| |#1|)) "\\spad{chineseRemainder(llv,lm)} returns a list of values,{} each of which corresponds to the Chinese remainder of the associated element of \\axiom{\\spad{llv}} and axiom{\\spad{lm}}. This is more efficient than applying chineseRemainder several times.") ((|#1| (|List| |#1|) (|List| |#1|)) "\\spad{chineseRemainder(lv,lm)} returns a value \\axiom{\\spad{v}} such that,{} if \\spad{x} is \\axiom{\\spad{lv}.\\spad{i}} modulo \\axiom{\\spad{lm}.\\spad{i}} for all \\axiom{\\spad{i}},{} then \\spad{x} is \\axiom{\\spad{v}} modulo \\axiom{\\spad{lm}(1)*lm(2)*...*lm(\\spad{n})}.")) (|modTree| (((|List| |#1|) |#1| (|List| |#1|)) "\\spad{modTree(r,l)} \\undocumented{}"))) 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 -3494) +(-191 R -3493) ((|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 -3494 UP UPUP R) +(-219 -3493 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 -3494 FP) +(-220 -3493 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."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| (-558) (QUOTE (-928))) (|HasCategory| (-558) (|%list| (QUOTE -1058) (QUOTE (-1197)))) (|HasCategory| (-558) (QUOTE (-147))) (|HasCategory| (-558) (QUOTE (-149))) (|HasCategory| (-558) (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-558) (QUOTE (-1040))) (|HasCategory| (-558) (QUOTE (-841))) (|HasCategory| (-558) (QUOTE (-860))) (-3956 (|HasCategory| (-558) (QUOTE (-841))) (|HasCategory| (-558) (QUOTE (-860)))) (|HasCategory| (-558) (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| (-558) (QUOTE (-1172))) (|HasCategory| (-558) (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-558) (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-558) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-558) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-558) (QUOTE (-239))) (|HasCategory| (-558) (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| (-558) (QUOTE (-240))) (|HasCategory| (-558) (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| (-558) (|%list| (QUOTE -526) (QUOTE (-1197)) (QUOTE (-558)))) (|HasCategory| (-558) (|%list| (QUOTE -321) (QUOTE (-558)))) (|HasCategory| (-558) (|%list| (QUOTE -298) (QUOTE (-558)) (QUOTE (-558)))) (|HasCategory| (-558) (QUOTE (-319))) (|HasCategory| (-558) (QUOTE (-557))) (|HasCategory| (-558) (|%list| (QUOTE -657) (QUOTE (-558)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-558) (QUOTE (-928)))) (-3956 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-558) (QUOTE (-928)))) (|HasCategory| (-558) (QUOTE (-147))))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| (-557) (QUOTE (-927))) (|HasCategory| (-557) (|%list| (QUOTE -1057) (QUOTE (-1196)))) (|HasCategory| (-557) (QUOTE (-147))) (|HasCategory| (-557) (QUOTE (-149))) (|HasCategory| (-557) (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-557) (QUOTE (-1039))) (|HasCategory| (-557) (QUOTE (-840))) (|HasCategory| (-557) (QUOTE (-859))) (-3955 (|HasCategory| (-557) (QUOTE (-840))) (|HasCategory| (-557) (QUOTE (-859)))) (|HasCategory| (-557) (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| (-557) (QUOTE (-1171))) (|HasCategory| (-557) (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-557) (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-557) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-557) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-557) (QUOTE (-239))) (|HasCategory| (-557) (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| (-557) (QUOTE (-240))) (|HasCategory| (-557) (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| (-557) (|%list| (QUOTE -526) (QUOTE (-1196)) (QUOTE (-557)))) (|HasCategory| (-557) (|%list| (QUOTE -321) (QUOTE (-557)))) (|HasCategory| (-557) (|%list| (QUOTE -298) (QUOTE (-557)) (QUOTE (-557)))) (|HasCategory| (-557) (QUOTE (-319))) (|HasCategory| (-557) (QUOTE (-556))) (|HasCategory| (-557) (|%list| (QUOTE -656) (QUOTE (-557)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-557) (QUOTE (-927)))) (-3955 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-557) (QUOTE (-927)))) (|HasCategory| (-557) (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 -3494) +(-223 R -3493) ((|constructor| (NIL "\\spadtype{ElementaryFunctionDefiniteIntegration} provides functions to compute definite integrals of elementary functions.")) (|innerint| (((|Union| (|:| |f1| (|OrderedCompletion| |#2|)) (|:| |f2| (|List| (|OrderedCompletion| |#2|))) (|:| |fail| #1="failed") (|:| |pole| #2="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| #1#) (|:| |pole| #2#)) |#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| #1#) (|:| |pole| #2#)) |#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 @@ -834,19 +834,19 @@ NIL 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}."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|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}."))) -((-4421 . T)) +((-4420 . T)) NIL -(-228 R -3494) +(-228 R -3493) ((|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.")) (|nan?| (((|Boolean|) $) "\\spad{nan? x} holds if \\spad{x} is a Not a Number floating point data in the IEEE 754 sense.")) (|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}."))) -((-4199 . T) (-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4198 . T) (-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . 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)}.}"))) @@ -854,19 +854,19 @@ NIL 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}"))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-569))) (|HasAttribute| |#1| (QUOTE (-4426 "*"))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-568))) (|HasAttribute| |#1| (QUOTE (-4425 "*"))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|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 NIL (-233 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."))) -((-4425 . T)) +((-4424 . T)) NIL (-234 R) ((|constructor| (NIL "Differential extensions of a ring \\spad{R}. Given a differentiation on \\spad{R},{} extend it to a differentiation on \\%."))) -((-4421 . T)) +((-4420 . T)) NIL (-235 S T$) ((|constructor| (NIL "This category captures the interface of domains with a distinguished operation named \\spad{differentiate}. Usually,{} additional properties are wanted. For example,{} that it obeys the usual Leibniz identity of differentiation of product,{} in case of differential rings. One could also want \\spad{differentiate} to obey the chain rule when considering differential manifolds. The lack of specific requirement in this category is an implicit admission that currently \\Language{} is not expressive enough to express the most general notion of differentiation in an adequate manner,{} suitable for computational purposes.")) (D ((|#2| $) "\\spad{D x} is a shorthand for \\spad{differentiate x}")) (|differentiate| ((|#2| $) "\\spad{differentiate x} compute the derivative of \\spad{x}."))) @@ -878,7 +878,7 @@ NIL NIL (-237 R) ((|constructor| (NIL "An \\spad{R}-module equipped with a distinguised differential operator. If \\spad{R} is a differential ring,{} then differentiation on the module should extend differentiation on the differential ring \\spad{R}. The latter can be the null operator. In that case,{} the differentiation operator on the module is just an \\spad{R}-linear operator. For that reason,{} we do not require that the ring \\spad{R} be a DifferentialRing; \\blankline"))) -((-4419 . T) (-4418 . T)) +((-4418 . T) (-4417 . T)) NIL (-238 S) ((|constructor| (NIL "This category is like \\spadtype{DifferentialDomain} where the target of the differentiation operator is the same as its source.")) (D (($ $ (|NonNegativeInteger|)) "\\spad{D(x, n)} returns the \\spad{n}\\spad{-}th derivative of \\spad{x}.")) (|differentiate| (($ $ (|NonNegativeInteger|)) "\\spad{differentiate(x,n)} returns the \\spad{n}\\spad{-}th derivative of \\spad{x}."))) @@ -890,33 +890,33 @@ NIL NIL (-240) ((|constructor| (NIL "An ordinary differential ring,{} that is,{} a ring with an operation \\spadfun{differentiate}. \\blankline"))) -((-4421 . T)) +((-4420 . T)) NIL (-241 A S) ((|constructor| (NIL "This category is a collection of operations common to both categories \\spadtype{Dictionary} and \\spadtype{MultiDictionary}")) (|select!| (($ (|Mapping| (|Boolean|) |#2|) $) "\\spad{select!(p,d)} destructively changes dictionary \\spad{d} by removing all entries \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})} is not \\spad{true}.")) (|remove!| (($ (|Mapping| (|Boolean|) |#2|) $) "\\spad{remove!(p,d)} destructively changes dictionary \\spad{d} by removeing all entries \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}.") (($ |#2| $) "\\spad{remove!(x,d)} destructively changes dictionary \\spad{d} by removing all entries \\spad{y} such that \\axiom{\\spad{y} = \\spad{x}}.")) (|dictionary| (($ (|List| |#2|)) "\\spad{dictionary([x,y,...,z])} creates a dictionary consisting of entries \\axiom{\\spad{x},{}\\spad{y},{}...,{}\\spad{z}}.") (($) "\\spad{dictionary()}\\$\\spad{D} creates an empty dictionary of type \\spad{D}."))) NIL -((|HasAttribute| |#1| (QUOTE -4424))) +((|HasAttribute| |#1| (QUOTE -4423))) (-242 S) ((|constructor| (NIL "This category is a collection of operations common to both categories \\spadtype{Dictionary} and \\spadtype{MultiDictionary}")) (|select!| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{select!(p,d)} destructively changes dictionary \\spad{d} by removing all entries \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})} is not \\spad{true}.")) (|remove!| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{remove!(p,d)} destructively changes dictionary \\spad{d} by removeing all entries \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}.") (($ |#1| $) "\\spad{remove!(x,d)} destructively changes dictionary \\spad{d} by removing all entries \\spad{y} such that \\axiom{\\spad{y} = \\spad{x}}.")) (|dictionary| (($ (|List| |#1|)) "\\spad{dictionary([x,y,...,z])} creates a dictionary consisting of entries \\axiom{\\spad{x},{}\\spad{y},{}...,{}\\spad{z}}.") (($) "\\spad{dictionary()}\\$\\spad{D} creates an empty dictionary of type \\spad{D}."))) -((-4425 . T)) +((-4424 . T)) NIL (-243) ((|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 -3019 R) +(-244 S -3018 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 (-814))) (|HasCategory| |#3| (QUOTE (-860))) (|HasAttribute| |#3| (QUOTE -4421)) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (QUOTE (-745))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (QUOTE (-1121)))) -(-245 -3019 R) +((|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-813))) (|HasCategory| |#3| (QUOTE (-859))) (|HasAttribute| |#3| (QUOTE -4420)) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (QUOTE (-744))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (QUOTE (-1120)))) +(-245 -3018 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"))) -((-4418 |has| |#2| (-1069)) (-4419 |has| |#2| (-1069)) (-4421 |has| |#2| (-6 -4421)) (-4424 . T)) +((-4417 |has| |#2| (-1068)) (-4418 |has| |#2| (-1068)) (-4420 |has| |#2| (-6 -4420)) (-4423 . T)) NIL -(-246 -3019 R) +(-246 -3018 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."))) -((-4418 |has| |#2| (-1069)) (-4419 |has| |#2| (-1069)) (-4421 |has| |#2| (-6 -4421)) (-4424 . T)) -((-3956 (-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 (-745))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1069)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#2| (QUOTE (-376))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1069)))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (QUOTE (-745))) (|HasCategory| |#2| (QUOTE (-814))) (-3956 (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (QUOTE (-860)))) (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-381))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (-3956 (|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 (-745))) (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|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 (-745))) (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|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 (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|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 (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#2| (QUOTE (-240))) (-3956 (|HasCategory| |#2| (QUOTE (-240))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1069))))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -918) (QUOTE (-1197))))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#2| (QUOTE (-1121))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-745))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-745))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#2| (QUOTE (-1069)))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-745))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558)))))) (|HasCategory| (-558) (QUOTE (-860))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1069)))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -918) (QUOTE (-1197))))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#2| (QUOTE (-1069)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasAttribute| |#2| (QUOTE -4421)) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1069)))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))))) -(-247 -3019 A B) +((-4417 |has| |#2| (-1068)) (-4418 |has| |#2| (-1068)) (-4420 |has| |#2| (-6 -4420)) (-4423 . T)) +((-3955 (-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 (-744))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1068)))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#2| (QUOTE (-376))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1068)))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (QUOTE (-744))) (|HasCategory| |#2| (QUOTE (-813))) (-3955 (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (QUOTE (-859)))) (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-381))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (-3955 (|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 (-744))) (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|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 (-744))) (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|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 (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|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 (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#2| (QUOTE (-240))) (-3955 (|HasCategory| |#2| (QUOTE (-240))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1068))))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -917) (QUOTE (-1196))))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#2| (QUOTE (-1120))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-744))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-744))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#2| (QUOTE (-1068)))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-744))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557)))))) (|HasCategory| (-557) (QUOTE (-859))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1068)))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -917) (QUOTE (-1196))))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#2| (QUOTE (-1068)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasAttribute| |#2| (QUOTE -4420)) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1068)))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))))) +(-247 -3018 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 @@ -930,7 +930,7 @@ NIL NIL (-250) ((|constructor| (NIL "A division ring (sometimes called a skew field),{} \\spadignore{i.e.} a not necessarily commutative ring where all non-zero elements have multiplicative inverses.")) (|inv| (($ $) "\\spad{inv x} returns the multiplicative inverse of \\spad{x}. Error: if \\spad{x} is 0.")) (** (($ $ (|Integer|)) "\\spad{x**n} returns \\spad{x} raised to the integer power \\spad{n}."))) -((-4417 . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-251 S) ((|constructor| (NIL "A doubly-linked aggregate serves as a model for a doubly-linked list,{} that is,{} a list which can has links to both next and previous nodes and thus can be efficiently traversed in both directions.")) (|setnext!| (($ $ $) "\\spad{setnext!(u,v)} destructively sets the next node of doubly-linked aggregate \\spad{u} to \\spad{v},{} returning \\spad{v}.")) (|setprevious!| (($ $ $) "\\spad{setprevious!(u,v)} destructively sets the previous node of doubly-linked aggregate \\spad{u} to \\spad{v},{} returning \\spad{v}.")) (|concat!| (($ $ $) "\\spad{concat!(u,v)} destructively concatenates doubly-linked aggregate \\spad{v} to the end of doubly-linked aggregate \\spad{u}.")) (|next| (($ $) "\\spad{next(l)} returns the doubly-linked aggregate beginning with its next element. Error: if \\spad{l} has no next element. Note: \\axiom{next(\\spad{l}) = rest(\\spad{l})} and \\axiom{previous(next(\\spad{l})) = \\spad{l}}.")) (|previous| (($ $) "\\spad{previous(l)} returns the doubly-link list beginning with its previous element. Error: if \\spad{l} has no previous element. Note: \\axiom{next(previous(\\spad{l})) = \\spad{l}}.")) (|tail| (($ $) "\\spad{tail(l)} returns the doubly-linked aggregate \\spad{l} starting at its second element. Error: if \\spad{l} is empty.")) (|head| (($ $) "\\spad{head(l)} returns the first element of a doubly-linked aggregate \\spad{l}. Error: if \\spad{l} is empty.")) (|last| ((|#1| $) "\\spad{last(l)} returns the last element of a doubly-linked aggregate \\spad{l}. Error: if \\spad{l} is empty."))) @@ -938,20 +938,20 @@ NIL 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}"))) -((-4425 . T) (-4424 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| |#1| (QUOTE (-860))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4424 . T) (-4423 . T)) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (-3955 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| |#1| (QUOTE (-859))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|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 NIL (-254 R) ((|constructor| (NIL "Category of modules that extend differential rings. \\blankline"))) -((-4419 . T) (-4418 . T)) +((-4418 . T) (-4417 . T)) 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"))) -(((-4426 "*") |has| |#2| (-175)) (-4417 |has| |#2| (-569)) (-4422 |has| |#2| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#2| (QUOTE (-928))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-928)))) (-3956 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-928)))) (-3956 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-928)))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-175))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-569)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -630) (QUOTE (-547))))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4422)) (|HasCategory| |#2| (QUOTE (-464))) (-12 (|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#2| (QUOTE (-147))))) +(((-4425 "*") |has| |#2| (-175)) (-4416 |has| |#2| (-568)) (-4421 |has| |#2| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#2| (QUOTE (-927))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-927)))) (-3955 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-927)))) (-3955 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-927)))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-175))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-568)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -629) (QUOTE (-546))))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4421)) (|HasCategory| |#2| (QUOTE (-464))) (-12 (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|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,23 +966,23 @@ NIL NIL (-259 |n| R M S) ((|constructor| (NIL "This constructor provides a direct product type with a left matrix-module view."))) -((-4421 -3956 (-2960 (|has| |#4| (-1069)) (|has| |#4| (-240))) (|has| |#4| (-6 -4421)) (-2960 (|has| |#4| (-1069)) (|has| |#4| (-916 (-1197))))) (-4418 |has| |#4| (-1069)) (-4419 |has| |#4| (-1069)) (-4424 . T)) -((-3956 (-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 (-745))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-814))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-860))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1069))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|))) (|HasCategory| |#4| (|%list| (QUOTE -916) (QUOTE (-1197)))))) (|HasCategory| |#4| (QUOTE (-376))) (-3956 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (QUOTE (-1069)))) (-3956 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (QUOTE (-376)))) (|HasCategory| |#4| (QUOTE (-1069))) (|HasCategory| |#4| (QUOTE (-745))) (|HasCategory| |#4| (QUOTE (-814))) (-3956 (|HasCategory| |#4| (QUOTE (-814))) (|HasCategory| |#4| (QUOTE (-860)))) (|HasCategory| |#4| (QUOTE (-860))) (|HasCategory| |#4| (QUOTE (-381))) (-3956 (-12 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-1069))) (|HasCategory| |#4| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#4| (|%list| (QUOTE -916) (QUOTE (-1197)))))) (|HasCategory| |#4| (|%list| (QUOTE -916) (QUOTE (-1197)))) (-3956 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (QUOTE (-1069))) (|HasCategory| |#4| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#4| (QUOTE (-240))) (-3956 (|HasCategory| |#4| (QUOTE (-240))) (-12 (|HasCategory| |#4| (QUOTE (-239))) (|HasCategory| |#4| (QUOTE (-1069))))) (-3956 (-12 (|HasCategory| |#4| (QUOTE (-1069))) (|HasCategory| |#4| (|%list| (QUOTE -918) (QUOTE (-1197))))) (|HasCategory| |#4| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#4| (QUOTE (-1121))) (-3956 (-12 (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#4| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#4| (QUOTE (-745))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#4| (QUOTE (-814))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#4| (QUOTE (-860))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#4| (QUOTE (-1069))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))))) (-3956 (-12 (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-745))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-814))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-860))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#4| (QUOTE (-1069)))) (-3956 (-12 (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-745))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-814))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-860))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-1069))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558)))))) (|HasCategory| (-558) (QUOTE (-860))) (-12 (|HasCategory| |#4| (QUOTE (-1069))) (|HasCategory| |#4| (|%list| (QUOTE -657) (QUOTE (-558))))) (-3956 (-12 (|HasCategory| |#4| (QUOTE (-1069))) (|HasCategory| |#4| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| |#4| (QUOTE (-1069))) (|HasCategory| |#4| (|%list| (QUOTE -918) (QUOTE (-1197)))))) (-3956 (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (QUOTE (-1069)))) (-12 (|HasCategory| |#4| (QUOTE (-239))) (|HasCategory| |#4| (QUOTE (-1069))))) (-12 (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-3956 (-12 (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#4| (QUOTE (-1069)))) (-12 (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#4| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-3956 (-12 (|HasCategory| |#4| (QUOTE (-1069))) (|HasCategory| |#4| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasAttribute| |#4| (QUOTE -4421)) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (QUOTE (-1069))))) (-12 (|HasCategory| |#4| (QUOTE (-239))) (|HasCategory| |#4| (QUOTE (-1069)))) (-12 (|HasCategory| |#4| (QUOTE (-1069))) (|HasCategory| |#4| (|%list| (QUOTE -918) (QUOTE (-1197))))) (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (QUOTE (-23))) (|HasCategory| |#4| (QUOTE (-133))) (|HasCategory| |#4| (QUOTE (-25))) (|HasCategory| |#4| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#4| (QUOTE (-102))) (-12 (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|))))) +((-4420 -3955 (-2959 (|has| |#4| (-1068)) (|has| |#4| (-240))) (|has| |#4| (-6 -4420)) (-2959 (|has| |#4| (-1068)) (|has| |#4| (-915 (-1196))))) (-4417 |has| |#4| (-1068)) (-4418 |has| |#4| (-1068)) (-4423 . T)) +((-3955 (-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 (-744))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-813))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-859))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|))) (|HasCategory| |#4| (|%list| (QUOTE -915) (QUOTE (-1196)))))) (|HasCategory| |#4| (QUOTE (-376))) (-3955 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (QUOTE (-1068)))) (-3955 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (QUOTE (-376)))) (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (QUOTE (-744))) (|HasCategory| |#4| (QUOTE (-813))) (-3955 (|HasCategory| |#4| (QUOTE (-813))) (|HasCategory| |#4| (QUOTE (-859)))) (|HasCategory| |#4| (QUOTE (-859))) (|HasCategory| |#4| (QUOTE (-381))) (-3955 (-12 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#4| (|%list| (QUOTE -915) (QUOTE (-1196)))))) (|HasCategory| |#4| (|%list| (QUOTE -915) (QUOTE (-1196)))) (-3955 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#4| (QUOTE (-240))) (-3955 (|HasCategory| |#4| (QUOTE (-240))) (-12 (|HasCategory| |#4| (QUOTE (-239))) (|HasCategory| |#4| (QUOTE (-1068))))) (-3955 (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (|%list| (QUOTE -917) (QUOTE (-1196))))) (|HasCategory| |#4| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#4| (QUOTE (-1120))) (-3955 (-12 (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#4| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#4| (QUOTE (-744))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#4| (QUOTE (-813))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#4| (QUOTE (-859))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))))) (-3955 (-12 (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-744))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-813))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-859))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#4| (QUOTE (-1068)))) (-3955 (-12 (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-744))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-813))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-859))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557)))))) (|HasCategory| (-557) (QUOTE (-859))) (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (|%list| (QUOTE -656) (QUOTE (-557))))) (-3955 (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (|%list| (QUOTE -917) (QUOTE (-1196)))))) (-3955 (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (QUOTE (-1068)))) (-12 (|HasCategory| |#4| (QUOTE (-239))) (|HasCategory| |#4| (QUOTE (-1068))))) (-12 (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-3955 (-12 (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#4| (QUOTE (-1068)))) (-12 (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#4| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-3955 (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasAttribute| |#4| (QUOTE -4420)) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (QUOTE (-1068))))) (-12 (|HasCategory| |#4| (QUOTE (-239))) (|HasCategory| |#4| (QUOTE (-1068)))) (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (|%list| (QUOTE -917) (QUOTE (-1196))))) (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (QUOTE (-23))) (|HasCategory| |#4| (QUOTE (-133))) (|HasCategory| |#4| (QUOTE (-25))) (|HasCategory| |#4| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#4| (QUOTE (-102))) (-12 (|HasCategory| |#4| (QUOTE (-1120))) (|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."))) -((-4421 -3956 (-2960 (|has| |#3| (-1069)) (|has| |#3| (-240))) (|has| |#3| (-6 -4421)) (-2960 (|has| |#3| (-1069)) (|has| |#3| (-916 (-1197))))) (-4418 |has| |#3| (-1069)) (-4419 |has| |#3| (-1069)) (-4424 . T)) -((-3956 (-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 (-745))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-814))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-860))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197)))))) (|HasCategory| |#3| (QUOTE (-376))) (-3956 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1069)))) (-3956 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376)))) (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (QUOTE (-745))) (|HasCategory| |#3| (QUOTE (-814))) (-3956 (|HasCategory| |#3| (QUOTE (-814))) (|HasCategory| |#3| (QUOTE (-860)))) (|HasCategory| |#3| (QUOTE (-860))) (|HasCategory| |#3| (QUOTE (-381))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197)))))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197)))) (-3956 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#3| (QUOTE (-240))) (-3956 (|HasCategory| |#3| (QUOTE (-240))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1069))))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -918) (QUOTE (-1197))))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#3| (QUOTE (-1121))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-745))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-814))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-860))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-745))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-814))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-860))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#3| (QUOTE (-1069)))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-745))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-814))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-860))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558)))))) (|HasCategory| (-558) (QUOTE (-860))) (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -657) (QUOTE (-558))))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -918) (QUOTE (-1197)))))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1069)))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1069))))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#3| (QUOTE (-1069)))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasAttribute| |#3| (QUOTE -4421)) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1069))))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1069)))) (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -918) (QUOTE (-1197))))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#3| (QUOTE (-102))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))))) +((-4420 -3955 (-2959 (|has| |#3| (-1068)) (|has| |#3| (-240))) (|has| |#3| (-6 -4420)) (-2959 (|has| |#3| (-1068)) (|has| |#3| (-915 (-1196))))) (-4417 |has| |#3| (-1068)) (-4418 |has| |#3| (-1068)) (-4423 . T)) +((-3955 (-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 (-744))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-813))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-859))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196)))))) (|HasCategory| |#3| (QUOTE (-376))) (-3955 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1068)))) (-3955 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376)))) (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (QUOTE (-744))) (|HasCategory| |#3| (QUOTE (-813))) (-3955 (|HasCategory| |#3| (QUOTE (-813))) (|HasCategory| |#3| (QUOTE (-859)))) (|HasCategory| |#3| (QUOTE (-859))) (|HasCategory| |#3| (QUOTE (-381))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196)))))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196)))) (-3955 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#3| (QUOTE (-240))) (-3955 (|HasCategory| |#3| (QUOTE (-240))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1068))))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -917) (QUOTE (-1196))))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#3| (QUOTE (-1120))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-744))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-813))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-859))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-744))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-813))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-859))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#3| (QUOTE (-1068)))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-744))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-813))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-859))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557)))))) (|HasCategory| (-557) (QUOTE (-859))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -656) (QUOTE (-557))))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -917) (QUOTE (-1196)))))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1068)))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1068))))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#3| (QUOTE (-1068)))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasAttribute| |#3| (QUOTE -4420)) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1068))))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1068)))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -917) (QUOTE (-1196))))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#3| (QUOTE (-102))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|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 ((|HasCategory| |#2| (QUOTE (-240)))) (-262 R S V E) ((|constructor| (NIL "\\spadtype{DifferentialPolynomialCategory} is a category constructor specifying basic functions in an ordinary differential polynomial ring with a given ordered set of differential indeterminates. In addition,{} it implements defaults for the basic functions. The functions \\spadfun{order} and \\spadfun{weight} are extended from the set of derivatives of differential indeterminates to the set of differential polynomials. Other operations provided on differential polynomials are \\spadfun{leader},{} \\spadfun{initial},{} \\spadfun{separant},{} \\spadfun{differentialVariables},{} and \\spadfun{isobaric?}. Furthermore,{} if the ground ring is a differential ring,{} then evaluation (substitution of differential indeterminates by elements of the ground ring or by differential polynomials) is provided by \\spadfun{eval}. A convenient way of referencing derivatives is provided by the functions \\spadfun{makeVariable}. \\blankline To construct a domain using this constructor,{} one needs to provide a ground ring \\spad{R},{} an ordered set \\spad{S} of differential indeterminates,{} a ranking \\spad{V} on the set of derivatives of the differential indeterminates,{} and a set \\spad{E} of exponents in bijection with the set of differential monomials in the given differential indeterminates. \\blankline")) (|separant| (($ $) "\\spad{separant(p)} returns the partial derivative of the differential polynomial \\spad{p} with respect to its leader.")) (|initial| (($ $) "\\spad{initial(p)} returns the leading coefficient when the differential polynomial \\spad{p} is written as a univariate polynomial in its leader.")) (|leader| ((|#3| $) "\\spad{leader(p)} returns the derivative of the highest rank appearing in the differential polynomial \\spad{p} Note: an error occurs if \\spad{p} is in the ground ring.")) (|isobaric?| (((|Boolean|) $) "\\spad{isobaric?(p)} returns \\spad{true} if every differential monomial appearing in the differential polynomial \\spad{p} has same weight,{} and returns \\spad{false} otherwise.")) (|weight| (((|NonNegativeInteger|) $ |#2|) "\\spad{weight(p, s)} returns the maximum weight of all differential monomials appearing in the differential polynomial \\spad{p} when \\spad{p} is viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.") (((|NonNegativeInteger|) $) "\\spad{weight(p)} returns the maximum weight of all differential monomials appearing in the differential polynomial \\spad{p}.")) (|weights| (((|List| (|NonNegativeInteger|)) $ |#2|) "\\spad{weights(p, s)} returns a list of weights of differential monomials appearing in the differential polynomial \\spad{p} when \\spad{p} is viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.") (((|List| (|NonNegativeInteger|)) $) "\\spad{weights(p)} returns a list of weights of differential monomials appearing in differential polynomial \\spad{p}.")) (|degree| (((|NonNegativeInteger|) $ |#2|) "\\spad{degree(p, s)} returns the maximum degree of the differential polynomial \\spad{p} viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(p)} returns the order of the differential polynomial \\spad{p},{} which is the maximum number of differentiations of a differential indeterminate,{} among all those appearing in \\spad{p}.") (((|NonNegativeInteger|) $ |#2|) "\\spad{order(p,s)} returns the order of the differential polynomial \\spad{p} in differential indeterminate \\spad{s}.")) (|differentialVariables| (((|List| |#2|) $) "\\spad{differentialVariables(p)} returns a list of differential indeterminates occurring in a differential polynomial \\spad{p}.")) (|makeVariable| (((|Mapping| $ (|NonNegativeInteger|)) $) "\\spad{makeVariable(p)} views \\spad{p} as an element of a differential ring,{} in such a way that the \\spad{n}-th derivative of \\spad{p} may be simply referenced as \\spad{z}.\\spad{n} where \\spad{z} := makeVariable(\\spad{p}). Note: In the interpreter,{} \\spad{z} is given as an internal map,{} which may be ignored.") (((|Mapping| $ (|NonNegativeInteger|)) |#2|) "\\spad{makeVariable(s)} views \\spad{s} as a differential indeterminate,{} in such a way that the \\spad{n}-th derivative of \\spad{s} may be simply referenced as \\spad{z}.\\spad{n} where \\spad{z} :=makeVariable(\\spad{s}). Note: In the interpreter,{} \\spad{z} is given as an internal map,{} which may be ignored."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) NIL (-263 S) ((|constructor| (NIL "A dequeue is a doubly ended stack,{} that is,{} a bag where first items inserted are the first items extracted,{} at either the front or the back end of the data structure.")) (|reverse!| (($ $) "\\spad{reverse!(d)} destructively replaces \\spad{d} by its reverse dequeue,{} \\spadignore{i.e.} the top (front) element is now the bottom (back) element,{} and so on.")) (|extractBottom!| ((|#1| $) "\\spad{extractBottom!(d)} destructively extracts the bottom (back) element from the dequeue \\spad{d}. Error: if \\spad{d} is empty.")) (|extractTop!| ((|#1| $) "\\spad{extractTop!(d)} destructively extracts the top (front) element from the dequeue \\spad{d}. Error: if \\spad{d} is empty.")) (|insertBottom!| ((|#1| |#1| $) "\\spad{insertBottom!(x,d)} destructively inserts \\spad{x} into the dequeue \\spad{d} at the bottom (back) of the dequeue.")) (|insertTop!| ((|#1| |#1| $) "\\spad{insertTop!(x,d)} destructively inserts \\spad{x} into the dequeue \\spad{d},{} that is,{} at the top (front) of the dequeue. The element previously at the top of the dequeue becomes the second in the dequeue,{} and so on.")) (|bottom!| ((|#1| $) "\\spad{bottom!(d)} returns the element at the bottom (back) of the dequeue.")) (|top!| ((|#1| $) "\\spad{top!(d)} returns the element at the top (front) of the dequeue.")) (|height| (((|NonNegativeInteger|) $) "\\spad{height(d)} returns the number of elements in dequeue \\spad{d}. Note: \\axiom{height(\\spad{d}) = \\# \\spad{d}}.")) (|dequeue| (($ (|List| |#1|)) "\\spad{dequeue([x,y,...,z])} creates a dequeue with first (top or front) element \\spad{x},{} second element \\spad{y},{}...,{}and last (bottom or back) element \\spad{z}.") (($) "\\spad{dequeue()}\\$\\spad{D} creates an empty dequeue of type \\spad{D}."))) -((-4424 . T) (-4425 . T)) +((-4423 . T) (-4424 . T)) NIL (-264 |Ex|) ((|constructor| (NIL "TopLevelDrawFunctions provides top level functions for drawing graphics of expressions.")) (|makeObject| (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSurface| |#1|) (|SegmentBinding| (|Float|)) (|SegmentBinding| (|Float|))) "\\spad{makeObject(surface(f(u,v),g(u,v),h(u,v)),u = a..b,v = c..d)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric surface \\spad{x = f(u,v)},{} \\spad{y = g(u,v)},{} \\spad{z = h(u,v)} as \\spad{u} ranges from \\spad{min(a,b)} to \\spad{max(a,b)} and \\spad{v} ranges from \\spad{min(c,d)} to \\spad{max(c,d)}; \\spad{h(t)} is the default title.") (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSurface| |#1|) (|SegmentBinding| (|Float|)) (|SegmentBinding| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(surface(f(u,v),g(u,v),h(u,v)),u = a..b,v = c..d,l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric surface \\spad{x = f(u,v)},{} \\spad{y = g(u,v)},{} \\spad{z = h(u,v)} as \\spad{u} ranges from \\spad{min(a,b)} to \\spad{max(a,b)} and \\spad{v} ranges from \\spad{min(c,d)} to \\spad{max(c,d)}; \\spad{h(t)} is the default title,{} and the options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeSpace| (|DoubleFloat|)) |#1| (|SegmentBinding| (|Float|)) (|SegmentBinding| (|Float|))) "\\spad{makeObject(f(x,y),x = a..b,y = c..d)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of \\spad{z = f(x,y)} as \\spad{x} ranges from \\spad{min(a,b)} to \\spad{max(a,b)} and \\spad{y} ranges from \\spad{min(c,d)} to \\spad{max(c,d)}; \\spad{f(x,y)} appears as the default title.") (((|ThreeSpace| (|DoubleFloat|)) |#1| (|SegmentBinding| (|Float|)) (|SegmentBinding| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(f(x,y),x = a..b,y = c..d,l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of \\spad{z = f(x,y)} as \\spad{x} ranges from \\spad{min(a,b)} to \\spad{max(a,b)} and \\spad{y} ranges from \\spad{min(c,d)} to \\spad{max(c,d)}; \\spad{f(x,y)} is the default title,{} and the options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSpaceCurve| |#1|) (|SegmentBinding| (|Float|))) "\\spad{makeObject(curve(f(t),g(t),h(t)),t = a..b)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric curve \\spad{x = f(t)},{} \\spad{y = g(t)},{} \\spad{z = h(t)} as \\spad{t} ranges from \\spad{min(a,b)} to \\spad{max(a,b)}; \\spad{h(t)} is the default title.") (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSpaceCurve| |#1|) (|SegmentBinding| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(curve(f(t),g(t),h(t)),t = a..b,l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric curve \\spad{x = f(t)},{} \\spad{y = g(t)},{} \\spad{z = h(t)} as \\spad{t} ranges from \\spad{min(a,b)} to \\spad{max(a,b)}; \\spad{h(t)} is the default title,{} and the options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.")) (|draw| (((|ThreeDimensionalViewport|) (|ParametricSurface| |#1|) (|SegmentBinding| (|Float|)) (|SegmentBinding| (|Float|))) "\\spad{draw(surface(f(u,v),g(u,v),h(u,v)),u = a..b,v = c..d)} draws the graph of the parametric surface \\spad{x = f(u,v)},{} \\spad{y = g(u,v)},{} \\spad{z = h(u,v)} as \\spad{u} ranges from \\spad{min(a,b)} to \\spad{max(a,b)} and \\spad{v} ranges from \\spad{min(c,d)} to \\spad{max(c,d)}; \\spad{h(t)} is the default title.") (((|ThreeDimensionalViewport|) (|ParametricSurface| |#1|) (|SegmentBinding| (|Float|)) (|SegmentBinding| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(surface(f(u,v),g(u,v),h(u,v)),u = a..b,v = c..d,l)} draws the graph of the parametric surface \\spad{x = f(u,v)},{} \\spad{y = g(u,v)},{} \\spad{z = h(u,v)} as \\spad{u} ranges from \\spad{min(a,b)} to \\spad{max(a,b)} and \\spad{v} ranges from \\spad{min(c,d)} to \\spad{max(c,d)}; \\spad{h(t)} is the default title,{} and the options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) |#1| (|SegmentBinding| (|Float|)) (|SegmentBinding| (|Float|))) "\\spad{draw(f(x,y),x = a..b,y = c..d)} draws the graph of \\spad{z = f(x,y)} as \\spad{x} ranges from \\spad{min(a,b)} to \\spad{max(a,b)} and \\spad{y} ranges from \\spad{min(c,d)} to \\spad{max(c,d)}; \\spad{f(x,y)} appears in the title bar.") (((|ThreeDimensionalViewport|) |#1| (|SegmentBinding| (|Float|)) (|SegmentBinding| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(f(x,y),x = a..b,y = c..d,l)} draws the graph of \\spad{z = f(x,y)} as \\spad{x} ranges from \\spad{min(a,b)} to \\spad{max(a,b)} and \\spad{y} ranges from \\spad{min(c,d)} to \\spad{max(c,d)}; \\spad{f(x,y)} is the default title,{} and the options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|ParametricSpaceCurve| |#1|) (|SegmentBinding| (|Float|))) "\\spad{draw(curve(f(t),g(t),h(t)),t = a..b)} draws the graph of the parametric curve \\spad{x = f(t)},{} \\spad{y = g(t)},{} \\spad{z = h(t)} as \\spad{t} ranges from \\spad{min(a,b)} to \\spad{max(a,b)}; \\spad{h(t)} is the default title.") (((|ThreeDimensionalViewport|) (|ParametricSpaceCurve| |#1|) (|SegmentBinding| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(curve(f(t),g(t),h(t)),t = a..b,l)} draws the graph of the parametric curve \\spad{x = f(t)},{} \\spad{y = g(t)},{} \\spad{z = h(t)} as \\spad{t} ranges from \\spad{min(a,b)} to \\spad{max(a,b)}; \\spad{h(t)} is the default title,{} and the options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|TwoDimensionalViewport|) (|ParametricPlaneCurve| |#1|) (|SegmentBinding| (|Float|))) "\\spad{draw(curve(f(t),g(t)),t = a..b)} draws the graph of the parametric curve \\spad{x = f(t), y = g(t)} as \\spad{t} ranges from \\spad{min(a,b)} to \\spad{max(a,b)}; \\spad{(f(t),g(t))} appears in the title bar.") (((|TwoDimensionalViewport|) (|ParametricPlaneCurve| |#1|) (|SegmentBinding| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(curve(f(t),g(t)),t = a..b,l)} draws the graph of the parametric curve \\spad{x = f(t), y = g(t)} as \\spad{t} ranges from \\spad{min(a,b)} to \\spad{max(a,b)}; \\spad{(f(t),g(t))} is the default title,{} and the options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|TwoDimensionalViewport|) |#1| (|SegmentBinding| (|Float|))) "\\spad{draw(f(x),x = a..b)} draws the graph of \\spad{y = f(x)} as \\spad{x} ranges from \\spad{min(a,b)} to \\spad{max(a,b)}; \\spad{f(x)} appears in the title bar.") (((|TwoDimensionalViewport|) |#1| (|SegmentBinding| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(f(x),x = a..b,l)} draws the graph of \\spad{y = f(x)} as \\spad{x} ranges from \\spad{min(a,b)} to \\spad{max(a,b)}; \\spad{f(x)} is the default title,{} and the options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied."))) @@ -1023,15 +1023,15 @@ NIL (-273 S R) ((|constructor| (NIL "Extension of a base differential space with a derivation. \\blankline")) (D (($ $ (|Mapping| |#2| |#2|) (|NonNegativeInteger|)) "\\spad{D(x,d,n)} is a shorthand for \\spad{differentiate(x,d,n)}.") (($ $ (|Mapping| |#2| |#2|)) "\\spad{D(x,d)} is a shorthand for \\spad{differentiate(x,d)}.")) (|differentiate| (($ $ (|Mapping| |#2| |#2|) (|NonNegativeInteger|)) "\\spad{differentiate(x,d,n)} computes the \\spad{n}\\spad{-}th derivative of \\spad{x} using a derivation extending \\spad{d} on \\spad{R}.") (($ $ (|Mapping| |#2| |#2|)) "\\spad{differentiate(x,d)} computes the derivative of \\spad{x},{} extending differentiation \\spad{d} on \\spad{R}."))) NIL -((|HasCategory| |#2| (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| |#2| (QUOTE (-239)))) +((|HasCategory| |#2| (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| |#2| (QUOTE (-239)))) (-274 R) ((|constructor| (NIL "Extension of a base differential space with a derivation. \\blankline")) (D (($ $ (|Mapping| |#1| |#1|) (|NonNegativeInteger|)) "\\spad{D(x,d,n)} is a shorthand for \\spad{differentiate(x,d,n)}.") (($ $ (|Mapping| |#1| |#1|)) "\\spad{D(x,d)} is a shorthand for \\spad{differentiate(x,d)}.")) (|differentiate| (($ $ (|Mapping| |#1| |#1|) (|NonNegativeInteger|)) "\\spad{differentiate(x,d,n)} computes the \\spad{n}\\spad{-}th derivative of \\spad{x} using a derivation extending \\spad{d} on \\spad{R}.") (($ $ (|Mapping| |#1| |#1|)) "\\spad{differentiate(x,d)} computes the derivative of \\spad{x},{} extending differentiation \\spad{d} on \\spad{R}."))) NIL 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"))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-928))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| |#3| (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| |#3| (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| |#3| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| |#3| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#3| (|%list| (QUOTE -630) (QUOTE (-547))))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4422)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-927))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| |#3| (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| |#3| (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| |#3| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| |#3| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#3| (|%list| (QUOTE -629) (QUOTE (-546))))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4421)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|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 -3494) +(-287 R -3493) ((|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 -3494) +(-288 R -3493) ((|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 @@ -1103,10 +1103,10 @@ NIL (-293 A S) ((|constructor| (NIL "An extensible aggregate is one which allows insertion and deletion of entries. These aggregates are models of lists and streams which are represented by linked structures so as to make insertion,{} deletion,{} and concatenation efficient. However,{} access to elements of these extensible aggregates is generally slow since access is made from the end. See \\spadtype{FlexibleArray} for an exception.")) (|removeDuplicates!| (($ $) "\\spad{removeDuplicates!(u)} destructively removes duplicates from \\spad{u}.")) (|select!| (($ (|Mapping| (|Boolean|) |#2|) $) "\\spad{select!(p,u)} destructively changes \\spad{u} by keeping only values \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})}.")) (|merge!| (($ $ $) "\\spad{merge!(u,v)} destructively merges \\spad{u} and \\spad{v} in ascending order.") (($ (|Mapping| (|Boolean|) |#2| |#2|) $ $) "\\spad{merge!(p,u,v)} destructively merges \\spad{u} and \\spad{v} using predicate \\spad{p}.")) (|insert!| (($ $ $ (|Integer|)) "\\spad{insert!(v,u,i)} destructively inserts aggregate \\spad{v} into \\spad{u} at position \\spad{i}.") (($ |#2| $ (|Integer|)) "\\spad{insert!(x,u,i)} destructively inserts \\spad{x} into \\spad{u} at position \\spad{i}.")) (|remove!| (($ |#2| $) "\\spad{remove!(x,u)} destructively removes all values \\spad{x} from \\spad{u}.") (($ (|Mapping| (|Boolean|) |#2|) $) "\\spad{remove!(p,u)} destructively removes all elements \\spad{x} of \\spad{u} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}.")) (|delete!| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{delete!(u,i..j)} destructively deletes elements \\spad{u}.\\spad{i} through \\spad{u}.\\spad{j}.") (($ $ (|Integer|)) "\\spad{delete!(u,i)} destructively deletes the \\axiom{\\spad{i}}th element of \\spad{u}.")) (|concat!| (($ $ $) "\\spad{concat!(u,v)} destructively appends \\spad{v} to the end of \\spad{u}. \\spad{v} is unchanged") (($ $ |#2|) "\\spad{concat!(u,x)} destructively adds element \\spad{x} to the end of \\spad{u}."))) NIL -((|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-1121)))) +((|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-1120)))) (-294 S) ((|constructor| (NIL "An extensible aggregate is one which allows insertion and deletion of entries. These aggregates are models of lists and streams which are represented by linked structures so as to make insertion,{} deletion,{} and concatenation efficient. However,{} access to elements of these extensible aggregates is generally slow since access is made from the end. See \\spadtype{FlexibleArray} for an exception.")) (|removeDuplicates!| (($ $) "\\spad{removeDuplicates!(u)} destructively removes duplicates from \\spad{u}.")) (|select!| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{select!(p,u)} destructively changes \\spad{u} by keeping only values \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})}.")) (|merge!| (($ $ $) "\\spad{merge!(u,v)} destructively merges \\spad{u} and \\spad{v} in ascending order.") (($ (|Mapping| (|Boolean|) |#1| |#1|) $ $) "\\spad{merge!(p,u,v)} destructively merges \\spad{u} and \\spad{v} using predicate \\spad{p}.")) (|insert!| (($ $ $ (|Integer|)) "\\spad{insert!(v,u,i)} destructively inserts aggregate \\spad{v} into \\spad{u} at position \\spad{i}.") (($ |#1| $ (|Integer|)) "\\spad{insert!(x,u,i)} destructively inserts \\spad{x} into \\spad{u} at position \\spad{i}.")) (|remove!| (($ |#1| $) "\\spad{remove!(x,u)} destructively removes all values \\spad{x} from \\spad{u}.") (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{remove!(p,u)} destructively removes all elements \\spad{x} of \\spad{u} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}.")) (|delete!| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{delete!(u,i..j)} destructively deletes elements \\spad{u}.\\spad{i} through \\spad{u}.\\spad{j}.") (($ $ (|Integer|)) "\\spad{delete!(u,i)} destructively deletes the \\axiom{\\spad{i}}th element of \\spad{u}.")) (|concat!| (($ $ $) "\\spad{concat!(u,v)} destructively appends \\spad{v} to the end of \\spad{u}. \\spad{v} is unchanged") (($ $ |#1|) "\\spad{concat!(u,x)} destructively adds element \\spad{x} to the end of \\spad{u}."))) -((-4425 . T)) +((-4424 . T)) NIL (-295 S) ((|constructor| (NIL "Category for the elementary functions.")) (** (($ $ $) "\\spad{x**y} returns \\spad{x} to the power \\spad{y}.")) (|exp| (($ $) "\\spad{exp(x)} returns \\%\\spad{e} to the power \\spad{x}.")) (|log| (($ $) "\\spad{log(x)} returns the natural logarithm of \\spad{x}."))) @@ -1127,18 +1127,18 @@ NIL (-299 S |Dom| |Im|) ((|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!| ((|#3| $ |#2| |#3|) "\\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| ((|#3| $ |#2| |#3|) "\\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| ((|#3| $ |#2|) "\\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| ((|#3| $ |#2| |#3|) "\\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 -((|HasAttribute| |#1| (QUOTE -4425))) +((|HasAttribute| |#1| (QUOTE -4424))) (-300 |Dom| |Im|) ((|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| -2246 -3937 |exactQuo|) +(-301 S R |Mod| -2245 -3936 |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"))) -((-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-302) ((|constructor| (NIL "Entire Rings (non-commutative Integral Domains),{} \\spadignore{i.e.} a ring not necessarily commutative which has no zero divisors. \\blankline")) (|noZeroDivisors| ((|attribute|) "if a product is zero then one of the factors must be zero."))) -((-4417 . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-303) ((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: March 18,{} 2010. An `Environment' is a stack of scope.")) (|categoryFrame| (($) "the current category environment in the interpreter.")) (|interactiveEnv| (($) "the current interactive environment in effect.")) (|currentEnv| (($) "the current normal environment in effect.")) (|putProperties| (($ (|Identifier|) (|List| (|Property|)) $) "\\spad{putProperties(n,props,e)} set the list of properties of \\spad{n} to \\spad{props} in \\spad{e}.")) (|getProperties| (((|List| (|Property|)) (|Identifier|) $) "\\spad{getBinding(n,e)} returns the list of properties of \\spad{n} in \\spad{e}.")) (|putProperty| (($ (|Identifier|) (|Identifier|) (|SExpression|) $) "\\spad{putProperty(n,p,v,e)} binds the property \\spad{(p,v)} to \\spad{n} in the topmost scope of \\spad{e}.")) (|getProperty| (((|Maybe| (|SExpression|)) (|Identifier|) (|Identifier|) $) "\\spad{getProperty(n,p,e)} returns the value of property with name \\spad{p} for the symbol \\spad{n} in environment \\spad{e}. Otherwise,{} \\spad{nothing}.")) (|scopes| (((|List| (|Scope|)) $) "\\spad{scopes(e)} returns the stack of scopes in environment \\spad{e}.")) (|empty| (($) "\\spad{empty()} constructs an empty environment"))) @@ -1150,16 +1150,16 @@ 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."))) -((-4421 -3956 (|has| |#1| (-1069)) (|has| |#1| (-485))) (-4418 |has| |#1| (-1069)) (-4419 |has| |#1| (-1069))) -((|HasCategory| |#1| (QUOTE (-376))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1069)))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-1069))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (-3956 (|HasCategory| |#1| (QUOTE (-1069))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1069))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1069))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-1069)))) (-3956 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-745)))) (|HasCategory| |#1| (QUOTE (-485))) (-3956 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-745))) (|HasCategory| |#1| (QUOTE (-1069))) (|HasCategory| |#1| (QUOTE (-1132))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-745))) (|HasCategory| |#1| (QUOTE (-1132)))) (|HasCategory| |#1| (|%list| (QUOTE -526) (QUOTE (-1197)) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-310))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-485)))) (-3956 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-745)))) (-3956 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-1069)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1132))) (|HasCategory| |#1| (QUOTE (-745)))) +((-4420 -3955 (|has| |#1| (-1068)) (|has| |#1| (-485))) (-4417 |has| |#1| (-1068)) (-4418 |has| |#1| (-1068))) +((|HasCategory| |#1| (QUOTE (-376))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1068)))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (-3955 (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-1068)))) (-3955 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-744)))) (|HasCategory| |#1| (QUOTE (-485))) (-3955 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-744))) (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-744))) (|HasCategory| |#1| (QUOTE (-1131)))) (|HasCategory| |#1| (|%list| (QUOTE -526) (QUOTE (-1196)) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-310))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-485)))) (-3955 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-744)))) (-3955 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-1068)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-744)))) (-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 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."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4289) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2285) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -630) (QUOTE (-547)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-1121))) (-3956 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876))))) (-3956 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102)))) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4288) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2284) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -629) (QUOTE (-546)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-1120))) (-3955 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875))))) (-3955 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#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 @@ -1167,16 +1167,16 @@ NIL (-309 S) ((|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 -((|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-1069)))) +((|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-1068)))) (-310) ((|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 -3494 S) +(-311 -3493 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 -3494) +(-312 E -3493) ((|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 @@ -1206,7 +1206,7 @@ NIL NIL (-319) ((|constructor| (NIL "A constructive euclidean domain,{} \\spadignore{i.e.} one can divide producing a quotient and a remainder where the remainder is either zero or is smaller (\\spadfun{euclideanSize}) than the divisor. \\blankline Conditional attributes: \\indented{2}{multiplicativeValuation\\tab{25}\\spad{Size(a*b)=Size(a)*Size(b)}} \\indented{2}{additiveValuation\\tab{25}\\spad{Size(a*b)=Size(a)+Size(b)}}")) (|multiEuclidean| (((|Union| (|List| $) "failed") (|List| $) $) "\\spad{multiEuclidean([f1,...,fn],z)} returns a list of coefficients \\spad{[a1, ..., an]} such that \\spad{ z / prod fi = sum aj/fj}. If no such list of coefficients exists,{} \"failed\" is returned.")) (|extendedEuclidean| (((|Union| (|Record| (|:| |coef1| $) (|:| |coef2| $)) "failed") $ $ $) "\\spad{extendedEuclidean(x,y,z)} either returns a record rec where \\spad{rec.coef1*x+rec.coef2*y=z} or returns \"failed\" if \\spad{z} cannot be expressed as a linear combination of \\spad{x} and \\spad{y}.") (((|Record| (|:| |coef1| $) (|:| |coef2| $) (|:| |generator| $)) $ $) "\\spad{extendedEuclidean(x,y)} returns a record rec where \\spad{rec.coef1*x+rec.coef2*y = rec.generator} and rec.generator is a gcd of \\spad{x} and \\spad{y}. The gcd is unique only up to associates if \\spadatt{canonicalUnitNormal} is not asserted. \\spadfun{principalIdeal} provides a version of this operation which accepts an arbitrary length list of arguments.")) (|rem| (($ $ $) "\\spad{x rem y} is the same as \\spad{divide(x,y).remainder}. See \\spadfunFrom{divide}{EuclideanDomain}.")) (|quo| (($ $ $) "\\spad{x quo y} is the same as \\spad{divide(x,y).quotient}. See \\spadfunFrom{divide}{EuclideanDomain}.")) (|divide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{divide(x,y)} divides \\spad{x} by \\spad{y} producing a record containing a \\spad{quotient} and \\spad{remainder},{} where the remainder is smaller (see \\spadfunFrom{sizeLess?}{EuclideanDomain}) than the divisor \\spad{y}.")) (|euclideanSize| (((|NonNegativeInteger|) $) "\\spad{euclideanSize(x)} returns the euclidean size of the element \\spad{x}. Error: if \\spad{x} is zero.")) (|sizeLess?| (((|Boolean|) $ $) "\\spad{sizeLess?(x,y)} tests whether \\spad{x} is strictly smaller than \\spad{y} with respect to the \\spadfunFrom{euclideanSize}{EuclideanDomain}."))) -((-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-320 S R) ((|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| |#2|))) "\\spad{eval(f, [x1 = v1,...,xn = vn])} replaces \\spad{xi} by \\spad{vi} in \\spad{f}.") (($ $ (|Equation| |#2|)) "\\spad{eval(f,x = v)} replaces \\spad{x} by \\spad{v} in \\spad{f}."))) @@ -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 -3494) +(-322 -3493) ((|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 @@ -1230,12 +1230,12 @@ NIL 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))}."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-928))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -1058) (QUOTE (-1197)))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-147))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-149))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-1040))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-841))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-860))) (-3956 (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-841))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-860)))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-1172))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-239))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-240))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -526) (QUOTE (-1197)) (|%list| (QUOTE -1274) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -321) (|%list| (QUOTE -1274) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -298) (|%list| (QUOTE -1274) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)) (|%list| (QUOTE -1274) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-319))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-557))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-928)))) (-3956 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-928)))) (|HasCategory| (-1274 |#1| |#2| |#3| |#4|) (QUOTE (-147))))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (QUOTE (-927))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -1057) (QUOTE (-1196)))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (QUOTE (-147))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (QUOTE (-149))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (QUOTE (-1039))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (QUOTE (-840))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (QUOTE (-859))) (-3955 (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (QUOTE (-840))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (QUOTE (-859)))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (QUOTE (-1171))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (QUOTE (-239))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (QUOTE (-240))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -526) (QUOTE (-1196)) (|%list| (QUOTE -1273) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -321) (|%list| (QUOTE -1273) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -298) (|%list| (QUOTE -1273) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)) (|%list| (QUOTE -1273) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (QUOTE (-319))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (QUOTE (-556))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (QUOTE (-927)))) (-3955 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (QUOTE (-927)))) (|HasCategory| (-1273 |#1| |#2| |#3| |#4|) (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."))) -((-4421 -3956 (-12 (|has| |#1| (-569)) (-3956 (|has| |#1| (-1069)) (|has| |#1| (-485)))) (|has| |#1| (-1069)) (|has| |#1| (-485))) (-4419 |has| |#1| (-175)) (-4418 |has| |#1| (-175)) ((-4426 "*") |has| |#1| (-569)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-569)) (-4416 |has| |#1| (-569))) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (QUOTE (-569))) (-3956 (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-1069)))) (|HasCategory| |#1| (QUOTE (-21))) (-3956 (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-1069)))) (|HasCategory| |#1| (QUOTE (-1069))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-1069))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558)))))) (-3956 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-1132)))) (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| |#1| (QUOTE (-1069))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-3956 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-1069)))) (-3956 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-1069)))) (-3956 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-1069)))) (-12 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569)))) (-3956 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasCategory| |#1| (QUOTE (-1069))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1069))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-21)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1069))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1132)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1069))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-25)))) (-3956 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-1069)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1132))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| $ (QUOTE (-1069))) (|HasCategory| $ (|%list| (QUOTE -1058) (QUOTE (-558))))) +((-4420 -3955 (-12 (|has| |#1| (-568)) (-3955 (|has| |#1| (-1068)) (|has| |#1| (-485)))) (|has| |#1| (-1068)) (|has| |#1| (-485))) (-4418 |has| |#1| (-175)) (-4417 |has| |#1| (-175)) ((-4425 "*") |has| |#1| (-568)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-568)) (-4415 |has| |#1| (-568))) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (QUOTE (-568))) (-3955 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-1068)))) (|HasCategory| |#1| (QUOTE (-21))) (-3955 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-1068)))) (|HasCategory| |#1| (QUOTE (-1068))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557)))))) (-3955 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-1131)))) (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (-3955 (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-3955 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-1068)))) (-3955 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-1068)))) (-3955 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-1068)))) (-12 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568)))) (-3955 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-21)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1131)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-25)))) (-3955 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-1068)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| $ (QUOTE (-1068))) (|HasCategory| $ (|%list| (QUOTE -1057) (QUOTE (-557))))) (-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 -3494) +(-329 R -3493) ((|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 @@ -1254,8 +1254,8 @@ NIL 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."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-558)) (QUOTE (-1132))) (|HasCategory| |#1| (QUOTE (-376))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasSignature| |#1| (|%list| (QUOTE -4375) (|%list| (|devaluate| |#1|) (QUOTE (-1197)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-978))) (|HasCategory| |#1| (QUOTE (-1223))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasSignature| |#1| (|%list| (QUOTE -4241) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1197))))) (|HasSignature| |#1| (|%list| (QUOTE -3483) (|%list| (|%list| (QUOTE -660) (QUOTE (-1197))) (|devaluate| |#1|))))))) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-557)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-376))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasSignature| |#1| (|%list| (QUOTE -4374) (|%list| (|devaluate| |#1|) (QUOTE (-1196)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-977))) (|HasCategory| |#1| (QUOTE (-1222))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasSignature| |#1| (|%list| (QUOTE -4240) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1196))))) (|HasSignature| |#1| (|%list| (QUOTE -3482) (|%list| (|%list| (QUOTE -659) (QUOTE (-1196))) (|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 @@ -1266,8 +1266,8 @@ NIL NIL (-334 S) ((|constructor| (NIL "The free abelian group on a set \\spad{S} is the monoid of finite sums of the form \\spad{reduce(+,[ni * si])} where the \\spad{si}'s are in \\spad{S},{} and the \\spad{ni}'s are integers. The operation is commutative."))) -((-4419 . T) (-4418 . T)) -((|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| (-558) (QUOTE (-813)))) +((-4418 . T) (-4417 . T)) +((|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| (-557) (QUOTE (-812)))) (-335 S E) ((|constructor| (NIL "A free abelian monoid on a set \\spad{S} is the monoid of finite sums of the form \\spad{reduce(+,[ni * si])} where the \\spad{si}'s are in \\spad{S},{} and the \\spad{ni}'s are in a given abelian monoid. The operation is commutative.")) (|highCommonTerms| (($ $ $) "\\spad{highCommonTerms(e1 a1 + ... + en an, f1 b1 + ... + fm bm)} returns \\indented{2}{\\spad{reduce(+,[max(ei, fi) ci])}} where \\spad{ci} ranges in the intersection of \\spad{{a1,...,an}} and \\spad{{b1,...,bm}}.")) (|mapGen| (($ (|Mapping| |#1| |#1|) $) "\\spad{mapGen(f, e1 a1 +...+ en an)} returns \\spad{e1 f(a1) +...+ en f(an)}.")) (|mapCoef| (($ (|Mapping| |#2| |#2|) $) "\\spad{mapCoef(f, e1 a1 +...+ en an)} returns \\spad{f(e1) a1 +...+ f(en) an}.")) (|coefficient| ((|#2| |#1| $) "\\spad{coefficient(s, e1 a1 + ... + en an)} returns \\spad{ei} such that \\spad{ai} = \\spad{s},{} or 0 if \\spad{s} is not one of the \\spad{ai}'s.")) (|nthFactor| ((|#1| $ (|Integer|)) "\\spad{nthFactor(x, n)} returns the factor of the n^th term of \\spad{x}.")) (|nthCoef| ((|#2| $ (|Integer|)) "\\spad{nthCoef(x, n)} returns the coefficient of the n^th term of \\spad{x}.")) (|terms| (((|List| (|Record| (|:| |gen| |#1|) (|:| |exp| |#2|))) $) "\\spad{terms(e1 a1 + ... + en an)} returns \\spad{[[a1, e1],...,[an, en]]}.")) (|size| (((|NonNegativeInteger|) $) "\\spad{size(x)} returns the number of terms in \\spad{x}. mapGen(\\spad{f},{} \\spad{a1}\\^\\spad{e1} ... an\\^en) returns \\spad{f(a1)\\^e1 ... f(an)\\^en}.")) (* (($ |#2| |#1|) "\\spad{e * s} returns \\spad{e} times \\spad{s}.")) (+ (($ |#1| $) "\\spad{s + x} returns the sum of \\spad{s} and \\spad{x}."))) NIL @@ -1275,26 +1275,26 @@ NIL (-336 S) ((|constructor| (NIL "The free abelian monoid on a set \\spad{S} is the monoid of finite sums of the form \\spad{reduce(+,[ni * si])} where the \\spad{si}'s are in \\spad{S},{} and the \\spad{ni}'s are non-negative integers. The operation is commutative."))) NIL -((|HasCategory| (-790) (QUOTE (-813)))) +((|HasCategory| (-789) (QUOTE (-812)))) (-337 S R E) ((|constructor| (NIL "This category is similar to AbelianMonoidRing,{} except that the sum is assumed to be finite. It is a useful model for polynomials,{} but is somewhat more general.")) (|primitivePart| (($ $) "\\spad{primitivePart(p)} returns the unit normalized form of polynomial \\spad{p} divided by the content of \\spad{p}.")) (|content| ((|#2| $) "\\spad{content(p)} gives the gcd of the coefficients of polynomial \\spad{p}.")) (|exquo| (((|Union| $ "failed") $ |#2|) "\\spad{exquo(p,r)} returns the exact quotient of polynomial \\spad{p} by \\spad{r},{} or \"failed\" if none exists.")) (|binomThmExpt| (($ $ $ (|NonNegativeInteger|)) "\\spad{binomThmExpt(p,q,n)} returns \\spad{(x+y)^n} by means of the binomial theorem trick.")) (|pomopo!| (($ $ |#2| |#3| $) "\\spad{pomopo!(p1,r,e,p2)} returns \\spad{p1 + monomial(e,r) * p2} and may use \\spad{p1} as workspace. The constaant \\spad{r} is assumed to be nonzero.")) (|mapExponents| (($ (|Mapping| |#3| |#3|) $) "\\spad{mapExponents(fn,u)} maps function \\spad{fn} onto the exponents of the non-zero monomials of polynomial \\spad{u}.")) (|minimumDegree| ((|#3| $) "\\spad{minimumDegree(p)} gives the least exponent of a non-zero term of polynomial \\spad{p}. Error: if applied to 0.")) (|numberOfMonomials| (((|NonNegativeInteger|) $) "\\spad{numberOfMonomials(p)} gives the number of non-zero monomials in polynomial \\spad{p}.")) (|coefficients| (((|List| |#2|) $) "\\spad{coefficients(p)} gives the list of non-zero coefficients of polynomial \\spad{p}.")) (|ground| ((|#2| $) "\\spad{ground(p)} retracts polynomial \\spad{p} to the coefficient ring.")) (|ground?| (((|Boolean|) $) "\\spad{ground?(p)} tests if polynomial \\spad{p} is a member of the coefficient ring."))) NIL -((|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-175)))) +((|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-175)))) (-338 R E) ((|constructor| (NIL "This category is similar to AbelianMonoidRing,{} except that the sum is assumed to be finite. It is a useful model for polynomials,{} but is somewhat more general.")) (|primitivePart| (($ $) "\\spad{primitivePart(p)} returns the unit normalized form of polynomial \\spad{p} divided by the content of \\spad{p}.")) (|content| ((|#1| $) "\\spad{content(p)} gives the gcd of the coefficients of polynomial \\spad{p}.")) (|exquo| (((|Union| $ "failed") $ |#1|) "\\spad{exquo(p,r)} returns the exact quotient of polynomial \\spad{p} by \\spad{r},{} or \"failed\" if none exists.")) (|binomThmExpt| (($ $ $ (|NonNegativeInteger|)) "\\spad{binomThmExpt(p,q,n)} returns \\spad{(x+y)^n} by means of the binomial theorem trick.")) (|pomopo!| (($ $ |#1| |#2| $) "\\spad{pomopo!(p1,r,e,p2)} returns \\spad{p1 + monomial(e,r) * p2} and may use \\spad{p1} as workspace. The constaant \\spad{r} is assumed to be nonzero.")) (|mapExponents| (($ (|Mapping| |#2| |#2|) $) "\\spad{mapExponents(fn,u)} maps function \\spad{fn} onto the exponents of the non-zero monomials of polynomial \\spad{u}.")) (|minimumDegree| ((|#2| $) "\\spad{minimumDegree(p)} gives the least exponent of a non-zero term of polynomial \\spad{p}. Error: if applied to 0.")) (|numberOfMonomials| (((|NonNegativeInteger|) $) "\\spad{numberOfMonomials(p)} gives the number of non-zero monomials in polynomial \\spad{p}.")) (|coefficients| (((|List| |#1|) $) "\\spad{coefficients(p)} gives the list of non-zero coefficients of polynomial \\spad{p}.")) (|ground| ((|#1| $) "\\spad{ground(p)} retracts polynomial \\spad{p} to the coefficient ring.")) (|ground?| (((|Boolean|) $) "\\spad{ground?(p)} tests if polynomial \\spad{p} is a member of the coefficient ring."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4418 . T) (-4419 . T) (-4421 . T)) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4417 . T) (-4418 . T) (-4420 . T)) 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."))) -((-4425 . T) (-4424 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| |#1| (QUOTE (-860))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) -(-340 S -3494) +((-4424 . T) (-4423 . T)) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (-3955 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| |#1| (QUOTE (-859))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +(-340 S -3493) ((|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 -3494) +(-341 -3493) ((|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."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-342) ((|constructor| (NIL "This domain builds representations of program code segments for use with the FortranProgram domain.")) (|setLabelValue| (((|SingleInteger|) (|SingleInteger|)) "\\spad{setLabelValue(i)} resets the counter which produces labels to \\spad{i}")) (|getCode| (((|SExpression|) $) "\\spad{getCode(f)} returns a Lisp list of strings representing \\spad{f} in Fortran notation. This is used by the FortranProgram domain.")) (|printCode| (((|Void|) $) "\\spad{printCode(f)} prints out \\spad{f} in FORTRAN notation.")) (|code| (((|Union| (|:| |nullBranch| "null") (|:| |assignmentBranch| (|Record| (|:| |var| (|Symbol|)) (|:| |arrayIndex| (|List| (|Polynomial| (|Integer|)))) (|:| |rand| (|Record| (|:| |ints2Floats?| (|Boolean|)) (|:| |expr| (|OutputForm|)))))) (|:| |arrayAssignmentBranch| (|Record| (|:| |var| (|Symbol|)) (|:| |rand| (|OutputForm|)) (|:| |ints2Floats?| (|Boolean|)))) (|:| |conditionalBranch| (|Record| (|:| |switch| (|Switch|)) (|:| |thenClause| $) (|:| |elseClause| $))) (|:| |returnBranch| (|Record| (|:| |empty?| (|Boolean|)) (|:| |value| (|Record| (|:| |ints2Floats?| (|Boolean|)) (|:| |expr| (|OutputForm|)))))) (|:| |blockBranch| (|List| $)) (|:| |commentBranch| (|List| (|String|))) (|:| |callBranch| (|String|)) (|:| |forBranch| (|Record| (|:| |range| (|SegmentBinding| (|Polynomial| (|Integer|)))) (|:| |span| (|Polynomial| (|Integer|))) (|:| |body| $))) (|:| |labelBranch| (|SingleInteger|)) (|:| |loopBranch| (|Record| (|:| |switch| (|Switch|)) (|:| |body| $))) (|:| |commonBranch| (|Record| (|:| |name| (|Symbol|)) (|:| |contents| (|List| (|Symbol|))))) (|:| |printBranch| (|List| (|OutputForm|)))) $) "\\spad{code(f)} returns the internal representation of the object represented by \\spad{f}.")) (|operation| (((|Union| (|:| |Null| "null") (|:| |Assignment| "assignment") (|:| |Conditional| "conditional") (|:| |Return| "return") (|:| |Block| "block") (|:| |Comment| "comment") (|:| |Call| "call") (|:| |For| "for") (|:| |While| "while") (|:| |Repeat| "repeat") (|:| |Goto| "goto") (|:| |Continue| "continue") (|:| |ArrayAssignment| "arrayAssignment") (|:| |Save| "save") (|:| |Stop| "stop") (|:| |Common| "common") (|:| |Print| "print")) $) "\\spad{operation(f)} returns the name of the operation represented by \\spad{f}.")) (|common| (($ (|Symbol|) (|List| (|Symbol|))) "\\spad{common(name,contents)} creates a representation a named common block.")) (|printStatement| (($ (|List| (|OutputForm|))) "\\spad{printStatement(l)} creates a representation of a PRINT statement.")) (|save| (($) "\\spad{save()} creates a representation of a SAVE statement.")) (|stop| (($) "\\spad{stop()} creates a representation of a STOP statement.")) (|block| (($ (|List| $)) "\\spad{block(l)} creates a representation of the statements in \\spad{l} as a block.")) (|assign| (($ (|Symbol|) (|List| (|Polynomial| (|Integer|))) (|Expression| (|Complex| (|Float|)))) "\\spad{assign(x,l,y)} creates a representation of the assignment of \\spad{y} to the \\spad{l}\\spad{'}th element of array \\spad{x} (\\spad{l} is a list of indices).") (($ (|Symbol|) (|List| (|Polynomial| (|Integer|))) (|Expression| (|Float|))) "\\spad{assign(x,l,y)} creates a representation of the assignment of \\spad{y} to the \\spad{l}\\spad{'}th element of array \\spad{x} (\\spad{l} is a list of indices).") (($ (|Symbol|) (|List| (|Polynomial| (|Integer|))) (|Expression| (|Integer|))) "\\spad{assign(x,l,y)} creates a representation of the assignment of \\spad{y} to the \\spad{l}\\spad{'}th element of array \\spad{x} (\\spad{l} is a list of indices).") (($ (|Symbol|) (|Vector| (|Expression| (|Complex| (|Float|))))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Vector| (|Expression| (|Float|)))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Vector| (|Expression| (|Integer|)))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Matrix| (|Expression| (|Complex| (|Float|))))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Matrix| (|Expression| (|Float|)))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Matrix| (|Expression| (|Integer|)))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Expression| (|Complex| (|Float|)))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Expression| (|Float|))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Expression| (|Integer|))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|List| (|Polynomial| (|Integer|))) (|Expression| (|MachineComplex|))) "\\spad{assign(x,l,y)} creates a representation of the assignment of \\spad{y} to the \\spad{l}\\spad{'}th element of array \\spad{x} (\\spad{l} is a list of indices).") (($ (|Symbol|) (|List| (|Polynomial| (|Integer|))) (|Expression| (|MachineFloat|))) "\\spad{assign(x,l,y)} creates a representation of the assignment of \\spad{y} to the \\spad{l}\\spad{'}th element of array \\spad{x} (\\spad{l} is a list of indices).") (($ (|Symbol|) (|List| (|Polynomial| (|Integer|))) (|Expression| (|MachineInteger|))) "\\spad{assign(x,l,y)} creates a representation of the assignment of \\spad{y} to the \\spad{l}\\spad{'}th element of array \\spad{x} (\\spad{l} is a list of indices).") (($ (|Symbol|) (|Vector| (|Expression| (|MachineComplex|)))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Vector| (|Expression| (|MachineFloat|)))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Vector| (|Expression| (|MachineInteger|)))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Matrix| (|Expression| (|MachineComplex|)))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Matrix| (|Expression| (|MachineFloat|)))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Matrix| (|Expression| (|MachineInteger|)))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Vector| (|MachineComplex|))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Vector| (|MachineFloat|))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Vector| (|MachineInteger|))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Matrix| (|MachineComplex|))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Matrix| (|MachineFloat|))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Matrix| (|MachineInteger|))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Expression| (|MachineComplex|))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Expression| (|MachineFloat|))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|Expression| (|MachineInteger|))) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.") (($ (|Symbol|) (|String|)) "\\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.")) (|cond| (($ (|Switch|) $ $) "\\spad{cond(s,e,f)} creates a representation of the FORTRAN expression IF (\\spad{s}) THEN \\spad{e} ELSE \\spad{f}.") (($ (|Switch|) $) "\\spad{cond(s,e)} creates a representation of the FORTRAN expression IF (\\spad{s}) THEN \\spad{e}.")) (|returns| (($ (|Expression| (|Complex| (|Float|)))) "\\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.") (($ (|Expression| (|Integer|))) "\\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.") (($ (|Expression| (|Float|))) "\\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.") (($ (|Expression| (|MachineComplex|))) "\\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.") (($ (|Expression| (|MachineInteger|))) "\\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.") (($ (|Expression| (|MachineFloat|))) "\\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.") (($) "\\spad{returns()} creates a representation of a FORTRAN RETURN statement.")) (|call| (($ (|String|)) "\\spad{call(s)} creates a representation of a FORTRAN CALL statement")) (|comment| (($ (|List| (|String|))) "\\spad{comment(s)} creates a representation of the Strings \\spad{s} as a multi-line FORTRAN comment.") (($ (|String|)) "\\spad{comment(s)} creates a representation of the String \\spad{s} as a single FORTRAN comment.")) (|continue| (($ (|SingleInteger|)) "\\spad{continue(l)} creates a representation of a FORTRAN CONTINUE labelled with \\spad{l}")) (|goto| (($ (|SingleInteger|)) "\\spad{goto(l)} creates a representation of a FORTRAN GOTO statement")) (|repeatUntilLoop| (($ (|Switch|) $) "\\spad{repeatUntilLoop(s,c)} creates a repeat ... until loop in FORTRAN.")) (|whileLoop| (($ (|Switch|) $) "\\spad{whileLoop(s,c)} creates a while loop in FORTRAN.")) (|forLoop| (($ (|SegmentBinding| (|Polynomial| (|Integer|))) (|Polynomial| (|Integer|)) $) "\\spad{forLoop(i=1..10,n,c)} creates a representation of a FORTRAN DO loop with \\spad{i} ranging over the values 1 to 10 by \\spad{n}.") (($ (|SegmentBinding| (|Polynomial| (|Integer|))) $) "\\spad{forLoop(i=1..10,c)} creates a representation of a FORTRAN DO loop with \\spad{i} ranging over the values 1 to 10."))) @@ -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 -3494 UP UPUP R) +(-346 -3493 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,37 +1320,37 @@ 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 -3494 UP UPUP R) +(-348 S -3493 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 -3494 UP UPUP R) +(-349 -3493 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 (-350 S R) ((|constructor| (NIL "This category provides a selection of evaluation operations depending on what the argument type \\spad{R} provides.")) (|map| (($ (|Mapping| |#2| |#2|) $) "\\spad{map(f, ex)} evaluates ex,{} applying \\spad{f} to values of type \\spad{R} in ex."))) NIL -((|HasCategory| |#2| (|%list| (QUOTE -526) (QUOTE (-1197)) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) +((|HasCategory| |#2| (|%list| (QUOTE -526) (QUOTE (-1196)) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-351 R) ((|constructor| (NIL "This category provides a selection of evaluation operations depending on what the argument type \\spad{R} provides.")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(f, ex)} evaluates ex,{} applying \\spad{f} to values of type \\spad{R} in ex."))) NIL NIL (-352 |basicSymbols| |subscriptedSymbols| R) ((|constructor| (NIL "A domain of expressions involving functions which can be translated into standard Fortran-77,{} with some extra extensions from the NAG Fortran Library.")) (|useNagFunctions| (((|Boolean|) (|Boolean|)) "\\spad{useNagFunctions(v)} sets the flag which controls whether NAG functions \\indented{1}{are being used for mathematical and machine constants.\\space{2}The previous} \\indented{1}{value is returned.}") (((|Boolean|)) "\\spad{useNagFunctions()} indicates whether NAG functions are being used \\indented{1}{for mathematical and machine constants.}")) (|variables| (((|List| (|Symbol|)) $) "\\spad{variables(e)} return a list of all the variables in \\spad{e}.")) (|pi| (($) "\\spad{pi(x)} represents the NAG Library function X01AAF which returns \\indented{1}{an approximation to the value of \\spad{pi}}")) (|tanh| (($ $) "\\spad{tanh(x)} represents the Fortran intrinsic function TANH")) (|cosh| (($ $) "\\spad{cosh(x)} represents the Fortran intrinsic function COSH")) (|sinh| (($ $) "\\spad{sinh(x)} represents the Fortran intrinsic function SINH")) (|atan| (($ $) "\\spad{atan(x)} represents the Fortran intrinsic function ATAN")) (|acos| (($ $) "\\spad{acos(x)} represents the Fortran intrinsic function ACOS")) (|asin| (($ $) "\\spad{asin(x)} represents the Fortran intrinsic function ASIN")) (|tan| (($ $) "\\spad{tan(x)} represents the Fortran intrinsic function TAN")) (|cos| (($ $) "\\spad{cos(x)} represents the Fortran intrinsic function COS")) (|sin| (($ $) "\\spad{sin(x)} represents the Fortran intrinsic function SIN")) (|log10| (($ $) "\\spad{log10(x)} represents the Fortran intrinsic function \\spad{LOG10}")) (|log| (($ $) "\\spad{log(x)} represents the Fortran intrinsic function LOG")) (|exp| (($ $) "\\spad{exp(x)} represents the Fortran intrinsic function EXP")) (|sqrt| (($ $) "\\spad{sqrt(x)} represents the Fortran intrinsic function SQRT")) (|abs| (($ $) "\\spad{abs(x)} represents the Fortran intrinsic function ABS")) (|coerce| (((|Expression| |#3|) $) "\\spad{coerce(x)} \\undocumented{}")) (|retractIfCan| (((|Union| $ "failed") (|Polynomial| (|Float|))) "\\spad{retractIfCan(e)} takes \\spad{e} and tries to transform it into a \\indented{1}{FortranExpression checking that it contains no non-Fortran} \\indented{1}{functions,{} and that it only contains the given basic symbols} \\indented{1}{and subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}") (((|Union| $ "failed") (|Fraction| (|Polynomial| (|Float|)))) "\\spad{retractIfCan(e)} takes \\spad{e} and tries to transform it into a \\indented{1}{FortranExpression checking that it contains no non-Fortran} \\indented{1}{functions,{} and that it only contains the given basic symbols} \\indented{1}{and subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}") (((|Union| $ "failed") (|Expression| (|Float|))) "\\spad{retractIfCan(e)} takes \\spad{e} and tries to transform it into a \\indented{1}{FortranExpression checking that it contains no non-Fortran} \\indented{1}{functions,{} and that it only contains the given basic symbols} \\indented{1}{and subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}") (((|Union| $ "failed") (|Polynomial| (|Integer|))) "\\spad{retractIfCan(e)} takes \\spad{e} and tries to transform it into a \\indented{1}{FortranExpression checking that it contains no non-Fortran} \\indented{1}{functions,{} and that it only contains the given basic symbols} \\indented{1}{and subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}") (((|Union| $ "failed") (|Fraction| (|Polynomial| (|Integer|)))) "\\spad{retractIfCan(e)} takes \\spad{e} and tries to transform it into a \\indented{1}{FortranExpression checking that it contains no non-Fortran} \\indented{1}{functions,{} and that it only contains the given basic symbols} \\indented{1}{and subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}") (((|Union| $ "failed") (|Expression| (|Integer|))) "\\spad{retractIfCan(e)} takes \\spad{e} and tries to transform it into a \\indented{1}{FortranExpression checking that it contains no non-Fortran} \\indented{1}{functions,{} and that it only contains the given basic symbols} \\indented{1}{and subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}") (((|Union| $ "failed") (|Symbol|)) "\\spad{retractIfCan(e)} takes \\spad{e} and tries to transform it into a FortranExpression \\indented{1}{checking that it is one of the given basic symbols} \\indented{1}{or subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}") (((|Union| $ "failed") (|Expression| |#3|)) "\\spad{retractIfCan(e)} takes \\spad{e} and tries to transform it into a \\indented{1}{FortranExpression checking that it contains no non-Fortran} \\indented{1}{functions,{} and that it only contains the given basic symbols} \\indented{1}{and subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}")) (|retract| (($ (|Polynomial| (|Float|))) "\\spad{retract(e)} takes \\spad{e} and transforms it into a \\indented{1}{FortranExpression checking that it contains no non-Fortran} \\indented{1}{functions,{} and that it only contains the given basic symbols} \\indented{1}{and subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}") (($ (|Fraction| (|Polynomial| (|Float|)))) "\\spad{retract(e)} takes \\spad{e} and transforms it into a \\indented{1}{FortranExpression checking that it contains no non-Fortran} \\indented{1}{functions,{} and that it only contains the given basic symbols} \\indented{1}{and subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}") (($ (|Expression| (|Float|))) "\\spad{retract(e)} takes \\spad{e} and transforms it into a \\indented{1}{FortranExpression checking that it contains no non-Fortran} \\indented{1}{functions,{} and that it only contains the given basic symbols} \\indented{1}{and subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}") (($ (|Polynomial| (|Integer|))) "\\spad{retract(e)} takes \\spad{e} and transforms it into a \\indented{1}{FortranExpression checking that it contains no non-Fortran} \\indented{1}{functions,{} and that it only contains the given basic symbols} \\indented{1}{and subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}") (($ (|Fraction| (|Polynomial| (|Integer|)))) "\\spad{retract(e)} takes \\spad{e} and transforms it into a \\indented{1}{FortranExpression checking that it contains no non-Fortran} \\indented{1}{functions,{} and that it only contains the given basic symbols} \\indented{1}{and subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}") (($ (|Expression| (|Integer|))) "\\spad{retract(e)} takes \\spad{e} and transforms it into a \\indented{1}{FortranExpression checking that it contains no non-Fortran} \\indented{1}{functions,{} and that it only contains the given basic symbols} \\indented{1}{and subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}") (($ (|Symbol|)) "\\spad{retract(e)} takes \\spad{e} and transforms it into a FortranExpression \\indented{1}{checking that it is one of the given basic symbols} \\indented{1}{or subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}") (($ (|Expression| |#3|)) "\\spad{retract(e)} takes \\spad{e} and transforms it into a \\indented{1}{FortranExpression checking that it contains no non-Fortran} \\indented{1}{functions,{} and that it only contains the given basic symbols} \\indented{1}{and subscripted symbols which correspond to scalar and array} \\indented{1}{parameters respectively.}"))) -((-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-391)))) (|HasCategory| $ (QUOTE (-1069))) (|HasCategory| $ (|%list| (QUOTE -1058) (QUOTE (-558))))) +((-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-391)))) (|HasCategory| $ (QUOTE (-1068))) (|HasCategory| $ (|%list| (QUOTE -1057) (QUOTE (-557))))) (-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}."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((-3956 (|HasCategory| (-924 |#1|) (QUOTE (-147))) (|HasCategory| (-924 |#1|) (QUOTE (-381)))) (|HasCategory| (-924 |#1|) (QUOTE (-149))) (|HasCategory| (-924 |#1|) (QUOTE (-381))) (|HasCategory| (-924 |#1|) (QUOTE (-147)))) -(-354 S -3494 UP UPUP) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((-3955 (|HasCategory| (-923 |#1|) (QUOTE (-147))) (|HasCategory| (-923 |#1|) (QUOTE (-381)))) (|HasCategory| (-923 |#1|) (QUOTE (-149))) (|HasCategory| (-923 |#1|) (QUOTE (-381))) (|HasCategory| (-923 |#1|) (QUOTE (-147)))) +(-354 S -3493 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 -3494 UP UPUP) +(-355 -3493 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."))) -((-4417 |has| (-419 |#2|) (-376)) (-4422 |has| (-419 |#2|) (-376)) (-4416 |has| (-419 |#2|) (-376)) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 |has| (-419 |#2|) (-376)) (-4421 |has| (-419 |#2|) (-376)) (-4415 |has| (-419 |#2|) (-376)) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-356 R1 UP1 UPUP1 F1 R2 UP2 UPUP2 F2) ((|constructor| (NIL "Lifts a map from rings to function fields over them.")) (|map| ((|#8| (|Mapping| |#5| |#1|) |#4|) "\\spad{map(f, p)} lifts \\spad{f} to \\spad{F1} and applies it to \\spad{p}."))) @@ -1358,16 +1358,16 @@ NIL 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."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((-3956 (|HasCategory| (-924 |#1|) (QUOTE (-147))) (|HasCategory| (-924 |#1|) (QUOTE (-381)))) (|HasCategory| (-924 |#1|) (QUOTE (-149))) (|HasCategory| (-924 |#1|) (QUOTE (-381))) (|HasCategory| (-924 |#1|) (QUOTE (-147)))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((-3955 (|HasCategory| (-923 |#1|) (QUOTE (-147))) (|HasCategory| (-923 |#1|) (QUOTE (-381)))) (|HasCategory| (-923 |#1|) (QUOTE (-149))) (|HasCategory| (-923 |#1|) (QUOTE (-381))) (|HasCategory| (-923 |#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."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((-3956 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((-3955 (|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."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((-3956 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((-3955 (|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 @@ -1382,51 +1382,51 @@ NIL NIL (-363) ((|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."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-364 R UP -3494) +(-364 R UP -3493) ((|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."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((-3956 (|HasCategory| (-924 |#1|) (QUOTE (-147))) (|HasCategory| (-924 |#1|) (QUOTE (-381)))) (|HasCategory| (-924 |#1|) (QUOTE (-149))) (|HasCategory| (-924 |#1|) (QUOTE (-381))) (|HasCategory| (-924 |#1|) (QUOTE (-147)))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((-3955 (|HasCategory| (-923 |#1|) (QUOTE (-147))) (|HasCategory| (-923 |#1|) (QUOTE (-381)))) (|HasCategory| (-923 |#1|) (QUOTE (-149))) (|HasCategory| (-923 |#1|) (QUOTE (-381))) (|HasCategory| (-923 |#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."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((-3956 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((-3955 (|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."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((-3956 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((-3955 (|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."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((-3956 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((-3955 (|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 -3494 GF) +(-370 -3493 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 -3494 FP FPP) +(-371 -3493 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}."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((-3956 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((-3955 (|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 NIL (-374 S) ((|constructor| (NIL "The free group on a set \\spad{S} is the group of finite products of the form \\spad{reduce(*,[si ** ni])} where the \\spad{si}'s are in \\spad{S},{} and the \\spad{ni}'s are integers. The multiplication is not commutative.")) (|factors| (((|List| (|Record| (|:| |gen| |#1|) (|:| |exp| (|Integer|)))) $) "\\spad{factors(a1\\^e1,...,an\\^en)} returns \\spad{[[a1, e1],...,[an, en]]}.")) (|mapGen| (($ (|Mapping| |#1| |#1|) $) "\\spad{mapGen(f, a1\\^e1 ... an\\^en)} returns \\spad{f(a1)\\^e1 ... f(an)\\^en}.")) (|mapExpon| (($ (|Mapping| (|Integer|) (|Integer|)) $) "\\spad{mapExpon(f, a1\\^e1 ... an\\^en)} returns \\spad{a1\\^f(e1) ... an\\^f(en)}.")) (|nthFactor| ((|#1| $ (|Integer|)) "\\spad{nthFactor(x, n)} returns the factor of the n^th monomial of \\spad{x}.")) (|nthExpon| (((|Integer|) $ (|Integer|)) "\\spad{nthExpon(x, n)} returns the exponent of the n^th monomial of \\spad{x}.")) (|size| (((|NonNegativeInteger|) $) "\\spad{size(x)} returns the number of monomials in \\spad{x}.")) (** (($ |#1| (|Integer|)) "\\spad{s ** n} returns the product of \\spad{s} by itself \\spad{n} times.")) (* (($ $ |#1|) "\\spad{x * s} returns the product of \\spad{x} by \\spad{s} on the right.") (($ |#1| $) "\\spad{s * x} returns the product of \\spad{x} by \\spad{s} on the left."))) -((-4421 . T)) +((-4420 . T)) NIL (-375 S) ((|constructor| (NIL "The category of commutative fields,{} \\spadignore{i.e.} commutative rings where all non-zero elements have multiplicative inverses. The \\spadfun{factor} operation while trivial is useful to have defined. \\blankline")) (|canonicalsClosed| ((|attribute|) "since \\spad{0*0=0},{} \\spad{1*1=1}")) (|canonicalUnitNormal| ((|attribute|) "either 0 or 1.")) (/ (($ $ $) "\\spad{x/y} divides the element \\spad{x} by the element \\spad{y}. Error: if \\spad{y} is 0."))) @@ -1434,7 +1434,7 @@ NIL NIL (-376) ((|constructor| (NIL "The category of commutative fields,{} \\spadignore{i.e.} commutative rings where all non-zero elements have multiplicative inverses. The \\spadfun{factor} operation while trivial is useful to have defined. \\blankline")) (|canonicalsClosed| ((|attribute|) "since \\spad{0*0=0},{} \\spad{1*1=1}")) (|canonicalUnitNormal| ((|attribute|) "either 0 or 1.")) (/ (($ $ $) "\\spad{x/y} divides the element \\spad{x} by the element \\spad{y}. Error: if \\spad{y} is 0."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-377 S) ((|constructor| (NIL "This domain provides a basic model of files to save arbitrary values. The operations provide sequential access to the contents.")) (|readIfCan!| (((|Union| |#1| "failed") $) "\\spad{readIfCan!(f)} returns a value from the file \\spad{f},{} if possible. If \\spad{f} is not open for reading,{} or if \\spad{f} is at the end of file then \\spad{\"failed\"} is the result."))) @@ -1447,10 +1447,10 @@ NIL (-379 S R) ((|constructor| (NIL "A FiniteRankNonAssociativeAlgebra is a non associative algebra over a commutative ring \\spad{R} which is a free \\spad{R}-module of finite rank.")) (|unitsKnown| ((|attribute|) "unitsKnown means that \\spadfun{recip} truly yields reciprocal or \\spad{\"failed\"} if not a unit,{} similarly for \\spadfun{leftRecip} and \\spadfun{rightRecip}. The reason is that we use left,{} respectively right,{} minimal polynomials to decide this question.")) (|unit| (((|Union| $ "failed")) "\\spad{unit()} returns a unit of the algebra (necessarily unique),{} or \\spad{\"failed\"} if there is none.")) (|rightUnit| (((|Union| $ "failed")) "\\spad{rightUnit()} returns a right unit of the algebra (not necessarily unique),{} or \\spad{\"failed\"} if there is none.")) (|leftUnit| (((|Union| $ "failed")) "\\spad{leftUnit()} returns a left unit of the algebra (not necessarily unique),{} or \\spad{\"failed\"} if there is none.")) (|rightUnits| (((|Union| (|Record| (|:| |particular| $) (|:| |basis| (|List| $))) "failed")) "\\spad{rightUnits()} returns the affine space of all right units of the algebra,{} or \\spad{\"failed\"} if there is none.")) (|leftUnits| (((|Union| (|Record| (|:| |particular| $) (|:| |basis| (|List| $))) "failed")) "\\spad{leftUnits()} returns the affine space of all left units of the algebra,{} or \\spad{\"failed\"} if there is none.")) (|rightMinimalPolynomial| (((|SparseUnivariatePolynomial| |#2|) $) "\\spad{rightMinimalPolynomial(a)} returns the polynomial determined by the smallest non-trivial linear combination of right powers of \\spad{a}. Note: the polynomial never has a constant term as in general the algebra has no unit.")) (|leftMinimalPolynomial| (((|SparseUnivariatePolynomial| |#2|) $) "\\spad{leftMinimalPolynomial(a)} returns the polynomial determined by the smallest non-trivial linear combination of left powers of \\spad{a}. Note: the polynomial never has a constant term as in general the algebra has no unit.")) (|associatorDependence| (((|List| (|Vector| |#2|))) "\\spad{associatorDependence()} looks for the associator identities,{} \\spadignore{i.e.} finds a basis of the solutions of the linear combinations of the six permutations of \\spad{associator(a,b,c)} which yield 0,{} for all \\spad{a},{}\\spad{b},{}\\spad{c} in the algebra. The order of the permutations is \\spad{123 231 312 132 321 213}.")) (|rightRecip| (((|Union| $ "failed") $) "\\spad{rightRecip(a)} returns an element,{} which is a right inverse of \\spad{a},{} or \\spad{\"failed\"} if there is no unit element,{} if such an element doesn't exist or cannot be determined (see unitsKnown).")) (|leftRecip| (((|Union| $ "failed") $) "\\spad{leftRecip(a)} returns an element,{} which is a left inverse of \\spad{a},{} or \\spad{\"failed\"} if there is no unit element,{} if such an element doesn't exist or cannot be determined (see unitsKnown).")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(a)} returns an element,{} which is both a left and a right inverse of \\spad{a},{} or \\spad{\"failed\"} if there is no unit element,{} if such an element doesn't exist or cannot be determined (see unitsKnown).")) (|lieAlgebra?| (((|Boolean|)) "\\spad{lieAlgebra?()} tests if the algebra is anticommutative and \\spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} for all \\spad{a},{}\\spad{b},{}\\spad{c} in the algebra (Jacobi identity). Example: for every associative algebra \\spad{(A,+,@)} we can construct a Lie algebra \\spad{(A,+,*)},{} where \\spad{a*b := a@b-b@a}.")) (|jordanAlgebra?| (((|Boolean|)) "\\spad{jordanAlgebra?()} tests if the algebra is commutative,{} characteristic is not 2,{} and \\spad{(a*b)*a**2 - a*(b*a**2) = 0} for all \\spad{a},{}\\spad{b},{}\\spad{c} in the algebra (Jordan identity). Example: for every associative algebra \\spad{(A,+,@)} we can construct a Jordan algebra \\spad{(A,+,*)},{} where \\spad{a*b := (a@b+b@a)/2}.")) (|noncommutativeJordanAlgebra?| (((|Boolean|)) "\\spad{noncommutativeJordanAlgebra?()} tests if the algebra is flexible and Jordan admissible.")) (|jordanAdmissible?| (((|Boolean|)) "\\spad{jordanAdmissible?()} tests if 2 is invertible in the coefficient domain and the multiplication defined by \\spad{(1/2)(a*b+b*a)} determines a Jordan algebra,{} \\spadignore{i.e.} satisfies the Jordan identity. The property of \\spadatt{commutative(\"*\")} follows from by definition.")) (|lieAdmissible?| (((|Boolean|)) "\\spad{lieAdmissible?()} tests if the algebra defined by the commutators is a Lie algebra,{} \\spadignore{i.e.} satisfies the Jacobi identity. The property of anticommutativity follows from definition.")) (|jacobiIdentity?| (((|Boolean|)) "\\spad{jacobiIdentity?()} tests if \\spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} for all \\spad{a},{}\\spad{b},{}\\spad{c} in the algebra. For example,{} this holds for crossed products of 3-dimensional vectors.")) (|powerAssociative?| (((|Boolean|)) "\\spad{powerAssociative?()} tests if all subalgebras generated by a single element are associative.")) (|alternative?| (((|Boolean|)) "\\spad{alternative?()} tests if \\spad{2*associator(a,a,b) = 0 = 2*associator(a,b,b)} for all \\spad{a},{} \\spad{b} in the algebra. Note: we only can test this; in general we don't know whether \\spad{2*a=0} implies \\spad{a=0}.")) (|flexible?| (((|Boolean|)) "\\spad{flexible?()} tests if \\spad{2*associator(a,b,a) = 0} for all \\spad{a},{} \\spad{b} in the algebra. Note: we only can test this; in general we don't know whether \\spad{2*a=0} implies \\spad{a=0}.")) (|rightAlternative?| (((|Boolean|)) "\\spad{rightAlternative?()} tests if \\spad{2*associator(a,b,b) = 0} for all \\spad{a},{} \\spad{b} in the algebra. Note: we only can test this; in general we don't know whether \\spad{2*a=0} implies \\spad{a=0}.")) (|leftAlternative?| (((|Boolean|)) "\\spad{leftAlternative?()} tests if \\spad{2*associator(a,a,b) = 0} for all \\spad{a},{} \\spad{b} in the algebra. Note: we only can test this; in general we don't know whether \\spad{2*a=0} implies \\spad{a=0}.")) (|antiAssociative?| (((|Boolean|)) "\\spad{antiAssociative?()} tests if multiplication in algebra is anti-associative,{} \\spadignore{i.e.} \\spad{(a*b)*c + a*(b*c) = 0} for all \\spad{a},{}\\spad{b},{}\\spad{c} in the algebra.")) (|associative?| (((|Boolean|)) "\\spad{associative?()} tests if multiplication in algebra is associative.")) (|antiCommutative?| (((|Boolean|)) "\\spad{antiCommutative?()} tests if \\spad{a*a = 0} for all \\spad{a} in the algebra. Note: this implies \\spad{a*b + b*a = 0} for all \\spad{a} and \\spad{b}.")) (|commutative?| (((|Boolean|)) "\\spad{commutative?()} tests if multiplication in the algebra is commutative.")) (|rightCharacteristicPolynomial| (((|SparseUnivariatePolynomial| |#2|) $) "\\spad{rightCharacteristicPolynomial(a)} returns the characteristic polynomial of the right regular representation of \\spad{a} with respect to any basis.")) (|leftCharacteristicPolynomial| (((|SparseUnivariatePolynomial| |#2|) $) "\\spad{leftCharacteristicPolynomial(a)} returns the characteristic polynomial of the left regular representation of \\spad{a} with respect to any basis.")) (|rightTraceMatrix| (((|Matrix| |#2|) (|Vector| $)) "\\spad{rightTraceMatrix([v1,...,vn])} is the \\spad{n}-by-\\spad{n} matrix whose element at the \\spad{i}\\spad{-}th row and \\spad{j}\\spad{-}th column is given by the right trace of the product \\spad{vi*vj}.")) (|leftTraceMatrix| (((|Matrix| |#2|) (|Vector| $)) "\\spad{leftTraceMatrix([v1,...,vn])} is the \\spad{n}-by-\\spad{n} matrix whose element at the \\spad{i}\\spad{-}th row and \\spad{j}\\spad{-}th column is given by the left trace of the product \\spad{vi*vj}.")) (|rightDiscriminant| ((|#2| (|Vector| $)) "\\spad{rightDiscriminant([v1,...,vn])} returns the determinant of the \\spad{n}-by-\\spad{n} matrix whose element at the \\spad{i}\\spad{-}th row and \\spad{j}\\spad{-}th column is given by the right trace of the product \\spad{vi*vj}. Note: the same as \\spad{determinant(rightTraceMatrix([v1,...,vn]))}.")) (|leftDiscriminant| ((|#2| (|Vector| $)) "\\spad{leftDiscriminant([v1,...,vn])} returns the determinant of the \\spad{n}-by-\\spad{n} matrix whose element at the \\spad{i}\\spad{-}th row and \\spad{j}\\spad{-}th column is given by the left trace of the product \\spad{vi*vj}. Note: the same as \\spad{determinant(leftTraceMatrix([v1,...,vn]))}.")) (|represents| (($ (|Vector| |#2|) (|Vector| $)) "\\spad{represents([a1,...,am],[v1,...,vm])} returns the linear combination \\spad{a1*vm + ... + an*vm}.")) (|coordinates| (((|Matrix| |#2|) (|Vector| $) (|Vector| $)) "\\spad{coordinates([a1,...,am],[v1,...,vn])} returns a matrix whose \\spad{i}-th row is formed by the coordinates of \\spad{ai} with respect to the \\spad{R}-module basis \\spad{v1},{}...,{}\\spad{vn}.") (((|Vector| |#2|) $ (|Vector| $)) "\\spad{coordinates(a,[v1,...,vn])} returns the coordinates of \\spad{a} with respect to the \\spad{R}-module basis \\spad{v1},{}...,{}\\spad{vn}.")) (|rightNorm| ((|#2| $) "\\spad{rightNorm(a)} returns the determinant of the right regular representation of \\spad{a}.")) (|leftNorm| ((|#2| $) "\\spad{leftNorm(a)} returns the determinant of the left regular representation of \\spad{a}.")) (|rightTrace| ((|#2| $) "\\spad{rightTrace(a)} returns the trace of the right regular representation of \\spad{a}.")) (|leftTrace| ((|#2| $) "\\spad{leftTrace(a)} returns the trace of the left regular representation of \\spad{a}.")) (|rightRegularRepresentation| (((|Matrix| |#2|) $ (|Vector| $)) "\\spad{rightRegularRepresentation(a,[v1,...,vn])} returns the matrix of the linear map defined by right multiplication by \\spad{a} with respect to the \\spad{R}-module basis \\spad{[v1,...,vn]}.")) (|leftRegularRepresentation| (((|Matrix| |#2|) $ (|Vector| $)) "\\spad{leftRegularRepresentation(a,[v1,...,vn])} returns the matrix of the linear map defined by left multiplication by \\spad{a} with respect to the \\spad{R}-module basis \\spad{[v1,...,vn]}.")) (|structuralConstants| (((|Vector| (|Matrix| |#2|)) (|Vector| $)) "\\spad{structuralConstants([v1,v2,...,vm])} calculates the structural constants \\spad{[(gammaijk) for k in 1..m]} defined by \\spad{vi * vj = gammaij1 * v1 + ... + gammaijm * vm},{} where \\spad{[v1,...,vm]} is an \\spad{R}-module basis of a subalgebra.")) (|conditionsForIdempotents| (((|List| (|Polynomial| |#2|)) (|Vector| $)) "\\spad{conditionsForIdempotents([v1,...,vn])} determines a complete list of polynomial equations for the coefficients of idempotents with respect to the \\spad{R}-module basis \\spad{v1},{}...,{}\\spad{vn}.")) (|rank| (((|PositiveInteger|)) "\\spad{rank()} returns the rank of the algebra as \\spad{R}-module.")) (|someBasis| (((|Vector| $)) "\\spad{someBasis()} returns some \\spad{R}-module basis."))) NIL -((|HasCategory| |#2| (QUOTE (-569)))) +((|HasCategory| |#2| (QUOTE (-568)))) (-380 R) ((|constructor| (NIL "A FiniteRankNonAssociativeAlgebra is a non associative algebra over a commutative ring \\spad{R} which is a free \\spad{R}-module of finite rank.")) (|unitsKnown| ((|attribute|) "unitsKnown means that \\spadfun{recip} truly yields reciprocal or \\spad{\"failed\"} if not a unit,{} similarly for \\spadfun{leftRecip} and \\spadfun{rightRecip}. The reason is that we use left,{} respectively right,{} minimal polynomials to decide this question.")) (|unit| (((|Union| $ "failed")) "\\spad{unit()} returns a unit of the algebra (necessarily unique),{} or \\spad{\"failed\"} if there is none.")) (|rightUnit| (((|Union| $ "failed")) "\\spad{rightUnit()} returns a right unit of the algebra (not necessarily unique),{} or \\spad{\"failed\"} if there is none.")) (|leftUnit| (((|Union| $ "failed")) "\\spad{leftUnit()} returns a left unit of the algebra (not necessarily unique),{} or \\spad{\"failed\"} if there is none.")) (|rightUnits| (((|Union| (|Record| (|:| |particular| $) (|:| |basis| (|List| $))) "failed")) "\\spad{rightUnits()} returns the affine space of all right units of the algebra,{} or \\spad{\"failed\"} if there is none.")) (|leftUnits| (((|Union| (|Record| (|:| |particular| $) (|:| |basis| (|List| $))) "failed")) "\\spad{leftUnits()} returns the affine space of all left units of the algebra,{} or \\spad{\"failed\"} if there is none.")) (|rightMinimalPolynomial| (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{rightMinimalPolynomial(a)} returns the polynomial determined by the smallest non-trivial linear combination of right powers of \\spad{a}. Note: the polynomial never has a constant term as in general the algebra has no unit.")) (|leftMinimalPolynomial| (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{leftMinimalPolynomial(a)} returns the polynomial determined by the smallest non-trivial linear combination of left powers of \\spad{a}. Note: the polynomial never has a constant term as in general the algebra has no unit.")) (|associatorDependence| (((|List| (|Vector| |#1|))) "\\spad{associatorDependence()} looks for the associator identities,{} \\spadignore{i.e.} finds a basis of the solutions of the linear combinations of the six permutations of \\spad{associator(a,b,c)} which yield 0,{} for all \\spad{a},{}\\spad{b},{}\\spad{c} in the algebra. The order of the permutations is \\spad{123 231 312 132 321 213}.")) (|rightRecip| (((|Union| $ "failed") $) "\\spad{rightRecip(a)} returns an element,{} which is a right inverse of \\spad{a},{} or \\spad{\"failed\"} if there is no unit element,{} if such an element doesn't exist or cannot be determined (see unitsKnown).")) (|leftRecip| (((|Union| $ "failed") $) "\\spad{leftRecip(a)} returns an element,{} which is a left inverse of \\spad{a},{} or \\spad{\"failed\"} if there is no unit element,{} if such an element doesn't exist or cannot be determined (see unitsKnown).")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(a)} returns an element,{} which is both a left and a right inverse of \\spad{a},{} or \\spad{\"failed\"} if there is no unit element,{} if such an element doesn't exist or cannot be determined (see unitsKnown).")) (|lieAlgebra?| (((|Boolean|)) "\\spad{lieAlgebra?()} tests if the algebra is anticommutative and \\spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} for all \\spad{a},{}\\spad{b},{}\\spad{c} in the algebra (Jacobi identity). Example: for every associative algebra \\spad{(A,+,@)} we can construct a Lie algebra \\spad{(A,+,*)},{} where \\spad{a*b := a@b-b@a}.")) (|jordanAlgebra?| (((|Boolean|)) "\\spad{jordanAlgebra?()} tests if the algebra is commutative,{} characteristic is not 2,{} and \\spad{(a*b)*a**2 - a*(b*a**2) = 0} for all \\spad{a},{}\\spad{b},{}\\spad{c} in the algebra (Jordan identity). Example: for every associative algebra \\spad{(A,+,@)} we can construct a Jordan algebra \\spad{(A,+,*)},{} where \\spad{a*b := (a@b+b@a)/2}.")) (|noncommutativeJordanAlgebra?| (((|Boolean|)) "\\spad{noncommutativeJordanAlgebra?()} tests if the algebra is flexible and Jordan admissible.")) (|jordanAdmissible?| (((|Boolean|)) "\\spad{jordanAdmissible?()} tests if 2 is invertible in the coefficient domain and the multiplication defined by \\spad{(1/2)(a*b+b*a)} determines a Jordan algebra,{} \\spadignore{i.e.} satisfies the Jordan identity. The property of \\spadatt{commutative(\"*\")} follows from by definition.")) (|lieAdmissible?| (((|Boolean|)) "\\spad{lieAdmissible?()} tests if the algebra defined by the commutators is a Lie algebra,{} \\spadignore{i.e.} satisfies the Jacobi identity. The property of anticommutativity follows from definition.")) (|jacobiIdentity?| (((|Boolean|)) "\\spad{jacobiIdentity?()} tests if \\spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} for all \\spad{a},{}\\spad{b},{}\\spad{c} in the algebra. For example,{} this holds for crossed products of 3-dimensional vectors.")) (|powerAssociative?| (((|Boolean|)) "\\spad{powerAssociative?()} tests if all subalgebras generated by a single element are associative.")) (|alternative?| (((|Boolean|)) "\\spad{alternative?()} tests if \\spad{2*associator(a,a,b) = 0 = 2*associator(a,b,b)} for all \\spad{a},{} \\spad{b} in the algebra. Note: we only can test this; in general we don't know whether \\spad{2*a=0} implies \\spad{a=0}.")) (|flexible?| (((|Boolean|)) "\\spad{flexible?()} tests if \\spad{2*associator(a,b,a) = 0} for all \\spad{a},{} \\spad{b} in the algebra. Note: we only can test this; in general we don't know whether \\spad{2*a=0} implies \\spad{a=0}.")) (|rightAlternative?| (((|Boolean|)) "\\spad{rightAlternative?()} tests if \\spad{2*associator(a,b,b) = 0} for all \\spad{a},{} \\spad{b} in the algebra. Note: we only can test this; in general we don't know whether \\spad{2*a=0} implies \\spad{a=0}.")) (|leftAlternative?| (((|Boolean|)) "\\spad{leftAlternative?()} tests if \\spad{2*associator(a,a,b) = 0} for all \\spad{a},{} \\spad{b} in the algebra. Note: we only can test this; in general we don't know whether \\spad{2*a=0} implies \\spad{a=0}.")) (|antiAssociative?| (((|Boolean|)) "\\spad{antiAssociative?()} tests if multiplication in algebra is anti-associative,{} \\spadignore{i.e.} \\spad{(a*b)*c + a*(b*c) = 0} for all \\spad{a},{}\\spad{b},{}\\spad{c} in the algebra.")) (|associative?| (((|Boolean|)) "\\spad{associative?()} tests if multiplication in algebra is associative.")) (|antiCommutative?| (((|Boolean|)) "\\spad{antiCommutative?()} tests if \\spad{a*a = 0} for all \\spad{a} in the algebra. Note: this implies \\spad{a*b + b*a = 0} for all \\spad{a} and \\spad{b}.")) (|commutative?| (((|Boolean|)) "\\spad{commutative?()} tests if multiplication in the algebra is commutative.")) (|rightCharacteristicPolynomial| (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{rightCharacteristicPolynomial(a)} returns the characteristic polynomial of the right regular representation of \\spad{a} with respect to any basis.")) (|leftCharacteristicPolynomial| (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{leftCharacteristicPolynomial(a)} returns the characteristic polynomial of the left regular representation of \\spad{a} with respect to any basis.")) (|rightTraceMatrix| (((|Matrix| |#1|) (|Vector| $)) "\\spad{rightTraceMatrix([v1,...,vn])} is the \\spad{n}-by-\\spad{n} matrix whose element at the \\spad{i}\\spad{-}th row and \\spad{j}\\spad{-}th column is given by the right trace of the product \\spad{vi*vj}.")) (|leftTraceMatrix| (((|Matrix| |#1|) (|Vector| $)) "\\spad{leftTraceMatrix([v1,...,vn])} is the \\spad{n}-by-\\spad{n} matrix whose element at the \\spad{i}\\spad{-}th row and \\spad{j}\\spad{-}th column is given by the left trace of the product \\spad{vi*vj}.")) (|rightDiscriminant| ((|#1| (|Vector| $)) "\\spad{rightDiscriminant([v1,...,vn])} returns the determinant of the \\spad{n}-by-\\spad{n} matrix whose element at the \\spad{i}\\spad{-}th row and \\spad{j}\\spad{-}th column is given by the right trace of the product \\spad{vi*vj}. Note: the same as \\spad{determinant(rightTraceMatrix([v1,...,vn]))}.")) (|leftDiscriminant| ((|#1| (|Vector| $)) "\\spad{leftDiscriminant([v1,...,vn])} returns the determinant of the \\spad{n}-by-\\spad{n} matrix whose element at the \\spad{i}\\spad{-}th row and \\spad{j}\\spad{-}th column is given by the left trace of the product \\spad{vi*vj}. Note: the same as \\spad{determinant(leftTraceMatrix([v1,...,vn]))}.")) (|represents| (($ (|Vector| |#1|) (|Vector| $)) "\\spad{represents([a1,...,am],[v1,...,vm])} returns the linear combination \\spad{a1*vm + ... + an*vm}.")) (|coordinates| (((|Matrix| |#1|) (|Vector| $) (|Vector| $)) "\\spad{coordinates([a1,...,am],[v1,...,vn])} returns a matrix whose \\spad{i}-th row is formed by the coordinates of \\spad{ai} with respect to the \\spad{R}-module basis \\spad{v1},{}...,{}\\spad{vn}.") (((|Vector| |#1|) $ (|Vector| $)) "\\spad{coordinates(a,[v1,...,vn])} returns the coordinates of \\spad{a} with respect to the \\spad{R}-module basis \\spad{v1},{}...,{}\\spad{vn}.")) (|rightNorm| ((|#1| $) "\\spad{rightNorm(a)} returns the determinant of the right regular representation of \\spad{a}.")) (|leftNorm| ((|#1| $) "\\spad{leftNorm(a)} returns the determinant of the left regular representation of \\spad{a}.")) (|rightTrace| ((|#1| $) "\\spad{rightTrace(a)} returns the trace of the right regular representation of \\spad{a}.")) (|leftTrace| ((|#1| $) "\\spad{leftTrace(a)} returns the trace of the left regular representation of \\spad{a}.")) (|rightRegularRepresentation| (((|Matrix| |#1|) $ (|Vector| $)) "\\spad{rightRegularRepresentation(a,[v1,...,vn])} returns the matrix of the linear map defined by right multiplication by \\spad{a} with respect to the \\spad{R}-module basis \\spad{[v1,...,vn]}.")) (|leftRegularRepresentation| (((|Matrix| |#1|) $ (|Vector| $)) "\\spad{leftRegularRepresentation(a,[v1,...,vn])} returns the matrix of the linear map defined by left multiplication by \\spad{a} with respect to the \\spad{R}-module basis \\spad{[v1,...,vn]}.")) (|structuralConstants| (((|Vector| (|Matrix| |#1|)) (|Vector| $)) "\\spad{structuralConstants([v1,v2,...,vm])} calculates the structural constants \\spad{[(gammaijk) for k in 1..m]} defined by \\spad{vi * vj = gammaij1 * v1 + ... + gammaijm * vm},{} where \\spad{[v1,...,vm]} is an \\spad{R}-module basis of a subalgebra.")) (|conditionsForIdempotents| (((|List| (|Polynomial| |#1|)) (|Vector| $)) "\\spad{conditionsForIdempotents([v1,...,vn])} determines a complete list of polynomial equations for the coefficients of idempotents with respect to the \\spad{R}-module basis \\spad{v1},{}...,{}\\spad{vn}.")) (|rank| (((|PositiveInteger|)) "\\spad{rank()} returns the rank of the algebra as \\spad{R}-module.")) (|someBasis| (((|Vector| $)) "\\spad{someBasis()} returns some \\spad{R}-module basis."))) -((-4421 |has| |#1| (-569)) (-4419 . T) (-4418 . T)) +((-4420 |has| |#1| (-568)) (-4418 . T) (-4417 . T)) NIL (-381) ((|constructor| (NIL "The category of domains composed of a finite set of elements. We include the functions \\spadfun{lookup} and \\spadfun{index} to give a bijection between the finite set and an initial segment of positive integers. \\blankline")) (|random| (($) "\\spad{random()} returns a random element from the set.")) (|lookup| (((|PositiveInteger|) $) "\\spad{lookup(x)} returns a positive integer such that \\spad{x = index lookup x}.")) (|index| (($ (|PositiveInteger|)) "\\spad{index(i)} takes a positive integer \\spad{i} less than or equal to \\spad{size()} and returns the \\spad{i}\\spad{-}th element of the set. This operation establishs a bijection between the elements of the finite set and \\spad{1..size()}.")) (|size| (((|NonNegativeInteger|)) "\\spad{size()} returns the number of elements in the set."))) @@ -1462,15 +1462,15 @@ NIL ((|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-376)))) (-383 R UP) ((|constructor| (NIL "A FiniteRankAlgebra is an algebra over a commutative ring \\spad{R} which is a free \\spad{R}-module of finite rank.")) (|minimalPolynomial| ((|#2| $) "\\spad{minimalPolynomial(a)} returns the minimal polynomial of \\spad{a}.")) (|characteristicPolynomial| ((|#2| $) "\\spad{characteristicPolynomial(a)} returns the characteristic polynomial of the regular representation of \\spad{a} with respect to any basis.")) (|traceMatrix| (((|Matrix| |#1|) (|Vector| $)) "\\spad{traceMatrix([v1,..,vn])} is the \\spad{n}-by-\\spad{n} matrix ( Tr(\\spad{vi} * vj) )")) (|discriminant| ((|#1| (|Vector| $)) "\\spad{discriminant([v1,..,vn])} returns \\spad{determinant(traceMatrix([v1,..,vn]))}.")) (|represents| (($ (|Vector| |#1|) (|Vector| $)) "\\spad{represents([a1,..,an],[v1,..,vn])} returns \\spad{a1*v1 + ... + an*vn}.")) (|coordinates| (((|Matrix| |#1|) (|Vector| $) (|Vector| $)) "\\spad{coordinates([v1,...,vm], basis)} returns the coordinates of the \\spad{vi}'s with to the basis \\spad{basis}. The coordinates of \\spad{vi} are contained in the \\spad{i}th row of the matrix returned by this function.") (((|Vector| |#1|) $ (|Vector| $)) "\\spad{coordinates(a,basis)} returns the coordinates of \\spad{a} with respect to the \\spad{basis} \\spad{basis}.")) (|norm| ((|#1| $) "\\spad{norm(a)} returns the determinant of the regular representation of \\spad{a} with respect to any basis.")) (|trace| ((|#1| $) "\\spad{trace(a)} returns the trace of the regular representation of \\spad{a} with respect to any basis.")) (|regularRepresentation| (((|Matrix| |#1|) $ (|Vector| $)) "\\spad{regularRepresentation(a,basis)} returns the matrix of the linear map defined by left multiplication by \\spad{a} with respect to the \\spad{basis} \\spad{basis}.")) (|rank| (((|PositiveInteger|)) "\\spad{rank()} returns the rank of the algebra."))) -((-4418 . T) (-4419 . T) (-4421 . T)) +((-4417 . T) (-4418 . T) (-4420 . T)) NIL (-384 A S) ((|constructor| (NIL "A finite linear aggregate is a linear aggregate of finite length. The finite property of the aggregate adds several exports to the list of exports from \\spadtype{LinearAggregate} such as \\spadfun{reverse},{} \\spadfun{sort},{} and so on.")) (|sort!| (($ $) "\\spad{sort!(u)} returns \\spad{u} with its elements in ascending order.") (($ (|Mapping| (|Boolean|) |#2| |#2|) $) "\\spad{sort!(p,u)} returns \\spad{u} with its elements ordered by \\spad{p}.")) (|reverse!| (($ $) "\\spad{reverse!(u)} returns \\spad{u} with its elements in reverse order.")) (|copyInto!| (($ $ $ (|Integer|)) "\\spad{copyInto!(u,v,i)} returns aggregate \\spad{u} containing a copy of \\spad{v} inserted at element \\spad{i}.")) (|position| (((|Integer|) |#2| $ (|Integer|)) "\\spad{position(x,a,n)} returns the index \\spad{i} of the first occurrence of \\spad{x} in \\axiom{a} where \\axiom{\\spad{i} >= \\spad{n}},{} and \\axiom{minIndex(a) - 1} if no such \\spad{x} is found.") (((|Integer|) |#2| $) "\\spad{position(x,a)} returns the index \\spad{i} of the first occurrence of \\spad{x} in a,{} and \\axiom{minIndex(a) - 1} if there is no such \\spad{x}.") (((|Integer|) (|Mapping| (|Boolean|) |#2|) $) "\\spad{position(p,a)} returns the index \\spad{i} of the first \\spad{x} in \\axiom{a} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true},{} and \\axiom{minIndex(a) - 1} if there is no such \\spad{x}.")) (|sorted?| (((|Boolean|) $) "\\spad{sorted?(u)} tests if the elements of \\spad{u} are in ascending order.") (((|Boolean|) (|Mapping| (|Boolean|) |#2| |#2|) $) "\\spad{sorted?(p,a)} tests if \\axiom{a} is sorted according to predicate \\spad{p}.")) (|sort| (($ $) "\\spad{sort(u)} returns an \\spad{u} with elements in ascending order. Note: \\axiom{sort(\\spad{u}) = sort(<=,{}\\spad{u})}.") (($ (|Mapping| (|Boolean|) |#2| |#2|) $) "\\spad{sort(p,a)} returns a copy of \\axiom{a} sorted using total ordering predicate \\spad{p}.")) (|reverse| (($ $) "\\spad{reverse(a)} returns a copy of \\axiom{a} with elements in reverse order.")) (|merge| (($ $ $) "\\spad{merge(u,v)} merges \\spad{u} and \\spad{v} in ascending order. Note: \\axiom{merge(\\spad{u},{}\\spad{v}) = merge(<=,{}\\spad{u},{}\\spad{v})}.") (($ (|Mapping| (|Boolean|) |#2| |#2|) $ $) "\\spad{merge(p,a,b)} returns an aggregate \\spad{c} which merges \\axiom{a} and \\spad{b}. The result is produced by examining each element \\spad{x} of \\axiom{a} and \\spad{y} of \\spad{b} successively. If \\axiom{\\spad{p}(\\spad{x},{}\\spad{y})} is \\spad{true},{} then \\spad{x} is inserted into the result; otherwise \\spad{y} is inserted. If \\spad{x} is chosen,{} the next element of \\axiom{a} is examined,{} and so on. When all the elements of one aggregate are examined,{} the remaining elements of the other are appended. For example,{} \\axiom{merge(<,{}[1,{}3],{}[2,{}7,{}5])} returns \\axiom{[1,{}2,{}3,{}7,{}5]}."))) NIL -((|HasAttribute| |#1| (QUOTE -4425)) (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-1121)))) +((|HasAttribute| |#1| (QUOTE -4424)) (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-1120)))) (-385 S) ((|constructor| (NIL "A finite linear aggregate is a linear aggregate of finite length. The finite property of the aggregate adds several exports to the list of exports from \\spadtype{LinearAggregate} such as \\spadfun{reverse},{} \\spadfun{sort},{} and so on.")) (|sort!| (($ $) "\\spad{sort!(u)} returns \\spad{u} with its elements in ascending order.") (($ (|Mapping| (|Boolean|) |#1| |#1|) $) "\\spad{sort!(p,u)} returns \\spad{u} with its elements ordered by \\spad{p}.")) (|reverse!| (($ $) "\\spad{reverse!(u)} returns \\spad{u} with its elements in reverse order.")) (|copyInto!| (($ $ $ (|Integer|)) "\\spad{copyInto!(u,v,i)} returns aggregate \\spad{u} containing a copy of \\spad{v} inserted at element \\spad{i}.")) (|position| (((|Integer|) |#1| $ (|Integer|)) "\\spad{position(x,a,n)} returns the index \\spad{i} of the first occurrence of \\spad{x} in \\axiom{a} where \\axiom{\\spad{i} >= \\spad{n}},{} and \\axiom{minIndex(a) - 1} if no such \\spad{x} is found.") (((|Integer|) |#1| $) "\\spad{position(x,a)} returns the index \\spad{i} of the first occurrence of \\spad{x} in a,{} and \\axiom{minIndex(a) - 1} if there is no such \\spad{x}.") (((|Integer|) (|Mapping| (|Boolean|) |#1|) $) "\\spad{position(p,a)} returns the index \\spad{i} of the first \\spad{x} in \\axiom{a} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true},{} and \\axiom{minIndex(a) - 1} if there is no such \\spad{x}.")) (|sorted?| (((|Boolean|) $) "\\spad{sorted?(u)} tests if the elements of \\spad{u} are in ascending order.") (((|Boolean|) (|Mapping| (|Boolean|) |#1| |#1|) $) "\\spad{sorted?(p,a)} tests if \\axiom{a} is sorted according to predicate \\spad{p}.")) (|sort| (($ $) "\\spad{sort(u)} returns an \\spad{u} with elements in ascending order. Note: \\axiom{sort(\\spad{u}) = sort(<=,{}\\spad{u})}.") (($ (|Mapping| (|Boolean|) |#1| |#1|) $) "\\spad{sort(p,a)} returns a copy of \\axiom{a} sorted using total ordering predicate \\spad{p}.")) (|reverse| (($ $) "\\spad{reverse(a)} returns a copy of \\axiom{a} with elements in reverse order.")) (|merge| (($ $ $) "\\spad{merge(u,v)} merges \\spad{u} and \\spad{v} in ascending order. Note: \\axiom{merge(\\spad{u},{}\\spad{v}) = merge(<=,{}\\spad{u},{}\\spad{v})}.") (($ (|Mapping| (|Boolean|) |#1| |#1|) $ $) "\\spad{merge(p,a,b)} returns an aggregate \\spad{c} which merges \\axiom{a} and \\spad{b}. The result is produced by examining each element \\spad{x} of \\axiom{a} and \\spad{y} of \\spad{b} successively. If \\axiom{\\spad{p}(\\spad{x},{}\\spad{y})} is \\spad{true},{} then \\spad{x} is inserted into the result; otherwise \\spad{y} is inserted. If \\spad{x} is chosen,{} the next element of \\axiom{a} is examined,{} and so on. When all the elements of one aggregate are examined,{} the remaining elements of the other are appended. For example,{} \\axiom{merge(<,{}[1,{}3],{}[2,{}7,{}5])} returns \\axiom{[1,{}2,{}3,{}7,{}5]}."))) -((-4424 . T)) +((-4423 . T)) NIL (-386 S A R B) ((|constructor| (NIL "\\spad{FiniteLinearAggregateFunctions2} provides functions involving two FiniteLinearAggregates where the underlying domains might be different. An example of this might be creating a list of rational numbers by mapping a function across a list 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 aggregrate \\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 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}.")) (|map| ((|#4| (|Mapping| |#3| |#1|) |#2|) "\\spad{map(f,a)} applies function \\spad{f} to each member of aggregate \\spad{a} resulting in a new aggregate over a possibly different underlying domain."))) @@ -1478,7 +1478,7 @@ NIL NIL (-387 |VarSet| R) ((|constructor| (NIL "The category of free Lie algebras. It is used by domains of non-commutative algebra: \\spadtype{LiePolynomial} and \\spadtype{XPBWPolynomial}. \\newline Author: Michel Petitot (petitot@lifl.fr)")) (|eval| (($ $ (|List| |#1|) (|List| $)) "\\axiom{eval(\\spad{p},{} [\\spad{x1},{}...,{}xn],{} [\\spad{v1},{}...,{}vn])} replaces \\axiom{\\spad{xi}} by \\axiom{\\spad{vi}} in \\axiom{\\spad{p}}.") (($ $ |#1| $) "\\axiom{eval(\\spad{p},{} \\spad{x},{} \\spad{v})} replaces \\axiom{\\spad{x}} by \\axiom{\\spad{v}} in \\axiom{\\spad{p}}.")) (|varList| (((|List| |#1|) $) "\\axiom{varList(\\spad{x})} returns the list of distinct entries of \\axiom{\\spad{x}}.")) (|trunc| (($ $ (|NonNegativeInteger|)) "\\axiom{trunc(\\spad{p},{}\\spad{n})} returns the polynomial \\axiom{\\spad{p}} truncated at order \\axiom{\\spad{n}}.")) (|mirror| (($ $) "\\axiom{mirror(\\spad{x})} returns \\axiom{Sum(r_i mirror(w_i))} if \\axiom{\\spad{x}} is \\axiom{Sum(r_i w_i)}.")) (|LiePoly| (($ (|LyndonWord| |#1|)) "\\axiom{LiePoly(\\spad{l})} returns the bracketed form of \\axiom{\\spad{l}} as a Lie polynomial.")) (|rquo| (((|XRecursivePolynomial| |#1| |#2|) (|XRecursivePolynomial| |#1| |#2|) $) "\\axiom{rquo(\\spad{x},{}\\spad{y})} returns the right simplification of \\axiom{\\spad{x}} by \\axiom{\\spad{y}}.")) (|lquo| (((|XRecursivePolynomial| |#1| |#2|) (|XRecursivePolynomial| |#1| |#2|) $) "\\axiom{lquo(\\spad{x},{}\\spad{y})} returns the left simplification of \\axiom{\\spad{x}} by \\axiom{\\spad{y}}.")) (|degree| (((|NonNegativeInteger|) $) "\\axiom{degree(\\spad{x})} returns the greatest length of a word in the support of \\axiom{\\spad{x}}.")) (|coerce| (((|XRecursivePolynomial| |#1| |#2|) $) "\\axiom{coerce(\\spad{x})} returns \\axiom{\\spad{x}} as a recursive polynomial.") (((|XDistributedPolynomial| |#1| |#2|) $) "\\axiom{coerce(\\spad{x})} returns \\axiom{\\spad{x}} as distributed polynomial.") (($ |#1|) "\\axiom{coerce(\\spad{x})} returns \\axiom{\\spad{x}} as a Lie polynomial.")) (|coef| ((|#2| (|XRecursivePolynomial| |#1| |#2|) $) "\\axiom{coef(\\spad{x},{}\\spad{y})} returns the scalar product of \\axiom{\\spad{x}} by \\axiom{\\spad{y}},{} the set of words being regarded as an orthogonal basis."))) -((|JacobiIdentity| . T) (|NullSquare| . T) (-4419 . T) (-4418 . T)) +((|JacobiIdentity| . T) (|NullSquare| . T) (-4418 . T) (-4417 . T)) NIL (-388 S V) ((|constructor| (NIL "This package exports 3 sorting algorithms which work over FiniteLinearAggregates.")) (|shellSort| ((|#2| (|Mapping| (|Boolean|) |#1| |#1|) |#2|) "\\spad{shellSort(f, agg)} sorts the aggregate agg with the ordering function \\spad{f} using the shellSort algorithm.")) (|heapSort| ((|#2| (|Mapping| (|Boolean|) |#1| |#1|) |#2|) "\\spad{heapSort(f, agg)} sorts the aggregate agg with the ordering function \\spad{f} using the heapsort algorithm.")) (|quickSort| ((|#2| (|Mapping| (|Boolean|) |#1| |#1|) |#2|) "\\spad{quickSort(f, agg)} sorts the aggregate agg with the ordering function \\spad{f} using the quicksort algorithm."))) @@ -1487,14 +1487,14 @@ NIL (-389 S R) ((|constructor| (NIL "\\spad{S} is \\spadtype{FullyLinearlyExplicitRingOver R} means that \\spad{S} is a \\spadtype{LinearlyExplicitRingOver R} and,{} in addition,{} if \\spad{R} is a \\spadtype{LinearlyExplicitRingOver Integer},{} then so is \\spad{S}"))) NIL -((|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) +((|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-390 R) ((|constructor| (NIL "\\spad{S} is \\spadtype{FullyLinearlyExplicitRingOver R} means that \\spad{S} is a \\spadtype{LinearlyExplicitRingOver R} and,{} in addition,{} if \\spad{R} is a \\spadtype{LinearlyExplicitRingOver Integer},{} then so is \\spad{S}"))) 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}."))) -((-4407 . T) (-4415 . T) (-4199 . T) (-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4406 . T) (-4414 . T) (-4198 . T) (-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . 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}."))) @@ -1506,11 +1506,11 @@ NIL NIL (-394 R S) ((|constructor| (NIL "A \\spad{bi}-module is a free module over a ring with generators indexed by an ordered set. Each element can be expressed as a finite linear combination of generators. Only non-zero terms are stored."))) -((-4419 . T) (-4418 . T)) -((|HasCategory| |#1| (QUOTE (-175))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#2| (QUOTE (-1121))))) +((-4418 . T) (-4417 . T)) +((|HasCategory| |#1| (QUOTE (-175))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#2| (QUOTE (-1120))))) (-395 R S) ((|constructor| (NIL "This domain implements linear combinations of elements from the domain \\spad{S} with coefficients in the domain \\spad{R} where \\spad{S} is an ordered set and \\spad{R} is a ring (which may be non-commutative). This domain is used by domains of non-commutative algebra such as: \\indented{4}{\\spadtype{XDistributedPolynomial},{}} \\indented{4}{\\spadtype{XRecursivePolynomial}.} Author: Michel Petitot (petitot@lifl.fr)")) (* (($ |#2| |#1|) "\\spad{s*r} returns the product \\spad{r*s} used by \\spadtype{XRecursivePolynomial}"))) -((-4419 . T) (-4418 . T)) +((-4418 . T) (-4417 . T)) ((|HasCategory| |#1| (QUOTE (-175)))) (-396) ((|constructor| (NIL "\\axiomType{FortranMatrixCategory} provides support for producing Functions and Subroutines when the input to these is an AXIOM object of type \\axiomType{Matrix} or in domains involving \\axiomType{FortranCode}.")) (|coerce| (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(e)} takes the component of \\spad{e} from \\spadtype{List FortranCode} and uses it as the body of the ASP,{} making the declarations in the \\spadtype{SymbolTable} component.") (($ (|FortranCode|)) "\\spad{coerce(e)} takes an object from \\spadtype{FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|List| (|FortranCode|))) "\\spad{coerce(e)} takes an object from \\spadtype{List FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|Matrix| (|MachineFloat|))) "\\spad{coerce(v)} produces an ASP which returns the value of \\spad{v}."))) @@ -1518,7 +1518,7 @@ NIL NIL (-397 R |Basis|) ((|constructor| (NIL "A domain of this category implements formal linear combinations of elements from a domain \\spad{Basis} with coefficients in a domain \\spad{R}. The domain \\spad{Basis} needs only to belong to the category \\spadtype{SetCategory} and \\spad{R} to the category \\spadtype{Ring}. Thus the coefficient ring may be non-commutative. See the \\spadtype{XDistributedPolynomial} constructor for examples of domains built with the \\spadtype{FreeModuleCat} category constructor. Author: Michel Petitot (petitot@lifl.fr)")) (|reductum| (($ $) "\\spad{reductum(x)} returns \\spad{x} minus its leading term.")) (|leadingTerm| (((|Record| (|:| |k| |#2|) (|:| |c| |#1|)) $) "\\spad{leadingTerm(x)} returns the first term which appears in \\spad{ListOfTerms(x)}.")) (|leadingCoefficient| ((|#1| $) "\\spad{leadingCoefficient(x)} returns the first coefficient which appears in \\spad{ListOfTerms(x)}.")) (|leadingMonomial| ((|#2| $) "\\spad{leadingMonomial(x)} returns the first element from \\spad{Basis} which appears in \\spad{ListOfTerms(x)}.")) (|numberOfMonomials| (((|NonNegativeInteger|) $) "\\spad{numberOfMonomials(x)} returns the number of monomials of \\spad{x}.")) (|monomials| (((|List| $) $) "\\spad{monomials(x)} returns the list of \\spad{r_i*b_i} whose sum is \\spad{x}.")) (|coefficients| (((|List| |#1|) $) "\\spad{coefficients(x)} returns the list of coefficients of \\spad{x}.")) (|ListOfTerms| (((|List| (|Record| (|:| |k| |#2|) (|:| |c| |#1|))) $) "\\spad{ListOfTerms(x)} returns a list \\spad{lt} of terms with type \\spad{Record(k: Basis, c: R)} such that \\spad{x} equals \\spad{reduce(+, map(x +-> monom(x.k, x.c), lt))}.")) (|monomial?| (((|Boolean|) $) "\\spad{monomial?(x)} returns \\spad{true} if \\spad{x} contains a single monomial.")) (|monom| (($ |#2| |#1|) "\\spad{monom(b,r)} returns the element with the single monomial \\indented{1}{\\spad{b} and coefficient \\spad{r}.}")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(fn,u)} maps function \\spad{fn} onto the coefficients \\indented{1}{of the non-zero monomials of \\spad{u}.}")) (|coefficient| ((|#1| $ |#2|) "\\spad{coefficient(x,b)} returns the coefficient of \\spad{b} in \\spad{x}.")) (* (($ |#1| |#2|) "\\spad{r*b} returns the product of \\spad{r} by \\spad{b}."))) -((-4419 . T) (-4418 . T)) +((-4418 . T) (-4417 . T)) NIL (-398) ((|constructor| (NIL "\\axiomType{FortranMatrixFunctionCategory} provides support for producing Functions and Subroutines representing matrices of expressions.")) (|retractIfCan| (((|Union| $ "failed") (|Matrix| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Matrix| (|Fraction| (|Polynomial| (|Float|))))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Matrix| (|Polynomial| (|Integer|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Matrix| (|Polynomial| (|Float|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Matrix| (|Expression| (|Integer|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Matrix| (|Expression| (|Float|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|retract| (($ (|Matrix| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Matrix| (|Fraction| (|Polynomial| (|Float|))))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Matrix| (|Polynomial| (|Integer|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Matrix| (|Polynomial| (|Float|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Matrix| (|Expression| (|Integer|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Matrix| (|Expression| (|Float|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|coerce| (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(e)} takes the component of \\spad{e} from \\spadtype{List FortranCode} and uses it as the body of the ASP,{} making the declarations in the \\spadtype{SymbolTable} component.") (($ (|FortranCode|)) "\\spad{coerce(e)} takes an object from \\spadtype{FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|List| (|FortranCode|))) "\\spad{coerce(e)} takes an object from \\spadtype{List FortranCode} and \\indented{1}{uses it as the body of an ASP.}"))) @@ -1531,10 +1531,10 @@ NIL (-400 S) ((|constructor| (NIL "The free monoid on a set \\spad{S} is the monoid of finite products of the form \\spad{reduce(*,[si ** ni])} where the \\spad{si}'s are in \\spad{S},{} and the \\spad{ni}'s are nonnegative integers. The multiplication is not commutative."))) NIL -((|HasCategory| |#1| (QUOTE (-860)))) +((|HasCategory| |#1| (QUOTE (-859)))) (-401) ((|constructor| (NIL "A category of domains which model machine arithmetic used by machines in the AXIOM-NAG link."))) -((-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-402) ((|constructor| (NIL "This domain provides an interface to names in the file system."))) @@ -1546,13 +1546,13 @@ NIL NIL (-404 |n| |class| R) ((|constructor| (NIL "Generate the Free Lie Algebra over a ring \\spad{R} with identity; A \\spad{P}. Hall basis is generated by a package call to HallBasis.")) (|generator| (($ (|NonNegativeInteger|)) "\\spad{generator(i)} is the \\spad{i}th Hall Basis element")) (|shallowExpand| (((|OutputForm|) $) "\\spad{shallowExpand(x)} \\undocumented{}")) (|deepExpand| (((|OutputForm|) $) "\\spad{deepExpand(x)} \\undocumented{}")) (|dimension| (((|NonNegativeInteger|)) "\\spad{dimension()} is the rank of this Lie algebra"))) -((-4419 . T) (-4418 . T)) +((-4418 . T) (-4417 . T)) NIL (-405) ((|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 -3494 UP UPUP R) +(-406 -3493 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 @@ -1568,11 +1568,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 -(-410 -3969 |returnType| -1536 |symbols|) +(-410 -3968 |returnType| -1535 |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 -(-411 -3494 UP) +(-411 -3493 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 @@ -1586,28 +1586,28 @@ NIL NIL (-414) ((|constructor| (NIL "FieldOfPrimeCharacteristic is the category of fields of prime characteristic,{} \\spadignore{e.g.} finite fields,{} algebraic closures of fields of prime characteristic,{} transcendental extensions of of fields of prime characteristic.")) (|primeFrobenius| (($ $ (|NonNegativeInteger|)) "\\spad{primeFrobenius(a,s)} returns \\spad{a**(p**s)} where \\spad{p} is the characteristic.") (($ $) "\\spad{primeFrobenius(a)} returns \\spad{a ** p} where \\spad{p} is the characteristic.")) (|discreteLog| (((|Union| (|NonNegativeInteger|) "failed") $ $) "\\spad{discreteLog(b,a)} computes \\spad{s} with \\spad{b**s = a} if such an \\spad{s} exists.")) (|order| (((|OnePointCompletion| (|PositiveInteger|)) $) "\\spad{order(a)} computes the order of an element in the multiplicative group of the field. Error: if \\spad{a} is 0."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-415 S) ((|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\"."))) NIL -((|HasAttribute| |#1| (QUOTE -4407)) (|HasAttribute| |#1| (QUOTE -4415))) +((|HasAttribute| |#1| (QUOTE -4406)) (|HasAttribute| |#1| (QUOTE -4414))) (-416) ((|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\"."))) -((-4199 . T) (-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4198 . T) (-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-417 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| #1="nil" #2="sqfr" #3="irred" #4="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| #1# #2# #3# #4#) $ (|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| #1# #2# #3# #4#)) (|:| |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| #1# #2# #3# #4#)) (|:| |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."))) -((-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -526) (QUOTE (-1197)) (QUOTE $))) (|HasCategory| |#1| (|%list| (QUOTE -321) (QUOTE $))) (|HasCategory| |#1| (|%list| (QUOTE -298) (QUOTE $) (QUOTE $))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#1| (QUOTE (-1242))) (-3956 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-1242)))) (|HasCategory| |#1| (QUOTE (-1040))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (|%list| (QUOTE -526) (QUOTE (-1197)) (|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 -918) (QUOTE (-1197)))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#1| (QUOTE (-557))) (|HasCategory| |#1| (QUOTE (-464)))) +((-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (|%list| (QUOTE -526) (QUOTE (-1196)) (QUOTE $))) (|HasCategory| |#1| (|%list| (QUOTE -321) (QUOTE $))) (|HasCategory| |#1| (|%list| (QUOTE -298) (QUOTE $) (QUOTE $))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#1| (QUOTE (-1241))) (-3955 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-1241)))) (|HasCategory| |#1| (QUOTE (-1039))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (|%list| (QUOTE -526) (QUOTE (-1196)) (|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 -917) (QUOTE (-1196)))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#1| (QUOTE (-556))) (|HasCategory| |#1| (QUOTE (-464)))) (-418 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 NIL (-419 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."))) -((-4411 -12 (|has| |#1| (-6 -4422)) (|has| |#1| (-464)) (|has| |#1| (-6 -4411))) (-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-1197)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#1| (QUOTE (-1040))) (|HasCategory| |#1| (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-860))) (-3956 (|HasCategory| |#1| (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-860)))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-1172))) (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#1| (|%list| (QUOTE -526) (QUOTE (-1197)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-557))) (-12 (|HasAttribute| |#1| (QUOTE -4411)) (|HasAttribute| |#1| (QUOTE -4422)) (|HasCategory| |#1| (QUOTE (-464)))) (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) +((-4410 -12 (|has| |#1| (-6 -4421)) (|has| |#1| (-464)) (|has| |#1| (-6 -4410))) (-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-1196)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#1| (QUOTE (-1039))) (|HasCategory| |#1| (QUOTE (-840))) (|HasCategory| |#1| (QUOTE (-859))) (-3955 (|HasCategory| |#1| (QUOTE (-840))) (|HasCategory| |#1| (QUOTE (-859)))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-1171))) (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#1| (|%list| (QUOTE -526) (QUOTE (-1196)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-556))) (-12 (|HasAttribute| |#1| (QUOTE -4410)) (|HasAttribute| |#1| (QUOTE -4421)) (|HasCategory| |#1| (QUOTE (-464)))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) (-420 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 @@ -1618,28 +1618,28 @@ NIL NIL (-422 R UP) ((|constructor| (NIL "A \\spadtype{FramedAlgebra} is a \\spadtype{FiniteRankAlgebra} together with a fixed \\spad{R}-module basis.")) (|regularRepresentation| (((|Matrix| |#1|) $) "\\spad{regularRepresentation(a)} returns the matrix of the linear map defined by left multiplication by \\spad{a} with respect to the fixed basis.")) (|discriminant| ((|#1|) "\\spad{discriminant()} = determinant(traceMatrix()).")) (|traceMatrix| (((|Matrix| |#1|)) "\\spad{traceMatrix()} is the \\spad{n}-by-\\spad{n} matrix ( \\spad{Tr(vi * vj)} ),{} where \\spad{v1},{} ...,{} vn are the elements of the fixed basis.")) (|convert| (($ (|Vector| |#1|)) "\\spad{convert([a1,..,an])} returns \\spad{a1*v1 + ... + an*vn},{} where \\spad{v1},{} ...,{} vn are the elements of the fixed basis.") (((|Vector| |#1|) $) "\\spad{convert(a)} returns the coordinates of \\spad{a} with respect to the fixed \\spad{R}-module basis.")) (|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{R}-module basis.")) (|basis| (((|Vector| $)) "\\spad{basis()} returns the fixed \\spad{R}-module basis."))) -((-4418 . T) (-4419 . T) (-4421 . T)) +((-4417 . T) (-4418 . T) (-4420 . T)) NIL (-423 A S) ((|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 -((|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) +((|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-424 S) ((|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 -(-425 R -3494 UP A) +(-425 R -3493 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)}."))) -((-4421 . T)) +((-4420 . T)) NIL (-426 R1 F1 U1 A1 R2 F2 U2 A2) ((|constructor| (NIL "\\indented{1}{Lifting of morphisms to fractional ideals.} Author: Manuel Bronstein Date Created: 1 Feb 1989 Date Last Updated: 27 Feb 1990 Keywords: ideal,{} algebra,{} module.")) (|map| (((|FractionalIdeal| |#5| |#6| |#7| |#8|) (|Mapping| |#5| |#1|) (|FractionalIdeal| |#1| |#2| |#3| |#4|)) "\\spad{map(f,i)} \\undocumented{}"))) NIL NIL -(-427 R -3494 UP A |ibasis|) +(-427 R -3493 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 -1058) (|devaluate| |#2|)))) +((|HasCategory| |#4| (|%list| (QUOTE -1057) (|devaluate| |#2|)))) (-428 AR R AS S) ((|constructor| (NIL "\\spad{FramedNonAssociativeAlgebraFunctions2} implements functions between two framed non associative algebra domains defined over different rings. The function map is used to coerce between algebras over different domains having the same structural constants.")) (|map| ((|#3| (|Mapping| |#4| |#2|) |#1|) "\\spad{map(f,u)} maps \\spad{f} onto the coordinates of \\spad{u} to get an element in \\spad{AS} via identification of the basis of \\spad{AR} as beginning part of the basis of \\spad{AS}."))) NIL @@ -1650,7 +1650,7 @@ NIL ((|HasCategory| |#2| (QUOTE (-376)))) (-430 R) ((|constructor| (NIL "FramedNonAssociativeAlgebra(\\spad{R}) is a \\spadtype{FiniteRankNonAssociativeAlgebra} (\\spadignore{i.e.} a non associative algebra over \\spad{R} which is a free \\spad{R}-module of finite rank) over a commutative ring \\spad{R} together with a fixed \\spad{R}-module basis.")) (|apply| (($ (|Matrix| |#1|) $) "\\spad{apply(m,a)} defines a left operation of \\spad{n} by \\spad{n} matrices where \\spad{n} is the rank of the algebra in terms of matrix-vector multiplication,{} this is a substitute for a left module structure. Error: if shape of matrix doesn't fit.")) (|rightRankPolynomial| (((|SparseUnivariatePolynomial| (|Polynomial| |#1|))) "\\spad{rightRankPolynomial()} calculates the right minimal polynomial of the generic element in the algebra,{} defined by the same structural constants over the polynomial ring in symbolic coefficients with respect to the fixed basis.")) (|leftRankPolynomial| (((|SparseUnivariatePolynomial| (|Polynomial| |#1|))) "\\spad{leftRankPolynomial()} calculates the left minimal polynomial of the generic element in the algebra,{} defined by the same structural constants over the polynomial ring in symbolic coefficients with respect to the fixed basis.")) (|rightRegularRepresentation| (((|Matrix| |#1|) $) "\\spad{rightRegularRepresentation(a)} returns the matrix of the linear map defined by right multiplication by \\spad{a} with respect to the fixed \\spad{R}-module basis.")) (|leftRegularRepresentation| (((|Matrix| |#1|) $) "\\spad{leftRegularRepresentation(a)} returns the matrix of the linear map defined by left multiplication by \\spad{a} with respect to the fixed \\spad{R}-module basis.")) (|rightTraceMatrix| (((|Matrix| |#1|)) "\\spad{rightTraceMatrix()} is the \\spad{n}-by-\\spad{n} matrix whose element at the \\spad{i}\\spad{-}th row and \\spad{j}\\spad{-}th column is given by the right trace of the product \\spad{vi*vj},{} where \\spad{v1},{}...,{}\\spad{vn} are the elements of the fixed \\spad{R}-module basis.")) (|leftTraceMatrix| (((|Matrix| |#1|)) "\\spad{leftTraceMatrix()} is the \\spad{n}-by-\\spad{n} matrix whose element at the \\spad{i}\\spad{-}th row and \\spad{j}\\spad{-}th column is given by left trace of the product \\spad{vi*vj},{} where \\spad{v1},{}...,{}\\spad{vn} are the elements of the fixed \\spad{R}-module basis.")) (|rightDiscriminant| ((|#1|) "\\spad{rightDiscriminant()} returns the determinant of the \\spad{n}-by-\\spad{n} matrix whose element at the \\spad{i}\\spad{-}th row and \\spad{j}\\spad{-}th column is given by the right trace of the product \\spad{vi*vj},{} where \\spad{v1},{}...,{}\\spad{vn} are the elements of the fixed \\spad{R}-module basis. Note: the same as \\spad{determinant(rightTraceMatrix())}.")) (|leftDiscriminant| ((|#1|) "\\spad{leftDiscriminant()} returns the determinant of the \\spad{n}-by-\\spad{n} matrix whose element at the \\spad{i}\\spad{-}th row and \\spad{j}\\spad{-}th column is given by the left trace of the product \\spad{vi*vj},{} where \\spad{v1},{}...,{}\\spad{vn} are the elements of the fixed \\spad{R}-module basis. Note: the same as \\spad{determinant(leftTraceMatrix())}.")) (|convert| (($ (|Vector| |#1|)) "\\spad{convert([a1,...,an])} returns \\spad{a1*v1 + ... + an*vn},{} where \\spad{v1},{} ...,{} \\spad{vn} are the elements of the fixed \\spad{R}-module basis.") (((|Vector| |#1|) $) "\\spad{convert(a)} returns the coordinates of \\spad{a} with respect to the fixed \\spad{R}-module basis.")) (|represents| (($ (|Vector| |#1|)) "\\spad{represents([a1,...,an])} returns \\spad{a1*v1 + ... + an*vn},{} where \\spad{v1},{} ...,{} \\spad{vn} are the elements of the fixed \\spad{R}-module basis.")) (|conditionsForIdempotents| (((|List| (|Polynomial| |#1|))) "\\spad{conditionsForIdempotents()} determines a complete list of polynomial equations for the coefficients of idempotents with respect to the fixed \\spad{R}-module basis.")) (|structuralConstants| (((|Vector| (|Matrix| |#1|))) "\\spad{structuralConstants()} calculates the structural constants \\spad{[(gammaijk) for k in 1..rank()]} defined by \\spad{vi * vj = gammaij1 * v1 + ... + gammaijn * vn},{} where \\spad{v1},{}...,{}\\spad{vn} is the fixed \\spad{R}-module basis.")) (|coordinates| (((|Matrix| |#1|) (|Vector| $)) "\\spad{coordinates([a1,...,am])} returns a matrix whose \\spad{i}-th row is formed by the coordinates of \\spad{ai} with respect to the fixed \\spad{R}-module basis.") (((|Vector| |#1|) $) "\\spad{coordinates(a)} returns the coordinates of \\spad{a} with respect to the fixed \\spad{R}-module basis.")) (|basis| (((|Vector| $)) "\\spad{basis()} returns the fixed \\spad{R}-module basis."))) -((-4421 |has| |#1| (-569)) (-4419 . T) (-4418 . T)) +((-4420 |has| |#1| (-568)) (-4418 . T) (-4417 . T)) NIL (-431 R) ((|constructor| (NIL "\\spadtype{FactoredFunctionUtilities} implements some utility functions for manipulating factored objects.")) (|mergeFactors| (((|Factored| |#1|) (|Factored| |#1|) (|Factored| |#1|)) "\\spad{mergeFactors(u,v)} is used when the factorizations of \\spadvar{\\spad{u}} and \\spadvar{\\spad{v}} are known to be disjoint,{} \\spadignore{e.g.} resulting from a content/primitive part split. Essentially,{} it creates a new factored object by multiplying the units together and appending the lists of factors.")) (|refine| (((|Factored| |#1|) (|Factored| |#1|) (|Mapping| (|Factored| |#1|) |#1|)) "\\spad{refine(u,fn)} is used to apply the function \\userfun{\\spad{fn}} to each factor of \\spadvar{\\spad{u}} and then build a new factored object from the results. For example,{} if \\spadvar{\\spad{u}} were created by calling \\spad{nilFactor(10,2)} then \\spad{refine(u,factor)} would create a factored object equal to that created by \\spad{factor(100)} or \\spad{primeFactor(2,2) * primeFactor(5,2)}."))) @@ -1659,10 +1659,10 @@ NIL (-432 S 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| |#2| (|Kernel| $)) (|SparseMultivariatePolynomial| |#2| (|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| |#2| (|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| |#2| (|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| |#2|)))) "\\spad{coerce(f)} returns \\spad{f} as an element of \\%.") (($ (|Polynomial| (|Fraction| |#2|))) "\\spad{coerce(p)} returns \\spad{p} as an element of \\%.") (($ (|Fraction| |#2|)) "\\spad{coerce(q)} returns \\spad{q} as an element of \\%.") (($ (|SparseMultivariatePolynomial| |#2| (|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| ((|#2| $) "\\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}."))) NIL -((|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-485))) (|HasCategory| |#2| (QUOTE (-1132))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547))))) +((|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-485))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546))))) (-433 R) ((|constructor| (NIL "A space of formal functions with arguments in an arbitrary ordered set.")) (|univariate| (((|Fraction| (|SparseUnivariatePolynomial| $)) $ (|Kernel| $)) "\\spad{univariate(f, k)} returns \\spad{f} viewed as a univariate fraction in \\spad{k}.")) (/ (($ (|SparseMultivariatePolynomial| |#1| (|Kernel| $)) (|SparseMultivariatePolynomial| |#1| (|Kernel| $))) "\\spad{p1/p2} returns the quotient of \\spad{p1} and \\spad{p2} as an element of \\%.")) (|denominator| (($ $) "\\spad{denominator(f)} returns the denominator of \\spad{f} converted to \\%.")) (|denom| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{denom(f)} returns the denominator of \\spad{f} viewed as a polynomial in the kernels over \\spad{R}.")) (|convert| (($ (|Factored| $)) "\\spad{convert(f1\\^e1 ... fm\\^em)} returns \\spad{(f1)\\^e1 ... (fm)\\^em} as an element of \\%,{} using formal kernels created using a \\spadfunFrom{paren}{ExpressionSpace}.")) (|isPower| (((|Union| (|Record| (|:| |val| $) (|:| |exponent| (|Integer|))) "failed") $) "\\spad{isPower(p)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0}.")) (|numerator| (($ $) "\\spad{numerator(f)} returns the numerator of \\spad{f} converted to \\%.")) (|numer| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{numer(f)} returns the numerator of \\spad{f} viewed as a polynomial in the kernels over \\spad{R} if \\spad{R} is an integral domain. If not,{} then numer(\\spad{f}) = \\spad{f} viewed as a polynomial in the kernels over \\spad{R}.")) (|coerce| (($ (|Fraction| (|Polynomial| (|Fraction| |#1|)))) "\\spad{coerce(f)} returns \\spad{f} as an element of \\%.") (($ (|Polynomial| (|Fraction| |#1|))) "\\spad{coerce(p)} returns \\spad{p} as an element of \\%.") (($ (|Fraction| |#1|)) "\\spad{coerce(q)} returns \\spad{q} as an element of \\%.") (($ (|SparseMultivariatePolynomial| |#1| (|Kernel| $))) "\\spad{coerce(p)} returns \\spad{p} as an element of \\%.")) (|isMult| (((|Union| (|Record| (|:| |coef| (|Integer|)) (|:| |var| (|Kernel| $))) "failed") $) "\\spad{isMult(p)} returns \\spad{[n, x]} if \\spad{p = n * x} and \\spad{n <> 0}.")) (|isPlus| (((|Union| (|List| $) "failed") $) "\\spad{isPlus(p)} returns \\spad{[m1,...,mn]} if \\spad{p = m1 +...+ mn} and \\spad{n > 1}.")) (|isExpt| (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $ (|Symbol|)) "\\spad{isExpt(p,f)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0} and \\spad{x = f(a)}.") (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $ (|BasicOperator|)) "\\spad{isExpt(p,op)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0} and \\spad{x = op(a)}.") (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $) "\\spad{isExpt(p)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0}.")) (|isTimes| (((|Union| (|List| $) "failed") $) "\\spad{isTimes(p)} returns \\spad{[a1,...,an]} if \\spad{p = a1*...*an} and \\spad{n > 1}.")) (** (($ $ (|NonNegativeInteger|)) "\\spad{x**n} returns \\spad{x} * \\spad{x} * \\spad{x} * ... * \\spad{x} (\\spad{n} times).")) (|eval| (($ $ (|Symbol|) (|NonNegativeInteger|) (|Mapping| $ $)) "\\spad{eval(x, s, n, f)} replaces every \\spad{s(a)**n} in \\spad{x} by \\spad{f(a)} for any \\spad{a}.") (($ $ (|Symbol|) (|NonNegativeInteger|) (|Mapping| $ (|List| $))) "\\spad{eval(x, s, n, f)} replaces every \\spad{s(a1,...,am)**n} in \\spad{x} by \\spad{f(a1,...,am)} for any \\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}."))) -((-4421 -3956 (|has| |#1| (-1069)) (|has| |#1| (-485))) (-4419 |has| |#1| (-175)) (-4418 |has| |#1| (-175)) ((-4426 "*") |has| |#1| (-569)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-569)) (-4416 |has| |#1| (-569))) +((-4420 -3955 (|has| |#1| (-1068)) (|has| |#1| (-485))) (-4418 |has| |#1| (-175)) (-4417 |has| |#1| (-175)) ((-4425 "*") |has| |#1| (-568)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-568)) (-4415 |has| |#1| (-568))) NIL (-434 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}."))) @@ -1679,36 +1679,36 @@ NIL (-437 A S) ((|constructor| (NIL "A finite-set aggregate models the notion of a finite set,{} that is,{} a collection of elements characterized by membership,{} but not by order or multiplicity. See \\spadtype{Set} for an example.")) (|min| ((|#2| $) "\\spad{min(u)} returns the smallest element of aggregate \\spad{u}.")) (|max| ((|#2| $) "\\spad{max(u)} returns the largest element of aggregate \\spad{u}.")) (|universe| (($) "\\spad{universe()}\\$\\spad{D} returns the universal set for finite set aggregate \\spad{D}.")) (|complement| (($ $) "\\spad{complement(u)} returns the complement of the set \\spad{u},{} \\spadignore{i.e.} the set of all values not in \\spad{u}.")) (|cardinality| (((|NonNegativeInteger|) $) "\\spad{cardinality(u)} returns the number of elements of \\spad{u}. Note: \\axiom{cardinality(\\spad{u}) = \\#u}."))) NIL -((|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-381)))) +((|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-381)))) (-438 S) ((|constructor| (NIL "A finite-set aggregate models the notion of a finite set,{} that is,{} a collection of elements characterized by membership,{} but not by order or multiplicity. See \\spadtype{Set} for an example.")) (|min| ((|#1| $) "\\spad{min(u)} returns the smallest element of aggregate \\spad{u}.")) (|max| ((|#1| $) "\\spad{max(u)} returns the largest element of aggregate \\spad{u}.")) (|universe| (($) "\\spad{universe()}\\$\\spad{D} returns the universal set for finite set aggregate \\spad{D}.")) (|complement| (($ $) "\\spad{complement(u)} returns the complement of the set \\spad{u},{} \\spadignore{i.e.} the set of all values not in \\spad{u}.")) (|cardinality| (((|NonNegativeInteger|) $) "\\spad{cardinality(u)} returns the number of elements of \\spad{u}. Note: \\axiom{cardinality(\\spad{u}) = \\#u}."))) -((-4424 . T) (-4414 . T) (-4425 . T)) +((-4423 . T) (-4413 . T) (-4424 . T)) NIL (-439 S A R B) ((|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 -(-440 R -3494) +(-440 R -3493) ((|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 (-441 R E) ((|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"))) -((-4411 -12 (|has| |#1| (-6 -4411)) (|has| |#2| (-6 -4411))) (-4418 . T) (-4419 . T) (-4421 . T)) -((-12 (|HasAttribute| |#1| (QUOTE -4411)) (|HasAttribute| |#2| (QUOTE -4411)))) -(-442 R -3494) +((-4410 -12 (|has| |#1| (-6 -4410)) (|has| |#2| (-6 -4410))) (-4417 . T) (-4418 . T) (-4420 . T)) +((-12 (|HasAttribute| |#1| (QUOTE -4410)) (|HasAttribute| |#2| (QUOTE -4410)))) +(-442 R -3493) ((|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 -(-443 R -3494) +(-443 R -3493) ((|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 -(-444 R -3494) +(-444 R -3493) ((|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)))) -(-445 R -3494) +(-445 R -3493) ((|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 @@ -1716,10 +1716,10 @@ 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 -(-447 R -3494 UP) +(-447 R -3493 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 -1058) (QUOTE (-48))))) +((|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-48))))) (-448) ((|constructor| (NIL "Creates and manipulates objects which correspond to FORTRAN data types,{} including array dimensions.")) (|fortranCharacter| (($) "\\spad{fortranCharacter()} returns CHARACTER,{} an element of FortranType")) (|fortranDoubleComplex| (($) "\\spad{fortranDoubleComplex()} returns DOUBLE COMPLEX,{} an element of FortranType")) (|fortranComplex| (($) "\\spad{fortranComplex()} returns COMPLEX,{} an element of FortranType")) (|fortranLogical| (($) "\\spad{fortranLogical()} returns LOGICAL,{} an element of FortranType")) (|fortranInteger| (($) "\\spad{fortranInteger()} returns INTEGER,{} an element of FortranType")) (|fortranDouble| (($) "\\spad{fortranDouble()} returns DOUBLE PRECISION,{} an element of FortranType")) (|fortranReal| (($) "\\spad{fortranReal()} returns REAL,{} an element of FortranType")) (|construct| (($ (|Union| (|:| |fst| (|FortranScalarType|)) (|:| |void| #1="void")) (|List| (|Polynomial| (|Integer|))) (|Boolean|)) "\\spad{construct(type,dims)} creates an element of FortranType") (($ (|Union| (|:| |fst| (|FortranScalarType|)) (|:| |void| #1#)) (|List| (|Symbol|)) (|Boolean|)) "\\spad{construct(type,dims)} creates an element of FortranType")) (|external?| (((|Boolean|) $) "\\spad{external?(u)} returns \\spad{true} if \\spad{u} is declared to be EXTERNAL")) (|dimensionsOf| (((|List| (|Polynomial| (|Integer|))) $) "\\spad{dimensionsOf(t)} returns the dimensions of \\spad{t}")) (|scalarTypeOf| (((|Union| (|:| |fst| (|FortranScalarType|)) (|:| |void| #1#)) $) "\\spad{scalarTypeOf(t)} returns the FORTRAN data type of \\spad{t}")) (|coerce| (($ (|FortranScalarType|)) "\\spad{coerce(t)} creates an element from a scalar type"))) NIL @@ -1748,7 +1748,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 -(-455 R UP -3494) +(-455 R UP -3493) ((|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 @@ -1786,16 +1786,16 @@ NIL NIL (-464) ((|constructor| (NIL "This category describes domains where \\spadfun{gcd} can be computed but where there is no guarantee of the existence of \\spadfun{factor} operation for factorisation into irreducibles. However,{} if such a \\spadfun{factor} operation exist,{} factorization will be unique up to order and units.")) (|lcm| (($ (|List| $)) "\\spad{lcm(l)} returns the least common multiple of the elements of the list \\spad{l}.") (($ $ $) "\\spad{lcm(x,y)} returns the least common multiple of \\spad{x} and \\spad{y}.")) (|gcd| (($ (|List| $)) "\\spad{gcd(l)} returns the common gcd of the elements in the list \\spad{l}.") (($ $ $) "\\spad{gcd(x,y)} returns the greatest common divisor of \\spad{x} and \\spad{y}."))) -((-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-465 R |n| |ls| |gamma|) ((|constructor| (NIL "AlgebraGenericElementPackage allows you to create generic elements of an algebra,{} \\spadignore{i.e.} the scalars are extended to include symbolic coefficients")) (|conditionsForIdempotents| (((|List| (|Polynomial| |#1|))) "\\spad{conditionsForIdempotents()} determines a complete list of polynomial equations for the coefficients of idempotents with respect to the fixed \\spad{R}-module basis") (((|List| (|Polynomial| |#1|)) (|Vector| $)) "\\spad{conditionsForIdempotents([v1,...,vn])} determines a complete list of polynomial equations for the coefficients of idempotents with respect to the \\spad{R}-module basis \\spad{v1},{}...,{}\\spad{vn}")) (|genericRightDiscriminant| (((|Fraction| (|Polynomial| |#1|))) "\\spad{genericRightDiscriminant()} is the determinant of the generic left trace forms of all products of basis element,{} if the generic left trace form is associative,{} an algebra is separable if the generic left discriminant is invertible,{} if it is non-zero,{} there is some ring extension which makes the algebra separable")) (|genericRightTraceForm| (((|Fraction| (|Polynomial| |#1|)) $ $) "\\spad{genericRightTraceForm (a,b)} is defined to be \\spadfun{genericRightTrace (a*b)},{} this defines a symmetric bilinear form on the algebra")) (|genericLeftDiscriminant| (((|Fraction| (|Polynomial| |#1|))) "\\spad{genericLeftDiscriminant()} is the determinant of the generic left trace forms of all products of basis element,{} if the generic left trace form is associative,{} an algebra is separable if the generic left discriminant is invertible,{} if it is non-zero,{} there is some ring extension which makes the algebra separable")) (|genericLeftTraceForm| (((|Fraction| (|Polynomial| |#1|)) $ $) "\\spad{genericLeftTraceForm (a,b)} is defined to be \\spad{genericLeftTrace (a*b)},{} this defines a symmetric bilinear form on the algebra")) (|genericRightNorm| (((|Fraction| (|Polynomial| |#1|)) $) "\\spad{genericRightNorm(a)} substitutes the coefficients of \\spad{a} for the generic coefficients into the coefficient of the constant term in \\spadfun{rightRankPolynomial} and changes the sign if the degree of this polynomial is odd")) (|genericRightTrace| (((|Fraction| (|Polynomial| |#1|)) $) "\\spad{genericRightTrace(a)} substitutes the coefficients of \\spad{a} for the generic coefficients into the coefficient of the second highest term in \\spadfun{rightRankPolynomial} and changes the sign")) (|genericRightMinimalPolynomial| (((|SparseUnivariatePolynomial| (|Fraction| (|Polynomial| |#1|))) $) "\\spad{genericRightMinimalPolynomial(a)} substitutes the coefficients of \\spad{a} for the generic coefficients in \\spadfun{rightRankPolynomial}")) (|rightRankPolynomial| (((|SparseUnivariatePolynomial| (|Fraction| (|Polynomial| |#1|)))) "\\spad{rightRankPolynomial()} returns the right minimimal polynomial of the generic element")) (|genericLeftNorm| (((|Fraction| (|Polynomial| |#1|)) $) "\\spad{genericLeftNorm(a)} substitutes the coefficients of \\spad{a} for the generic coefficients into the coefficient of the constant term in \\spadfun{leftRankPolynomial} and changes the sign if the degree of this polynomial is odd. This is a form of degree \\spad{k}")) (|genericLeftTrace| (((|Fraction| (|Polynomial| |#1|)) $) "\\spad{genericLeftTrace(a)} substitutes the coefficients of \\spad{a} for the generic coefficients into the coefficient of the second highest term in \\spadfun{leftRankPolynomial} and changes the sign. \\indented{1}{This is a linear form}")) (|genericLeftMinimalPolynomial| (((|SparseUnivariatePolynomial| (|Fraction| (|Polynomial| |#1|))) $) "\\spad{genericLeftMinimalPolynomial(a)} substitutes the coefficients of {em a} for the generic coefficients in \\spad{leftRankPolynomial()}")) (|leftRankPolynomial| (((|SparseUnivariatePolynomial| (|Fraction| (|Polynomial| |#1|)))) "\\spad{leftRankPolynomial()} returns the left minimimal polynomial of the generic element")) (|generic| (($ (|Vector| (|Symbol|)) (|Vector| $)) "\\spad{generic(vs,ve)} returns a generic element,{} \\spadignore{i.e.} the linear combination of \\spad{ve} with the symbolic coefficients \\spad{vs} error,{} if the vector of symbols is shorter than the vector of elements") (($ (|Symbol|) (|Vector| $)) "\\spad{generic(s,v)} returns a generic element,{} \\spadignore{i.e.} the linear combination of \\spad{v} with the symbolic coefficients \\spad{s1,s2,..}") (($ (|Vector| $)) "\\spad{generic(ve)} returns a generic element,{} \\spadignore{i.e.} the linear combination of \\spad{ve} basis with the symbolic coefficients \\spad{\\%x1,\\%x2,..}") (($ (|Vector| (|Symbol|))) "\\spad{generic(vs)} returns a generic element,{} \\spadignore{i.e.} the linear combination of the fixed basis with the symbolic coefficients \\spad{vs}; error,{} if the vector of symbols is too short") (($ (|Symbol|)) "\\spad{generic(s)} returns a generic element,{} \\spadignore{i.e.} the linear combination of the fixed basis with the symbolic coefficients \\spad{s1,s2,..}") (($) "\\spad{generic()} returns a generic element,{} \\spadignore{i.e.} the linear combination of the fixed basis with the symbolic coefficients \\spad{\\%x1,\\%x2,..}")) (|rightUnits| (((|Union| (|Record| (|:| |particular| $) (|:| |basis| (|List| $))) "failed")) "\\spad{rightUnits()} returns the affine space of all right units of the algebra,{} or \\spad{\"failed\"} if there is none")) (|leftUnits| (((|Union| (|Record| (|:| |particular| $) (|:| |basis| (|List| $))) "failed")) "\\spad{leftUnits()} returns the affine space of all left units of the algebra,{} or \\spad{\"failed\"} if there is none")) (|coerce| (($ (|Vector| (|Fraction| (|Polynomial| |#1|)))) "\\spad{coerce(v)} assumes that it is called with a vector of length equal to the dimension of the algebra,{} then a linear combination with the basis element is formed"))) -((-4421 |has| (-419 (-964 |#1|)) (-569)) (-4419 . T) (-4418 . T)) -((|HasCategory| (-419 (-964 |#1|)) (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| (-419 (-964 |#1|)) (QUOTE (-569)))) +((-4420 |has| (-419 (-963 |#1|)) (-568)) (-4418 . T) (-4417 . T)) +((|HasCategory| (-419 (-963 |#1|)) (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| (-419 (-963 |#1|)) (QUOTE (-568)))) (-466 |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"))) -(((-4426 "*") |has| |#2| (-175)) (-4417 |has| |#2| (-569)) (-4422 |has| |#2| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#2| (QUOTE (-928))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-928)))) (-3956 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-928)))) (-3956 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-928)))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-175))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-569)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -630) (QUOTE (-547))))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4422)) (|HasCategory| |#2| (QUOTE (-464))) (-12 (|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#2| (QUOTE (-147))))) +(((-4425 "*") |has| |#2| (-175)) (-4416 |has| |#2| (-568)) (-4421 |has| |#2| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#2| (QUOTE (-927))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-927)))) (-3955 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-927)))) (-3955 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-927)))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-175))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-568)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -629) (QUOTE (-546))))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4421)) (|HasCategory| |#2| (QUOTE (-464))) (-12 (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#2| (QUOTE (-147))))) (-467 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 @@ -1822,7 +1822,7 @@ NIL NIL (-473 |vl| R IS E |ff| P) ((|constructor| (NIL "This package \\undocumented")) (* (($ |#6| $) "\\spad{p*x} \\undocumented")) (|multMonom| (($ |#2| |#4| $) "\\spad{multMonom(r,e,x)} \\undocumented")) (|build| (($ |#2| |#3| |#4|) "\\spad{build(r,i,e)} \\undocumented")) (|unitVector| (($ |#3|) "\\spad{unitVector(x)} \\undocumented")) (|monomial| (($ |#2| (|ModuleMonomial| |#3| |#4| |#5|)) "\\spad{monomial(r,x)} \\undocumented")) (|reductum| (($ $) "\\spad{reductum(x)} \\undocumented")) (|leadingIndex| ((|#3| $) "\\spad{leadingIndex(x)} \\undocumented")) (|leadingExponent| ((|#4| $) "\\spad{leadingExponent(x)} \\undocumented")) (|leadingMonomial| (((|ModuleMonomial| |#3| |#4| |#5|) $) "\\spad{leadingMonomial(x)} \\undocumented")) (|leadingCoefficient| ((|#2| $) "\\spad{leadingCoefficient(x)} \\undocumented"))) -((-4419 . T) (-4418 . T)) +((-4418 . T) (-4417 . T)) NIL (-474 E V R P Q) ((|constructor| (NIL "Gosper's summation algorithm.")) (|GospersMethod| (((|Union| |#5| "failed") |#5| |#2| (|Mapping| |#2|)) "\\spad{GospersMethod(b, n, new)} returns a rational function \\spad{rf(n)} such that \\spad{a(n) * rf(n)} is the indefinite sum of \\spad{a(n)} with respect to upward difference on \\spad{n},{} \\spadignore{i.e.} \\spad{a(n+1) * rf(n+1) - a(n) * rf(n) = a(n)},{} where \\spad{b(n) = a(n)/a(n-1)} is a rational function. Returns \"failed\" if no such rational function \\spad{rf(n)} exists. Note: \\spad{new} is a nullary function returning a new \\spad{V} every time. The condition on \\spad{a(n)} is that \\spad{a(n)/a(n-1)} is a rational function of \\spad{n}."))) @@ -1830,8 +1830,8 @@ NIL NIL (-475 R E |VarSet| P) ((|constructor| (NIL "A domain for polynomial sets.")) (|convert| (($ (|List| |#4|)) "\\axiom{convert(lp)} returns the polynomial set whose members are the polynomials of \\axiom{lp}."))) -((-4425 . T) (-4424 . T)) -((-12 (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (|HasCategory| |#4| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#4| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#4| (QUOTE (-102)))) +((-4424 . T) (-4423 . T)) +((-12 (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (|HasCategory| |#4| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#4| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#4| (QUOTE (-102)))) (-476 S R E) ((|constructor| (NIL "GradedAlgebra(\\spad{R},{}\\spad{E}) denotes ``E-graded \\spad{R}-algebra''. A graded algebra is a graded module together with a degree preserving \\spad{R}-linear map,{} called the {\\em product}. \\blankline The name ``product'' is written out in full so inner and outer products with the same mapping type can be distinguished by name.")) (|product| (($ $ $) "\\spad{product(a,b)} is the degree-preserving \\spad{R}-linear product: \\blankline \\indented{2}{\\spad{degree product(a,b) = degree a + degree b}} \\indented{2}{\\spad{product(a1+a2,b) = product(a1,b) + product(a2,b)}} \\indented{2}{\\spad{product(a,b1+b2) = product(a,b1) + product(a,b2)}} \\indented{2}{\\spad{product(r*a,b) = product(a,r*b) = r*product(a,b)}} \\indented{2}{\\spad{product(a,product(b,c)) = product(product(a,b),c)}}")) ((|One|) (($) "1 is the identity for \\spad{product}."))) NIL @@ -1860,7 +1860,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 -(-483 |lv| -3494 R) +(-483 |lv| -3493 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 @@ -1870,23 +1870,23 @@ NIL NIL (-485) ((|constructor| (NIL "The class of multiplicative groups,{} \\spadignore{i.e.} monoids with multiplicative inverses. \\blankline")) (|commutator| (($ $ $) "\\spad{commutator(p,q)} computes \\spad{inv(p) * inv(q) * p * q}.")) (|conjugate| (($ $ $) "\\spad{conjugate(p,q)} computes \\spad{inv(q) * p * q}; this is 'right action by conjugation'.")) (|unitsKnown| ((|attribute|) "unitsKnown asserts that recip only returns \"failed\" for non-units.")) (** (($ $ (|Integer|)) "\\spad{x**n} returns \\spad{x} raised to the integer power \\spad{n}.")) (/ (($ $ $) "\\spad{x/y} is the same as \\spad{x} times the inverse of \\spad{y}.")) (|inv| (($ $) "\\spad{inv(x)} returns the inverse of \\spad{x}."))) -((-4421 . T)) +((-4420 . T)) NIL (-486 |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."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-558)) (QUOTE (-1132))) (|HasCategory| |#1| (QUOTE (-376))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasSignature| |#1| (|%list| (QUOTE -4375) (|%list| (|devaluate| |#1|) (QUOTE (-1197)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-978))) (|HasCategory| |#1| (QUOTE (-1223))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasSignature| |#1| (|%list| (QUOTE -4241) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1197))))) (|HasSignature| |#1| (|%list| (QUOTE -3483) (|%list| (|%list| (QUOTE -660) (QUOTE (-1197))) (|devaluate| |#1|))))))) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-557)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-376))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasSignature| |#1| (|%list| (QUOTE -4374) (|%list| (|devaluate| |#1|) (QUOTE (-1196)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-977))) (|HasCategory| |#1| (QUOTE (-1222))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasSignature| |#1| (|%list| (QUOTE -4240) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1196))))) (|HasSignature| |#1| (|%list| (QUOTE -3482) (|%list| (|%list| (QUOTE -659) (QUOTE (-1196))) (|devaluate| |#1|))))))) (-487 |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."))) -((-4425 . T)) -((-12 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4289) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2285) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -630) (QUOTE (-547)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-860))) (-3956 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102)))) (-3956 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) +((-4424 . T)) +((-12 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4288) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2284) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -629) (QUOTE (-546)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-859))) (-3955 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102)))) (-3955 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-488 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)}"))) -((-4425 . T) (-4424 . T)) -((-12 (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (|HasCategory| |#4| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#4| (QUOTE (-102)))) +((-4424 . T) (-4423 . T)) +((-12 (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (|HasCategory| |#4| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#4| (QUOTE (-102)))) (-489) ((|constructor| (NIL "\\indented{1}{Symbolic fractions in \\%\\spad{pi} with integer coefficients;} \\indented{1}{The point for using \\spad{Pi} as the default domain for those fractions} \\indented{1}{is that \\spad{Pi} is coercible to the float types,{} and not Expression.} Date Created: 21 Feb 1990 Date Last Updated: 12 Mai 1992")) (|pi| (($) "\\spad{pi()} returns the symbolic \\%\\spad{pi}."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL (-490) ((|constructor| (NIL "This domain represents a `has' expression.")) (|rhs| (((|SpadAst|) $) "\\spad{rhs(e)} returns the right hand side of the case expression `e'.")) (|lhs| (((|SpadAst|) $) "\\spad{lhs(e)} returns the left hand side of the has expression `e'."))) @@ -1894,29 +1894,29 @@ NIL NIL (-491 |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."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4289) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2285) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -630) (QUOTE (-547)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-1121))) (-3956 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876))))) (-3956 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102)))) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4288) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2284) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -629) (QUOTE (-546)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-1120))) (-3955 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875))))) (-3955 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102)))) (-492) ((|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 NIL (-493 |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"))) -(((-4426 "*") |has| |#2| (-175)) (-4417 |has| |#2| (-569)) (-4422 |has| |#2| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#2| (QUOTE (-928))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-928)))) (-3956 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-928)))) (-3956 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-928)))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-175))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-569)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -630) (QUOTE (-547))))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4422)) (|HasCategory| |#2| (QUOTE (-464))) (-12 (|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#2| (QUOTE (-147))))) -(-494 -3019 S) +(((-4425 "*") |has| |#2| (-175)) (-4416 |has| |#2| (-568)) (-4421 |has| |#2| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#2| (QUOTE (-927))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-927)))) (-3955 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-927)))) (-3955 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-927)))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-175))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-568)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -629) (QUOTE (-546))))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4421)) (|HasCategory| |#2| (QUOTE (-464))) (-12 (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#2| (QUOTE (-147))))) +(-494 -3018 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}."))) -((-4418 |has| |#2| (-1069)) (-4419 |has| |#2| (-1069)) (-4421 |has| |#2| (-6 -4421)) (-4424 . T)) -((-3956 (-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 (-745))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1069)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#2| (QUOTE (-376))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1069)))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (QUOTE (-745))) (|HasCategory| |#2| (QUOTE (-814))) (-3956 (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (QUOTE (-860)))) (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-381))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (-3956 (|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 (-745))) (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|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 (-745))) (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|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 (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|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 (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#2| (QUOTE (-240))) (-3956 (|HasCategory| |#2| (QUOTE (-240))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1069))))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -918) (QUOTE (-1197))))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#2| (QUOTE (-1121))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-745))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-745))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#2| (QUOTE (-1069)))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-745))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558)))))) (|HasCategory| (-558) (QUOTE (-860))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1069)))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -918) (QUOTE (-1197))))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#2| (QUOTE (-1069)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasAttribute| |#2| (QUOTE -4421)) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1069)))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))))) +((-4417 |has| |#2| (-1068)) (-4418 |has| |#2| (-1068)) (-4420 |has| |#2| (-6 -4420)) (-4423 . T)) +((-3955 (-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 (-744))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1068)))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#2| (QUOTE (-376))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1068)))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (QUOTE (-744))) (|HasCategory| |#2| (QUOTE (-813))) (-3955 (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (QUOTE (-859)))) (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-381))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (-3955 (|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 (-744))) (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|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 (-744))) (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|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 (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|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 (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#2| (QUOTE (-240))) (-3955 (|HasCategory| |#2| (QUOTE (-240))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1068))))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -917) (QUOTE (-1196))))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#2| (QUOTE (-1120))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-744))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-744))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#2| (QUOTE (-1068)))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-744))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557)))))) (|HasCategory| (-557) (QUOTE (-859))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1068)))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -917) (QUOTE (-1196))))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#2| (QUOTE (-1068)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasAttribute| |#2| (QUOTE -4420)) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1068)))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))))) (-495) ((|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 NIL (-496 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}."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) -(-497 -3494 UP UPUP R) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102)))) +(-497 -3493 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 @@ -1926,12 +1926,12 @@ NIL NIL (-499) ((|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."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| (-558) (QUOTE (-928))) (|HasCategory| (-558) (|%list| (QUOTE -1058) (QUOTE (-1197)))) (|HasCategory| (-558) (QUOTE (-147))) (|HasCategory| (-558) (QUOTE (-149))) (|HasCategory| (-558) (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-558) (QUOTE (-1040))) (|HasCategory| (-558) (QUOTE (-841))) (|HasCategory| (-558) (QUOTE (-860))) (-3956 (|HasCategory| (-558) (QUOTE (-841))) (|HasCategory| (-558) (QUOTE (-860)))) (|HasCategory| (-558) (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| (-558) (QUOTE (-1172))) (|HasCategory| (-558) (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-558) (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-558) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-558) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-558) (QUOTE (-239))) (|HasCategory| (-558) (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| (-558) (QUOTE (-240))) (|HasCategory| (-558) (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| (-558) (|%list| (QUOTE -526) (QUOTE (-1197)) (QUOTE (-558)))) (|HasCategory| (-558) (|%list| (QUOTE -321) (QUOTE (-558)))) (|HasCategory| (-558) (|%list| (QUOTE -298) (QUOTE (-558)) (QUOTE (-558)))) (|HasCategory| (-558) (QUOTE (-319))) (|HasCategory| (-558) (QUOTE (-557))) (|HasCategory| (-558) (|%list| (QUOTE -657) (QUOTE (-558)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-558) (QUOTE (-928)))) (-3956 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-558) (QUOTE (-928)))) (|HasCategory| (-558) (QUOTE (-147))))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| (-557) (QUOTE (-927))) (|HasCategory| (-557) (|%list| (QUOTE -1057) (QUOTE (-1196)))) (|HasCategory| (-557) (QUOTE (-147))) (|HasCategory| (-557) (QUOTE (-149))) (|HasCategory| (-557) (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-557) (QUOTE (-1039))) (|HasCategory| (-557) (QUOTE (-840))) (|HasCategory| (-557) (QUOTE (-859))) (-3955 (|HasCategory| (-557) (QUOTE (-840))) (|HasCategory| (-557) (QUOTE (-859)))) (|HasCategory| (-557) (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| (-557) (QUOTE (-1171))) (|HasCategory| (-557) (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-557) (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-557) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-557) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-557) (QUOTE (-239))) (|HasCategory| (-557) (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| (-557) (QUOTE (-240))) (|HasCategory| (-557) (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| (-557) (|%list| (QUOTE -526) (QUOTE (-1196)) (QUOTE (-557)))) (|HasCategory| (-557) (|%list| (QUOTE -321) (QUOTE (-557)))) (|HasCategory| (-557) (|%list| (QUOTE -298) (QUOTE (-557)) (QUOTE (-557)))) (|HasCategory| (-557) (QUOTE (-319))) (|HasCategory| (-557) (QUOTE (-556))) (|HasCategory| (-557) (|%list| (QUOTE -656) (QUOTE (-557)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-557) (QUOTE (-927)))) (-3955 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-557) (QUOTE (-927)))) (|HasCategory| (-557) (QUOTE (-147))))) (-500 A S) ((|constructor| (NIL "A homogeneous aggregate is an aggregate of elements all of the same type. In the current system,{} all aggregates are homogeneous. Two attributes characterize classes of aggregates. Aggregates from domains with attribute \\spadatt{finiteAggregate} have a finite number of members. Those with attribute \\spadatt{shallowlyMutable} allow an element to be modified or updated without changing its overall value.")) (|member?| (((|Boolean|) |#2| $) "\\spad{member?(x,u)} tests if \\spad{x} is a member of \\spad{u}. For collections,{} \\axiom{member?(\\spad{x},{}\\spad{u}) = reduce(or,{}[x=y for \\spad{y} in \\spad{u}],{}\\spad{false})}.")) (|members| (((|List| |#2|) $) "\\spad{members(u)} returns a list of the consecutive elements of \\spad{u}. For collections,{} \\axiom{parts([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = (\\spad{x},{}\\spad{y},{}...,{}\\spad{z})}.")) (|parts| (((|List| |#2|) $) "\\spad{parts(u)} returns a list of the consecutive elements of \\spad{u}. For collections,{} \\axiom{parts([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = (\\spad{x},{}\\spad{y},{}...,{}\\spad{z})}.")) (|count| (((|NonNegativeInteger|) |#2| $) "\\spad{count(x,u)} returns the number of occurrences of \\spad{x} in \\spad{u}. For collections,{} \\axiom{count(\\spad{x},{}\\spad{u}) = reduce(+,{}[x=y for \\spad{y} in \\spad{u}],{}0)}.") (((|NonNegativeInteger|) (|Mapping| (|Boolean|) |#2|) $) "\\spad{count(p,u)} returns the number of elements \\spad{x} in \\spad{u} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}. For collections,{} \\axiom{count(\\spad{p},{}\\spad{u}) = reduce(+,{}[1 for \\spad{x} in \\spad{u} | \\spad{p}(\\spad{x})],{}0)}.")) (|every?| (((|Boolean|) (|Mapping| (|Boolean|) |#2|) $) "\\spad{every?(f,u)} tests if \\spad{p}(\\spad{x}) is \\spad{true} for all elements \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{every?(\\spad{p},{}\\spad{u}) = reduce(and,{}map(\\spad{f},{}\\spad{u}),{}\\spad{true},{}\\spad{false})}.")) (|any?| (((|Boolean|) (|Mapping| (|Boolean|) |#2|) $) "\\spad{any?(p,u)} tests if \\axiom{\\spad{p}(\\spad{x})} is \\spad{true} for any element \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{any?(\\spad{p},{}\\spad{u}) = reduce(or,{}map(\\spad{f},{}\\spad{u}),{}\\spad{false},{}\\spad{true})}.")) (|map!| (($ (|Mapping| |#2| |#2|) $) "\\spad{map!(f,u)} destructively replaces each element \\spad{x} of \\spad{u} by \\axiom{\\spad{f}(\\spad{x})}.")) (|map| (($ (|Mapping| |#2| |#2|) $) "\\spad{map(f,u)} returns a copy of \\spad{u} with each element \\spad{x} replaced by \\spad{f}(\\spad{x}). For collections,{} \\axiom{map(\\spad{f},{}\\spad{u}) = [\\spad{f}(\\spad{x}) for \\spad{x} in \\spad{u}]}."))) NIL -((|HasAttribute| |#1| (QUOTE -4424)) (|HasAttribute| |#1| (QUOTE -4425)) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876))))) +((|HasAttribute| |#1| (QUOTE -4423)) (|HasAttribute| |#1| (QUOTE -4424)) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875))))) (-501 S) ((|constructor| (NIL "A homogeneous aggregate is an aggregate of elements all of the same type. In the current system,{} all aggregates are homogeneous. Two attributes characterize classes of aggregates. Aggregates from domains with attribute \\spadatt{finiteAggregate} have a finite number of members. Those with attribute \\spadatt{shallowlyMutable} allow an element to be modified or updated without changing its overall value.")) (|member?| (((|Boolean|) |#1| $) "\\spad{member?(x,u)} tests if \\spad{x} is a member of \\spad{u}. For collections,{} \\axiom{member?(\\spad{x},{}\\spad{u}) = reduce(or,{}[x=y for \\spad{y} in \\spad{u}],{}\\spad{false})}.")) (|members| (((|List| |#1|) $) "\\spad{members(u)} returns a list of the consecutive elements of \\spad{u}. For collections,{} \\axiom{parts([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = (\\spad{x},{}\\spad{y},{}...,{}\\spad{z})}.")) (|parts| (((|List| |#1|) $) "\\spad{parts(u)} returns a list of the consecutive elements of \\spad{u}. For collections,{} \\axiom{parts([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = (\\spad{x},{}\\spad{y},{}...,{}\\spad{z})}.")) (|count| (((|NonNegativeInteger|) |#1| $) "\\spad{count(x,u)} returns the number of occurrences of \\spad{x} in \\spad{u}. For collections,{} \\axiom{count(\\spad{x},{}\\spad{u}) = reduce(+,{}[x=y for \\spad{y} in \\spad{u}],{}0)}.") (((|NonNegativeInteger|) (|Mapping| (|Boolean|) |#1|) $) "\\spad{count(p,u)} returns the number of elements \\spad{x} in \\spad{u} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}. For collections,{} \\axiom{count(\\spad{p},{}\\spad{u}) = reduce(+,{}[1 for \\spad{x} in \\spad{u} | \\spad{p}(\\spad{x})],{}0)}.")) (|every?| (((|Boolean|) (|Mapping| (|Boolean|) |#1|) $) "\\spad{every?(f,u)} tests if \\spad{p}(\\spad{x}) is \\spad{true} for all elements \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{every?(\\spad{p},{}\\spad{u}) = reduce(and,{}map(\\spad{f},{}\\spad{u}),{}\\spad{true},{}\\spad{false})}.")) (|any?| (((|Boolean|) (|Mapping| (|Boolean|) |#1|) $) "\\spad{any?(p,u)} tests if \\axiom{\\spad{p}(\\spad{x})} is \\spad{true} for any element \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{any?(\\spad{p},{}\\spad{u}) = reduce(or,{}map(\\spad{f},{}\\spad{u}),{}\\spad{false},{}\\spad{true})}.")) (|map!| (($ (|Mapping| |#1| |#1|) $) "\\spad{map!(f,u)} destructively replaces each element \\spad{x} of \\spad{u} by \\axiom{\\spad{f}(\\spad{x})}.")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(f,u)} returns a copy of \\spad{u} with each element \\spad{x} replaced by \\spad{f}(\\spad{x}). For collections,{} \\axiom{map(\\spad{f},{}\\spad{u}) = [\\spad{f}(\\spad{x}) for \\spad{x} in \\spad{u}]}."))) NIL @@ -1952,34 +1952,34 @@ 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 -(-506 -3494 UP |AlExt| |AlPol|) +(-506 -3493 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 (-507) ((|constructor| (NIL "Algebraic closure of the rational numbers.")) (|norm| (($ $ (|List| (|Kernel| $))) "\\spad{norm(f,l)} computes the norm of the algebraic number \\spad{f} with respect to the extension generated by kernels \\spad{l}") (($ $ (|Kernel| $)) "\\spad{norm(f,k)} computes the norm of the algebraic number \\spad{f} with respect to the extension generated by kernel \\spad{k}") (((|SparseUnivariatePolynomial| $) (|SparseUnivariatePolynomial| $) (|List| (|Kernel| $))) "\\spad{norm(p,l)} computes the norm of the polynomial \\spad{p} with respect to the extension generated by kernels \\spad{l}") (((|SparseUnivariatePolynomial| $) (|SparseUnivariatePolynomial| $) (|Kernel| $)) "\\spad{norm(p,k)} computes the norm of the polynomial \\spad{p} with respect to the extension generated by kernel \\spad{k}")) (|trueEqual| (((|Boolean|) $ $) "\\spad{trueEqual(x,y)} tries to determine if the two numbers are equal")) (|reduce| (($ $) "\\spad{reduce(f)} simplifies all the unreduced algebraic numbers present in \\spad{f} by applying their defining relations.")) (|denom| (((|SparseMultivariatePolynomial| (|Integer|) (|Kernel| $)) $) "\\spad{denom(f)} returns the denominator of \\spad{f} viewed as a polynomial in the kernels over \\spad{Z}.")) (|numer| (((|SparseMultivariatePolynomial| (|Integer|) (|Kernel| $)) $) "\\spad{numer(f)} returns the numerator of \\spad{f} viewed as a polynomial in the kernels over \\spad{Z}.")) (|coerce| (($ (|SparseMultivariatePolynomial| (|Integer|) (|Kernel| $))) "\\spad{coerce(p)} returns \\spad{p} viewed as an algebraic number."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| $ (QUOTE (-1069))) (|HasCategory| $ (|%list| (QUOTE -1058) (QUOTE (-558))))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| $ (QUOTE (-1068))) (|HasCategory| $ (|%list| (QUOTE -1057) (QUOTE (-557))))) (-508 S |mn|) ((|constructor| (NIL "\\indented{1}{Author Micheal Monagan \\spad{Aug/87}} This is the basic one dimensional array data type."))) -((-4425 . T) (-4424 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| |#1| (QUOTE (-860))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4424 . T) (-4423 . T)) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (-3955 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| |#1| (QUOTE (-859))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-509 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."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102)))) (-510 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 -(-511 R UP -3494) +(-511 R UP -3493) ((|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 (-512 |mn|) ((|constructor| (NIL "\\spadtype{IndexedBits} is a domain to compactly represent large quantities of Boolean data.")) (|And| (($ $ $) "\\spad{And(n,m)} returns the bit-by-bit logical {\\em And} of \\spad{n} and \\spad{m}.")) (|Or| (($ $ $) "\\spad{Or(n,m)} returns the bit-by-bit logical {\\em Or} of \\spad{n} and \\spad{m}.")) (|Not| (($ $) "\\spad{Not(n)} returns the bit-by-bit logical {\\em Not} of \\spad{n}."))) -((-4425 . T) (-4424 . T)) -((-12 (|HasCategory| (-114) (QUOTE (-1121))) (|HasCategory| (-114) (|%list| (QUOTE -321) (QUOTE (-114))))) (|HasCategory| (-114) (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-114) (QUOTE (-860))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| (-114) (QUOTE (-1121))) (|HasCategory| (-114) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-114) (QUOTE (-102)))) +((-4424 . T) (-4423 . T)) +((-12 (|HasCategory| (-114) (QUOTE (-1120))) (|HasCategory| (-114) (|%list| (QUOTE -321) (QUOTE (-114))))) (|HasCategory| (-114) (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-114) (QUOTE (-859))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| (-114) (QUOTE (-1120))) (|HasCategory| (-114) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-114) (QUOTE (-102)))) (-513 K R UP L) ((|constructor| (NIL "IntegralBasisPolynomialTools provides functions for \\indented{1}{mapping functions on the coefficients of univariate and bivariate} \\indented{1}{polynomials.}")) (|mapBivariate| (((|SparseUnivariatePolynomial| (|SparseUnivariatePolynomial| |#4|)) (|Mapping| |#4| |#1|) |#3|) "\\spad{mapBivariate(f,p(x,y))} applies the function \\spad{f} to the coefficients of \\spad{p(x,y)}.")) (|mapMatrixIfCan| (((|Union| (|Matrix| |#2|) "failed") (|Mapping| (|Union| |#1| "failed") |#4|) (|Matrix| (|SparseUnivariatePolynomial| |#4|))) "\\spad{mapMatrixIfCan(f,mat)} applies the function \\spad{f} to the coefficients of the entries of \\spad{mat} if possible,{} and returns \\spad{\"failed\"} otherwise.")) (|mapUnivariateIfCan| (((|Union| |#2| "failed") (|Mapping| (|Union| |#1| "failed") |#4|) (|SparseUnivariatePolynomial| |#4|)) "\\spad{mapUnivariateIfCan(f,p(x))} applies the function \\spad{f} to the coefficients of \\spad{p(x)},{} if possible,{} and returns \\spad{\"failed\"} otherwise.")) (|mapUnivariate| (((|SparseUnivariatePolynomial| |#4|) (|Mapping| |#4| |#1|) |#2|) "\\spad{mapUnivariate(f,p(x))} applies the function \\spad{f} to the coefficients of \\spad{p(x)}.") ((|#2| (|Mapping| |#1| |#4|) (|SparseUnivariatePolynomial| |#4|)) "\\spad{mapUnivariate(f,p(x))} applies the function \\spad{f} to the coefficients of \\spad{p(x)}."))) NIL @@ -1992,10 +1992,10 @@ 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 -(-516 -3494 |Expon| |VarSet| |DPoly|) +(-516 -3493 |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 -630) (QUOTE (-1197))))) +((|HasCategory| |#3| (|%list| (QUOTE -629) (QUOTE (-1196))))) (-517 |vl| |nv|) ((|constructor| (NIL "\\indented{2}{This package provides functions for the primary decomposition of} polynomial ideals over the rational numbers. The ideals are members of the \\spadtype{PolynomialIdeals} domain,{} and the polynomial generators are required to be from the \\spadtype{DistributedMultivariatePolynomial} domain.")) (|contract| (((|PolynomialIdeals| (|Fraction| (|Integer|)) (|DirectProduct| |#2| (|NonNegativeInteger|)) (|OrderedVariableList| |#1|) (|DistributedMultivariatePolynomial| |#1| (|Fraction| (|Integer|)))) (|PolynomialIdeals| (|Fraction| (|Integer|)) (|DirectProduct| |#2| (|NonNegativeInteger|)) (|OrderedVariableList| |#1|) (|DistributedMultivariatePolynomial| |#1| (|Fraction| (|Integer|)))) (|List| (|OrderedVariableList| |#1|))) "\\spad{contract(I,lvar)} contracts the ideal \\spad{I} to the polynomial ring \\spad{F[lvar]}.")) (|primaryDecomp| (((|List| (|PolynomialIdeals| (|Fraction| (|Integer|)) (|DirectProduct| |#2| (|NonNegativeInteger|)) (|OrderedVariableList| |#1|) (|DistributedMultivariatePolynomial| |#1| (|Fraction| (|Integer|))))) (|PolynomialIdeals| (|Fraction| (|Integer|)) (|DirectProduct| |#2| (|NonNegativeInteger|)) (|OrderedVariableList| |#1|) (|DistributedMultivariatePolynomial| |#1| (|Fraction| (|Integer|))))) "\\spad{primaryDecomp(I)} returns a list of primary ideals such that their intersection is the ideal \\spad{I}.")) (|radical| (((|PolynomialIdeals| (|Fraction| (|Integer|)) (|DirectProduct| |#2| (|NonNegativeInteger|)) (|OrderedVariableList| |#1|) (|DistributedMultivariatePolynomial| |#1| (|Fraction| (|Integer|)))) (|PolynomialIdeals| (|Fraction| (|Integer|)) (|DirectProduct| |#2| (|NonNegativeInteger|)) (|OrderedVariableList| |#1|) (|DistributedMultivariatePolynomial| |#1| (|Fraction| (|Integer|))))) "\\spad{radical(I)} returns the radical of the ideal \\spad{I}.")) (|prime?| (((|Boolean|) (|PolynomialIdeals| (|Fraction| (|Integer|)) (|DirectProduct| |#2| (|NonNegativeInteger|)) (|OrderedVariableList| |#1|) (|DistributedMultivariatePolynomial| |#1| (|Fraction| (|Integer|))))) "\\spad{prime?(I)} tests if the ideal \\spad{I} is prime.")) (|zeroDimPrimary?| (((|Boolean|) (|PolynomialIdeals| (|Fraction| (|Integer|)) (|DirectProduct| |#2| (|NonNegativeInteger|)) (|OrderedVariableList| |#1|) (|DistributedMultivariatePolynomial| |#1| (|Fraction| (|Integer|))))) "\\spad{zeroDimPrimary?(I)} tests if the ideal \\spad{I} is 0-dimensional primary.")) (|zeroDimPrime?| (((|Boolean|) (|PolynomialIdeals| (|Fraction| (|Integer|)) (|DirectProduct| |#2| (|NonNegativeInteger|)) (|OrderedVariableList| |#1|) (|DistributedMultivariatePolynomial| |#1| (|Fraction| (|Integer|))))) "\\spad{zeroDimPrime?(I)} tests if the ideal \\spad{I} is a 0-dimensional prime."))) NIL @@ -2007,11 +2007,11 @@ NIL (-519 A S) ((|constructor| (NIL "\\indented{1}{Indexed direct products of abelian groups over an abelian group \\spad{A} of} generators indexed by the ordered set \\spad{S}. All items have finite support: only non-zero terms are stored."))) NIL -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#2| (QUOTE (-1121))))) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#2| (QUOTE (-1120))))) (-520 A S) ((|constructor| (NIL "\\indented{1}{Indexed direct products of abelian monoids over an abelian monoid \\spad{A} of} generators indexed by the ordered set \\spad{S}. All items have finite support. Only non-zero terms are stored."))) NIL -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#2| (QUOTE (-1121))))) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#2| (QUOTE (-1120))))) (-521 A S) ((|constructor| (NIL "This category represents the direct product of some set with respect to an ordered indexing set.")) (|terms| (((|List| (|Pair| |#2| |#1|)) $) "\\spad{terms x} returns the list of terms in \\spad{x}. Each term is a pair of a support (the first component) and the corresponding value (the second component).")) (|reductum| (($ $) "\\spad{reductum(z)} returns a new element created by removing the leading coefficient/support pair from the element \\spad{z}. Error: if \\spad{z} has no support.")) (|leadingSupport| ((|#2| $) "\\spad{leadingSupport(z)} returns the index of leading (with respect to the ordering on the indexing set) monomial of \\spad{z}. Error: if \\spad{z} has no support.")) (|leadingCoefficient| ((|#1| $) "\\spad{leadingCoefficient(z)} returns the coefficient of the leading (with respect to the ordering on the indexing set) monomial of \\spad{z}. Error: if \\spad{z} has no support.")) (|monomial| (($ |#1| |#2|) "\\spad{monomial(a,s)} constructs a direct product element with the \\spad{s} component set to \\spad{a}")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(f,z)} returns the new element created by applying the function \\spad{f} to each component of the direct product element \\spad{z}."))) NIL @@ -2019,15 +2019,15 @@ NIL (-522 A S) ((|constructor| (NIL "Indexed direct products of objects over a set \\spad{A} of generators indexed by an ordered set \\spad{S}. All items have finite support."))) NIL -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#2| (QUOTE (-1121))))) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#2| (QUOTE (-1120))))) (-523 A S) ((|constructor| (NIL "\\indented{1}{Indexed direct products of ordered abelian monoids \\spad{A} of} generators indexed by the ordered set \\spad{S}. The inherited order is lexicographical. All items have finite support: only non-zero terms are stored."))) NIL -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#2| (QUOTE (-1121))))) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#2| (QUOTE (-1120))))) (-524 A S) ((|constructor| (NIL "\\indented{1}{Indexed direct products of ordered abelian monoid sups \\spad{A},{}} generators indexed by the ordered set \\spad{S}. All items have finite support: only non-zero terms are stored."))) NIL -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#2| (QUOTE (-1121))))) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#2| (QUOTE (-1120))))) (-525 S A B) ((|constructor| (NIL "This category provides \\spadfun{eval} operations. A domain may belong to this category if it is possible to make ``evaluation'' substitutions. The difference between this and \\spadtype{Evalable} is that the operations in this category specify the substitution as a pair of arguments rather than as an equation.")) (|eval| (($ $ (|List| |#2|) (|List| |#3|)) "\\spad{eval(f, [x1,...,xn], [v1,...,vn])} replaces \\spad{xi} by \\spad{vi} in \\spad{f}.") (($ $ |#2| |#3|) "\\spad{eval(f, x, v)} replaces \\spad{x} by \\spad{v} in \\spad{f}."))) NIL @@ -2039,3166 +2039,3162 @@ NIL (-527 S E |un|) ((|constructor| (NIL "Internal implementation of a free abelian monoid."))) NIL -((|HasCategory| |#2| (QUOTE (-813)))) +((|HasCategory| |#2| (QUOTE (-812)))) (-528 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}"))) -((-4425 . T) (-4424 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| |#1| (QUOTE (-860))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4424 . T) (-4423 . T)) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (-3955 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| |#1| (QUOTE (-859))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-529) ((|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 NIL (-530 |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}."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((-3956 (|HasCategory| (-593 |#1|) (QUOTE (-147))) (|HasCategory| (-593 |#1|) (QUOTE (-381)))) (|HasCategory| (-593 |#1|) (QUOTE (-149))) (|HasCategory| (-593 |#1|) (QUOTE (-381))) (|HasCategory| (-593 |#1|) (QUOTE (-147)))) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((-3955 (|HasCategory| (-592 |#1|) (QUOTE (-147))) (|HasCategory| (-592 |#1|) (QUOTE (-381)))) (|HasCategory| (-592 |#1|) (QUOTE (-149))) (|HasCategory| (-592 |#1|) (QUOTE (-381))) (|HasCategory| (-592 |#1|) (QUOTE (-147)))) (-531 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."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) -(-532 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."))) -((-4425 . T) (-4424 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| |#1| (QUOTE (-860))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) -(-533 R |Row| |Col| M) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102)))) +(-532 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 -((|HasAttribute| |#3| (QUOTE -4425))) -(-534 R |Row| |Col| M QF |Row2| |Col2| M2) +((|HasAttribute| |#3| (QUOTE -4424))) +(-533 R |Row| |Col| M QF |Row2| |Col2| M2) ((|constructor| (NIL "\\spadtype{InnerMatrixQuotientFieldFunctions} provides functions on matrices over an integral domain which involve the quotient field of that integral domain. The functions rowEchelon and inverse return matrices with entries in the quotient field.")) (|nullSpace| (((|List| |#3|) |#4|) "\\spad{nullSpace(m)} returns a basis for the null space of the matrix \\spad{m}.")) (|inverse| (((|Union| |#8| "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. Note: the result will have entries in the quotient field.")) (|rowEchelon| ((|#8| |#4|) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}. the result will have entries in the quotient field."))) NIL -((|HasAttribute| |#7| (QUOTE -4425))) -(-535 R |mnRow| |mnCol|) +((|HasAttribute| |#7| (QUOTE -4424))) +(-534 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."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-569))) (|HasAttribute| |#1| (QUOTE (-4426 "*"))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) -(-536) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-568))) (|HasAttribute| |#1| (QUOTE (-4425 "*"))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102)))) +(-535) ((|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 NIL -(-537) +(-536) ((|constructor| (NIL "This domain represents the `in' iterator syntax.")) (|sequence| (((|SpadAst|) $) "\\spad{sequence(i)} returns the sequence expression being iterated over by `i'.")) (|iterationVar| (((|Identifier|) $) "\\spad{iterationVar(i)} returns the name of the iterating variable of the `in' iterator 'i'"))) NIL NIL -(-538 S) +(-537 S) ((|constructor| (NIL "This category describes input byte stream conduits.")) (|readBytes!| (((|NonNegativeInteger|) $ (|ByteBuffer|)) "\\spad{readBytes!(c,b)} reads byte sequences from conduit `c' into the byte buffer `b'. The actual number of bytes written is returned,{} and the length of `b' is set to that amount.")) (|readUInt32!| (((|Maybe| (|UInt32|)) $) "\\spad{readUInt32!(cond)} attempts to read a \\spad{UInt32} value from the input conduit `cond'. Returns the value if successful,{} otherwise \\spad{nothing}.")) (|readInt32!| (((|Maybe| (|Int32|)) $) "\\spad{readInt32!(cond)} attempts to read an \\spad{Int32} value from the input conduit `cond'. Returns the value if successful,{} otherwise \\spad{nothing}.")) (|readUInt16!| (((|Maybe| (|UInt16|)) $) "\\spad{readUInt16!(cond)} attempts to read a \\spad{UInt16} value from the input conduit `cond'. Returns the value if successful,{} otherwise \\spad{nothing}.")) (|readInt16!| (((|Maybe| (|Int16|)) $) "\\spad{readInt16!(cond)} attempts to read an \\spad{Int16} value from the input conduit `cond'. Returns the value if successful,{} otherwise \\spad{nothing}.")) (|readUInt8!| (((|Maybe| (|UInt8|)) $) "\\spad{readUInt8!(cond)} attempts to read a \\spad{UInt8} value from the input conduit `cond'. Returns the value if successful,{} otherwise \\spad{nothing}.")) (|readInt8!| (((|Maybe| (|Int8|)) $) "\\spad{readInt8!(cond)} attempts to read an \\spad{Int8} value from the input conduit `cond'. Returns the value if successful,{} otherwise \\spad{nothing}.")) (|readByte!| (((|Maybe| (|Byte|)) $) "\\spad{readByte!(cond)} attempts to read a byte from the input conduit `cond'. Returns the read byte if successful,{} otherwise \\spad{nothing}."))) NIL NIL -(-539) +(-538) ((|constructor| (NIL "This category describes input byte stream conduits.")) (|readBytes!| (((|NonNegativeInteger|) $ (|ByteBuffer|)) "\\spad{readBytes!(c,b)} reads byte sequences from conduit `c' into the byte buffer `b'. The actual number of bytes written is returned,{} and the length of `b' is set to that amount.")) (|readUInt32!| (((|Maybe| (|UInt32|)) $) "\\spad{readUInt32!(cond)} attempts to read a \\spad{UInt32} value from the input conduit `cond'. Returns the value if successful,{} otherwise \\spad{nothing}.")) (|readInt32!| (((|Maybe| (|Int32|)) $) "\\spad{readInt32!(cond)} attempts to read an \\spad{Int32} value from the input conduit `cond'. Returns the value if successful,{} otherwise \\spad{nothing}.")) (|readUInt16!| (((|Maybe| (|UInt16|)) $) "\\spad{readUInt16!(cond)} attempts to read a \\spad{UInt16} value from the input conduit `cond'. Returns the value if successful,{} otherwise \\spad{nothing}.")) (|readInt16!| (((|Maybe| (|Int16|)) $) "\\spad{readInt16!(cond)} attempts to read an \\spad{Int16} value from the input conduit `cond'. Returns the value if successful,{} otherwise \\spad{nothing}.")) (|readUInt8!| (((|Maybe| (|UInt8|)) $) "\\spad{readUInt8!(cond)} attempts to read a \\spad{UInt8} value from the input conduit `cond'. Returns the value if successful,{} otherwise \\spad{nothing}.")) (|readInt8!| (((|Maybe| (|Int8|)) $) "\\spad{readInt8!(cond)} attempts to read an \\spad{Int8} value from the input conduit `cond'. Returns the value if successful,{} otherwise \\spad{nothing}.")) (|readByte!| (((|Maybe| (|Byte|)) $) "\\spad{readByte!(cond)} attempts to read a byte from the input conduit `cond'. Returns the read byte if successful,{} otherwise \\spad{nothing}."))) NIL NIL -(-540 GF) +(-539 GF) ((|constructor| (NIL "InnerNormalBasisFieldFunctions(GF) (unexposed): This package has functions used by every normal basis finite field extension domain.")) (|minimalPolynomial| (((|SparseUnivariatePolynomial| |#1|) (|Vector| |#1|)) "\\spad{minimalPolynomial(x)} \\undocumented{} See \\axiomFunFrom{minimalPolynomial}{FiniteAlgebraicExtensionField}")) (|normalElement| (((|Vector| |#1|) (|PositiveInteger|)) "\\spad{normalElement(n)} \\undocumented{} See \\axiomFunFrom{normalElement}{FiniteAlgebraicExtensionField}")) (|basis| (((|Vector| (|Vector| |#1|)) (|PositiveInteger|)) "\\spad{basis(n)} \\undocumented{} See \\axiomFunFrom{basis}{FiniteAlgebraicExtensionField}")) (|normal?| (((|Boolean|) (|Vector| |#1|)) "\\spad{normal?(x)} \\undocumented{} See \\axiomFunFrom{normal?}{FiniteAlgebraicExtensionField}")) (|lookup| (((|PositiveInteger|) (|Vector| |#1|)) "\\spad{lookup(x)} \\undocumented{} See \\axiomFunFrom{lookup}{Finite}")) (|inv| (((|Vector| |#1|) (|Vector| |#1|)) "\\spad{inv x} \\undocumented{} See \\axiomFunFrom{inv}{DivisionRing}")) (|trace| (((|Vector| |#1|) (|Vector| |#1|) (|PositiveInteger|)) "\\spad{trace(x,n)} \\undocumented{} See \\axiomFunFrom{trace}{FiniteAlgebraicExtensionField}")) (|norm| (((|Vector| |#1|) (|Vector| |#1|) (|PositiveInteger|)) "\\spad{norm(x,n)} \\undocumented{} See \\axiomFunFrom{norm}{FiniteAlgebraicExtensionField}")) (/ (((|Vector| |#1|) (|Vector| |#1|) (|Vector| |#1|)) "\\spad{x/y} \\undocumented{} See \\axiomFunFrom{/}{Field}")) (* (((|Vector| |#1|) (|Vector| |#1|) (|Vector| |#1|)) "\\spad{x*y} \\undocumented{} See \\axiomFunFrom{*}{SemiGroup}")) (** (((|Vector| |#1|) (|Vector| |#1|) (|Integer|)) "\\spad{x**n} \\undocumented{} See \\axiomFunFrom{**}{DivisionRing}")) (|qPot| (((|Vector| |#1|) (|Vector| |#1|) (|Integer|)) "\\spad{qPot(v,e)} computes \\spad{v**(q**e)},{} interpreting \\spad{v} as an element of normal basis field,{} \\spad{q} the size of the ground field. This is done by a cyclic \\spad{e}-shift of the vector \\spad{v}.")) (|expPot| (((|Vector| |#1|) (|Vector| |#1|) (|SingleInteger|) (|SingleInteger|)) "\\spad{expPot(v,e,d)} returns the sum from \\spad{i = 0} to \\spad{e - 1} of \\spad{v**(q**i*d)},{} interpreting \\spad{v} as an element of a normal basis field and where \\spad{q} is the size of the ground field. Note: for a description of the algorithm,{} see \\spad{T}.Itoh and \\spad{S}.Tsujii,{} \"A fast algorithm for computing multiplicative inverses in GF(2^m) using normal bases\",{} Information and Computation 78,{} pp.171-177,{} 1988.")) (|repSq| (((|Vector| |#1|) (|Vector| |#1|) (|NonNegativeInteger|)) "\\spad{repSq(v,e)} computes \\spad{v**e} by repeated squaring,{} interpreting \\spad{v} as an element of a normal basis field.")) (|dAndcExp| (((|Vector| |#1|) (|Vector| |#1|) (|NonNegativeInteger|) (|SingleInteger|)) "\\spad{dAndcExp(v,n,k)} computes \\spad{v**e} interpreting \\spad{v} as an element of normal basis field. A divide and conquer algorithm similar to the one from \\spad{D}.\\spad{R}.Stinson,{} \"Some observations on parallel Algorithms for fast exponentiation in GF(2^n)\",{} Siam \\spad{J}. Computation,{} Vol.19,{} No.4,{} pp.711-717,{} August 1990 is used. Argument \\spad{k} is a parameter of this algorithm.")) (|xn| (((|SparseUnivariatePolynomial| |#1|) (|NonNegativeInteger|)) "\\spad{xn(n)} returns the polynomial \\spad{x**n-1}.")) (|pol| (((|SparseUnivariatePolynomial| |#1|) (|Vector| |#1|)) "\\spad{pol(v)} turns the vector \\spad{[v0,...,vn]} into the polynomial \\spad{v0+v1*x+ ... + vn*x**n}.")) (|index| (((|Vector| |#1|) (|PositiveInteger|) (|PositiveInteger|)) "\\spad{index(n,m)} is a index function for vectors of length \\spad{n} over the ground field.")) (|random| (((|Vector| |#1|) (|PositiveInteger|)) "\\spad{random(n)} creates a vector over the ground field with random entries.")) (|setFieldInfo| (((|Void|) (|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|))))) |#1|) "\\spad{setFieldInfo(m,p)} initializes the field arithmetic,{} where \\spad{m} is the multiplication table and \\spad{p} is the respective normal element of the ground field GF."))) NIL NIL -(-541) +(-540) ((|constructor| (NIL "This domain provides representation for binary files open for input operations. `Binary' here means that the conduits do not interpret their contents.")) (|position!| (((|SingleInteger|) $ (|SingleInteger|)) "position(\\spad{f},{}\\spad{p}) sets the current byte-position to `i'.")) (|position| (((|SingleInteger|) $) "\\spad{position(f)} returns the current byte-position in the file `f'.")) (|isOpen?| (((|Boolean|) $) "\\spad{isOpen?(ifile)} holds if `ifile' is in open state.")) (|eof?| (((|Boolean|) $) "\\spad{eof?(ifile)} holds when the last read reached end of file.")) (|inputBinaryFile| (($ (|String|)) "\\spad{inputBinaryFile(f)} returns an input conduit obtained by opening the file named by `f' as a binary file.") (($ (|FileName|)) "\\spad{inputBinaryFile(f)} returns an input conduit obtained by opening the file named by `f' as a binary file."))) NIL NIL -(-542 R) +(-541 R) ((|constructor| (NIL "This package provides operations to create incrementing functions.")) (|incrementBy| (((|Mapping| |#1| |#1|) |#1|) "\\spad{incrementBy(n)} produces a function which adds \\spad{n} to whatever argument it is given. For example,{} if {\\spad{f} := increment(\\spad{n})} then \\spad{f x} is \\spad{x+n}.")) (|increment| (((|Mapping| |#1| |#1|)) "\\spad{increment()} produces a function which adds \\spad{1} to whatever argument it is given. For example,{} if {\\spad{f} := increment()} then \\spad{f x} is \\spad{x+1}."))) NIL NIL -(-543 |Varset|) +(-542 |Varset|) ((|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| |#1| (QUOTE (-1121))) (|HasCategory| (-790) (QUOTE (-1121))))) -(-544 K -3494 |Par|) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| (-789) (QUOTE (-1120))))) +(-543 K -3493 |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 -(-545) +(-544) NIL NIL NIL -(-546) +(-545) ((|constructor| (NIL "Default infinity signatures for the interpreter; Date Created: 4 Oct 1989 Date Last Updated: 4 Oct 1989")) (|minusInfinity| (((|OrderedCompletion| (|Integer|))) "\\spad{minusInfinity()} returns minusInfinity.")) (|plusInfinity| (((|OrderedCompletion| (|Integer|))) "\\spad{plusInfinity()} returns plusIinfinity.")) (|infinity| (((|OnePointCompletion| (|Integer|))) "\\spad{infinity()} returns infinity."))) NIL NIL -(-547) +(-546) ((|constructor| (NIL "Domain of parsed forms which can be passed to the interpreter. This is also the interface between algebra code and facilities in the interpreter.")) (|compile| (((|Symbol|) (|Symbol|) (|List| $)) "\\spad{compile(f, [t1,...,tn])} forces the interpreter to compile the function \\spad{f} with signature \\spad{(t1,...,tn) -> ?}. returns the symbol \\spad{f} if successful. Error: if \\spad{f} was not defined beforehand in the interpreter,{} or if the \\spad{ti}'s are not valid types,{} or if the compiler fails.")) (|declare| (((|Symbol|) (|List| $)) "\\spad{declare(t)} returns a name \\spad{f} such that \\spad{f} has been declared to the interpreter to be of type \\spad{t},{} but has not been assigned a value yet. Note: \\spad{t} should be created as \\spad{devaluate(T)\\$Lisp} where \\spad{T} is the actual type of \\spad{f} (this hack is required for the case where \\spad{T} is a mapping type).")) (|parseString| (($ (|String|)) "parseString is the inverse of unparse. It parses a string to InputForm.")) (|unparse| (((|String|) $) "\\spad{unparse(f)} returns a string \\spad{s} such that the parser would transform \\spad{s} to \\spad{f}. Error: if \\spad{f} is not the parsed form of a string.")) (|flatten| (($ $) "\\spad{flatten(s)} returns an input form corresponding to \\spad{s} with all the nested operations flattened to triples using new local variables. If \\spad{s} is a piece of code,{} this speeds up the compilation tremendously later on.")) ((|One|) (($) "\\spad{1} returns the input form corresponding to 1.")) ((|Zero|) (($) "\\spad{0} returns the input form corresponding to 0.")) (** (($ $ (|Integer|)) "\\spad{a ** b} returns the input form corresponding to \\spad{a ** b}.") (($ $ (|NonNegativeInteger|)) "\\spad{a ** b} returns the input form corresponding to \\spad{a ** b}.")) (/ (($ $ $) "\\spad{a / b} returns the input form corresponding to \\spad{a / b}.")) (* (($ $ $) "\\spad{a * b} returns the input form corresponding to \\spad{a * b}.")) (+ (($ $ $) "\\spad{a + b} returns the input form corresponding to \\spad{a + b}.")) (|lambda| (($ $ (|List| (|Symbol|))) "\\spad{lambda(code, [x1,...,xn])} returns the input form corresponding to \\spad{(x1,...,xn) +-> code} if \\spad{n > 1},{} or to \\spad{x1 +-> code} if \\spad{n = 1}.")) (|function| (($ $ (|List| (|Symbol|)) (|Symbol|)) "\\spad{function(code, [x1,...,xn], f)} returns the input form corresponding to \\spad{f(x1,...,xn) == code}.")) (|binary| (($ $ (|List| $)) "\\spad{binary(op, [a1,...,an])} returns the input form corresponding to \\spad{a1 op a2 op ... op an}.")) (|convert| (($ (|SExpression|)) "\\spad{convert(s)} makes \\spad{s} into an input form.")) (|interpret| (((|Any|) $) "\\spad{interpret(f)} passes \\spad{f} to the interpreter."))) NIL NIL -(-548 R) +(-547 R) ((|constructor| (NIL "Tools for manipulating input forms.")) (|interpret| ((|#1| (|InputForm|)) "\\spad{interpret(f)} passes \\spad{f} to the interpreter,{} and transforms the result into an object of type \\spad{R}.")) (|packageCall| (((|InputForm|) (|Symbol|)) "\\spad{packageCall(f)} returns the input form corresponding to \\spad{f}\\$\\spad{R}."))) NIL NIL -(-549 |Coef| UTS) +(-548 |Coef| UTS) ((|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 -(-550 K -3494 |Par|) +(-549 K -3493 |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 -(-551 R BP |pMod| |nextMod|) +(-550 R BP |pMod| |nextMod|) ((|reduction| ((|#2| |#2| |#1|) "\\spad{reduction(f,p)} reduces the coefficients of the polynomial \\spad{f} modulo the prime \\spad{p}.")) (|modularGcd| ((|#2| (|List| |#2|)) "\\spad{modularGcd(listf)} computes the gcd of the list of polynomials \\spad{listf} by modular methods.")) (|modularGcdPrimitive| ((|#2| (|List| |#2|)) "\\spad{modularGcdPrimitive(f1,f2)} computes the gcd of the two polynomials \\spad{f1} and \\spad{f2} by modular methods."))) NIL NIL -(-552 OV E R P) +(-551 OV E R P) ((|constructor| (NIL "\\indented{2}{This is an inner package for factoring multivariate polynomials} over various coefficient domains in characteristic 0. The univariate factor operation is passed as a parameter. Multivariate hensel lifting is used to lift the univariate factorization")) (|factor| (((|Factored| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|) (|Mapping| (|Factored| (|SparseUnivariatePolynomial| |#3|)) (|SparseUnivariatePolynomial| |#3|))) "\\spad{factor(p,ufact)} factors the multivariate polynomial \\spad{p} by specializing variables and calling the univariate factorizer \\spad{ufact}. \\spad{p} is represented as a univariate polynomial with multivariate coefficients.") (((|Factored| |#4|) |#4| (|Mapping| (|Factored| (|SparseUnivariatePolynomial| |#3|)) (|SparseUnivariatePolynomial| |#3|))) "\\spad{factor(p,ufact)} factors the multivariate polynomial \\spad{p} by specializing variables and calling the univariate factorizer \\spad{ufact}."))) NIL NIL -(-553 K UP |Coef| UTS) +(-552 K UP |Coef| UTS) ((|constructor| (NIL "This package computes infinite products of univariate Taylor series over an arbitrary finite field.")) (|generalInfiniteProduct| ((|#4| |#4| (|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| ((|#4| |#4|) "\\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| ((|#4| |#4|) "\\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| ((|#4| |#4|) "\\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 -(-554 |Coef| UTS) +(-553 |Coef| UTS) ((|constructor| (NIL "This package computes infinite products of univariate Taylor series over a field of prime order.")) (|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 -(-555 R UP) +(-554 R UP) ((|constructor| (NIL "Find the sign of a polynomial around a point or infinity.")) (|signAround| (((|Union| (|Integer|) #1="failed") |#2| |#1| (|Mapping| (|Union| (|Integer|) #1#) |#1|)) "\\spad{signAround(u,r,f)} \\undocumented") (((|Union| (|Integer|) #1#) |#2| |#1| (|Integer|) (|Mapping| (|Union| (|Integer|) #1#) |#1|)) "\\spad{signAround(u,r,i,f)} \\undocumented") (((|Union| (|Integer|) #1#) |#2| (|Integer|) (|Mapping| (|Union| (|Integer|) #1#) |#1|)) "\\spad{signAround(u,i,f)} \\undocumented"))) NIL NIL -(-556 S) +(-555 S) ((|constructor| (NIL "An \\spad{IntegerNumberSystem} is a model for the integers.")) (|invmod| (($ $ $) "\\spad{invmod(a,b)},{} \\spad{0<=a<b>1},{} \\spad{(a,b)=1} means \\spad{1/a mod b}.")) (|powmod| (($ $ $ $) "\\spad{powmod(a,b,p)},{} \\spad{0<=a,b<p>1},{} means \\spad{a**b mod p}.")) (|mulmod| (($ $ $ $) "\\spad{mulmod(a,b,p)},{} \\spad{0<=a,b<p>1},{} means \\spad{a*b mod p}.")) (|submod| (($ $ $ $) "\\spad{submod(a,b,p)},{} \\spad{0<=a,b<p>1},{} means \\spad{a-b mod p}.")) (|addmod| (($ $ $ $) "\\spad{addmod(a,b,p)},{} \\spad{0<=a,b<p>1},{} means \\spad{a+b mod p}.")) (|mask| (($ $) "\\spad{mask(n)} returns \\spad{2**n-1} (an \\spad{n} bit mask).")) (|dec| (($ $) "\\spad{dec(x)} returns \\spad{x - 1}.")) (|inc| (($ $) "\\spad{inc(x)} returns \\spad{x + 1}.")) (|copy| (($ $) "\\spad{copy(n)} gives a copy of \\spad{n}.")) (|random| (($ $) "\\spad{random(a)} creates a random element from 0 to \\spad{a-1}.") (($) "\\spad{random()} creates a random element.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(n)} creates a rational number,{} or returns \"failed\" if this is not possible.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(n)} creates a rational number (see \\spadtype{Fraction Integer})..")) (|rational?| (((|Boolean|) $) "\\spad{rational?(n)} tests if \\spad{n} is a rational number (see \\spadtype{Fraction Integer}).")) (|symmetricRemainder| (($ $ $) "\\spad{symmetricRemainder(a,b)} (where \\spad{b > 1}) yields \\spad{r} where \\spad{ -b/2 <= r < b/2 }.")) (|positiveRemainder| (($ $ $) "\\spad{positiveRemainder(a,b)} (where \\spad{b > 1}) yields \\spad{r} where \\spad{0 <= r < b} and \\spad{r == a rem b}.")) (|bit?| (((|Boolean|) $ $) "\\spad{bit?(n,i)} returns \\spad{true} if and only if \\spad{i}-th bit of \\spad{n} is a 1.")) (|shift| (($ $ $) "\\spad{shift(a,i)} shift \\spad{a} by \\spad{i} digits.")) (|length| (($ $) "\\spad{length(a)} length of \\spad{a} in digits.")) (|base| (($) "\\spad{base()} returns the base for the operations of \\spad{IntegerNumberSystem}.")) (|multiplicativeValuation| ((|attribute|) "euclideanSize(a*b) returns \\spad{euclideanSize(a)*euclideanSize(b)}.")) (|even?| (((|Boolean|) $) "\\spad{even?(n)} returns \\spad{true} if and only if \\spad{n} is even.")) (|odd?| (((|Boolean|) $) "\\spad{odd?(n)} returns \\spad{true} if and only if \\spad{n} is odd."))) NIL NIL -(-557) +(-556) ((|constructor| (NIL "An \\spad{IntegerNumberSystem} is a model for the integers.")) (|invmod| (($ $ $) "\\spad{invmod(a,b)},{} \\spad{0<=a<b>1},{} \\spad{(a,b)=1} means \\spad{1/a mod b}.")) (|powmod| (($ $ $ $) "\\spad{powmod(a,b,p)},{} \\spad{0<=a,b<p>1},{} means \\spad{a**b mod p}.")) (|mulmod| (($ $ $ $) "\\spad{mulmod(a,b,p)},{} \\spad{0<=a,b<p>1},{} means \\spad{a*b mod p}.")) (|submod| (($ $ $ $) "\\spad{submod(a,b,p)},{} \\spad{0<=a,b<p>1},{} means \\spad{a-b mod p}.")) (|addmod| (($ $ $ $) "\\spad{addmod(a,b,p)},{} \\spad{0<=a,b<p>1},{} means \\spad{a+b mod p}.")) (|mask| (($ $) "\\spad{mask(n)} returns \\spad{2**n-1} (an \\spad{n} bit mask).")) (|dec| (($ $) "\\spad{dec(x)} returns \\spad{x - 1}.")) (|inc| (($ $) "\\spad{inc(x)} returns \\spad{x + 1}.")) (|copy| (($ $) "\\spad{copy(n)} gives a copy of \\spad{n}.")) (|random| (($ $) "\\spad{random(a)} creates a random element from 0 to \\spad{a-1}.") (($) "\\spad{random()} creates a random element.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(n)} creates a rational number,{} or returns \"failed\" if this is not possible.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(n)} creates a rational number (see \\spadtype{Fraction Integer})..")) (|rational?| (((|Boolean|) $) "\\spad{rational?(n)} tests if \\spad{n} is a rational number (see \\spadtype{Fraction Integer}).")) (|symmetricRemainder| (($ $ $) "\\spad{symmetricRemainder(a,b)} (where \\spad{b > 1}) yields \\spad{r} where \\spad{ -b/2 <= r < b/2 }.")) (|positiveRemainder| (($ $ $) "\\spad{positiveRemainder(a,b)} (where \\spad{b > 1}) yields \\spad{r} where \\spad{0 <= r < b} and \\spad{r == a rem b}.")) (|bit?| (((|Boolean|) $ $) "\\spad{bit?(n,i)} returns \\spad{true} if and only if \\spad{i}-th bit of \\spad{n} is a 1.")) (|shift| (($ $ $) "\\spad{shift(a,i)} shift \\spad{a} by \\spad{i} digits.")) (|length| (($ $) "\\spad{length(a)} length of \\spad{a} in digits.")) (|base| (($) "\\spad{base()} returns the base for the operations of \\spad{IntegerNumberSystem}.")) (|multiplicativeValuation| ((|attribute|) "euclideanSize(a*b) returns \\spad{euclideanSize(a)*euclideanSize(b)}.")) (|even?| (((|Boolean|) $) "\\spad{even?(n)} returns \\spad{true} if and only if \\spad{n} is even.")) (|odd?| (((|Boolean|) $) "\\spad{odd?(n)} returns \\spad{true} if and only if \\spad{n} is odd."))) -((-4422 . T) (-4423 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4421 . T) (-4422 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-558) +(-557) ((|constructor| (NIL "\\spadtype{Integer} provides the domain of arbitrary precision integers.")) (|noetherian| ((|attribute|) "ascending chain condition on ideals.")) (|canonicalsClosed| ((|attribute|) "two positives multiply to give positive.")) (|canonical| ((|attribute|) "mathematical equality is data structure equality."))) -((-4412 . T) (-4416 . T) (-4411 . T) (-4422 . T) (-4423 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4411 . T) (-4415 . T) (-4410 . T) (-4421 . T) (-4422 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-559) +(-558) ((|constructor| (NIL "This domain is a datatype for (signed) integer values of precision 16 bits."))) NIL NIL -(-560) +(-559) ((|constructor| (NIL "This domain is a datatype for (signed) integer values of precision 32 bits."))) NIL NIL -(-561) +(-560) ((|constructor| (NIL "This domain is a datatype for (signed) integer values of precision 64 bits."))) NIL NIL -(-562) +(-561) ((|constructor| (NIL "This domain is a datatype for (signed) integer values of precision 8 bits."))) NIL NIL -(-563 |Key| |Entry| |addDom|) +(-562 |Key| |Entry| |addDom|) ((|constructor| (NIL "This domain is used to provide a conditional \"add\" domain for the implementation of \\spadtype{Table}."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4289) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2285) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -630) (QUOTE (-547)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-1121))) (-3956 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876))))) (-3956 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102)))) -(-564 R -3494) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4288) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2284) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -629) (QUOTE (-546)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-1120))) (-3955 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875))))) (-3955 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102)))) +(-563 R -3493) ((|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 -(-565 R0 -3494 UP UPUP R) +(-564 R0 -3493 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 -(-566) +(-565) ((|constructor| (NIL "This package provides functions to lookup bits in integers")) (|bitTruth| (((|Boolean|) (|Integer|) (|Integer|)) "\\spad{bitTruth(n,m)} returns \\spad{true} if coefficient of 2**m in abs(\\spad{n}) is 1")) (|bitCoef| (((|Integer|) (|Integer|) (|Integer|)) "\\spad{bitCoef(n,m)} returns the coefficient of 2**m in abs(\\spad{n})")) (|bitLength| (((|Integer|) (|Integer|)) "\\spad{bitLength(n)} returns the number of bits to represent abs(\\spad{n})"))) NIL NIL -(-567 R) +(-566 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."))) -((-4199 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4198 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-568 S) +(-567 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."))) NIL NIL -(-569) +(-568) ((|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."))) -((-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-570 R -3494) +(-569 R -3493) ((|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|)) #1="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|)) #1#) |#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 -(-571 I) +(-570 I) ((|constructor| (NIL "\\indented{1}{This Package contains basic methods for integer factorization.} The factor operation employs trial division up to 10,{}000. It then tests to see if \\spad{n} is a perfect power before using Pollards rho method. Because Pollards method may fail,{} the result of factor may contain composite factors. We should also employ Lenstra's eliptic curve method.")) (|PollardSmallFactor| (((|Union| |#1| "failed") |#1|) "\\spad{PollardSmallFactor(n)} returns a factor of \\spad{n} or \"failed\" if no one is found")) (|BasicMethod| (((|Factored| |#1|) |#1|) "\\spad{BasicMethod(n)} returns the factorization of integer \\spad{n} by trial division")) (|squareFree| (((|Factored| |#1|) |#1|) "\\spad{squareFree(n)} returns the square free factorization of integer \\spad{n}")) (|factor| (((|Factored| |#1|) |#1|) "\\spad{factor(n)} returns the full factorization of integer \\spad{n}"))) NIL NIL -(-572) +(-571) ((|constructor| (NIL "\\blankline")) (|entry| (((|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| #1="Continuous at the end points") (|:| |lowerSingular| #2="There is a singularity at the lower end point") (|:| |upperSingular| #3="There is a singularity at the upper end point") (|:| |bothSingular| #4="There are singularities at both end points") (|:| |notEvaluated| #5="End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| #6="Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| #7="The range is finite") (|:| |lowerInfinite| #8="The bottom of range is infinite") (|:| |upperInfinite| #9="The top of range is infinite") (|:| |bothInfinite| #10="Both top and bottom points are infinite") (|:| |notEvaluated| #11="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| #1#) (|:| |lowerSingular| #2#) (|:| |upperSingular| #3#) (|:| |bothSingular| #4#) (|:| |notEvaluated| #5#))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| #6#))) (|:| |range| (|Union| (|:| |finite| #7#) (|:| |lowerInfinite| #8#) (|:| |upperInfinite| #9#) (|:| |bothInfinite| #10#) (|:| |notEvaluated| #11#))))))) $) "\\spad{entries(x)} \\undocumented{}")) (|showAttributes| (((|Union| (|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| #1#) (|:| |lowerSingular| #2#) (|:| |upperSingular| #3#) (|:| |bothSingular| #4#) (|:| |notEvaluated| #5#))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| #6#))) (|:| |range| (|Union| (|:| |finite| #7#) (|:| |lowerInfinite| #8#) (|:| |upperInfinite| #9#) (|:| |bothInfinite| #10#) (|:| |notEvaluated| #11#)))) "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| #1#) (|:| |lowerSingular| #2#) (|:| |upperSingular| #3#) (|:| |bothSingular| #4#) (|:| |notEvaluated| #5#))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| #6#))) (|:| |range| (|Union| (|:| |finite| #7#) (|:| |lowerInfinite| #8#) (|:| |upperInfinite| #9#) (|:| |bothInfinite| #10#) (|:| |notEvaluated| #11#))))))) "\\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| #1#) (|:| |lowerSingular| #2#) (|:| |upperSingular| #3#) (|:| |bothSingular| #4#) (|:| |notEvaluated| #5#))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| #6#))) (|:| |range| (|Union| (|:| |finite| #7#) (|:| |lowerInfinite| #8#) (|:| |upperInfinite| #9#) (|:| |bothInfinite| #10#) (|:| |notEvaluated| #11#)))))))) "\\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 -(-573 R -3494 L) +(-572 R -3493 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| #1="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| #1#)) (|:| |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| #2="failed") |#2| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Mapping| (|Union| |#2| #2#) |#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| #2#) |#2| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Mapping| (|Union| |#2| #2#) |#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|))))) #3="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|))))) #3#) |#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|)) #4="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|)) #4#) |#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 -677) (|devaluate| |#2|)))) -(-574) +((|HasCategory| |#3| (|%list| (QUOTE -676) (|devaluate| |#2|)))) +(-573) ((|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 -(-575 -3494 UP UPUP R) +(-574 -3493 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 -(-576 -3494 UP) +(-575 -3493 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 -(-577) +(-576) ((|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 -(-578 R -3494 L) +(-577 R -3493 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| #1="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| #1#) |#2| |#2| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Mapping| (|Union| |#2| #1#) |#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 -677) (|devaluate| |#2|)))) -(-579 R -3494) +((|HasCategory| |#3| (|%list| (QUOTE -676) (|devaluate| |#2|)))) +(-578 R -3493) ((|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 -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-1159)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-646))))) -(-580 -3494 UP) +((-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| |#2| (QUOTE (-1158)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| |#2| (QUOTE (-645))))) +(-579 -3493 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 -(-581 S) +(-580 S) ((|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 -(-582 -3494) +(-581 -3493) ((|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 -(-583 R) +(-582 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."))) -((-4199 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4198 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-584) +(-583) ((|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 -(-585 R -3494) +(-584 R -3493) ((|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| (QUOTE (-464))) (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-296))) (|HasCategory| |#2| (QUOTE (-646))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-296)))) (|HasCategory| |#1| (QUOTE (-569)))) -(-586 -3494 UP) +((-12 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| |#2| (QUOTE (-296))) (|HasCategory| |#2| (QUOTE (-645))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-296)))) (|HasCategory| |#1| (QUOTE (-568)))) +(-585 -3493 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|)) #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|)) #1#) |#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|)) #1#) |#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|)) #1#) |#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 -(-587 R -3494) +(-586 R -3493) ((|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 -(-588) +(-587) ((|constructor| (NIL "This category describes byte stream conduits supporting both input and output operations."))) NIL NIL -(-589) +(-588) ((|constructor| (NIL "\\indented{2}{This domain provides representation for binary files open} \\indented{2}{for input and output operations.} See Also: InputBinaryFile,{} OutputBinaryFile")) (|isOpen?| (((|Boolean|) $) "\\spad{isOpen?(f)} holds if `f' is in open state.")) (|inputOutputBinaryFile| (($ (|String|)) "\\spad{inputOutputBinaryFile(f)} returns an input/output conduit obtained by opening the file named by `f' as a binary file.") (($ (|FileName|)) "\\spad{inputOutputBinaryFile(f)} returns an input/output conduit obtained by opening the file designated by `f' as a binary file."))) NIL NIL -(-590) +(-589) ((|constructor| (NIL "This domain provides constants to describe directions of IO conduits (file,{} etc) mode of operations.")) (|closed| (($) "\\spad{closed} indicates that the IO conduit has been closed.")) (|bothWays| (($) "\\spad{bothWays} indicates that an IO conduit is for both input and output.")) (|output| (($) "\\spad{output} indicates that an IO conduit is for output")) (|input| (($) "\\spad{input} indicates that an IO conduit is for input."))) NIL NIL -(-591) +(-590) ((|constructor| (NIL "This domain provides representation for ARPA Internet \\spad{IP4} addresses.")) (|resolve| (((|Maybe| $) (|Hostname|)) "\\spad{resolve(h)} returns the \\spad{IP4} address of host `h'.")) (|bytes| (((|DataArray| 4 (|Byte|)) $) "\\spad{bytes(x)} returns the bytes of the numeric address `x'.")) (|ip4Address| (($ (|String|)) "\\spad{ip4Address(a)} builds a numeric address out of the ASCII form `a'."))) NIL NIL -(-592 |p| |unBalanced?|) +(-591 |p| |unBalanced?|) ((|constructor| (NIL "This domain implements Zp,{} the \\spad{p}-adic completion of the integers. This is an internal domain."))) -((-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-593 |p|) +(-592 |p|) ((|constructor| (NIL "InnerPrimeField(\\spad{p}) implements the field with \\spad{p} elements. Note: argument \\spad{p} MUST be a prime (this domain does not check). See \\spadtype{PrimeField} for a domain that does check."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) ((|HasCategory| $ (QUOTE (-149))) (|HasCategory| $ (QUOTE (-147))) (|HasCategory| $ (QUOTE (-381)))) -(-594) +(-593) ((|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 -(-595 -3494) +(-594 -3493) ((|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}."))) -((-4419 . T) (-4418 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-1197))))) -(-596 E -3494) +((-4418 . T) (-4417 . T)) +((|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-1196))))) +(-595 E -3493) ((|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 -(-597 R -3494) +(-596 R -3493) ((|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 -(-598) +(-597) ((|constructor| (NIL "This domain provides representations for the intermediate form data structure used by the Spad elaborator.")) (|irDef| (($ (|Identifier|) (|InternalTypeForm|) $) "\\spad{irDef(f,ts,e)} returns an IR representation for a definition of a function named \\spad{f},{} with signature \\spad{ts} and body \\spad{e}.")) (|irCtor| (($ (|Identifier|) (|InternalTypeForm|)) "\\spad{irCtor(n,t)} returns an IR for a constructor reference of type designated by the type form \\spad{t}")) (|irVar| (($ (|Identifier|) (|InternalTypeForm|)) "\\spad{irVar(x,t)} returns an IR for a variable reference of type designated by the type form \\spad{t}"))) NIL NIL -(-599 I) +(-598 I) ((|constructor| (NIL "The \\spadtype{IntegerRoots} package computes square roots and \\indented{2}{\\spad{n}th roots of integers efficiently.}")) (|approxSqrt| ((|#1| |#1|) "\\spad{approxSqrt(n)} returns an approximation \\spad{x} to \\spad{sqrt(n)} such that \\spad{-1 < x - sqrt(n) < 1}. Compute an approximation \\spad{s} to \\spad{sqrt(n)} such that \\indented{10}{\\spad{-1 < s - sqrt(n) < 1}} A variable precision Newton iteration is used. The running time is \\spad{O( log(n)**2 )}.")) (|perfectSqrt| (((|Union| |#1| "failed") |#1|) "\\spad{perfectSqrt(n)} returns the square root of \\spad{n} if \\spad{n} is a perfect square and returns \"failed\" otherwise")) (|perfectSquare?| (((|Boolean|) |#1|) "\\spad{perfectSquare?(n)} returns \\spad{true} if \\spad{n} is a perfect square and \\spad{false} otherwise")) (|approxNthRoot| ((|#1| |#1| (|NonNegativeInteger|)) "\\spad{approxRoot(n,r)} returns an approximation \\spad{x} to \\spad{n**(1/r)} such that \\spad{-1 < x - n**(1/r) < 1}")) (|perfectNthRoot| (((|Record| (|:| |base| |#1|) (|:| |exponent| (|NonNegativeInteger|))) |#1|) "\\spad{perfectNthRoot(n)} returns \\spad{[x,r]},{} where \\spad{n = x\\^r} and \\spad{r} is the largest integer such that \\spad{n} is a perfect \\spad{r}th power") (((|Union| |#1| "failed") |#1| (|NonNegativeInteger|)) "\\spad{perfectNthRoot(n,r)} returns the \\spad{r}th root of \\spad{n} if \\spad{n} is an \\spad{r}th power and returns \"failed\" otherwise")) (|perfectNthPower?| (((|Boolean|) |#1| (|NonNegativeInteger|)) "\\spad{perfectNthPower?(n,r)} returns \\spad{true} if \\spad{n} is an \\spad{r}th power and \\spad{false} otherwise"))) NIL NIL -(-600 GF) +(-599 GF) ((|constructor| (NIL "This package exports the function generateIrredPoly that computes a monic irreducible polynomial of degree \\spad{n} over a finite field.")) (|generateIrredPoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{generateIrredPoly(n)} generates an irreducible univariate polynomial of the given degree \\spad{n} over the finite field."))) NIL NIL -(-601 R) +(-600 R) ((|constructor| (NIL "\\indented{2}{This package allows a sum of logs over the roots of a polynomial} \\indented{2}{to be expressed as explicit logarithms and arc tangents,{} provided} \\indented{2}{that the indexing polynomial can be factored into quadratics.} Date Created: 21 August 1988 Date Last Updated: 4 October 1993")) (|complexIntegrate| (((|Expression| |#1|) (|Fraction| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{complexIntegrate(f, x)} returns the integral of \\spad{f(x)dx} where \\spad{x} is viewed as a complex variable.")) (|integrate| (((|Union| (|Expression| |#1|) (|List| (|Expression| |#1|))) (|Fraction| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{integrate(f, x)} returns the integral of \\spad{f(x)dx} where \\spad{x} is viewed as a real variable..")) (|complexExpand| (((|Expression| |#1|) (|IntegrationResult| (|Fraction| (|Polynomial| |#1|)))) "\\spad{complexExpand(i)} returns the expanded complex function corresponding to \\spad{i}.")) (|expand| (((|List| (|Expression| |#1|)) (|IntegrationResult| (|Fraction| (|Polynomial| |#1|)))) "\\spad{expand(i)} returns the list of possible real functions corresponding to \\spad{i}.")) (|split| (((|IntegrationResult| (|Fraction| (|Polynomial| |#1|))) (|IntegrationResult| (|Fraction| (|Polynomial| |#1|)))) "\\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 ((|HasCategory| |#1| (QUOTE (-149)))) -(-602) +(-601) ((|constructor| (NIL "IrrRepSymNatPackage contains functions for computing the ordinary irreducible representations of symmetric groups on \\spad{n} letters {\\em {1,2,...,n}} in Young's natural form and their dimensions. These representations can be labelled by number partitions of \\spad{n},{} \\spadignore{i.e.} a weakly decreasing sequence of integers summing up to \\spad{n},{} \\spadignore{e.g.} {\\em [3,3,3,1]} labels an irreducible representation for \\spad{n} equals 10. Note: whenever a \\spadtype{List Integer} appears in a signature,{} a partition required.")) (|irreducibleRepresentation| (((|List| (|Matrix| (|Integer|))) (|List| (|PositiveInteger|)) (|List| (|Permutation| (|Integer|)))) "\\spad{irreducibleRepresentation(lambda,listOfPerm)} is the list of the irreducible representations corresponding to {\\em lambda} in Young's natural form for the list of permutations given by {\\em listOfPerm}.") (((|List| (|Matrix| (|Integer|))) (|List| (|PositiveInteger|))) "\\spad{irreducibleRepresentation(lambda)} is the list of the two irreducible representations corresponding to the partition {\\em lambda} in Young's natural form for the following two generators of the symmetric group,{} whose elements permute {\\em {1,2,...,n}},{} namely {\\em (1 2)} (2-cycle) and {\\em (1 2 ... n)} (\\spad{n}-cycle).") (((|Matrix| (|Integer|)) (|List| (|PositiveInteger|)) (|Permutation| (|Integer|))) "\\spad{irreducibleRepresentation(lambda,pi)} is the irreducible representation corresponding to partition {\\em lambda} in Young's natural form of the permutation {\\em pi} in the symmetric group,{} whose elements permute {\\em {1,2,...,n}}.")) (|dimensionOfIrreducibleRepresentation| (((|NonNegativeInteger|) (|List| (|PositiveInteger|))) "\\spad{dimensionOfIrreducibleRepresentation(lambda)} is the dimension of the ordinary irreducible representation of the symmetric group corresponding to {\\em lambda}. Note: the Robinson-Thrall hook formula is implemented."))) NIL NIL -(-603 R E V P TS) +(-602 R E V P TS) ((|constructor| (NIL "\\indented{1}{An internal package for computing the rational univariate representation} \\indented{1}{of a zero-dimensional algebraic variety given by a square-free} \\indented{1}{triangular set.} \\indented{1}{The main operation is \\axiomOpFrom{rur}{InternalRationalUnivariateRepresentationPackage}.} \\indented{1}{It is based on the {\\em generic} algorithm description in [1]. \\newline References:} [1] \\spad{D}. LAZARD \"Solving Zero-dimensional Algebraic Systems\" \\indented{4}{Journal of Symbolic Computation,{} 1992,{} 13,{} 117-131}")) (|checkRur| (((|Boolean|) |#5| (|List| |#5|)) "\\spad{checkRur(ts,lus)} returns \\spad{true} if \\spad{lus} is a rational univariate representation of \\spad{ts}.")) (|rur| (((|List| |#5|) |#5| (|Boolean|)) "\\spad{rur(ts,univ?)} returns a rational univariate representation of \\spad{ts}. This assumes that the lowest polynomial in \\spad{ts} is a variable \\spad{v} which does not occur in the other polynomials of \\spad{ts}. This variable will be used to define the simple algebraic extension over which these other polynomials will be rewritten as univariate polynomials with degree one. If \\spad{univ?} is \\spad{true} then these polynomials will have a constant initial."))) NIL NIL -(-604) +(-603) ((|constructor| (NIL "This domain represents a `has' expression.")) (|rhs| (((|SpadAst|) $) "\\spad{rhs(e)} returns the right hand side of the is expression `e'.")) (|lhs| (((|SpadAst|) $) "\\spad{lhs(e)} returns the left hand side of the is expression `e'."))) NIL NIL -(-605 E V R P) +(-604 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 NIL -(-606 |Coef|) +(-605 |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}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-569))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|)))) (|HasCategory| (-558) (QUOTE (-1132))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (|HasSignature| |#1| (|%list| (QUOTE -4375) (|%list| (|devaluate| |#1|) (QUOTE (-1197)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558)))))) -(-607 |Coef|) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-568))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|)))) (|HasCategory| (-557) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-557))))) (|HasSignature| |#1| (|%list| (QUOTE -4374) (|%list| (|devaluate| |#1|) (QUOTE (-1196)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-557)))))) +(-606 |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.}"))) -(((-4426 "*") |has| |#1| (-569)) (-4417 |has| |#1| (-569)) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-569)))) -(-608) +(((-4425 "*") |has| |#1| (-568)) (-4416 |has| |#1| (-568)) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-568)))) +(-607) ((|constructor| (NIL "This domain provides representations for internal type form.")) (|mappingMode| (($ $ (|List| $)) "\\spad{mappingMode(r,ts)} returns a mapping mode with return mode \\spad{r},{} and parameter modes \\spad{ts}.")) (|categoryMode| (($) "\\spad{categoryMode} is a constant mode denoting Category.")) (|voidMode| (($) "\\spad{voidMode} is a constant mode denoting Void.")) (|noValueMode| (($) "\\spad{noValueMode} is a constant mode that indicates that the value of an expression is to be ignored.")) (|jokerMode| (($) "\\spad{jokerMode} is a constant that stands for any mode in a type inference context"))) NIL NIL -(-609 A B) +(-608 A B) ((|constructor| (NIL "Functions defined on streams with entries in two sets.")) (|map| (((|InfiniteTuple| |#2|) (|Mapping| |#2| |#1|) (|InfiniteTuple| |#1|)) "\\spad{map(f,[x0,x1,x2,...])} returns \\spad{[f(x0),f(x1),f(x2),..]}."))) NIL NIL -(-610 A B C) +(-609 A B C) ((|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 -(-611 R -3494 FG) +(-610 R -3493 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 -(-612 S) +(-611 S) ((|constructor| (NIL "This package implements 'infinite tuples' for the interpreter. The representation is a stream.")) (|construct| (((|Stream| |#1|) $) "\\spad{construct(t)} converts an infinite tuple to a stream.")) (|generate| (($ (|Mapping| |#1| |#1|) |#1|) "\\spad{generate(f,s)} returns \\spad{[s,f(s),f(f(s)),...]}.")) (|select| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{select(p,t)} returns \\spad{[x for x in t | p(x)]}.")) (|filterUntil| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{filterUntil(p,t)} returns \\spad{[x for x in t while not p(x)]}.")) (|filterWhile| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{filterWhile(p,t)} returns \\spad{[x for x in t while p(x)]}.")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(f,t)} replaces the tuple \\spad{t} by \\spad{[f(x) for x in t]}."))) NIL NIL -(-613 R |mn|) +(-612 R |mn|) ((|constructor| (NIL "\\indented{2}{This type represents vector like objects with varying lengths} and a user-specified initial index."))) -((-4425 . T) (-4424 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| |#1| (QUOTE (-860))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-745))) (|HasCategory| |#1| (QUOTE (-1069))) (-12 (|HasCategory| |#1| (QUOTE (-1022))) (|HasCategory| |#1| (QUOTE (-1069)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) -(-614 S |Index| |Entry|) +((-4424 . T) (-4423 . T)) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (-3955 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| |#1| (QUOTE (-859))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-744))) (|HasCategory| |#1| (QUOTE (-1068))) (-12 (|HasCategory| |#1| (QUOTE (-1021))) (|HasCategory| |#1| (QUOTE (-1068)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +(-613 S |Index| |Entry|) ((|constructor| (NIL "An indexed aggregate is a many-to-one mapping of indices to entries. For example,{} a one-dimensional-array is an indexed aggregate where the index is an integer. Also,{} a table is an indexed aggregate where the indices and entries may have any type.")) (|swap!| (((|Void|) $ |#2| |#2|) "\\spad{swap!(u,i,j)} interchanges elements \\spad{i} and \\spad{j} of aggregate \\spad{u}. No meaningful value is returned.")) (|fill!| (($ $ |#3|) "\\spad{fill!(u,x)} replaces each entry in aggregate \\spad{u} by \\spad{x}. The modified \\spad{u} is returned as value.")) (|first| ((|#3| $) "\\spad{first(u)} returns the first element \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{first([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = \\spad{x}}. Error: if \\spad{u} is empty.")) (|minIndex| ((|#2| $) "\\spad{minIndex(u)} returns the minimum index \\spad{i} of aggregate \\spad{u}. Note: in general,{} \\axiom{minIndex(a) = reduce(min,{}[\\spad{i} for \\spad{i} in indices a])}; for lists,{} \\axiom{minIndex(a) = 1}.")) (|maxIndex| ((|#2| $) "\\spad{maxIndex(u)} returns the maximum index \\spad{i} of aggregate \\spad{u}. Note: in general,{} \\axiom{maxIndex(\\spad{u}) = reduce(max,{}[\\spad{i} for \\spad{i} in indices \\spad{u}])}; if \\spad{u} is a list,{} \\axiom{maxIndex(\\spad{u}) = \\#u}.")) (|entry?| (((|Boolean|) |#3| $) "\\spad{entry?(x,u)} tests if \\spad{x} equals \\axiom{\\spad{u} . \\spad{i}} for some index \\spad{i}.")) (|indices| (((|List| |#2|) $) "\\spad{indices(u)} returns a list of indices of aggregate \\spad{u} in no particular order.")) (|index?| (((|Boolean|) |#2| $) "\\spad{index?(i,u)} tests if \\spad{i} is an index of aggregate \\spad{u}.")) (|entries| (((|List| |#3|) $) "\\spad{entries(u)} returns a list of all the entries of aggregate \\spad{u} in no assumed order."))) NIL -((|HasAttribute| |#1| (QUOTE -4425)) (|HasCategory| |#2| (QUOTE (-860))) (|HasAttribute| |#1| (QUOTE -4424)) (|HasCategory| |#3| (QUOTE (-1121)))) -(-615 |Index| |Entry|) +((|HasAttribute| |#1| (QUOTE -4424)) (|HasCategory| |#2| (QUOTE (-859))) (|HasAttribute| |#1| (QUOTE -4423)) (|HasCategory| |#3| (QUOTE (-1120)))) +(-614 |Index| |Entry|) ((|constructor| (NIL "An indexed aggregate is a many-to-one mapping of indices to entries. For example,{} a one-dimensional-array is an indexed aggregate where the index is an integer. Also,{} a table is an indexed aggregate where the indices and entries may have any type.")) (|swap!| (((|Void|) $ |#1| |#1|) "\\spad{swap!(u,i,j)} interchanges elements \\spad{i} and \\spad{j} of aggregate \\spad{u}. No meaningful value is returned.")) (|fill!| (($ $ |#2|) "\\spad{fill!(u,x)} replaces each entry in aggregate \\spad{u} by \\spad{x}. The modified \\spad{u} is returned as value.")) (|first| ((|#2| $) "\\spad{first(u)} returns the first element \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{first([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = \\spad{x}}. Error: if \\spad{u} is empty.")) (|minIndex| ((|#1| $) "\\spad{minIndex(u)} returns the minimum index \\spad{i} of aggregate \\spad{u}. Note: in general,{} \\axiom{minIndex(a) = reduce(min,{}[\\spad{i} for \\spad{i} in indices a])}; for lists,{} \\axiom{minIndex(a) = 1}.")) (|maxIndex| ((|#1| $) "\\spad{maxIndex(u)} returns the maximum index \\spad{i} of aggregate \\spad{u}. Note: in general,{} \\axiom{maxIndex(\\spad{u}) = reduce(max,{}[\\spad{i} for \\spad{i} in indices \\spad{u}])}; if \\spad{u} is a list,{} \\axiom{maxIndex(\\spad{u}) = \\#u}.")) (|entry?| (((|Boolean|) |#2| $) "\\spad{entry?(x,u)} tests if \\spad{x} equals \\axiom{\\spad{u} . \\spad{i}} for some index \\spad{i}.")) (|indices| (((|List| |#1|) $) "\\spad{indices(u)} returns a list of indices of aggregate \\spad{u} in no particular order.")) (|index?| (((|Boolean|) |#1| $) "\\spad{index?(i,u)} tests if \\spad{i} is an index of aggregate \\spad{u}.")) (|entries| (((|List| |#2|) $) "\\spad{entries(u)} returns a list of all the entries of aggregate \\spad{u} in no assumed order."))) NIL NIL -(-616) +(-615) ((|constructor| (NIL "This domain represents the join of categories ASTs.")) (|categories| (((|List| (|TypeAst|)) $) "catehories(\\spad{x}) returns the types in the join `x'.")) (|coerce| (($ (|List| (|TypeAst|))) "ts::JoinAst construct the AST for a join of the types `ts'."))) NIL NIL -(-617 R A) +(-616 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)."))) -((-4421 -3956 (-2960 (|has| |#2| (-380 |#1|)) (|has| |#1| (-569))) (-12 (|has| |#2| (-430 |#1|)) (|has| |#1| (-569)))) (-4419 . T) (-4418 . T)) -((-3956 (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|)))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|))))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) -(-618) +((-4420 -3955 (-2959 (|has| |#2| (-380 |#1|)) (|has| |#1| (-568))) (-12 (|has| |#2| (-430 |#1|)) (|has| |#1| (-568)))) (-4418 . T) (-4417 . T)) +((-3955 (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|)))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|))))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) +(-617) ((|constructor| (NIL "This is the datatype for the JVM bytecodes."))) NIL NIL -(-619) +(-618) ((|constructor| (NIL "JVM class file access bitmask and values.")) (|jvmAbstract| (($) "The class was declared abstract; therefore object of this class may not be created.")) (|jvmInterface| (($) "The class file represents an interface,{} not a class.")) (|jvmSuper| (($) "Instruct the JVM to treat base clss method invokation specially.")) (|jvmFinal| (($) "The class was declared final; therefore no derived class allowed.")) (|jvmPublic| (($) "The class was declared public,{} therefore may be accessed from outside its package"))) NIL NIL -(-620) +(-619) ((|constructor| (NIL "JVM class file constant pool tags.")) (|jvmNameAndTypeConstantTag| (($) "The correspondong constant pool entry represents the name and type of a field or method info.")) (|jvmInterfaceMethodConstantTag| (($) "The correspondong constant pool entry represents an interface method info.")) (|jvmMethodrefConstantTag| (($) "The correspondong constant pool entry represents a class method info.")) (|jvmFieldrefConstantTag| (($) "The corresponding constant pool entry represents a class field info.")) (|jvmStringConstantTag| (($) "The corresponding constant pool entry is a string constant info.")) (|jvmClassConstantTag| (($) "The corresponding constant pool entry represents a class or and interface.")) (|jvmDoubleConstantTag| (($) "The corresponding constant pool entry is a double constant info.")) (|jvmLongConstantTag| (($) "The corresponding constant pool entry is a long constant info.")) (|jvmFloatConstantTag| (($) "The corresponding constant pool entry is a float constant info.")) (|jvmIntegerConstantTag| (($) "The corresponding constant pool entry is an integer constant info.")) (|jvmUTF8ConstantTag| (($) "The corresponding constant pool entry is sequence of bytes representing Java \\spad{UTF8} string constant."))) NIL NIL -(-621) +(-620) ((|constructor| (NIL "JVM class field access bitmask and values.")) (|jvmTransient| (($) "The field was declared transient.")) (|jvmVolatile| (($) "The field was declared volatile.")) (|jvmFinal| (($) "The field was declared final; therefore may not be modified after initialization.")) (|jvmStatic| (($) "The field was declared static.")) (|jvmProtected| (($) "The field was declared protected; therefore may be accessed withing derived classes.")) (|jvmPrivate| (($) "The field was declared private; threfore can be accessed only within the defining class.")) (|jvmPublic| (($) "The field was declared public; therefore mey accessed from outside its package."))) NIL NIL -(-622) +(-621) ((|constructor| (NIL "JVM class method access bitmask and values.")) (|jvmStrict| (($) "The method was declared fpstrict; therefore floating-point mode is FP-strict.")) (|jvmAbstract| (($) "The method was declared abstract; therefore no implementation is provided.")) (|jvmNative| (($) "The method was declared native; therefore implemented in a language other than Java.")) (|jvmSynchronized| (($) "The method was declared synchronized.")) (|jvmFinal| (($) "The method was declared final; therefore may not be overriden. in derived classes.")) (|jvmStatic| (($) "The method was declared static.")) (|jvmProtected| (($) "The method was declared protected; therefore may be accessed withing derived classes.")) (|jvmPrivate| (($) "The method was declared private; threfore can be accessed only within the defining class.")) (|jvmPublic| (($) "The method was declared public; therefore mey accessed from outside its package."))) NIL NIL -(-623) +(-622) ((|constructor| (NIL "This is the datatype for the JVM opcodes."))) NIL NIL -(-624 |Entry|) +(-623 |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."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4289) (QUOTE (-1179))) (|%list| (QUOTE |:|) (QUOTE -2285) (|devaluate| |#1|))))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (QUOTE (-1121)))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (|%list| (QUOTE -630) (QUOTE (-547)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| (-1179) (QUOTE (-860))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (QUOTE (-102)))) -(-625 S |Key| |Entry|) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4288) (QUOTE (-1178))) (|%list| (QUOTE |:|) (QUOTE -2284) (|devaluate| |#1|))))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (QUOTE (-1120)))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (|%list| (QUOTE -629) (QUOTE (-546)))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| (-1178) (QUOTE (-859))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (QUOTE (-102)))) +(-624 S |Key| |Entry|) ((|constructor| (NIL "A keyed dictionary is a dictionary of key-entry pairs for which there is a unique entry for each key.")) (|search| (((|Union| |#3| "failed") |#2| $) "\\spad{search(k,t)} searches the table \\spad{t} for the key \\spad{k},{} returning the entry stored in \\spad{t} for key \\spad{k}. If \\spad{t} has no such key,{} \\axiom{search(\\spad{k},{}\\spad{t})} returns \"failed\".")) (|remove!| (((|Union| |#3| "failed") |#2| $) "\\spad{remove!(k,t)} searches the table \\spad{t} for the key \\spad{k} removing (and return) the entry if there. If \\spad{t} has no such key,{} \\axiom{remove!(\\spad{k},{}\\spad{t})} returns \"failed\".")) (|keys| (((|List| |#2|) $) "\\spad{keys(t)} returns the list the keys in table \\spad{t}.")) (|key?| (((|Boolean|) |#2| $) "\\spad{key?(k,t)} tests if \\spad{k} is a key in table \\spad{t}."))) NIL NIL -(-626 |Key| |Entry|) +(-625 |Key| |Entry|) ((|constructor| (NIL "A keyed dictionary is a dictionary of key-entry pairs for which there is a unique entry for each key.")) (|search| (((|Union| |#2| "failed") |#1| $) "\\spad{search(k,t)} searches the table \\spad{t} for the key \\spad{k},{} returning the entry stored in \\spad{t} for key \\spad{k}. If \\spad{t} has no such key,{} \\axiom{search(\\spad{k},{}\\spad{t})} returns \"failed\".")) (|remove!| (((|Union| |#2| "failed") |#1| $) "\\spad{remove!(k,t)} searches the table \\spad{t} for the key \\spad{k} removing (and return) the entry if there. If \\spad{t} has no such key,{} \\axiom{remove!(\\spad{k},{}\\spad{t})} returns \"failed\".")) (|keys| (((|List| |#1|) $) "\\spad{keys(t)} returns the list the keys in table \\spad{t}.")) (|key?| (((|Boolean|) |#1| $) "\\spad{key?(k,t)} tests if \\spad{k} is a key in table \\spad{t}."))) -((-4425 . T)) +((-4424 . T)) NIL -(-627 S) +(-626 S) ((|constructor| (NIL "A kernel over a set \\spad{S} is an operator applied to a given list of arguments from \\spad{S}.")) (|is?| (((|Boolean|) $ (|Symbol|)) "\\spad{is?(op(a1,...,an), s)} tests if the name of op is \\spad{s}.") (((|Boolean|) $ (|BasicOperator|)) "\\spad{is?(op(a1,...,an), f)} tests if op = \\spad{f}.")) (|symbolIfCan| (((|Union| (|Symbol|) "failed") $) "\\spad{symbolIfCan(k)} returns \\spad{k} viewed as a symbol if \\spad{k} is a symbol,{} and \"failed\" otherwise.")) (|kernel| (($ (|Symbol|)) "\\spad{kernel(x)} returns \\spad{x} viewed as a kernel.") (($ (|BasicOperator|) (|List| |#1|) (|NonNegativeInteger|)) "\\spad{kernel(op, [a1,...,an], m)} returns the kernel \\spad{op(a1,...,an)} of nesting level \\spad{m}. Error: if \\spad{op} is \\spad{k}-ary for some \\spad{k} not equal to \\spad{m}.")) (|height| (((|NonNegativeInteger|) $) "\\spad{height(k)} returns the nesting level of \\spad{k}.")) (|argument| (((|List| |#1|) $) "\\spad{argument(op(a1,...,an))} returns \\spad{[a1,...,an]}.")) (|operator| (((|BasicOperator|) $) "\\spad{operator(op(a1,...,an))} returns the operator op."))) NIL -((|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) -(-628 R S) +((|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) +(-627 R S) ((|constructor| (NIL "This package exports some auxiliary functions on kernels")) (|constantIfCan| (((|Union| |#1| "failed") (|Kernel| |#2|)) "\\spad{constantIfCan(k)} \\undocumented")) (|constantKernel| (((|Kernel| |#2|) |#1|) "\\spad{constantKernel(r)} \\undocumented"))) NIL NIL -(-629 S) +(-628 S) ((|constructor| (NIL "A is coercible to \\spad{B} means any element of A can automatically be converted into an element of \\spad{B} by the interpreter.")) (|coerce| ((|#1| $) "\\spad{coerce(a)} transforms a into an element of \\spad{S}."))) NIL NIL -(-630 S) +(-629 S) ((|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 -(-631 -3494 UP) +(-630 -3493 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 -(-632 S) +(-631 S) ((|constructor| (NIL "A is coercible from \\spad{B} iff any element of domain \\spad{B} can be automically converted into an element of domain A.")) (|coerce| (($ |#1|) "\\spad{coerce(s)} transforms `s' into an element of `\\%'."))) NIL NIL -(-633) +(-632) ((|constructor| (NIL "This domain implements Kleene's 3-valued propositional logic.")) (|case| (((|Boolean|) $ (|[\|\|]| |true|)) "\\spad{s case true} holds if the value of `x' is `true'.") (((|Boolean|) $ (|[\|\|]| |unknown|)) "\\spad{x case unknown} holds if the value of `x' is `unknown'") (((|Boolean|) $ (|[\|\|]| |false|)) "\\spad{x case false} holds if the value of `x' is `false'")) (|unknown| (($) "the indefinite `unknown'"))) NIL NIL -(-634 S) +(-633 S) ((|constructor| (NIL "A is convertible from \\spad{B} iff any element of domain \\spad{B} can be explicitly converted into an element of domain A.")) (|convert| (($ |#1|) "\\spad{convert(s)} transforms `s' into an element of `\\%'."))) NIL NIL -(-635 A R S) +(-634 A R S) ((|constructor| (NIL "LocalAlgebra produces the localization of an algebra,{} \\spadignore{i.e.} fractions whose numerators come from some \\spad{R} algebra.")) (|denom| ((|#3| $) "\\spad{denom x} returns the denominator of \\spad{x}.")) (|numer| ((|#1| $) "\\spad{numer x} returns the numerator of \\spad{x}.")) (/ (($ |#1| |#3|) "\\spad{a / d} divides the element \\spad{a} by \\spad{d}.") (($ $ |#3|) "\\spad{x / d} divides the element \\spad{x} by \\spad{d}."))) -((-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-859)))) -(-636 S R) +((-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-858)))) +(-635 S R) ((|constructor| (NIL "The category of all left algebras over an arbitrary ring.")) (|coerce| (($ |#2|) "\\spad{coerce(r)} returns \\spad{r} * 1 where 1 is the identity of the left algebra."))) NIL NIL -(-637 R) +(-636 R) ((|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."))) -((-4421 . T)) +((-4420 . T)) NIL -(-638 R -3494) +(-637 R -3493) ((|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 -(-639 R UP) +(-638 R UP) ((|constructor| (NIL "\\indented{1}{Univariate polynomials with negative and positive exponents.} Author: Manuel Bronstein Date Created: May 1988 Date Last Updated: 26 Apr 1990")) (|separate| (((|Record| (|:| |polyPart| $) (|:| |fracPart| (|Fraction| |#2|))) (|Fraction| |#2|)) "\\spad{separate(x)} \\undocumented")) (|monomial| (($ |#1| (|Integer|)) "\\spad{monomial(x,n)} \\undocumented")) (|coefficient| ((|#1| $ (|Integer|)) "\\spad{coefficient(x,n)} \\undocumented")) (|trailingCoefficient| ((|#1| $) "\\spad{trailingCoefficient }\\undocumented")) (|leadingCoefficient| ((|#1| $) "\\spad{leadingCoefficient }\\undocumented")) (|reductum| (($ $) "\\spad{reductum(x)} \\undocumented")) (|order| (((|Integer|) $) "\\spad{order(x)} \\undocumented")) (|degree| (((|Integer|) $) "\\spad{degree(x)} \\undocumented")) (|monomial?| (((|Boolean|) $) "\\spad{monomial?(x)} \\undocumented"))) -((-4419 . T) (-4418 . T) ((-4426 "*") . T) (-4417 . T) (-4421 . T)) -((|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#2| (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558))))) -(-640 R E V P TS ST) +((-4418 . T) (-4417 . T) ((-4425 "*") . T) (-4416 . T) (-4420 . T)) +((|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#2| (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557))))) +(-639 R E V P TS ST) ((|constructor| (NIL "A package for solving polynomial systems by means of Lazard triangular sets [1]. This package provides two operations. One for solving in the sense of the regular zeros,{} and the other for solving in the sense of the Zariski closure. Both produce square-free regular sets. Moreover,{} the decompositions do not contain any redundant component. However,{} only zero-dimensional regular sets are normalized,{} since normalization may be time consumming in positive dimension. The decomposition process is that of [2].\\newline References : \\indented{1}{[1] \\spad{D}. LAZARD \"A new method for solving algebraic systems of} \\indented{5}{positive dimension\" Discr. App. Math. 33:147-160,{}1991} \\indented{1}{[2] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}")) (|zeroSetSplit| (((|List| |#6|) (|List| |#4|) (|Boolean|)) "\\axiom{zeroSetSplit(lp,{}clos?)} has the same specifications as \\axiomOpFrom{zeroSetSplit(lp,{}clos?)}{RegularTriangularSetCategory}.")) (|normalizeIfCan| ((|#6| |#6|) "\\axiom{normalizeIfCan(ts)} returns \\axiom{ts} in an normalized shape if \\axiom{ts} is zero-dimensional."))) NIL NIL -(-641 OV E Z P) +(-640 OV E Z P) ((|constructor| (NIL "Package for leading coefficient determination in the lifting step. Package working for every \\spad{R} euclidean with property \"F\".")) (|distFact| (((|Union| (|Record| (|:| |polfac| (|List| |#4|)) (|:| |correct| |#3|) (|:| |corrfact| (|List| (|SparseUnivariatePolynomial| |#3|)))) "failed") |#3| (|List| (|SparseUnivariatePolynomial| |#3|)) (|Record| (|:| |contp| |#3|) (|:| |factors| (|List| (|Record| (|:| |irr| |#4|) (|:| |pow| (|Integer|)))))) (|List| |#3|) (|List| |#1|) (|List| |#3|)) "\\spad{distFact(contm,unilist,plead,vl,lvar,lval)},{} where \\spad{contm} is the content of the evaluated polynomial,{} \\spad{unilist} is the list of factors of the evaluated polynomial,{} \\spad{plead} is the complete factorization of the leading coefficient,{} \\spad{vl} is the list of factors of the leading coefficient evaluated,{} \\spad{lvar} is the list of variables,{} \\spad{lval} is the list of values,{} returns a record giving the list of leading coefficients to impose on the univariate factors,{}")) (|polCase| (((|Boolean|) |#3| (|NonNegativeInteger|) (|List| |#3|)) "\\spad{polCase(contprod, numFacts, evallcs)},{} where \\spad{contprod} is the product of the content of the leading coefficient of the polynomial to be factored with the content of the evaluated polynomial,{} \\spad{numFacts} is the number of factors of the leadingCoefficient,{} and evallcs is the list of the evaluated factors of the leadingCoefficient,{} returns \\spad{true} if the factors of the leading Coefficient can be distributed with this valuation."))) NIL NIL -(-642) +(-641) ((|constructor| (NIL "This domain represents assignment expressions.")) (|rhs| (((|SpadAst|) $) "\\spad{rhs(e)} returns the right hand side of the assignment expression `e'.")) (|lhs| (((|SpadAst|) $) "\\spad{lhs(e)} returns the left hand side of the assignment expression `e'."))) NIL NIL -(-643 |VarSet| R |Order|) +(-642 |VarSet| R |Order|) ((|constructor| (NIL "Management of the Lie Group associated with a free nilpotent Lie algebra. Every Lie bracket with length greater than \\axiom{Order} are assumed to be null. The implementation inherits from the \\spadtype{XPBWPolynomial} domain constructor: Lyndon coordinates are exponential coordinates of the second kind. \\newline Author: Michel Petitot (petitot@lifl.fr).")) (|identification| (((|List| (|Equation| |#2|)) $ $) "\\axiom{identification(\\spad{g},{}\\spad{h})} returns the list of equations \\axiom{g_i = h_i},{} where \\axiom{g_i} (resp. \\axiom{h_i}) are exponential coordinates of \\axiom{\\spad{g}} (resp. \\axiom{\\spad{h}}).")) (|LyndonCoordinates| (((|List| (|Record| (|:| |k| (|LyndonWord| |#1|)) (|:| |c| |#2|))) $) "\\axiom{LyndonCoordinates(\\spad{g})} returns the exponential coordinates of \\axiom{\\spad{g}}.")) (|LyndonBasis| (((|List| (|LiePolynomial| |#1| |#2|)) (|List| |#1|)) "\\axiom{LyndonBasis(lv)} returns the Lyndon basis of the nilpotent free Lie algebra.")) (|varList| (((|List| |#1|) $) "\\axiom{varList(\\spad{g})} returns the list of variables of \\axiom{\\spad{g}}.")) (|mirror| (($ $) "\\axiom{mirror(\\spad{g})} is the mirror of the internal representation of \\axiom{\\spad{g}}.")) (|coerce| (((|XPBWPolynomial| |#1| |#2|) $) "\\axiom{coerce(\\spad{g})} returns the internal representation of \\axiom{\\spad{g}}.") (((|XDistributedPolynomial| |#1| |#2|) $) "\\axiom{coerce(\\spad{g})} returns the internal representation of \\axiom{\\spad{g}}.")) (|ListOfTerms| (((|List| (|Record| (|:| |k| (|PoincareBirkhoffWittLyndonBasis| |#1|)) (|:| |c| |#2|))) $) "\\axiom{ListOfTerms(\\spad{p})} returns the internal representation of \\axiom{\\spad{p}}.")) (|log| (((|LiePolynomial| |#1| |#2|) $) "\\axiom{log(\\spad{p})} returns the logarithm of \\axiom{\\spad{p}}.")) (|exp| (($ (|LiePolynomial| |#1| |#2|)) "\\axiom{exp(\\spad{p})} returns the exponential of \\axiom{\\spad{p}}."))) -((-4421 . T)) +((-4420 . T)) NIL -(-644 R |ls|) +(-643 R |ls|) ((|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 -(-645 R -3494) +(-644 R -3493) ((|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 -(-646) +(-645) ((|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 -(-647 |lv| -3494) +(-646 |lv| -3493) ((|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 -(-648) +(-647) ((|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."))) -((-4425 . T)) -((-12 (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 (-51))) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4289) (QUOTE (-1179))) (|%list| (QUOTE |:|) (QUOTE -2285) (QUOTE (-51)))))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 (-51))) (QUOTE (-1121)))) (-3956 (|HasCategory| (-51) (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 (-51))) (QUOTE (-1121)))) (-3956 (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 (-51))) (QUOTE (-1121)))) (-3956 (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 (-51))) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-51) (QUOTE (-1121))) (|HasCategory| (-51) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 (-51))) (QUOTE (-1121)))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 (-51))) (|%list| (QUOTE -630) (QUOTE (-547)))) (-12 (|HasCategory| (-51) (QUOTE (-1121))) (|HasCategory| (-51) (|%list| (QUOTE -321) (QUOTE (-51))))) (|HasCategory| (-1179) (QUOTE (-860))) (-3956 (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 (-51))) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-51) (|%list| (QUOTE -629) (QUOTE (-876))))) (-3956 (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 (-51))) (QUOTE (-102)))) (|HasCategory| (-51) (QUOTE (-1121))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 (-51))) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 (-51))) (QUOTE (-1121)))) -(-649 R A) +((-4424 . T)) +((-12 (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 (-51))) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4288) (QUOTE (-1178))) (|%list| (QUOTE |:|) (QUOTE -2284) (QUOTE (-51)))))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 (-51))) (QUOTE (-1120)))) (-3955 (|HasCategory| (-51) (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 (-51))) (QUOTE (-1120)))) (-3955 (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 (-51))) (QUOTE (-1120)))) (-3955 (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 (-51))) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-51) (QUOTE (-1120))) (|HasCategory| (-51) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 (-51))) (QUOTE (-1120)))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 (-51))) (|%list| (QUOTE -629) (QUOTE (-546)))) (-12 (|HasCategory| (-51) (QUOTE (-1120))) (|HasCategory| (-51) (|%list| (QUOTE -321) (QUOTE (-51))))) (|HasCategory| (-1178) (QUOTE (-859))) (-3955 (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 (-51))) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-51) (|%list| (QUOTE -628) (QUOTE (-875))))) (-3955 (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 (-51))) (QUOTE (-102)))) (|HasCategory| (-51) (QUOTE (-1120))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 (-51))) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 (-51))) (QUOTE (-1120)))) +(-648 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)."))) -((-4421 -3956 (-2960 (|has| |#2| (-380 |#1|)) (|has| |#1| (-569))) (-12 (|has| |#2| (-430 |#1|)) (|has| |#1| (-569)))) (-4419 . T) (-4418 . T)) -((-3956 (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|)))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|))))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) -(-650 S R) +((-4420 -3955 (-2959 (|has| |#2| (-380 |#1|)) (|has| |#1| (-568))) (-12 (|has| |#2| (-430 |#1|)) (|has| |#1| (-568)))) (-4418 . T) (-4417 . T)) +((-3955 (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|)))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#2| (|%list| (QUOTE -430) (|devaluate| |#1|))))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) +(-649 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 ((|HasCategory| |#2| (QUOTE (-376)))) -(-651 R) +(-650 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.")) (/ (($ $ |#1|) "\\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}}."))) -((|JacobiIdentity| . T) (|NullSquare| . T) (-4419 . T) (-4418 . T)) +((|JacobiIdentity| . T) (|NullSquare| . T) (-4418 . T) (-4417 . T)) NIL -(-652 R FE) +(-651 R FE) ((|constructor| (NIL "PowerSeriesLimitPackage implements limits of expressions in one or more variables as one of the variables approaches a limiting value. Included are two-sided limits,{} left- and right- hand limits,{} and limits at plus or minus infinity.")) (|complexLimit| (((|Union| (|OnePointCompletion| |#2|) "failed") |#2| (|Equation| (|OnePointCompletion| |#2|))) "\\spad{complexLimit(f(x),x = a)} computes the complex limit \\spad{lim(x -> a,f(x))}.")) (|limit| (((|Union| (|OrderedCompletion| |#2|) #1="failed") |#2| (|Equation| |#2|) (|String|)) "\\spad{limit(f(x),x=a,\"left\")} computes the left hand real limit \\spad{lim(x -> a-,f(x))}; \\spad{limit(f(x),x=a,\"right\")} computes the right hand real limit \\spad{lim(x -> a+,f(x))}.") (((|Union| (|OrderedCompletion| |#2|) (|Record| (|:| |leftHandLimit| (|Union| (|OrderedCompletion| |#2|) #1#)) (|:| |rightHandLimit| (|Union| (|OrderedCompletion| |#2|) #1#))) "failed") |#2| (|Equation| (|OrderedCompletion| |#2|))) "\\spad{limit(f(x),x = a)} computes the real limit \\spad{lim(x -> a,f(x))}."))) NIL NIL -(-653 R) +(-652 R) ((|constructor| (NIL "Computation of limits for rational functions.")) (|complexLimit| (((|OnePointCompletion| (|Fraction| (|Polynomial| |#1|))) (|Fraction| (|Polynomial| |#1|)) (|Equation| (|Fraction| (|Polynomial| |#1|)))) "\\spad{complexLimit(f(x),x = a)} computes the complex limit of \\spad{f} as its argument \\spad{x} approaches \\spad{a}.") (((|OnePointCompletion| (|Fraction| (|Polynomial| |#1|))) (|Fraction| (|Polynomial| |#1|)) (|Equation| (|OnePointCompletion| (|Polynomial| |#1|)))) "\\spad{complexLimit(f(x),x = a)} computes the complex limit of \\spad{f} as its argument \\spad{x} approaches \\spad{a}.")) (|limit| (((|Union| (|OrderedCompletion| (|Fraction| (|Polynomial| |#1|))) #1="failed") (|Fraction| (|Polynomial| |#1|)) (|Equation| (|Fraction| (|Polynomial| |#1|))) (|String|)) "\\spad{limit(f(x),x,a,\"left\")} computes the real limit of \\spad{f} as its argument \\spad{x} approaches \\spad{a} from the left; limit(\\spad{f}(\\spad{x}),{}\\spad{x},{}a,{}\"right\") computes the corresponding limit as \\spad{x} approaches \\spad{a} from the right.") (((|Union| (|OrderedCompletion| (|Fraction| (|Polynomial| |#1|))) (|Record| (|:| |leftHandLimit| (|Union| (|OrderedCompletion| (|Fraction| (|Polynomial| |#1|))) #1#)) (|:| |rightHandLimit| (|Union| (|OrderedCompletion| (|Fraction| (|Polynomial| |#1|))) #1#))) #2="failed") (|Fraction| (|Polynomial| |#1|)) (|Equation| (|Fraction| (|Polynomial| |#1|)))) "\\spad{limit(f(x),x = a)} computes the real two-sided limit of \\spad{f} as its argument \\spad{x} approaches \\spad{a}.") (((|Union| (|OrderedCompletion| (|Fraction| (|Polynomial| |#1|))) (|Record| (|:| |leftHandLimit| (|Union| (|OrderedCompletion| (|Fraction| (|Polynomial| |#1|))) #1#)) (|:| |rightHandLimit| (|Union| (|OrderedCompletion| (|Fraction| (|Polynomial| |#1|))) #1#))) #2#) (|Fraction| (|Polynomial| |#1|)) (|Equation| (|OrderedCompletion| (|Polynomial| |#1|)))) "\\spad{limit(f(x),x = a)} computes the real two-sided limit of \\spad{f} as its argument \\spad{x} approaches \\spad{a}."))) NIL NIL -(-654 |vars|) +(-653 |vars|) ((|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 vector space basis,{} given by symbols.}")) (|dual| (($ (|DualBasis| |#1|)) "\\spad{dual f} constructs the dual vector of a linear form which is part of a basis."))) NIL NIL -(-655 S R) +(-654 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 -((-2958 (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-376)))) -(-656 K B) +((-2957 (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-376)))) +(-655 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}."))) -((-4419 . T) (-4418 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| (-654 |#2|) (QUOTE (-1121))))) -(-657 R) +((-4418 . T) (-4417 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| (-653 |#2|) (QUOTE (-1120))))) +(-656 R) ((|constructor| (NIL "An extension of left-module with an explicit linear dependence test.")) (|reducedSystem| (((|Record| (|:| |mat| (|Matrix| |#1|)) (|:| |vec| (|Vector| |#1|))) (|Matrix| $) (|Vector| $)) "\\spad{reducedSystem(A, v)} returns a matrix \\spad{B} and a vector \\spad{w} such that \\spad{A x = v} and \\spad{B x = w} have the same solutions in \\spad{R}.") (((|Matrix| |#1|) (|Matrix| $)) "\\spad{reducedSystem(A)} returns a matrix \\spad{B} such that \\spad{A x = 0} and \\spad{B x = 0} have the same solutions in \\spad{R}.")) (|leftReducedSystem| (((|Record| (|:| |mat| (|Matrix| |#1|)) (|:| |vec| (|Vector| |#1|))) (|Vector| $) $) "\\spad{reducedSystem([v1,...,vn],u)} returns a matrix \\spad{M} with coefficients in \\spad{R} and a vector \\spad{w} such that the system of equations \\spad{c1*v1 + ... + cn*vn = u} has the same solution as \\spad{c * M = w} where \\spad{c} is the row vector \\spad{[c1,...cn]}.") (((|Matrix| |#1|) (|Vector| $)) "\\spad{leftReducedSystem [v1,...,vn]} returns a matrix \\spad{M} with coefficients in \\spad{R} such that the system of equations \\spad{c1*v1 + ... + cn*vn = 0\\$\\%} has the same solution as \\spad{c * M = 0} where \\spad{c} is the row vector \\spad{[c1,...cn]}."))) NIL NIL -(-658 K B) +(-657 K B) ((|constructor| (NIL "A simple data structure for linear forms on 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 form with respect to the basis \\spad{DualBasis B}.")) (|linearForm| (($ (|List| |#1|)) "\\spad{linearForm [x1,..,xn]} constructs a linear form with coordinates \\spad{[x1,..,xn]} with respect to the basis elements \\spad{DualBasis B}."))) -((-4419 . T) (-4418 . T)) +((-4418 . T) (-4417 . T)) NIL -(-659 S) +(-658 S) ((|constructor| (NIL "\\indented{2}{A set is an \\spad{S}-linear set if it is stable by dilation} \\indented{2}{by elements in the semigroup \\spad{S}.} See Also: LeftLinearSet,{} RightLinearSet."))) NIL NIL -(-660 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."))) -((-4425 . T) (-4424 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| |#1| (QUOTE (-860))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) -(-661 A B) +(-659 S) +((|constructor| (NIL "\\spadtype{List} implements singly-linked lists that are addressable by indices; the index of the first element is 1. 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."))) +((-4424 . T) (-4423 . T)) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (-3955 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| |#1| (QUOTE (-859))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +(-660 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 NIL -(-662 A B) +(-661 A B) ((|constructor| (NIL "\\spadtype{ListToMap} allows mappings to be described by a pair of lists of equal lengths. The image of an element \\spad{x},{} which appears in position \\spad{n} in the first list,{} is then the \\spad{n}th element of the second list. A default value or default function can be specified to be used when \\spad{x} does not appear in the first list. In the absence of defaults,{} an error will occur in that case.")) (|match| ((|#2| (|List| |#1|) (|List| |#2|) |#1| (|Mapping| |#2| |#1|)) "\\spad{match(la, lb, a, f)} creates a map defined by lists \\spad{la} and \\spad{lb} of equal length. and applies this map to a. The target of a source value \\spad{x} in \\spad{la} is the value \\spad{y} with the same index \\spad{lb}. Argument \\spad{f} is a default function to call if a is not in \\spad{la}. The value returned is then obtained by applying \\spad{f} to argument a.") (((|Mapping| |#2| |#1|) (|List| |#1|) (|List| |#2|) (|Mapping| |#2| |#1|)) "\\spad{match(la, lb, f)} creates a map defined by lists \\spad{la} and \\spad{lb} of equal length. The target of a source value \\spad{x} in \\spad{la} is the value \\spad{y} with the same index \\spad{lb}. Argument \\spad{f} is used as the function to call when the given function argument is not in \\spad{la}. The value returned is \\spad{f} applied to that argument.") ((|#2| (|List| |#1|) (|List| |#2|) |#1| |#2|) "\\spad{match(la, lb, a, b)} creates a map defined by lists \\spad{la} and \\spad{lb} of equal length. and applies this map to a. The target of a source value \\spad{x} in \\spad{la} is the value \\spad{y} with the same index \\spad{lb}. Argument \\spad{b} is the default target value if a is not in \\spad{la}. Error: if \\spad{la} and \\spad{lb} are not of equal length.") (((|Mapping| |#2| |#1|) (|List| |#1|) (|List| |#2|) |#2|) "\\spad{match(la, lb, b)} creates a map defined by lists \\spad{la} and \\spad{lb} of equal length,{} where \\spad{b} is used as the default target value if the given function argument is not in \\spad{la}. The target of a source value \\spad{x} in \\spad{la} is the value \\spad{y} with the same index \\spad{lb}. Error: if \\spad{la} and \\spad{lb} are not of equal length.") ((|#2| (|List| |#1|) (|List| |#2|) |#1|) "\\spad{match(la, lb, a)} creates a map defined by lists \\spad{la} and \\spad{lb} of equal length,{} where \\spad{a} is used as the default source value if the given one is not in \\spad{la}. The target of a source value \\spad{x} in \\spad{la} is the value \\spad{y} with the same index \\spad{lb}. Error: if \\spad{la} and \\spad{lb} are not of equal length.") (((|Mapping| |#2| |#1|) (|List| |#1|) (|List| |#2|)) "\\spad{match(la, lb)} creates a map with no default source or target values defined by lists \\spad{la} and lb of equal length. The target of a source value \\spad{x} in \\spad{la} is the value \\spad{y} with the same index lb. Error: if \\spad{la} and lb are not of equal length. Note: when this map is applied,{} an error occurs when applied to a value missing from \\spad{la}."))) NIL NIL -(-663 A B C) +(-662 A B C) ((|constructor| (NIL "\\spadtype{ListFunctions3} implements utility functions that operate on three kinds of lists,{} each with a possibly different type of element.")) (|map| (((|List| |#3|) (|Mapping| |#3| |#1| |#2|) (|List| |#1|) (|List| |#2|)) "\\spad{map(fn,list1, u2)} applies the binary function \\spad{fn} to corresponding elements of lists \\spad{u1} and \\spad{u2} and returns a list of the results (in the same order). Thus \\spad{map(/,[1,2,3],[4,5,6]) = [1/4,2/4,1/2]}. The computation terminates when the end of either list is reached. That is,{} the length of the result list is equal to the minimum of the lengths of \\spad{u1} and \\spad{u2}."))) NIL NIL -(-664 T$) +(-663 T$) ((|constructor| (NIL "This domain represents AST for Spad literals."))) NIL NIL -(-665 S) +(-664 S) ((|constructor| (NIL "\\indented{2}{A set is an \\spad{S}-left linear set if it is stable by left-dilation} \\indented{2}{by elements in the semigroup \\spad{S}.} See Also: RightLinearSet.")) (* (($ |#1| $) "\\spad{s*x} is the left-dilation of \\spad{x} by \\spad{s}."))) NIL NIL -(-666 S) +(-665 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."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) -(-667 R) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102)))) +(-666 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 NIL -(-668 S E |un|) +(-667 S E |un|) ((|constructor| (NIL "This internal package represents monoid (abelian or not,{} with or without inverses) as lists and provides some common operations to the various flavors of monoids.")) (|mapGen| (($ (|Mapping| |#1| |#1|) $) "\\spad{mapGen(f, a1\\^e1 ... an\\^en)} returns \\spad{f(a1)\\^e1 ... f(an)\\^en}.")) (|mapExpon| (($ (|Mapping| |#2| |#2|) $) "\\spad{mapExpon(f, a1\\^e1 ... an\\^en)} returns \\spad{a1\\^f(e1) ... an\\^f(en)}.")) (|commutativeEquality| (((|Boolean|) $ $) "\\spad{commutativeEquality(x,y)} returns \\spad{true} if \\spad{x} and \\spad{y} are equal assuming commutativity")) (|plus| (($ $ $) "\\spad{plus(x, y)} returns \\spad{x + y} where \\spad{+} is the monoid operation,{} which is assumed commutative.") (($ |#1| |#2| $) "\\spad{plus(s, e, x)} returns \\spad{e * s + x} where \\spad{+} is the monoid operation,{} which is assumed commutative.")) (|leftMult| (($ |#1| $) "\\spad{leftMult(s, a)} returns \\spad{s * a} where \\spad{*} is the monoid operation,{} which is assumed non-commutative.")) (|rightMult| (($ $ |#1|) "\\spad{rightMult(a, s)} returns \\spad{a * s} where \\spad{*} is the monoid operation,{} which is assumed non-commutative.")) (|makeUnit| (($) "\\spad{makeUnit()} returns the unit element of the monomial.")) (|size| (((|NonNegativeInteger|) $) "\\spad{size(l)} returns the number of monomials forming \\spad{l}.")) (|reverse!| (($ $) "\\spad{reverse!(l)} reverses the list of monomials forming \\spad{l},{} destroying the element \\spad{l}.")) (|reverse| (($ $) "\\spad{reverse(l)} reverses the list of monomials forming \\spad{l}. This has some effect if the monoid is non-abelian,{} \\spadignore{i.e.} \\spad{reverse(a1\\^e1 ... an\\^en) = an\\^en ... a1\\^e1} which is different.")) (|nthFactor| ((|#1| $ (|Integer|)) "\\spad{nthFactor(l, n)} returns the factor of the n^th monomial of \\spad{l}.")) (|nthExpon| ((|#2| $ (|Integer|)) "\\spad{nthExpon(l, n)} returns the exponent of the n^th monomial of \\spad{l}.")) (|makeMulti| (($ (|List| (|Record| (|:| |gen| |#1|) (|:| |exp| |#2|)))) "\\spad{makeMulti(l)} returns the element whose list of monomials is \\spad{l}.")) (|makeTerm| (($ |#1| |#2|) "\\spad{makeTerm(s, e)} returns the monomial \\spad{s} exponentiated by \\spad{e} (\\spadignore{e.g.} s^e or \\spad{e} * \\spad{s}).")) (|listOfMonoms| (((|List| (|Record| (|:| |gen| |#1|) (|:| |exp| |#2|))) $) "\\spad{listOfMonoms(l)} returns the list of the monomials forming \\spad{l}.")) (|outputForm| (((|OutputForm|) $ (|Mapping| (|OutputForm|) (|OutputForm|) (|OutputForm|)) (|Mapping| (|OutputForm|) (|OutputForm|) (|OutputForm|)) (|Integer|)) "\\spad{outputForm(l, fop, fexp, unit)} converts the monoid element represented by \\spad{l} to an \\spadtype{OutputForm}. Argument unit is the output form for the \\spadignore{unit} of the monoid (\\spadignore{e.g.} 0 or 1),{} \\spad{fop(a, b)} is the output form for the monoid operation applied to \\spad{a} and \\spad{b} (\\spadignore{e.g.} \\spad{a + b},{} \\spad{a * b},{} \\spad{ab}),{} and \\spad{fexp(a, n)} is the output form for the exponentiation operation applied to \\spad{a} and \\spad{n} (\\spadignore{e.g.} \\spad{n a},{} \\spad{n * a},{} \\spad{a ** n},{} \\spad{a\\^n})."))) NIL NIL -(-669 A S) +(-668 A S) ((|constructor| (NIL "A linear aggregate is an aggregate whose elements are indexed by integers. Examples of linear aggregates are strings,{} lists,{} and arrays. Most of the exported operations for linear aggregates are non-destructive but are not always efficient for a particular aggregate. For example,{} \\spadfun{concat} of two lists needs only to copy its first argument,{} whereas \\spadfun{concat} of two arrays needs to copy both arguments. Most of the operations exported here apply to infinite objects (\\spadignore{e.g.} streams) as well to finite ones. For finite linear aggregates,{} see \\spadtype{FiniteLinearAggregate}.")) (|setelt| ((|#2| $ (|UniversalSegment| (|Integer|)) |#2|) "\\spad{setelt(u,i..j,x)} (also written: \\axiom{\\spad{u}(\\spad{i}..\\spad{j}) := \\spad{x}}) destructively replaces each element in the segment \\axiom{\\spad{u}(\\spad{i}..\\spad{j})} by \\spad{x}. The value \\spad{x} is returned. Note: \\spad{u} is destructively change so that \\axiom{\\spad{u}.\\spad{k} := \\spad{x} for \\spad{k} in \\spad{i}..\\spad{j}}; its length remains unchanged.")) (|insert| (($ $ $ (|Integer|)) "\\spad{insert(v,u,k)} returns a copy of \\spad{u} having \\spad{v} inserted beginning at the \\axiom{\\spad{i}}th element. Note: \\axiom{insert(\\spad{v},{}\\spad{u},{}\\spad{k}) = concat( \\spad{u}(0..\\spad{k}-1),{} \\spad{v},{} \\spad{u}(\\spad{k}..) )}.") (($ |#2| $ (|Integer|)) "\\spad{insert(x,u,i)} returns a copy of \\spad{u} having \\spad{x} as its \\axiom{\\spad{i}}th element. Note: \\axiom{insert(\\spad{x},{}a,{}\\spad{k}) = concat(concat(a(0..\\spad{k}-1),{}\\spad{x}),{}a(\\spad{k}..))}.")) (|delete| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{delete(u,i..j)} returns a copy of \\spad{u} with the \\axiom{\\spad{i}}th through \\axiom{\\spad{j}}th element deleted. Note: \\axiom{delete(a,{}\\spad{i}..\\spad{j}) = concat(a(0..\\spad{i}-1),{}a(\\spad{j+1}..))}.") (($ $ (|Integer|)) "\\spad{delete(u,i)} returns a copy of \\spad{u} with the \\axiom{\\spad{i}}th element deleted. Note: for lists,{} \\axiom{delete(a,{}\\spad{i}) == concat(a(0..\\spad{i} - 1),{}a(\\spad{i} + 1,{}..))}.")) (|map| (($ (|Mapping| |#2| |#2| |#2|) $ $) "\\spad{map(f,u,v)} returns a new collection \\spad{w} with elements \\axiom{\\spad{z} = \\spad{f}(\\spad{x},{}\\spad{y})} for corresponding elements \\spad{x} and \\spad{y} from \\spad{u} and \\spad{v}. Note: for linear aggregates,{} \\axiom{\\spad{w}.\\spad{i} = \\spad{f}(\\spad{u}.\\spad{i},{}\\spad{v}.\\spad{i})}.")) (|concat| (($ (|List| $)) "\\spad{concat(u)},{} where \\spad{u} is a lists of aggregates \\axiom{[a,{}\\spad{b},{}...,{}\\spad{c}]},{} returns a single aggregate consisting of the elements of \\axiom{a} followed by those of \\spad{b} followed ... by the elements of \\spad{c}. Note: \\axiom{concat(a,{}\\spad{b},{}...,{}\\spad{c}) = concat(a,{}concat(\\spad{b},{}...,{}\\spad{c}))}.") (($ $ $) "\\spad{concat(u,v)} returns an aggregate consisting of the elements of \\spad{u} followed by the elements of \\spad{v}. Note: if \\axiom{\\spad{w} = concat(\\spad{u},{}\\spad{v})} then \\axiom{\\spad{w}.\\spad{i} = \\spad{u}.\\spad{i} for \\spad{i} in indices \\spad{u}} and \\axiom{\\spad{w}.(\\spad{j} + maxIndex \\spad{u}) = \\spad{v}.\\spad{j} for \\spad{j} in indices \\spad{v}}.") (($ |#2| $) "\\spad{concat(x,u)} returns aggregate \\spad{u} with additional element at the front. Note: for lists: \\axiom{concat(\\spad{x},{}\\spad{u}) == concat([\\spad{x}],{}\\spad{u})}.") (($ $ |#2|) "\\spad{concat(u,x)} returns aggregate \\spad{u} with additional element \\spad{x} at the end. Note: for lists,{} \\axiom{concat(\\spad{u},{}\\spad{x}) == concat(\\spad{u},{}[\\spad{x}])}")) (|new| (($ (|NonNegativeInteger|) |#2|) "\\spad{new(n,x)} returns \\axiom{fill!(new \\spad{n},{}\\spad{x})}."))) NIL -((|HasAttribute| |#1| (QUOTE -4425))) -(-670 S) +((|HasAttribute| |#1| (QUOTE -4424))) +(-669 S) ((|constructor| (NIL "A linear aggregate is an aggregate whose elements are indexed by integers. Examples of linear aggregates are strings,{} lists,{} and arrays. Most of the exported operations for linear aggregates are non-destructive but are not always efficient for a particular aggregate. For example,{} \\spadfun{concat} of two lists needs only to copy its first argument,{} whereas \\spadfun{concat} of two arrays needs to copy both arguments. Most of the operations exported here apply to infinite objects (\\spadignore{e.g.} streams) as well to finite ones. For finite linear aggregates,{} see \\spadtype{FiniteLinearAggregate}.")) (|setelt| ((|#1| $ (|UniversalSegment| (|Integer|)) |#1|) "\\spad{setelt(u,i..j,x)} (also written: \\axiom{\\spad{u}(\\spad{i}..\\spad{j}) := \\spad{x}}) destructively replaces each element in the segment \\axiom{\\spad{u}(\\spad{i}..\\spad{j})} by \\spad{x}. The value \\spad{x} is returned. Note: \\spad{u} is destructively change so that \\axiom{\\spad{u}.\\spad{k} := \\spad{x} for \\spad{k} in \\spad{i}..\\spad{j}}; its length remains unchanged.")) (|insert| (($ $ $ (|Integer|)) "\\spad{insert(v,u,k)} returns a copy of \\spad{u} having \\spad{v} inserted beginning at the \\axiom{\\spad{i}}th element. Note: \\axiom{insert(\\spad{v},{}\\spad{u},{}\\spad{k}) = concat( \\spad{u}(0..\\spad{k}-1),{} \\spad{v},{} \\spad{u}(\\spad{k}..) )}.") (($ |#1| $ (|Integer|)) "\\spad{insert(x,u,i)} returns a copy of \\spad{u} having \\spad{x} as its \\axiom{\\spad{i}}th element. Note: \\axiom{insert(\\spad{x},{}a,{}\\spad{k}) = concat(concat(a(0..\\spad{k}-1),{}\\spad{x}),{}a(\\spad{k}..))}.")) (|delete| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{delete(u,i..j)} returns a copy of \\spad{u} with the \\axiom{\\spad{i}}th through \\axiom{\\spad{j}}th element deleted. Note: \\axiom{delete(a,{}\\spad{i}..\\spad{j}) = concat(a(0..\\spad{i}-1),{}a(\\spad{j+1}..))}.") (($ $ (|Integer|)) "\\spad{delete(u,i)} returns a copy of \\spad{u} with the \\axiom{\\spad{i}}th element deleted. Note: for lists,{} \\axiom{delete(a,{}\\spad{i}) == concat(a(0..\\spad{i} - 1),{}a(\\spad{i} + 1,{}..))}.")) (|map| (($ (|Mapping| |#1| |#1| |#1|) $ $) "\\spad{map(f,u,v)} returns a new collection \\spad{w} with elements \\axiom{\\spad{z} = \\spad{f}(\\spad{x},{}\\spad{y})} for corresponding elements \\spad{x} and \\spad{y} from \\spad{u} and \\spad{v}. Note: for linear aggregates,{} \\axiom{\\spad{w}.\\spad{i} = \\spad{f}(\\spad{u}.\\spad{i},{}\\spad{v}.\\spad{i})}.")) (|concat| (($ (|List| $)) "\\spad{concat(u)},{} where \\spad{u} is a lists of aggregates \\axiom{[a,{}\\spad{b},{}...,{}\\spad{c}]},{} returns a single aggregate consisting of the elements of \\axiom{a} followed by those of \\spad{b} followed ... by the elements of \\spad{c}. Note: \\axiom{concat(a,{}\\spad{b},{}...,{}\\spad{c}) = concat(a,{}concat(\\spad{b},{}...,{}\\spad{c}))}.") (($ $ $) "\\spad{concat(u,v)} returns an aggregate consisting of the elements of \\spad{u} followed by the elements of \\spad{v}. Note: if \\axiom{\\spad{w} = concat(\\spad{u},{}\\spad{v})} then \\axiom{\\spad{w}.\\spad{i} = \\spad{u}.\\spad{i} for \\spad{i} in indices \\spad{u}} and \\axiom{\\spad{w}.(\\spad{j} + maxIndex \\spad{u}) = \\spad{v}.\\spad{j} for \\spad{j} in indices \\spad{v}}.") (($ |#1| $) "\\spad{concat(x,u)} returns aggregate \\spad{u} with additional element at the front. Note: for lists: \\axiom{concat(\\spad{x},{}\\spad{u}) == concat([\\spad{x}],{}\\spad{u})}.") (($ $ |#1|) "\\spad{concat(u,x)} returns aggregate \\spad{u} with additional element \\spad{x} at the end. Note: for lists,{} \\axiom{concat(\\spad{u},{}\\spad{x}) == concat(\\spad{u},{}[\\spad{x}])}")) (|new| (($ (|NonNegativeInteger|) |#1|) "\\spad{new(n,x)} returns \\axiom{fill!(new \\spad{n},{}\\spad{x})}."))) NIL NIL -(-671 M R S) +(-670 M R S) ((|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}."))) -((-4419 . T) (-4418 . T)) -((|HasCategory| |#1| (QUOTE (-811)))) -(-672 R -3494 L) +((-4418 . T) (-4417 . T)) +((|HasCategory| |#1| (QUOTE (-810)))) +(-671 R -3493 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 -(-673 A -2887) +(-672 A -2886) ((|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}}"))) -((-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-376)))) -(-674 A) +((-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-376)))) +(-673 A) ((|constructor| (NIL "\\spad{LinearOrdinaryDifferentialOperator1} defines a ring of differential operators with coefficients in a differential ring A. Multiplication of operators corresponds to functional composition: \\indented{4}{\\spad{(L1 * L2).(f) = L1 L2 f}}"))) -((-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-376)))) -(-675 A M) +((-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-376)))) +(-674 A M) ((|constructor| (NIL "\\spad{LinearOrdinaryDifferentialOperator2} defines a ring of differential operators with coefficients in a differential ring A and acting on an A-module \\spad{M}. Multiplication of operators corresponds to functional composition: \\indented{4}{\\spad{(L1 * L2).(f) = L1 L2 f}}")) (|differentiate| (($ $) "\\spad{differentiate(x)} returns the derivative of \\spad{x}"))) -((-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-376)))) -(-676 S A) +((-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-376)))) +(-675 S A) ((|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}."))) NIL ((|HasCategory| |#2| (QUOTE (-376)))) -(-677 A) +(-676 A) ((|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}."))) -((-4418 . T) (-4419 . T) (-4421 . T)) +((-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-678 -3494 UP) +(-677 -3493 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)))) -(-679 A L) +(-678 A L) ((|constructor| (NIL "\\spad{LinearOrdinaryDifferentialOperatorsOps} provides symmetric products and sums for linear ordinary differential operators.")) (|directSum| ((|#2| |#2| |#2| (|Mapping| |#1| |#1|)) "\\spad{directSum(a,b,D)} 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}. \\spad{D} is the derivation to use.")) (|symmetricPower| ((|#2| |#2| (|NonNegativeInteger|) (|Mapping| |#1| |#1|)) "\\spad{symmetricPower(a,n,D)} 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}. \\spad{D} is the derivation to use.")) (|symmetricProduct| ((|#2| |#2| |#2| (|Mapping| |#1| |#1|)) "\\spad{symmetricProduct(a,b,D)} 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}. \\spad{D} is the derivation to use."))) NIL NIL -(-680 S) +(-679 S) ((|constructor| (NIL "`Logic' provides the basic operations for lattices,{} \\spadignore{e.g.} boolean algebra.")) (|\\/| (($ $ $) "\\spadignore{ \\/ } returns the logical `join',{} \\spadignore{e.g.} `or'.")) (|/\\| (($ $ $) "\\spadignore { /\\ }returns the logical `meet',{} \\spadignore{e.g.} `and'.")) (~ (($ $) "\\spad{~(x)} returns the logical complement of \\spad{x}."))) NIL NIL -(-681) +(-680) ((|constructor| (NIL "`Logic' provides the basic operations for lattices,{} \\spadignore{e.g.} boolean algebra.")) (|\\/| (($ $ $) "\\spadignore{ \\/ } returns the logical `join',{} \\spadignore{e.g.} `or'.")) (|/\\| (($ $ $) "\\spadignore { /\\ }returns the logical `meet',{} \\spadignore{e.g.} `and'.")) (~ (($ $) "\\spad{~(x)} returns the logical complement of \\spad{x}."))) NIL NIL -(-682 R) +(-681 R) ((|constructor| (NIL "Given a PolynomialFactorizationExplicit ring,{} this package provides a defaulting rule for the \\spad{solveLinearPolynomialEquation} operation,{} by moving into the field of fractions,{} and solving it there via the \\spad{multiEuclidean} operation.")) (|solveLinearPolynomialEquationByFractions| (((|Union| (|List| (|SparseUnivariatePolynomial| |#1|)) "failed") (|List| (|SparseUnivariatePolynomial| |#1|)) (|SparseUnivariatePolynomial| |#1|)) "\\spad{solveLinearPolynomialEquationByFractions([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 exists."))) NIL NIL -(-683 |VarSet| R) +(-682 |VarSet| R) ((|constructor| (NIL "This type supports Lie polynomials in Lyndon basis see Free Lie Algebras by \\spad{C}. Reutenauer (Oxford science publications). \\newline Author: Michel Petitot (petitot@lifl.fr).")) (|construct| (($ $ (|LyndonWord| |#1|)) "\\axiom{construct(\\spad{x},{}\\spad{y})} returns the Lie bracket \\axiom{[\\spad{x},{}\\spad{y}]}.") (($ (|LyndonWord| |#1|) $) "\\axiom{construct(\\spad{x},{}\\spad{y})} returns the Lie bracket \\axiom{[\\spad{x},{}\\spad{y}]}.") (($ (|LyndonWord| |#1|) (|LyndonWord| |#1|)) "\\axiom{construct(\\spad{x},{}\\spad{y})} returns the Lie bracket \\axiom{[\\spad{x},{}\\spad{y}]}.")) (|LiePolyIfCan| (((|Union| $ "failed") (|XDistributedPolynomial| |#1| |#2|)) "\\axiom{LiePolyIfCan(\\spad{p})} returns \\axiom{\\spad{p}} in Lyndon basis if \\axiom{\\spad{p}} is a Lie polynomial,{} otherwise \\axiom{\"failed\"} is returned."))) -((|JacobiIdentity| . T) (|NullSquare| . T) (-4419 . T) (-4418 . T)) +((|JacobiIdentity| . T) (|NullSquare| . T) (-4418 . T) (-4417 . T)) ((|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-175)))) -(-684 A S) +(-683 A S) ((|constructor| (NIL "A list aggregate is a model for a linked list data structure. A linked list is a versatile data structure. Insertion and deletion are efficient and searching is a linear operation.")) (|list| (($ |#2|) "\\spad{list(x)} returns the list of one element \\spad{x}."))) NIL NIL -(-685 S) +(-684 S) ((|constructor| (NIL "A list aggregate is a model for a linked list data structure. A linked list is a versatile data structure. Insertion and deletion are efficient and searching is a linear operation.")) (|list| (($ |#1|) "\\spad{list(x)} returns the list of one element \\spad{x}."))) -((-4425 . T) (-4424 . T)) +((-4424 . T) (-4423 . T)) NIL -(-686 -3494 |Row| |Col| M) +(-685 -3493 |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| #1="failed") |#4| |#3|) "\\spad{particularSolution(A,B)} finds a particular solution of the linear system \\spad{AX = B}.")) (|solve| (((|List| (|Record| (|:| |particular| (|Union| |#3| #1#)) (|:| |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| #1#)) (|:| |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 -(-687 -3494) +(-686 -3493) ((|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|) #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|) #1#)) (|:| |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|) #1#)) (|:| |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|) #1#)) (|:| |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|) #1#)) (|:| |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 -(-688 R E OV P) +(-687 R E OV P) ((|constructor| (NIL "this package finds the solutions of linear systems presented as a list of polynomials.")) (|linSolve| (((|Record| (|:| |particular| (|Union| (|Vector| (|Fraction| |#4|)) "failed")) (|:| |basis| (|List| (|Vector| (|Fraction| |#4|))))) (|List| |#4|) (|List| |#3|)) "\\spad{linSolve(lp,lvar)} finds the solutions of the linear system of polynomials \\spad{lp} = 0 with respect to the list of symbols \\spad{lvar}."))) NIL NIL -(-689 |n| R) +(-688 |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."))) -((-4421 . T) (-4424 . T) (-4418 . T) (-4419 . T)) -((|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#2| (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-239))) (|HasAttribute| |#2| (QUOTE (-4426 #1="*"))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))))) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-569))) (-3956 (|HasAttribute| |#2| (QUOTE (-4426 #1#))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-175)))) -(-690) +((-4420 . T) (-4423 . T) (-4417 . T) (-4418 . T)) +((|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#2| (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-239))) (|HasAttribute| |#2| (QUOTE (-4425 #1="*"))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))))) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-568))) (-3955 (|HasAttribute| |#2| (QUOTE (-4425 #1#))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-175)))) +(-689) ((|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 NIL -(-691 |VarSet|) +(-690 |VarSet|) ((|constructor| (NIL "Lyndon words over arbitrary (ordered) symbols: see Free Lie Algebras by \\spad{C}. Reutenauer (Oxford science publications). A Lyndon word is a word which is smaller than any of its right factors \\spad{w}.\\spad{r}.\\spad{t}. the pure lexicographical ordering. If \\axiom{a} and \\axiom{\\spad{b}} are two Lyndon words such that \\axiom{a < \\spad{b}} holds \\spad{w}.\\spad{r}.\\spad{t} lexicographical ordering then \\axiom{a*b} is a Lyndon word. Parenthesized Lyndon words can be generated from symbols by using the following rule: \\axiom{[[a,{}\\spad{b}],{}\\spad{c}]} is a Lyndon word iff \\axiom{a*b < \\spad{c} <= \\spad{b}} holds. Lyndon words are internally represented by binary trees using the \\spadtype{Magma} domain constructor. Two ordering are provided: lexicographic and length-lexicographic. \\newline Author : Michel Petitot (petitot@lifl.fr).")) (|LyndonWordsList| (((|List| $) (|List| |#1|) (|PositiveInteger|)) "\\axiom{LyndonWordsList(vl,{} \\spad{n})} returns the list of Lyndon words over the alphabet \\axiom{vl},{} up to order \\axiom{\\spad{n}}.")) (|LyndonWordsList1| (((|OneDimensionalArray| (|List| $)) (|List| |#1|) (|PositiveInteger|)) "\\axiom{\\spad{LyndonWordsList1}(vl,{} \\spad{n})} returns an array of lists of Lyndon words over the alphabet \\axiom{vl},{} up to order \\axiom{\\spad{n}}.")) (|varList| (((|List| |#1|) $) "\\axiom{varList(\\spad{x})} returns the list of distinct entries of \\axiom{\\spad{x}}.")) (|lyndonIfCan| (((|Union| $ "failed") (|OrderedFreeMonoid| |#1|)) "\\axiom{lyndonIfCan(\\spad{w})} convert \\axiom{\\spad{w}} into a Lyndon word.")) (|lyndon| (($ (|OrderedFreeMonoid| |#1|)) "\\axiom{lyndon(\\spad{w})} convert \\axiom{\\spad{w}} into a Lyndon word,{} error if \\axiom{\\spad{w}} is not a Lyndon word.")) (|lyndon?| (((|Boolean|) (|OrderedFreeMonoid| |#1|)) "\\axiom{lyndon?(\\spad{w})} test if \\axiom{\\spad{w}} is a Lyndon word.")) (|factor| (((|List| $) (|OrderedFreeMonoid| |#1|)) "\\axiom{factor(\\spad{x})} returns the decreasing factorization into Lyndon words.")) (|coerce| (((|Magma| |#1|) $) "\\axiom{coerce(\\spad{x})} returns the element of \\axiomType{Magma}(VarSet) corresponding to \\axiom{\\spad{x}}.") (((|OrderedFreeMonoid| |#1|) $) "\\axiom{coerce(\\spad{x})} returns the element of \\axiomType{OrderedFreeMonoid}(VarSet) corresponding to \\axiom{\\spad{x}}.")) (|lexico| (((|Boolean|) $ $) "\\axiom{lexico(\\spad{x},{}\\spad{y})} returns \\axiom{\\spad{true}} iff \\axiom{\\spad{x}} is smaller than \\axiom{\\spad{y}} \\spad{w}.\\spad{r}.\\spad{t}. the lexicographical ordering induced by \\axiom{VarSet}.")) (|length| (((|PositiveInteger|) $) "\\axiom{length(\\spad{x})} returns the number of entries in \\axiom{\\spad{x}}.")) (|right| (($ $) "\\axiom{right(\\spad{x})} returns right subtree of \\axiom{\\spad{x}} or error if \\axiomOpFrom{retractable?}{LyndonWord}(\\axiom{\\spad{x}}) is \\spad{true}.")) (|left| (($ $) "\\axiom{left(\\spad{x})} returns left subtree of \\axiom{\\spad{x}} or error if \\axiomOpFrom{retractable?}{LyndonWord}(\\axiom{\\spad{x}}) is \\spad{true}.")) (|retractable?| (((|Boolean|) $) "\\axiom{retractable?(\\spad{x})} tests if \\axiom{\\spad{x}} is a tree with only one entry."))) NIL NIL -(-692 A S) +(-691 A S) ((|constructor| (NIL "LazyStreamAggregate is the category of streams with lazy evaluation. It is understood that the function 'empty?' will cause lazy evaluation if necessary to determine if there are entries. Functions which call 'empty?',{} \\spadignore{e.g.} 'first' and 'rest',{} will also cause lazy evaluation if necessary.")) (|complete| (($ $) "\\spad{complete(st)} causes all entries of 'st' to be computed. this function should only be called on streams which are known to be finite.")) (|extend| (($ $ (|Integer|)) "\\spad{extend(st,n)} causes entries to be computed,{} if necessary,{} so that 'st' will have at least 'n' explicit entries or so that all entries of 'st' will be computed if 'st' is finite with length <= \\spad{n}.")) (|numberOfComputedEntries| (((|NonNegativeInteger|) $) "\\spad{numberOfComputedEntries(st)} returns the number of explicitly computed entries of stream \\spad{st} which exist immediately prior to the time this function is called.")) (|rst| (($ $) "\\spad{rst(s)} returns a pointer to the next node of stream \\spad{s}. Caution: this function should only be called after a \\spad{empty?} test has been made since there no error check.")) (|frst| ((|#2| $) "\\spad{frst(s)} returns the first element of stream \\spad{s}. Caution: this function should only be called after a \\spad{empty?} test has been made since there no error check.")) (|lazyEvaluate| (($ $) "\\spad{lazyEvaluate(s)} causes one lazy evaluation of stream \\spad{s}. Caution: the first node must be a lazy evaluation mechanism (satisfies \\spad{lazy?(s) = true}) as there is no error check. Note: a call to this function may or may not produce an explicit first entry")) (|lazy?| (((|Boolean|) $) "\\spad{lazy?(s)} returns \\spad{true} if the first node of the stream \\spad{s} is a lazy evaluation mechanism which could produce an additional entry to \\spad{s}.")) (|explicitlyEmpty?| (((|Boolean|) $) "\\spad{explicitlyEmpty?(s)} returns \\spad{true} if the stream is an (explicitly) empty stream. Note: this is a null test which will not cause lazy evaluation.")) (|explicitEntries?| (((|Boolean|) $) "\\spad{explicitEntries?(s)} returns \\spad{true} if the stream \\spad{s} has explicitly computed entries,{} and \\spad{false} otherwise.")) (|select| (($ (|Mapping| (|Boolean|) |#2|) $) "\\spad{select(f,st)} returns a stream consisting of those elements of stream \\spad{st} satisfying the predicate \\spad{f}. Note: \\spad{select(f,st) = [x for x in st | f(x)]}.")) (|remove| (($ (|Mapping| (|Boolean|) |#2|) $) "\\spad{remove(f,st)} returns a stream consisting of those elements of stream \\spad{st} which do not satisfy the predicate \\spad{f}. Note: \\spad{remove(f,st) = [x for x in st | not f(x)]}."))) NIL NIL -(-693 S) +(-692 S) ((|constructor| (NIL "LazyStreamAggregate is the category of streams with lazy evaluation. It is understood that the function 'empty?' will cause lazy evaluation if necessary to determine if there are entries. Functions which call 'empty?',{} \\spadignore{e.g.} 'first' and 'rest',{} will also cause lazy evaluation if necessary.")) (|complete| (($ $) "\\spad{complete(st)} causes all entries of 'st' to be computed. this function should only be called on streams which are known to be finite.")) (|extend| (($ $ (|Integer|)) "\\spad{extend(st,n)} causes entries to be computed,{} if necessary,{} so that 'st' will have at least 'n' explicit entries or so that all entries of 'st' will be computed if 'st' is finite with length <= \\spad{n}.")) (|numberOfComputedEntries| (((|NonNegativeInteger|) $) "\\spad{numberOfComputedEntries(st)} returns the number of explicitly computed entries of stream \\spad{st} which exist immediately prior to the time this function is called.")) (|rst| (($ $) "\\spad{rst(s)} returns a pointer to the next node of stream \\spad{s}. Caution: this function should only be called after a \\spad{empty?} test has been made since there no error check.")) (|frst| ((|#1| $) "\\spad{frst(s)} returns the first element of stream \\spad{s}. Caution: this function should only be called after a \\spad{empty?} test has been made since there no error check.")) (|lazyEvaluate| (($ $) "\\spad{lazyEvaluate(s)} causes one lazy evaluation of stream \\spad{s}. Caution: the first node must be a lazy evaluation mechanism (satisfies \\spad{lazy?(s) = true}) as there is no error check. Note: a call to this function may or may not produce an explicit first entry")) (|lazy?| (((|Boolean|) $) "\\spad{lazy?(s)} returns \\spad{true} if the first node of the stream \\spad{s} is a lazy evaluation mechanism which could produce an additional entry to \\spad{s}.")) (|explicitlyEmpty?| (((|Boolean|) $) "\\spad{explicitlyEmpty?(s)} returns \\spad{true} if the stream is an (explicitly) empty stream. Note: this is a null test which will not cause lazy evaluation.")) (|explicitEntries?| (((|Boolean|) $) "\\spad{explicitEntries?(s)} returns \\spad{true} if the stream \\spad{s} has explicitly computed entries,{} and \\spad{false} otherwise.")) (|select| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{select(f,st)} returns a stream consisting of those elements of stream \\spad{st} satisfying the predicate \\spad{f}. Note: \\spad{select(f,st) = [x for x in st | f(x)]}.")) (|remove| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{remove(f,st)} returns a stream consisting of those elements of stream \\spad{st} which do not satisfy the predicate \\spad{f}. Note: \\spad{remove(f,st) = [x for x in st | not f(x)]}."))) NIL NIL -(-694 R) +(-693 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 -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-1069))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (QUOTE (-1069))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) -(-695) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +(-694) ((|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 NIL -(-696 |VarSet|) +(-695 |VarSet|) ((|constructor| (NIL "This type is the basic representation of parenthesized words (binary trees over arbitrary symbols) useful in \\spadtype{LiePolynomial}. \\newline Author: Michel Petitot (petitot@lifl.fr).")) (|varList| (((|List| |#1|) $) "\\axiom{varList(\\spad{x})} returns the list of distinct entries of \\axiom{\\spad{x}}.")) (|right| (($ $) "\\axiom{right(\\spad{x})} returns right subtree of \\axiom{\\spad{x}} or error if \\axiomOpFrom{retractable?}{Magma}(\\axiom{\\spad{x}}) is \\spad{true}.")) (|retractable?| (((|Boolean|) $) "\\axiom{retractable?(\\spad{x})} tests if \\axiom{\\spad{x}} is a tree with only one entry.")) (|rest| (($ $) "\\axiom{rest(\\spad{x})} return \\axiom{\\spad{x}} without the first entry or error if \\axiomOpFrom{retractable?}{Magma}(\\axiom{\\spad{x}}) is \\spad{true}.")) (|mirror| (($ $) "\\axiom{mirror(\\spad{x})} returns the reversed word of \\axiom{\\spad{x}}. That is \\axiom{\\spad{x}} itself if \\axiomOpFrom{retractable?}{Magma}(\\axiom{\\spad{x}}) is \\spad{true} and \\axiom{mirror(\\spad{z}) * mirror(\\spad{y})} if \\axiom{\\spad{x}} is \\axiom{y*z}.")) (|lexico| (((|Boolean|) $ $) "\\axiom{lexico(\\spad{x},{}\\spad{y})} returns \\axiom{\\spad{true}} iff \\axiom{\\spad{x}} is smaller than \\axiom{\\spad{y}} \\spad{w}.\\spad{r}.\\spad{t}. the lexicographical ordering induced by \\axiom{VarSet}. \\spad{N}.\\spad{B}. This operation does not take into account the tree structure of its arguments. Thus this is not a total ordering.")) (|length| (((|PositiveInteger|) $) "\\axiom{length(\\spad{x})} returns the number of entries in \\axiom{\\spad{x}}.")) (|left| (($ $) "\\axiom{left(\\spad{x})} returns left subtree of \\axiom{\\spad{x}} or error if \\axiomOpFrom{retractable?}{Magma}(\\axiom{\\spad{x}}) is \\spad{true}.")) (|first| ((|#1| $) "\\axiom{first(\\spad{x})} returns the first entry of the tree \\axiom{\\spad{x}}.")) (|coerce| (((|OrderedFreeMonoid| |#1|) $) "\\axiom{coerce(\\spad{x})} returns the element of \\axiomType{OrderedFreeMonoid}(VarSet) corresponding to \\axiom{\\spad{x}} by removing parentheses.")) (* (($ $ $) "\\axiom{x*y} returns the tree \\axiom{[\\spad{x},{}\\spad{y}]}."))) NIL NIL -(-697 A) +(-696 A) ((|constructor| (NIL "various Currying operations.")) (|recur| ((|#1| (|Mapping| |#1| (|NonNegativeInteger|) |#1|) (|NonNegativeInteger|) |#1|) "\\spad{recur(n,g,x)} is \\spad{g(n,g(n-1,..g(1,x)..))}.")) (|iter| ((|#1| (|Mapping| |#1| |#1|) (|NonNegativeInteger|) |#1|) "\\spad{iter(f,n,x)} applies \\spad{f n} times to \\spad{x}."))) NIL NIL -(-698 A C) +(-697 A C) ((|constructor| (NIL "various Currying operations.")) (|arg2| ((|#2| |#1| |#2|) "\\spad{arg2(a,c)} selects its second argument.")) (|arg1| ((|#1| |#1| |#2|) "\\spad{arg1(a,c)} selects its first argument."))) NIL NIL -(-699 A B C) +(-698 A B C) ((|constructor| (NIL "various Currying operations.")) (|comp| ((|#3| (|Mapping| |#3| |#2|) (|Mapping| |#2| |#1|) |#1|) "\\spad{comp(f,g,x)} is \\spad{f(g x)}."))) NIL NIL -(-700) +(-699) ((|constructor| (NIL "This domain represents a mapping type AST. A mapping AST \\indented{2}{is a syntactic description of a function type,{} \\spadignore{e.g.} its result} \\indented{2}{type and the list of its argument types.}")) (|target| (((|TypeAst|) $) "\\spad{target(s)} returns the result type AST for `s'.")) (|source| (((|List| (|TypeAst|)) $) "\\spad{source(s)} returns the parameter type AST list of `s'.")) (|mappingAst| (($ (|List| (|TypeAst|)) (|TypeAst|)) "\\spad{mappingAst(s,t)} builds the mapping AST \\spad{s} -> \\spad{t}")) (|coerce| (($ (|Signature|)) "sig::MappingAst builds a MappingAst from the Signature `sig'."))) NIL NIL -(-701 A) +(-700 A) ((|constructor| (NIL "various Currying operations.")) (|recur| (((|Mapping| |#1| (|NonNegativeInteger|) |#1|) (|Mapping| |#1| (|NonNegativeInteger|) |#1|)) "\\spad{recur(g)} is the function \\spad{h} such that \\indented{1}{\\spad{h(n,x)= g(n,g(n-1,..g(1,x)..))}.}")) (** (((|Mapping| |#1| |#1|) (|Mapping| |#1| |#1|) (|NonNegativeInteger|)) "\\spad{f**n} is the function which is the \\spad{n}-fold application \\indented{1}{of \\spad{f}.}")) (|id| ((|#1| |#1|) "\\spad{id x} is \\spad{x}.")) (|fixedPoint| (((|List| |#1|) (|Mapping| (|List| |#1|) (|List| |#1|)) (|Integer|)) "\\spad{fixedPoint(f,n)} is the fixed point of function \\indented{1}{\\spad{f} which is assumed to transform a list of length} \\indented{1}{\\spad{n}.}") ((|#1| (|Mapping| |#1| |#1|)) "\\spad{fixedPoint f} is the fixed point of function \\spad{f}. \\indented{1}{\\spadignore{i.e.} such that \\spad{fixedPoint f = f(fixedPoint f)}.}")) (|coerce| (((|Mapping| |#1|) |#1|) "\\spad{coerce A} changes its argument into a \\indented{1}{nullary function.}")) (|nullary| (((|Mapping| |#1|) |#1|) "\\spad{nullary A} changes its argument into a \\indented{1}{nullary function.}"))) NIL NIL -(-702 A C) +(-701 A C) ((|constructor| (NIL "various Currying operations.")) (|diag| (((|Mapping| |#2| |#1|) (|Mapping| |#2| |#1| |#1|)) "\\spad{diag(f)} is the function \\spad{g} \\indented{1}{such that \\spad{g a = f(a,a)}.}")) (|constant| (((|Mapping| |#2| |#1|) (|Mapping| |#2|)) "\\spad{vu(f)} is the function \\spad{g} \\indented{1}{such that \\spad{g a= f ()}.}")) (|curry| (((|Mapping| |#2|) (|Mapping| |#2| |#1|) |#1|) "\\spad{cu(f,a)} is the function \\spad{g} \\indented{1}{such that \\spad{g ()= f a}.}")) (|const| (((|Mapping| |#2| |#1|) |#2|) "\\spad{const c} is a function which produces \\spad{c} when \\indented{1}{applied to its argument.}"))) NIL NIL -(-703 A B C) +(-702 A B C) ((|constructor| (NIL "various Currying operations.")) (* (((|Mapping| |#3| |#1|) (|Mapping| |#3| |#2|) (|Mapping| |#2| |#1|)) "\\spad{f*g} is the function \\spad{h} \\indented{1}{such that \\spad{h x= f(g x)}.}")) (|twist| (((|Mapping| |#3| |#2| |#1|) (|Mapping| |#3| |#1| |#2|)) "\\spad{twist(f)} is the function \\spad{g} \\indented{1}{such that \\spad{g (a,b)= f(b,a)}.}")) (|constantLeft| (((|Mapping| |#3| |#1| |#2|) (|Mapping| |#3| |#2|)) "\\spad{constantLeft(f)} is the function \\spad{g} \\indented{1}{such that \\spad{g (a,b)= f b}.}")) (|constantRight| (((|Mapping| |#3| |#1| |#2|) (|Mapping| |#3| |#1|)) "\\spad{constantRight(f)} is the function \\spad{g} \\indented{1}{such that \\spad{g (a,b)= f a}.}")) (|curryLeft| (((|Mapping| |#3| |#2|) (|Mapping| |#3| |#1| |#2|) |#1|) "\\spad{curryLeft(f,a)} is the function \\spad{g} \\indented{1}{such that \\spad{g b = f(a,b)}.}")) (|curryRight| (((|Mapping| |#3| |#1|) (|Mapping| |#3| |#1| |#2|) |#2|) "\\spad{curryRight(f,b)} is the function \\spad{g} such that \\indented{1}{\\spad{g a = f(a,b)}.}"))) NIL NIL -(-704 S R |Row| |Col|) +(-703 S R |Row| |Col|) ((|constructor| (NIL "\\spadtype{MatrixCategory} is a general matrix category which allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and colums returned as objects of type Col. A domain belonging to this category will be shallowly mutable. The index of the 'first' row may be obtained by calling the function \\spadfun{minRowIndex}. The index of the 'first' column may be obtained by calling the function \\spadfun{minColIndex}. The index of the first element of a Row is the same as the index of the first column in a matrix and vice versa.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m}. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|minordet| ((|#2| $) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors. Error: if the matrix is not square.")) (|determinant| ((|#2| $) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}. Error: if the matrix is not square.")) (|nullSpace| (((|List| |#4|) $) "\\spad{nullSpace(m)} returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) $) "\\spad{nullity(m)} returns the nullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|rowEchelon| (($ $) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}.")) (/ (($ $ |#2|) "\\spad{m/r} divides the elements of \\spad{m} by \\spad{r}. Error: if \\spad{r = 0}.")) (|exquo| (((|Union| $ "failed") $ |#2|) "\\spad{exquo(m,r)} computes the exact quotient of the elements of \\spad{m} by \\spad{r},{} returning \\axiom{\"failed\"} if this is not possible.")) (** (($ $ (|Integer|)) "\\spad{m**n} computes an integral power of the matrix \\spad{m}. Error: if matrix is not square or if the matrix is square but not invertible.") (($ $ (|NonNegativeInteger|)) "\\spad{x ** n} computes a non-negative integral power of the matrix \\spad{x}. Error: if the matrix is not square.")) (* ((|#3| |#3| $) "\\spad{r * x} is the product of the row vector \\spad{r} and the matrix \\spad{x}. Error: if the dimensions are incompatible.") ((|#4| $ |#4|) "\\spad{x * c} is the product of the matrix \\spad{x} and the column vector \\spad{c}. Error: if the dimensions are incompatible.") (($ (|Integer|) $) "\\spad{n * x} is an integer multiple.") (($ $ |#2|) "\\spad{x * r} is the right scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ |#2| $) "\\spad{r*x} is the left scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ $ $) "\\spad{x * y} is the product of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (- (($ $) "\\spad{-x} returns the negative of the matrix \\spad{x}.") (($ $ $) "\\spad{x - y} is the difference of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (+ (($ $ $) "\\spad{x + y} is the sum of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (|setsubMatrix!| (($ $ (|Integer|) (|Integer|) $) "\\spad{setsubMatrix(x,i1,j1,y)} destructively alters the matrix \\spad{x}. Here \\spad{x(i,j)} is set to \\spad{y(i-i1+1,j-j1+1)} for \\spad{i = i1,...,i1-1+nrows y} and \\spad{j = j1,...,j1-1+ncols y}.")) (|subMatrix| (($ $ (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{subMatrix(x,i1,i2,j1,j2)} extracts the submatrix \\spad{[x(i,j)]} where the index \\spad{i} ranges from \\spad{i1} to \\spad{i2} and the index \\spad{j} ranges from \\spad{j1} to \\spad{j2}.")) (|swapColumns!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapColumns!(m,i,j)} interchanges the \\spad{i}th and \\spad{j}th columns of \\spad{m}. This destructively alters the matrix.")) (|swapRows!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapRows!(m,i,j)} interchanges the \\spad{i}th and \\spad{j}th rows of \\spad{m}. This destructively alters the matrix.")) (|setelt| (($ $ (|List| (|Integer|)) (|List| (|Integer|)) $) "\\spad{setelt(x,rowList,colList,y)} destructively alters the matrix \\spad{x}. If \\spad{y} is \\spad{m}-by-\\spad{n},{} \\spad{rowList = [i<1>,i<2>,...,i<m>]} and \\spad{colList = [j<1>,j<2>,...,j<n>]},{} then \\spad{x(i<k>,j<l>)} is set to \\spad{y(k,l)} for \\spad{k = 1,...,m} and \\spad{l = 1,...,n}.")) (|elt| (($ $ (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{elt(x,rowList,colList)} returns an \\spad{m}-by-\\spad{n} matrix consisting of elements of \\spad{x},{} where \\spad{m = \\# rowList} and \\spad{n = \\# colList}. If \\spad{rowList = [i<1>,i<2>,...,i<m>]} and \\spad{colList = [j<1>,j<2>,...,j<n>]},{} then the \\spad{(k,l)}th entry of \\spad{elt(x,rowList,colList)} is \\spad{x(i<k>,j<l>)}.")) (|listOfLists| (((|List| (|List| |#2|)) $) "\\spad{listOfLists(m)} returns the rows of the matrix \\spad{m} as a list of lists.")) (|vertConcat| (($ $ $) "\\spad{vertConcat(x,y)} vertically concatenates two matrices with an equal number of columns. The entries of \\spad{y} appear below of the entries of \\spad{x}. Error: if the matrices do not have the same number of columns.")) (|horizConcat| (($ $ $) "\\spad{horizConcat(x,y)} horizontally concatenates two matrices with an equal number of rows. The entries of \\spad{y} appear to the right of the entries of \\spad{x}. Error: if the matrices do not have the same number of rows.")) (|squareTop| (($ $) "\\spad{squareTop(m)} returns an \\spad{n}-by-\\spad{n} matrix consisting of the first \\spad{n} rows of the \\spad{m}-by-\\spad{n} matrix \\spad{m}. Error: if \\spad{m < n}.")) (|transpose| (($ $) "\\spad{transpose(m)} returns the transpose of the matrix \\spad{m}.") (($ |#3|) "\\spad{transpose(r)} converts the row \\spad{r} to a row matrix.")) (|coerce| (($ |#4|) "\\spad{coerce(col)} converts the column \\spad{col} to a column matrix.")) (|diagonalMatrix| (($ (|List| $)) "\\spad{diagonalMatrix([m1,...,mk])} creates a block diagonal matrix \\spad{M} with block matrices {\\em m1},{}...,{}{\\em mk} down the diagonal,{} with 0 block matrices elsewhere. More precisly: if \\spad{ri := nrows mi},{} \\spad{ci := ncols mi},{} then \\spad{m} is an (r1+..+rk) by (c1+..+ck) - matrix with entries \\spad{m.i.j = ml.(i-r1-..-r(l-1)).(j-n1-..-n(l-1))},{} if \\spad{(r1+..+r(l-1)) < i <= r1+..+rl} and \\spad{(c1+..+c(l-1)) < i <= c1+..+cl},{} \\spad{m.i.j} = 0 otherwise.") (($ (|List| |#2|)) "\\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \\spad{l} on the diagonal.")) (|scalarMatrix| (($ (|NonNegativeInteger|) |#2|) "\\spad{scalarMatrix(n,r)} returns an \\spad{n}-by-\\spad{n} matrix with \\spad{r}'s on the diagonal and zeroes elsewhere.")) (|matrix| (($ (|NonNegativeInteger|) (|NonNegativeInteger|) (|Mapping| |#2| (|Integer|) (|Integer|))) "\\spad{matrix(n,m,f)} construcys and \\spad{n * m} matrix with the \\spad{(i,j)} entry equal to \\spad{f(i,j)}.") (($ (|List| (|List| |#2|))) "\\spad{matrix(l)} converts the list of lists \\spad{l} to a matrix,{} where the list of lists is viewed as a list of the rows of the matrix.")) (|zero| (($ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{zero(m,n)} returns an \\spad{m}-by-\\spad{n} zero matrix.")) (|antisymmetric?| (((|Boolean|) $) "\\spad{antisymmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and antisymmetric (\\spadignore{i.e.} \\spad{m[i,j] = -m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|symmetric?| (((|Boolean|) $) "\\spad{symmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and symmetric (\\spadignore{i.e.} \\spad{m[i,j] = m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|diagonal?| (((|Boolean|) $) "\\spad{diagonal?(m)} returns \\spad{true} if the matrix \\spad{m} is square and diagonal (\\spadignore{i.e.} all entries of \\spad{m} not on the diagonal are zero) and \\spad{false} otherwise.")) (|square?| (((|Boolean|) $) "\\spad{square?(m)} returns \\spad{true} if \\spad{m} is a square matrix (\\spadignore{i.e.} if \\spad{m} has the same number of rows as columns) and \\spad{false} otherwise.")) (|finiteAggregate| ((|attribute|) "matrices are finite")) (|shallowlyMutable| ((|attribute|) "One may destructively alter matrices"))) NIL -((|HasAttribute| |#2| (QUOTE (-4426 "*"))) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-569)))) -(-705 R |Row| |Col|) +((|HasAttribute| |#2| (QUOTE (-4425 "*"))) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-568)))) +(-704 R |Row| |Col|) ((|constructor| (NIL "\\spadtype{MatrixCategory} is a general matrix category which allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and colums returned as objects of type Col. A domain belonging to this category will be shallowly mutable. The index of the 'first' row may be obtained by calling the function \\spadfun{minRowIndex}. The index of the 'first' column may be obtained by calling the function \\spadfun{minColIndex}. The index of the first element of a Row is the same as the index of the first column in a matrix and vice versa.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m}. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|minordet| ((|#1| $) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors. Error: if the matrix is not square.")) (|determinant| ((|#1| $) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}. Error: if the matrix is not square.")) (|nullSpace| (((|List| |#3|) $) "\\spad{nullSpace(m)} returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) $) "\\spad{nullity(m)} returns the nullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|rowEchelon| (($ $) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}.")) (/ (($ $ |#1|) "\\spad{m/r} divides the elements of \\spad{m} by \\spad{r}. Error: if \\spad{r = 0}.")) (|exquo| (((|Union| $ "failed") $ |#1|) "\\spad{exquo(m,r)} computes the exact quotient of the elements of \\spad{m} by \\spad{r},{} returning \\axiom{\"failed\"} if this is not possible.")) (** (($ $ (|Integer|)) "\\spad{m**n} computes an integral power of the matrix \\spad{m}. Error: if matrix is not square or if the matrix is square but not invertible.") (($ $ (|NonNegativeInteger|)) "\\spad{x ** n} computes a non-negative integral power of the matrix \\spad{x}. Error: if the matrix is not square.")) (* ((|#2| |#2| $) "\\spad{r * x} is the product of the row vector \\spad{r} and the matrix \\spad{x}. Error: if the dimensions are incompatible.") ((|#3| $ |#3|) "\\spad{x * c} is the product of the matrix \\spad{x} and the column vector \\spad{c}. Error: if the dimensions are incompatible.") (($ (|Integer|) $) "\\spad{n * x} is an integer multiple.") (($ $ |#1|) "\\spad{x * r} is the right scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ |#1| $) "\\spad{r*x} is the left scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ $ $) "\\spad{x * y} is the product of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (- (($ $) "\\spad{-x} returns the negative of the matrix \\spad{x}.") (($ $ $) "\\spad{x - y} is the difference of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (+ (($ $ $) "\\spad{x + y} is the sum of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (|setsubMatrix!| (($ $ (|Integer|) (|Integer|) $) "\\spad{setsubMatrix(x,i1,j1,y)} destructively alters the matrix \\spad{x}. Here \\spad{x(i,j)} is set to \\spad{y(i-i1+1,j-j1+1)} for \\spad{i = i1,...,i1-1+nrows y} and \\spad{j = j1,...,j1-1+ncols y}.")) (|subMatrix| (($ $ (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{subMatrix(x,i1,i2,j1,j2)} extracts the submatrix \\spad{[x(i,j)]} where the index \\spad{i} ranges from \\spad{i1} to \\spad{i2} and the index \\spad{j} ranges from \\spad{j1} to \\spad{j2}.")) (|swapColumns!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapColumns!(m,i,j)} interchanges the \\spad{i}th and \\spad{j}th columns of \\spad{m}. This destructively alters the matrix.")) (|swapRows!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapRows!(m,i,j)} interchanges the \\spad{i}th and \\spad{j}th rows of \\spad{m}. This destructively alters the matrix.")) (|setelt| (($ $ (|List| (|Integer|)) (|List| (|Integer|)) $) "\\spad{setelt(x,rowList,colList,y)} destructively alters the matrix \\spad{x}. If \\spad{y} is \\spad{m}-by-\\spad{n},{} \\spad{rowList = [i<1>,i<2>,...,i<m>]} and \\spad{colList = [j<1>,j<2>,...,j<n>]},{} then \\spad{x(i<k>,j<l>)} is set to \\spad{y(k,l)} for \\spad{k = 1,...,m} and \\spad{l = 1,...,n}.")) (|elt| (($ $ (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{elt(x,rowList,colList)} returns an \\spad{m}-by-\\spad{n} matrix consisting of elements of \\spad{x},{} where \\spad{m = \\# rowList} and \\spad{n = \\# colList}. If \\spad{rowList = [i<1>,i<2>,...,i<m>]} and \\spad{colList = [j<1>,j<2>,...,j<n>]},{} then the \\spad{(k,l)}th entry of \\spad{elt(x,rowList,colList)} is \\spad{x(i<k>,j<l>)}.")) (|listOfLists| (((|List| (|List| |#1|)) $) "\\spad{listOfLists(m)} returns the rows of the matrix \\spad{m} as a list of lists.")) (|vertConcat| (($ $ $) "\\spad{vertConcat(x,y)} vertically concatenates two matrices with an equal number of columns. The entries of \\spad{y} appear below of the entries of \\spad{x}. Error: if the matrices do not have the same number of columns.")) (|horizConcat| (($ $ $) "\\spad{horizConcat(x,y)} horizontally concatenates two matrices with an equal number of rows. The entries of \\spad{y} appear to the right of the entries of \\spad{x}. Error: if the matrices do not have the same number of rows.")) (|squareTop| (($ $) "\\spad{squareTop(m)} returns an \\spad{n}-by-\\spad{n} matrix consisting of the first \\spad{n} rows of the \\spad{m}-by-\\spad{n} matrix \\spad{m}. Error: if \\spad{m < n}.")) (|transpose| (($ $) "\\spad{transpose(m)} returns the transpose of the matrix \\spad{m}.") (($ |#2|) "\\spad{transpose(r)} converts the row \\spad{r} to a row matrix.")) (|coerce| (($ |#3|) "\\spad{coerce(col)} converts the column \\spad{col} to a column matrix.")) (|diagonalMatrix| (($ (|List| $)) "\\spad{diagonalMatrix([m1,...,mk])} creates a block diagonal matrix \\spad{M} with block matrices {\\em m1},{}...,{}{\\em mk} down the diagonal,{} with 0 block matrices elsewhere. More precisly: if \\spad{ri := nrows mi},{} \\spad{ci := ncols mi},{} then \\spad{m} is an (r1+..+rk) by (c1+..+ck) - matrix with entries \\spad{m.i.j = ml.(i-r1-..-r(l-1)).(j-n1-..-n(l-1))},{} if \\spad{(r1+..+r(l-1)) < i <= r1+..+rl} and \\spad{(c1+..+c(l-1)) < i <= c1+..+cl},{} \\spad{m.i.j} = 0 otherwise.") (($ (|List| |#1|)) "\\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \\spad{l} on the diagonal.")) (|scalarMatrix| (($ (|NonNegativeInteger|) |#1|) "\\spad{scalarMatrix(n,r)} returns an \\spad{n}-by-\\spad{n} matrix with \\spad{r}'s on the diagonal and zeroes elsewhere.")) (|matrix| (($ (|NonNegativeInteger|) (|NonNegativeInteger|) (|Mapping| |#1| (|Integer|) (|Integer|))) "\\spad{matrix(n,m,f)} construcys and \\spad{n * m} matrix with the \\spad{(i,j)} entry equal to \\spad{f(i,j)}.") (($ (|List| (|List| |#1|))) "\\spad{matrix(l)} converts the list of lists \\spad{l} to a matrix,{} where the list of lists is viewed as a list of the rows of the matrix.")) (|zero| (($ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{zero(m,n)} returns an \\spad{m}-by-\\spad{n} zero matrix.")) (|antisymmetric?| (((|Boolean|) $) "\\spad{antisymmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and antisymmetric (\\spadignore{i.e.} \\spad{m[i,j] = -m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|symmetric?| (((|Boolean|) $) "\\spad{symmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and symmetric (\\spadignore{i.e.} \\spad{m[i,j] = m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|diagonal?| (((|Boolean|) $) "\\spad{diagonal?(m)} returns \\spad{true} if the matrix \\spad{m} is square and diagonal (\\spadignore{i.e.} all entries of \\spad{m} not on the diagonal are zero) and \\spad{false} otherwise.")) (|square?| (((|Boolean|) $) "\\spad{square?(m)} returns \\spad{true} if \\spad{m} is a square matrix (\\spadignore{i.e.} if \\spad{m} has the same number of rows as columns) and \\spad{false} otherwise.")) (|finiteAggregate| ((|attribute|) "matrices are finite")) (|shallowlyMutable| ((|attribute|) "One may destructively alter matrices"))) -((-4424 . T) (-4425 . T)) +((-4423 . T) (-4424 . T)) NIL -(-706 R1 |Row1| |Col1| M1 R2 |Row2| |Col2| M2) +(-705 R1 |Row1| |Col1| M1 R2 |Row2| |Col2| M2) ((|constructor| (NIL "\\spadtype{MatrixCategoryFunctions2} provides functions between two matrix domains. The functions provided are \\spadfun{map} and \\spadfun{reduce}.")) (|reduce| ((|#5| (|Mapping| |#5| |#1| |#5|) |#4| |#5|) "\\spad{reduce(f,m,r)} returns a matrix \\spad{n} where \\spad{n[i,j] = f(m[i,j],r)} for all indices \\spad{i} and \\spad{j}.")) (|map| (((|Union| |#8| "failed") (|Mapping| (|Union| |#5| "failed") |#1|) |#4|) "\\spad{map(f,m)} applies the function \\spad{f} to the elements of the matrix \\spad{m}.") ((|#8| (|Mapping| |#5| |#1|) |#4|) "\\spad{map(f,m)} applies the function \\spad{f} to the elements of the matrix \\spad{m}."))) NIL NIL -(-707 R |Row| |Col| M) +(-706 R |Row| |Col| M) ((|constructor| (NIL "\\spadtype{MatrixLinearAlgebraFunctions} provides functions to compute inverses and canonical forms.")) (|inverse| (((|Union| |#4| "failed") |#4|) "\\spad{inverse(m)} returns the inverse of the matrix. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|normalizedDivide| (((|Record| (|:| |quotient| |#1|) (|:| |remainder| |#1|)) |#1| |#1|) "\\spad{normalizedDivide(n,d)} returns a normalized quotient and remainder such that consistently unique representatives for the residue class are chosen,{} \\spadignore{e.g.} positive remainders")) (|rowEchelon| ((|#4| |#4|) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}.")) (|adjoint| (((|Record| (|:| |adjMat| |#4|) (|:| |detMat| |#1|)) |#4|) "\\spad{adjoint(m)} returns the ajoint matrix of \\spad{m} (\\spadignore{i.e.} the matrix \\spad{n} such that m*n = determinant(\\spad{m})*id) and the detrminant of \\spad{m}.")) (|invertIfCan| (((|Union| |#4| "failed") |#4|) "\\spad{invertIfCan(m)} returns the inverse of \\spad{m} over \\spad{R}")) (|fractionFreeGauss!| ((|#4| |#4|) "\\spad{fractionFreeGauss(m)} performs the fraction free gaussian elimination on the matrix \\spad{m}.")) (|nullSpace| (((|List| |#3|) |#4|) "\\spad{nullSpace(m)} returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) |#4|) "\\spad{nullity(m)} returns the mullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) |#4|) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|elColumn2!| ((|#4| |#4| |#1| (|Integer|) (|Integer|)) "\\spad{elColumn2!(m,a,i,j)} adds to column \\spad{i} a*column(\\spad{m},{}\\spad{j}) : elementary operation of second kind. (\\spad{i} ~=j)")) (|elRow2!| ((|#4| |#4| |#1| (|Integer|) (|Integer|)) "\\spad{elRow2!(m,a,i,j)} adds to row \\spad{i} a*row(\\spad{m},{}\\spad{j}) : elementary operation of second kind. (\\spad{i} ~=j)")) (|elRow1!| ((|#4| |#4| (|Integer|) (|Integer|)) "\\spad{elRow1!(m,i,j)} swaps rows \\spad{i} and \\spad{j} of matrix \\spad{m} : elementary operation of first kind")) (|minordet| ((|#1| |#4|) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors. Error: if the matrix is not square.")) (|determinant| ((|#1| |#4|) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}. an error message is returned if the matrix is not square."))) NIL -((|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-569)))) -(-708 R) +((|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-568)))) +(-707 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."))) -((-4424 . T) (-4425 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-569))) (|HasAttribute| |#1| (QUOTE (-4426 "*"))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) -(-709 R) +((-4423 . T) (-4424 . T)) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-568))) (|HasAttribute| |#1| (QUOTE (-4425 "*"))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +(-708 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 NIL -(-710 T$) +(-709 T$) ((|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 -(-711 S -3494 FLAF FLAS) +(-710 S -3493 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 -(-712 R Q) +(-711 R Q) ((|constructor| (NIL "MatrixCommonDenominator provides functions to compute the common denominator of a matrix of elements of the quotient field of an integral domain.")) (|splitDenominator| (((|Record| (|:| |num| (|Matrix| |#1|)) (|:| |den| |#1|)) (|Matrix| |#2|)) "\\spad{splitDenominator(q)} returns \\spad{[p, d]} such that \\spad{q = p/d} and \\spad{d} is a common denominator for the elements of \\spad{q}.")) (|clearDenominator| (((|Matrix| |#1|) (|Matrix| |#2|)) "\\spad{clearDenominator(q)} returns \\spad{p} such that \\spad{q = p/d} where \\spad{d} is a common denominator for the elements of \\spad{q}.")) (|commonDenominator| ((|#1| (|Matrix| |#2|)) "\\spad{commonDenominator(q)} returns a common denominator \\spad{d} for the elements of \\spad{q}."))) NIL NIL -(-713) +(-712) ((|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"))) -((-4417 . T) (-4422 |has| (-718) (-376)) (-4416 |has| (-718) (-376)) (-1489 . T) (-4423 |has| (-718) (-6 -4423)) (-4420 |has| (-718) (-6 -4420)) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| (-718) (QUOTE (-149))) (|HasCategory| (-718) (QUOTE (-147))) (|HasCategory| (-718) (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| (-718) (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| (-718) (QUOTE (-381))) (|HasCategory| (-718) (QUOTE (-376))) (-3956 (|HasCategory| (-718) (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| (-718) (QUOTE (-376)))) (|HasCategory| (-718) (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| (-718) (QUOTE (-240))) (|HasCategory| (-718) (QUOTE (-239))) (-3956 (-12 (|HasCategory| (-718) (QUOTE (-376))) (|HasCategory| (-718) (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| (-718) (|%list| (QUOTE -918) (QUOTE (-1197))))) (-3956 (|HasCategory| (-718) (QUOTE (-376))) (|HasCategory| (-718) (QUOTE (-363)))) (|HasCategory| (-718) (QUOTE (-363))) (|HasCategory| (-718) (|%list| (QUOTE -298) (QUOTE (-718)) (QUOTE (-718)))) (|HasCategory| (-718) (|%list| (QUOTE -321) (QUOTE (-718)))) (|HasCategory| (-718) (|%list| (QUOTE -526) (QUOTE (-1197)) (QUOTE (-718)))) (|HasCategory| (-718) (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-718) (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-718) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-718) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (-3956 (|HasCategory| (-718) (QUOTE (-319))) (|HasCategory| (-718) (QUOTE (-376))) (|HasCategory| (-718) (QUOTE (-363)))) (|HasCategory| (-718) (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-718) (QUOTE (-1040))) (|HasCategory| (-718) (QUOTE (-1223))) (-12 (|HasCategory| (-718) (QUOTE (-1022))) (|HasCategory| (-718) (QUOTE (-1223)))) (-3956 (-12 (|HasCategory| (-718) (QUOTE (-319))) (|HasCategory| (-718) (QUOTE (-928)))) (-12 (|HasCategory| (-718) (QUOTE (-363))) (|HasCategory| (-718) (QUOTE (-928)))) (|HasCategory| (-718) (QUOTE (-376)))) (-3956 (-12 (|HasCategory| (-718) (QUOTE (-319))) (|HasCategory| (-718) (QUOTE (-928)))) (-12 (|HasCategory| (-718) (QUOTE (-376))) (|HasCategory| (-718) (QUOTE (-928)))) (-12 (|HasCategory| (-718) (QUOTE (-363))) (|HasCategory| (-718) (QUOTE (-928))))) (|HasCategory| (-718) (QUOTE (-557))) (-12 (|HasCategory| (-718) (QUOTE (-1080))) (|HasCategory| (-718) (QUOTE (-1223)))) (|HasCategory| (-718) (QUOTE (-1080))) (|HasCategory| (-718) (QUOTE (-319))) (|HasCategory| (-718) (QUOTE (-928))) (-3956 (-12 (|HasCategory| (-718) (QUOTE (-319))) (|HasCategory| (-718) (QUOTE (-928)))) (|HasCategory| (-718) (QUOTE (-376)))) (-3956 (-12 (|HasCategory| (-718) (QUOTE (-240))) (|HasCategory| (-718) (QUOTE (-376)))) (|HasCategory| (-718) (QUOTE (-239)))) (-3956 (-12 (|HasCategory| (-718) (QUOTE (-319))) (|HasCategory| (-718) (QUOTE (-928)))) (|HasCategory| (-718) (QUOTE (-569)))) (-12 (|HasCategory| (-718) (QUOTE (-239))) (|HasCategory| (-718) (QUOTE (-376)))) (-12 (|HasCategory| (-718) (QUOTE (-376))) (|HasCategory| (-718) (|%list| (QUOTE -918) (QUOTE (-1197))))) (-12 (|HasCategory| (-718) (QUOTE (-240))) (|HasCategory| (-718) (QUOTE (-376)))) (-12 (|HasCategory| (-718) (QUOTE (-376))) (|HasCategory| (-718) (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| (-718) (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| (-718) (QUOTE (-569))) (|HasAttribute| (-718) (QUOTE -4423)) (|HasAttribute| (-718) (QUOTE -4420)) (-12 (|HasCategory| (-718) (QUOTE (-319))) (|HasCategory| (-718) (QUOTE (-928)))) (|HasCategory| (-718) (|%list| (QUOTE -918) (QUOTE (-1197)))) (-3956 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-718) (QUOTE (-319))) (|HasCategory| (-718) (QUOTE (-928)))) (|HasCategory| (-718) (QUOTE (-147)))) (-3956 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-718) (QUOTE (-319))) (|HasCategory| (-718) (QUOTE (-928)))) (|HasCategory| (-718) (QUOTE (-363))))) -(-714 S) +((-4416 . T) (-4421 |has| (-717) (-376)) (-4415 |has| (-717) (-376)) (-1488 . T) (-4422 |has| (-717) (-6 -4422)) (-4419 |has| (-717) (-6 -4419)) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| (-717) (QUOTE (-149))) (|HasCategory| (-717) (QUOTE (-147))) (|HasCategory| (-717) (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| (-717) (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| (-717) (QUOTE (-381))) (|HasCategory| (-717) (QUOTE (-376))) (-3955 (|HasCategory| (-717) (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| (-717) (QUOTE (-376)))) (|HasCategory| (-717) (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| (-717) (QUOTE (-240))) (|HasCategory| (-717) (QUOTE (-239))) (-3955 (-12 (|HasCategory| (-717) (QUOTE (-376))) (|HasCategory| (-717) (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| (-717) (|%list| (QUOTE -917) (QUOTE (-1196))))) (-3955 (|HasCategory| (-717) (QUOTE (-376))) (|HasCategory| (-717) (QUOTE (-363)))) (|HasCategory| (-717) (QUOTE (-363))) (|HasCategory| (-717) (|%list| (QUOTE -298) (QUOTE (-717)) (QUOTE (-717)))) (|HasCategory| (-717) (|%list| (QUOTE -321) (QUOTE (-717)))) (|HasCategory| (-717) (|%list| (QUOTE -526) (QUOTE (-1196)) (QUOTE (-717)))) (|HasCategory| (-717) (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-717) (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-717) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-717) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (-3955 (|HasCategory| (-717) (QUOTE (-319))) (|HasCategory| (-717) (QUOTE (-376))) (|HasCategory| (-717) (QUOTE (-363)))) (|HasCategory| (-717) (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-717) (QUOTE (-1039))) (|HasCategory| (-717) (QUOTE (-1222))) (-12 (|HasCategory| (-717) (QUOTE (-1021))) (|HasCategory| (-717) (QUOTE (-1222)))) (-3955 (-12 (|HasCategory| (-717) (QUOTE (-319))) (|HasCategory| (-717) (QUOTE (-927)))) (-12 (|HasCategory| (-717) (QUOTE (-363))) (|HasCategory| (-717) (QUOTE (-927)))) (|HasCategory| (-717) (QUOTE (-376)))) (-3955 (-12 (|HasCategory| (-717) (QUOTE (-319))) (|HasCategory| (-717) (QUOTE (-927)))) (-12 (|HasCategory| (-717) (QUOTE (-376))) (|HasCategory| (-717) (QUOTE (-927)))) (-12 (|HasCategory| (-717) (QUOTE (-363))) (|HasCategory| (-717) (QUOTE (-927))))) (|HasCategory| (-717) (QUOTE (-556))) (-12 (|HasCategory| (-717) (QUOTE (-1079))) (|HasCategory| (-717) (QUOTE (-1222)))) (|HasCategory| (-717) (QUOTE (-1079))) (|HasCategory| (-717) (QUOTE (-319))) (|HasCategory| (-717) (QUOTE (-927))) (-3955 (-12 (|HasCategory| (-717) (QUOTE (-319))) (|HasCategory| (-717) (QUOTE (-927)))) (|HasCategory| (-717) (QUOTE (-376)))) (-3955 (-12 (|HasCategory| (-717) (QUOTE (-240))) (|HasCategory| (-717) (QUOTE (-376)))) (|HasCategory| (-717) (QUOTE (-239)))) (-3955 (-12 (|HasCategory| (-717) (QUOTE (-319))) (|HasCategory| (-717) (QUOTE (-927)))) (|HasCategory| (-717) (QUOTE (-568)))) (-12 (|HasCategory| (-717) (QUOTE (-239))) (|HasCategory| (-717) (QUOTE (-376)))) (-12 (|HasCategory| (-717) (QUOTE (-376))) (|HasCategory| (-717) (|%list| (QUOTE -917) (QUOTE (-1196))))) (-12 (|HasCategory| (-717) (QUOTE (-240))) (|HasCategory| (-717) (QUOTE (-376)))) (-12 (|HasCategory| (-717) (QUOTE (-376))) (|HasCategory| (-717) (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| (-717) (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| (-717) (QUOTE (-568))) (|HasAttribute| (-717) (QUOTE -4422)) (|HasAttribute| (-717) (QUOTE -4419)) (-12 (|HasCategory| (-717) (QUOTE (-319))) (|HasCategory| (-717) (QUOTE (-927)))) (|HasCategory| (-717) (|%list| (QUOTE -917) (QUOTE (-1196)))) (-3955 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-717) (QUOTE (-319))) (|HasCategory| (-717) (QUOTE (-927)))) (|HasCategory| (-717) (QUOTE (-147)))) (-3955 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-717) (QUOTE (-319))) (|HasCategory| (-717) (QUOTE (-927)))) (|HasCategory| (-717) (QUOTE (-363))))) +(-713 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}."))) -((-4425 . T)) +((-4424 . T)) NIL -(-715 U) +(-714 U) ((|constructor| (NIL "This package supports factorization and gcds of univariate polynomials over the integers modulo different primes. The inputs are given as polynomials over the integers with the prime passed explicitly as an extra argument.")) (|exptMod| ((|#1| |#1| (|Integer|) |#1| (|Integer|)) "\\spad{exptMod(f,n,g,p)} raises the univariate polynomial \\spad{f} to the \\spad{n}th power modulo the polynomial \\spad{g} and the prime \\spad{p}.")) (|separateFactors| (((|List| |#1|) (|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|)))) (|Integer|)) "\\spad{separateFactors(ddl, p)} refines the distinct degree factorization produced by \\spadfunFrom{ddFact}{ModularDistinctDegreeFactorizer} to give a complete list of factors.")) (|ddFact| (((|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|)))) |#1| (|Integer|)) "\\spad{ddFact(f,p)} computes a distinct degree factorization of the polynomial \\spad{f} modulo the prime \\spad{p},{} \\spadignore{i.e.} such that each factor is a product of irreducibles of the same degrees. The input polynomial \\spad{f} is assumed to be square-free modulo \\spad{p}.")) (|factor| (((|List| |#1|) |#1| (|Integer|)) "\\spad{factor(f1,p)} returns the list of factors of the univariate polynomial \\spad{f1} modulo the integer prime \\spad{p}. Error: if \\spad{f1} is not square-free modulo \\spad{p}.")) (|linears| ((|#1| |#1| (|Integer|)) "\\spad{linears(f,p)} returns the product of all the linear factors of \\spad{f} modulo \\spad{p}. Potentially incorrect result if \\spad{f} is not square-free modulo \\spad{p}.")) (|gcd| ((|#1| |#1| |#1| (|Integer|)) "\\spad{gcd(f1,f2,p)} computes the gcd of the univariate polynomials \\spad{f1} and \\spad{f2} modulo the integer prime \\spad{p}."))) NIL NIL -(-716) +(-715) ((|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|)) #1="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|)) #1#) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(f,g,h,j,s1,s2,l)} \\undocumented"))) NIL NIL -(-717 OV E -3494 PG) +(-716 OV E -3493 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 -(-718) +(-717) ((|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}"))) -((-4199 . T) (-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4198 . T) (-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-719 R) +(-718 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."))) NIL NIL -(-720) +(-719) ((|constructor| (NIL "A domain which models the integer representation used by machines in the AXIOM-NAG link.")) (|coerce| (((|Expression| $) (|Expression| (|Integer|))) "\\spad{coerce(x)} returns \\spad{x} with coefficients in the domain")) (|maxint| (((|PositiveInteger|)) "\\spad{maxint()} returns the maximum integer in the model") (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{maxint(u)} sets the maximum integer in the model to \\spad{u}"))) -((-4423 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4422 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-721 S D1 D2 I) +(-720 S D1 D2 I) ((|constructor| (NIL "transforms top-level objects into compiled functions.")) (|compiledFunction| (((|Mapping| |#4| |#2| |#3|) |#1| (|Symbol|) (|Symbol|)) "\\spad{compiledFunction(expr,x,y)} returns a function \\spad{f: (D1, D2) -> I} defined by \\spad{f(x, y) == expr}. Function \\spad{f} is compiled and directly applicable to objects of type \\spad{(D1, D2)}")) (|binaryFunction| (((|Mapping| |#4| |#2| |#3|) (|Symbol|)) "\\spad{binaryFunction(s)} is a local function"))) NIL NIL -(-722 S) +(-721 S) ((|constructor| (NIL "MakeFloatCompiledFunction transforms top-level objects into compiled Lisp functions whose arguments are Lisp floats. This by-passes the \\Language{} compiler and interpreter,{} thereby gaining several orders of magnitude.")) (|makeFloatFunction| (((|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) |#1| (|Symbol|) (|Symbol|)) "\\spad{makeFloatFunction(expr, x, y)} returns a Lisp function \\spad{f: (\\axiomType{DoubleFloat}, \\axiomType{DoubleFloat}) -> \\axiomType{DoubleFloat}} defined by \\spad{f(x, y) == expr}. Function \\spad{f} is compiled and directly applicable to objects of type \\spad{(\\axiomType{DoubleFloat}, \\axiomType{DoubleFloat})}.") (((|Mapping| (|DoubleFloat|) (|DoubleFloat|)) |#1| (|Symbol|)) "\\spad{makeFloatFunction(expr, x)} returns a Lisp function \\spad{f: \\axiomType{DoubleFloat} -> \\axiomType{DoubleFloat}} defined by \\spad{f(x) == expr}. Function \\spad{f} is compiled and directly applicable to objects of type \\axiomType{DoubleFloat}."))) NIL NIL -(-723 S) +(-722 S) ((|constructor| (NIL "transforms top-level objects into interpreter functions.")) (|function| (((|Symbol|) |#1| (|Symbol|) (|List| (|Symbol|))) "\\spad{function(e, foo, [x1,...,xn])} creates a function \\spad{foo(x1,...,xn) == e}.") (((|Symbol|) |#1| (|Symbol|) (|Symbol|) (|Symbol|)) "\\spad{function(e, foo, x, y)} creates a function \\spad{foo(x, y) = e}.") (((|Symbol|) |#1| (|Symbol|) (|Symbol|)) "\\spad{function(e, foo, x)} creates a function \\spad{foo(x) == e}.") (((|Symbol|) |#1| (|Symbol|)) "\\spad{function(e, foo)} creates a function \\spad{foo() == e}."))) NIL NIL -(-724 S T$) +(-723 S T$) ((|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 -(-725 S -3069 I) +(-724 S -3068 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 -(-726 E OV R P) +(-725 E OV R P) ((|constructor| (NIL "This package provides the functions for the multivariate \"lifting\",{} using an algorithm of Paul Wang. This package will work for every euclidean domain \\spad{R} which has property \\spad{F},{} \\spadignore{i.e.} there exists a factor operation in \\spad{R[x]}.")) (|lifting1| (((|Union| (|List| (|SparseUnivariatePolynomial| |#4|)) "failed") (|SparseUnivariatePolynomial| |#4|) (|List| |#2|) (|List| (|SparseUnivariatePolynomial| |#4|)) (|List| |#3|) (|List| |#4|) (|List| (|List| (|Record| (|:| |expt| (|NonNegativeInteger|)) (|:| |pcoef| |#4|)))) (|List| (|NonNegativeInteger|)) (|Vector| (|List| (|SparseUnivariatePolynomial| |#3|))) |#3|) "\\spad{lifting1(u,lv,lu,lr,lp,lt,ln,t,r)} \\undocumented")) (|lifting| (((|Union| (|List| (|SparseUnivariatePolynomial| |#4|)) "failed") (|SparseUnivariatePolynomial| |#4|) (|List| |#2|) (|List| (|SparseUnivariatePolynomial| |#3|)) (|List| |#3|) (|List| |#4|) (|List| (|NonNegativeInteger|)) |#3|) "\\spad{lifting(u,lv,lu,lr,lp,ln,r)} \\undocumented")) (|corrPoly| (((|Union| (|List| (|SparseUnivariatePolynomial| |#4|)) "failed") (|SparseUnivariatePolynomial| |#4|) (|List| |#2|) (|List| |#3|) (|List| (|NonNegativeInteger|)) (|List| (|SparseUnivariatePolynomial| |#4|)) (|Vector| (|List| (|SparseUnivariatePolynomial| |#3|))) |#3|) "\\spad{corrPoly(u,lv,lr,ln,lu,t,r)} \\undocumented"))) NIL NIL -(-727 R) +(-726 R) ((|constructor| (NIL "This is the category of linear operator rings with one generator. The generator is not named by the category but can always be constructed as \\spad{monomial(1,1)}. \\blankline For convenience,{} call the generator \\spad{G}. Then each value is equal to \\indented{4}{\\spad{sum(a(i)*G**i, i = 0..n)}} for some unique \\spad{n} and \\spad{a(i)} in \\spad{R}. \\blankline Note that multiplication is not necessarily commutative. In fact,{} if \\spad{a} is in \\spad{R},{} it is quite normal to have \\spad{a*G \\~= G*a}.")) (|monomial| (($ |#1| (|NonNegativeInteger|)) "\\spad{monomial(c,k)} produces \\spad{c} times the \\spad{k}-th power of the generating operator,{} \\spad{monomial(1,1)}.")) (|coefficient| ((|#1| $ (|NonNegativeInteger|)) "\\spad{coefficient(l,k)} is \\spad{a(k)} if \\indented{2}{\\spad{l = sum(monomial(a(i),i), i = 0..n)}.}")) (|reductum| (($ $) "\\spad{reductum(l)} is \\spad{l - monomial(a(n),n)} if \\indented{2}{\\spad{l = sum(monomial(a(i),i), i = 0..n)}.}")) (|leadingCoefficient| ((|#1| $) "\\spad{leadingCoefficient(l)} is \\spad{a(n)} if \\indented{2}{\\spad{l = sum(monomial(a(i),i), i = 0..n)}.}")) (|minimumDegree| (((|NonNegativeInteger|) $) "\\spad{minimumDegree(l)} is the smallest \\spad{k} such that \\spad{a(k) \\~= 0} if \\indented{2}{\\spad{l = sum(monomial(a(i),i), i = 0..n)}.}")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(l)} is \\spad{n} if \\indented{2}{\\spad{l = sum(monomial(a(i),i), i = 0..n)}.}"))) -((-4418 . T) (-4419 . T) (-4421 . T)) +((-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-728 R1 UP1 UPUP1 R2 UP2 UPUP2) +(-727 R1 UP1 UPUP1 R2 UP2 UPUP2) ((|constructor| (NIL "Lifting of a map through 2 levels of polynomials.")) (|map| ((|#6| (|Mapping| |#4| |#1|) |#3|) "\\spad{map(f, p)} lifts \\spad{f} to the domain of \\spad{p} then applies it to \\spad{p}."))) NIL NIL -(-729) +(-728) ((|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 -(-730 R |Mod| -2246 -3937 |exactQuo|) +(-729 R |Mod| -2245 -3936 |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"))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-731 R |Rep|) +(-730 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"))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4420 |has| |#1| (-376)) (-4422 |has| |#1| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-1102) (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-1102) (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-1102) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-1102) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-1102) (|%list| (QUOTE -630) (QUOTE (-547))))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1172))) (|HasCategory| |#1| (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-240))) (|HasAttribute| |#1| (QUOTE -4422)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) -(-732 IS E |ff|) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4419 |has| |#1| (-376)) (-4421 |has| |#1| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-1101) (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-1101) (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-1101) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-1101) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-1101) (|%list| (QUOTE -629) (QUOTE (-546))))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1171))) (|HasCategory| |#1| (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-240))) (|HasAttribute| |#1| (QUOTE -4421)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) +(-731 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 NIL -(-733 R M) +(-732 R M) ((|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}."))) -((-4419 |has| |#1| (-175)) (-4418 |has| |#1| (-175)) (-4421 . T)) +((-4418 |has| |#1| (-175)) (-4417 |has| |#1| (-175)) (-4420 . T)) ((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149)))) -(-734 R |Mod| -2246 -3937 |exactQuo|) +(-733 R |Mod| -2245 -3936 |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"))) -((-4421 . T)) +((-4420 . T)) NIL -(-735 S R) +(-734 S R) ((|constructor| (NIL "The category of modules over a commutative ring. \\blankline"))) NIL NIL -(-736 R) +(-735 R) ((|constructor| (NIL "The category of modules over a commutative ring. \\blankline"))) -((-4419 . T) (-4418 . T)) +((-4418 . T) (-4417 . T)) NIL -(-737 -3494) +(-736 -3493) ((|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]]}."))) -((-4421 . T)) +((-4420 . T)) NIL -(-738 S) +(-737 S) ((|constructor| (NIL "Monad is the class of all multiplicative monads,{} \\spadignore{i.e.} sets with a binary operation.")) (** (($ $ (|PositiveInteger|)) "\\spad{a**n} returns the \\spad{n}\\spad{-}th power of \\spad{a},{} defined by repeated squaring.")) (|leftPower| (($ $ (|PositiveInteger|)) "\\spad{leftPower(a,n)} returns the \\spad{n}\\spad{-}th left power of \\spad{a},{} \\spadignore{i.e.} \\spad{leftPower(a,n) := a * leftPower(a,n-1)} and \\spad{leftPower(a,1) := a}.")) (|rightPower| (($ $ (|PositiveInteger|)) "\\spad{rightPower(a,n)} returns the \\spad{n}\\spad{-}th right power of \\spad{a},{} \\spadignore{i.e.} \\spad{rightPower(a,n) := rightPower(a,n-1) * a} and \\spad{rightPower(a,1) := a}.")) (* (($ $ $) "\\spad{a*b} is the product of \\spad{a} and \\spad{b} in a set with a binary operation."))) NIL NIL -(-739) +(-738) ((|constructor| (NIL "Monad is the class of all multiplicative monads,{} \\spadignore{i.e.} sets with a binary operation.")) (** (($ $ (|PositiveInteger|)) "\\spad{a**n} returns the \\spad{n}\\spad{-}th power of \\spad{a},{} defined by repeated squaring.")) (|leftPower| (($ $ (|PositiveInteger|)) "\\spad{leftPower(a,n)} returns the \\spad{n}\\spad{-}th left power of \\spad{a},{} \\spadignore{i.e.} \\spad{leftPower(a,n) := a * leftPower(a,n-1)} and \\spad{leftPower(a,1) := a}.")) (|rightPower| (($ $ (|PositiveInteger|)) "\\spad{rightPower(a,n)} returns the \\spad{n}\\spad{-}th right power of \\spad{a},{} \\spadignore{i.e.} \\spad{rightPower(a,n) := rightPower(a,n-1) * a} and \\spad{rightPower(a,1) := a}.")) (* (($ $ $) "\\spad{a*b} is the product of \\spad{a} and \\spad{b} in a set with a binary operation."))) NIL NIL -(-740 S) +(-739 S) ((|constructor| (NIL "\\indented{1}{MonadWithUnit is the class of multiplicative monads with unit,{}} \\indented{1}{\\spadignore{i.e.} sets with a binary operation and a unit element.} Axioms \\indented{3}{leftIdentity(\"*\":(\\%,{}\\%)->\\%,{}1)\\space{3}\\tab{30} 1*x=x} \\indented{3}{rightIdentity(\"*\":(\\%,{}\\%)->\\%,{}1)\\space{2}\\tab{30} x*1=x} Common Additional Axioms \\indented{3}{unitsKnown---if \"recip\" says \"failed\",{} that PROVES input wasn't a unit}")) (|rightRecip| (((|Union| $ "failed") $) "\\spad{rightRecip(a)} returns an element,{} which is a right inverse of \\spad{a},{} or \\spad{\"failed\"} if such an element doesn't exist or cannot be determined (see unitsKnown).")) (|leftRecip| (((|Union| $ "failed") $) "\\spad{leftRecip(a)} returns an element,{} which is a left inverse of \\spad{a},{} or \\spad{\"failed\"} if such an element doesn't exist or cannot be determined (see unitsKnown).")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(a)} returns an element,{} which is both a left and a right inverse of \\spad{a},{} or \\spad{\"failed\"} if such an element doesn't exist or cannot be determined (see unitsKnown).")) (** (($ $ (|NonNegativeInteger|)) "\\spad{a**n} returns the \\spad{n}\\spad{-}th power of \\spad{a},{} defined by repeated squaring.")) (|leftPower| (($ $ (|NonNegativeInteger|)) "\\spad{leftPower(a,n)} returns the \\spad{n}\\spad{-}th left power of \\spad{a},{} \\spadignore{i.e.} \\spad{leftPower(a,n) := a * leftPower(a,n-1)} and \\spad{leftPower(a,0) := 1}.")) (|rightPower| (($ $ (|NonNegativeInteger|)) "\\spad{rightPower(a,n)} returns the \\spad{n}\\spad{-}th right power of \\spad{a},{} \\spadignore{i.e.} \\spad{rightPower(a,n) := rightPower(a,n-1) * a} and \\spad{rightPower(a,0) := 1}.")) (|one?| (((|Boolean|) $) "\\spad{one?(a)} tests whether \\spad{a} is the unit 1.")) ((|One|) (($) "1 returns the unit element,{} denoted by 1."))) NIL NIL -(-741) +(-740) ((|constructor| (NIL "\\indented{1}{MonadWithUnit is the class of multiplicative monads with unit,{}} \\indented{1}{\\spadignore{i.e.} sets with a binary operation and a unit element.} Axioms \\indented{3}{leftIdentity(\"*\":(\\%,{}\\%)->\\%,{}1)\\space{3}\\tab{30} 1*x=x} \\indented{3}{rightIdentity(\"*\":(\\%,{}\\%)->\\%,{}1)\\space{2}\\tab{30} x*1=x} Common Additional Axioms \\indented{3}{unitsKnown---if \"recip\" says \"failed\",{} that PROVES input wasn't a unit}")) (|rightRecip| (((|Union| $ "failed") $) "\\spad{rightRecip(a)} returns an element,{} which is a right inverse of \\spad{a},{} or \\spad{\"failed\"} if such an element doesn't exist or cannot be determined (see unitsKnown).")) (|leftRecip| (((|Union| $ "failed") $) "\\spad{leftRecip(a)} returns an element,{} which is a left inverse of \\spad{a},{} or \\spad{\"failed\"} if such an element doesn't exist or cannot be determined (see unitsKnown).")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(a)} returns an element,{} which is both a left and a right inverse of \\spad{a},{} or \\spad{\"failed\"} if such an element doesn't exist or cannot be determined (see unitsKnown).")) (** (($ $ (|NonNegativeInteger|)) "\\spad{a**n} returns the \\spad{n}\\spad{-}th power of \\spad{a},{} defined by repeated squaring.")) (|leftPower| (($ $ (|NonNegativeInteger|)) "\\spad{leftPower(a,n)} returns the \\spad{n}\\spad{-}th left power of \\spad{a},{} \\spadignore{i.e.} \\spad{leftPower(a,n) := a * leftPower(a,n-1)} and \\spad{leftPower(a,0) := 1}.")) (|rightPower| (($ $ (|NonNegativeInteger|)) "\\spad{rightPower(a,n)} returns the \\spad{n}\\spad{-}th right power of \\spad{a},{} \\spadignore{i.e.} \\spad{rightPower(a,n) := rightPower(a,n-1) * a} and \\spad{rightPower(a,0) := 1}.")) (|one?| (((|Boolean|) $) "\\spad{one?(a)} tests whether \\spad{a} is the unit 1.")) ((|One|) (($) "1 returns the unit element,{} denoted by 1."))) NIL NIL -(-742 S R UP) +(-741 S R UP) ((|constructor| (NIL "A \\spadtype{MonogenicAlgebra} is an algebra of finite rank which can be generated by a single element.")) (|derivationCoordinates| (((|Matrix| |#2|) (|Vector| $) (|Mapping| |#2| |#2|)) "\\spad{derivationCoordinates(b, ')} returns \\spad{M} such that \\spad{b' = M b}.")) (|lift| ((|#3| $) "\\spad{lift(z)} returns a minimal degree univariate polynomial up such that \\spad{z=reduce up}.")) (|convert| (($ |#3|) "\\spad{convert(up)} converts the univariate polynomial \\spad{up} to an algebra element,{} reducing by the \\spad{definingPolynomial()} if necessary.")) (|reduce| (((|Union| $ "failed") (|Fraction| |#3|)) "\\spad{reduce(frac)} converts the fraction \\spad{frac} to an algebra element.") (($ |#3|) "\\spad{reduce(up)} converts the univariate polynomial \\spad{up} to an algebra element,{} reducing by the \\spad{definingPolynomial()} if necessary.")) (|definingPolynomial| ((|#3|) "\\spad{definingPolynomial()} returns the minimal polynomial which \\spad{generator()} satisfies.")) (|generator| (($) "\\spad{generator()} returns the generator for this domain."))) NIL ((|HasCategory| |#2| (QUOTE (-363))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-381)))) -(-743 R UP) +(-742 R UP) ((|constructor| (NIL "A \\spadtype{MonogenicAlgebra} is an algebra of finite rank which can be generated by a single element.")) (|derivationCoordinates| (((|Matrix| |#1|) (|Vector| $) (|Mapping| |#1| |#1|)) "\\spad{derivationCoordinates(b, ')} returns \\spad{M} such that \\spad{b' = M b}.")) (|lift| ((|#2| $) "\\spad{lift(z)} returns a minimal degree univariate polynomial up such that \\spad{z=reduce up}.")) (|convert| (($ |#2|) "\\spad{convert(up)} converts the univariate polynomial \\spad{up} to an algebra element,{} reducing by the \\spad{definingPolynomial()} if necessary.")) (|reduce| (((|Union| $ "failed") (|Fraction| |#2|)) "\\spad{reduce(frac)} converts the fraction \\spad{frac} to an algebra element.") (($ |#2|) "\\spad{reduce(up)} converts the univariate polynomial \\spad{up} to an algebra element,{} reducing by the \\spad{definingPolynomial()} if necessary.")) (|definingPolynomial| ((|#2|) "\\spad{definingPolynomial()} returns the minimal polynomial which \\spad{generator()} satisfies.")) (|generator| (($) "\\spad{generator()} returns the generator for this domain."))) -((-4417 |has| |#1| (-376)) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 |has| |#1| (-376)) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-744 S) +(-743 S) ((|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 -(-745) +(-744) ((|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 -(-746 -3494 UP) +(-745 -3493 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 -(-747 |VarSet| E1 E2 R S PR PS) +(-746 |VarSet| E1 E2 R S PR PS) ((|constructor| (NIL "\\indented{1}{Utilities for MPolyCat} Author: Manuel Bronstein Date Created: 1987 Date Last Updated: 28 March 1990 (PG)")) (|reshape| ((|#7| (|List| |#5|) |#6|) "\\spad{reshape(l,p)} \\undocumented")) (|map| ((|#7| (|Mapping| |#5| |#4|) |#6|) "\\spad{map(f,p)} \\undocumented "))) NIL NIL -(-748 |Vars1| |Vars2| E1 E2 R PR1 PR2) +(-747 |Vars1| |Vars2| E1 E2 R PR1 PR2) ((|constructor| (NIL "This package \\undocumented")) (|map| ((|#7| (|Mapping| |#2| |#1|) |#6|) "\\spad{map(f,x)} \\undocumented"))) NIL NIL -(-749 E OV R PPR) +(-748 E OV R PPR) ((|constructor| (NIL "\\indented{3}{This package exports a factor operation for multivariate polynomials} with coefficients which are polynomials over some ring \\spad{R} over which we can factor. It is used internally by packages such as the solve package which need to work with polynomials in a specific set of variables with coefficients which are polynomials in all the other variables.")) (|factor| (((|Factored| |#4|) |#4|) "\\spad{factor(p)} factors a polynomial with polynomial coefficients.")) (|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 -(-750 |vl| R) +(-749 |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."))) -(((-4426 "*") |has| |#2| (-175)) (-4417 |has| |#2| (-569)) (-4422 |has| |#2| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#2| (QUOTE (-928))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-928)))) (-3956 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-928)))) (-3956 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-928)))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-175))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-569)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-877 |#1|) (|%list| (QUOTE -630) (QUOTE (-547))))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4422)) (|HasCategory| |#2| (QUOTE (-464))) (-12 (|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#2| (QUOTE (-147))))) -(-751 E OV R PRF) +(((-4425 "*") |has| |#2| (-175)) (-4416 |has| |#2| (-568)) (-4421 |has| |#2| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#2| (QUOTE (-927))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-927)))) (-3955 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-927)))) (-3955 (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-927)))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-175))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-568)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-876 |#1|) (|%list| (QUOTE -629) (QUOTE (-546))))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4421)) (|HasCategory| |#2| (QUOTE (-464))) (-12 (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#2| (QUOTE (-147))))) +(-750 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 NIL -(-752 E OV R P) +(-751 E OV R P) ((|constructor| (NIL "\\indented{1}{MRationalFactorize contains the factor function for multivariate} polynomials over the quotient field of a ring \\spad{R} such that the package MultivariateFactorize can factor multivariate polynomials over \\spad{R}.")) (|factor| (((|Factored| |#4|) |#4|) "\\spad{factor(p)} factors the multivariate polynomial \\spad{p} with coefficients which are fractions of elements of \\spad{R}."))) NIL NIL -(-753 R S M) +(-752 R S M) ((|constructor| (NIL "\\spad{MonoidRingFunctions2} implements functions between two monoid rings defined with the same monoid over different rings.")) (|map| (((|MonoidRing| |#2| |#3|) (|Mapping| |#2| |#1|) (|MonoidRing| |#1| |#3|)) "\\spad{map(f,u)} maps \\spad{f} onto the coefficients \\spad{f} the element \\spad{u} of the monoid ring to create an element of a monoid ring with the same monoid \\spad{b}."))) NIL NIL -(-754 R M) +(-753 R M) ((|constructor| (NIL "\\spadtype{MonoidRing}(\\spad{R},{}\\spad{M}),{} implements the algebra of all maps from the monoid \\spad{M} to the commutative ring \\spad{R} with finite support. Multiplication of two maps \\spad{f} and \\spad{g} is defined to map an element \\spad{c} of \\spad{M} to the (convolution) sum over {\\em f(a)g(b)} such that {\\em ab = c}. Thus \\spad{M} can be identified with a canonical basis and the maps can also be considered as formal linear combinations of the elements in \\spad{M}. Scalar multiples of a basis element are called monomials. A prominent example is the class of polynomials where the monoid is a direct product of the natural numbers with pointwise addition. When \\spad{M} is \\spadtype{FreeMonoid Symbol},{} one gets polynomials in infinitely many non-commuting variables. Another application area is representation theory of finite groups \\spad{G},{} where modules over \\spadtype{MonoidRing}(\\spad{R},{}\\spad{G}) are studied.")) (|reductum| (($ $) "\\spad{reductum(f)} is \\spad{f} minus its leading monomial.")) (|leadingCoefficient| ((|#1| $) "\\spad{leadingCoefficient(f)} gives the coefficient of \\spad{f},{} whose corresponding monoid element is the greatest among all those with non-zero coefficients.")) (|leadingMonomial| ((|#2| $) "\\spad{leadingMonomial(f)} gives the monomial of \\spad{f} whose corresponding monoid element is the greatest among all those with non-zero coefficients.")) (|numberOfMonomials| (((|NonNegativeInteger|) $) "\\spad{numberOfMonomials(f)} is the number of non-zero coefficients with respect to the canonical basis.")) (|monomials| (((|List| $) $) "\\spad{monomials(f)} gives the list of all monomials whose sum is \\spad{f}.")) (|coefficients| (((|List| |#1|) $) "\\spad{coefficients(f)} lists all non-zero coefficients.")) (|monomial?| (((|Boolean|) $) "\\spad{monomial?(f)} tests if \\spad{f} is a single monomial.")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(fn,u)} maps function \\spad{fn} onto the coefficients of the non-zero monomials of \\spad{u}.")) (|terms| (((|List| (|Record| (|:| |coef| |#1|) (|:| |monom| |#2|))) $) "\\spad{terms(f)} gives the list of non-zero coefficients combined with their corresponding basis element as records. This is the internal representation.")) (|coerce| (($ (|List| (|Record| (|:| |coef| |#1|) (|:| |monom| |#2|)))) "\\spad{coerce(lt)} converts a list of terms and coefficients to a member of the domain.")) (|coefficient| ((|#1| $ |#2|) "\\spad{coefficient(f,m)} extracts the coefficient of \\spad{m} in \\spad{f} with respect to the canonical basis \\spad{M}.")) (|monomial| (($ |#1| |#2|) "\\spad{monomial(r,m)} creates a scalar multiple of the basis element \\spad{m}."))) -((-4419 |has| |#1| (-175)) (-4418 |has| |#1| (-175)) (-4421 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-860)))) -(-755 S) +((-4418 |has| |#1| (-175)) (-4417 |has| |#1| (-175)) (-4420 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-859)))) +(-754 S) ((|constructor| (NIL "A multiset is a set with multiplicities.")) (|remove!| (($ (|Mapping| (|Boolean|) |#1|) $ (|Integer|)) "\\spad{remove!(p,ms,number)} removes destructively at most \\spad{number} copies of elements \\spad{x} such that \\spad{p(x)} is \\spadfun{\\spad{true}} if \\spad{number} is positive,{} all of them if \\spad{number} equals zero,{} and all but at most \\spad{-number} if \\spad{number} is negative.") (($ |#1| $ (|Integer|)) "\\spad{remove!(x,ms,number)} removes destructively at most \\spad{number} copies of element \\spad{x} if \\spad{number} is positive,{} all of them if \\spad{number} equals zero,{} and all but at most \\spad{-number} if \\spad{number} is negative.")) (|remove| (($ (|Mapping| (|Boolean|) |#1|) $ (|Integer|)) "\\spad{remove(p,ms,number)} removes at most \\spad{number} copies of elements \\spad{x} such that \\spad{p(x)} is \\spadfun{\\spad{true}} if \\spad{number} is positive,{} all of them if \\spad{number} equals zero,{} and all but at most \\spad{-number} if \\spad{number} is negative.") (($ |#1| $ (|Integer|)) "\\spad{remove(x,ms,number)} removes at most \\spad{number} copies of element \\spad{x} if \\spad{number} is positive,{} all of them if \\spad{number} equals zero,{} and all but at most \\spad{-number} if \\spad{number} is negative.")) (|members| (((|List| |#1|) $) "\\spad{members(ms)} returns a list of the elements of \\spad{ms} {\\em without} their multiplicity. See also \\spadfun{parts}.")) (|multiset| (($ (|List| |#1|)) "\\spad{multiset(ls)} creates a multiset with elements from \\spad{ls}.") (($ |#1|) "\\spad{multiset(s)} creates a multiset with singleton \\spad{s}.") (($) "\\spad{multiset()}\\$\\spad{D} creates an empty multiset of domain \\spad{D}."))) -((-4424 . T) (-4414 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) -(-756 S) +((-4423 . T) (-4413 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102)))) +(-755 S) ((|constructor| (NIL "A multi-set aggregate is a set which keeps track of the multiplicity of its elements."))) -((-4414 . T) (-4425 . T)) +((-4413 . T) (-4424 . T)) NIL -(-757) +(-756) ((|constructor| (NIL "\\spadtype{MoreSystemCommands} implements an interface with the system command facility. These are the commands that are issued from source files or the system interpreter and they start with a close parenthesis,{} \\spadignore{e.g.} \\spadsyscom{what} commands.")) (|systemCommand| (((|Void|) (|String|)) "\\spad{systemCommand(cmd)} takes the string \\spadvar{\\spad{cmd}} and passes it to the runtime environment for execution as a system command. Although various things may be printed,{} no usable value is returned."))) NIL NIL -(-758 S) +(-757 S) ((|constructor| (NIL "This package exports tools for merging lists")) (|mergeDifference| (((|List| |#1|) (|List| |#1|) (|List| |#1|)) "\\spad{mergeDifference(l1,l2)} returns a list of elements in \\spad{l1} not present in \\spad{l2}. Assumes lists are ordered and all \\spad{x} in \\spad{l2} are also in \\spad{l1}."))) NIL NIL -(-759 |Coef| |Var|) +(-758 |Coef| |Var|) ((|constructor| (NIL "\\spadtype{MultivariateTaylorSeriesCategory} is the most general multivariate Taylor series category.")) (|integrate| (($ $ |#2|) "\\spad{integrate(f,x)} returns the anti-derivative of the power series \\spad{f(x)} with respect to the variable \\spad{x} with constant coefficient 1. We may integrate a series when we can divide coefficients by integers.")) (|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}.")) (|order| (((|NonNegativeInteger|) $ |#2| (|NonNegativeInteger|)) "\\spad{order(f,x,n)} returns \\spad{min(n,order(f,x))}.") (((|NonNegativeInteger|) $ |#2|) "\\spad{order(f,x)} returns the order of \\spad{f} viewed as a series in \\spad{x} may result in an infinite loop if \\spad{f} has no non-zero terms.")) (|monomial| (($ $ (|List| |#2|) (|List| (|NonNegativeInteger|))) "\\spad{monomial(a,[x1,x2,...,xk],[n1,n2,...,nk])} returns \\spad{a * x1^n1 * ... * xk^nk}.") (($ $ |#2| (|NonNegativeInteger|)) "\\spad{monomial(a,x,n)} returns \\spad{a*x^n}.")) (|extend| (($ $ (|NonNegativeInteger|)) "\\spad{extend(f,n)} causes all terms of \\spad{f} of degree \\spad{<= n} to be computed.")) (|coefficient| (($ $ (|List| |#2|) (|List| (|NonNegativeInteger|))) "\\spad{coefficient(f,[x1,x2,...,xk],[n1,n2,...,nk])} returns the coefficient of \\spad{x1^n1 * ... * xk^nk} in \\spad{f}.") (($ $ |#2| (|NonNegativeInteger|)) "\\spad{coefficient(f,x,n)} returns the coefficient of \\spad{x^n} in \\spad{f}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4419 . T) (-4418 . T) (-4421 . T)) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4418 . T) (-4417 . T) (-4420 . T)) NIL -(-760 OV E R P) +(-759 OV E R P) ((|constructor| (NIL "\\indented{2}{This is the top level package for doing multivariate factorization} over basic domains like \\spadtype{Integer} or \\spadtype{Fraction Integer}.")) (|factor| (((|Factored| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|)) "\\spad{factor(p)} factors the multivariate polynomial \\spad{p} over its coefficient domain where \\spad{p} is represented as a univariate polynomial with multivariate coefficients") (((|Factored| |#4|) |#4|) "\\spad{factor(p)} factors the multivariate polynomial \\spad{p} over its coefficient domain"))) NIL NIL -(-761 E OV R P) +(-760 E OV R P) ((|constructor| (NIL "Author : \\spad{P}.Gianni This package provides the functions for the computation of the square free decomposition of a multivariate polynomial. It uses the package GenExEuclid for the resolution of the equation \\spad{Af + Bg = h} and its generalization to \\spad{n} polynomials over an integral domain and the package \\spad{MultivariateLifting} for the \"multivariate\" lifting.")) (|normDeriv2| (((|SparseUnivariatePolynomial| |#3|) (|SparseUnivariatePolynomial| |#3|) (|Integer|)) "\\spad{normDeriv2 should} be local")) (|myDegree| (((|List| (|NonNegativeInteger|)) (|SparseUnivariatePolynomial| |#4|) (|List| |#2|) (|NonNegativeInteger|)) "\\spad{myDegree should} be local")) (|lift| (((|Union| (|List| (|SparseUnivariatePolynomial| |#4|)) "failed") (|SparseUnivariatePolynomial| |#4|) (|SparseUnivariatePolynomial| |#3|) (|SparseUnivariatePolynomial| |#3|) |#4| (|List| |#2|) (|List| (|NonNegativeInteger|)) (|List| |#3|)) "\\spad{lift should} be local")) (|check| (((|Boolean|) (|List| (|Record| (|:| |factor| (|SparseUnivariatePolynomial| |#3|)) (|:| |exponent| (|Integer|)))) (|List| (|Record| (|:| |factor| (|SparseUnivariatePolynomial| |#3|)) (|:| |exponent| (|Integer|))))) "\\spad{check should} be local")) (|coefChoose| ((|#4| (|Integer|) (|Factored| |#4|)) "\\spad{coefChoose should} be local")) (|intChoose| (((|Record| (|:| |upol| (|SparseUnivariatePolynomial| |#3|)) (|:| |Lval| (|List| |#3|)) (|:| |Lfact| (|List| (|Record| (|:| |factor| (|SparseUnivariatePolynomial| |#3|)) (|:| |exponent| (|Integer|))))) (|:| |ctpol| |#3|)) (|SparseUnivariatePolynomial| |#4|) (|List| |#2|) (|List| (|List| |#3|))) "\\spad{intChoose should} be local")) (|nsqfree| (((|Record| (|:| |unitPart| |#4|) (|:| |suPart| (|List| (|Record| (|:| |factor| (|SparseUnivariatePolynomial| |#4|)) (|:| |exponent| (|Integer|)))))) (|SparseUnivariatePolynomial| |#4|) (|List| |#2|) (|List| (|List| |#3|))) "\\spad{nsqfree should} be local")) (|consnewpol| (((|Record| (|:| |pol| (|SparseUnivariatePolynomial| |#4|)) (|:| |polval| (|SparseUnivariatePolynomial| |#3|))) (|SparseUnivariatePolynomial| |#4|) (|SparseUnivariatePolynomial| |#3|) (|Integer|)) "\\spad{consnewpol should} be local")) (|univcase| (((|Factored| |#4|) |#4| |#2|) "\\spad{univcase should} be local")) (|compdegd| (((|Integer|) (|List| (|Record| (|:| |factor| (|SparseUnivariatePolynomial| |#3|)) (|:| |exponent| (|Integer|))))) "\\spad{compdegd should} be local")) (|squareFreePrim| (((|Factored| |#4|) |#4|) "\\spad{squareFreePrim(p)} compute the square free decomposition of a primitive multivariate polynomial \\spad{p}.")) (|squareFree| (((|Factored| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|)) "\\spad{squareFree(p)} computes the square free decomposition of a multivariate polynomial \\spad{p} presented as a univariate polynomial with multivariate coefficients.") (((|Factored| |#4|) |#4|) "\\spad{squareFree(p)} computes the square free decomposition of a multivariate polynomial \\spad{p}."))) NIL NIL -(-762 S R) +(-761 S R) ((|constructor| (NIL "NonAssociativeAlgebra is the category of non associative algebras (modules which are themselves non associative rngs). Axioms \\indented{3}{r*(a*b) = (r*a)*b = a*(r*b)}")) (|plenaryPower| (($ $ (|PositiveInteger|)) "\\spad{plenaryPower(a,n)} is recursively defined to be \\spad{plenaryPower(a,n-1)*plenaryPower(a,n-1)} for \\spad{n>1} and \\spad{a} for \\spad{n=1}."))) NIL NIL -(-763 R) +(-762 R) ((|constructor| (NIL "NonAssociativeAlgebra is the category of non associative algebras (modules which are themselves non associative rngs). Axioms \\indented{3}{r*(a*b) = (r*a)*b = a*(r*b)}")) (|plenaryPower| (($ $ (|PositiveInteger|)) "\\spad{plenaryPower(a,n)} is recursively defined to be \\spad{plenaryPower(a,n-1)*plenaryPower(a,n-1)} for \\spad{n>1} and \\spad{a} for \\spad{n=1}."))) -((-4419 . T) (-4418 . T)) +((-4418 . T) (-4417 . T)) NIL -(-764) +(-763) ((|constructor| (NIL "This package uses the NAG Library to compute the zeros of a polynomial with real or complex coefficients. See \\downlink{Manual Page}{\\spad{manpageXXc02}}.")) (|c02agf| (((|Result|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Boolean|) (|Integer|)) "\\spad{c02agf(a,n,scale,ifail)} finds all the roots of a real polynomial equation,{} using a variant of Laguerre's Method. See \\downlink{Manual Page}{manpageXXc02agf}.")) (|c02aff| (((|Result|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Boolean|) (|Integer|)) "\\spad{c02aff(a,n,scale,ifail)} finds all the roots of a complex polynomial equation,{} using a variant of Laguerre's Method. See \\downlink{Manual Page}{manpageXXc02aff}."))) NIL NIL -(-765) +(-764) ((|constructor| (NIL "This package uses the NAG Library to calculate real zeros of continuous real functions of one or more variables. (Complex equations must be expressed in terms of the equivalent larger system of real equations.) See \\downlink{Manual Page}{\\spad{manpageXXc05}}.")) (|c05pbf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp35| FCN)))) "\\spad{c05pbf(n,ldfjac,lwa,x,xtol,ifail,fcn)} is an easy-to-use routine to find a solution of a system of nonlinear equations by a modification of the Powell hybrid method. The user must provide the Jacobian. See \\downlink{Manual Page}{manpageXXc05pbf}.")) (|c05nbf| (((|Result|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp6| FCN)))) "\\spad{c05nbf(n,lwa,x,xtol,ifail,fcn)} is an easy-to-use routine to find a solution of a system of nonlinear equations by a modification of the Powell hybrid method. See \\downlink{Manual Page}{manpageXXc05nbf}.")) (|c05adf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp1| F)))) "\\spad{c05adf(a,b,eps,eta,ifail,f)} locates a zero of a continuous function in a given interval by a combination of the methods of linear interpolation,{} extrapolation and bisection. See \\downlink{Manual Page}{manpageXXc05adf}."))) NIL NIL -(-766) +(-765) ((|constructor| (NIL "This package uses the NAG Library to calculate the discrete Fourier transform of a sequence of real or complex data values,{} and applies it to calculate convolutions and correlations. See \\downlink{Manual Page}{\\spad{manpageXXc06}}.")) (|c06gsf| (((|Result|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{c06gsf(m,n,x,ifail)} takes \\spad{m} Hermitian sequences,{} each containing \\spad{n} data values,{} and forms the real and imaginary parts of the \\spad{m} corresponding complex sequences. See \\downlink{Manual Page}{manpageXXc06gsf}.")) (|c06gqf| (((|Result|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{c06gqf(m,n,x,ifail)} forms the complex conjugates,{} each containing \\spad{n} data values. See \\downlink{Manual Page}{manpageXXc06gqf}.")) (|c06gcf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{c06gcf(n,y,ifail)} forms the complex conjugate of a sequence of \\spad{n} data values. See \\downlink{Manual Page}{manpageXXc06gcf}.")) (|c06gbf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{c06gbf(n,x,ifail)} forms the complex conjugate of \\spad{n} data values. See \\downlink{Manual Page}{manpageXXc06gbf}.")) (|c06fuf| (((|Result|) (|Integer|) (|Integer|) (|String|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{c06fuf(m,n,init,x,y,trigm,trign,ifail)} computes the two-dimensional discrete Fourier transform of a bivariate sequence of complex data values. This routine is designed to be particularly efficient on vector processors. See \\downlink{Manual Page}{manpageXXc06fuf}.")) (|c06frf| (((|Result|) (|Integer|) (|Integer|) (|String|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{c06frf(m,n,init,x,y,trig,ifail)} computes the discrete Fourier transforms of \\spad{m} sequences,{} each containing \\spad{n} complex data values. This routine is designed to be particularly efficient on vector processors. See \\downlink{Manual Page}{manpageXXc06frf}.")) (|c06fqf| (((|Result|) (|Integer|) (|Integer|) (|String|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{c06fqf(m,n,init,x,trig,ifail)} computes the discrete Fourier transforms of \\spad{m} Hermitian sequences,{} each containing \\spad{n} complex data values. This routine is designed to be particularly efficient on vector processors. See \\downlink{Manual Page}{manpageXXc06fqf}.")) (|c06fpf| (((|Result|) (|Integer|) (|Integer|) (|String|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{c06fpf(m,n,init,x,trig,ifail)} computes the discrete Fourier transforms of \\spad{m} sequences,{} each containing \\spad{n} real data values. This routine is designed to be particularly efficient on vector processors. See \\downlink{Manual Page}{manpageXXc06fpf}.")) (|c06ekf| (((|Result|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{c06ekf(job,n,x,y,ifail)} calculates the circular convolution of two real vectors of period \\spad{n}. No extra workspace is required. See \\downlink{Manual Page}{manpageXXc06ekf}.")) (|c06ecf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{c06ecf(n,x,y,ifail)} calculates the discrete Fourier transform of a sequence of \\spad{n} complex data values. (No extra workspace required.) See \\downlink{Manual Page}{manpageXXc06ecf}.")) (|c06ebf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{c06ebf(n,x,ifail)} calculates the discrete Fourier transform of a Hermitian sequence of \\spad{n} complex data values. (No extra workspace required.) See \\downlink{Manual Page}{manpageXXc06ebf}.")) (|c06eaf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{c06eaf(n,x,ifail)} calculates the discrete Fourier transform of a sequence of \\spad{n} real data values. (No extra workspace required.) See \\downlink{Manual Page}{manpageXXc06eaf}."))) NIL NIL -(-767) +(-766) ((|constructor| (NIL "This package uses the NAG Library to calculate the numerical value of definite integrals in one or more dimensions and to evaluate weights and abscissae of integration rules. See \\downlink{Manual Page}{\\spad{manpageXXd01}}.")) (|d01gbf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp4| FUNCTN)))) "\\spad{d01gbf(ndim,a,b,maxcls,eps,lenwrk,mincls,wrkstr,ifail,functn)} returns an approximation to the integral of a function over a hyper-rectangular region,{} using a Monte Carlo method. An approximate relative error estimate is also returned. This routine is suitable for low accuracy work. See \\downlink{Manual Page}{manpageXXd01gbf}.")) (|d01gaf| (((|Result|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|)) "\\spad{d01gaf(x,y,n,ifail)} integrates a function which is specified numerically at four or more points,{} over the whole of its specified range,{} using third-order finite-difference formulae with error estimates,{} according to a method due to Gill and Miller. See \\downlink{Manual Page}{manpageXXd01gaf}.")) (|d01fcf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp4| FUNCTN)))) "\\spad{d01fcf(ndim,a,b,maxpts,eps,lenwrk,minpts,ifail,functn)} attempts to evaluate a multi-dimensional integral (up to 15 dimensions),{} with constant and finite limits,{} to a specified relative accuracy,{} using an adaptive subdivision strategy. See \\downlink{Manual Page}{manpageXXd01fcf}.")) (|d01bbf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{d01bbf(a,b,itype,n,gtype,ifail)} returns the weight appropriate to a Gaussian quadrature. The formulae provided are Gauss-Legendre,{} Gauss-Rational,{} Gauss- Laguerre and Gauss-Hermite. See \\downlink{Manual Page}{manpageXXd01bbf}.")) (|d01asf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp1| G)))) "\\spad{d01asf(a,omega,key,epsabs,limlst,lw,liw,ifail,g)} calculates an approximation to the sine or the cosine transform of a function \\spad{g} over [a,{}infty): See \\downlink{Manual Page}{manpageXXd01asf}.")) (|d01aqf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp1| G)))) "\\spad{d01aqf(a,b,c,epsabs,epsrel,lw,liw,ifail,g)} calculates an approximation to the Hilbert transform of a function \\spad{g}(\\spad{x}) over [a,{}\\spad{b}]: See \\downlink{Manual Page}{manpageXXd01aqf}.")) (|d01apf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp1| G)))) "\\spad{d01apf(a,b,alfa,beta,key,epsabs,epsrel,lw,liw,ifail,g)} is an adaptive integrator which calculates an approximation to the integral of a function \\spad{g}(\\spad{x})\\spad{w}(\\spad{x}) over a finite interval [a,{}\\spad{b}]: See \\downlink{Manual Page}{manpageXXd01apf}.")) (|d01anf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp1| G)))) "\\spad{d01anf(a,b,omega,key,epsabs,epsrel,lw,liw,ifail,g)} calculates an approximation to the sine or the cosine transform of a function \\spad{g} over [a,{}\\spad{b}]: See \\downlink{Manual Page}{manpageXXd01anf}.")) (|d01amf| (((|Result|) (|DoubleFloat|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp1| F)))) "\\spad{d01amf(bound,inf,epsabs,epsrel,lw,liw,ifail,f)} calculates an approximation to the integral of a function \\spad{f}(\\spad{x}) over an infinite or semi-infinite interval [a,{}\\spad{b}]: See \\downlink{Manual Page}{manpageXXd01amf}.")) (|d01alf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp1| F)))) "\\spad{d01alf(a,b,npts,points,epsabs,epsrel,lw,liw,ifail,f)} is a general purpose integrator which calculates an approximation to the integral of a function \\spad{f}(\\spad{x}) over a finite interval [a,{}\\spad{b}]: See \\downlink{Manual Page}{manpageXXd01alf}.")) (|d01akf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp1| F)))) "\\spad{d01akf(a,b,epsabs,epsrel,lw,liw,ifail,f)} is an adaptive integrator,{} especially suited to oscillating,{} non-singular integrands,{} which calculates an approximation to the integral of a function \\spad{f}(\\spad{x}) over a finite interval [a,{}\\spad{b}]: See \\downlink{Manual Page}{manpageXXd01akf}.")) (|d01ajf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp1| F)))) "\\spad{d01ajf(a,b,epsabs,epsrel,lw,liw,ifail,f)} is a general-purpose integrator which calculates an approximation to the integral of a function \\spad{f}(\\spad{x}) over a finite interval [a,{}\\spad{b}]: See \\downlink{Manual Page}{manpageXXd01ajf}."))) NIL NIL -(-768) +(-767) ((|constructor| (NIL "This package uses the NAG Library to calculate the numerical solution of ordinary differential equations. There are two main types of problem,{} those in which all boundary conditions are specified at one point (initial-value problems),{} and those in which the boundary conditions are distributed between two or more points (boundary- value problems and eigenvalue problems). Routines are available for initial-value problems,{} two-point boundary-value problems and Sturm-Liouville eigenvalue problems. See \\downlink{Manual Page}{\\spad{manpageXXd02}}.")) (|d02raf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp41| FCN JACOBF JACEPS))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp42| G JACOBG JACGEP)))) "\\spad{d02raf(n,mnp,numbeg,nummix,tol,init,iy,ijac,lwork,liwork,np,x,y,deleps,ifail,fcn,g)} solves the two-point boundary-value problem with general boundary conditions for a system of ordinary differential equations,{} using a deferred correction technique and Newton iteration. See \\downlink{Manual Page}{manpageXXd02raf}.")) (|d02kef| (((|Result|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|DoubleFloat|) (|Integer|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp10| COEFFN))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp80| BDYVAL))) (|FileName|) (|FileName|)) "\\spad{d02kef(xpoint,m,k,tol,maxfun,match,elam,delam,hmax,maxit,ifail,coeffn,bdyval,monit,report)} finds a specified eigenvalue of a regular singular second- order Sturm-Liouville system on a finite or infinite range,{} using a Pruefer transformation and a shooting method. It also reports values of the eigenfunction and its derivatives. Provision is made for discontinuities in the coefficient functions or their derivatives. See \\downlink{Manual Page}{manpageXXd02kef}. Files \\spad{monit} and \\spad{report} will be used to define the subroutines for the MONIT and REPORT arguments. See \\downlink{Manual Page}{manpageXXd02gbf}.") (((|Result|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|DoubleFloat|) (|Integer|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp10| COEFFN))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp80| BDYVAL)))) "\\spad{d02kef(xpoint,m,k,tol,maxfun,match,elam,delam,hmax,maxit,ifail,coeffn,bdyval)} finds a specified eigenvalue of a regular singular second- order Sturm-Liouville system on a finite or infinite range,{} using a Pruefer transformation and a shooting method. It also reports values of the eigenfunction and its derivatives. Provision is made for discontinuities in the coefficient functions or their derivatives. See \\downlink{Manual Page}{manpageXXd02kef}. ASP domains \\spad{Asp12} and \\spad{Asp33} are used to supply default subroutines for the MONIT and REPORT arguments via their \\axiomOp{outputAsFortran} operation.")) (|d02gbf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp77| FCNF))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp78| FCNG)))) "\\spad{d02gbf(a,b,n,tol,mnp,lw,liw,c,d,gam,x,np,ifail,fcnf,fcng)} solves a general linear two-point boundary value problem for a system of ordinary differential equations using a deferred correction technique. See \\downlink{Manual Page}{manpageXXd02gbf}.")) (|d02gaf| (((|Result|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp7| FCN)))) "\\spad{d02gaf(u,v,n,a,b,tol,mnp,lw,liw,x,np,ifail,fcn)} solves the two-point boundary-value problem with assigned boundary values for a system of ordinary differential equations,{} using a deferred correction technique and a Newton iteration. See \\downlink{Manual Page}{manpageXXd02gaf}.")) (|d02ejf| (((|Result|) (|DoubleFloat|) (|Integer|) (|Integer|) (|String|) (|Integer|) (|DoubleFloat|) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp9| G))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp7| FCN))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp31| PEDERV))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp8| OUTPUT)))) "\\spad{d02ejf(xend,m,n,relabs,iw,x,y,tol,ifail,g,fcn,pederv,output)} integrates a stiff system of first-order ordinary differential equations over an interval with suitable initial conditions,{} using a variable-order,{} variable-step method implementing the Backward Differentiation Formulae (BDF),{} until a user-specified function,{} if supplied,{} of the solution is zero,{} and returns the solution at points specified by the user,{} if desired. See \\downlink{Manual Page}{manpageXXd02ejf}.")) (|d02cjf| (((|Result|) (|DoubleFloat|) (|Integer|) (|Integer|) (|DoubleFloat|) (|String|) (|DoubleFloat|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp9| G))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp7| FCN))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp8| OUTPUT)))) "\\spad{d02cjf(xend,m,n,tol,relabs,x,y,ifail,g,fcn,output)} integrates a system of first-order ordinary differential equations over a range with suitable initial conditions,{} using a variable-order,{} variable-step Adams method until a user-specified function,{} if supplied,{} of the solution is zero,{} and returns the solution at points specified by the user,{} if desired. See \\downlink{Manual Page}{manpageXXd02cjf}.")) (|d02bhf| (((|Result|) (|DoubleFloat|) (|Integer|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp9| G))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp7| FCN)))) "\\spad{d02bhf(xend,n,irelab,hmax,x,y,tol,ifail,g,fcn)} integrates a system of first-order ordinary differential equations over an interval with suitable initial conditions,{} using a Runge-Kutta-Merson method,{} until a user-specified function of the solution is zero. See \\downlink{Manual Page}{manpageXXd02bhf}.")) (|d02bbf| (((|Result|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|DoubleFloat|) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp7| FCN))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp8| OUTPUT)))) "\\spad{d02bbf(xend,m,n,irelab,x,y,tol,ifail,fcn,output)} integrates a system of first-order ordinary differential equations over an interval with suitable initial conditions,{} using a Runge-Kutta-Merson method,{} and returns the solution at points specified by the user. See \\downlink{Manual Page}{manpageXXd02bbf}."))) NIL NIL -(-769) +(-768) ((|constructor| (NIL "This package uses the NAG Library to solve partial differential equations. See \\downlink{Manual Page}{\\spad{manpageXXd03}}.")) (|d03faf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|ThreeDimensionalMatrix| (|DoubleFloat|)) (|Integer|)) "\\spad{d03faf(xs,xf,l,lbdcnd,bdxs,bdxf,ys,yf,m,mbdcnd,bdys,bdyf,zs,zf,n,nbdcnd,bdzs,bdzf,lambda,ldimf,mdimf,lwrk,f,ifail)} solves the Helmholtz equation in Cartesian co-ordinates in three dimensions using the standard seven-point finite difference approximation. This routine is designed to be particularly efficient on vector processors. See \\downlink{Manual Page}{manpageXXd03faf}.")) (|d03eef| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|String|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp73| PDEF))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp74| BNDY)))) "\\spad{d03eef(xmin,xmax,ymin,ymax,ngx,ngy,lda,scheme,ifail,pdef,bndy)} discretizes a second order elliptic partial differential equation (PDE) on a rectangular region. See \\downlink{Manual Page}{manpageXXd03eef}.")) (|d03edf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|DoubleFloat|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{d03edf(ngx,ngy,lda,maxit,acc,iout,a,rhs,ub,ifail)} solves seven-diagonal systems of linear equations which arise from the discretization of an elliptic partial differential equation on a rectangular region. This routine uses a multigrid technique. See \\downlink{Manual Page}{manpageXXd03edf}."))) NIL NIL -(-770) +(-769) ((|constructor| (NIL "This package uses the NAG Library to calculate the interpolation of a function of one or two variables. When provided with the value of the function (and possibly one or more of its lowest-order derivatives) at each of a number of values of the variable(\\spad{s}),{} the routines provide either an interpolating function or an interpolated value. For some of the interpolating functions,{} there are supporting routines to evaluate,{} differentiate or integrate them. See \\downlink{Manual Page}{\\spad{manpageXXe01}}.")) (|e01sff| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|) (|Integer|)) "\\spad{e01sff(m,x,y,f,rnw,fnodes,px,py,ifail)} evaluates at a given point the two-dimensional interpolating function computed by E01SEF. See \\downlink{Manual Page}{manpageXXe01sff}.")) (|e01sef| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|)) "\\spad{e01sef(m,x,y,f,nw,nq,rnw,rnq,ifail)} generates a two-dimensional surface interpolating a set of scattered data points,{} using a modified Shepard method. See \\downlink{Manual Page}{manpageXXe01sef}.")) (|e01sbf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|Integer|)) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|) (|Integer|)) "\\spad{e01sbf(m,x,y,f,triang,grads,px,py,ifail)} evaluates at a given point the two-dimensional interpolant function computed by E01SAF. See \\downlink{Manual Page}{manpageXXe01sbf}.")) (|e01saf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{e01saf(m,x,y,f,ifail)} generates a two-dimensional surface interpolating a set of scattered data points,{} using the method of Renka and Cline. See \\downlink{Manual Page}{manpageXXe01saf}.")) (|e01daf| (((|Result|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{e01daf(mx,my,x,y,f,ifail)} computes a bicubic spline interpolating surface through a set of data values,{} given on a rectangular grid in the \\spad{x}-\\spad{y} plane. See \\downlink{Manual Page}{manpageXXe01daf}.")) (|e01bhf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|) (|Integer|)) "\\spad{e01bhf(n,x,f,d,a,b,ifail)} evaluates the definite integral of a piecewise cubic Hermite interpolant over the interval [a,{}\\spad{b}]. See \\downlink{Manual Page}{manpageXXe01bhf}.")) (|e01bgf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{e01bgf(n,x,f,d,m,px,ifail)} evaluates a piecewise cubic Hermite interpolant and its first derivative at a set of points. See \\downlink{Manual Page}{manpageXXe01bgf}.")) (|e01bff| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{e01bff(n,x,f,d,m,px,ifail)} evaluates a piecewise cubic Hermite interpolant at a set of points. See \\downlink{Manual Page}{manpageXXe01bff}.")) (|e01bef| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{e01bef(n,x,f,ifail)} computes a monotonicity-preserving piecewise cubic Hermite interpolant to a set of data points. See \\downlink{Manual Page}{manpageXXe01bef}.")) (|e01baf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|Integer|)) "\\spad{e01baf(m,x,y,lck,lwrk,ifail)} determines a cubic spline to a given set of data. See \\downlink{Manual Page}{manpageXXe01baf}."))) NIL NIL -(-771) +(-770) ((|constructor| (NIL "This package uses the NAG Library to find a function which approximates a set of data points. Typically the data contain random errors,{} as of experimental measurement,{} which need to be smoothed out. To seek an approximation to the data,{} it is first necessary to specify for the approximating function a mathematical form (a polynomial,{} for example) which contains a number of unspecified coefficients: the appropriate fitting routine then derives for the coefficients the values which provide the best fit of that particular form. The package deals mainly with curve and surface fitting (\\spadignore{i.e.} fitting with functions of one and of two variables) when a polynomial or a cubic spline is used as the fitting function,{} since these cover the most common needs. However,{} fitting with other functions and/or more variables can be undertaken by means of general linear or nonlinear routines (some of which are contained in other packages) depending on whether the coefficients in the function occur linearly or nonlinearly. Cases where a graph rather than a set of data points is given can be treated simply by first reading a suitable set of points from the graph. The package also contains routines for evaluating,{} differentiating and integrating polynomial and spline curves and surfaces,{} once the numerical values of their coefficients have been determined. See \\downlink{Manual Page}{\\spad{manpageXXe02}}.")) (|e02zaf| (((|Result|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|Integer|)) "\\spad{e02zaf(px,py,lamda,mu,m,x,y,npoint,nadres,ifail)} sorts two-dimensional data into rectangular panels. See \\downlink{Manual Page}{manpageXXe02zaf}.")) (|e02gaf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|DoubleFloat|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{e02gaf(m,la,nplus2,toler,a,b,ifail)} calculates an \\spad{l} solution to an over-determined system of \\indented{22}{1} linear equations. See \\downlink{Manual Page}{manpageXXe02gaf}.")) (|e02dff| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|Integer|)) "\\spad{e02dff(mx,my,px,py,x,y,lamda,mu,c,lwrk,liwrk,ifail)} calculates values of a bicubic spline representation. The spline is evaluated at all points on a rectangular grid. See \\downlink{Manual Page}{manpageXXe02dff}.")) (|e02def| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{e02def(m,px,py,x,y,lamda,mu,c,ifail)} calculates values of a bicubic spline representation. See \\downlink{Manual Page}{manpageXXe02def}.")) (|e02ddf| (((|Result|) (|String|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{e02ddf(start,m,x,y,f,w,s,nxest,nyest,lwrk,liwrk,nx,lamda,ny,mu,wrk,ifail)} computes a bicubic spline approximation to a set of scattered data are located automatically,{} but a single parameter must be specified to control the trade-off between closeness of fit and smoothness of fit. See \\downlink{Manual Page}{manpageXXe02ddf}.")) (|e02dcf| (((|Result|) (|String|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|Integer|)) (|Integer|)) "\\spad{e02dcf(start,mx,x,my,y,f,s,nxest,nyest,lwrk,liwrk,nx,lamda,ny,mu,wrk,iwrk,ifail)} computes a bicubic spline approximation to a set of data values,{} given on a rectangular grid in the \\spad{x}-\\spad{y} plane. The knots of the spline are located automatically,{} but a single parameter must be specified to control the trade-off between closeness of fit and smoothness of fit. See \\downlink{Manual Page}{manpageXXe02dcf}.")) (|e02daf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|Integer|)) (|Integer|) (|Integer|) (|Integer|) (|DoubleFloat|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{e02daf(m,px,py,x,y,f,w,mu,point,npoint,nc,nws,eps,lamda,ifail)} forms a minimal,{} weighted least-squares bicubic spline surface fit with prescribed knots to a given set of data points. See \\downlink{Manual Page}{manpageXXe02daf}.")) (|e02bef| (((|Result|) (|String|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|Integer|))) "\\spad{e02bef(start,m,x,y,w,s,nest,lwrk,n,lamda,ifail,wrk,iwrk)} computes a cubic spline approximation to an arbitrary set of data points. The knot are located automatically,{} but a single parameter must be specified to control the trade-off between closeness of fit and smoothness of fit. See \\downlink{Manual Page}{manpageXXe02bef}.")) (|e02bdf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{e02bdf(ncap7,lamda,c,ifail)} computes the definite integral from its \\spad{B}-spline representation. See \\downlink{Manual Page}{manpageXXe02bdf}.")) (|e02bcf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|Integer|) (|Integer|)) "\\spad{e02bcf(ncap7,lamda,c,x,left,ifail)} evaluates a cubic spline and its first three derivatives from its \\spad{B}-spline representation. See \\downlink{Manual Page}{manpageXXe02bcf}.")) (|e02bbf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|Integer|)) "\\spad{e02bbf(ncap7,lamda,c,x,ifail)} evaluates a cubic spline representation. See \\downlink{Manual Page}{manpageXXe02bbf}.")) (|e02baf| (((|Result|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{e02baf(m,ncap7,x,y,w,lamda,ifail)} computes a weighted least-squares approximation to an arbitrary set of data points by a cubic splines prescribed by the user. Cubic spline can also be carried out. See \\downlink{Manual Page}{manpageXXe02baf}.")) (|e02akf| (((|Result|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|DoubleFloat|) (|Integer|)) "\\spad{e02akf(np1,xmin,xmax,a,ia1,la,x,ifail)} evaluates a polynomial from its Chebyshev-series representation,{} allowing an arbitrary index increment for accessing the array of coefficients. See \\downlink{Manual Page}{manpageXXe02akf}.")) (|e02ajf| (((|Result|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{e02ajf(np1,xmin,xmax,a,ia1,la,qatm1,iaint1,laint,ifail)} determines the coefficients in the Chebyshev-series representation of the indefinite integral of a polynomial given in Chebyshev-series form. See \\downlink{Manual Page}{manpageXXe02ajf}.")) (|e02ahf| (((|Result|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{e02ahf(np1,xmin,xmax,a,ia1,la,iadif1,ladif,ifail)} determines the coefficients in the Chebyshev-series representation of the derivative of a polynomial given in Chebyshev-series form. See \\downlink{Manual Page}{manpageXXe02ahf}.")) (|e02agf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|Integer|)) (|Integer|) (|Integer|) (|Integer|)) "\\spad{e02agf(m,kplus1,nrows,xmin,xmax,x,y,w,mf,xf,yf,lyf,ip,lwrk,liwrk,ifail)} computes constrained weighted least-squares polynomial approximations in Chebyshev-series form to an arbitrary set of data points. The values of the approximations and any number of their derivatives can be specified at selected points. See \\downlink{Manual Page}{manpageXXe02agf}.")) (|e02aef| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|DoubleFloat|) (|Integer|)) "\\spad{e02aef(nplus1,a,xcap,ifail)} evaluates a polynomial from its Chebyshev-series representation. See \\downlink{Manual Page}{manpageXXe02aef}.")) (|e02adf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{e02adf(m,kplus1,nrows,x,y,w,ifail)} computes weighted least-squares polynomial approximations to an arbitrary set of data points. See \\downlink{Manual Page}{manpageXXe02adf}."))) NIL NIL -(-772) +(-771) ((|constructor| (NIL "This package uses the NAG Library to perform optimization. An optimization problem involves minimizing a function (called the objective function) of several variables,{} possibly subject to restrictions on the values of the variables defined by a set of constraint functions. The routines in the NAG Foundation Library are concerned with function minimization only,{} since the problem of maximizing a given function can be transformed into a minimization problem simply by multiplying the function by \\spad{-1}. See \\downlink{Manual Page}{\\spad{manpageXXe04}}.")) (|e04ycf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|DoubleFloat|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{e04ycf(job,m,n,fsumsq,s,lv,v,ifail)} returns estimates of elements of the variance matrix of the estimated regression coefficients for a nonlinear least squares problem. The estimates are derived from the Jacobian of the function \\spad{f}(\\spad{x}) at the solution. See \\downlink{Manual Page}{manpageXXe04ycf}.")) (|e04ucf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|Boolean|) (|DoubleFloat|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|Boolean|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Boolean|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|Integer|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp55| CONFUN))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp49| OBJFUN)))) "\\spad{e04ucf(n,nclin,ncnln,nrowa,nrowj,nrowr,a,bl,bu,liwork,lwork,sta,cra,der,fea,fun,hes,infb,infs,linf,lint,list,maji,majp,mini,minp,mon,nonf,opt,ste,stao,stac,stoo,stoc,ve,istate,cjac,clamda,r,x,ifail,confun,objfun)} is designed to minimize an arbitrary smooth function subject to constraints on the variables,{} linear constraints. (E04UCF may be used for unconstrained,{} bound-constrained and linearly constrained optimization.) The user must provide subroutines that define the objective and constraint functions and as many of their first partial derivatives as possible. Unspecified derivatives are approximated by finite differences. All matrices are treated as dense,{} and hence E04UCF is not intended for large sparse problems. See \\downlink{Manual Page}{manpageXXe04ucf}.")) (|e04naf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|DoubleFloat|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Boolean|) (|Boolean|) (|Boolean|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|Integer|)) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp20| QPHESS)))) "\\spad{e04naf(itmax,msglvl,n,nclin,nctotl,nrowa,nrowh,ncolh,bigbnd,a,bl,bu,cvec,featol,hess,cold,lpp,orthog,liwork,lwork,x,istate,ifail,qphess)} is a comprehensive programming (QP) or linear programming (LP) problems. It is not intended for large sparse problems. See \\downlink{Manual Page}{manpageXXe04naf}.")) (|e04mbf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Boolean|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{e04mbf(itmax,msglvl,n,nclin,nctotl,nrowa,a,bl,bu,cvec,linobj,liwork,lwork,x,ifail)} is an easy-to-use routine for solving linear programming problems,{} or for finding a feasible point for such problems. It is not intended for large sparse problems. See \\downlink{Manual Page}{manpageXXe04mbf}.")) (|e04jaf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp24| FUNCT1)))) "\\spad{e04jaf(n,ibound,liw,lw,bl,bu,x,ifail,funct1)} is an easy-to-use quasi-Newton algorithm for finding a minimum of a function \\spad{F}(\\spad{x} ,{}\\spad{x} ,{}...,{}\\spad{x} ),{} subject to fixed upper and \\indented{25}{1\\space{2}2\\space{6}\\spad{n}} lower bounds of the independent variables \\spad{x} ,{}\\spad{x} ,{}...,{}\\spad{x} ,{} using \\indented{43}{1\\space{2}2\\space{6}\\spad{n}} function values only. See \\downlink{Manual Page}{manpageXXe04jaf}.")) (|e04gcf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp19| LSFUN2)))) "\\spad{e04gcf(m,n,liw,lw,x,ifail,lsfun2)} is an easy-to-use quasi-Newton algorithm for finding an unconstrained minimum of \\spad{m} nonlinear functions in \\spad{n} variables (m>=n). First derivatives are required. See \\downlink{Manual Page}{manpageXXe04gcf}.")) (|e04fdf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp50| LSFUN1)))) "\\spad{e04fdf(m,n,liw,lw,x,ifail,lsfun1)} is an easy-to-use algorithm for finding an unconstrained minimum of a sum of squares of \\spad{m} nonlinear functions in \\spad{n} variables (m>=n). No derivatives are required. See \\downlink{Manual Page}{manpageXXe04fdf}.")) (|e04dgf| (((|Result|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|DoubleFloat|) (|Boolean|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp49| OBJFUN)))) "\\spad{e04dgf(n,es,fu,it,lin,list,ma,op,pr,sta,sto,ve,x,ifail,objfun)} minimizes an unconstrained nonlinear function of several variables using a pre-conditioned,{} limited memory quasi-Newton conjugate gradient method. First derivatives are required. The routine is intended for use on large scale problems. See \\downlink{Manual Page}{manpageXXe04dgf}."))) NIL NIL -(-773) +(-772) ((|constructor| (NIL "This package uses the NAG Library to provide facilities for matrix factorizations and associated transformations. See \\downlink{Manual Page}{\\spad{manpageXXf01}}.")) (|f01ref| (((|Result|) (|String|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|Complex| (|DoubleFloat|))) (|Matrix| (|Complex| (|DoubleFloat|))) (|Integer|)) "\\spad{f01ref(wheret,m,n,ncolq,lda,theta,a,ifail)} returns the first \\spad{ncolq} columns of the complex \\spad{m} by \\spad{m} unitary matrix \\spad{Q},{} where \\spad{Q} is given as the product of Householder transformation matrices. See \\downlink{Manual Page}{manpageXXf01ref}.")) (|f01rdf| (((|Result|) (|String|) (|String|) (|Integer|) (|Integer|) (|Matrix| (|Complex| (|DoubleFloat|))) (|Integer|) (|Matrix| (|Complex| (|DoubleFloat|))) (|Integer|) (|Integer|) (|Matrix| (|Complex| (|DoubleFloat|))) (|Integer|)) "\\spad{f01rdf(trans,wheret,m,n,a,lda,theta,ncolb,ldb,b,ifail)} performs one of the transformations See \\downlink{Manual Page}{manpageXXf01rdf}.")) (|f01rcf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|Complex| (|DoubleFloat|))) (|Integer|)) "\\spad{f01rcf(m,n,lda,a,ifail)} finds the QR factorization of the complex \\spad{m} by \\spad{n} matrix A,{} where m>=n. See \\downlink{Manual Page}{manpageXXf01rcf}.")) (|f01qef| (((|Result|) (|String|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f01qef(wheret,m,n,ncolq,lda,zeta,a,ifail)} returns the first \\spad{ncolq} columns of the real \\spad{m} by \\spad{m} orthogonal matrix \\spad{Q},{} where \\spad{Q} is given as the product of Householder transformation matrices. See \\downlink{Manual Page}{manpageXXf01qef}.")) (|f01qdf| (((|Result|) (|String|) (|String|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f01qdf(trans,wheret,m,n,a,lda,zeta,ncolb,ldb,b,ifail)} performs one of the transformations See \\downlink{Manual Page}{manpageXXf01qdf}.")) (|f01qcf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f01qcf(m,n,lda,a,ifail)} finds the QR factorization of the real \\spad{m} by \\spad{n} matrix A,{} where m>=n. See \\downlink{Manual Page}{manpageXXf01qcf}.")) (|f01mcf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|Integer|)) (|Integer|)) "\\spad{f01mcf(n,avals,lal,nrow,ifail)} computes the Cholesky factorization of a real symmetric positive-definite variable-bandwidth matrix. See \\downlink{Manual Page}{manpageXXf01mcf}.")) (|f01maf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|List| (|Boolean|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|Integer|)) (|Matrix| (|Integer|)) (|DoubleFloat|) (|DoubleFloat|) (|Integer|)) "\\spad{f01maf(n,nz,licn,lirn,abort,avals,irn,icn,droptl,densw,ifail)} computes an incomplete Cholesky factorization of a real sparse symmetric positive-definite matrix A. See \\downlink{Manual Page}{manpageXXf01maf}.")) (|f01bsf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|Integer|)) (|Matrix| (|Integer|)) (|Matrix| (|Integer|)) (|Matrix| (|Integer|)) (|Boolean|) (|DoubleFloat|) (|Boolean|) (|Matrix| (|Integer|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f01bsf(n,nz,licn,ivect,jvect,icn,ikeep,grow,eta,abort,idisp,avals,ifail)} factorizes a real sparse matrix using the pivotal sequence previously obtained by F01BRF when a matrix of the same sparsity pattern was factorized. See \\downlink{Manual Page}{manpageXXf01bsf}.")) (|f01brf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|DoubleFloat|) (|Boolean|) (|Boolean|) (|List| (|Boolean|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|Integer|)) (|Matrix| (|Integer|)) (|Integer|)) "\\spad{f01brf(n,nz,licn,lirn,pivot,lblock,grow,abort,a,irn,icn,ifail)} factorizes a real sparse matrix. The routine either forms the LU factorization of a permutation of the entire matrix,{} or,{} optionally,{} first permutes the matrix to block lower triangular form and then only factorizes the diagonal blocks. See \\downlink{Manual Page}{manpageXXf01brf}."))) NIL NIL -(-774) +(-773) ((|constructor| (NIL "This package uses the NAG Library to compute \\begin{items} \\item eigenvalues and eigenvectors of a matrix \\item eigenvalues and eigenvectors of generalized matrix eigenvalue problems \\item singular values and singular vectors of a matrix. \\end{items} See \\downlink{Manual Page}{\\spad{manpageXXf02}}.")) (|f02xef| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Boolean|) (|Integer|) (|Boolean|) (|Integer|) (|Matrix| (|Complex| (|DoubleFloat|))) (|Matrix| (|Complex| (|DoubleFloat|))) (|Integer|)) "\\spad{f02xef(m,n,lda,ncolb,ldb,wantq,ldq,wantp,ldph,a,b,ifail)} returns all,{} or part,{} of the singular value decomposition of a general complex matrix. See \\downlink{Manual Page}{manpageXXf02xef}.")) (|f02wef| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Boolean|) (|Integer|) (|Boolean|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f02wef(m,n,lda,ncolb,ldb,wantq,ldq,wantp,ldpt,a,b,ifail)} returns all,{} or part,{} of the singular value decomposition of a general real matrix. See \\downlink{Manual Page}{manpageXXf02wef}.")) (|f02fjf| (((|Result|) (|Integer|) (|Integer|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp27| DOT))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp28| IMAGE))) (|FileName|)) "\\spad{f02fjf(n,k,tol,novecs,nrx,lwork,lrwork,liwork,m,noits,x,ifail,dot,image,monit)} finds eigenvalues of a real sparse symmetric or generalized symmetric eigenvalue problem. See \\downlink{Manual Page}{manpageXXf02fjf}.") (((|Result|) (|Integer|) (|Integer|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp27| DOT))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp28| IMAGE)))) "\\spad{f02fjf(n,k,tol,novecs,nrx,lwork,lrwork,liwork,m,noits,x,ifail,dot,image)} finds eigenvalues of a real sparse symmetric or generalized symmetric eigenvalue problem. See \\downlink{Manual Page}{manpageXXf02fjf}.")) (|f02bjf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|DoubleFloat|) (|Boolean|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f02bjf(n,ia,ib,eps1,matv,iv,a,b,ifail)} calculates all the eigenvalues and,{} if required,{} all the eigenvectors of the generalized eigenproblem Ax=(lambda)Bx where A and \\spad{B} are real,{} square matrices,{} using the QZ algorithm. See \\downlink{Manual Page}{manpageXXf02bjf}.")) (|f02bbf| (((|Result|) (|Integer|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f02bbf(ia,n,alb,ub,m,iv,a,ifail)} calculates selected eigenvalues of a real symmetric matrix by reduction to tridiagonal form,{} bisection and inverse iteration,{} where the selected eigenvalues lie within a given interval. See \\downlink{Manual Page}{manpageXXf02bbf}.")) (|f02axf| (((|Result|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{f02axf(ar,iar,ai,iai,n,ivr,ivi,ifail)} calculates all the eigenvalues of a complex Hermitian matrix. See \\downlink{Manual Page}{manpageXXf02axf}.")) (|f02awf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f02awf(iar,iai,n,ar,ai,ifail)} calculates all the eigenvalues of a complex Hermitian matrix. See \\downlink{Manual Page}{manpageXXf02awf}.")) (|f02akf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f02akf(iar,iai,n,ivr,ivi,ar,ai,ifail)} calculates all the eigenvalues of a complex matrix. See \\downlink{Manual Page}{manpageXXf02akf}.")) (|f02ajf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f02ajf(iar,iai,n,ar,ai,ifail)} calculates all the eigenvalue. See \\downlink{Manual Page}{manpageXXf02ajf}.")) (|f02agf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f02agf(ia,n,ivr,ivi,a,ifail)} calculates all the eigenvalues of a real unsymmetric matrix. See \\downlink{Manual Page}{manpageXXf02agf}.")) (|f02aff| (((|Result|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f02aff(ia,n,a,ifail)} calculates all the eigenvalues of a real unsymmetric matrix. See \\downlink{Manual Page}{manpageXXf02aff}.")) (|f02aef| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f02aef(ia,ib,n,iv,a,b,ifail)} calculates all the eigenvalues of Ax=(lambda)Bx,{} where A is a real symmetric matrix and \\spad{B} is a real symmetric positive-definite matrix. See \\downlink{Manual Page}{manpageXXf02aef}.")) (|f02adf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f02adf(ia,ib,n,a,b,ifail)} calculates all the eigenvalues of Ax=(lambda)Bx,{} where A is a real symmetric matrix and \\spad{B} is a real symmetric positive- definite matrix. See \\downlink{Manual Page}{manpageXXf02adf}.")) (|f02abf| (((|Result|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{f02abf(a,ia,n,iv,ifail)} calculates all the eigenvalues of a real symmetric matrix. See \\downlink{Manual Page}{manpageXXf02abf}.")) (|f02aaf| (((|Result|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f02aaf(ia,n,a,ifail)} calculates all the eigenvalue. See \\downlink{Manual Page}{manpageXXf02aaf}."))) NIL NIL -(-775) +(-774) ((|constructor| (NIL "This package uses the NAG Library to solve the matrix equation \\axiom{AX=B},{} where \\axiom{\\spad{B}} may be a single vector or a matrix of multiple right-hand sides. The matrix \\axiom{A} may be real,{} complex,{} symmetric,{} Hermitian positive- definite,{} or sparse. It may also be rectangular,{} in which case a least-squares solution is obtained. See \\downlink{Manual Page}{\\spad{manpageXXf04}}.")) (|f04qaf| (((|Result|) (|Integer|) (|Integer|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp30| APROD)))) "\\spad{f04qaf(m,n,damp,atol,btol,conlim,itnlim,msglvl,lrwork,liwork,b,ifail,aprod)} solves sparse unsymmetric equations,{} sparse linear least- squares problems and sparse damped linear least-squares problems,{} using a Lanczos algorithm. See \\downlink{Manual Page}{manpageXXf04qaf}.")) (|f04mcf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|Integer|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{f04mcf(n,al,lal,d,nrow,ir,b,nrb,iselct,nrx,ifail)} computes the approximate solution of a system of real linear equations with multiple right-hand sides,{} AX=B,{} where A is a symmetric positive-definite variable-bandwidth matrix,{} which has previously been factorized by F01MCF. Related systems may also be solved. See \\downlink{Manual Page}{manpageXXf04mcf}.")) (|f04mbf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Boolean|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|DoubleFloat|) (|Integer|) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp28| APROD))) (|Union| (|:| |fn| (|FileName|)) (|:| |fp| (|Asp34| MSOLVE)))) "\\spad{f04mbf(n,b,precon,shift,itnlim,msglvl,lrwork,liwork,rtol,ifail,aprod,msolve)} solves a system of real sparse symmetric linear equations using a Lanczos algorithm. See \\downlink{Manual Page}{manpageXXf04mbf}.")) (|f04maf| (((|Result|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|Integer|)) (|Integer|) (|Matrix| (|Integer|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|Integer|)) (|Matrix| (|Integer|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|Integer|)) (|Integer|)) "\\spad{f04maf(n,nz,avals,licn,irn,lirn,icn,wkeep,ikeep,inform,b,acc,noits,ifail)} \\spad{e} a sparse symmetric positive-definite system of linear equations,{} Ax=b,{} using a pre-conditioned conjugate gradient method,{} where A has been factorized by F01MAF. See \\downlink{Manual Page}{manpageXXf04maf}.")) (|f04jgf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|DoubleFloat|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f04jgf(m,n,nra,tol,lwork,a,b,ifail)} finds the solution of a linear least-squares problem,{} Ax=b ,{} where A is a real \\spad{m} by \\spad{n} (m>=n) matrix and \\spad{b} is an \\spad{m} element vector. If the matrix of observations is not of full rank,{} then the minimal least-squares solution is returned. See \\downlink{Manual Page}{manpageXXf04jgf}.")) (|f04faf| (((|Result|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f04faf(job,n,d,e,b,ifail)} calculates the approximate solution of a set of real symmetric positive-definite tridiagonal linear equations. See \\downlink{Manual Page}{manpageXXf04faf}.")) (|f04axf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|Integer|)) (|Matrix| (|Integer|)) (|Integer|) (|Matrix| (|Integer|)) (|Matrix| (|DoubleFloat|))) "\\spad{f04axf(n,a,licn,icn,ikeep,mtype,idisp,rhs)} calculates the approximate solution of a set of real sparse linear equations with a single right-hand side,{} Ax=b or \\indented{1}{\\spad{T}} A x=b,{} where A has been factorized by F01BRF or F01BSF. See \\downlink{Manual Page}{manpageXXf04axf}.")) (|f04atf| (((|Result|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|Integer|)) "\\spad{f04atf(a,ia,b,n,iaa,ifail)} calculates the accurate solution of a set of real linear equations with a single right-hand side,{} using an LU factorization with partial pivoting,{} and iterative refinement. See \\downlink{Manual Page}{manpageXXf04atf}.")) (|f04asf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f04asf(ia,b,n,a,ifail)} calculates the accurate solution of a set of real symmetric positive-definite linear equations with a single right- hand side,{} Ax=b,{} using a Cholesky factorization and iterative refinement. See \\downlink{Manual Page}{manpageXXf04asf}.")) (|f04arf| (((|Result|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|)) "\\spad{f04arf(ia,b,n,a,ifail)} calculates the approximate solution of a set of real linear equations with a single right-hand side,{} using an LU factorization with partial pivoting. See \\downlink{Manual Page}{manpageXXf04arf}.")) (|f04adf| (((|Result|) (|Integer|) (|Matrix| (|Complex| (|DoubleFloat|))) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|Complex| (|DoubleFloat|))) (|Integer|)) "\\spad{f04adf(ia,b,ib,n,m,ic,a,ifail)} calculates the approximate solution of a set of complex linear equations with multiple right-hand sides,{} using an LU factorization with partial pivoting. See \\downlink{Manual Page}{manpageXXf04adf}."))) NIL NIL -(-776) +(-775) ((|constructor| (NIL "This package uses the NAG Library to compute matrix factorizations,{} and to solve systems of linear equations following the matrix factorizations. See \\downlink{Manual Page}{\\spad{manpageXXf07}}.")) (|f07fef| (((|Result|) (|String|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|))) "\\spad{f07fef(uplo,n,nrhs,a,lda,ldb,b)} (DPOTRS) solves a real symmetric positive-definite system of linear equations with multiple right-hand sides,{} AX=B,{} where A has been factorized by F07FDF (DPOTRF). See \\downlink{Manual Page}{manpageXXf07fef}.")) (|f07fdf| (((|Result|) (|String|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|))) "\\spad{f07fdf(uplo,n,lda,a)} (DPOTRF) computes the Cholesky factorization of a real symmetric positive-definite matrix. See \\downlink{Manual Page}{manpageXXf07fdf}.")) (|f07aef| (((|Result|) (|String|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|)) (|Integer|) (|Matrix| (|Integer|)) (|Integer|) (|Matrix| (|DoubleFloat|))) "\\spad{f07aef(trans,n,nrhs,a,lda,ipiv,ldb,b)} (DGETRS) solves a real system of linear equations with \\indented{36}{\\spad{T}} multiple right-hand sides,{} AX=B or A X=B,{} where A has been factorized by F07ADF (DGETRF). See \\downlink{Manual Page}{manpageXXf07aef}.")) (|f07adf| (((|Result|) (|Integer|) (|Integer|) (|Integer|) (|Matrix| (|DoubleFloat|))) "\\spad{f07adf(m,n,lda,a)} (DGETRF) computes the LU factorization of a real \\spad{m} by \\spad{n} matrix. See \\downlink{Manual Page}{manpageXXf07adf}."))) NIL NIL -(-777) +(-776) ((|constructor| (NIL "This package uses the NAG Library to compute some commonly occurring physical and mathematical functions. See \\downlink{Manual Page}{manpageXXs}.")) (|s21bdf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|)) "\\spad{s21bdf(x,y,z,r,ifail)} returns a value of the symmetrised elliptic integral of the third kind,{} via the routine name. See \\downlink{Manual Page}{manpageXXs21bdf}.")) (|s21bcf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|)) "\\spad{s21bcf(x,y,z,ifail)} returns a value of the symmetrised elliptic integral of the second kind,{} via the routine name. See \\downlink{Manual Page}{manpageXXs21bcf}.")) (|s21bbf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|)) "\\spad{s21bbf(x,y,z,ifail)} returns a value of the symmetrised elliptic integral of the first kind,{} via the routine name. See \\downlink{Manual Page}{manpageXXs21bbf}.")) (|s21baf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|)) "\\spad{s21baf(x,y,ifail)} returns a value of an elementary integral,{} which occurs as a degenerate case of an elliptic integral of the first kind,{} via the routine name. See \\downlink{Manual Page}{manpageXXs21baf}.")) (|s20adf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s20adf(x,ifail)} returns a value for the Fresnel Integral \\spad{C}(\\spad{x}),{} via the routine name. See \\downlink{Manual Page}{manpageXXs20adf}.")) (|s20acf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s20acf(x,ifail)} returns a value for the Fresnel Integral \\spad{S}(\\spad{x}),{} via the routine name. See \\downlink{Manual Page}{manpageXXs20acf}.")) (|s19adf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s19adf(x,ifail)} returns a value for the Kelvin function kei(\\spad{x}) via the routine name. See \\downlink{Manual Page}{manpageXXs19adf}.")) (|s19acf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s19acf(x,ifail)} returns a value for the Kelvin function ker(\\spad{x}),{} via the routine name. See \\downlink{Manual Page}{manpageXXs19acf}.")) (|s19abf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s19abf(x,ifail)} returns a value for the Kelvin function bei(\\spad{x}) via the routine name. See \\downlink{Manual Page}{manpageXXs19abf}.")) (|s19aaf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s19aaf(x,ifail)} returns a value for the Kelvin function ber(\\spad{x}) via the routine name. See \\downlink{Manual Page}{manpageXXs19aaf}.")) (|s18def| (((|Result|) (|DoubleFloat|) (|Complex| (|DoubleFloat|)) (|Integer|) (|String|) (|Integer|)) "\\spad{s18def(fnu,z,n,scale,ifail)} returns a sequence of values for the modified Bessel functions \\indented{1}{\\spad{I}\\space{6}(\\spad{z}) for complex \\spad{z},{} non-negative (nu) and} \\indented{2}{(nu)+n} \\spad{n=0},{}1,{}...,{}\\spad{N}-1,{} with an option for exponential scaling. See \\downlink{Manual Page}{manpageXXs18def}.")) (|s18dcf| (((|Result|) (|DoubleFloat|) (|Complex| (|DoubleFloat|)) (|Integer|) (|String|) (|Integer|)) "\\spad{s18dcf(fnu,z,n,scale,ifail)} returns a sequence of values for the modified Bessel functions \\indented{1}{\\spad{K}\\space{6}(\\spad{z}) for complex \\spad{z},{} non-negative (nu) and} \\indented{2}{(nu)+n} \\spad{n=0},{}1,{}...,{}\\spad{N}-1,{} with an option for exponential scaling. See \\downlink{Manual Page}{manpageXXs18dcf}.")) (|s18aff| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s18aff(x,ifail)} returns a value for the modified Bessel Function \\indented{1}{\\spad{I} (\\spad{x}),{} via the routine name.} \\indented{2}{1} See \\downlink{Manual Page}{manpageXXs18aff}.")) (|s18aef| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s18aef(x,ifail)} returns the value of the modified Bessel Function \\indented{1}{\\spad{I} (\\spad{x}),{} via the routine name.} \\indented{2}{0} See \\downlink{Manual Page}{manpageXXs18aef}.")) (|s18adf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s18adf(x,ifail)} returns the value of the modified Bessel Function \\indented{1}{\\spad{K} (\\spad{x}),{} via the routine name.} \\indented{2}{1} See \\downlink{Manual Page}{manpageXXs18adf}.")) (|s18acf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s18acf(x,ifail)} returns the value of the modified Bessel Function \\indented{1}{\\spad{K} (\\spad{x}),{} via the routine name.} \\indented{2}{0} See \\downlink{Manual Page}{manpageXXs18acf}.")) (|s17dlf| (((|Result|) (|Integer|) (|DoubleFloat|) (|Complex| (|DoubleFloat|)) (|Integer|) (|String|) (|Integer|)) "\\spad{s17dlf(m,fnu,z,n,scale,ifail)} returns a sequence of values for the Hankel functions \\indented{2}{(1)\\space{11}(2)} \\indented{1}{\\spad{H}\\space{6}(\\spad{z}) or \\spad{H}\\space{6}(\\spad{z}) for complex \\spad{z},{} non-negative (nu) and} \\indented{2}{(nu)+n\\space{8}(nu)+n} \\spad{n=0},{}1,{}...,{}\\spad{N}-1,{} with an option for exponential scaling. See \\downlink{Manual Page}{manpageXXs17dlf}.")) (|s17dhf| (((|Result|) (|String|) (|Complex| (|DoubleFloat|)) (|String|) (|Integer|)) "\\spad{s17dhf(deriv,z,scale,ifail)} returns the value of the Airy function \\spad{Bi}(\\spad{z}) or its derivative Bi'(\\spad{z}) for complex \\spad{z},{} with an option for exponential scaling. See \\downlink{Manual Page}{manpageXXs17dhf}.")) (|s17dgf| (((|Result|) (|String|) (|Complex| (|DoubleFloat|)) (|String|) (|Integer|)) "\\spad{s17dgf(deriv,z,scale,ifail)} returns the value of the Airy function \\spad{Ai}(\\spad{z}) or its derivative Ai'(\\spad{z}) for complex \\spad{z},{} with an option for exponential scaling. See \\downlink{Manual Page}{manpageXXs17dgf}.")) (|s17def| (((|Result|) (|DoubleFloat|) (|Complex| (|DoubleFloat|)) (|Integer|) (|String|) (|Integer|)) "\\spad{s17def(fnu,z,n,scale,ifail)} returns a sequence of values for the Bessel functions \\indented{1}{\\spad{J}\\space{6}(\\spad{z}) for complex \\spad{z},{} non-negative (nu) and \\spad{n=0},{}1,{}...,{}\\spad{N}-1,{}} \\indented{2}{(nu)+n} with an option for exponential scaling. See \\downlink{Manual Page}{manpageXXs17def}.")) (|s17dcf| (((|Result|) (|DoubleFloat|) (|Complex| (|DoubleFloat|)) (|Integer|) (|String|) (|Integer|)) "\\spad{s17dcf(fnu,z,n,scale,ifail)} returns a sequence of values for the Bessel functions \\indented{1}{\\spad{Y}\\space{6}(\\spad{z}) for complex \\spad{z},{} non-negative (nu) and \\spad{n=0},{}1,{}...,{}\\spad{N}-1,{}} \\indented{2}{(nu)+n} with an option for exponential scaling. See \\downlink{Manual Page}{manpageXXs17dcf}.")) (|s17akf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s17akf(x,ifail)} returns a value for the derivative of the Airy function \\spad{Bi}(\\spad{x}),{} via the routine name. See \\downlink{Manual Page}{manpageXXs17akf}.")) (|s17ajf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s17ajf(x,ifail)} returns a value of the derivative of the Airy function \\spad{Ai}(\\spad{x}),{} via the routine name. See \\downlink{Manual Page}{manpageXXs17ajf}.")) (|s17ahf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s17ahf(x,ifail)} returns a value of the Airy function,{} \\spad{Bi}(\\spad{x}),{} via the routine name. See \\downlink{Manual Page}{manpageXXs17ahf}.")) (|s17agf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s17agf(x,ifail)} returns a value for the Airy function,{} \\spad{Ai}(\\spad{x}),{} via the routine name. See \\downlink{Manual Page}{manpageXXs17agf}.")) (|s17aff| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s17aff(x,ifail)} returns the value of the Bessel Function \\indented{1}{\\spad{J} (\\spad{x}),{} via the routine name.} \\indented{2}{1} See \\downlink{Manual Page}{manpageXXs17aff}.")) (|s17aef| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s17aef(x,ifail)} returns the value of the Bessel Function \\indented{1}{\\spad{J} (\\spad{x}),{} via the routine name.} \\indented{2}{0} See \\downlink{Manual Page}{manpageXXs17aef}.")) (|s17adf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s17adf(x,ifail)} returns the value of the Bessel Function \\indented{1}{\\spad{Y} (\\spad{x}),{} via the routine name.} \\indented{2}{1} See \\downlink{Manual Page}{manpageXXs17adf}.")) (|s17acf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s17acf(x,ifail)} returns the value of the Bessel Function \\indented{1}{\\spad{Y} (\\spad{x}),{} via the routine name.} \\indented{2}{0} See \\downlink{Manual Page}{manpageXXs17acf}.")) (|s15aef| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s15aef(x,ifail)} returns the value of the error function erf(\\spad{x}),{} via the routine name. See \\downlink{Manual Page}{manpageXXs15aef}.")) (|s15adf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s15adf(x,ifail)} returns the value of the complementary error function,{} erfc(\\spad{x}),{} via the routine name. See \\downlink{Manual Page}{manpageXXs15adf}.")) (|s14baf| (((|Result|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|)) "\\spad{s14baf(a,x,tol,ifail)} computes values for the incomplete gamma functions \\spad{P}(a,{}\\spad{x}) and \\spad{Q}(a,{}\\spad{x}). See \\downlink{Manual Page}{manpageXXs14baf}.")) (|s14abf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s14abf(x,ifail)} returns a value for the log,{} ln(Gamma(\\spad{x})),{} via the routine name. See \\downlink{Manual Page}{manpageXXs14abf}.")) (|s14aaf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s14aaf(x,ifail)} returns the value of the Gamma function (Gamma)(\\spad{x}),{} via the routine name. See \\downlink{Manual Page}{manpageXXs14aaf}.")) (|s13adf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s13adf(x,ifail)} returns the value of the sine integral See \\downlink{Manual Page}{manpageXXs13adf}.")) (|s13acf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s13acf(x,ifail)} returns the value of the cosine integral See \\downlink{Manual Page}{manpageXXs13acf}.")) (|s13aaf| (((|Result|) (|DoubleFloat|) (|Integer|)) "\\spad{s13aaf(x,ifail)} returns the value of the exponential integral \\indented{1}{\\spad{E} (\\spad{x}),{} via the routine name.} \\indented{2}{1} See \\downlink{Manual Page}{manpageXXs13aaf}.")) (|s01eaf| (((|Result|) (|Complex| (|DoubleFloat|)) (|Integer|)) "\\spad{s01eaf(z,ifail)} S01EAF evaluates the exponential function exp(\\spad{z}) ,{} for complex \\spad{z}. See \\downlink{Manual Page}{manpageXXs01eaf}."))) NIL NIL -(-778) +(-777) ((|constructor| (NIL "Support functions for the NAG Library Link functions")) (|restorePrecision| (((|Void|)) "\\spad{restorePrecision()} \\undocumented{}")) (|checkPrecision| (((|Boolean|)) "\\spad{checkPrecision()} \\undocumented{}")) (|dimensionsOf| (((|SExpression|) (|Symbol|) (|Matrix| (|Integer|))) "\\spad{dimensionsOf(s,m)} \\undocumented{}") (((|SExpression|) (|Symbol|) (|Matrix| (|DoubleFloat|))) "\\spad{dimensionsOf(s,m)} \\undocumented{}")) (|aspFilename| (((|String|) (|String|)) "\\spad{aspFilename(\"f\")} returns a String consisting of \\spad{\"f\"} suffixed with \\indented{1}{an extension identifying the current AXIOM session.}")) (|fortranLinkerArgs| (((|String|)) "\\spad{fortranLinkerArgs()} returns the current linker arguments")) (|fortranCompilerName| (((|String|)) "\\spad{fortranCompilerName()} returns the name of the currently selected \\indented{1}{Fortran compiler}"))) NIL NIL -(-779 S) +(-778 S) ((|constructor| (NIL "NonAssociativeRng is a basic ring-type structure,{} not necessarily commutative or associative,{} and not necessarily with unit. Axioms \\indented{2}{x*(y+z) = x*y + x*z} \\indented{2}{(x+y)*z = x*z + y*z} Common Additional Axioms \\indented{2}{noZeroDivisors\\space{2}ab = 0 => \\spad{a=0} or \\spad{b=0}}")) (|antiCommutator| (($ $ $) "\\spad{antiCommutator(a,b)} returns \\spad{a*b+b*a}.")) (|commutator| (($ $ $) "\\spad{commutator(a,b)} returns \\spad{a*b-b*a}.")) (|associator| (($ $ $ $) "\\spad{associator(a,b,c)} returns \\spad{(a*b)*c-a*(b*c)}."))) NIL NIL -(-780) +(-779) ((|constructor| (NIL "NonAssociativeRng is a basic ring-type structure,{} not necessarily commutative or associative,{} and not necessarily with unit. Axioms \\indented{2}{x*(y+z) = x*y + x*z} \\indented{2}{(x+y)*z = x*z + y*z} Common Additional Axioms \\indented{2}{noZeroDivisors\\space{2}ab = 0 => \\spad{a=0} or \\spad{b=0}}")) (|antiCommutator| (($ $ $) "\\spad{antiCommutator(a,b)} returns \\spad{a*b+b*a}.")) (|commutator| (($ $ $) "\\spad{commutator(a,b)} returns \\spad{a*b-b*a}.")) (|associator| (($ $ $ $) "\\spad{associator(a,b,c)} returns \\spad{(a*b)*c-a*(b*c)}."))) NIL NIL -(-781 S) +(-780 S) ((|constructor| (NIL "A NonAssociativeRing is a non associative rng which has a unit,{} the multiplication is not necessarily commutative or associative.")) (|coerce| (($ (|Integer|)) "\\spad{coerce(n)} coerces the integer \\spad{n} to an element of the ring.")) (|characteristic| (((|NonNegativeInteger|)) "\\spad{characteristic()} returns the characteristic of the ring."))) NIL NIL -(-782) +(-781) ((|constructor| (NIL "A NonAssociativeRing is a non associative rng which has a unit,{} the multiplication is not necessarily commutative or associative.")) (|coerce| (($ (|Integer|)) "\\spad{coerce(n)} coerces the integer \\spad{n} to an element of the ring.")) (|characteristic| (((|NonNegativeInteger|)) "\\spad{characteristic()} returns the characteristic of the ring."))) NIL NIL -(-783 |Par|) +(-782 |Par|) ((|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 -(-784 -3494) +(-783 -3493) ((|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 -(-785 P -3494) +(-784 P -3493) ((|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 -(-786 T$) +(-785 T$) NIL NIL NIL -(-787 UP -3494) +(-786 UP -3493) ((|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 -(-788) +(-787) ((|retract| (((|Union| (|:| |nia| (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |mdnia| (|Record| (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|List| (|Segment| (|OrderedCompletion| (|DoubleFloat|))))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|))))) $) "\\spad{retract(x)} \\undocumented{}")) (|coerce| (($ (|Union| (|:| |nia| (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |mdnia| (|Record| (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|List| (|Segment| (|OrderedCompletion| (|DoubleFloat|))))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))))) "\\spad{coerce(x)} \\undocumented{}") (($ (|Record| (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|List| (|Segment| (|OrderedCompletion| (|DoubleFloat|))))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{coerce(x)} \\undocumented{}") (($ (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{coerce(x)} \\undocumented{}"))) NIL NIL -(-789 R) +(-788 R) ((|constructor| (NIL "NonLinearSolvePackage is an interface to \\spadtype{SystemSolvePackage} that attempts to retract the coefficients of the equations before solving. The solutions are given in the algebraic closure of \\spad{R} whenever possible.")) (|solve| (((|List| (|List| (|Equation| (|Fraction| (|Polynomial| |#1|))))) (|List| (|Polynomial| |#1|))) "\\spad{solve(lp)} finds the solution in the algebraic closure of \\spad{R} of the list \\spad{lp} of rational functions with respect to all the symbols appearing in \\spad{lp}.") (((|List| (|List| (|Equation| (|Fraction| (|Polynomial| |#1|))))) (|List| (|Polynomial| |#1|)) (|List| (|Symbol|))) "\\spad{solve(lp,lv)} finds the solutions in the algebraic closure of \\spad{R} of the list \\spad{lp} of rational functions with respect to the list of symbols \\spad{lv}.")) (|solveInField| (((|List| (|List| (|Equation| (|Fraction| (|Polynomial| |#1|))))) (|List| (|Polynomial| |#1|))) "\\spad{solveInField(lp)} finds the solution of the list \\spad{lp} of rational functions with respect to all the symbols appearing in \\spad{lp}.") (((|List| (|List| (|Equation| (|Fraction| (|Polynomial| |#1|))))) (|List| (|Polynomial| |#1|)) (|List| (|Symbol|))) "\\spad{solveInField(lp,lv)} finds the solutions of the list \\spad{lp} of rational functions with respect to the list of symbols \\spad{lv}."))) NIL NIL -(-790) +(-789) ((|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."))) -(((-4426 "*") . T)) +(((-4425 "*") . T)) NIL -(-791 R -3494) +(-790 R -3493) ((|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 -(-792) +(-791) ((|constructor| (NIL "\\spadtype{None} implements a type with no objects. It is mainly used in technical situations where such a thing is needed (\\spadignore{e.g.} the interpreter and some of the internal \\spadtype{Expression} code)."))) NIL NIL -(-793 S) +(-792 S) ((|constructor| (NIL "\\spadtype{NoneFunctions1} implements functions on \\spadtype{None}. It particular it includes a particulary dangerous coercion from any other type to \\spadtype{None}.")) (|coerce| (((|None|) |#1|) "\\spad{coerce(x)} changes \\spad{x} into an object of type \\spadtype{None}."))) NIL NIL -(-794 R |PolR| E |PolE|) +(-793 R |PolR| E |PolE|) ((|constructor| (NIL "This package implements the norm of a polynomial with coefficients in a monogenic algebra (using resultants)")) (|norm| ((|#2| |#4|) "\\spad{norm q} returns the norm of \\spad{q},{} \\spadignore{i.e.} the product of all the conjugates of \\spad{q}."))) NIL NIL -(-795 R E V P TS) +(-794 R E V P TS) ((|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 -(-796 -3494 |ExtF| |SUEx| |ExtP| |n|) +(-795 -3493 |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 -(-797 BP E OV R P) +(-796 BP E OV R P) ((|constructor| (NIL "Package for the determination of the coefficients in the lifting process. Used by \\spadtype{MultivariateLifting}. This package will work for every euclidean domain \\spad{R} which has property \\spad{F},{} \\spadignore{i.e.} there exists a factor operation in \\spad{R[x]}.")) (|listexp| (((|List| (|NonNegativeInteger|)) |#1|) "\\spad{listexp }\\undocumented")) (|npcoef| (((|Record| (|:| |deter| (|List| (|SparseUnivariatePolynomial| |#5|))) (|:| |dterm| (|List| (|List| (|Record| (|:| |expt| (|NonNegativeInteger|)) (|:| |pcoef| |#5|))))) (|:| |nfacts| (|List| |#1|)) (|:| |nlead| (|List| |#5|))) (|SparseUnivariatePolynomial| |#5|) (|List| |#1|) (|List| |#5|)) "\\spad{npcoef }\\undocumented"))) NIL NIL -(-798 |Par|) +(-797 |Par|) ((|constructor| (NIL "This package computes explicitly eigenvalues and eigenvectors of matrices with entries over the Rational Numbers. The results are expressed as floating numbers or as rational numbers depending on the type of the parameter Par.")) (|realEigenvectors| (((|List| (|Record| (|:| |outval| |#1|) (|:| |outmult| (|Integer|)) (|:| |outvect| (|List| (|Matrix| |#1|))))) (|Matrix| (|Fraction| (|Integer|))) |#1|) "\\spad{realEigenvectors(m,eps)} returns a list of records each one containing a real eigenvalue,{} its algebraic multiplicity,{} and a list of associated eigenvectors. All these results are computed to precision \\spad{eps} as floats or rational numbers depending on the type of \\spad{eps} .")) (|realEigenvalues| (((|List| |#1|) (|Matrix| (|Fraction| (|Integer|))) |#1|) "\\spad{realEigenvalues(m,eps)} computes the eigenvalues of the matrix \\spad{m} to precision \\spad{eps}. The eigenvalues are expressed as floats or rational numbers depending on the type of \\spad{eps} (float or rational).")) (|characteristicPolynomial| (((|Polynomial| (|Fraction| (|Integer|))) (|Matrix| (|Fraction| (|Integer|))) (|Symbol|)) "\\spad{characteristicPolynomial(m,x)} returns the characteristic polynomial of the matrix \\spad{m} expressed as polynomial over RN with variable \\spad{x}. Fraction \\spad{P} RN.") (((|Polynomial| (|Fraction| (|Integer|))) (|Matrix| (|Fraction| (|Integer|)))) "\\spad{characteristicPolynomial(m)} returns the characteristic polynomial of the matrix \\spad{m} expressed as polynomial over RN with a new symbol as variable."))) NIL NIL -(-799 R |VarSet|) +(-798 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."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-928))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547))))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-1197))))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-1197)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-1197))))) (-3956 (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (QUOTE (-558)))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-1197)))) (-2958 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-1197)))))) (-3956 (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (QUOTE (-558)))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-1197)))) (-2958 (|HasCategory| |#1| (QUOTE (-557)))) (-2958 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-1197)))) (-2958 (|HasCategory| |#1| (|%list| (QUOTE -38) (QUOTE (-558))))) (-2958 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-1197)))) (-2958 (|HasCategory| |#1| (|%list| (QUOTE -1011) (QUOTE (-558))))))) (|HasAttribute| |#1| (QUOTE -4422)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) -(-800 R) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-927))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546))))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-1196))))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-1196)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-1196))))) (-3955 (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (QUOTE (-557)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-1196)))) (-2957 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-1196)))))) (-3955 (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (QUOTE (-557)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-1196)))) (-2957 (|HasCategory| |#1| (QUOTE (-556)))) (-2957 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-1196)))) (-2957 (|HasCategory| |#1| (|%list| (QUOTE -38) (QUOTE (-557))))) (-2957 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-1196)))) (-2957 (|HasCategory| |#1| (|%list| (QUOTE -1010) (QUOTE (-557))))))) (|HasAttribute| |#1| (QUOTE -4421)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) +(-799 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)}"))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4420 |has| |#1| (-376)) (-4422 |has| |#1| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-1102) (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-1102) (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-1102) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-1102) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-1102) (|%list| (QUOTE -630) (QUOTE (-547))))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1172))) (|HasCategory| |#1| (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-240))) (|HasAttribute| |#1| (QUOTE -4422)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) -(-801 R S) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4419 |has| |#1| (-376)) (-4421 |has| |#1| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-1101) (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-1101) (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-1101) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-1101) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-1101) (|%list| (QUOTE -629) (QUOTE (-546))))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1171))) (|HasCategory| |#1| (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-240))) (|HasAttribute| |#1| (QUOTE -4421)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) +(-800 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 NIL -(-802 R) +(-801 R) ((|constructor| (NIL "This package provides polynomials as functions on a ring.")) (|eulerE| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{eulerE(n,r)} \\undocumented")) (|bernoulliB| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{bernoulliB(n,r)} \\undocumented")) (|cyclotomic| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{cyclotomic(n,r)} \\undocumented"))) NIL -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558)))))) -(-803 R E V P) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557)))))) +(-802 R E V P) ((|constructor| (NIL "The category of normalized triangular sets. A triangular set \\spad{ts} is said normalized if for every algebraic variable \\spad{v} of \\spad{ts} the polynomial \\spad{select(ts,v)} is normalized \\spad{w}.\\spad{r}.\\spad{t}. every polynomial in \\spad{collectUnder(ts,v)}. A polynomial \\spad{p} is said normalized \\spad{w}.\\spad{r}.\\spad{t}. a non-constant polynomial \\spad{q} if \\spad{p} is constant or \\spad{degree(p,mdeg(q)) = 0} and \\spad{init(p)} is normalized \\spad{w}.\\spad{r}.\\spad{t}. \\spad{q}. One of the important features of normalized triangular sets is that they are regular sets.\\newline References : \\indented{1}{[1] \\spad{D}. LAZARD \"A new method for solving algebraic systems of} \\indented{5}{positive dimension\" Discr. App. Math. 33:147-160,{}1991} \\indented{1}{[2] \\spad{P}. AUBRY,{} \\spad{D}. LAZARD and \\spad{M}. MORENO MAZA \"On the Theories} \\indented{5}{of Triangular Sets\" Journal of Symbol. Comp. (to appear)} \\indented{1}{[3] \\spad{M}. MORENO MAZA and \\spad{R}. RIOBOO \"Computations of gcd over} \\indented{5}{algebraic towers of simple extensions\" In proceedings of \\spad{AAECC11}} \\indented{5}{Paris,{} 1995.} \\indented{1}{[4] \\spad{M}. MORENO MAZA \"Calculs de pgcd au-dessus des tours} \\indented{5}{d'extensions simples et resolution des systemes d'equations} \\indented{5}{algebriques\" These,{} Universite \\spad{P}.etM. Curie,{} Paris,{} 1997.}"))) -((-4425 . T) (-4424 . T)) +((-4424 . T) (-4423 . T)) NIL -(-804 S) +(-803 S) ((|constructor| (NIL "Numeric provides real and complex numerical evaluation functions for various symbolic types.")) (|numericIfCan| (((|Union| (|Float|) "failed") (|Expression| |#1|) (|PositiveInteger|)) "\\spad{numericIfCan(x, n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Float|) "failed") (|Expression| |#1|)) "\\spad{numericIfCan(x)} returns a real approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Float|) "failed") (|Fraction| (|Polynomial| |#1|)) (|PositiveInteger|)) "\\spad{numericIfCan(x,n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Float|) "failed") (|Fraction| (|Polynomial| |#1|))) "\\spad{numericIfCan(x)} returns a real approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Float|) "failed") (|Polynomial| |#1|) (|PositiveInteger|)) "\\spad{numericIfCan(x,n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Float|) "failed") (|Polynomial| |#1|)) "\\spad{numericIfCan(x)} returns a real approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.")) (|complexNumericIfCan| (((|Union| (|Complex| (|Float|)) "failed") (|Expression| (|Complex| |#1|)) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x, n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Expression| (|Complex| |#1|))) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Expression| |#1|) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x, n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Expression| |#1|)) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Fraction| (|Polynomial| (|Complex| |#1|))) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x, n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Fraction| (|Polynomial| (|Complex| |#1|)))) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Fraction| (|Polynomial| |#1|)) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x, n)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Fraction| (|Polynomial| |#1|))) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Polynomial| |#1|) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x, n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Polynomial| |#1|)) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Polynomial| (|Complex| |#1|)) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x, n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Polynomial| (|Complex| |#1|))) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not constant.")) (|complexNumeric| (((|Complex| (|Float|)) (|Expression| (|Complex| |#1|)) (|PositiveInteger|)) "\\spad{complexNumeric(x, n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Expression| (|Complex| |#1|))) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Expression| |#1|) (|PositiveInteger|)) "\\spad{complexNumeric(x, n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Expression| |#1|)) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Fraction| (|Polynomial| (|Complex| |#1|))) (|PositiveInteger|)) "\\spad{complexNumeric(x, n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Fraction| (|Polynomial| (|Complex| |#1|)))) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Fraction| (|Polynomial| |#1|)) (|PositiveInteger|)) "\\spad{complexNumeric(x, n)} returns a complex approximation of \\spad{x}") (((|Complex| (|Float|)) (|Fraction| (|Polynomial| |#1|))) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Polynomial| |#1|) (|PositiveInteger|)) "\\spad{complexNumeric(x, n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Polynomial| |#1|)) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Polynomial| (|Complex| |#1|)) (|PositiveInteger|)) "\\spad{complexNumeric(x, n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Polynomial| (|Complex| |#1|))) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Complex| |#1|) (|PositiveInteger|)) "\\spad{complexNumeric(x, n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Complex| |#1|)) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) |#1| (|PositiveInteger|)) "\\spad{complexNumeric(x, n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) |#1|) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.")) (|numeric| (((|Float|) (|Expression| |#1|) (|PositiveInteger|)) "\\spad{numeric(x, n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Float|) (|Expression| |#1|)) "\\spad{numeric(x)} returns a real approximation of \\spad{x}.") (((|Float|) (|Fraction| (|Polynomial| |#1|)) (|PositiveInteger|)) "\\spad{numeric(x,n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Float|) (|Fraction| (|Polynomial| |#1|))) "\\spad{numeric(x)} returns a real approximation of \\spad{x}.") (((|Float|) (|Polynomial| |#1|) (|PositiveInteger|)) "\\spad{numeric(x,n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Float|) (|Polynomial| |#1|)) "\\spad{numeric(x)} returns a real approximation of \\spad{x}.") (((|Float|) |#1| (|PositiveInteger|)) "\\spad{numeric(x, n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Float|) |#1|) "\\spad{numeric(x)} returns a real approximation of \\spad{x}."))) NIL -((-12 (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-860)))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-1069))) (|HasCategory| |#1| (QUOTE (-175)))) -(-805) +((-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-859)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (QUOTE (-175)))) +(-804) ((|constructor| (NIL "NumberFormats provides function to format and read arabic and roman numbers,{} to convert numbers to strings and to read floating-point numbers.")) (|ScanFloatIgnoreSpacesIfCan| (((|Union| (|Float|) "failed") (|String|)) "\\spad{ScanFloatIgnoreSpacesIfCan(s)} tries to form a floating point number from the string \\spad{s} ignoring any spaces.")) (|ScanFloatIgnoreSpaces| (((|Float|) (|String|)) "\\spad{ScanFloatIgnoreSpaces(s)} forms a floating point number from the string \\spad{s} ignoring any spaces. Error is generated if the string is not recognised as a floating point number.")) (|ScanRoman| (((|PositiveInteger|) (|String|)) "\\spad{ScanRoman(s)} forms an integer from a Roman numeral string \\spad{s}.")) (|FormatRoman| (((|String|) (|PositiveInteger|)) "\\spad{FormatRoman(n)} forms a Roman numeral string from an integer \\spad{n}.")) (|ScanArabic| (((|PositiveInteger|) (|String|)) "\\spad{ScanArabic(s)} forms an integer from an Arabic numeral string \\spad{s}.")) (|FormatArabic| (((|String|) (|PositiveInteger|)) "\\spad{FormatArabic(n)} forms an Arabic numeral string from an integer \\spad{n}."))) NIL NIL -(-806) +(-805) ((|numericalIntegration| (((|Result|) (|Record| (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|List| (|Segment| (|OrderedCompletion| (|DoubleFloat|))))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|))) (|Result|)) "\\spad{numericalIntegration(args,hints)} performs the integration of the function given the strategy or method returned by \\axiomFun{measure}.") (((|Result|) (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|))) (|Result|)) "\\spad{numericalIntegration(args,hints)} performs the integration of the function given the strategy or method returned by \\axiomFun{measure}.")) (|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |explanations| (|String|)) (|:| |extra| (|Result|))) (|RoutinesTable|) (|Record| (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|List| (|Segment| (|OrderedCompletion| (|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.") (((|Record| (|:| |measure| (|Float|)) (|:| |explanations| (|String|)) (|:| |extra| (|Result|))) (|RoutinesTable|) (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|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 -(-807) +(-806) ((|constructor| (NIL "This package is a suite of functions for the numerical integration of an ordinary differential equation of \\spad{n} variables: \\blankline \\indented{8}{\\center{dy/dx = \\spad{f}(\\spad{y},{}\\spad{x})\\space{5}\\spad{y} is an \\spad{n}-vector}} \\blankline \\par All the routines are based on a 4-th order Runge-Kutta kernel. These routines generally have as arguments: \\spad{n},{} the number of dependent variables; \\spad{x1},{} the initial point; \\spad{h},{} the step size; \\spad{y},{} a vector of initial conditions of length \\spad{n} which upon exit contains the solution at \\spad{x1 + h}; \\spad{derivs},{} a function which computes the right hand side of the ordinary differential equation: \\spad{derivs(dydx,y,x)} computes \\spad{dydx},{} a vector which contains the derivative information. \\blankline \\par In order of increasing complexity:\\begin{items} \\blankline \\item \\spad{rk4(y,n,x1,h,derivs)} advances the solution vector to \\spad{x1 + h} and return the values in \\spad{y}. \\blankline \\item \\spad{rk4(y,n,x1,h,derivs,t1,t2,t3,t4)} is the same as \\spad{rk4(y,n,x1,h,derivs)} except that you must provide 4 scratch arrays \\spad{t1}-\\spad{t4} of size \\spad{n}. \\blankline \\item Starting with \\spad{y} at \\spad{x1},{} \\spad{rk4f(y,n,x1,x2,ns,derivs)} uses \\spad{ns} fixed steps of a 4-th order Runge-Kutta integrator to advance the solution vector to \\spad{x2} and return the values in \\spad{y}. Argument \\spad{x2},{} is the final point,{} and \\spad{ns},{} the number of steps to take. \\blankline \\item \\spad{rk4qc(y,n,x1,step,eps,yscal,derivs)} takes a 5-th order Runge-Kutta step with monitoring of local truncation to ensure accuracy and adjust stepsize. The function takes two half steps and one full step and scales the difference in solutions at the final point. If the error is within \\spad{eps},{} the step is taken and the result is returned. If the error is not within \\spad{eps},{} the stepsize if decreased and the procedure is tried again until the desired accuracy is reached. Upon input,{} an trial step size must be given and upon return,{} an estimate of the next step size to use is returned as well as the step size which produced the desired accuracy. The scaled error is computed as \\center{\\spad{error = MAX(ABS((y2steps(i) - y1step(i))/yscal(i)))}} and this is compared against \\spad{eps}. If this is greater than \\spad{eps},{} the step size is reduced accordingly to \\center{\\spad{hnew = 0.9 * hdid * (error/eps)**(-1/4)}} If the error criterion is satisfied,{} then we check if the step size was too fine and return a more efficient one. If \\spad{error > \\spad{eps} * (6.0E-04)} then the next step size should be \\center{\\spad{hnext = 0.9 * hdid * (error/\\spad{eps})**(\\spad{-1/5})}} Otherwise \\spad{hnext = 4.0 * hdid} is returned. A more detailed discussion of this and related topics can be found in the book \"Numerical Recipies\" by \\spad{W}.Press,{} \\spad{B}.\\spad{P}. Flannery,{} \\spad{S}.A. Teukolsky,{} \\spad{W}.\\spad{T}. Vetterling published by Cambridge University Press. Argument \\spad{step} is a record of 3 floating point numbers \\spad{(try , did , next)},{} \\spad{eps} is the required accuracy,{} \\spad{yscal} is the scaling vector for the difference in solutions. On input,{} \\spad{step.try} should be the guess at a step size to achieve the accuracy. On output,{} \\spad{step.did} contains the step size which achieved the accuracy and \\spad{step.next} is the next step size to use. \\blankline \\item \\spad{rk4qc(y,n,x1,step,eps,yscal,derivs,t1,t2,t3,t4,t5,t6,t7)} is the same as \\spad{rk4qc(y,n,x1,step,eps,yscal,derivs)} except that the user must provide the 7 scratch arrays \\spad{t1-t7} of size \\spad{n}. \\blankline \\item \\spad{rk4a(y,n,x1,x2,eps,h,ns,derivs)} is a driver program which uses \\spad{rk4qc} to integrate \\spad{n} ordinary differential equations starting at \\spad{x1} to \\spad{x2},{} keeping the local truncation error to within \\spad{eps} by changing the local step size. The scaling vector is defined as \\center{\\spad{yscal(i) = abs(y(i)) + abs(h*dydx(i)) + tiny}} where \\spad{y(i)} is the solution at location \\spad{x},{} \\spad{dydx} is the ordinary differential equation's right hand side,{} \\spad{h} is the current step size and \\spad{tiny} is 10 times the smallest positive number representable. The user must supply an estimate for a trial step size and the maximum number of calls to \\spad{rk4qc} to use. Argument \\spad{x2} is the final point,{} \\spad{eps} is local truncation,{} \\spad{ns} is the maximum number of call to \\spad{rk4qc} to use. \\end{items}")) (|rk4f| (((|Void|) (|Vector| (|Float|)) (|Integer|) (|Float|) (|Float|) (|Integer|) (|Mapping| (|Void|) (|Vector| (|Float|)) (|Vector| (|Float|)) (|Float|))) "\\spad{rk4f(y,n,x1,x2,ns,derivs)} uses a 4-th order Runge-Kutta method to numerically integrate the ordinary differential equation {\\em dy/dx = f(y,x)} of \\spad{n} variables,{} where \\spad{y} is an \\spad{n}-vector. Starting with \\spad{y} at \\spad{x1},{} this function uses \\spad{ns} fixed steps of a 4-th order Runge-Kutta integrator to advance the solution vector to \\spad{x2} and return the values in \\spad{y}. For details,{} see \\con{NumericalOrdinaryDifferentialEquations}.")) (|rk4qc| (((|Void|) (|Vector| (|Float|)) (|Integer|) (|Float|) (|Record| (|:| |tryValue| (|Float|)) (|:| |did| (|Float|)) (|:| |next| (|Float|))) (|Float|) (|Vector| (|Float|)) (|Mapping| (|Void|) (|Vector| (|Float|)) (|Vector| (|Float|)) (|Float|)) (|Vector| (|Float|)) (|Vector| (|Float|)) (|Vector| (|Float|)) (|Vector| (|Float|)) (|Vector| (|Float|)) (|Vector| (|Float|)) (|Vector| (|Float|))) "\\spad{rk4qc(y,n,x1,step,eps,yscal,derivs,t1,t2,t3,t4,t5,t6,t7)} is a subfunction for the numerical integration of an ordinary differential equation {\\em dy/dx = f(y,x)} of \\spad{n} variables,{} where \\spad{y} is an \\spad{n}-vector using a 4-th order Runge-Kutta method. This function takes a 5-th order Runge-Kutta \\spad{step} with monitoring of local truncation to ensure accuracy and adjust stepsize. For details,{} see \\con{NumericalOrdinaryDifferentialEquations}.") (((|Void|) (|Vector| (|Float|)) (|Integer|) (|Float|) (|Record| (|:| |tryValue| (|Float|)) (|:| |did| (|Float|)) (|:| |next| (|Float|))) (|Float|) (|Vector| (|Float|)) (|Mapping| (|Void|) (|Vector| (|Float|)) (|Vector| (|Float|)) (|Float|))) "\\spad{rk4qc(y,n,x1,step,eps,yscal,derivs)} is a subfunction for the numerical integration of an ordinary differential equation {\\em dy/dx = f(y,x)} of \\spad{n} variables,{} where \\spad{y} is an \\spad{n}-vector using a 4-th order Runge-Kutta method. This function takes a 5-th order Runge-Kutta \\spad{step} with monitoring of local truncation to ensure accuracy and adjust stepsize. For details,{} see \\con{NumericalOrdinaryDifferentialEquations}.")) (|rk4a| (((|Void|) (|Vector| (|Float|)) (|Integer|) (|Float|) (|Float|) (|Float|) (|Float|) (|Integer|) (|Mapping| (|Void|) (|Vector| (|Float|)) (|Vector| (|Float|)) (|Float|))) "\\spad{rk4a(y,n,x1,x2,eps,h,ns,derivs)} is a driver function for the numerical integration of an ordinary differential equation {\\em dy/dx = f(y,x)} of \\spad{n} variables,{} where \\spad{y} is an \\spad{n}-vector using a 4-th order Runge-Kutta method. For details,{} see \\con{NumericalOrdinaryDifferentialEquations}.")) (|rk4| (((|Void|) (|Vector| (|Float|)) (|Integer|) (|Float|) (|Float|) (|Mapping| (|Void|) (|Vector| (|Float|)) (|Vector| (|Float|)) (|Float|)) (|Vector| (|Float|)) (|Vector| (|Float|)) (|Vector| (|Float|)) (|Vector| (|Float|))) "\\spad{rk4(y,n,x1,h,derivs,t1,t2,t3,t4)} is the same as \\spad{rk4(y,n,x1,h,derivs)} except that you must provide 4 scratch arrays \\spad{t1}-\\spad{t4} of size \\spad{n}. For details,{} see \\con{NumericalOrdinaryDifferentialEquations}.") (((|Void|) (|Vector| (|Float|)) (|Integer|) (|Float|) (|Float|) (|Mapping| (|Void|) (|Vector| (|Float|)) (|Vector| (|Float|)) (|Float|))) "\\spad{rk4(y,n,x1,h,derivs)} uses a 4-th order Runge-Kutta method to numerically integrate the ordinary differential equation {\\em dy/dx = f(y,x)} of \\spad{n} variables,{} where \\spad{y} is an \\spad{n}-vector. Argument \\spad{y} is a vector of initial conditions of length \\spad{n} which upon exit contains the solution at \\spad{x1 + h},{} \\spad{n} is the number of dependent variables,{} \\spad{x1} is the initial point,{} \\spad{h} is the step size,{} and \\spad{derivs} is a function which computes the right hand side of the ordinary differential equation. For details,{} see \\spadtype{NumericalOrdinaryDifferentialEquations}."))) NIL NIL -(-808) +(-807) ((|constructor| (NIL "This suite of routines performs numerical quadrature using algorithms derived from the basic trapezoidal rule. Because the error term of this rule contains only even powers of the step size (for open and closed versions),{} fast convergence can be obtained if the integrand is sufficiently smooth. \\blankline Each routine returns a Record of type TrapAns,{} which contains\\indent{3} \\newline value (\\spadtype{Float}):\\tab{20} estimate of the integral \\newline error (\\spadtype{Float}):\\tab{20} estimate of the error in the computation \\newline totalpts (\\spadtype{Integer}):\\tab{20} total number of function evaluations \\newline success (\\spadtype{Boolean}):\\tab{20} if the integral was computed within the user specified error criterion \\indent{0}\\indent{0} To produce this estimate,{} each routine generates an internal sequence of sub-estimates,{} denoted by {\\em S(i)},{} depending on the routine,{} to which the various convergence criteria are applied. The user must supply a relative accuracy,{} \\spad{eps_r},{} and an absolute accuracy,{} \\spad{eps_a}. Convergence is obtained when either \\center{\\spad{ABS(S(i) - S(i-1)) < eps_r * ABS(S(i-1))}} \\center{or \\spad{ABS(S(i) - S(i-1)) < eps_a}} are \\spad{true} statements. \\blankline The routines come in three families and three flavors: \\newline\\tab{3} closed:\\tab{20}romberg,{}\\tab{30}simpson,{}\\tab{42}trapezoidal \\newline\\tab{3} open: \\tab{20}rombergo,{}\\tab{30}simpsono,{}\\tab{42}trapezoidalo \\newline\\tab{3} adaptive closed:\\tab{20}aromberg,{}\\tab{30}asimpson,{}\\tab{42}atrapezoidal \\par The {\\em S(i)} for the trapezoidal family is the value of the integral using an equally spaced absicca trapezoidal rule for that level of refinement. \\par The {\\em S(i)} for the simpson family is the value of the integral using an equally spaced absicca simpson rule for that level of refinement. \\par The {\\em S(i)} for the romberg family is the estimate of the integral using an equally spaced absicca romberg method. For the \\spad{i}\\spad{-}th level,{} this is an appropriate combination of all the previous trapezodial estimates so that the error term starts with the \\spad{2*(i+1)} power only. \\par The three families come in a closed version,{} where the formulas include the endpoints,{} an open version where the formulas do not include the endpoints and an adaptive version,{} where the user is required to input the number of subintervals over which the appropriate closed family integrator will apply with the usual convergence parmeters for each subinterval. This is useful where a large number of points are needed only in a small fraction of the entire domain. \\par Each routine takes as arguments: \\newline \\spad{f}\\tab{10} integrand \\newline a\\tab{10} starting point \\newline \\spad{b}\\tab{10} ending point \\newline \\spad{eps_r}\\tab{10} relative error \\newline \\spad{eps_a}\\tab{10} absolute error \\newline \\spad{nmin} \\tab{10} refinement level when to start checking for convergence (> 1) \\newline \\spad{nmax} \\tab{10} maximum level of refinement \\par The adaptive routines take as an additional parameter \\newline \\spad{nint}\\tab{10} the number of independent intervals to apply a closed \\indented{1}{family integrator of the same name.} \\par Notes: \\newline Closed family level \\spad{i} uses \\spad{1 + 2**i} points. \\newline Open family level \\spad{i} uses \\spad{1 + 3**i} points.")) (|trapezoidalo| (((|Record| (|:| |value| (|Float|)) (|:| |error| (|Float|)) (|:| |totalpts| (|Integer|)) (|:| |success| (|Boolean|))) (|Mapping| (|Float|) (|Float|)) (|Float|) (|Float|) (|Float|) (|Float|) (|Integer|) (|Integer|)) "\\spad{trapezoidalo(fn,a,b,epsrel,epsabs,nmin,nmax)} uses the trapezoidal method to numerically integrate function \\spad{fn} over the open interval from \\spad{a} to \\spad{b},{} with relative accuracy \\spad{epsrel} and absolute accuracy \\spad{epsabs},{} with the refinement levels for convergence checking vary from \\spad{nmin} to \\spad{nmax}. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \\spad{true} if the integral was computed within the user specified error criterion. See \\spadtype{NumericalQuadrature} for details.")) (|simpsono| (((|Record| (|:| |value| (|Float|)) (|:| |error| (|Float|)) (|:| |totalpts| (|Integer|)) (|:| |success| (|Boolean|))) (|Mapping| (|Float|) (|Float|)) (|Float|) (|Float|) (|Float|) (|Float|) (|Integer|) (|Integer|)) "\\spad{simpsono(fn,a,b,epsrel,epsabs,nmin,nmax)} uses the simpson method to numerically integrate function \\spad{fn} over the open interval from \\spad{a} to \\spad{b},{} with relative accuracy \\spad{epsrel} and absolute accuracy \\spad{epsabs},{} with the refinement levels for convergence checking vary from \\spad{nmin} to \\spad{nmax}. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \\spad{true} if the integral was computed within the user specified error criterion. See \\spadtype{NumericalQuadrature} for details.")) (|rombergo| (((|Record| (|:| |value| (|Float|)) (|:| |error| (|Float|)) (|:| |totalpts| (|Integer|)) (|:| |success| (|Boolean|))) (|Mapping| (|Float|) (|Float|)) (|Float|) (|Float|) (|Float|) (|Float|) (|Integer|) (|Integer|)) "\\spad{rombergo(fn,a,b,epsrel,epsabs,nmin,nmax)} uses the romberg method to numerically integrate function \\spad{fn} over the open interval from \\spad{a} to \\spad{b},{} with relative accuracy \\spad{epsrel} and absolute accuracy \\spad{epsabs},{} with the refinement levels for convergence checking vary from \\spad{nmin} to \\spad{nmax}. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \\spad{true} if the integral was computed within the user specified error criterion. See \\spadtype{NumericalQuadrature} for details.")) (|trapezoidal| (((|Record| (|:| |value| (|Float|)) (|:| |error| (|Float|)) (|:| |totalpts| (|Integer|)) (|:| |success| (|Boolean|))) (|Mapping| (|Float|) (|Float|)) (|Float|) (|Float|) (|Float|) (|Float|) (|Integer|) (|Integer|)) "\\spad{trapezoidal(fn,a,b,epsrel,epsabs,nmin,nmax)} uses the trapezoidal method to numerically integrate function \\spadvar{\\spad{fn}} over the closed interval \\spad{a} to \\spad{b},{} with relative accuracy \\spad{epsrel} and absolute accuracy \\spad{epsabs},{} with the refinement levels for convergence checking vary from \\spad{nmin} to \\spad{nmax}. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \\spad{true} if the integral was computed within the user specified error criterion. See \\spadtype{NumericalQuadrature} for details.")) (|simpson| (((|Record| (|:| |value| (|Float|)) (|:| |error| (|Float|)) (|:| |totalpts| (|Integer|)) (|:| |success| (|Boolean|))) (|Mapping| (|Float|) (|Float|)) (|Float|) (|Float|) (|Float|) (|Float|) (|Integer|) (|Integer|)) "\\spad{simpson(fn,a,b,epsrel,epsabs,nmin,nmax)} uses the simpson method to numerically integrate function \\spad{fn} over the closed interval \\spad{a} to \\spad{b},{} with relative accuracy \\spad{epsrel} and absolute accuracy \\spad{epsabs},{} with the refinement levels for convergence checking vary from \\spad{nmin} to \\spad{nmax}. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \\spad{true} if the integral was computed within the user specified error criterion. See \\spadtype{NumericalQuadrature} for details.")) (|romberg| (((|Record| (|:| |value| (|Float|)) (|:| |error| (|Float|)) (|:| |totalpts| (|Integer|)) (|:| |success| (|Boolean|))) (|Mapping| (|Float|) (|Float|)) (|Float|) (|Float|) (|Float|) (|Float|) (|Integer|) (|Integer|)) "\\spad{romberg(fn,a,b,epsrel,epsabs,nmin,nmax)} uses the romberg method to numerically integrate function \\spadvar{\\spad{fn}} over the closed interval \\spad{a} to \\spad{b},{} with relative accuracy \\spad{epsrel} and absolute accuracy \\spad{epsabs},{} with the refinement levels for convergence checking vary from \\spad{nmin} to \\spad{nmax}. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \\spad{true} if the integral was computed within the user specified error criterion. See \\spadtype{NumericalQuadrature} for details.")) (|atrapezoidal| (((|Record| (|:| |value| (|Float|)) (|:| |error| (|Float|)) (|:| |totalpts| (|Integer|)) (|:| |success| (|Boolean|))) (|Mapping| (|Float|) (|Float|)) (|Float|) (|Float|) (|Float|) (|Float|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{atrapezoidal(fn,a,b,epsrel,epsabs,nmin,nmax,nint)} uses the adaptive trapezoidal method to numerically integrate function \\spad{fn} over the closed interval from \\spad{a} to \\spad{b},{} with relative accuracy \\spad{epsrel} and absolute accuracy \\spad{epsabs},{} with the refinement levels for convergence checking vary from \\spad{nmin} to \\spad{nmax},{} and where \\spad{nint} is the number of independent intervals to apply the integrator. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \\spad{true} if the integral was computed within the user specified error criterion. See \\spadtype{NumericalQuadrature} for details.")) (|asimpson| (((|Record| (|:| |value| (|Float|)) (|:| |error| (|Float|)) (|:| |totalpts| (|Integer|)) (|:| |success| (|Boolean|))) (|Mapping| (|Float|) (|Float|)) (|Float|) (|Float|) (|Float|) (|Float|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{asimpson(fn,a,b,epsrel,epsabs,nmin,nmax,nint)} uses the adaptive simpson method to numerically integrate function \\spad{fn} over the closed interval from \\spad{a} to \\spad{b},{} with relative accuracy \\spad{epsrel} and absolute accuracy \\spad{epsabs},{} with the refinement levels for convergence checking vary from \\spad{nmin} to \\spad{nmax},{} and where \\spad{nint} is the number of independent intervals to apply the integrator. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \\spad{true} if the integral was computed within the user specified error criterion. See \\spadtype{NumericalQuadrature} for details.")) (|aromberg| (((|Record| (|:| |value| (|Float|)) (|:| |error| (|Float|)) (|:| |totalpts| (|Integer|)) (|:| |success| (|Boolean|))) (|Mapping| (|Float|) (|Float|)) (|Float|) (|Float|) (|Float|) (|Float|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{aromberg(fn,a,b,epsrel,epsabs,nmin,nmax,nint)} uses the adaptive romberg method to numerically integrate function \\spad{fn} over the closed interval from \\spad{a} to \\spad{b},{} with relative accuracy \\spad{epsrel} and absolute accuracy \\spad{epsabs},{} with the refinement levels for convergence checking vary from \\spad{nmin} to \\spad{nmax},{} and where \\spad{nint} is the number of independent intervals to apply the integrator. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \\spad{true} if the integral was computed within the user specified error criterion. See \\spadtype{NumericalQuadrature} for details."))) NIL NIL -(-809 |Curve|) +(-808 |Curve|) ((|constructor| (NIL "\\indented{1}{Author: Clifton \\spad{J}. Williamson} Date Created: Bastille Day 1989 Date Last Updated: 5 June 1990 Keywords: Examples: Package for constructing tubes around 3-dimensional parametric curves.")) (|tube| (((|TubePlot| |#1|) |#1| (|DoubleFloat|) (|Integer|)) "\\spad{tube(c,r,n)} creates a tube of radius \\spad{r} around the curve \\spad{c}."))) NIL NIL -(-810 S) +(-809 S) ((|constructor| (NIL "Ordered sets which are also abelian groups,{} such that the addition preserves the ordering.")) (|abs| (($ $) "\\spad{abs(x)} returns the absolute value of \\spad{x}.")) (|sign| (((|Integer|) $) "\\spad{sign(x)} is \\spad{1} if \\spad{x} is positive,{} \\spad{-1} if \\spad{x} is negative,{} and \\spad{0} otherwise.")) (|negative?| (((|Boolean|) $) "\\spad{negative?(x)} holds when \\spad{x} is less than \\spad{0}."))) NIL NIL -(-811) +(-810) ((|constructor| (NIL "Ordered sets which are also abelian groups,{} such that the addition preserves the ordering.")) (|abs| (($ $) "\\spad{abs(x)} returns the absolute value of \\spad{x}.")) (|sign| (((|Integer|) $) "\\spad{sign(x)} is \\spad{1} if \\spad{x} is positive,{} \\spad{-1} if \\spad{x} is negative,{} and \\spad{0} otherwise.")) (|negative?| (((|Boolean|) $) "\\spad{negative?(x)} holds when \\spad{x} is less than \\spad{0}."))) NIL NIL -(-812 S) +(-811 S) ((|constructor| (NIL "Ordered sets which are also abelian monoids,{} such that the addition preserves the ordering.")) (|positive?| (((|Boolean|) $) "\\spad{positive?(x)} holds when \\spad{x} is greater than \\spad{0}."))) NIL NIL -(-813) +(-812) ((|constructor| (NIL "Ordered sets which are also abelian monoids,{} such that the addition preserves the ordering.")) (|positive?| (((|Boolean|) $) "\\spad{positive?(x)} holds when \\spad{x} is greater than \\spad{0}."))) NIL NIL -(-814) +(-813) ((|constructor| (NIL "This domain is an OrderedAbelianMonoid with a \\spadfun{sup} operation added. The purpose of the \\spadfun{sup} operator in this domain is to act as a supremum with respect to the partial order imposed by \\spadop{-},{} rather than with respect to the total \\spad{>} order (since that is \"max\"). \\blankline")) (|sup| (($ $ $) "\\spad{sup(x,y)} returns the least element from which both \\spad{x} and \\spad{y} can be subtracted."))) NIL NIL -(-815) +(-814) ((|constructor| (NIL "Ordered sets which are also abelian semigroups,{} such that the addition preserves the ordering. \\indented{2}{\\spad{ x < y => x+z < y+z}}"))) NIL NIL -(-816 S R) +(-815 S R) ((|constructor| (NIL "OctonionCategory gives the categorial frame for the octonions,{} and eight-dimensional non-associative algebra,{} doubling the the quaternions in the same way as doubling the Complex numbers to get the quaternions.")) (|inv| (($ $) "\\spad{inv(o)} returns the inverse of \\spad{o} if it exists.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(o)} returns the real part if all seven imaginary parts are 0,{} and \"failed\" otherwise.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(o)} returns the real part if all seven imaginary parts are 0. Error: if \\spad{o} is not rational.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(o)} tests if \\spad{o} is rational,{} \\spadignore{i.e.} that all seven imaginary parts are 0.")) (|abs| ((|#2| $) "\\spad{abs(o)} computes the absolute value of an octonion,{} equal to the square root of the \\spadfunFrom{norm}{Octonion}.")) (|octon| (($ |#2| |#2| |#2| |#2| |#2| |#2| |#2| |#2|) "\\spad{octon(re,ri,rj,rk,rE,rI,rJ,rK)} constructs an octonion from scalars.")) (|norm| ((|#2| $) "\\spad{norm(o)} returns the norm of an octonion,{} equal to the sum of the squares of its coefficients.")) (|imagK| ((|#2| $) "\\spad{imagK(o)} extracts the imaginary \\spad{K} part of octonion \\spad{o}.")) (|imagJ| ((|#2| $) "\\spad{imagJ(o)} extracts the imaginary \\spad{J} part of octonion \\spad{o}.")) (|imagI| ((|#2| $) "\\spad{imagI(o)} extracts the imaginary \\spad{I} part of octonion \\spad{o}.")) (|imagE| ((|#2| $) "\\spad{imagE(o)} extracts the imaginary \\spad{E} part of octonion \\spad{o}.")) (|imagk| ((|#2| $) "\\spad{imagk(o)} extracts the \\spad{k} part of octonion \\spad{o}.")) (|imagj| ((|#2| $) "\\spad{imagj(o)} extracts the \\spad{j} part of octonion \\spad{o}.")) (|imagi| ((|#2| $) "\\spad{imagi(o)} extracts the \\spad{i} part of octonion \\spad{o}.")) (|real| ((|#2| $) "\\spad{real(o)} extracts real part of octonion \\spad{o}.")) (|conjugate| (($ $) "\\spad{conjugate(o)} negates the imaginary parts \\spad{i},{}\\spad{j},{}\\spad{k},{}\\spad{E},{}\\spad{I},{}\\spad{J},{}\\spad{K} of octonian \\spad{o}."))) NIL -((|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-557))) (|HasCategory| |#2| (QUOTE (-1080))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-381)))) -(-817 R) +((|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-556))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-381)))) +(-816 R) ((|constructor| (NIL "OctonionCategory gives the categorial frame for the octonions,{} and eight-dimensional non-associative algebra,{} doubling the the quaternions in the same way as doubling the Complex numbers to get the quaternions.")) (|inv| (($ $) "\\spad{inv(o)} returns the inverse of \\spad{o} if it exists.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(o)} returns the real part if all seven imaginary parts are 0,{} and \"failed\" otherwise.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(o)} returns the real part if all seven imaginary parts are 0. Error: if \\spad{o} is not rational.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(o)} tests if \\spad{o} is rational,{} \\spadignore{i.e.} that all seven imaginary parts are 0.")) (|abs| ((|#1| $) "\\spad{abs(o)} computes the absolute value of an octonion,{} equal to the square root of the \\spadfunFrom{norm}{Octonion}.")) (|octon| (($ |#1| |#1| |#1| |#1| |#1| |#1| |#1| |#1|) "\\spad{octon(re,ri,rj,rk,rE,rI,rJ,rK)} constructs an octonion from scalars.")) (|norm| ((|#1| $) "\\spad{norm(o)} returns the norm of an octonion,{} equal to the sum of the squares of its coefficients.")) (|imagK| ((|#1| $) "\\spad{imagK(o)} extracts the imaginary \\spad{K} part of octonion \\spad{o}.")) (|imagJ| ((|#1| $) "\\spad{imagJ(o)} extracts the imaginary \\spad{J} part of octonion \\spad{o}.")) (|imagI| ((|#1| $) "\\spad{imagI(o)} extracts the imaginary \\spad{I} part of octonion \\spad{o}.")) (|imagE| ((|#1| $) "\\spad{imagE(o)} extracts the imaginary \\spad{E} part of octonion \\spad{o}.")) (|imagk| ((|#1| $) "\\spad{imagk(o)} extracts the \\spad{k} part of octonion \\spad{o}.")) (|imagj| ((|#1| $) "\\spad{imagj(o)} extracts the \\spad{j} part of octonion \\spad{o}.")) (|imagi| ((|#1| $) "\\spad{imagi(o)} extracts the \\spad{i} part of octonion \\spad{o}.")) (|real| ((|#1| $) "\\spad{real(o)} extracts real part of octonion \\spad{o}.")) (|conjugate| (($ $) "\\spad{conjugate(o)} negates the imaginary parts \\spad{i},{}\\spad{j},{}\\spad{k},{}\\spad{E},{}\\spad{I},{}\\spad{J},{}\\spad{K} of octonian \\spad{o}."))) -((-4418 . T) (-4419 . T) (-4421 . T)) +((-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-818) +(-817) ((|constructor| (NIL "Ordered sets which are also abelian cancellation monoids,{} such that the addition preserves the ordering."))) NIL NIL -(-819 R) +(-818 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}."))) -((-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (|%list| (QUOTE -526) (QUOTE (-1197)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (-3956 (|HasCategory| (-1016 |#1|) (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-3956 (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| (-1016 |#1|) (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-1080))) (|HasCategory| |#1| (QUOTE (-557))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1016 |#1|) (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| (-1016 |#1|) (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558))))) -(-820 -3956 R OS S) +((-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (|%list| (QUOTE -526) (QUOTE (-1196)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (-3955 (|HasCategory| (-1015 |#1|) (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-3955 (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| (-1015 |#1|) (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-556))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1015 |#1|) (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| (-1015 |#1|) (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557))))) +(-819 -3955 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 -(-821) +(-820) ((|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 -(-822 R -3494 L) +(-821 R -3493 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 -(-823 R -3494) +(-822 R -3493) ((|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| #1="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| #1#) (|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| #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| #2#) (|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 -(-824) +(-823) ((|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 -(-825 R -3494) +(-824 R -3493) ((|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 -(-826) +(-825) ((|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 -(-827 -3494 UP UPUP R) +(-826 -3493 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 -(-828 -3494 UP L LQ) +(-827 -3493 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 -(-829) +(-828) ((|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 -(-830 -3494 UP L LQ) +(-829 -3493 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 -(-831 -3494 UP) +(-830 -3493 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|) #1="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|) #1#)) (|:| |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 -(-832 -3494 L UP A LO) +(-831 -3493 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 -(-833 -3494 UP) +(-832 -3493 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)))) -(-834 -3494 LO) +(-833 -3493 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 -(-835 -3494 LODO) +(-834 -3493 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 -(-836 -3019 S |f|) +(-835 -3018 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}."))) -((-4418 |has| |#2| (-1069)) (-4419 |has| |#2| (-1069)) (-4421 |has| |#2| (-6 -4421)) (-4424 . T)) -((-3956 (-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 (-745))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1069)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#2| (QUOTE (-376))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1069)))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (QUOTE (-745))) (|HasCategory| |#2| (QUOTE (-814))) (-3956 (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (QUOTE (-860)))) (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-381))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (-3956 (|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 (-745))) (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|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 (-745))) (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|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 (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|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 (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#2| (QUOTE (-240))) (-3956 (|HasCategory| |#2| (QUOTE (-240))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1069))))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -918) (QUOTE (-1197))))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#2| (QUOTE (-1121))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-745))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-745))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#2| (QUOTE (-1069)))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-745))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-814))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558)))))) (|HasCategory| (-558) (QUOTE (-860))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1069)))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -918) (QUOTE (-1197))))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#2| (QUOTE (-1069)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasAttribute| |#2| (QUOTE -4421)) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1069)))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))))) -(-837 R) +((-4417 |has| |#2| (-1068)) (-4418 |has| |#2| (-1068)) (-4420 |has| |#2| (-6 -4420)) (-4423 . T)) +((-3955 (-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 (-744))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1068)))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#2| (QUOTE (-376))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1068)))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (QUOTE (-744))) (|HasCategory| |#2| (QUOTE (-813))) (-3955 (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (QUOTE (-859)))) (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-381))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (-3955 (|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 (-744))) (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|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 (-744))) (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|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 (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|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 (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#2| (QUOTE (-240))) (-3955 (|HasCategory| |#2| (QUOTE (-240))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1068))))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -917) (QUOTE (-1196))))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#2| (QUOTE (-1120))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-744))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-744))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#2| (QUOTE (-1068)))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-744))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-813))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557)))))) (|HasCategory| (-557) (QUOTE (-859))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1068)))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -917) (QUOTE (-1196))))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#2| (QUOTE (-1068)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasAttribute| |#2| (QUOTE -4420)) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1068)))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))))) +(-836 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"))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-928))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-839 (-1197)) (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-839 (-1197)) (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-839 (-1197)) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-839 (-1197)) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-839 (-1197)) (|%list| (QUOTE -630) (QUOTE (-547))))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4422)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) -(-838 |Kernels| R |var|) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-927))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-838 (-1196)) (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-838 (-1196)) (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-838 (-1196)) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-838 (-1196)) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-838 (-1196)) (|%list| (QUOTE -629) (QUOTE (-546))))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4421)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) +(-837 |Kernels| R |var|) ((|constructor| (NIL "This constructor produces an ordinary differential ring from a partial differential ring by specifying a variable."))) -(((-4426 "*") |has| |#2| (-376)) (-4417 |has| |#2| (-376)) (-4422 |has| |#2| (-376)) (-4416 |has| |#2| (-376)) (-4421 . T) (-4419 . T) (-4418 . T)) +(((-4425 "*") |has| |#2| (-376)) (-4416 |has| |#2| (-376)) (-4421 |has| |#2| (-376)) (-4415 |has| |#2| (-376)) (-4420 . T) (-4418 . T) (-4417 . T)) ((|HasCategory| |#2| (QUOTE (-376)))) -(-839 S) +(-838 S) ((|constructor| (NIL "\\spadtype{OrderlyDifferentialVariable} adds a commonly used orderly ranking to the set of derivatives of an ordered list of differential indeterminates. An orderly ranking is a ranking \\spadfun{<} of the derivatives with the property that for two derivatives \\spad{u} and \\spad{v},{} \\spad{u} \\spadfun{<} \\spad{v} if the \\spadfun{order} of \\spad{u} is less than that of \\spad{v}. This domain belongs to \\spadtype{DifferentialVariableCategory}. It defines \\spadfun{weight} to be just \\spadfun{order},{} and it defines an orderly ranking \\spadfun{<} on derivatives \\spad{u} via the lexicographic order on the pair (\\spadfun{order}(\\spad{u}),{} \\spadfun{variable}(\\spad{u}))."))) NIL NIL -(-840 S) +(-839 S) ((|constructor| (NIL "\\indented{3}{The free monoid on a set \\spad{S} is the monoid of finite products of} the form \\spad{reduce(*,[si ** ni])} where the \\spad{si}'s are in \\spad{S},{} and the \\spad{ni}'s are non-negative integers. The multiplication is not commutative. For two elements \\spad{x} and \\spad{y} the relation \\spad{x < y} holds if either \\spad{length(x) < length(y)} holds or if these lengths are equal and if \\spad{x} is smaller than \\spad{y} \\spad{w}.\\spad{r}.\\spad{t}. the lexicographical ordering induced by \\spad{S}. This domain inherits implementation from \\spadtype{FreeMonoid}.")) (|varList| (((|List| |#1|) $) "\\spad{varList(x)} returns the list of variables of \\spad{x}.")) (|length| (((|NonNegativeInteger|) $) "\\spad{length(x)} returns the length of \\spad{x}.")) (|div| (((|Union| (|Record| (|:| |lm| $) (|:| |rm| $)) "failed") $ $) "\\spad{x div y} returns the left and right exact quotients of \\spad{x} by \\spad{y},{} that is \\spad{[l, r]} such that \\spad{x = l * y * r}. \"failed\" is returned iff \\spad{x} is not of the form \\spad{l * y * r}. monomial of \\spad{x}.")) (|rquo| (((|Union| $ "failed") $ |#1|) "\\spad{rquo(x, s)} returns the exact right quotient of \\spad{x} by \\spad{s}.")) (|lquo| (((|Union| $ "failed") $ |#1|) "\\spad{lquo(x, s)} returns the exact left quotient of \\spad{x} by \\spad{s}.")) (|lexico| (((|Boolean|) $ $) "\\spad{lexico(x,y)} returns \\spad{true} iff \\spad{x} is smaller than \\spad{y} \\spad{w}.\\spad{r}.\\spad{t}. the pure lexicographical ordering induced by \\spad{S}.")) (|mirror| (($ $) "\\spad{mirror(x)} returns the reversed word of \\spad{x}.")) (|rest| (($ $) "\\spad{rest(x)} returns \\spad{x} except the first letter.")) (|first| ((|#1| $) "\\spad{first(x)} returns the first letter of \\spad{x}."))) NIL -((|HasCategory| |#1| (QUOTE (-860)))) -(-841) +((|HasCategory| |#1| (QUOTE (-859)))) +(-840) ((|constructor| (NIL "The category of ordered commutative integral domains,{} where ordering and the arithmetic operations are compatible \\blankline"))) -((-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-842 P R) +(-841 P R) ((|constructor| (NIL "This constructor creates the \\spadtype{MonogenicLinearOperator} domain which is ``opposite'' in the ring sense to \\spad{P}. That is,{} as sets \\spad{P = \\$} but \\spad{a * b} in \\spad{\\$} is equal to \\spad{b * a} in \\spad{P}.")) (|po| ((|#1| $) "\\spad{po(q)} creates a value in \\spad{P} equal to \\spad{q} in \\$.")) (|op| (($ |#1|) "\\spad{op(p)} creates a value in \\$ equal to \\spad{p} in \\spad{P}."))) -((-4418 . T) (-4419 . T) (-4421 . T)) +((-4417 . T) (-4418 . T) (-4420 . T)) ((|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-240)))) -(-843 S) +(-842 S) ((|constructor| (NIL "to become an in order iterator")) (|min| ((|#1| $) "\\spad{min(u)} returns the smallest entry in the multiset aggregate \\spad{u}."))) -((-4424 . T) (-4414 . T) (-4425 . T)) +((-4423 . T) (-4413 . T) (-4424 . T)) NIL -(-844 R) +(-843 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."))) -((-4421 |has| |#1| (-859))) -((|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-21))) (-3956 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-859)))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (-3956 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-557)))) -(-845 R S) +((-4420 |has| |#1| (-858))) +((|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-21))) (-3955 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-858)))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (-3955 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-556)))) +(-844 R S) ((|constructor| (NIL "Lifting of maps to one-point completions. Date Created: 4 Oct 1989 Date Last Updated: 4 Oct 1989")) (|map| (((|OnePointCompletion| |#2|) (|Mapping| |#2| |#1|) (|OnePointCompletion| |#1|) (|OnePointCompletion| |#2|)) "\\spad{map(f, r, i)} lifts \\spad{f} and applies it to \\spad{r},{} assuming that \\spad{f}(infinity) = \\spad{i}.") (((|OnePointCompletion| |#2|) (|Mapping| |#2| |#1|) (|OnePointCompletion| |#1|)) "\\spad{map(f, r)} lifts \\spad{f} and applies it to \\spad{r},{} assuming that \\spad{f}(infinity) = infinity."))) NIL NIL -(-846 R) +(-845 R) ((|constructor| (NIL "Algebra of ADDITIVE operators over a ring."))) -((-4419 |has| |#1| (-175)) (-4418 |has| |#1| (-175)) (-4421 . T)) +((-4418 |has| |#1| (-175)) (-4417 |has| |#1| (-175)) (-4420 . T)) ((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149)))) -(-847 A S) +(-846 A S) ((|constructor| (NIL "This category specifies the interface for operators used to build terms,{} in the sense of Universal Algebra. The domain parameter \\spad{S} provides representation for the `external name' of an operator.")) (|is?| (((|Boolean|) $ |#2|) "\\spad{is?(op,n)} holds if the name of the operator \\spad{op} is \\spad{n}.")) (|arity| (((|Arity|) $) "\\spad{arity(op)} returns the arity of the operator \\spad{op}.")) (|name| ((|#2| $) "\\spad{name(op)} returns the externam name of \\spad{op}."))) NIL NIL -(-848 S) +(-847 S) ((|constructor| (NIL "This category specifies the interface for operators used to build terms,{} in the sense of Universal Algebra. The domain parameter \\spad{S} provides representation for the `external name' of an operator.")) (|is?| (((|Boolean|) $ |#1|) "\\spad{is?(op,n)} holds if the name of the operator \\spad{op} is \\spad{n}.")) (|arity| (((|Arity|) $) "\\spad{arity(op)} returns the arity of the operator \\spad{op}.")) (|name| ((|#1| $) "\\spad{name(op)} returns the externam name of \\spad{op}."))) NIL NIL -(-849) +(-848) ((|constructor| (NIL "This package exports tools to create AXIOM Library information databases.")) (|getDatabase| (((|Database| (|IndexCard|)) (|String|)) "\\spad{getDatabase(\"char\")} returns a list of appropriate entries in the browser database. The legal values for \\spad{\"char\"} are \"o\" (operations),{} \"k\" (constructors),{} \"d\" (domains),{} \"c\" (categories) or \"p\" (packages)."))) NIL NIL -(-850) +(-849) ((|constructor| (NIL "This the datatype for an operator-signature pair.")) (|construct| (($ (|Identifier|) (|Signature|)) "\\spad{construct(op,sig)} construct a signature-operator with operator name `op',{} and signature `sig'.")) (|signature| (((|Signature|) $) "\\spad{signature(x)} returns the signature of `x'."))) NIL NIL -(-851) +(-850) ((|numericalOptimization| (((|Result|) (|Record| (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |init| (|List| (|DoubleFloat|))) (|:| |lb| (|List| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |cf| (|List| (|Expression| (|DoubleFloat|)))) (|:| |ub| (|List| (|OrderedCompletion| (|DoubleFloat|)))))) "\\spad{numericalOptimization(args)} performs the optimization of the function given the strategy or method returned by \\axiomFun{measure}.") (((|Result|) (|Record| (|:| |lfn| (|List| (|Expression| (|DoubleFloat|)))) (|:| |init| (|List| (|DoubleFloat|))))) "\\spad{numericalOptimization(args)} performs the optimization of the function given the strategy or method returned by \\axiomFun{measure}.")) (|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |explanations| (|String|))) (|RoutinesTable|) (|Record| (|:| |lfn| (|List| (|Expression| (|DoubleFloat|)))) (|:| |init| (|List| (|DoubleFloat|))))) "\\spad{measure(R,args)} calculates an estimate of the ability of a particular method to solve an optimization problem. \\blankline This method may be either a specific NAG routine or a strategy (such as transforming the function from one which is difficult to one which is easier to solve). \\blankline It will call whichever agents are needed to perform analysis on the problem in order to calculate the measure. There is a parameter,{} labelled \\axiom{sofar},{} which would contain the best compatibility found so far.") (((|Record| (|:| |measure| (|Float|)) (|:| |explanations| (|String|))) (|RoutinesTable|) (|Record| (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |init| (|List| (|DoubleFloat|))) (|:| |lb| (|List| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |cf| (|List| (|Expression| (|DoubleFloat|)))) (|:| |ub| (|List| (|OrderedCompletion| (|DoubleFloat|)))))) "\\spad{measure(R,args)} calculates an estimate of the ability of a particular method to solve an optimization problem. \\blankline This method may be either a specific NAG routine or a strategy (such as transforming the function from one which is difficult to one which is easier to solve). \\blankline It will call whichever agents are needed to perform analysis on the problem in order to calculate the measure. There is a parameter,{} labelled \\axiom{sofar},{} which would contain the best compatibility found so far."))) NIL NIL -(-852) +(-851) ((|goodnessOfFit| (((|Result|) (|List| (|Expression| (|Float|))) (|List| (|Float|))) "\\spad{goodnessOfFit(lf,start)} is a top level ANNA function to check to goodness of fit of a least squares model \\spadignore{i.e.} the minimization of a set of functions,{} \\axiom{\\spad{lf}},{} of one or more variables without constraints. \\blankline The parameter \\axiom{\\spad{start}} is a list of the initial guesses of the values of the variables. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}. It then calls the numerical routine \\axiomType{E04YCF} to get estimates of the variance-covariance matrix of the regression coefficients of the least-squares problem. \\blankline It thus returns both the results of the optimization and the variance-covariance calculation. goodnessOfFit(\\spad{lf},{}\\spad{start}) is a top level function to iterate over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}. It then checks the goodness of fit of the least squares model.") (((|Result|) (|NumericalOptimizationProblem|)) "\\spad{goodnessOfFit(prob)} is a top level ANNA function to check to goodness of fit of a least squares model as defined within \\axiom{\\spad{prob}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}. It then calls the numerical routine \\axiomType{E04YCF} to get estimates of the variance-covariance matrix of the regression coefficients of the least-squares problem. \\blankline It thus returns both the results of the optimization and the variance-covariance calculation.")) (|optimize| (((|Result|) (|List| (|Expression| (|Float|))) (|List| (|Float|))) "\\spad{optimize(lf,start)} is a top level ANNA function to minimize a set of functions,{} \\axiom{\\spad{lf}},{} of one or more variables without constraints \\spadignore{i.e.} a least-squares problem. \\blankline The parameter \\axiom{\\spad{start}} is a list of the initial guesses of the values of the variables. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}.") (((|Result|) (|Expression| (|Float|)) (|List| (|Float|))) "\\spad{optimize(f,start)} is a top level ANNA function to minimize a function,{} \\axiom{\\spad{f}},{} of one or more variables without constraints. \\blankline The parameter \\axiom{\\spad{start}} is a list of the initial guesses of the values of the variables. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}.") (((|Result|) (|Expression| (|Float|)) (|List| (|Float|)) (|List| (|OrderedCompletion| (|Float|))) (|List| (|OrderedCompletion| (|Float|)))) "\\spad{optimize(f,start,lower,upper)} is a top level ANNA function to minimize a function,{} \\axiom{\\spad{f}},{} of one or more variables with simple constraints. The bounds on the variables are defined in \\axiom{\\spad{lower}} and \\axiom{\\spad{upper}}. \\blankline The parameter \\axiom{\\spad{start}} is a list of the initial guesses of the values of the variables. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}.") (((|Result|) (|Expression| (|Float|)) (|List| (|Float|)) (|List| (|OrderedCompletion| (|Float|))) (|List| (|Expression| (|Float|))) (|List| (|OrderedCompletion| (|Float|)))) "\\spad{optimize(f,start,lower,cons,upper)} is a top level ANNA function to minimize a function,{} \\axiom{\\spad{f}},{} of one or more variables with the given constraints. \\blankline These constraints may be simple constraints on the variables in which case \\axiom{\\spad{cons}} would be an empty list and the bounds on those variables defined in \\axiom{\\spad{lower}} and \\axiom{\\spad{upper}},{} or a mixture of simple,{} linear and non-linear constraints,{} where \\axiom{\\spad{cons}} contains the linear and non-linear constraints and the bounds on these are added to \\axiom{\\spad{upper}} and \\axiom{\\spad{lower}}. \\blankline The parameter \\axiom{\\spad{start}} is a list of the initial guesses of the values of the variables. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}.") (((|Result|) (|NumericalOptimizationProblem|)) "\\spad{optimize(prob)} is a top level ANNA function to minimize a function or a set of functions with any constraints as defined within \\axiom{\\spad{prob}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}.") (((|Result|) (|NumericalOptimizationProblem|) (|RoutinesTable|)) "\\spad{optimize(prob,routines)} is a top level ANNA function to minimize a function or a set of functions with any constraints as defined within \\axiom{\\spad{prob}}. \\blankline It iterates over the \\axiom{domains} listed in \\axiom{\\spad{routines}} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}.")) (|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|)))) (|NumericalOptimizationProblem|) (|RoutinesTable|)) "\\spad{measure(prob,R)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical optimization problem defined by \\axiom{\\spad{prob}} by checking various attributes of the functions and calculating a measure of compatibility of each routine to these attributes. \\blankline It calls each \\axiom{domain} listed in \\axiom{\\spad{R}} of \\axiom{category} \\axiomType{NumericalOptimizationCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information.") (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|)))) (|NumericalOptimizationProblem|)) "\\spad{measure(prob)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical optimization problem defined by \\axiom{\\spad{prob}} by checking various attributes of the functions and calculating a measure of compatibility of each routine to these attributes. \\blankline It calls each \\axiom{domain} of \\axiom{category} \\axiomType{NumericalOptimizationCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information."))) NIL NIL -(-853) +(-852) ((|retract| (((|Union| (|:| |noa| (|Record| (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |init| (|List| (|DoubleFloat|))) (|:| |lb| (|List| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |cf| (|List| (|Expression| (|DoubleFloat|)))) (|:| |ub| (|List| (|OrderedCompletion| (|DoubleFloat|)))))) (|:| |lsa| (|Record| (|:| |lfn| (|List| (|Expression| (|DoubleFloat|)))) (|:| |init| (|List| (|DoubleFloat|)))))) $) "\\spad{retract(x)} \\undocumented{}")) (|coerce| (($ (|Union| (|:| |noa| (|Record| (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |init| (|List| (|DoubleFloat|))) (|:| |lb| (|List| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |cf| (|List| (|Expression| (|DoubleFloat|)))) (|:| |ub| (|List| (|OrderedCompletion| (|DoubleFloat|)))))) (|:| |lsa| (|Record| (|:| |lfn| (|List| (|Expression| (|DoubleFloat|)))) (|:| |init| (|List| (|DoubleFloat|))))))) "\\spad{coerce(x)} \\undocumented{}") (($ (|Record| (|:| |lfn| (|List| (|Expression| (|DoubleFloat|)))) (|:| |init| (|List| (|DoubleFloat|))))) "\\spad{coerce(x)} \\undocumented{}") (($ (|Record| (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |init| (|List| (|DoubleFloat|))) (|:| |lb| (|List| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |cf| (|List| (|Expression| (|DoubleFloat|)))) (|:| |ub| (|List| (|OrderedCompletion| (|DoubleFloat|)))))) "\\spad{coerce(x)} \\undocumented{}"))) NIL NIL -(-854 R) +(-853 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."))) -((-4421 |has| |#1| (-859))) -((|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-21))) (-3956 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-859)))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (-3956 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-557)))) -(-855 R S) +((-4420 |has| |#1| (-858))) +((|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-21))) (-3955 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-858)))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (-3955 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-556)))) +(-854 R S) ((|constructor| (NIL "Lifting of maps to ordered completions. Date Created: 4 Oct 1989 Date Last Updated: 4 Oct 1989")) (|map| (((|OrderedCompletion| |#2|) (|Mapping| |#2| |#1|) (|OrderedCompletion| |#1|) (|OrderedCompletion| |#2|) (|OrderedCompletion| |#2|)) "\\spad{map(f, r, p, m)} lifts \\spad{f} and applies it to \\spad{r},{} assuming that \\spad{f}(plusInfinity) = \\spad{p} and that \\spad{f}(minusInfinity) = \\spad{m}.") (((|OrderedCompletion| |#2|) (|Mapping| |#2| |#1|) (|OrderedCompletion| |#1|)) "\\spad{map(f, r)} lifts \\spad{f} and applies it to \\spad{r},{} assuming that \\spad{f}(plusInfinity) = plusInfinity and that \\spad{f}(minusInfinity) = minusInfinity."))) NIL NIL -(-856) +(-855) ((|constructor| (NIL "Ordered finite sets.")) (|max| (($) "\\spad{max} is the maximum value of \\%.")) (|min| (($) "\\spad{min} is the minimum value of \\%."))) NIL NIL -(-857 -3019 S) +(-856 -3018 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 -(-858) +(-857) ((|constructor| (NIL "Ordered sets which are also monoids,{} such that multiplication preserves the ordering. \\blankline"))) NIL NIL -(-859) +(-858) ((|constructor| (NIL "Ordered sets which are also rings,{} that is,{} domains where the ring operations are compatible with the ordering. \\blankline"))) -((-4421 . T)) +((-4420 . T)) NIL -(-860) +(-859) ((|constructor| (NIL "The class of totally ordered sets,{} that is,{} sets such that for each pair of elements \\spad{(a,b)} exactly one of the following relations holds \\spad{a<b or a=b or b<a} and the relation is transitive,{} \\spadignore{i.e.} \\spad{a<b and b<c => a<c}."))) NIL NIL -(-861 T$ |f|) +(-860 T$ |f|) ((|constructor| (NIL "This domain turns any total ordering \\spad{f} on a type \\spad{T} into a model of the category \\spadtype{OrderedType}."))) NIL -((|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) -(-862 S) +((|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) +(-861 S) ((|constructor| (NIL "Category of types equipped with a total ordering.")) (|min| (($ $ $) "\\spad{min(x,y)} returns the minimum of \\spad{x} and \\spad{y} relative to the ordering.")) (|max| (($ $ $) "\\spad{max(x,y)} returns the maximum of \\spad{x} and \\spad{y} relative to the ordering.")) (>= (((|Boolean|) $ $) "\\spad{x <= y} holds if \\spad{x} is greater or equal than \\spad{y} in the current domain.")) (<= (((|Boolean|) $ $) "\\spad{x <= y} holds if \\spad{x} is less or equal than \\spad{y} in the current domain.")) (> (((|Boolean|) $ $) "\\spad{x > y} holds if \\spad{x} is greater than \\spad{y} in the current domain.")) (< (((|Boolean|) $ $) "\\spad{x < y} holds if \\spad{x} is less than \\spad{y} in the current domain."))) NIL NIL -(-863) +(-862) ((|constructor| (NIL "Category of types equipped with a total ordering.")) (|min| (($ $ $) "\\spad{min(x,y)} returns the minimum of \\spad{x} and \\spad{y} relative to the ordering.")) (|max| (($ $ $) "\\spad{max(x,y)} returns the maximum of \\spad{x} and \\spad{y} relative to the ordering.")) (>= (((|Boolean|) $ $) "\\spad{x <= y} holds if \\spad{x} is greater or equal than \\spad{y} in the current domain.")) (<= (((|Boolean|) $ $) "\\spad{x <= y} holds if \\spad{x} is less or equal than \\spad{y} in the current domain.")) (> (((|Boolean|) $ $) "\\spad{x > y} holds if \\spad{x} is greater than \\spad{y} in the current domain.")) (< (((|Boolean|) $ $) "\\spad{x < y} holds if \\spad{x} is less than \\spad{y} in the current domain."))) NIL NIL -(-864 S R) +(-863 S R) ((|constructor| (NIL "This is the category of univariate skew polynomials over an Ore coefficient ring. The multiplication is given by \\spad{x a = \\sigma(a) x + \\delta a}. This category is an evolution of the types \\indented{2}{MonogenicLinearOperator,{} OppositeMonogenicLinearOperator,{} and} \\indented{2}{NonCommutativeOperatorDivision} developped by Jean Della Dora and Stephen \\spad{M}. Watt.")) (|leftLcm| (($ $ $) "\\spad{leftLcm(a,b)} computes the value \\spad{m} of lowest degree such that \\spad{m = aa*a = bb*b} for some values \\spad{aa} and \\spad{bb}. The value \\spad{m} is computed using right-division.")) (|rightExtendedGcd| (((|Record| (|:| |coef1| $) (|:| |coef2| $) (|:| |generator| $)) $ $) "\\spad{rightExtendedGcd(a,b)} returns \\spad{[c,d]} such that \\spad{g = c * a + d * b = rightGcd(a, b)}.")) (|rightGcd| (($ $ $) "\\spad{rightGcd(a,b)} computes the value \\spad{g} of highest degree such that \\indented{3}{\\spad{a = aa*g}} \\indented{3}{\\spad{b = bb*g}} for some values \\spad{aa} and \\spad{bb}. The value \\spad{g} is computed using right-division.")) (|rightExactQuotient| (((|Union| $ "failed") $ $) "\\spad{rightExactQuotient(a,b)} computes the value \\spad{q},{} if it exists such that \\spad{a = q*b}.")) (|rightRemainder| (($ $ $) "\\spad{rightRemainder(a,b)} computes the pair \\spad{[q,r]} such that \\spad{a = q*b + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. The value \\spad{r} is returned.")) (|rightQuotient| (($ $ $) "\\spad{rightQuotient(a,b)} computes the pair \\spad{[q,r]} such that \\spad{a = q*b + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. The value \\spad{q} is returned.")) (|rightDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{rightDivide(a,b)} returns the pair \\spad{[q,r]} such that \\spad{a = q*b + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. This process is called ``right division''.")) (|rightLcm| (($ $ $) "\\spad{rightLcm(a,b)} computes the value \\spad{m} of lowest degree such that \\spad{m = a*aa = b*bb} for some values \\spad{aa} and \\spad{bb}. The value \\spad{m} is computed using left-division.")) (|leftExtendedGcd| (((|Record| (|:| |coef1| $) (|:| |coef2| $) (|:| |generator| $)) $ $) "\\spad{leftExtendedGcd(a,b)} returns \\spad{[c,d]} such that \\spad{g = a * c + b * d = leftGcd(a, b)}.")) (|leftGcd| (($ $ $) "\\spad{leftGcd(a,b)} computes the value \\spad{g} of highest degree such that \\indented{3}{\\spad{a = g*aa}} \\indented{3}{\\spad{b = g*bb}} for some values \\spad{aa} and \\spad{bb}. The value \\spad{g} is computed using left-division.")) (|leftExactQuotient| (((|Union| $ "failed") $ $) "\\spad{leftExactQuotient(a,b)} computes the value \\spad{q},{} if it exists,{} \\indented{1}{such that \\spad{a = b*q}.}")) (|leftRemainder| (($ $ $) "\\spad{leftRemainder(a,b)} computes the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. The value \\spad{r} is returned.")) (|leftQuotient| (($ $ $) "\\spad{leftQuotient(a,b)} computes the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. The value \\spad{q} is returned.")) (|leftDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{leftDivide(a,b)} returns the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. This process is called ``left division''.")) (|primitivePart| (($ $) "\\spad{primitivePart(l)} returns \\spad{l0} such that \\spad{l = a * l0} for some a in \\spad{R},{} and \\spad{content(l0) = 1}.")) (|content| ((|#2| $) "\\spad{content(l)} returns the gcd of all the coefficients of \\spad{l}.")) (|monicRightDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{monicRightDivide(a,b)} returns the pair \\spad{[q,r]} such that \\spad{a = q*b + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. \\spad{b} must be monic. This process is called ``right division''.")) (|monicLeftDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{monicLeftDivide(a,b)} returns the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. \\spad{b} must be monic. This process is called ``left division''.")) (|exquo| (((|Union| $ "failed") $ |#2|) "\\spad{exquo(l, a)} returns the exact quotient of \\spad{l} by a,{} returning \\axiom{\"failed\"} if this is not possible.")) (|apply| ((|#2| $ |#2| |#2|) "\\spad{apply(p, c, m)} returns \\spad{p(m)} where the action is given by \\spad{x m = c sigma(m) + delta(m)}.")) (|coefficients| (((|List| |#2|) $) "\\spad{coefficients(l)} returns the list of all the nonzero coefficients of \\spad{l}.")) (|monomial| (($ |#2| (|NonNegativeInteger|)) "\\spad{monomial(c,k)} produces \\spad{c} times the \\spad{k}-th power of the generating operator,{} \\spad{monomial(1,1)}.")) (|coefficient| ((|#2| $ (|NonNegativeInteger|)) "\\spad{coefficient(l,k)} is \\spad{a(k)} if \\indented{2}{\\spad{l = sum(monomial(a(i),i), i = 0..n)}.}")) (|reductum| (($ $) "\\spad{reductum(l)} is \\spad{l - monomial(a(n),n)} if \\indented{2}{\\spad{l = sum(monomial(a(i),i), i = 0..n)}.}")) (|leadingCoefficient| ((|#2| $) "\\spad{leadingCoefficient(l)} is \\spad{a(n)} if \\indented{2}{\\spad{l = sum(monomial(a(i),i), i = 0..n)}.}")) (|minimumDegree| (((|NonNegativeInteger|) $) "\\spad{minimumDegree(l)} is the smallest \\spad{k} such that \\spad{a(k) ~= 0} if \\indented{2}{\\spad{l = sum(monomial(a(i),i), i = 0..n)}.}")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(l)} is \\spad{n} if \\indented{2}{\\spad{l = sum(monomial(a(i),i), i = 0..n)}.}"))) NIL -((|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-175)))) -(-865 R) +((|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-175)))) +(-864 R) ((|constructor| (NIL "This is the category of univariate skew polynomials over an Ore coefficient ring. The multiplication is given by \\spad{x a = \\sigma(a) x + \\delta a}. This category is an evolution of the types \\indented{2}{MonogenicLinearOperator,{} OppositeMonogenicLinearOperator,{} and} \\indented{2}{NonCommutativeOperatorDivision} developped by Jean Della Dora and Stephen \\spad{M}. Watt.")) (|leftLcm| (($ $ $) "\\spad{leftLcm(a,b)} computes the value \\spad{m} of lowest degree such that \\spad{m = aa*a = bb*b} for some values \\spad{aa} and \\spad{bb}. The value \\spad{m} is computed using right-division.")) (|rightExtendedGcd| (((|Record| (|:| |coef1| $) (|:| |coef2| $) (|:| |generator| $)) $ $) "\\spad{rightExtendedGcd(a,b)} returns \\spad{[c,d]} such that \\spad{g = c * a + d * b = rightGcd(a, b)}.")) (|rightGcd| (($ $ $) "\\spad{rightGcd(a,b)} computes the value \\spad{g} of highest degree such that \\indented{3}{\\spad{a = aa*g}} \\indented{3}{\\spad{b = bb*g}} for some values \\spad{aa} and \\spad{bb}. The value \\spad{g} is computed using right-division.")) (|rightExactQuotient| (((|Union| $ "failed") $ $) "\\spad{rightExactQuotient(a,b)} computes the value \\spad{q},{} if it exists such that \\spad{a = q*b}.")) (|rightRemainder| (($ $ $) "\\spad{rightRemainder(a,b)} computes the pair \\spad{[q,r]} such that \\spad{a = q*b + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. The value \\spad{r} is returned.")) (|rightQuotient| (($ $ $) "\\spad{rightQuotient(a,b)} computes the pair \\spad{[q,r]} such that \\spad{a = q*b + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. The value \\spad{q} is returned.")) (|rightDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{rightDivide(a,b)} returns the pair \\spad{[q,r]} such that \\spad{a = q*b + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. This process is called ``right division''.")) (|rightLcm| (($ $ $) "\\spad{rightLcm(a,b)} computes the value \\spad{m} of lowest degree such that \\spad{m = a*aa = b*bb} for some values \\spad{aa} and \\spad{bb}. The value \\spad{m} is computed using left-division.")) (|leftExtendedGcd| (((|Record| (|:| |coef1| $) (|:| |coef2| $) (|:| |generator| $)) $ $) "\\spad{leftExtendedGcd(a,b)} returns \\spad{[c,d]} such that \\spad{g = a * c + b * d = leftGcd(a, b)}.")) (|leftGcd| (($ $ $) "\\spad{leftGcd(a,b)} computes the value \\spad{g} of highest degree such that \\indented{3}{\\spad{a = g*aa}} \\indented{3}{\\spad{b = g*bb}} for some values \\spad{aa} and \\spad{bb}. The value \\spad{g} is computed using left-division.")) (|leftExactQuotient| (((|Union| $ "failed") $ $) "\\spad{leftExactQuotient(a,b)} computes the value \\spad{q},{} if it exists,{} \\indented{1}{such that \\spad{a = b*q}.}")) (|leftRemainder| (($ $ $) "\\spad{leftRemainder(a,b)} computes the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. The value \\spad{r} is returned.")) (|leftQuotient| (($ $ $) "\\spad{leftQuotient(a,b)} computes the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. The value \\spad{q} is returned.")) (|leftDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{leftDivide(a,b)} returns the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. This process is called ``left division''.")) (|primitivePart| (($ $) "\\spad{primitivePart(l)} returns \\spad{l0} such that \\spad{l = a * l0} for some a in \\spad{R},{} and \\spad{content(l0) = 1}.")) (|content| ((|#1| $) "\\spad{content(l)} returns the gcd of all the coefficients of \\spad{l}.")) (|monicRightDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{monicRightDivide(a,b)} returns the pair \\spad{[q,r]} such that \\spad{a = q*b + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. \\spad{b} must be monic. This process is called ``right division''.")) (|monicLeftDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{monicLeftDivide(a,b)} returns the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. \\spad{b} must be monic. This process is called ``left division''.")) (|exquo| (((|Union| $ "failed") $ |#1|) "\\spad{exquo(l, a)} returns the exact quotient of \\spad{l} by a,{} returning \\axiom{\"failed\"} if this is not possible.")) (|apply| ((|#1| $ |#1| |#1|) "\\spad{apply(p, c, m)} returns \\spad{p(m)} where the action is given by \\spad{x m = c sigma(m) + delta(m)}.")) (|coefficients| (((|List| |#1|) $) "\\spad{coefficients(l)} returns the list of all the nonzero coefficients of \\spad{l}.")) (|monomial| (($ |#1| (|NonNegativeInteger|)) "\\spad{monomial(c,k)} produces \\spad{c} times the \\spad{k}-th power of the generating operator,{} \\spad{monomial(1,1)}.")) (|coefficient| ((|#1| $ (|NonNegativeInteger|)) "\\spad{coefficient(l,k)} is \\spad{a(k)} if \\indented{2}{\\spad{l = sum(monomial(a(i),i), i = 0..n)}.}")) (|reductum| (($ $) "\\spad{reductum(l)} is \\spad{l - monomial(a(n),n)} if \\indented{2}{\\spad{l = sum(monomial(a(i),i), i = 0..n)}.}")) (|leadingCoefficient| ((|#1| $) "\\spad{leadingCoefficient(l)} is \\spad{a(n)} if \\indented{2}{\\spad{l = sum(monomial(a(i),i), i = 0..n)}.}")) (|minimumDegree| (((|NonNegativeInteger|) $) "\\spad{minimumDegree(l)} is the smallest \\spad{k} such that \\spad{a(k) ~= 0} if \\indented{2}{\\spad{l = sum(monomial(a(i),i), i = 0..n)}.}")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(l)} is \\spad{n} if \\indented{2}{\\spad{l = sum(monomial(a(i),i), i = 0..n)}.}"))) -((-4418 . T) (-4419 . T) (-4421 . T)) +((-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-866 R C) +(-865 R C) ((|constructor| (NIL "\\spad{UnivariateSkewPolynomialCategoryOps} provides products and \\indented{1}{divisions of univariate skew polynomials.}")) (|rightDivide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2| (|Automorphism| |#1|)) "\\spad{rightDivide(a, b, sigma)} returns the pair \\spad{[q,r]} such that \\spad{a = q*b + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. This process is called ``right division''. \\spad{\\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 (-569)))) -(-867 R |sigma| -3661) +((|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) +(-866 R |sigma| -3660) ((|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."))) -((-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-376)))) -(-868 |x| R |sigma| -3661) +((-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-376)))) +(-867 |x| R |sigma| -3660) ((|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}."))) -((-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-376)))) -(-869 R) +((-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-376)))) +(-868 R) ((|constructor| (NIL "This package provides orthogonal polynomials as functions on a ring.")) (|legendreP| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{legendreP(n,x)} is the \\spad{n}-th Legendre polynomial,{} \\spad{P[n](x)}. These are defined by \\spad{1/sqrt(1-2*x*t+t**2) = sum(P[n](x)*t**n, n = 0..)}.")) (|laguerreL| ((|#1| (|NonNegativeInteger|) (|NonNegativeInteger|) |#1|) "\\spad{laguerreL(m,n,x)} is the associated Laguerre polynomial,{} \\spad{L<m>[n](x)}. This is the \\spad{m}-th derivative of \\spad{L[n](x)}.") ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{laguerreL(n,x)} is the \\spad{n}-th Laguerre polynomial,{} \\spad{L[n](x)}. These are defined by \\spad{exp(-t*x/(1-t))/(1-t) = sum(L[n](x)*t**n/n!, n = 0..)}.")) (|hermiteH| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{hermiteH(n,x)} is the \\spad{n}-th Hermite polynomial,{} \\spad{H[n](x)}. These are defined by \\spad{exp(2*t*x-t**2) = sum(H[n](x)*t**n/n!, n = 0..)}.")) (|chebyshevU| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{chebyshevU(n,x)} is the \\spad{n}-th Chebyshev polynomial of the second kind,{} \\spad{U[n](x)}. These are defined by \\spad{1/(1-2*t*x+t**2) = sum(T[n](x) *t**n, n = 0..)}.")) (|chebyshevT| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{chebyshevT(n,x)} is the \\spad{n}-th Chebyshev polynomial of the first kind,{} \\spad{T[n](x)}. These are defined by \\spad{(1-t*x)/(1-2*t*x+t**2) = sum(T[n](x) *t**n, n = 0..)}."))) NIL -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558)))))) -(-870) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557)))))) +(-869) ((|constructor| (NIL "Semigroups with compatible ordering."))) NIL NIL -(-871) +(-870) ((|constructor| (NIL "\\indented{1}{Author : Larry Lambe} Date created : 14 August 1988 Date Last Updated : 11 March 1991 Description : A domain used in order to take the free \\spad{R}-module on the Integers \\spad{I}. This is actually the forgetful functor from OrderedRings to OrderedSets applied to \\spad{I}")) (|value| (((|Integer|) $) "\\spad{value(x)} returns the integer associated with \\spad{x}")) (|coerce| (($ (|Integer|)) "\\spad{coerce(i)} returns the element corresponding to \\spad{i}"))) NIL NIL -(-872) +(-871) ((|constructor| (NIL "OutPackage allows pretty-printing from programs.")) (|outputList| (((|Void|) (|List| (|Any|))) "\\spad{outputList(l)} displays the concatenated components of the list \\spad{l} on the ``algebra output'' stream,{} as defined by \\spadsyscom{set output algebra}; quotes are stripped from strings.")) (|output| (((|Void|) (|String|) (|OutputForm|)) "\\spad{output(s,x)} displays the string \\spad{s} followed by the form \\spad{x} on the ``algebra output'' stream,{} as defined by \\spadsyscom{set output algebra}.") (((|Void|) (|OutputForm|)) "\\spad{output(x)} displays the output form \\spad{x} on the ``algebra output'' stream,{} as defined by \\spadsyscom{set output algebra}.") (((|Void|) (|String|)) "\\spad{output(s)} displays the string \\spad{s} on the ``algebra output'' stream,{} as defined by \\spadsyscom{set output algebra}."))) NIL NIL -(-873 S) +(-872 S) ((|constructor| (NIL "This category describes output byte stream conduits.")) (|writeBytes!| (((|NonNegativeInteger|) $ (|ByteBuffer|)) "\\spad{writeBytes!(c,b)} write bytes from buffer `b' onto the conduit `c'. The actual number of written bytes is returned.")) (|writeUInt8!| (((|Maybe| (|UInt8|)) $ (|UInt8|)) "\\spad{writeUInt8!(c,b)} attempts to write the unsigned 8-bit value `v' on the conduit `c'. Returns the written value if successful,{} otherwise,{} returns \\spad{nothing}.")) (|writeInt8!| (((|Maybe| (|Int8|)) $ (|Int8|)) "\\spad{writeInt8!(c,b)} attempts to write the 8-bit value `v' on the conduit `c'. Returns the written value if successful,{} otherwise,{} returns \\spad{nothing}.")) (|writeByte!| (((|Maybe| (|Byte|)) $ (|Byte|)) "\\spad{writeByte!(c,b)} attempts to write the byte `b' on the conduit `c'. Returns the written byte if successful,{} otherwise,{} returns \\spad{nothing}."))) NIL NIL -(-874) +(-873) ((|constructor| (NIL "This category describes output byte stream conduits.")) (|writeBytes!| (((|NonNegativeInteger|) $ (|ByteBuffer|)) "\\spad{writeBytes!(c,b)} write bytes from buffer `b' onto the conduit `c'. The actual number of written bytes is returned.")) (|writeUInt8!| (((|Maybe| (|UInt8|)) $ (|UInt8|)) "\\spad{writeUInt8!(c,b)} attempts to write the unsigned 8-bit value `v' on the conduit `c'. Returns the written value if successful,{} otherwise,{} returns \\spad{nothing}.")) (|writeInt8!| (((|Maybe| (|Int8|)) $ (|Int8|)) "\\spad{writeInt8!(c,b)} attempts to write the 8-bit value `v' on the conduit `c'. Returns the written value if successful,{} otherwise,{} returns \\spad{nothing}.")) (|writeByte!| (((|Maybe| (|Byte|)) $ (|Byte|)) "\\spad{writeByte!(c,b)} attempts to write the byte `b' on the conduit `c'. Returns the written byte if successful,{} otherwise,{} returns \\spad{nothing}."))) NIL NIL -(-875) +(-874) ((|constructor| (NIL "This domain provides representation for binary files open for output operations. `Binary' here means that the conduits do not interpret their contents.")) (|isOpen?| (((|Boolean|) $) "open?(ifile) holds if `ifile' is in open state.")) (|outputBinaryFile| (($ (|String|)) "\\spad{outputBinaryFile(f)} returns an output conduit obtained by opening the file named by `f' as a binary file.") (($ (|FileName|)) "\\spad{outputBinaryFile(f)} returns an output conduit obtained by opening the file named by `f' as a binary file."))) NIL NIL -(-876) +(-875) ((|constructor| (NIL "This domain is used to create and manipulate mathematical expressions for output. It is intended to provide an insulating layer between the expression rendering software (\\spadignore{e.g.} TeX,{} or Script) and the output coercions in the various domains.")) (SEGMENT (($ $) "\\spad{SEGMENT(x)} creates the prefix form: \\spad{x..}.") (($ $ $) "\\spad{SEGMENT(x,y)} creates the infix form: \\spad{x..y}.")) (|not| (($ $) "\\spad{not f} creates the equivalent prefix form.")) (|or| (($ $ $) "\\spad{f or g} creates the equivalent infix form.")) (|and| (($ $ $) "\\spad{f and g} creates the equivalent infix form.")) (|exquo| (($ $ $) "\\spad{exquo(f,g)} creates the equivalent infix form.")) (|quo| (($ $ $) "\\spad{f quo g} creates the equivalent infix form.")) (|rem| (($ $ $) "\\spad{f rem g} creates the equivalent infix form.")) (|div| (($ $ $) "\\spad{f div g} creates the equivalent infix form.")) (** (($ $ $) "\\spad{f ** g} creates the equivalent infix form.")) (/ (($ $ $) "\\spad{f / g} creates the equivalent infix form.")) (* (($ $ $) "\\spad{f * g} creates the equivalent infix form.")) (- (($ $) "\\spad{- f} creates the equivalent prefix form.") (($ $ $) "\\spad{f - g} creates the equivalent infix form.")) (+ (($ $ $) "\\spad{f + g} creates the equivalent infix form.")) (>= (($ $ $) "\\spad{f >= g} creates the equivalent infix form.")) (<= (($ $ $) "\\spad{f <= g} creates the equivalent infix form.")) (> (($ $ $) "\\spad{f > g} creates the equivalent infix form.")) (< (($ $ $) "\\spad{f < g} creates the equivalent infix form.")) (~= (($ $ $) "\\spad{f ~= g} creates the equivalent infix form.")) (= (($ $ $) "\\spad{f = g} creates the equivalent infix form.")) (|blankSeparate| (($ (|List| $)) "\\spad{blankSeparate(l)} creates the form separating the elements of \\spad{l} by blanks.")) (|semicolonSeparate| (($ (|List| $)) "\\spad{semicolonSeparate(l)} creates the form separating the elements of \\spad{l} by semicolons.")) (|commaSeparate| (($ (|List| $)) "\\spad{commaSeparate(l)} creates the form separating the elements of \\spad{l} by commas.")) (|pile| (($ (|List| $)) "\\spad{pile(l)} creates the form consisting of the elements of \\spad{l} which displays as a pile,{} \\spadignore{i.e.} the elements begin on a new line and are indented right to the same margin.")) (|paren| (($ (|List| $)) "\\spad{paren(lf)} creates the form separating the elements of \\spad{lf} by commas and encloses the result in parentheses.") (($ $) "\\spad{paren(f)} creates the form enclosing \\spad{f} in parentheses.")) (|bracket| (($ (|List| $)) "\\spad{bracket(lf)} creates the form separating the elements of \\spad{lf} by commas and encloses the result in square brackets.") (($ $) "\\spad{bracket(f)} creates the form enclosing \\spad{f} in square brackets.")) (|brace| (($ (|List| $)) "\\spad{brace(lf)} creates the form separating the elements of \\spad{lf} by commas and encloses the result in curly brackets.") (($ $) "\\spad{brace(f)} creates the form enclosing \\spad{f} in braces (curly brackets).")) (|int| (($ $ $ $) "\\spad{int(expr,lowerlimit,upperlimit)} creates the form prefixing \\spad{expr} by an integral sign with both a \\spad{lowerlimit} and \\spad{upperlimit}.") (($ $ $) "\\spad{int(expr,lowerlimit)} creates the form prefixing \\spad{expr} by an integral sign with a \\spad{lowerlimit}.") (($ $) "\\spad{int(expr)} creates the form prefixing \\spad{expr} with an integral sign.")) (|prod| (($ $ $ $) "\\spad{prod(expr,lowerlimit,upperlimit)} creates the form prefixing \\spad{expr} by a capital \\spad{pi} with both a \\spad{lowerlimit} and \\spad{upperlimit}.") (($ $ $) "\\spad{prod(expr,lowerlimit)} creates the form prefixing \\spad{expr} by a capital \\spad{pi} with a \\spad{lowerlimit}.") (($ $) "\\spad{prod(expr)} creates the form prefixing \\spad{expr} by a capital \\spad{pi}.")) (|sum| (($ $ $ $) "\\spad{sum(expr,lowerlimit,upperlimit)} creates the form prefixing \\spad{expr} by a capital sigma with both a \\spad{lowerlimit} and \\spad{upperlimit}.") (($ $ $) "\\spad{sum(expr,lowerlimit)} creates the form prefixing \\spad{expr} by a capital sigma with a \\spad{lowerlimit}.") (($ $) "\\spad{sum(expr)} creates the form prefixing \\spad{expr} by a capital sigma.")) (|overlabel| (($ $ $) "\\spad{overlabel(x,f)} creates the form \\spad{f} with \"x overbar\" over the top.")) (|overbar| (($ $) "\\spad{overbar(f)} creates the form \\spad{f} with an overbar.")) (|prime| (($ $ (|NonNegativeInteger|)) "\\spad{prime(f,n)} creates the form \\spad{f} followed by \\spad{n} primes.") (($ $) "\\spad{prime(f)} creates the form \\spad{f} followed by a suffix prime (single quote).")) (|dot| (($ $ (|NonNegativeInteger|)) "\\spad{dot(f,n)} creates the form \\spad{f} with \\spad{n} dots overhead.") (($ $) "\\spad{dot(f)} creates the form with a one dot overhead.")) (|quote| (($ $) "\\spad{quote(f)} creates the form \\spad{f} with a prefix quote.")) (|supersub| (($ $ (|List| $)) "\\spad{supersub(a,[sub1,super1,sub2,super2,...])} creates a form with each subscript aligned under each superscript.")) (|scripts| (($ $ (|List| $)) "\\spad{scripts(f, [sub, super, presuper, presub])} \\indented{1}{creates a form for \\spad{f} with scripts on all 4 corners.}")) (|presuper| (($ $ $) "\\spad{presuper(f,n)} creates a form for \\spad{f} presuperscripted by \\spad{n}.")) (|presub| (($ $ $) "\\spad{presub(f,n)} creates a form for \\spad{f} presubscripted by \\spad{n}.")) (|super| (($ $ $) "\\spad{super(f,n)} creates a form for \\spad{f} superscripted by \\spad{n}.")) (|sub| (($ $ $) "\\spad{sub(f,n)} creates a form for \\spad{f} subscripted by \\spad{n}.")) (|binomial| (($ $ $) "\\spad{binomial(n,m)} creates a form for the binomial coefficient of \\spad{n} and \\spad{m}.")) (|differentiate| (($ $ (|NonNegativeInteger|)) "\\spad{differentiate(f,n)} creates a form for the \\spad{n}th derivative of \\spad{f},{} \\spadignore{e.g.} \\spad{f'},{} \\spad{f''},{} \\spad{f'''},{} \"f super \\spad{iv}\".")) (|rarrow| (($ $ $) "\\spad{rarrow(f,g)} creates a form for the mapping \\spad{f -> g}.")) (|assign| (($ $ $) "\\spad{assign(f,g)} creates a form for the assignment \\spad{f := g}.")) (|slash| (($ $ $) "\\spad{slash(f,g)} creates a form for the horizontal fraction of \\spad{f} over \\spad{g}.")) (|over| (($ $ $) "\\spad{over(f,g)} creates a form for the vertical fraction of \\spad{f} over \\spad{g}.")) (|root| (($ $ $) "\\spad{root(f,n)} creates a form for the \\spad{n}th root of form \\spad{f}.") (($ $) "\\spad{root(f)} creates a form for the square root of form \\spad{f}.")) (|zag| (($ $ $) "\\spad{zag(f,g)} creates a form for the continued fraction form for \\spad{f} over \\spad{g}.")) (|matrix| (($ (|List| (|List| $))) "\\spad{matrix(llf)} makes \\spad{llf} (a list of lists of forms) into a form which displays as a matrix.")) (|box| (($ $) "\\spad{box(f)} encloses \\spad{f} in a box.")) (|label| (($ $ $) "\\spad{label(n,f)} gives form \\spad{f} an equation label \\spad{n}.")) (|string| (($ $) "\\spad{string(f)} creates \\spad{f} with string quotes.")) (|elt| (($ $ (|List| $)) "\\spad{elt(op,l)} creates a form for application of \\spad{op} to list of arguments \\spad{l}.")) (|infix?| (((|Boolean|) $) "\\spad{infix?(op)} returns \\spad{true} if \\spad{op} is an infix operator,{} and \\spad{false} otherwise.")) (|postfix| (($ $ $) "\\spad{postfix(op, a)} creates a form which prints as: a \\spad{op}.")) (|infix| (($ $ $ $) "\\spad{infix(op, a, b)} creates a form which prints as: a \\spad{op} \\spad{b}.") (($ $ (|List| $)) "\\spad{infix(f,l)} creates a form depicting the \\spad{n}-ary application of infix operation \\spad{f} to a tuple of arguments \\spad{l}.")) (|prefix| (($ $ (|List| $)) "\\spad{prefix(f,l)} creates a form depicting the \\spad{n}-ary prefix application of \\spad{f} to a tuple of arguments given by list \\spad{l}.")) (|vconcat| (($ (|List| $)) "\\spad{vconcat(u)} vertically concatenates all forms in list \\spad{u}.") (($ $ $) "\\spad{vconcat(f,g)} vertically concatenates forms \\spad{f} and \\spad{g}.")) (|hconcat| (($ (|List| $)) "\\spad{hconcat(u)} horizontally concatenates all forms in list \\spad{u}.") (($ $ $) "\\spad{hconcat(f,g)} horizontally concatenate forms \\spad{f} and \\spad{g}.")) (|center| (($ $) "\\spad{center(f)} centers form \\spad{f} in total space.") (($ $ (|Integer|)) "\\spad{center(f,n)} centers form \\spad{f} within space of width \\spad{n}.")) (|right| (($ $) "\\spad{right(f)} right-justifies form \\spad{f} in total space.") (($ $ (|Integer|)) "\\spad{right(f,n)} right-justifies form \\spad{f} within space of width \\spad{n}.")) (|left| (($ $) "\\spad{left(f)} left-justifies form \\spad{f} in total space.") (($ $ (|Integer|)) "\\spad{left(f,n)} left-justifies form \\spad{f} within space of width \\spad{n}.")) (|rspace| (($ (|Integer|) (|Integer|)) "\\spad{rspace(n,m)} creates rectangular white space,{} \\spad{n} wide by \\spad{m} high.")) (|vspace| (($ (|Integer|)) "\\spad{vspace(n)} creates white space of height \\spad{n}.")) (|hspace| (($ (|Integer|)) "\\spad{hspace(n)} creates white space of width \\spad{n}.")) (|superHeight| (((|Integer|) $) "\\spad{superHeight(f)} returns the height of form \\spad{f} above the base line.")) (|subHeight| (((|Integer|) $) "\\spad{subHeight(f)} returns the height of form \\spad{f} below the base line.")) (|height| (((|Integer|)) "\\spad{height()} returns the height of the display area (an integer).") (((|Integer|) $) "\\spad{height(f)} returns the height of form \\spad{f} (an integer).")) (|width| (((|Integer|)) "\\spad{width()} returns the width of the display area (an integer).") (((|Integer|) $) "\\spad{width(f)} returns the width of form \\spad{f} (an integer).")) (|doubleFloatFormat| (((|String|) (|String|)) "change the output format for doublefloats using lisp format strings")) (|empty| (($) "\\spad{empty()} creates an empty form.")) (|outputForm| (($ (|DoubleFloat|)) "\\spad{outputForm(sf)} creates an form for small float \\spad{sf}.") (($ (|String|)) "\\spad{outputForm(s)} creates an form for string \\spad{s}.") (($ (|Symbol|)) "\\spad{outputForm(s)} creates an form for symbol \\spad{s}.") (($ (|Integer|)) "\\spad{outputForm(n)} creates an form for integer \\spad{n}.")) (|messagePrint| (((|Void|) (|String|)) "\\spad{messagePrint(s)} prints \\spad{s} without string quotes. Note: \\spad{messagePrint(s)} is equivalent to \\spad{print message(s)}.")) (|message| (($ (|String|)) "\\spad{message(s)} creates an form with no string quotes from string \\spad{s}.")) (|print| (((|Void|) $) "\\spad{print(u)} prints the form \\spad{u}."))) NIL NIL -(-877 |VariableList|) +(-876 |VariableList|) ((|constructor| (NIL "This domain implements ordered variables")) (|variable| (((|Union| $ "failed") (|Symbol|)) "\\spad{variable(s)} returns a member of the variable set or failed"))) NIL NIL -(-878) +(-877) ((|constructor| (NIL "This domain represents set of overloaded operators (in fact operator descriptors).")) (|members| (((|List| (|FunctionDescriptor|)) $) "\\spad{members(x)} returns the list of operator descriptors,{} \\spadignore{e.g.} signature and implementation slots,{} of the overload set \\spad{x}.")) (|name| (((|Identifier|) $) "\\spad{name(x)} returns the name of the overload set \\spad{x}."))) NIL NIL -(-879 R |vl| |wl| |wtlevel|) +(-878 R |vl| |wl| |wtlevel|) ((|constructor| (NIL "This domain represents truncated weighted polynomials over the \"Polynomial\" type. The variables must be specified,{} as must the weights. The representation is sparse in the sense that only non-zero terms are represented.")) (|changeWeightLevel| (((|Void|) (|NonNegativeInteger|)) "\\spad{changeWeightLevel(n)} This changes the weight level to the new value given: NB: previously calculated terms are not affected")) (/ (((|Union| $ "failed") $ $) "\\spad{x/y} division (only works if minimum weight of divisor is zero,{} and if \\spad{R} is a Field)"))) -((-4419 |has| |#1| (-175)) (-4418 |has| |#1| (-175)) (-4421 . T)) +((-4418 |has| |#1| (-175)) (-4417 |has| |#1| (-175)) (-4420 . T)) ((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376)))) -(-880 R PS UP) +(-879 R PS UP) ((|constructor| (NIL "\\indented{1}{This package computes reliable Pad&ea. approximants using} a generalized Viskovatov continued fraction algorithm. Authors: Burge,{} Hassner & Watt. Date Created: April 1987 Date Last Updated: 12 April 1990 Keywords: Pade,{} series Examples: References: \\indented{2}{\"Pade Approximants,{} Part I: Basic Theory\",{} Baker & Graves-Morris.}")) (|padecf| (((|Union| (|ContinuedFraction| |#3|) "failed") (|NonNegativeInteger|) (|NonNegativeInteger|) |#2| |#2|) "\\spad{padecf(nd,dd,ns,ds)} computes the approximant as a continued fraction of polynomials (if it exists) for arguments \\spad{nd} (numerator degree of approximant),{} \\spad{dd} (denominator degree of approximant),{} \\spad{ns} (numerator series of function),{} and \\spad{ds} (denominator series of function).")) (|pade| (((|Union| (|Fraction| |#3|) "failed") (|NonNegativeInteger|) (|NonNegativeInteger|) |#2| |#2|) "\\spad{pade(nd,dd,ns,ds)} computes the approximant as a quotient of polynomials (if it exists) for arguments \\spad{nd} (numerator degree of approximant),{} \\spad{dd} (denominator degree of approximant),{} \\spad{ns} (numerator series of function),{} and \\spad{ds} (denominator series of function)."))) NIL NIL -(-881 R |x| |pt|) +(-880 R |x| |pt|) ((|constructor| (NIL "\\indented{1}{This package computes reliable Pad&ea. approximants using} a generalized Viskovatov continued fraction algorithm. Authors: Trager,{}Burge,{} Hassner & Watt. Date Created: April 1987 Date Last Updated: 12 April 1990 Keywords: Pade,{} series Examples: References: \\indented{2}{\"Pade Approximants,{} Part I: Basic Theory\",{} Baker & Graves-Morris.}")) (|pade| (((|Union| (|Fraction| (|UnivariatePolynomial| |#2| |#1|)) "failed") (|NonNegativeInteger|) (|NonNegativeInteger|) (|UnivariateTaylorSeries| |#1| |#2| |#3|)) "\\spad{pade(nd,dd,s)} computes the quotient of polynomials (if it exists) with numerator degree at most \\spad{nd} and denominator degree at most \\spad{dd} which matches the series \\spad{s} to order \\spad{nd + dd}.") (((|Union| (|Fraction| (|UnivariatePolynomial| |#2| |#1|)) "failed") (|NonNegativeInteger|) (|NonNegativeInteger|) (|UnivariateTaylorSeries| |#1| |#2| |#3|) (|UnivariateTaylorSeries| |#1| |#2| |#3|)) "\\spad{pade(nd,dd,ns,ds)} computes the approximant as a quotient of polynomials (if it exists) for arguments \\spad{nd} (numerator degree of approximant),{} \\spad{dd} (denominator degree of approximant),{} \\spad{ns} (numerator series of function),{} and \\spad{ds} (denominator series of function)."))) NIL NIL -(-882 |p|) +(-881 |p|) ((|constructor| (NIL "Stream-based implementation of Zp: \\spad{p}-adic numbers are represented as sum(\\spad{i} = 0..,{} a[\\spad{i}] * p^i),{} where the a[\\spad{i}] lie in 0,{}1,{}...,{}(\\spad{p} - 1)."))) -((-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-883 |p|) +(-882 |p|) ((|constructor| (NIL "This is the catefory of stream-based representations of \\indented{2}{the \\spad{p}-adic integers.}")) (|root| (($ (|SparseUnivariatePolynomial| (|Integer|)) (|Integer|)) "\\spad{root(f,a)} returns a root of the polynomial \\spad{f}. Argument \\spad{a} must be a root of \\spad{f} \\spad{(mod p)}.")) (|sqrt| (($ $ (|Integer|)) "\\spad{sqrt(b,a)} returns a square root of \\spad{b}. Argument \\spad{a} is a square root of \\spad{b} \\spad{(mod p)}.")) (|approximate| (((|Integer|) $ (|Integer|)) "\\spad{approximate(x,n)} returns an integer \\spad{y} such that \\spad{y = x (mod p^n)} when \\spad{n} is positive,{} and 0 otherwise.")) (|quotientByP| (($ $) "\\spad{quotientByP(x)} returns \\spad{b},{} where \\spad{x = a + b p}.")) (|moduloP| (((|Integer|) $) "\\spad{modulo(x)} returns a,{} where \\spad{x = a + b p}.")) (|modulus| (((|Integer|)) "\\spad{modulus()} returns the value of \\spad{p}.")) (|complete| (($ $) "\\spad{complete(x)} forces the computation of all digits.")) (|extend| (($ $ (|Integer|)) "\\spad{extend(x,n)} forces the computation of digits up to order \\spad{n}.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(x)} returns the exponent of the highest power of \\spad{p} dividing \\spad{x}.")) (|digits| (((|Stream| (|Integer|)) $) "\\spad{digits(x)} returns a stream of \\spad{p}-adic digits of \\spad{x}."))) -((-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-884 |p|) +(-883 |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)."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| (-882 |#1|) (QUOTE (-928))) (|HasCategory| (-882 |#1|) (|%list| (QUOTE -1058) (QUOTE (-1197)))) (|HasCategory| (-882 |#1|) (QUOTE (-147))) (|HasCategory| (-882 |#1|) (QUOTE (-149))) (|HasCategory| (-882 |#1|) (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-882 |#1|) (QUOTE (-1040))) (|HasCategory| (-882 |#1|) (QUOTE (-841))) (|HasCategory| (-882 |#1|) (QUOTE (-860))) (-3956 (|HasCategory| (-882 |#1|) (QUOTE (-841))) (|HasCategory| (-882 |#1|) (QUOTE (-860)))) (|HasCategory| (-882 |#1|) (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| (-882 |#1|) (QUOTE (-1172))) (|HasCategory| (-882 |#1|) (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-882 |#1|) (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-882 |#1|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-882 |#1|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-882 |#1|) (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| (-882 |#1|) (QUOTE (-239))) (|HasCategory| (-882 |#1|) (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| (-882 |#1|) (QUOTE (-240))) (|HasCategory| (-882 |#1|) (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| (-882 |#1|) (|%list| (QUOTE -526) (QUOTE (-1197)) (|%list| (QUOTE -882) (|devaluate| |#1|)))) (|HasCategory| (-882 |#1|) (|%list| (QUOTE -321) (|%list| (QUOTE -882) (|devaluate| |#1|)))) (|HasCategory| (-882 |#1|) (|%list| (QUOTE -298) (|%list| (QUOTE -882) (|devaluate| |#1|)) (|%list| (QUOTE -882) (|devaluate| |#1|)))) (|HasCategory| (-882 |#1|) (QUOTE (-319))) (|HasCategory| (-882 |#1|) (QUOTE (-557))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-882 |#1|) (QUOTE (-928)))) (-3956 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-882 |#1|) (QUOTE (-928)))) (|HasCategory| (-882 |#1|) (QUOTE (-147))))) -(-885 |p| PADIC) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| (-881 |#1|) (QUOTE (-927))) (|HasCategory| (-881 |#1|) (|%list| (QUOTE -1057) (QUOTE (-1196)))) (|HasCategory| (-881 |#1|) (QUOTE (-147))) (|HasCategory| (-881 |#1|) (QUOTE (-149))) (|HasCategory| (-881 |#1|) (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-881 |#1|) (QUOTE (-1039))) (|HasCategory| (-881 |#1|) (QUOTE (-840))) (|HasCategory| (-881 |#1|) (QUOTE (-859))) (-3955 (|HasCategory| (-881 |#1|) (QUOTE (-840))) (|HasCategory| (-881 |#1|) (QUOTE (-859)))) (|HasCategory| (-881 |#1|) (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| (-881 |#1|) (QUOTE (-1171))) (|HasCategory| (-881 |#1|) (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-881 |#1|) (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-881 |#1|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-881 |#1|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-881 |#1|) (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| (-881 |#1|) (QUOTE (-239))) (|HasCategory| (-881 |#1|) (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| (-881 |#1|) (QUOTE (-240))) (|HasCategory| (-881 |#1|) (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| (-881 |#1|) (|%list| (QUOTE -526) (QUOTE (-1196)) (|%list| (QUOTE -881) (|devaluate| |#1|)))) (|HasCategory| (-881 |#1|) (|%list| (QUOTE -321) (|%list| (QUOTE -881) (|devaluate| |#1|)))) (|HasCategory| (-881 |#1|) (|%list| (QUOTE -298) (|%list| (QUOTE -881) (|devaluate| |#1|)) (|%list| (QUOTE -881) (|devaluate| |#1|)))) (|HasCategory| (-881 |#1|) (QUOTE (-319))) (|HasCategory| (-881 |#1|) (QUOTE (-556))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-881 |#1|) (QUOTE (-927)))) (-3955 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-881 |#1|) (QUOTE (-927)))) (|HasCategory| (-881 |#1|) (QUOTE (-147))))) +(-884 |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)}."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-1197)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#2| (QUOTE (-1040))) (|HasCategory| |#2| (QUOTE (-841))) (|HasCategory| |#2| (QUOTE (-860))) (-3956 (|HasCategory| |#2| (QUOTE (-841))) (|HasCategory| |#2| (QUOTE (-860)))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-1172))) (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#2| (|%list| (QUOTE -526) (QUOTE (-1197)) (|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 (-557))) (-12 (|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#2| (QUOTE (-147))))) -(-886 S T$) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-1196)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#2| (QUOTE (-1039))) (|HasCategory| |#2| (QUOTE (-840))) (|HasCategory| |#2| (QUOTE (-859))) (-3955 (|HasCategory| |#2| (QUOTE (-840))) (|HasCategory| |#2| (QUOTE (-859)))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#2| (QUOTE (-1171))) (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#2| (|%list| (QUOTE -526) (QUOTE (-1196)) (|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 (-556))) (-12 (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#2| (QUOTE (-147))))) +(-885 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 (-1121))) (|HasCategory| |#2| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876))))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#2| (QUOTE (-1121))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))))) -(-887) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#2| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875))))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#2| (QUOTE (-1120))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))))) +(-886) ((|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 NIL -(-888) +(-887) ((|constructor| (NIL "This package provides a coerce from polynomials over algebraic numbers to \\spadtype{Expression AlgebraicNumber}.")) (|coerce| (((|Expression| (|Integer|)) (|Fraction| (|Polynomial| (|AlgebraicNumber|)))) "\\spad{coerce(rf)} converts \\spad{rf},{} a fraction of polynomial \\spad{p} with algebraic number coefficients to \\spadtype{Expression Integer}.") (((|Expression| (|Integer|)) (|Polynomial| (|AlgebraicNumber|))) "\\spad{coerce(p)} converts the polynomial \\spad{p} with algebraic number coefficients to \\spadtype{Expression Integer}."))) NIL NIL -(-889) +(-888) ((|constructor| (NIL "Representation of parameters to functions or constructors. For the most part,{} they are Identifiers. However,{} in very cases,{} they are \"flags\",{} \\spadignore{e.g.} string literals.")) (|autoCoerce| (((|String|) $) "\\spad{autoCoerce(x)@String} implicitly coerce the object \\spad{x} to \\spadtype{String}. This function is left at the discretion of the compiler.") (((|Identifier|) $) "\\spad{autoCoerce(x)@Identifier} implicitly coerce the object \\spad{x} to \\spadtype{Identifier}. This function is left at the discretion of the compiler.")) (|case| (((|Boolean|) $ (|[\|\|]| (|String|))) "\\spad{x case String} if the parameter AST object \\spad{x} designates a flag.") (((|Boolean|) $ (|[\|\|]| (|Identifier|))) "\\spad{x case Identifier} if the parameter AST object \\spad{x} designates an \\spadtype{Identifier}."))) NIL NIL -(-890 CF1 CF2) +(-889 CF1 CF2) ((|constructor| (NIL "This package \\undocumented")) (|map| (((|ParametricPlaneCurve| |#2|) (|Mapping| |#2| |#1|) (|ParametricPlaneCurve| |#1|)) "\\spad{map(f,x)} \\undocumented"))) NIL NIL -(-891 |ComponentFunction|) +(-890 |ComponentFunction|) ((|constructor| (NIL "ParametricPlaneCurve is used for plotting parametric plane curves in the affine plane.")) (|coordinate| ((|#1| $ (|NonNegativeInteger|)) "\\spad{coordinate(c,i)} returns a coordinate function for \\spad{c} using 1-based indexing according to \\spad{i}. This indicates what the function for the coordinate component \\spad{i} of the plane curve is.")) (|curve| (($ |#1| |#1|) "\\spad{curve(c1,c2)} creates a plane curve from 2 component functions \\spad{c1} and \\spad{c2}."))) NIL NIL -(-892 CF1 CF2) +(-891 CF1 CF2) ((|constructor| (NIL "This package \\undocumented")) (|map| (((|ParametricSpaceCurve| |#2|) (|Mapping| |#2| |#1|) (|ParametricSpaceCurve| |#1|)) "\\spad{map(f,x)} \\undocumented"))) NIL NIL -(-893 |ComponentFunction|) +(-892 |ComponentFunction|) ((|constructor| (NIL "ParametricSpaceCurve is used for plotting parametric space curves in affine 3-space.")) (|coordinate| ((|#1| $ (|NonNegativeInteger|)) "\\spad{coordinate(c,i)} returns a coordinate function of \\spad{c} using 1-based indexing according to \\spad{i}. This indicates what the function for the coordinate component,{} \\spad{i},{} of the space curve is.")) (|curve| (($ |#1| |#1| |#1|) "\\spad{curve(c1,c2,c3)} creates a space curve from 3 component functions \\spad{c1},{} \\spad{c2},{} and \\spad{c3}."))) NIL NIL -(-894) +(-893) ((|constructor| (NIL "\\indented{1}{This package provides a simple Spad script parser.} Related Constructors: Syntax. See Also: Syntax.")) (|getSyntaxFormsFromFile| (((|List| (|Syntax|)) (|String|)) "\\spad{getSyntaxFormsFromFile(f)} parses the source file \\spad{f} (supposedly containing Spad scripts) and returns a List Syntax. The filename \\spad{f} is supposed to have the proper extension. Note that source location information is not part of result."))) NIL NIL -(-895 CF1 CF2) +(-894 CF1 CF2) ((|constructor| (NIL "This package \\undocumented")) (|map| (((|ParametricSurface| |#2|) (|Mapping| |#2| |#1|) (|ParametricSurface| |#1|)) "\\spad{map(f,x)} \\undocumented"))) NIL NIL -(-896 |ComponentFunction|) +(-895 |ComponentFunction|) ((|constructor| (NIL "ParametricSurface is used for plotting parametric surfaces in affine 3-space.")) (|coordinate| ((|#1| $ (|NonNegativeInteger|)) "\\spad{coordinate(s,i)} returns a coordinate function of \\spad{s} using 1-based indexing according to \\spad{i}. This indicates what the function for the coordinate component,{} \\spad{i},{} of the surface is.")) (|surface| (($ |#1| |#1| |#1|) "\\spad{surface(c1,c2,c3)} creates a surface from 3 parametric component functions \\spad{c1},{} \\spad{c2},{} and \\spad{c3}."))) NIL NIL -(-897) +(-896) ((|constructor| (NIL "PartitionsAndPermutations contains functions for generating streams of integer partitions,{} and streams of sequences of integers composed from a multi-set.")) (|permutations| (((|Stream| (|List| (|Integer|))) (|Integer|)) "\\spad{permutations(n)} is the stream of permutations \\indented{1}{formed from \\spad{1,2,3,...,n}.}")) (|sequences| (((|Stream| (|List| (|Integer|))) (|List| (|Integer|))) "\\spad{sequences([l0,l1,l2,..,ln])} is the set of \\indented{1}{all sequences formed from} \\spad{l0} 0's,{}\\spad{l1} 1's,{}\\spad{l2} 2's,{}...,{}\\spad{ln} \\spad{n}'s.") (((|Stream| (|List| (|Integer|))) (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{sequences(l1,l2)} is the stream of all sequences that \\indented{1}{can be composed from the multiset defined from} \\indented{1}{two lists of integers \\spad{l1} and \\spad{l2}.} \\indented{1}{For example,{}the pair \\spad{([1,2,4],[2,3,5])} represents} \\indented{1}{multi-set with 1 \\spad{2},{} 2 \\spad{3}'s,{} and 4 \\spad{5}'s.}")) (|shufflein| (((|Stream| (|List| (|Integer|))) (|List| (|Integer|)) (|Stream| (|List| (|Integer|)))) "\\spad{shufflein(l,st)} maps shuffle(\\spad{l},{}\\spad{u}) on to all \\indented{1}{members \\spad{u} of \\spad{st},{} concatenating the results.}")) (|shuffle| (((|Stream| (|List| (|Integer|))) (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{shuffle(l1,l2)} forms the stream of all shuffles of \\spad{l1} \\indented{1}{and \\spad{l2},{} \\spadignore{i.e.} all sequences that can be formed from} \\indented{1}{merging \\spad{l1} and \\spad{l2}.}")) (|conjugates| (((|Stream| (|List| (|PositiveInteger|))) (|Stream| (|List| (|PositiveInteger|)))) "\\spad{conjugates(lp)} is the stream of conjugates of a stream \\indented{1}{of partitions \\spad{lp}.}")) (|conjugate| (((|List| (|PositiveInteger|)) (|List| (|PositiveInteger|))) "\\spad{conjugate(pt)} is the conjugate of the partition \\spad{pt}."))) NIL NIL -(-898 R) +(-897 R) ((|constructor| (NIL "An object \\spad{S} is Patternable over an object \\spad{R} if \\spad{S} can lift the conversions from \\spad{R} into \\spadtype{Pattern(Integer)} and \\spadtype{Pattern(Float)} to itself."))) NIL NIL -(-899 R S L) +(-898 R S L) ((|constructor| (NIL "A PatternMatchListResult is an object internally returned by the pattern matcher when matching on lists. It is either a failed match,{} or a pair of PatternMatchResult,{} one for atoms (elements of the list),{} and one for lists.")) (|lists| (((|PatternMatchResult| |#1| |#3|) $) "\\spad{lists(r)} returns the list of matches that match lists.")) (|atoms| (((|PatternMatchResult| |#1| |#2|) $) "\\spad{atoms(r)} returns the list of matches that match atoms (elements of the lists).")) (|makeResult| (($ (|PatternMatchResult| |#1| |#2|) (|PatternMatchResult| |#1| |#3|)) "\\spad{makeResult(r1,r2)} makes the combined result [\\spad{r1},{}\\spad{r2}].")) (|new| (($) "\\spad{new()} returns a new empty match result.")) (|failed| (($) "\\spad{failed()} returns a failed match.")) (|failed?| (((|Boolean|) $) "\\spad{failed?(r)} tests if \\spad{r} is a failed match."))) NIL NIL -(-900 S) +(-899 S) ((|constructor| (NIL "A set \\spad{R} is PatternMatchable over \\spad{S} if elements of \\spad{R} can be matched to patterns over \\spad{S}.")) (|patternMatch| (((|PatternMatchResult| |#1| $) $ (|Pattern| |#1|) (|PatternMatchResult| |#1| $)) "\\spad{patternMatch(expr, pat, res)} matches the pattern \\spad{pat} to the expression \\spad{expr}. res contains the variables of \\spad{pat} which are already matched and their matches (necessary for recursion). Initially,{} res is just the result of \\spadfun{new} which is an empty list of matches."))) NIL NIL -(-901 |Base| |Subject| |Pat|) +(-900 |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 (-2958 (|HasCategory| |#2| (QUOTE (-1069)))) (-2958 (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-1197)))))) (-12 (|HasCategory| |#2| (QUOTE (-1069))) (-2958 (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-1197)))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-1197))))) -(-902 R S) +((-12 (-2957 (|HasCategory| |#2| (QUOTE (-1068)))) (-2957 (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-1196)))))) (-12 (|HasCategory| |#2| (QUOTE (-1068))) (-2957 (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-1196)))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-1196))))) +(-901 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 NIL -(-903 R A B) +(-902 R A B) ((|constructor| (NIL "Lifts maps to pattern matching results.")) (|map| (((|PatternMatchResult| |#1| |#3|) (|Mapping| |#3| |#2|) (|PatternMatchResult| |#1| |#2|)) "\\spad{map(f, [(v1,a1),...,(vn,an)])} returns the matching result [(\\spad{v1},{}\\spad{f}(\\spad{a1})),{}...,{}(vn,{}\\spad{f}(an))]."))) NIL NIL -(-904 R) +(-903 R) ((|constructor| (NIL "Patterns for use by the pattern matcher.")) (|optpair| (((|Union| (|List| $) "failed") (|List| $)) "\\spad{optpair(l)} returns \\spad{l} has the form \\spad{[a, b]} and a is optional,{} and \"failed\" otherwise.")) (|variables| (((|List| $) $) "\\spad{variables(p)} returns the list of matching variables appearing in \\spad{p}.")) (|getBadValues| (((|List| (|Any|)) $) "\\spad{getBadValues(p)} returns the list of \"bad values\" for \\spad{p}. Note: \\spad{p} is not allowed to match any of its \"bad values\".")) (|addBadValue| (($ $ (|Any|)) "\\spad{addBadValue(p, v)} adds \\spad{v} to the list of \"bad values\" for \\spad{p}. Note: \\spad{p} is not allowed to match any of its \"bad values\".")) (|resetBadValues| (($ $) "\\spad{resetBadValues(p)} initializes the list of \"bad values\" for \\spad{p} to \\spad{[]}. Note: \\spad{p} is not allowed to match any of its \"bad values\".")) (|hasTopPredicate?| (((|Boolean|) $) "\\spad{hasTopPredicate?(p)} tests if \\spad{p} has a top-level predicate.")) (|topPredicate| (((|Record| (|:| |var| (|List| (|Symbol|))) (|:| |pred| (|Any|))) $) "\\spad{topPredicate(x)} returns \\spad{[[a1,...,an], f]} where the top-level predicate of \\spad{x} is \\spad{f(a1,...,an)}. Note: \\spad{n} is 0 if \\spad{x} has no top-level predicate.")) (|setTopPredicate| (($ $ (|List| (|Symbol|)) (|Any|)) "\\spad{setTopPredicate(x, [a1,...,an], f)} returns \\spad{x} with the top-level predicate set to \\spad{f(a1,...,an)}.")) (|patternVariable| (($ (|Symbol|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\spad{patternVariable(x, c?, o?, m?)} creates a pattern variable \\spad{x},{} which is constant if \\spad{c? = true},{} optional if \\spad{o? = true},{} and multiple if \\spad{m? = true}.")) (|withPredicates| (($ $ (|List| (|Any|))) "\\spad{withPredicates(p, [p1,...,pn])} makes a copy of \\spad{p} and attaches the predicate \\spad{p1} and ... and 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 -(-905 R -3069) +(-904 R -3068) ((|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 -(-906 R S) +(-905 R S) ((|constructor| (NIL "Lifts maps to patterns.")) (|map| (((|Pattern| |#2|) (|Mapping| |#2| |#1|) (|Pattern| |#1|)) "\\spad{map(f, p)} applies \\spad{f} to all the leaves of \\spad{p} and returns the result as a pattern over \\spad{S}."))) NIL NIL -(-907 |VarSet|) +(-906 |VarSet|) ((|constructor| (NIL "This domain provides the internal representation of polynomials in non-commutative variables written over the Poincare-Birkhoff-Witt basis. See the \\spadtype{XPBWPolynomial} domain constructor. See Free Lie Algebras by \\spad{C}. Reutenauer (Oxford science publications). \\newline Author: Michel Petitot (petitot@lifl.fr).")) (|varList| (((|List| |#1|) $) "\\spad{varList([l1]*[l2]*...[ln])} returns the list of variables in the word \\spad{l1*l2*...*ln}.")) (|retractable?| (((|Boolean|) $) "\\spad{retractable?([l1]*[l2]*...[ln])} returns \\spad{true} iff \\spad{n} equals \\spad{1}.")) (|rest| (($ $) "\\spad{rest([l1]*[l2]*...[ln])} returns the list \\spad{l2, .... ln}.")) (|ListOfTerms| (((|List| (|LyndonWord| |#1|)) $) "\\spad{ListOfTerms([l1]*[l2]*...[ln])} returns the list of words \\spad{l1, l2, .... ln}.")) (|length| (((|NonNegativeInteger|) $) "\\spad{length([l1]*[l2]*...[ln])} returns the length of the word \\spad{l1*l2*...*ln}.")) (|first| (((|LyndonWord| |#1|) $) "\\spad{first([l1]*[l2]*...[ln])} returns the Lyndon word \\spad{l1}.")) (|coerce| (($ |#1|) "\\spad{coerce(v)} return \\spad{v}") (((|OrderedFreeMonoid| |#1|) $) "\\spad{coerce([l1]*[l2]*...[ln])} returns the word \\spad{l1*l2*...*ln},{} where \\spad{[l_i]} is the backeted form of the Lyndon word \\spad{l_i}.")) ((|One|) (($) "\\spad{1} returns the empty list."))) NIL NIL -(-908 UP R) +(-907 UP R) ((|constructor| (NIL "This package \\undocumented")) (|compose| ((|#1| |#1| |#1|) "\\spad{compose(p,q)} \\undocumented"))) NIL NIL -(-909 A T$ S) +(-908 A T$ S) ((|constructor| (NIL "\\indented{2}{This category captures the interface of domains with a distinguished} \\indented{2}{operation named \\spad{differentiate} for partial differentiation with} \\indented{2}{respect to some domain of variables.} See Also: \\indented{2}{DifferentialDomain,{} PartialDifferentialSpace}")) (D ((|#2| $ |#3|) "\\spad{D(x,v)} is a shorthand for \\spad{differentiate(x,v)}")) (|differentiate| ((|#2| $ |#3|) "\\spad{differentiate(x,v)} computes the partial derivative of \\spad{x} with respect to \\spad{v}."))) NIL NIL -(-910 T$ S) +(-909 T$ S) ((|constructor| (NIL "\\indented{2}{This category captures the interface of domains with a distinguished} \\indented{2}{operation named \\spad{differentiate} for partial differentiation with} \\indented{2}{respect to some domain of variables.} See Also: \\indented{2}{DifferentialDomain,{} PartialDifferentialSpace}")) (D ((|#1| $ |#2|) "\\spad{D(x,v)} is a shorthand for \\spad{differentiate(x,v)}")) (|differentiate| ((|#1| $ |#2|) "\\spad{differentiate(x,v)} computes the partial derivative of \\spad{x} with respect to \\spad{v}."))) NIL NIL -(-911) +(-910) ((|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 -(-912 UP -3494) +(-911 UP -3493) ((|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 -(-913) +(-912) ((|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|)))) (|NumericalPDEProblem|) (|RoutinesTable|)) "\\spad{measure(prob,R)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical PDE problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} listed in \\axiom{\\spad{R}} of \\axiom{category} \\axiomType{PartialDifferentialEquationsSolverCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information. It predicts the likely most effective NAG numerical Library routine to solve the input set of PDEs by checking various attributes of the system of PDEs and calculating a measure of compatibility of each routine to these attributes.") (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|)))) (|NumericalPDEProblem|)) "\\spad{measure(prob)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical PDE problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} of \\axiom{category} \\axiomType{PartialDifferentialEquationsSolverCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information. It predicts the likely most effective NAG numerical Library routine to solve the input set of PDEs by checking various attributes of the system of PDEs and calculating a measure of compatibility of each routine to these attributes.")) (|solve| (((|Result|) (|Float|) (|Float|) (|Float|) (|Float|) (|NonNegativeInteger|) (|NonNegativeInteger|) (|List| (|Expression| (|Float|))) (|List| (|List| (|Expression| (|Float|)))) (|String|)) "\\spad{solve(xmin,ymin,xmax,ymax,ngx,ngy,pde,bounds,st)} is a top level ANNA function to solve numerically a system of partial differential equations. This is defined as a list of coefficients (\\axiom{\\spad{pde}}),{} a grid (\\axiom{\\spad{xmin}},{} \\axiom{\\spad{ymin}},{} \\axiom{\\spad{xmax}},{} \\axiom{\\spad{ymax}},{} \\axiom{\\spad{ngx}},{} \\axiom{\\spad{ngy}}) and the boundary values (\\axiom{\\spad{bounds}}). A default value for tolerance is used. There is also a parameter (\\axiom{\\spad{st}}) which should contain the value \"elliptic\" if the PDE is known to be elliptic,{} or \"unknown\" if it is uncertain. This causes the routine to check whether the PDE is elliptic. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of PDE's and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine. \\blankline ** At the moment,{} only Second Order Elliptic Partial Differential Equations are solved **") (((|Result|) (|Float|) (|Float|) (|Float|) (|Float|) (|NonNegativeInteger|) (|NonNegativeInteger|) (|List| (|Expression| (|Float|))) (|List| (|List| (|Expression| (|Float|)))) (|String|) (|DoubleFloat|)) "\\spad{solve(xmin,ymin,xmax,ymax,ngx,ngy,pde,bounds,st,tol)} is a top level ANNA function to solve numerically a system of partial differential equations. This is defined as a list of coefficients (\\axiom{\\spad{pde}}),{} a grid (\\axiom{\\spad{xmin}},{} \\axiom{\\spad{ymin}},{} \\axiom{\\spad{xmax}},{} \\axiom{\\spad{ymax}},{} \\axiom{\\spad{ngx}},{} \\axiom{\\spad{ngy}}),{} the boundary values (\\axiom{\\spad{bounds}}) and a tolerance requirement (\\axiom{\\spad{tol}}). There is also a parameter (\\axiom{\\spad{st}}) which should contain the value \"elliptic\" if the PDE is known to be elliptic,{} or \"unknown\" if it is uncertain. This causes the routine to check whether the PDE is elliptic. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of PDE's and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine. \\blankline ** At the moment,{} only Second Order Elliptic Partial Differential Equations are solved **") (((|Result|) (|NumericalPDEProblem|) (|RoutinesTable|)) "\\spad{solve(PDEProblem,routines)} is a top level ANNA function to solve numerically a system of partial differential equations. \\blankline The method used to perform the numerical process will be one of the \\spad{routines} contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of PDE's and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine. \\blankline ** At the moment,{} only Second Order Elliptic Partial Differential Equations are solved **") (((|Result|) (|NumericalPDEProblem|)) "\\spad{solve(PDEProblem)} is a top level ANNA function to solve numerically a system of partial differential equations. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of PDE's and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine. \\blankline ** At the moment,{} only Second Order Elliptic Partial Differential Equations are solved **"))) NIL NIL -(-914) +(-913) ((|retract| (((|Record| (|:| |pde| (|List| (|Expression| (|DoubleFloat|)))) (|:| |constraints| (|List| (|Record| (|:| |start| (|DoubleFloat|)) (|:| |finish| (|DoubleFloat|)) (|:| |grid| (|NonNegativeInteger|)) (|:| |boundaryType| (|Integer|)) (|:| |dStart| (|Matrix| (|DoubleFloat|))) (|:| |dFinish| (|Matrix| (|DoubleFloat|)))))) (|:| |f| (|List| (|List| (|Expression| (|DoubleFloat|))))) (|:| |st| (|String|)) (|:| |tol| (|DoubleFloat|))) $) "\\spad{retract(x)} \\undocumented{}")) (|coerce| (($ (|Record| (|:| |pde| (|List| (|Expression| (|DoubleFloat|)))) (|:| |constraints| (|List| (|Record| (|:| |start| (|DoubleFloat|)) (|:| |finish| (|DoubleFloat|)) (|:| |grid| (|NonNegativeInteger|)) (|:| |boundaryType| (|Integer|)) (|:| |dStart| (|Matrix| (|DoubleFloat|))) (|:| |dFinish| (|Matrix| (|DoubleFloat|)))))) (|:| |f| (|List| (|List| (|Expression| (|DoubleFloat|))))) (|:| |st| (|String|)) (|:| |tol| (|DoubleFloat|)))) "\\spad{coerce(x)} \\undocumented{}"))) NIL NIL -(-915 R S) +(-914 R S) ((|constructor| (NIL "A partial differential \\spad{R}-module with differentiations indexed by a parameter type \\spad{S}. \\blankline"))) -((-4419 . T) (-4418 . T)) +((-4418 . T) (-4417 . T)) NIL -(-916 S) +(-915 S) ((|constructor| (NIL "A partial differential ring with differentiations indexed by a parameter type \\spad{S}. \\blankline"))) -((-4421 . T)) +((-4420 . T)) NIL -(-917 A S) +(-916 A S) ((|constructor| (NIL "\\indented{2}{This category captures the interface of domains stable by partial} \\indented{2}{differentiation with respect to variables from some domain.} See Also: \\indented{2}{PartialDifferentialDomain}")) (D (($ $ (|List| |#2|) (|List| (|NonNegativeInteger|))) "\\spad{D(x,[s1,...,sn],[n1,...,nn])} is a shorthand for \\spad{differentiate(x,[s1,...,sn],[n1,...,nn])}.") (($ $ |#2| (|NonNegativeInteger|)) "\\spad{D(x,s,n)} is a shorthand for \\spad{differentiate(x,s,n)}.") (($ $ (|List| |#2|)) "\\spad{D(x,[s1,...sn])} is a shorthand for \\spad{differentiate(x,[s1,...sn])}.")) (|differentiate| (($ $ (|List| |#2|) (|List| (|NonNegativeInteger|))) "\\spad{differentiate(x,[s1,...,sn],[n1,...,nn])} computes multiple partial derivatives,{} \\spadignore{i.e.}") (($ $ |#2| (|NonNegativeInteger|)) "\\spad{differentiate(x,s,n)} computes multiple partial derivatives,{} \\spadignore{i.e.} \\spad{n}\\spad{-}th derivative of \\spad{x} with respect to \\spad{s}.") (($ $ (|List| |#2|)) "\\spad{differentiate(x,[s1,...sn])} computes successive partial derivatives,{} \\spadignore{i.e.} \\spad{differentiate(...differentiate(x, s1)..., sn)}."))) NIL NIL -(-918 S) +(-917 S) ((|constructor| (NIL "\\indented{2}{This category captures the interface of domains stable by partial} \\indented{2}{differentiation with respect to variables from some domain.} See Also: \\indented{2}{PartialDifferentialDomain}")) (D (($ $ (|List| |#1|) (|List| (|NonNegativeInteger|))) "\\spad{D(x,[s1,...,sn],[n1,...,nn])} is a shorthand for \\spad{differentiate(x,[s1,...,sn],[n1,...,nn])}.") (($ $ |#1| (|NonNegativeInteger|)) "\\spad{D(x,s,n)} is a shorthand for \\spad{differentiate(x,s,n)}.") (($ $ (|List| |#1|)) "\\spad{D(x,[s1,...sn])} is a shorthand for \\spad{differentiate(x,[s1,...sn])}.")) (|differentiate| (($ $ (|List| |#1|) (|List| (|NonNegativeInteger|))) "\\spad{differentiate(x,[s1,...,sn],[n1,...,nn])} computes multiple partial derivatives,{} \\spadignore{i.e.}") (($ $ |#1| (|NonNegativeInteger|)) "\\spad{differentiate(x,s,n)} computes multiple partial derivatives,{} \\spadignore{i.e.} \\spad{n}\\spad{-}th derivative of \\spad{x} with respect to \\spad{s}.") (($ $ (|List| |#1|)) "\\spad{differentiate(x,[s1,...sn])} computes successive partial derivatives,{} \\spadignore{i.e.} \\spad{differentiate(...differentiate(x, s1)..., sn)}."))) NIL NIL -(-919 S) +(-918 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 (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) -(-920 S) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102)))) +(-919 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."))) -((-4421 . T)) -((-3956 (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-860)))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-860)))) -(-921 |n| R) +((-4420 . T)) +((-3955 (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-859)))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-859)))) +(-920 |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 NIL -(-922 S) +(-921 S) ((|constructor| (NIL "PermutationCategory provides a categorial environment \\indented{1}{for subgroups of bijections of a set (\\spadignore{i.e.} permutations)}")) (< (((|Boolean|) $ $) "\\spad{p < q} is an order relation on permutations. Note: this order is only total if and only if \\spad{S} is totally ordered or \\spad{S} is finite.")) (|orbit| (((|Set| |#1|) $ |#1|) "\\spad{orbit(p, el)} returns the orbit of {\\em el} under the permutation \\spad{p},{} \\spadignore{i.e.} the set which is given by applications of the powers of \\spad{p} to {\\em el}.")) (|support| (((|Set| |#1|) $) "\\spad{support p} returns the set of points not fixed by the permutation \\spad{p}.")) (|cycles| (($ (|List| (|List| |#1|))) "\\spad{cycles(lls)} coerces a list list of cycles {\\em lls} to a permutation,{} each cycle being a list with not repetitions,{} is coerced to the permutation,{} which maps {\\em ls.i} to {\\em ls.i+1},{} indices modulo the length of the list,{} then these permutations are mutiplied. Error: if repetitions occur in one cycle.")) (|cycle| (($ (|List| |#1|)) "\\spad{cycle(ls)} coerces a cycle {\\em ls},{} \\spadignore{i.e.} a list with not repetitions to a permutation,{} which maps {\\em ls.i} to {\\em ls.i+1},{} indices modulo the length of the list. Error: if repetitions occur."))) -((-4421 . T)) +((-4420 . T)) NIL -(-923 S) +(-922 S) ((|constructor| (NIL "PermutationGroup implements permutation groups acting on a set \\spad{S},{} \\spadignore{i.e.} all subgroups of the symmetric group of \\spad{S},{} represented as a list of permutations (generators). Note that therefore the objects are not members of the \\Language category \\spadtype{Group}. Using the idea of base and strong generators by Sims,{} basic routines and algorithms are implemented so that the word problem for permutation groups can be solved.")) (|initializeGroupForWordProblem| (((|Void|) $ (|Integer|) (|Integer|)) "\\spad{initializeGroupForWordProblem(gp,m,n)} initializes the group {\\em gp} for the word problem. Notes: (1) with a small integer you get shorter words,{} but the routine takes longer than the standard routine for longer words. (2) be careful: invoking this routine will destroy the possibly stored information about your group (but will recompute it again). (3) users need not call this function normally for the soultion of the word problem.") (((|Void|) $) "\\spad{initializeGroupForWordProblem(gp)} initializes the group {\\em gp} for the word problem. Notes: it calls the other function of this name with parameters 0 and 1: {\\em initializeGroupForWordProblem(gp,0,1)}. Notes: (1) be careful: invoking this routine will destroy the possibly information about your group (but will recompute it again) (2) users need not call this function normally for the soultion of the word problem.")) (<= (((|Boolean|) $ $) "\\spad{gp1 <= gp2} returns \\spad{true} if and only if {\\em gp1} is a subgroup of {\\em gp2}. Note: because of a bug in the parser you have to call this function explicitly by {\\em gp1 <=\\$(PERMGRP S) gp2}.")) (< (((|Boolean|) $ $) "\\spad{gp1 < gp2} returns \\spad{true} if and only if {\\em gp1} is a proper subgroup of {\\em gp2}.")) (|support| (((|Set| |#1|) $) "\\spad{support(gp)} returns the points moved by the group {\\em gp}.")) (|wordInGenerators| (((|List| (|NonNegativeInteger|)) (|Permutation| |#1|) $) "\\spad{wordInGenerators(p,gp)} returns the word for the permutation \\spad{p} in the original generators of the group {\\em gp},{} represented by the indices of the list,{} given by {\\em generators}.")) (|wordInStrongGenerators| (((|List| (|NonNegativeInteger|)) (|Permutation| |#1|) $) "\\spad{wordInStrongGenerators(p,gp)} returns the word for the permutation \\spad{p} in the strong generators of the group {\\em gp},{} represented by the indices of the list,{} given by {\\em strongGenerators}.")) (|member?| (((|Boolean|) (|Permutation| |#1|) $) "\\spad{member?(pp,gp)} answers the question,{} whether the permutation {\\em pp} is in the group {\\em gp} or not.")) (|orbits| (((|Set| (|Set| |#1|)) $) "\\spad{orbits(gp)} returns the orbits of the group {\\em gp},{} \\spadignore{i.e.} it partitions the (finite) of all moved points.")) (|orbit| (((|Set| (|List| |#1|)) $ (|List| |#1|)) "\\spad{orbit(gp,ls)} returns the orbit of the ordered list {\\em ls} under the group {\\em gp}. Note: return type is \\spad{L} \\spad{L} \\spad{S} temporarily because FSET \\spad{L} \\spad{S} has an error.") (((|Set| (|Set| |#1|)) $ (|Set| |#1|)) "\\spad{orbit(gp,els)} returns the orbit of the unordered set {\\em els} under the group {\\em gp}.") (((|Set| |#1|) $ |#1|) "\\spad{orbit(gp,el)} returns the orbit of the element {\\em el} under the group {\\em gp},{} \\spadignore{i.e.} the set of all points gained by applying each group element to {\\em el}.")) (|permutationGroup| (($ (|List| (|Permutation| |#1|))) "\\spad{permutationGroup(ls)} coerces a list of permutations {\\em ls} to the group generated by this list.")) (|wordsForStrongGenerators| (((|List| (|List| (|NonNegativeInteger|))) $) "\\spad{wordsForStrongGenerators(gp)} returns the words for the strong generators of the group {\\em gp} in the original generators of {\\em gp},{} represented by their indices in the list,{} given by {\\em generators}.")) (|strongGenerators| (((|List| (|Permutation| |#1|)) $) "\\spad{strongGenerators(gp)} returns strong generators for the group {\\em gp}.")) (|base| (((|List| |#1|) $) "\\spad{base(gp)} returns a base for the group {\\em gp}.")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(gp)} returns the number of points moved by all permutations of the group {\\em gp}.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(gp)} returns the order of the group {\\em gp}.")) (|random| (((|Permutation| |#1|) $) "\\spad{random(gp)} returns a random product of maximal 20 generators of the group {\\em gp}. Note: {\\em random(gp)=random(gp,20)}.") (((|Permutation| |#1|) $ (|Integer|)) "\\spad{random(gp,i)} returns a random product of maximal \\spad{i} generators of the group {\\em gp}.")) (|elt| (((|Permutation| |#1|) $ (|NonNegativeInteger|)) "\\spad{elt(gp,i)} returns the \\spad{i}-th generator of the group {\\em gp}.")) (|generators| (((|List| (|Permutation| |#1|)) $) "\\spad{generators(gp)} returns the generators of the group {\\em gp}.")) (|coerce| (($ (|List| (|Permutation| |#1|))) "\\spad{coerce(ls)} coerces a list of permutations {\\em ls} to the group generated by this list.") (((|List| (|Permutation| |#1|)) $) "\\spad{coerce(gp)} returns the generators of the group {\\em gp}."))) NIL NIL -(-924 |p|) +(-923 |p|) ((|constructor| (NIL "PrimeField(\\spad{p}) implements the field with \\spad{p} elements if \\spad{p} is a prime number. Error: if \\spad{p} is not prime. Note: this domain does not check that argument is a prime."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) ((|HasCategory| $ (QUOTE (-149))) (|HasCategory| $ (QUOTE (-147))) (|HasCategory| $ (QUOTE (-381)))) -(-925 R E |VarSet| S) +(-924 R E |VarSet| S) ((|constructor| (NIL "PolynomialFactorizationByRecursion(\\spad{R},{}\\spad{E},{}\\spad{VarSet},{}\\spad{S}) is used for factorization of sparse univariate polynomials over a domain \\spad{S} of multivariate polynomials over \\spad{R}.")) (|factorSFBRlcUnit| (((|Factored| (|SparseUnivariatePolynomial| |#4|)) (|List| |#3|) (|SparseUnivariatePolynomial| |#4|)) "\\spad{factorSFBRlcUnit(p)} returns the square free factorization of polynomial \\spad{p} (see \\spadfun{factorSquareFreeByRecursion}{PolynomialFactorizationByRecursionUnivariate}) in the case where the leading coefficient of \\spad{p} is a unit.")) (|bivariateSLPEBR| (((|Union| (|List| (|SparseUnivariatePolynomial| |#4|)) "failed") (|List| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|) |#3|) "\\spad{bivariateSLPEBR(lp,p,v)} implements the bivariate case of \\spadfunFrom{solveLinearPolynomialEquationByRecursion}{PolynomialFactorizationByRecursionUnivariate}; its implementation depends on \\spad{R}")) (|randomR| ((|#1|) "\\spad{randomR produces} a random element of \\spad{R}")) (|factorSquareFreeByRecursion| (((|Factored| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|)) "\\spad{factorSquareFreeByRecursion(p)} returns the square free factorization of \\spad{p}. This functions performs the recursion step for factorSquareFreePolynomial,{} as defined in \\spadfun{PolynomialFactorizationExplicit} category (see \\spadfun{factorSquareFreePolynomial}).")) (|factorByRecursion| (((|Factored| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|)) "\\spad{factorByRecursion(p)} factors polynomial \\spad{p}. This function performs the recursion step for factorPolynomial,{} as defined in \\spadfun{PolynomialFactorizationExplicit} category (see \\spadfun{factorPolynomial})")) (|solveLinearPolynomialEquationByRecursion| (((|Union| (|List| (|SparseUnivariatePolynomial| |#4|)) "failed") (|List| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|)) "\\spad{solveLinearPolynomialEquationByRecursion([p1,...,pn],p)} returns the list of polynomials \\spad{[q1,...,qn]} such that \\spad{sum qi/pi = p / prod pi},{} a recursion step for solveLinearPolynomialEquation as defined in \\spadfun{PolynomialFactorizationExplicit} category (see \\spadfun{solveLinearPolynomialEquation}). If no such list of \\spad{qi} exists,{} then \"failed\" is returned."))) NIL NIL -(-926 R S) +(-925 R S) ((|constructor| (NIL "\\indented{1}{PolynomialFactorizationByRecursionUnivariate} \\spad{R} is a \\spadfun{PolynomialFactorizationExplicit} domain,{} \\spad{S} is univariate polynomials over \\spad{R} We are interested in handling SparseUnivariatePolynomials over \\spad{S},{} is a variable we shall call \\spad{z}")) (|factorSFBRlcUnit| (((|Factored| (|SparseUnivariatePolynomial| |#2|)) (|SparseUnivariatePolynomial| |#2|)) "\\spad{factorSFBRlcUnit(p)} returns the square free factorization of polynomial \\spad{p} (see \\spadfun{factorSquareFreeByRecursion}{PolynomialFactorizationByRecursionUnivariate}) in the case where the leading coefficient of \\spad{p} is a unit.")) (|randomR| ((|#1|) "\\spad{randomR()} produces a random element of \\spad{R}")) (|factorSquareFreeByRecursion| (((|Factored| (|SparseUnivariatePolynomial| |#2|)) (|SparseUnivariatePolynomial| |#2|)) "\\spad{factorSquareFreeByRecursion(p)} returns the square free factorization of \\spad{p}. This functions performs the recursion step for factorSquareFreePolynomial,{} as defined in \\spadfun{PolynomialFactorizationExplicit} category (see \\spadfun{factorSquareFreePolynomial}).")) (|factorByRecursion| (((|Factored| (|SparseUnivariatePolynomial| |#2|)) (|SparseUnivariatePolynomial| |#2|)) "\\spad{factorByRecursion(p)} factors polynomial \\spad{p}. This function performs the recursion step for factorPolynomial,{} as defined in \\spadfun{PolynomialFactorizationExplicit} category (see \\spadfun{factorPolynomial})")) (|solveLinearPolynomialEquationByRecursion| (((|Union| (|List| (|SparseUnivariatePolynomial| |#2|)) "failed") (|List| (|SparseUnivariatePolynomial| |#2|)) (|SparseUnivariatePolynomial| |#2|)) "\\spad{solveLinearPolynomialEquationByRecursion([p1,...,pn],p)} returns the list of polynomials \\spad{[q1,...,qn]} such that \\spad{sum qi/pi = p / prod pi},{} a recursion step for solveLinearPolynomialEquation as defined in \\spadfun{PolynomialFactorizationExplicit} category (see \\spadfun{solveLinearPolynomialEquation}). If no such list of \\spad{qi} exists,{} then \"failed\" is returned."))) NIL NIL -(-927 S) +(-926 S) ((|constructor| (NIL "This is the category of domains that know \"enough\" about themselves in order to factor univariate polynomials over themselves. This will be used in future releases for supporting factorization over finitely generated coefficient fields,{} it is not yet available in the current release of axiom.")) (|charthRoot| (((|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}."))) NIL ((|HasCategory| |#1| (QUOTE (-147)))) -(-928) +(-927) ((|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}."))) -((-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-929 R0 -3494 UP UPUP R) +(-928 R0 -3493 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 -(-930 UP UPUP R) +(-929 UP UPUP R) ((|constructor| (NIL "This package provides function for testing whether a divisor on a curve is a torsion divisor.")) (|torsionIfCan| (((|Union| (|Record| (|:| |order| (|NonNegativeInteger|)) (|:| |function| |#3|)) "failed") (|FiniteDivisor| (|Fraction| (|Integer|)) |#1| |#2| |#3|)) "\\spad{torsionIfCan(f)} \\undocumented")) (|torsion?| (((|Boolean|) (|FiniteDivisor| (|Fraction| (|Integer|)) |#1| |#2| |#3|)) "\\spad{torsion?(f)} \\undocumented")) (|order| (((|Union| (|NonNegativeInteger|) "failed") (|FiniteDivisor| (|Fraction| (|Integer|)) |#1| |#2| |#3|)) "\\spad{order(f)} \\undocumented"))) NIL NIL -(-931 UP UPUP) +(-930 UP UPUP) ((|constructor| (NIL "\\indented{1}{Utilities for PFOQ and PFO} Author: Manuel Bronstein Date Created: 25 Aug 1988 Date Last Updated: 11 Jul 1990")) (|polyred| ((|#2| |#2|) "\\spad{polyred(u)} \\undocumented")) (|doubleDisc| (((|Integer|) |#2|) "\\spad{doubleDisc(u)} \\undocumented")) (|mix| (((|Integer|) (|List| (|Record| (|:| |den| (|Integer|)) (|:| |gcdnum| (|Integer|))))) "\\spad{mix(l)} \\undocumented")) (|badNum| (((|Integer|) |#2|) "\\spad{badNum(u)} \\undocumented") (((|Record| (|:| |den| (|Integer|)) (|:| |gcdnum| (|Integer|))) |#1|) "\\spad{badNum(p)} \\undocumented")) (|getGoodPrime| (((|PositiveInteger|) (|Integer|)) "\\spad{getGoodPrime n} returns the smallest prime not dividing \\spad{n}"))) NIL NIL -(-932 R) +(-931 R) ((|constructor| (NIL "The domain \\spadtype{PartialFraction} implements partial fractions over a euclidean domain \\spad{R}. This requirement on the argument domain allows us to normalize the fractions. Of particular interest are the 2 forms for these fractions. The ``compact'' form has only one fractional term per prime in the denominator,{} while the ``p-adic'' form expands each numerator \\spad{p}-adically via the prime \\spad{p} in the denominator. For computational efficiency,{} the compact form is used,{} though the \\spad{p}-adic form may be gotten by calling the function \\spadfunFrom{padicFraction}{PartialFraction}. For a general euclidean domain,{} it is not known how to factor the denominator. Thus the function \\spadfunFrom{partialFraction}{PartialFraction} takes as its second argument an element of \\spadtype{Factored(R)}.")) (|wholePart| ((|#1| $) "\\spad{wholePart(p)} extracts the whole part of the partial fraction \\spad{p}.")) (|partialFraction| (($ |#1| (|Factored| |#1|)) "\\spad{partialFraction(numer,denom)} is the main function for constructing partial fractions. The second argument is the denominator and should be factored.")) (|padicFraction| (($ $) "\\spad{padicFraction(q)} expands the fraction \\spad{p}-adically in the primes \\spad{p} in the denominator of \\spad{q}. For example,{} \\spad{padicFraction(3/(2**2)) = 1/2 + 1/(2**2)}. Use \\spadfunFrom{compactFraction}{PartialFraction} to return to compact form.")) (|padicallyExpand| (((|SparseUnivariatePolynomial| |#1|) |#1| |#1|) "\\spad{padicallyExpand(p,x)} is a utility function that expands the second argument \\spad{x} ``p-adically'' in the first.")) (|numberOfFractionalTerms| (((|Integer|) $) "\\spad{numberOfFractionalTerms(p)} computes the number of fractional terms in \\spad{p}. This returns 0 if there is no fractional part.")) (|nthFractionalTerm| (($ $ (|Integer|)) "\\spad{nthFractionalTerm(p,n)} extracts the \\spad{n}th fractional term from the partial fraction \\spad{p}. This returns 0 if the index \\spad{n} is out of range.")) (|firstNumer| ((|#1| $) "\\spad{firstNumer(p)} extracts the numerator of the first fractional term. This returns 0 if there is no fractional part (use \\spadfunFrom{wholePart}{PartialFraction} to get the whole part).")) (|firstDenom| (((|Factored| |#1|) $) "\\spad{firstDenom(p)} extracts the denominator of the first fractional term. This returns 1 if there is no fractional part (use \\spadfunFrom{wholePart}{PartialFraction} to get the whole part).")) (|compactFraction| (($ $) "\\spad{compactFraction(p)} normalizes the partial fraction \\spad{p} to the compact representation. In this form,{} the partial fraction has only one fractional term per prime in the denominator.")) (|coerce| (($ (|Fraction| (|Factored| |#1|))) "\\spad{coerce(f)} takes a fraction with numerator and denominator in factored form and creates a partial fraction. It is necessary for the parts to be factored because it is not known in general how to factor elements of \\spad{R} and this is needed to decompose into partial fractions.") (((|Fraction| |#1|) $) "\\spad{coerce(p)} sums up the components of the partial fraction and returns a single fraction."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-933 R) +(-932 R) ((|constructor| (NIL "The package \\spadtype{PartialFractionPackage} gives an easier to use interfact the domain \\spadtype{PartialFraction}. The user gives a fraction of polynomials,{} and a variable and the package converts it to the proper datatype for the \\spadtype{PartialFraction} domain.")) (|partialFraction| (((|Any|) (|Polynomial| |#1|) (|Factored| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{partialFraction(num, facdenom, var)} returns the partial fraction decomposition of the rational function whose numerator is \\spad{num} and whose factored denominator is \\spad{facdenom} with respect to the variable var.") (((|Any|) (|Fraction| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{partialFraction(rf, var)} returns the partial fraction decomposition of the rational function \\spad{rf} with respect to the variable var."))) NIL NIL -(-934 E OV R P) +(-933 E OV R P) ((|gcdPrimitive| ((|#4| (|List| |#4|)) "\\spad{gcdPrimitive lp} computes the gcd of the list of primitive polynomials lp.") (((|SparseUnivariatePolynomial| |#4|) (|SparseUnivariatePolynomial| |#4|) (|SparseUnivariatePolynomial| |#4|)) "\\spad{gcdPrimitive(p,q)} computes the gcd of the primitive polynomials \\spad{p} and \\spad{q}.") ((|#4| |#4| |#4|) "\\spad{gcdPrimitive(p,q)} computes the gcd of the primitive polynomials \\spad{p} and \\spad{q}.")) (|gcd| (((|SparseUnivariatePolynomial| |#4|) (|List| (|SparseUnivariatePolynomial| |#4|))) "\\spad{gcd(lp)} computes the gcd of the list of polynomials \\spad{lp}.") (((|SparseUnivariatePolynomial| |#4|) (|SparseUnivariatePolynomial| |#4|) (|SparseUnivariatePolynomial| |#4|)) "\\spad{gcd(p,q)} computes the gcd of the two polynomials \\spad{p} and \\spad{q}.") ((|#4| (|List| |#4|)) "\\spad{gcd(lp)} computes the gcd of the list of polynomials \\spad{lp}.") ((|#4| |#4| |#4|) "\\spad{gcd(p,q)} computes the gcd of the two polynomials \\spad{p} and \\spad{q}."))) NIL NIL -(-935) +(-934) ((|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 -(-936 -3494) +(-935 -3493) ((|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 -(-937) +(-936) ((|constructor| (NIL "\\spadtype{PositiveInteger} provides functions for \\indented{2}{positive integers.}")) (|commutative| ((|attribute| "*") "\\spad{commutative(\"*\")} means multiplication is commutative : x*y = y*x")) (|gcd| (($ $ $) "\\spad{gcd(a,b)} computes the greatest common divisor of two positive integers \\spad{a} and \\spad{b}."))) -(((-4426 "*") . T)) +(((-4425 "*") . T)) NIL -(-938 R) +(-937 R) ((|constructor| (NIL "\\indented{1}{Provides a coercion from the symbolic fractions in \\%\\spad{pi} with} integer coefficients to any Expression type. Date Created: 21 Feb 1990 Date Last Updated: 21 Feb 1990")) (|coerce| (((|Expression| |#1|) (|Pi|)) "\\spad{coerce(f)} returns \\spad{f} as an Expression(\\spad{R})."))) NIL NIL -(-939) +(-938) ((|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)}"))) -((-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-940 |xx| -3494) +(-939 |xx| -3493) ((|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 -(-941 -3494 P) +(-940 -3493 P) ((|constructor| (NIL "This package exports interpolation algorithms")) (|LagrangeInterpolation| ((|#2| (|List| |#1|) (|List| |#1|)) "\\spad{LagrangeInterpolation(l1,l2)} \\undocumented"))) NIL NIL -(-942 R |Var| |Expon| GR) +(-941 R |Var| |Expon| GR) ((|constructor| (NIL "Author: William Sit,{} spring 89")) (|inconsistent?| (((|Boolean|) (|List| (|Polynomial| |#1|))) "inconsistant?(pl) returns \\spad{true} if the system of equations \\spad{p} = 0 for \\spad{p} in pl is inconsistent. It is assumed that pl is a groebner basis.") (((|Boolean|) (|List| |#4|)) "inconsistant?(pl) returns \\spad{true} if the system of equations \\spad{p} = 0 for \\spad{p} in pl is inconsistent. It is assumed that pl is a groebner basis.")) (|sqfree| ((|#4| |#4|) "\\spad{sqfree(p)} returns the product of square free factors of \\spad{p}")) (|regime| (((|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|)))))))) (|Record| (|:| |det| |#4|) (|:| |rows| (|List| (|Integer|))) (|:| |cols| (|List| (|Integer|)))) (|Matrix| |#4|) (|List| (|Fraction| (|Polynomial| |#1|))) (|List| (|List| |#4|)) (|NonNegativeInteger|) (|NonNegativeInteger|) (|Integer|)) "\\spad{regime(y,c, w, p, r, rm, m)} returns a regime,{} a list of polynomials specifying the consistency conditions,{} a particular solution and basis representing the general solution of the parametric linear system \\spad{c} \\spad{z} = \\spad{w} on that regime. The regime returned depends on the subdeterminant \\spad{y}.det and the row and column indices. The solutions are simplified using the assumption that the system has rank \\spad{r} and maximum rank \\spad{rm}. The list \\spad{p} represents a list of list of factors of polynomials in a groebner basis of the ideal generated by higher order subdeterminants,{} and ius used for the simplification. The mode \\spad{m} distinguishes the cases when the system is homogeneous,{} or the right hand side is arbitrary,{} or when there is no new right hand side variables.")) (|redmat| (((|Matrix| |#4|) (|Matrix| |#4|) (|List| |#4|)) "\\spad{redmat(m,g)} returns a matrix whose entries are those of \\spad{m} modulo the ideal generated by the groebner basis \\spad{g}")) (|ParCond| (((|List| (|Record| (|:| |det| |#4|) (|:| |rows| (|List| (|Integer|))) (|:| |cols| (|List| (|Integer|))))) (|Matrix| |#4|) (|NonNegativeInteger|)) "\\spad{ParCond(m,k)} returns the list of all \\spad{k} by \\spad{k} subdeterminants in the matrix \\spad{m}")) (|overset?| (((|Boolean|) (|List| |#4|) (|List| (|List| |#4|))) "\\spad{overset?(s,sl)} returns \\spad{true} if \\spad{s} properly a sublist of a member of \\spad{sl}; otherwise it returns \\spad{false}")) (|nextSublist| (((|List| (|List| (|Integer|))) (|Integer|) (|Integer|)) "\\spad{nextSublist(n,k)} returns a list of \\spad{k}-subsets of {1,{} ...,{} \\spad{n}}.")) (|minset| (((|List| (|List| |#4|)) (|List| (|List| |#4|))) "\\spad{minset(sl)} returns the sublist of \\spad{sl} consisting of the minimal lists (with respect to inclusion) in the list \\spad{sl} of lists")) (|minrank| (((|NonNegativeInteger|) (|List| (|Record| (|:| |rank| (|NonNegativeInteger|)) (|:| |eqns| (|List| (|Record| (|:| |det| |#4|) (|:| |rows| (|List| (|Integer|))) (|:| |cols| (|List| (|Integer|)))))) (|:| |fgb| (|List| |#4|))))) "\\spad{minrank(r)} returns the minimum rank in the list \\spad{r} of regimes")) (|maxrank| (((|NonNegativeInteger|) (|List| (|Record| (|:| |rank| (|NonNegativeInteger|)) (|:| |eqns| (|List| (|Record| (|:| |det| |#4|) (|:| |rows| (|List| (|Integer|))) (|:| |cols| (|List| (|Integer|)))))) (|:| |fgb| (|List| |#4|))))) "\\spad{maxrank(r)} returns the maximum rank in the list \\spad{r} of regimes")) (|factorset| (((|List| |#4|) |#4|) "\\spad{factorset(p)} returns the set of irreducible factors of \\spad{p}.")) (|B1solve| (((|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|)))))) (|Record| (|:| |mat| (|Matrix| (|Fraction| (|Polynomial| |#1|)))) (|:| |vec| (|List| (|Fraction| (|Polynomial| |#1|)))) (|:| |rank| (|NonNegativeInteger|)) (|:| |rows| (|List| (|Integer|))) (|:| |cols| (|List| (|Integer|))))) "\\spad{B1solve(s)} solves the system (\\spad{s}.mat) \\spad{z} = \\spad{s}.vec for the variables given by the column indices of \\spad{s}.cols in terms of the other variables and the right hand side \\spad{s}.vec by assuming that the rank is \\spad{s}.rank,{} that the system is consistent,{} with the linearly independent equations indexed by the given row indices \\spad{s}.rows; the coefficients in \\spad{s}.mat involving parameters are treated as polynomials. B1solve(\\spad{s}) returns a particular solution to the system and a basis of the homogeneous system (\\spad{s}.mat) \\spad{z} = 0.")) (|redpps| (((|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|)))))) (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|)))))) (|List| |#4|)) "\\spad{redpps(s,g)} returns the simplified form of \\spad{s} after reducing modulo a groebner basis \\spad{g}")) (|ParCondList| (((|List| (|Record| (|:| |rank| (|NonNegativeInteger|)) (|:| |eqns| (|List| (|Record| (|:| |det| |#4|) (|:| |rows| (|List| (|Integer|))) (|:| |cols| (|List| (|Integer|)))))) (|:| |fgb| (|List| |#4|)))) (|Matrix| |#4|) (|NonNegativeInteger|)) "\\spad{ParCondList(c,r)} computes a list of subdeterminants of each rank >= \\spad{r} of the matrix \\spad{c} and returns a groebner basis for the ideal they generate")) (|hasoln| (((|Record| (|:| |sysok| (|Boolean|)) (|:| |z0| (|List| |#4|)) (|:| |n0| (|List| |#4|))) (|List| |#4|) (|List| |#4|)) "\\spad{hasoln(g, l)} tests whether the quasi-algebraic set defined by \\spad{p} = 0 for \\spad{p} in \\spad{g} and \\spad{q} ~= 0 for \\spad{q} in \\spad{l} is empty or not and returns a simplified definition of the quasi-algebraic set")) (|pr2dmp| ((|#4| (|Polynomial| |#1|)) "\\spad{pr2dmp(p)} converts \\spad{p} to target domain")) (|se2rfi| (((|List| (|Fraction| (|Polynomial| |#1|))) (|List| (|Symbol|))) "\\spad{se2rfi(l)} converts \\spad{l} to target domain")) (|dmp2rfi| (((|List| (|Fraction| (|Polynomial| |#1|))) (|List| |#4|)) "\\spad{dmp2rfi(l)} converts \\spad{l} to target domain") (((|Matrix| (|Fraction| (|Polynomial| |#1|))) (|Matrix| |#4|)) "\\spad{dmp2rfi(m)} converts \\spad{m} to target domain") (((|Fraction| (|Polynomial| |#1|)) |#4|) "\\spad{dmp2rfi(p)} converts \\spad{p} to target domain")) (|bsolve| (((|Record| (|:| |rgl| (|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|)))))))))) (|:| |rgsz| (|Integer|))) (|Matrix| |#4|) (|List| (|Fraction| (|Polynomial| |#1|))) (|NonNegativeInteger|) (|String|) (|Integer|)) "\\spad{bsolve(c, w, r, s, m)} returns a list of regimes and solutions of the system \\spad{c} \\spad{z} = \\spad{w} for ranks at least \\spad{r}; depending on the mode \\spad{m} chosen,{} it writes the output to a file given by the string \\spad{s}.")) (|rdregime| (((|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|String|)) "\\spad{rdregime(s)} reads in a list from a file with name \\spad{s}")) (|wrregime| (((|Integer|) (|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|String|)) "\\spad{wrregime(l,s)} writes a list of regimes to a file named \\spad{s} and returns the number of regimes written")) (|psolve| (((|Integer|) (|Matrix| |#4|) (|PositiveInteger|) (|String|)) "\\spad{psolve(c,k,s)} solves \\spad{c} \\spad{z} = 0 for all possible ranks >= \\spad{k} of the matrix \\spad{c},{} writes the results to a file named \\spad{s},{} and returns the number of regimes") (((|Integer|) (|Matrix| |#4|) (|List| (|Symbol|)) (|PositiveInteger|) (|String|)) "\\spad{psolve(c,w,k,s)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks >= \\spad{k} of the matrix \\spad{c} and indeterminate right hand side \\spad{w},{} writes the results to a file named \\spad{s},{} and returns the number of regimes") (((|Integer|) (|Matrix| |#4|) (|List| |#4|) (|PositiveInteger|) (|String|)) "\\spad{psolve(c,w,k,s)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks >= \\spad{k} of the matrix \\spad{c} and given right hand side \\spad{w},{} writes the results to a file named \\spad{s},{} and returns the number of regimes") (((|Integer|) (|Matrix| |#4|) (|String|)) "\\spad{psolve(c,s)} solves \\spad{c} \\spad{z} = 0 for all possible ranks of the matrix \\spad{c} and given right hand side vector \\spad{w},{} writes the results to a file named \\spad{s},{} and returns the number of regimes") (((|Integer|) (|Matrix| |#4|) (|List| (|Symbol|)) (|String|)) "\\spad{psolve(c,w,s)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks of the matrix \\spad{c} and indeterminate right hand side \\spad{w},{} writes the results to a file named \\spad{s},{} and returns the number of regimes") (((|Integer|) (|Matrix| |#4|) (|List| |#4|) (|String|)) "\\spad{psolve(c,w,s)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks of the matrix \\spad{c} and given right hand side vector \\spad{w},{} writes the results to a file named \\spad{s},{} and returns the number of regimes") (((|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|Matrix| |#4|) (|PositiveInteger|)) "\\spad{psolve(c)} solves the homogeneous linear system \\spad{c} \\spad{z} = 0 for all possible ranks >= \\spad{k} of the matrix \\spad{c}") (((|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|Matrix| |#4|) (|List| (|Symbol|)) (|PositiveInteger|)) "\\spad{psolve(c,w,k)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks >= \\spad{k} of the matrix \\spad{c} and indeterminate right hand side \\spad{w}") (((|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|Matrix| |#4|) (|List| |#4|) (|PositiveInteger|)) "\\spad{psolve(c,w,k)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks >= \\spad{k} of the matrix \\spad{c} and given right hand side vector \\spad{w}") (((|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|Matrix| |#4|)) "\\spad{psolve(c)} solves the homogeneous linear system \\spad{c} \\spad{z} = 0 for all possible ranks of the matrix \\spad{c}") (((|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|Matrix| |#4|) (|List| (|Symbol|))) "\\spad{psolve(c,w)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks of the matrix \\spad{c} and indeterminate right hand side \\spad{w}") (((|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|Matrix| |#4|) (|List| |#4|)) "\\spad{psolve(c,w)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks of the matrix \\spad{c} and given right hand side vector \\spad{w}"))) NIL NIL -(-943) +(-942) ((|constructor| (NIL "The Plot domain supports plotting of functions defined over a real number system. A real number system is a model for the real numbers and as such may be an approximation. For example floating point numbers and infinite continued fractions. The facilities at this point are limited to 2-dimensional plots or either a single function or a parametric function.")) (|debug| (((|Boolean|) (|Boolean|)) "\\spad{debug(true)} turns debug mode on \\spad{debug(false)} turns debug mode off")) (|numFunEvals| (((|Integer|)) "\\spad{numFunEvals()} returns the number of points computed")) (|setAdaptive| (((|Boolean|) (|Boolean|)) "\\spad{setAdaptive(true)} turns adaptive plotting on \\spad{setAdaptive(false)} turns adaptive plotting off")) (|adaptive?| (((|Boolean|)) "\\spad{adaptive?()} determines whether plotting be done adaptively")) (|setScreenResolution| (((|Integer|) (|Integer|)) "\\spad{setScreenResolution(i)} sets the screen resolution to \\spad{i}")) (|screenResolution| (((|Integer|)) "\\spad{screenResolution()} returns the screen resolution")) (|setMaxPoints| (((|Integer|) (|Integer|)) "\\spad{setMaxPoints(i)} sets the maximum number of points in a plot to \\spad{i}")) (|maxPoints| (((|Integer|)) "\\spad{maxPoints()} returns the maximum number of points in a plot")) (|setMinPoints| (((|Integer|) (|Integer|)) "\\spad{setMinPoints(i)} sets the minimum number of points in a plot to \\spad{i}")) (|minPoints| (((|Integer|)) "\\spad{minPoints()} returns the minimum number of points in a plot")) (|tRange| (((|Segment| (|DoubleFloat|)) $) "\\spad{tRange(p)} returns the range of the parameter in a parametric plot \\spad{p}")) (|refine| (($ $) "\\spad{refine(p)} performs a refinement on the plot \\spad{p}") (($ $ (|Segment| (|DoubleFloat|))) "\\spad{refine(x,r)} \\undocumented")) (|zoom| (($ $ (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{zoom(x,r,s)} \\undocumented") (($ $ (|Segment| (|DoubleFloat|))) "\\spad{zoom(x,r)} \\undocumented")) (|parametric?| (((|Boolean|) $) "\\spad{parametric? determines} whether it is a parametric plot?")) (|plotPolar| (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) "\\spad{plotPolar(f)} plots the polar curve \\spad{r = f(theta)} as theta ranges over the interval \\spad{[0,2*\\%pi]}; this is the same as the parametric curve \\spad{x = f(t) * cos(t)},{} \\spad{y = f(t) * sin(t)}.") (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plotPolar(f,a..b)} plots the polar curve \\spad{r = f(theta)} as theta ranges over the interval \\spad{[a,b]}; this is the same as the parametric curve \\spad{x = f(t) * cos(t)},{} \\spad{y = f(t) * sin(t)}.")) (|pointPlot| (($ (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{pointPlot(t +-> (f(t),g(t)),a..b,c..d,e..f)} plots the parametric curve \\spad{x = f(t)},{} \\spad{y = g(t)} as \\spad{t} ranges over the interval \\spad{[a,b]}; \\spad{x}-range of \\spad{[c,d]} and \\spad{y}-range of \\spad{[e,f]} are noted in Plot object.") (($ (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{pointPlot(t +-> (f(t),g(t)),a..b)} plots the parametric curve \\spad{x = f(t)},{} \\spad{y = g(t)} as \\spad{t} ranges over the interval \\spad{[a,b]}.")) (|plot| (($ $ (|Segment| (|DoubleFloat|))) "\\spad{plot(x,r)} \\undocumented") (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plot(f,g,a..b,c..d,e..f)} plots the parametric curve \\spad{x = f(t)},{} \\spad{y = g(t)} as \\spad{t} ranges over the interval \\spad{[a,b]}; \\spad{x}-range of \\spad{[c,d]} and \\spad{y}-range of \\spad{[e,f]} are noted in Plot object.") (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plot(f,g,a..b)} plots the parametric curve \\spad{x = f(t)},{} \\spad{y = g(t)} as \\spad{t} ranges over the interval \\spad{[a,b]}.") (($ (|List| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plot([f1,...,fm],a..b,c..d)} plots the functions \\spad{y = f1(x)},{}...,{} \\spad{y = fm(x)} on the interval \\spad{a..b}; \\spad{y}-range of \\spad{[c,d]} is noted in Plot object.") (($ (|List| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|DoubleFloat|))) "\\spad{plot([f1,...,fm],a..b)} plots the functions \\spad{y = f1(x)},{}...,{} \\spad{y = fm(x)} on the interval \\spad{a..b}.") (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plot(f,a..b,c..d)} plots the function \\spad{f(x)} on the interval \\spad{[a,b]}; \\spad{y}-range of \\spad{[c,d]} is noted in Plot object.") (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plot(f,a..b)} plots the function \\spad{f(x)} on the interval \\spad{[a,b]}."))) NIL NIL -(-944 S) +(-943 S) ((|constructor| (NIL "\\spad{PlotFunctions1} provides facilities for plotting curves where functions SF -> SF are specified by giving an expression")) (|plotPolar| (((|Plot|) |#1| (|Symbol|)) "\\spad{plotPolar(f,theta)} plots the graph of \\spad{r = f(theta)} as \\spad{theta} ranges from 0 to 2 \\spad{pi}") (((|Plot|) |#1| (|Symbol|) (|Segment| (|DoubleFloat|))) "\\spad{plotPolar(f,theta,seg)} plots the graph of \\spad{r = f(theta)} as \\spad{theta} ranges over an interval")) (|plot| (((|Plot|) |#1| |#1| (|Symbol|) (|Segment| (|DoubleFloat|))) "\\spad{plot(f,g,t,seg)} plots the graph of \\spad{x = f(t)},{} \\spad{y = g(t)} as \\spad{t} ranges over an interval.") (((|Plot|) |#1| (|Symbol|) (|Segment| (|DoubleFloat|))) "\\spad{plot(fcn,x,seg)} plots the graph of \\spad{y = f(x)} on a interval"))) NIL NIL -(-945) +(-944) ((|constructor| (NIL "Plot3D supports parametric plots defined over a real number system. A real number system is a model for the real numbers and as such may be an approximation. For example,{} floating point numbers and infinite continued fractions are real number systems. The facilities at this point are limited to 3-dimensional parametric plots.")) (|debug3D| (((|Boolean|) (|Boolean|)) "\\spad{debug3D(true)} turns debug mode on; debug3D(\\spad{false}) turns debug mode off.")) (|numFunEvals3D| (((|Integer|)) "\\spad{numFunEvals3D()} returns the number of points computed.")) (|setAdaptive3D| (((|Boolean|) (|Boolean|)) "\\spad{setAdaptive3D(true)} turns adaptive plotting on; setAdaptive3D(\\spad{false}) turns adaptive plotting off.")) (|adaptive3D?| (((|Boolean|)) "\\spad{adaptive3D?()} determines whether plotting be done adaptively.")) (|setScreenResolution3D| (((|Integer|) (|Integer|)) "\\spad{setScreenResolution3D(i)} sets the screen resolution for a 3d graph to \\spad{i}.")) (|screenResolution3D| (((|Integer|)) "\\spad{screenResolution3D()} returns the screen resolution for a 3d graph.")) (|setMaxPoints3D| (((|Integer|) (|Integer|)) "\\spad{setMaxPoints3D(i)} sets the maximum number of points in a plot to \\spad{i}.")) (|maxPoints3D| (((|Integer|)) "\\spad{maxPoints3D()} returns the maximum number of points in a plot.")) (|setMinPoints3D| (((|Integer|) (|Integer|)) "\\spad{setMinPoints3D(i)} sets the minimum number of points in a plot to \\spad{i}.")) (|minPoints3D| (((|Integer|)) "\\spad{minPoints3D()} returns the minimum number of points in a plot.")) (|tValues| (((|List| (|List| (|DoubleFloat|))) $) "\\spad{tValues(p)} returns a list of lists of the values of the parameter for which a point is computed,{} one list for each curve in the plot \\spad{p}.")) (|tRange| (((|Segment| (|DoubleFloat|)) $) "\\spad{tRange(p)} returns the range of the parameter in a parametric plot \\spad{p}.")) (|refine| (($ $) "\\spad{refine(x)} \\undocumented") (($ $ (|Segment| (|DoubleFloat|))) "\\spad{refine(x,r)} \\undocumented")) (|zoom| (($ $ (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{zoom(x,r,s,t)} \\undocumented")) (|plot| (($ $ (|Segment| (|DoubleFloat|))) "\\spad{plot(x,r)} \\undocumented") (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plot(f1,f2,f3,f4,x,y,z,w)} \\undocumented") (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plot(f,g,h,a..b)} plots {/emx = \\spad{f}(\\spad{t}),{} \\spad{y} = \\spad{g}(\\spad{t}),{} \\spad{z} = \\spad{h}(\\spad{t})} as \\spad{t} ranges over {/em[a,{}\\spad{b}]}.")) (|pointPlot| (($ (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{pointPlot(f,x,y,z,w)} \\undocumented") (($ (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{pointPlot(f,g,h,a..b)} plots {/emx = \\spad{f}(\\spad{t}),{} \\spad{y} = \\spad{g}(\\spad{t}),{} \\spad{z} = \\spad{h}(\\spad{t})} as \\spad{t} ranges over {/em[a,{}\\spad{b}]}."))) NIL NIL -(-946) +(-945) ((|constructor| (NIL "This package exports plotting tools")) (|calcRanges| (((|List| (|Segment| (|DoubleFloat|))) (|List| (|List| (|Point| (|DoubleFloat|))))) "\\spad{calcRanges(l)} \\undocumented"))) NIL NIL -(-947) +(-946) ((|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 -(-948 R -3494) +(-947 R -3493) ((|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 -(-949 S A B) +(-948 S A B) ((|constructor| (NIL "This packages provides tools for matching recursively in type towers.")) (|patternMatch| (((|PatternMatchResult| |#1| |#3|) |#2| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#3|)) "\\spad{patternMatch(expr, pat, res)} matches the pattern \\spad{pat} to the expression \\spad{expr}; res contains the variables of \\spad{pat} which are already matched and their matches. Note: this function handles type towers by changing the predicates and calling the matching function provided by \\spad{A}.")) (|fixPredicate| (((|Mapping| (|Boolean|) |#2|) (|Mapping| (|Boolean|) |#3|)) "\\spad{fixPredicate(f)} returns \\spad{g} defined by \\spad{g}(a) = \\spad{f}(a::B)."))) NIL NIL -(-950 S R -3494) +(-949 S R -3493) ((|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 -(-951 I) +(-950 I) ((|constructor| (NIL "This package provides pattern matching functions on integers.")) (|patternMatch| (((|PatternMatchResult| (|Integer|) |#1|) |#1| (|Pattern| (|Integer|)) (|PatternMatchResult| (|Integer|) |#1|)) "\\spad{patternMatch(n, pat, res)} matches the pattern \\spad{pat} to the integer \\spad{n}; res contains the variables of \\spad{pat} which are already matched and their matches."))) NIL NIL -(-952 S E) +(-951 S E) ((|constructor| (NIL "This package provides pattern matching functions on kernels.")) (|patternMatch| (((|PatternMatchResult| |#1| |#2|) (|Kernel| |#2|) (|Pattern| |#1|) (|PatternMatchResult| |#1| |#2|)) "\\spad{patternMatch(f(e1,...,en), pat, res)} matches the pattern \\spad{pat} to \\spad{f(e1,...,en)}; res contains the variables of \\spad{pat} which are already matched and their matches."))) NIL NIL -(-953 S R L) +(-952 S R L) ((|constructor| (NIL "This package provides pattern matching functions on lists.")) (|patternMatch| (((|PatternMatchListResult| |#1| |#2| |#3|) |#3| (|Pattern| |#1|) (|PatternMatchListResult| |#1| |#2| |#3|)) "\\spad{patternMatch(l, pat, res)} matches the pattern \\spad{pat} to the list \\spad{l}; res contains the variables of \\spad{pat} which are already matched and their matches."))) NIL NIL -(-954 S E V R P) +(-953 S E V R P) ((|constructor| (NIL "This package provides pattern matching functions on polynomials.")) (|patternMatch| (((|PatternMatchResult| |#1| |#5|) |#5| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|)) "\\spad{patternMatch(p, pat, res)} matches the pattern \\spad{pat} to the polynomial \\spad{p}; res contains the variables of \\spad{pat} which are already matched and their matches.") (((|PatternMatchResult| |#1| |#5|) |#5| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|) (|Mapping| (|PatternMatchResult| |#1| |#5|) |#3| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|))) "\\spad{patternMatch(p, pat, res, vmatch)} matches the pattern \\spad{pat} to the polynomial \\spad{p}. \\spad{res} contains the variables of \\spad{pat} which are already matched and their matches; vmatch is the matching function to use on the variables."))) NIL -((|HasCategory| |#3| (|%list| (QUOTE -900) (|devaluate| |#1|)))) -(-955 -3069) +((|HasCategory| |#3| (|%list| (QUOTE -899) (|devaluate| |#1|)))) +(-954 -3068) ((|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 -(-956 R -3494 -3069) +(-955 R -3493 -3068) ((|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 -(-957 S R Q) +(-956 S R Q) ((|constructor| (NIL "This package provides pattern matching functions on quotients.")) (|patternMatch| (((|PatternMatchResult| |#1| |#3|) |#3| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#3|)) "\\spad{patternMatch(a/b, pat, res)} matches the pattern \\spad{pat} to the quotient \\spad{a/b}; res contains the variables of \\spad{pat} which are already matched and their matches."))) NIL NIL -(-958 S) +(-957 S) ((|constructor| (NIL "This package provides pattern matching functions on symbols.")) (|patternMatch| (((|PatternMatchResult| |#1| (|Symbol|)) (|Symbol|) (|Pattern| |#1|) (|PatternMatchResult| |#1| (|Symbol|))) "\\spad{patternMatch(expr, pat, res)} matches the pattern \\spad{pat} to the expression \\spad{expr}; res contains the variables of \\spad{pat} which are already matched and their matches (necessary for recursion)."))) NIL NIL -(-959 S R P) +(-958 S R P) ((|constructor| (NIL "This package provides tools for the pattern matcher.")) (|patternMatchTimes| (((|PatternMatchResult| |#1| |#3|) (|List| |#3|) (|List| (|Pattern| |#1|)) (|PatternMatchResult| |#1| |#3|) (|Mapping| (|PatternMatchResult| |#1| |#3|) |#3| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#3|))) "\\spad{patternMatchTimes(lsubj, lpat, res, match)} matches the product of patterns \\spad{reduce(*,lpat)} to the product of subjects \\spad{reduce(*,lsubj)}; \\spad{r} contains the previous matches and match is a pattern-matching function on \\spad{P}.")) (|patternMatch| (((|PatternMatchResult| |#1| |#3|) (|List| |#3|) (|List| (|Pattern| |#1|)) (|Mapping| |#3| (|List| |#3|)) (|PatternMatchResult| |#1| |#3|) (|Mapping| (|PatternMatchResult| |#1| |#3|) |#3| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#3|))) "\\spad{patternMatch(lsubj, lpat, op, res, match)} matches the list of patterns \\spad{lpat} to the list of subjects \\spad{lsubj},{} allowing for commutativity; \\spad{op} is the operator such that \\spad{op}(\\spad{lpat}) should match \\spad{op}(\\spad{lsubj}) at the end,{} \\spad{r} contains the previous matches,{} and match is a pattern-matching function on \\spad{P}."))) NIL NIL -(-960) +(-959) ((|constructor| (NIL "This package provides various polynomial number theoretic functions over the integers.")) (|legendre| (((|SparseUnivariatePolynomial| (|Fraction| (|Integer|))) (|Integer|)) "\\spad{legendre(n)} returns the \\spad{n}th Legendre polynomial \\spad{P[n](x)}. Note: Legendre polynomials,{} denoted \\spad{P[n](x)},{} are computed from the two term recurrence. The generating function is: \\spad{1/sqrt(1-2*t*x+t**2) = sum(P[n](x)*t**n, n=0..infinity)}.")) (|laguerre| (((|SparseUnivariatePolynomial| (|Integer|)) (|Integer|)) "\\spad{laguerre(n)} returns the \\spad{n}th Laguerre polynomial \\spad{L[n](x)}. Note: Laguerre polynomials,{} denoted \\spad{L[n](x)},{} are computed from the two term recurrence. The generating function is: \\spad{exp(x*t/(t-1))/(1-t) = sum(L[n](x)*t**n/n!, n=0..infinity)}.")) (|hermite| (((|SparseUnivariatePolynomial| (|Integer|)) (|Integer|)) "\\spad{hermite(n)} returns the \\spad{n}th Hermite polynomial \\spad{H[n](x)}. Note: Hermite polynomials,{} denoted \\spad{H[n](x)},{} are computed from the two term recurrence. The generating function is: \\spad{exp(2*t*x-t**2) = sum(H[n](x)*t**n/n!, n=0..infinity)}.")) (|fixedDivisor| (((|Integer|) (|SparseUnivariatePolynomial| (|Integer|))) "\\spad{fixedDivisor(a)} for \\spad{a(x)} in \\spad{Z[x]} is the largest integer \\spad{f} such that \\spad{f} divides \\spad{a(x=k)} for all integers \\spad{k}. Note: fixed divisor of \\spad{a} is \\spad{reduce(gcd,[a(x=k) for k in 0..degree(a)])}.")) (|euler| (((|SparseUnivariatePolynomial| (|Fraction| (|Integer|))) (|Integer|)) "\\spad{euler(n)} returns the \\spad{n}th Euler polynomial \\spad{E[n](x)}. Note: Euler polynomials denoted \\spad{E(n,x)} computed by solving the differential equation \\spad{differentiate(E(n,x),x) = n E(n-1,x)} where \\spad{E(0,x) = 1} and initial condition comes from \\spad{E(n) = 2**n E(n,1/2)}.")) (|cyclotomic| (((|SparseUnivariatePolynomial| (|Integer|)) (|Integer|)) "\\spad{cyclotomic(n)} returns the \\spad{n}th cyclotomic polynomial \\spad{phi[n](x)}. Note: \\spad{phi[n](x)} is the factor of \\spad{x**n - 1} whose roots are the primitive \\spad{n}th roots of unity.")) (|chebyshevU| (((|SparseUnivariatePolynomial| (|Integer|)) (|Integer|)) "\\spad{chebyshevU(n)} returns the \\spad{n}th Chebyshev polynomial \\spad{U[n](x)}. Note: Chebyshev polynomials of the second kind,{} denoted \\spad{U[n](x)},{} computed from the two term recurrence. The generating function \\spad{1/(1-2*t*x+t**2) = sum(T[n](x)*t**n, n=0..infinity)}.")) (|chebyshevT| (((|SparseUnivariatePolynomial| (|Integer|)) (|Integer|)) "\\spad{chebyshevT(n)} returns the \\spad{n}th Chebyshev polynomial \\spad{T[n](x)}. Note: Chebyshev polynomials of the first kind,{} denoted \\spad{T[n](x)},{} computed from the two term recurrence. The generating function \\spad{(1-t*x)/(1-2*t*x+t**2) = sum(T[n](x)*t**n, n=0..infinity)}.")) (|bernoulli| (((|SparseUnivariatePolynomial| (|Fraction| (|Integer|))) (|Integer|)) "\\spad{bernoulli(n)} returns the \\spad{n}th Bernoulli polynomial \\spad{B[n](x)}. Note: Bernoulli polynomials denoted \\spad{B(n,x)} computed by solving the differential equation \\spad{differentiate(B(n,x),x) = n B(n-1,x)} where \\spad{B(0,x) = 1} and initial condition comes from \\spad{B(n) = B(n,0)}."))) NIL NIL -(-961 R) +(-960 R) ((|constructor| (NIL "This domain implements points in coordinate space"))) -((-4425 . T) (-4424 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| |#1| (QUOTE (-860))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-745))) (|HasCategory| |#1| (QUOTE (-1069))) (-12 (|HasCategory| |#1| (QUOTE (-1022))) (|HasCategory| |#1| (QUOTE (-1069)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) -(-962 |lv| R) +((-4424 . T) (-4423 . T)) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (-3955 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| |#1| (QUOTE (-859))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-744))) (|HasCategory| |#1| (QUOTE (-1068))) (-12 (|HasCategory| |#1| (QUOTE (-1021))) (|HasCategory| |#1| (QUOTE (-1068)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +(-961 |lv| R) ((|constructor| (NIL "Package with the conversion functions among different kind of polynomials")) (|pToDmp| (((|DistributedMultivariatePolynomial| |#1| |#2|) (|Polynomial| |#2|)) "\\spad{pToDmp(p)} converts \\spad{p} from a \\spadtype{POLY} to a \\spadtype{DMP}.")) (|dmpToP| (((|Polynomial| |#2|) (|DistributedMultivariatePolynomial| |#1| |#2|)) "\\spad{dmpToP(p)} converts \\spad{p} from a \\spadtype{DMP} to a \\spadtype{POLY}.")) (|hdmpToP| (((|Polynomial| |#2|) (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) "\\spad{hdmpToP(p)} converts \\spad{p} from a \\spadtype{HDMP} to a \\spadtype{POLY}.")) (|pToHdmp| (((|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|Polynomial| |#2|)) "\\spad{pToHdmp(p)} converts \\spad{p} from a \\spadtype{POLY} to a \\spadtype{HDMP}.")) (|hdmpToDmp| (((|DistributedMultivariatePolynomial| |#1| |#2|) (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) "\\spad{hdmpToDmp(p)} converts \\spad{p} from a \\spadtype{HDMP} to a \\spadtype{DMP}.")) (|dmpToHdmp| (((|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|DistributedMultivariatePolynomial| |#1| |#2|)) "\\spad{dmpToHdmp(p)} converts \\spad{p} from a \\spadtype{DMP} to a \\spadtype{HDMP}."))) NIL NIL -(-963 |TheField| |ThePols|) +(-962 |TheField| |ThePols|) ((|constructor| (NIL "\\axiomType{RealPolynomialUtilitiesPackage} provides common functions used by interval coding.")) (|lazyVariations| (((|NonNegativeInteger|) (|List| |#1|) (|Integer|) (|Integer|)) "\\axiom{lazyVariations(\\spad{l},{}\\spad{s1},{}sn)} is the number of sign variations in the list of non null numbers [s1::l]@sn,{}")) (|sturmVariationsOf| (((|NonNegativeInteger|) (|List| |#1|)) "\\axiom{sturmVariationsOf(\\spad{l})} is the number of sign variations in the list of numbers \\spad{l},{} note that the first term counts as a sign")) (|boundOfCauchy| ((|#1| |#2|) "\\axiom{boundOfCauchy(\\spad{p})} bounds the roots of \\spad{p}")) (|sturmSequence| (((|List| |#2|) |#2|) "\\axiom{sturmSequence(\\spad{p}) = sylvesterSequence(\\spad{p},{}p')}")) (|sylvesterSequence| (((|List| |#2|) |#2| |#2|) "\\axiom{sylvesterSequence(\\spad{p},{}\\spad{q})} is the negated remainder sequence of \\spad{p} and \\spad{q} divided by the last computed term"))) NIL -((|HasCategory| |#1| (QUOTE (-859)))) -(-964 R) +((|HasCategory| |#1| (QUOTE (-858)))) +(-963 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}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-928))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-1197) (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-1197) (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-1197) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-1197) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-1197) (|%list| (QUOTE -630) (QUOTE (-547))))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4422)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) -(-965 R S) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-927))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-1196) (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-1196) (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-1196) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-1196) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-1196) (|%list| (QUOTE -629) (QUOTE (-546))))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4421)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) +(-964 R S) ((|constructor| (NIL "\\indented{2}{This package takes a mapping between coefficient rings,{} and lifts} it to a mapping between polynomials over those rings.")) (|map| (((|Polynomial| |#2|) (|Mapping| |#2| |#1|) (|Polynomial| |#1|)) "\\spad{map(f, p)} produces a new polynomial as a result of applying the function \\spad{f} to every coefficient of the polynomial \\spad{p}."))) NIL NIL -(-966 |x| R) +(-965 |x| R) ((|constructor| (NIL "This package is primarily to help the interpreter do coercions. It allows you to view a polynomial as a univariate polynomial in one of its variables with coefficients which are again a polynomial in all the other variables.")) (|univariate| (((|UnivariatePolynomial| |#1| (|Polynomial| |#2|)) (|Polynomial| |#2|) (|Variable| |#1|)) "\\spad{univariate(p, x)} converts the polynomial \\spad{p} to a one of type \\spad{UnivariatePolynomial(x,Polynomial(R))},{} ie. as a member of \\spad{R[...][x]}."))) NIL NIL -(-967 S R E |VarSet|) +(-966 S R E |VarSet|) ((|constructor| (NIL "The category for general multi-variate polynomials over a ring \\spad{R},{} in variables from VarSet,{} with exponents from the \\spadtype{OrderedAbelianMonoidSup}.")) (|canonicalUnitNormal| ((|attribute|) "we can choose a unique representative for each associate class. This normalization is chosen to be normalization of leading coefficient (by default).")) (|squareFreePart| (($ $) "\\spad{squareFreePart(p)} returns product of all the irreducible factors of polynomial \\spad{p} each taken with multiplicity one.")) (|squareFree| (((|Factored| $) $) "\\spad{squareFree(p)} returns the square free factorization of the polynomial \\spad{p}.")) (|primitivePart| (($ $ |#4|) "\\spad{primitivePart(p,v)} returns the unitCanonical associate of the polynomial \\spad{p} with its content with respect to the variable \\spad{v} divided out.") (($ $) "\\spad{primitivePart(p)} returns the unitCanonical associate of the polynomial \\spad{p} with its content divided out.")) (|content| (($ $ |#4|) "\\spad{content(p,v)} is the 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| (($ $ |#4|) "\\spad{discriminant(p,v)} returns the disriminant of the polynomial \\spad{p} with respect to the variable \\spad{v}.")) (|resultant| (($ $ $ |#4|) "\\spad{resultant(p,q,v)} returns the resultant of the polynomials \\spad{p} and \\spad{q} with respect to the variable \\spad{v}.")) (|primitiveMonomials| (((|List| $) $) "\\spad{primitiveMonomials(p)} gives the list of monomials of the polynomial \\spad{p} with their coefficients removed. Note: \\spad{primitiveMonomials(sum(a_(i) X^(i))) = [X^(1),...,X^(n)]}.")) (|variables| (((|List| |#4|) $) "\\spad{variables(p)} returns the list of those variables actually appearing in the polynomial \\spad{p}.")) (|totalDegree| (((|NonNegativeInteger|) $ (|List| |#4|)) "\\spad{totalDegree(p, lv)} returns the maximum sum (over all monomials of polynomial \\spad{p}) of the variables in the list lv.") (((|NonNegativeInteger|) $) "\\spad{totalDegree(p)} returns the largest sum over all monomials of all exponents of a monomial.")) (|isExpt| (((|Union| (|Record| (|:| |var| |#4|) (|:| |exponent| (|NonNegativeInteger|))) "failed") $) "\\spad{isExpt(p)} returns \\spad{[x, n]} if polynomial \\spad{p} has the form \\spad{x**n} and \\spad{n > 0}.")) (|isTimes| (((|Union| (|List| $) "failed") $) "\\spad{isTimes(p)} returns \\spad{[a1,...,an]} if polynomial \\spad{p = a1 ... an} and \\spad{n >= 2},{} and,{} for each \\spad{i},{} \\spad{ai} is either a nontrivial constant in \\spad{R} or else of the form \\spad{x**e},{} where \\spad{e > 0} is an integer and \\spad{x} in a member of VarSet.")) (|isPlus| (((|Union| (|List| $) "failed") $) "\\spad{isPlus(p)} returns \\spad{[m1,...,mn]} if polynomial \\spad{p = m1 + ... + mn} and \\spad{n >= 2} and each \\spad{mi} is a nonzero monomial.")) (|multivariate| (($ (|SparseUnivariatePolynomial| $) |#4|) "\\spad{multivariate(sup,v)} converts an anonymous univariable polynomial \\spad{sup} to a polynomial in the variable \\spad{v}.") (($ (|SparseUnivariatePolynomial| |#2|) |#4|) "\\spad{multivariate(sup,v)} converts an anonymous univariable polynomial \\spad{sup} to a polynomial in the variable \\spad{v}.")) (|monomial| (($ $ (|List| |#4|) (|List| (|NonNegativeInteger|))) "\\spad{monomial(a,[v1..vn],[e1..en])} returns \\spad{a*prod(vi**ei)}.") (($ $ |#4| (|NonNegativeInteger|)) "\\spad{monomial(a,x,n)} creates the monomial \\spad{a*x**n} where \\spad{a} is a polynomial,{} \\spad{x} is a variable and \\spad{n} is a nonnegative integer.")) (|monicDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $ |#4|) "\\spad{monicDivide(a,b,v)} divides the polynomial a by the polynomial \\spad{b},{} with each viewed as a univariate polynomial in \\spad{v} returning both the quotient and remainder. Error: if \\spad{b} is not monic with respect to \\spad{v}.")) (|minimumDegree| (((|List| (|NonNegativeInteger|)) $ (|List| |#4|)) "\\spad{minimumDegree(p, lv)} gives the list of minimum degrees of the polynomial \\spad{p} with respect to each of the variables in the list lv") (((|NonNegativeInteger|) $ |#4|) "\\spad{minimumDegree(p,v)} gives the minimum degree of polynomial \\spad{p} with respect to \\spad{v},{} \\spadignore{i.e.} viewed a univariate polynomial in \\spad{v}")) (|mainVariable| (((|Union| |#4| "failed") $) "\\spad{mainVariable(p)} returns the biggest variable which actually occurs in the polynomial \\spad{p},{} or \"failed\" if no variables are present. fails precisely if polynomial satisfies ground?")) (|univariate| (((|SparseUnivariatePolynomial| |#2|) $) "\\spad{univariate(p)} converts the multivariate polynomial \\spad{p},{} which should actually involve only one variable,{} into a univariate polynomial in that variable,{} whose coefficients are in the ground ring. Error: if polynomial is genuinely multivariate") (((|SparseUnivariatePolynomial| $) $ |#4|) "\\spad{univariate(p,v)} converts the multivariate polynomial \\spad{p} into a univariate polynomial in \\spad{v},{} whose coefficients are still multivariate polynomials (in all the other variables).")) (|monomials| (((|List| $) $) "\\spad{monomials(p)} returns the list of non-zero monomials of polynomial \\spad{p},{} \\spadignore{i.e.} \\spad{monomials(sum(a_(i) X^(i))) = [a_(1) X^(1),...,a_(n) X^(n)]}.")) (|coefficient| (($ $ (|List| |#4|) (|List| (|NonNegativeInteger|))) "\\spad{coefficient(p, lv, ln)} views the polynomial \\spad{p} as a polynomial in the variables of \\spad{lv} and returns the coefficient of the term \\spad{lv**ln},{} \\spadignore{i.e.} \\spad{prod(lv_i ** ln_i)}.") (($ $ |#4| (|NonNegativeInteger|)) "\\spad{coefficient(p,v,n)} views the polynomial \\spad{p} as a univariate polynomial in \\spad{v} and returns the coefficient of the \\spad{v**n} term.")) (|degree| (((|List| (|NonNegativeInteger|)) $ (|List| |#4|)) "\\spad{degree(p,lv)} gives the list of degrees of polynomial \\spad{p} with respect to each of the variables in the list \\spad{lv}.") (((|NonNegativeInteger|) $ |#4|) "\\spad{degree(p,v)} gives the degree of polynomial \\spad{p} with respect to the variable \\spad{v}."))) NIL -((|HasCategory| |#2| (QUOTE (-928))) (|HasAttribute| |#2| (QUOTE -4422)) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| |#4| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| |#4| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| |#4| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| |#4| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547))))) -(-968 R E |VarSet|) +((|HasCategory| |#2| (QUOTE (-927))) (|HasAttribute| |#2| (QUOTE -4421)) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| |#4| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| |#4| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| |#4| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| |#4| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546))))) +(-967 R E |VarSet|) ((|constructor| (NIL "The category for general multi-variate polynomials over a ring \\spad{R},{} in variables from VarSet,{} with exponents from the \\spadtype{OrderedAbelianMonoidSup}.")) (|canonicalUnitNormal| ((|attribute|) "we can choose a unique representative for each associate class. This normalization is chosen to be normalization of leading coefficient (by default).")) (|squareFreePart| (($ $) "\\spad{squareFreePart(p)} returns product of all the irreducible factors of polynomial \\spad{p} each taken with multiplicity one.")) (|squareFree| (((|Factored| $) $) "\\spad{squareFree(p)} returns the square free factorization of the polynomial \\spad{p}.")) (|primitivePart| (($ $ |#3|) "\\spad{primitivePart(p,v)} returns the unitCanonical associate of the polynomial \\spad{p} with its content with respect to the variable \\spad{v} divided out.") (($ $) "\\spad{primitivePart(p)} returns the unitCanonical associate of the polynomial \\spad{p} with its content divided out.")) (|content| (($ $ |#3|) "\\spad{content(p,v)} is the 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}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) NIL -(-969 E V R P -3494) +(-968 E V R P -3493) ((|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 -(-970 E |Vars| R P S) +(-969 E |Vars| R P S) ((|constructor| (NIL "This package provides a very general map function,{} which given a set \\spad{S} and polynomials over \\spad{R} with maps from the variables into \\spad{S} and the coefficients into \\spad{S},{} maps polynomials into \\spad{S}. \\spad{S} is assumed to support \\spad{+},{} \\spad{*} and \\spad{**}.")) (|map| ((|#5| (|Mapping| |#5| |#2|) (|Mapping| |#5| |#3|) |#4|) "\\spad{map(varmap, coefmap, p)} takes a \\spad{varmap},{} a mapping from the variables of polynomial \\spad{p} into \\spad{S},{} \\spad{coefmap},{} a mapping from coefficients of \\spad{p} into \\spad{S},{} and \\spad{p},{} and produces a member of \\spad{S} using the corresponding arithmetic. in \\spad{S}"))) NIL NIL -(-971 E V R P -3494) +(-970 E V R P -3493) ((|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 (-464)))) -(-972) +(-971) ((|constructor| (NIL "This domain represents network port numbers (notable TCP and UDP).")) (|port| (($ (|SingleInteger|)) "\\spad{port(n)} constructs a PortNumber from the integer `n'."))) NIL NIL -(-973) +(-972) ((|constructor| (NIL "PlottablePlaneCurveCategory is the category of curves in the plane which may be plotted via the graphics facilities. Functions are provided for obtaining lists of lists of points,{} representing the branches of the curve,{} and for determining the ranges of the \\spad{x}-coordinates and \\spad{y}-coordinates of the points on the curve.")) (|yRange| (((|Segment| (|DoubleFloat|)) $) "\\spad{yRange(c)} returns the range of the \\spad{y}-coordinates of the points on the curve \\spad{c}.")) (|xRange| (((|Segment| (|DoubleFloat|)) $) "\\spad{xRange(c)} returns the range of the \\spad{x}-coordinates of the points on the curve \\spad{c}.")) (|listBranches| (((|List| (|List| (|Point| (|DoubleFloat|)))) $) "\\spad{listBranches(c)} returns a list of lists of points,{} representing the branches of the curve \\spad{c}."))) NIL NIL -(-974 R E) +(-973 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}"))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-6 -4422)) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-569))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-3956 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-133)))) (|HasAttribute| |#1| (QUOTE -4422))) -(-975 R L) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-6 -4421)) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-568))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-3955 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-133)))) (|HasAttribute| |#1| (QUOTE -4421))) +(-974 R L) ((|constructor| (NIL "\\spadtype{PrecomputedAssociatedEquations} stores some generic precomputations which speed up the computations of the associated equations needed for factoring operators.")) (|firstUncouplingMatrix| (((|Union| (|Matrix| |#1|) "failed") |#2| (|PositiveInteger|)) "\\spad{firstUncouplingMatrix(op, m)} returns the matrix A such that \\spad{A w = (W',W'',...,W^N)} in the corresponding associated equations for right-factors of order \\spad{m} of \\spad{op}. Returns \"failed\" if the matrix A has not been precomputed for the particular combination \\spad{degree(L), m}."))) NIL NIL -(-976 S) +(-975 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"))) -((-4425 . T) (-4424 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| |#1| (QUOTE (-860))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) -(-977 A B) +((-4424 . T) (-4423 . T)) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (-3955 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| |#1| (QUOTE (-859))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +(-976 A B) ((|constructor| (NIL "\\indented{1}{This package provides tools for operating on primitive arrays} with unary and binary functions involving different underlying types")) (|map| (((|PrimitiveArray| |#2|) (|Mapping| |#2| |#1|) (|PrimitiveArray| |#1|)) "\\spad{map(f,a)} applies function \\spad{f} to each member of primitive array \\spad{a} resulting in a new primitive array over a possibly different underlying domain.")) (|reduce| ((|#2| (|Mapping| |#2| |#1| |#2|) (|PrimitiveArray| |#1|) |#2|) "\\spad{reduce(f,a,r)} applies function \\spad{f} to each successive element of the primitive array \\spad{a} and an accumulant initialized to \\spad{r}. For example,{} \\spad{reduce(_+\\$Integer,[1,2,3],0)} does \\spad{3+(2+(1+0))}. Note: third argument \\spad{r} may be regarded as the identity element for the function \\spad{f}.")) (|scan| (((|PrimitiveArray| |#2|) (|Mapping| |#2| |#1| |#2|) (|PrimitiveArray| |#1|) |#2|) "\\spad{scan(f,a,r)} successively applies \\spad{reduce(f,x,r)} to more and more leading sub-arrays \\spad{x} of primitive array \\spad{a}. More precisely,{} if \\spad{a} is \\spad{[a1,a2,...]},{} then \\spad{scan(f,a,r)} returns \\spad{[reduce(f,[a1],r),reduce(f,[a1,a2],r),...]}."))) NIL NIL -(-978) +(-977) ((|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 -(-979 -3494) +(-978 -3493) ((|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 -(-980 I) +(-979 I) ((|constructor| (NIL "The \\spadtype{IntegerPrimesPackage} implements a modification of Rabin's probabilistic primality test and the utility functions \\spadfun{nextPrime},{} \\spadfun{prevPrime} and \\spadfun{primes}.")) (|primes| (((|List| |#1|) |#1| |#1|) "\\spad{primes(a,b)} returns a list of all primes \\spad{p} with \\spad{a <= p <= b}")) (|prevPrime| ((|#1| |#1|) "\\spad{prevPrime(n)} returns the largest prime strictly smaller than \\spad{n}")) (|nextPrime| ((|#1| |#1|) "\\spad{nextPrime(n)} returns the smallest prime strictly larger than \\spad{n}")) (|prime?| (((|Boolean|) |#1|) "\\spad{prime?(n)} returns \\spad{true} if \\spad{n} is prime and \\spad{false} if not. The algorithm used is Rabin's probabilistic primality test (reference: Knuth Volume 2 Semi Numerical Algorithms). If \\spad{prime? n} returns \\spad{false},{} \\spad{n} is proven composite. If \\spad{prime? n} returns \\spad{true},{} prime? may be in error however,{} the probability of error is very low. and is zero below 25*10**9 (due to a result of Pomerance et al),{} below 10**12 and 10**13 due to results of Pinch,{} and below 341550071728321 due to a result of Jaeschke. Specifically,{} this implementation does at least 10 pseudo prime tests and so the probability of error is \\spad{< 4**(-10)}. The running time of this method is cubic in the length of the input \\spad{n},{} that is \\spad{O( (log n)**3 )},{} for \\spad{n<10**20}. beyond that,{} the algorithm is quartic,{} \\spad{O( (log n)**4 )}. Two improvements due to Davenport have been incorporated which catches some trivial strong pseudo-primes,{} such as [Jaeschke,{} 1991] 1377161253229053 * 413148375987157,{} which the original algorithm regards as prime"))) NIL NIL -(-981) +(-980) ((|constructor| (NIL "PrintPackage provides a print function for output forms.")) (|print| (((|Void|) (|OutputForm|)) "\\spad{print(o)} writes the output form \\spad{o} on standard output using the two-dimensional formatter."))) NIL NIL -(-982 A B) +(-981 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"))) -((-4421 -12 (|has| |#2| (-485)) (|has| |#1| (-485)))) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-814))) (|HasCategory| |#2| (QUOTE (-814)))) (-12 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-860))))) (-12 (|HasCategory| |#1| (QUOTE (-814))) (|HasCategory| |#2| (QUOTE (-814)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-814))) (|HasCategory| |#2| (QUOTE (-814)))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21))))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-814))) (|HasCategory| |#2| (QUOTE (-814)))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23))))) (-12 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#2| (QUOTE (-485)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#2| (QUOTE (-485)))) (-12 (|HasCategory| |#1| (QUOTE (-745))) (|HasCategory| |#2| (QUOTE (-745))))) (-12 (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-381)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-814))) (|HasCategory| |#2| (QUOTE (-814)))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#2| (QUOTE (-485)))) (-12 (|HasCategory| |#1| (QUOTE (-745))) (|HasCategory| |#2| (QUOTE (-745))))) (-12 (|HasCategory| |#1| (QUOTE (-745))) (|HasCategory| |#2| (QUOTE (-745)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-860))))) -(-983) +((-4420 -12 (|has| |#2| (-485)) (|has| |#1| (-485)))) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-813))) (|HasCategory| |#2| (QUOTE (-813)))) (-12 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-859))))) (-12 (|HasCategory| |#1| (QUOTE (-813))) (|HasCategory| |#2| (QUOTE (-813)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-813))) (|HasCategory| |#2| (QUOTE (-813)))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21))))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-813))) (|HasCategory| |#2| (QUOTE (-813)))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23))))) (-12 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#2| (QUOTE (-485)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#2| (QUOTE (-485)))) (-12 (|HasCategory| |#1| (QUOTE (-744))) (|HasCategory| |#2| (QUOTE (-744))))) (-12 (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-381)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-813))) (|HasCategory| |#2| (QUOTE (-813)))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#2| (QUOTE (-485)))) (-12 (|HasCategory| |#1| (QUOTE (-744))) (|HasCategory| |#2| (QUOTE (-744))))) (-12 (|HasCategory| |#1| (QUOTE (-744))) (|HasCategory| |#2| (QUOTE (-744)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-859))))) +(-982) ((|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 NIL -(-984 T$) +(-983 T$) ((|constructor| (NIL "This domain implements propositional formula build over a term domain,{} that itself belongs to PropositionalLogic")) (|disjunction| (($ $ $) "\\spad{disjunction(p,q)} returns a formula denoting the disjunction of \\spad{p} and \\spad{q}.")) (|conjunction| (($ $ $) "\\spad{conjunction(p,q)} returns a formula denoting the conjunction of \\spad{p} and \\spad{q}.")) (|isEquiv| (((|Maybe| (|Pair| $ $)) $) "\\spad{isEquiv f} returns a value \\spad{v} such that \\spad{v case Pair(\\%,\\%)} holds if the formula \\spad{f} is an equivalence formula.")) (|isImplies| (((|Maybe| (|Pair| $ $)) $) "\\spad{isImplies f} returns a value \\spad{v} such that \\spad{v case Pair(\\%,\\%)} holds if the formula \\spad{f} is an implication formula.")) (|isOr| (((|Maybe| (|Pair| $ $)) $) "\\spad{isOr f} returns a value \\spad{v} such that \\spad{v case Pair(\\%,\\%)} holds if the formula \\spad{f} is a disjunction formula.")) (|isAnd| (((|Maybe| (|Pair| $ $)) $) "\\spad{isAnd f} returns a value \\spad{v} such that \\spad{v case Pair(\\%,\\%)} holds if the formula \\spad{f} is a conjunction formula.")) (|isNot| (((|Maybe| $) $) "\\spad{isNot f} returns a value \\spad{v} such that \\spad{v case \\%} holds if the formula \\spad{f} is a negation.")) (|isAtom| (((|Maybe| |#1|) $) "\\spad{isAtom f} returns a value \\spad{v} such that \\spad{v case T} holds if the formula \\spad{f} is a term."))) NIL NIL -(-985 T$) +(-984 T$) ((|constructor| (NIL "This package collects unary functions operating on propositional formulae.")) (|simplify| (((|PropositionalFormula| |#1|) (|PropositionalFormula| |#1|)) "\\spad{simplify f} returns a formula logically equivalent to \\spad{f} where obvious tautologies have been removed.")) (|atoms| (((|Set| |#1|) (|PropositionalFormula| |#1|)) "\\spad{atoms f} ++ returns the set of atoms appearing in the formula \\spad{f}.")) (|dual| (((|PropositionalFormula| |#1|) (|PropositionalFormula| |#1|)) "\\spad{dual f} returns the dual of the proposition \\spad{f}."))) NIL NIL -(-986 S T$) +(-985 S T$) ((|constructor| (NIL "This package collects binary functions operating on propositional formulae.")) (|map| (((|PropositionalFormula| |#2|) (|Mapping| |#2| |#1|) (|PropositionalFormula| |#1|)) "\\spad{map(f,x)} returns a propositional formula where all atoms in \\spad{x} have been replaced by the result of applying the function \\spad{f} to them."))) NIL NIL -(-987) +(-986) ((|constructor| (NIL "This category declares the connectives of Propositional Logic.")) (|equiv| (($ $ $) "\\spad{equiv(p,q)} returns the logical equivalence of `p',{} `q'.")) (|implies| (($ $ $) "\\spad{implies(p,q)} returns the logical implication of `q' by `p'.")) (|false| (($) "\\spad{false} is a logical constant.")) (|true| (($) "\\spad{true} is a logical constant."))) NIL NIL -(-988 S) +(-987 S) ((|constructor| (NIL "A priority queue is a bag of items from an ordered set where the item extracted is always the maximum element.")) (|merge!| (($ $ $) "\\spad{merge!(q,q1)} destructively changes priority queue \\spad{q} to include the values from priority queue \\spad{q1}.")) (|merge| (($ $ $) "\\spad{merge(q1,q2)} returns combines priority queues \\spad{q1} and \\spad{q2} to return a single priority queue \\spad{q}.")) (|max| ((|#1| $) "\\spad{max(q)} returns the maximum element of priority queue \\spad{q}."))) -((-4424 . T) (-4425 . T)) +((-4423 . T) (-4424 . T)) NIL -(-989 R |polR|) +(-988 R |polR|) ((|constructor| (NIL "This package contains some functions: \\axiomOpFrom{discriminant}{PseudoRemainderSequence},{} \\axiomOpFrom{resultant}{PseudoRemainderSequence},{} \\axiomOpFrom{subResultantGcd}{PseudoRemainderSequence},{} \\axiomOpFrom{chainSubResultants}{PseudoRemainderSequence},{} \\axiomOpFrom{degreeSubResultant}{PseudoRemainderSequence},{} \\axiomOpFrom{lastSubResultant}{PseudoRemainderSequence},{} \\axiomOpFrom{resultantEuclidean}{PseudoRemainderSequence},{} \\axiomOpFrom{subResultantGcdEuclidean}{PseudoRemainderSequence},{} \\axiomOpFrom{\\spad{semiSubResultantGcdEuclidean1}}{PseudoRemainderSequence},{} \\axiomOpFrom{\\spad{semiSubResultantGcdEuclidean2}}{PseudoRemainderSequence},{} etc. This procedures are coming from improvements of the subresultants algorithm. \\indented{2}{Version : 7} \\indented{2}{References : Lionel Ducos \"Optimizations of the subresultant algorithm\"} \\indented{2}{to appear in the Journal of Pure and Applied Algebra.} \\indented{2}{Author : Ducos Lionel \\axiom{Lionel.Ducos@mathlabo.univ-poitiers.fr}}")) (|semiResultantEuclideannaif| (((|Record| (|:| |coef2| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{resultantEuclidean_naif(\\spad{P},{}\\spad{Q})} returns the semi-extended resultant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}} computed by means of the naive algorithm.")) (|resultantEuclideannaif| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{resultantEuclidean_naif(\\spad{P},{}\\spad{Q})} returns the extended resultant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}} computed by means of the naive algorithm.")) (|resultantnaif| ((|#1| |#2| |#2|) "\\axiom{resultantEuclidean_naif(\\spad{P},{}\\spad{Q})} returns the resultant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}} computed by means of the naive algorithm.")) (|nextsousResultant2| ((|#2| |#2| |#2| |#2| |#1|) "\\axiom{\\spad{nextsousResultant2}(\\spad{P},{} \\spad{Q},{} \\spad{Z},{} \\spad{s})} returns the subresultant \\axiom{S_{\\spad{e}-1}} where \\axiom{\\spad{P} ~ S_d,{} \\spad{Q} = S_{\\spad{d}-1},{} \\spad{Z} = S_e,{} \\spad{s} = lc(S_d)}")) (|Lazard2| ((|#2| |#2| |#1| |#1| (|NonNegativeInteger|)) "\\axiom{\\spad{Lazard2}(\\spad{F},{} \\spad{x},{} \\spad{y},{} \\spad{n})} computes \\axiom{(x/y)**(\\spad{n}-1) * \\spad{F}}")) (|Lazard| ((|#1| |#1| |#1| (|NonNegativeInteger|)) "\\axiom{Lazard(\\spad{x},{} \\spad{y},{} \\spad{n})} computes \\axiom{x**n/y**(\\spad{n}-1)}")) (|divide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2|) "\\axiom{divide(\\spad{F},{}\\spad{G})} computes quotient and rest of the exact euclidean division of \\axiom{\\spad{F}} by \\axiom{\\spad{G}}.")) (|pseudoDivide| (((|Record| (|:| |coef| |#1|) (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2|) "\\axiom{pseudoDivide(\\spad{P},{}\\spad{Q})} computes the pseudoDivide of \\axiom{\\spad{P}} by \\axiom{\\spad{Q}}.")) (|exquo| (((|Vector| |#2|) (|Vector| |#2|) |#1|) "\\axiom{\\spad{v} exquo \\spad{r}} computes the exact quotient of \\axiom{\\spad{v}} by \\axiom{\\spad{r}}")) (* (((|Vector| |#2|) |#1| (|Vector| |#2|)) "\\axiom{\\spad{r} * \\spad{v}} computes the product of \\axiom{\\spad{r}} and \\axiom{\\spad{v}}")) (|gcd| ((|#2| |#2| |#2|) "\\axiom{gcd(\\spad{P},{} \\spad{Q})} returns the gcd of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|semiResultantReduitEuclidean| (((|Record| (|:| |coef2| |#2|) (|:| |resultantReduit| |#1|)) |#2| |#2|) "\\axiom{semiResultantReduitEuclidean(\\spad{P},{}\\spad{Q})} returns the \"reduce resultant\" and carries out the equality \\axiom{...\\spad{P} + coef2*Q = resultantReduit(\\spad{P},{}\\spad{Q})}.")) (|resultantReduitEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |resultantReduit| |#1|)) |#2| |#2|) "\\axiom{resultantReduitEuclidean(\\spad{P},{}\\spad{Q})} returns the \"reduce resultant\" and carries out the equality \\axiom{coef1*P + coef2*Q = resultantReduit(\\spad{P},{}\\spad{Q})}.")) (|resultantReduit| ((|#1| |#2| |#2|) "\\axiom{resultantReduit(\\spad{P},{}\\spad{Q})} returns the \"reduce resultant\" of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|schema| (((|List| (|NonNegativeInteger|)) |#2| |#2|) "\\axiom{schema(\\spad{P},{}\\spad{Q})} returns the list of degrees of non zero subresultants of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|chainSubResultants| (((|List| |#2|) |#2| |#2|) "\\axiom{chainSubResultants(\\spad{P},{} \\spad{Q})} computes the list of non zero subresultants of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|semiDiscriminantEuclidean| (((|Record| (|:| |coef2| |#2|) (|:| |discriminant| |#1|)) |#2|) "\\axiom{discriminantEuclidean(\\spad{P})} carries out the equality \\axiom{...\\spad{P} + \\spad{coef2} * \\spad{D}(\\spad{P}) = discriminant(\\spad{P})}. Warning: \\axiom{degree(\\spad{P}) >= degree(\\spad{Q})}.")) (|discriminantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |discriminant| |#1|)) |#2|) "\\axiom{discriminantEuclidean(\\spad{P})} carries out the equality \\axiom{\\spad{coef1} * \\spad{P} + \\spad{coef2} * \\spad{D}(\\spad{P}) = discriminant(\\spad{P})}.")) (|discriminant| ((|#1| |#2|) "\\axiom{discriminant(\\spad{P},{} \\spad{Q})} returns the discriminant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|semiSubResultantGcdEuclidean1| (((|Record| (|:| |coef1| |#2|) (|:| |gcd| |#2|)) |#2| |#2|) "\\axiom{\\spad{semiSubResultantGcdEuclidean1}(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{coef1*P + ? \\spad{Q} = +/- S_i(\\spad{P},{}\\spad{Q})} where the degree (not the indice) of the subresultant \\axiom{S_i(\\spad{P},{}\\spad{Q})} is the smaller as possible.")) (|semiSubResultantGcdEuclidean2| (((|Record| (|:| |coef2| |#2|) (|:| |gcd| |#2|)) |#2| |#2|) "\\axiom{\\spad{semiSubResultantGcdEuclidean2}(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{...\\spad{P} + coef2*Q = +/- S_i(\\spad{P},{}\\spad{Q})} where the degree (not the indice) of the subresultant \\axiom{S_i(\\spad{P},{}\\spad{Q})} is the smaller as possible. Warning: \\axiom{degree(\\spad{P}) >= degree(\\spad{Q})}.")) (|subResultantGcdEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |gcd| |#2|)) |#2| |#2|) "\\axiom{subResultantGcdEuclidean(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{coef1*P + coef2*Q = +/- S_i(\\spad{P},{}\\spad{Q})} where the degree (not the indice) of the subresultant \\axiom{S_i(\\spad{P},{}\\spad{Q})} is the smaller as possible.")) (|subResultantGcd| ((|#2| |#2| |#2|) "\\axiom{subResultantGcd(\\spad{P},{} \\spad{Q})} returns the gcd of two primitive polynomials \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|semiLastSubResultantEuclidean| (((|Record| (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2|) "\\axiom{semiLastSubResultantEuclidean(\\spad{P},{} \\spad{Q})} computes the last non zero subresultant \\axiom{\\spad{S}} and carries out the equality \\axiom{...\\spad{P} + coef2*Q = \\spad{S}}. Warning: \\axiom{degree(\\spad{P}) >= degree(\\spad{Q})}.")) (|lastSubResultantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2|) "\\axiom{lastSubResultantEuclidean(\\spad{P},{} \\spad{Q})} computes the last non zero subresultant \\axiom{\\spad{S}} and carries out the equality \\axiom{coef1*P + coef2*Q = \\spad{S}}.")) (|lastSubResultant| ((|#2| |#2| |#2|) "\\axiom{lastSubResultant(\\spad{P},{} \\spad{Q})} computes the last non zero subresultant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}")) (|semiDegreeSubResultantEuclidean| (((|Record| (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2| (|NonNegativeInteger|)) "\\axiom{indiceSubResultant(\\spad{P},{} \\spad{Q},{} \\spad{i})} returns a subresultant \\axiom{\\spad{S}} of degree \\axiom{\\spad{d}} and carries out the equality \\axiom{...\\spad{P} + coef2*Q = S_i}. Warning: \\axiom{degree(\\spad{P}) >= degree(\\spad{Q})}.")) (|degreeSubResultantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2| (|NonNegativeInteger|)) "\\axiom{indiceSubResultant(\\spad{P},{} \\spad{Q},{} \\spad{i})} returns a subresultant \\axiom{\\spad{S}} of degree \\axiom{\\spad{d}} and carries out the equality \\axiom{coef1*P + coef2*Q = S_i}.")) (|degreeSubResultant| ((|#2| |#2| |#2| (|NonNegativeInteger|)) "\\axiom{degreeSubResultant(\\spad{P},{} \\spad{Q},{} \\spad{d})} computes a subresultant of degree \\axiom{\\spad{d}}.")) (|semiIndiceSubResultantEuclidean| (((|Record| (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2| (|NonNegativeInteger|)) "\\axiom{semiIndiceSubResultantEuclidean(\\spad{P},{} \\spad{Q},{} \\spad{i})} returns the subresultant \\axiom{S_i(\\spad{P},{}\\spad{Q})} and carries out the equality \\axiom{...\\spad{P} + coef2*Q = S_i(\\spad{P},{}\\spad{Q})} Warning: \\axiom{degree(\\spad{P}) >= degree(\\spad{Q})}.")) (|indiceSubResultantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2| (|NonNegativeInteger|)) "\\axiom{indiceSubResultant(\\spad{P},{} \\spad{Q},{} \\spad{i})} returns the subresultant \\axiom{S_i(\\spad{P},{}\\spad{Q})} and carries out the equality \\axiom{coef1*P + coef2*Q = S_i(\\spad{P},{}\\spad{Q})}")) (|indiceSubResultant| ((|#2| |#2| |#2| (|NonNegativeInteger|)) "\\axiom{indiceSubResultant(\\spad{P},{} \\spad{Q},{} \\spad{i})} returns the subresultant of indice \\axiom{\\spad{i}}")) (|semiResultantEuclidean1| (((|Record| (|:| |coef1| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{\\spad{semiResultantEuclidean1}(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{\\spad{coef1}.\\spad{P} + ? \\spad{Q} = resultant(\\spad{P},{}\\spad{Q})}.")) (|semiResultantEuclidean2| (((|Record| (|:| |coef2| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{\\spad{semiResultantEuclidean2}(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{...\\spad{P} + coef2*Q = resultant(\\spad{P},{}\\spad{Q})}. Warning: \\axiom{degree(\\spad{P}) >= degree(\\spad{Q})}.")) (|resultantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{resultantEuclidean(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{coef1*P + coef2*Q = resultant(\\spad{P},{}\\spad{Q})}")) (|resultant| ((|#1| |#2| |#2|) "\\axiom{resultant(\\spad{P},{} \\spad{Q})} returns the resultant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}"))) NIL ((|HasCategory| |#1| (QUOTE (-464)))) -(-990) +(-989) ((|constructor| (NIL "This domain represents `pretend' expressions.")) (|target| (((|TypeAst|) $) "\\spad{target(e)} returns the target type of the conversion..")) (|expression| (((|SpadAst|) $) "\\spad{expression(e)} returns the expression being converted."))) NIL NIL -(-991) +(-990) ((|constructor| (NIL "Partition is an OrderedCancellationAbelianMonoid which is used as the basis for symmetric polynomial representation of the sums of powers in SymmetricPolynomial. Thus,{} \\spad{(5 2 2 1)} will represent \\spad{s5 * s2**2 * s1}.")) (|conjugate| (($ $) "\\spad{conjugate(p)} returns the conjugate partition of a partition \\spad{p}")) (|pdct| (((|PositiveInteger|) $) "\\spad{pdct(a1**n1 a2**n2 ...)} returns \\spad{n1! * a1**n1 * n2! * a2**n2 * ...}. This function is used in the package \\spadtype{CycleIndicators}.")) (|powers| (((|List| (|Pair| (|PositiveInteger|) (|PositiveInteger|))) $) "\\spad{powers(x)} returns a list of pairs. The second component of each pair is the multiplicity with which the first component occurs in \\spad{li}.")) (|partitions| (((|Stream| $) (|NonNegativeInteger|)) "\\spad{partitions n} returns the stream of all partitions of size \\spad{n}.")) (|#| (((|NonNegativeInteger|) $) "\\spad{\\#x} returns the sum of all parts of the partition \\spad{x}.")) (|parts| (((|List| (|PositiveInteger|)) $) "\\spad{parts x} returns the list of decreasing integer sequence making up the partition \\spad{x}.")) (|partition| (($ (|List| (|PositiveInteger|))) "\\spad{partition(li)} converts a list of integers \\spad{li} to a partition"))) NIL NIL -(-992 S |Coef| |Expon| |Var|) +(-991 S |Coef| |Expon| |Var|) ((|constructor| (NIL "\\spadtype{PowerSeriesCategory} is the most general power series category with exponents in an ordered abelian monoid.")) (|complete| (($ $) "\\spad{complete(f)} causes all terms of \\spad{f} to be computed. Note: this results in an infinite loop if \\spad{f} has infinitely many terms.")) (|pole?| (((|Boolean|) $) "\\spad{pole?(f)} determines if the power series \\spad{f} has a pole.")) (|variables| (((|List| |#4|) $) "\\spad{variables(f)} returns a list of the variables occuring in the power series \\spad{f}.")) (|degree| ((|#3| $) "\\spad{degree(f)} returns the exponent of the lowest order term of \\spad{f}.")) (|leadingCoefficient| ((|#2| $) "\\spad{leadingCoefficient(f)} returns the coefficient of the lowest order term of \\spad{f}")) (|leadingMonomial| (($ $) "\\spad{leadingMonomial(f)} returns the monomial of \\spad{f} of lowest order.")) (|monomial| (($ $ (|List| |#4|) (|List| |#3|)) "\\spad{monomial(a,[x1,..,xk],[n1,..,nk])} computes \\spad{a * x1**n1 * .. * xk**nk}.") (($ $ |#4| |#3|) "\\spad{monomial(a,x,n)} computes \\spad{a*x**n}."))) NIL NIL -(-993 |Coef| |Expon| |Var|) +(-992 |Coef| |Expon| |Var|) ((|constructor| (NIL "\\spadtype{PowerSeriesCategory} is the most general power series category with exponents in an ordered abelian monoid.")) (|complete| (($ $) "\\spad{complete(f)} causes all terms of \\spad{f} to be computed. Note: this results in an infinite loop if \\spad{f} has infinitely many terms.")) (|pole?| (((|Boolean|) $) "\\spad{pole?(f)} determines if the power series \\spad{f} has a pole.")) (|variables| (((|List| |#3|) $) "\\spad{variables(f)} returns a list of the variables occuring in the power series \\spad{f}.")) (|degree| ((|#2| $) "\\spad{degree(f)} returns the exponent of the lowest order term of \\spad{f}.")) (|leadingCoefficient| ((|#1| $) "\\spad{leadingCoefficient(f)} returns the coefficient of the lowest order term of \\spad{f}")) (|leadingMonomial| (($ $) "\\spad{leadingMonomial(f)} returns the monomial of \\spad{f} of lowest order.")) (|monomial| (($ $ (|List| |#3|) (|List| |#2|)) "\\spad{monomial(a,[x1,..,xk],[n1,..,nk])} computes \\spad{a * x1**n1 * .. * xk**nk}.") (($ $ |#3| |#2|) "\\spad{monomial(a,x,n)} computes \\spad{a*x**n}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4418 . T) (-4419 . T) (-4421 . T)) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-994) +(-993) ((|constructor| (NIL "PlottableSpaceCurveCategory is the category of curves in 3-space which may be plotted via the graphics facilities. Functions are provided for obtaining lists of lists of points,{} representing the branches of the curve,{} and for determining the ranges of the x-,{} y-,{} and \\spad{z}-coordinates of the points on the curve.")) (|zRange| (((|Segment| (|DoubleFloat|)) $) "\\spad{zRange(c)} returns the range of the \\spad{z}-coordinates of the points on the curve \\spad{c}.")) (|yRange| (((|Segment| (|DoubleFloat|)) $) "\\spad{yRange(c)} returns the range of the \\spad{y}-coordinates of the points on the curve \\spad{c}.")) (|xRange| (((|Segment| (|DoubleFloat|)) $) "\\spad{xRange(c)} returns the range of the \\spad{x}-coordinates of the points on the curve \\spad{c}.")) (|listBranches| (((|List| (|List| (|Point| (|DoubleFloat|)))) $) "\\spad{listBranches(c)} returns a list of lists of points,{} representing the branches of the curve \\spad{c}."))) NIL NIL -(-995 S R E |VarSet| P) +(-994 S R E |VarSet| P) ((|constructor| (NIL "A category for finite subsets of a polynomial ring. Such a set is only regarded as a set of polynomials and not identified to the ideal it generates. So two distinct sets may generate the same the ideal. Furthermore,{} for \\spad{R} being an integral domain,{} a set of polynomials may be viewed as a representation of the ideal it generates in the polynomial ring \\spad{(R)^(-1) P},{} or the set of its zeros (described for instance by the radical of the previous ideal,{} or a split of the associated affine variety) and so on. So this category provides operations about those different notions.")) (|triangular?| (((|Boolean|) $) "\\axiom{triangular?(ps)} returns \\spad{true} iff \\axiom{ps} is a triangular set,{} \\spadignore{i.e.} two distinct polynomials have distinct main variables and no constant lies in \\axiom{ps}.")) (|rewriteIdealWithRemainder| (((|List| |#5|) (|List| |#5|) $) "\\axiom{rewriteIdealWithRemainder(lp,{}cs)} returns \\axiom{lr} such that every polynomial in \\axiom{lr} is fully reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{cs} and \\axiom{(lp,{}cs)} and \\axiom{(lr,{}cs)} generate the same ideal in \\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}}.")) (|rewriteIdealWithHeadRemainder| (((|List| |#5|) (|List| |#5|) $) "\\axiom{rewriteIdealWithHeadRemainder(lp,{}cs)} returns \\axiom{lr} such that the leading monomial of every polynomial in \\axiom{lr} is reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{cs} and \\axiom{(lp,{}cs)} and \\axiom{(lr,{}cs)} generate the same ideal in \\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}}.")) (|remainder| (((|Record| (|:| |rnum| |#2|) (|:| |polnum| |#5|) (|:| |den| |#2|)) |#5| $) "\\axiom{remainder(a,{}ps)} returns \\axiom{[\\spad{c},{}\\spad{b},{}\\spad{r}]} such that \\axiom{\\spad{b}} is fully reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{ps},{} \\axiom{r*a - c*b} lies in the ideal generated by \\axiom{ps}. Furthermore,{} if \\axiom{\\spad{R}} is a gcd-domain,{} \\axiom{\\spad{b}} is primitive.")) (|headRemainder| (((|Record| (|:| |num| |#5|) (|:| |den| |#2|)) |#5| $) "\\axiom{headRemainder(a,{}ps)} returns \\axiom{[\\spad{b},{}\\spad{r}]} such that the leading monomial of \\axiom{\\spad{b}} is reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{ps} and \\axiom{r*a - \\spad{b}} lies in the ideal generated by \\axiom{ps}.")) (|roughUnitIdeal?| (((|Boolean|) $) "\\axiom{roughUnitIdeal?(ps)} returns \\spad{true} iff \\axiom{ps} contains some non null element lying in the base ring \\axiom{\\spad{R}}.")) (|roughEqualIdeals?| (((|Boolean|) $ $) "\\axiom{roughEqualIdeals?(\\spad{ps1},{}\\spad{ps2})} returns \\spad{true} iff it can proved that \\axiom{\\spad{ps1}} and \\axiom{\\spad{ps2}} generate the same ideal in \\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}} without computing Groebner bases.")) (|roughSubIdeal?| (((|Boolean|) $ $) "\\axiom{roughSubIdeal?(\\spad{ps1},{}\\spad{ps2})} returns \\spad{true} iff it can proved that all polynomials in \\axiom{\\spad{ps1}} lie in the ideal generated by \\axiom{\\spad{ps2}} in \\axiom{\\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}}} without computing Groebner bases.")) (|roughBase?| (((|Boolean|) $) "\\axiom{roughBase?(ps)} returns \\spad{true} iff for every pair \\axiom{{\\spad{p},{}\\spad{q}}} of polynomials in \\axiom{ps} their leading monomials are relatively prime.")) (|trivialIdeal?| (((|Boolean|) $) "\\axiom{trivialIdeal?(ps)} returns \\spad{true} iff \\axiom{ps} does not contain non-zero elements.")) (|sort| (((|Record| (|:| |under| $) (|:| |floor| $) (|:| |upper| $)) $ |#4|) "\\axiom{sort(\\spad{v},{}ps)} returns \\axiom{us,{}vs,{}ws} such that \\axiom{us} is \\axiom{collectUnder(ps,{}\\spad{v})},{} \\axiom{vs} is \\axiom{collect(ps,{}\\spad{v})} and \\axiom{ws} is \\axiom{collectUpper(ps,{}\\spad{v})}.")) (|collectUpper| (($ $ |#4|) "\\axiom{collectUpper(ps,{}\\spad{v})} returns the set consisting of the polynomials of \\axiom{ps} with main variable greater than \\axiom{\\spad{v}}.")) (|collect| (($ $ |#4|) "\\axiom{collect(ps,{}\\spad{v})} returns the set consisting of the polynomials of \\axiom{ps} with \\axiom{\\spad{v}} as main variable.")) (|collectUnder| (($ $ |#4|) "\\axiom{collectUnder(ps,{}\\spad{v})} returns the set consisting of the polynomials of \\axiom{ps} with main variable less than \\axiom{\\spad{v}}.")) (|mainVariable?| (((|Boolean|) |#4| $) "\\axiom{mainVariable?(\\spad{v},{}ps)} returns \\spad{true} iff \\axiom{\\spad{v}} is the main variable of some polynomial in \\axiom{ps}.")) (|mainVariables| (((|List| |#4|) $) "\\axiom{mainVariables(ps)} returns the decreasingly sorted list of the variables which are main variables of some polynomial in \\axiom{ps}.")) (|variables| (((|List| |#4|) $) "\\axiom{variables(ps)} returns the decreasingly sorted list of the variables which are variables of some polynomial in \\axiom{ps}.")) (|mvar| ((|#4| $) "\\axiom{mvar(ps)} returns the main variable of the non constant polynomial with the greatest main variable,{} if any,{} else an error is returned.")) (|retract| (($ (|List| |#5|)) "\\axiom{retract(lp)} returns an element of the domain whose elements are the members of \\axiom{lp} if such an element exists,{} otherwise an error is produced.")) (|retractIfCan| (((|Union| $ "failed") (|List| |#5|)) "\\axiom{retractIfCan(lp)} returns an element of the domain whose elements are the members of \\axiom{lp} if such an element exists,{} otherwise \\axiom{\"failed\"} is returned."))) NIL -((|HasCategory| |#2| (QUOTE (-569)))) -(-996 R E |VarSet| P) +((|HasCategory| |#2| (QUOTE (-568)))) +(-995 R E |VarSet| P) ((|constructor| (NIL "A category for finite subsets of a polynomial ring. Such a set is only regarded as a set of polynomials and not identified to the ideal it generates. So two distinct sets may generate the same the ideal. Furthermore,{} for \\spad{R} being an integral domain,{} a set of polynomials may be viewed as a representation of the ideal it generates in the polynomial ring \\spad{(R)^(-1) P},{} or the set of its zeros (described for instance by the radical of the previous ideal,{} or a split of the associated affine variety) and so on. So this category provides operations about those different notions.")) (|triangular?| (((|Boolean|) $) "\\axiom{triangular?(ps)} returns \\spad{true} iff \\axiom{ps} is a triangular set,{} \\spadignore{i.e.} two distinct polynomials have distinct main variables and no constant lies in \\axiom{ps}.")) (|rewriteIdealWithRemainder| (((|List| |#4|) (|List| |#4|) $) "\\axiom{rewriteIdealWithRemainder(lp,{}cs)} returns \\axiom{lr} such that every polynomial in \\axiom{lr} is fully reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{cs} and \\axiom{(lp,{}cs)} and \\axiom{(lr,{}cs)} generate the same ideal in \\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}}.")) (|rewriteIdealWithHeadRemainder| (((|List| |#4|) (|List| |#4|) $) "\\axiom{rewriteIdealWithHeadRemainder(lp,{}cs)} returns \\axiom{lr} such that the leading monomial of every polynomial in \\axiom{lr} is reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{cs} and \\axiom{(lp,{}cs)} and \\axiom{(lr,{}cs)} generate the same ideal in \\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}}.")) (|remainder| (((|Record| (|:| |rnum| |#1|) (|:| |polnum| |#4|) (|:| |den| |#1|)) |#4| $) "\\axiom{remainder(a,{}ps)} returns \\axiom{[\\spad{c},{}\\spad{b},{}\\spad{r}]} such that \\axiom{\\spad{b}} is fully reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{ps},{} \\axiom{r*a - c*b} lies in the ideal generated by \\axiom{ps}. Furthermore,{} if \\axiom{\\spad{R}} is a gcd-domain,{} \\axiom{\\spad{b}} is primitive.")) (|headRemainder| (((|Record| (|:| |num| |#4|) (|:| |den| |#1|)) |#4| $) "\\axiom{headRemainder(a,{}ps)} returns \\axiom{[\\spad{b},{}\\spad{r}]} such that the leading monomial of \\axiom{\\spad{b}} is reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{ps} and \\axiom{r*a - \\spad{b}} lies in the ideal generated by \\axiom{ps}.")) (|roughUnitIdeal?| (((|Boolean|) $) "\\axiom{roughUnitIdeal?(ps)} returns \\spad{true} iff \\axiom{ps} contains some non null element lying in the base ring \\axiom{\\spad{R}}.")) (|roughEqualIdeals?| (((|Boolean|) $ $) "\\axiom{roughEqualIdeals?(\\spad{ps1},{}\\spad{ps2})} returns \\spad{true} iff it can proved that \\axiom{\\spad{ps1}} and \\axiom{\\spad{ps2}} generate the same ideal in \\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}} without computing Groebner bases.")) (|roughSubIdeal?| (((|Boolean|) $ $) "\\axiom{roughSubIdeal?(\\spad{ps1},{}\\spad{ps2})} returns \\spad{true} iff it can proved that all polynomials in \\axiom{\\spad{ps1}} lie in the ideal generated by \\axiom{\\spad{ps2}} in \\axiom{\\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}}} without computing Groebner bases.")) (|roughBase?| (((|Boolean|) $) "\\axiom{roughBase?(ps)} returns \\spad{true} iff for every pair \\axiom{{\\spad{p},{}\\spad{q}}} of polynomials in \\axiom{ps} their leading monomials are relatively prime.")) (|trivialIdeal?| (((|Boolean|) $) "\\axiom{trivialIdeal?(ps)} returns \\spad{true} iff \\axiom{ps} does not contain non-zero elements.")) (|sort| (((|Record| (|:| |under| $) (|:| |floor| $) (|:| |upper| $)) $ |#3|) "\\axiom{sort(\\spad{v},{}ps)} returns \\axiom{us,{}vs,{}ws} such that \\axiom{us} is \\axiom{collectUnder(ps,{}\\spad{v})},{} \\axiom{vs} is \\axiom{collect(ps,{}\\spad{v})} and \\axiom{ws} is \\axiom{collectUpper(ps,{}\\spad{v})}.")) (|collectUpper| (($ $ |#3|) "\\axiom{collectUpper(ps,{}\\spad{v})} returns the set consisting of the polynomials of \\axiom{ps} with main variable greater than \\axiom{\\spad{v}}.")) (|collect| (($ $ |#3|) "\\axiom{collect(ps,{}\\spad{v})} returns the set consisting of the polynomials of \\axiom{ps} with \\axiom{\\spad{v}} as main variable.")) (|collectUnder| (($ $ |#3|) "\\axiom{collectUnder(ps,{}\\spad{v})} returns the set consisting of the polynomials of \\axiom{ps} with main variable less than \\axiom{\\spad{v}}.")) (|mainVariable?| (((|Boolean|) |#3| $) "\\axiom{mainVariable?(\\spad{v},{}ps)} returns \\spad{true} iff \\axiom{\\spad{v}} is the main variable of some polynomial in \\axiom{ps}.")) (|mainVariables| (((|List| |#3|) $) "\\axiom{mainVariables(ps)} returns the decreasingly sorted list of the variables which are main variables of some polynomial in \\axiom{ps}.")) (|variables| (((|List| |#3|) $) "\\axiom{variables(ps)} returns the decreasingly sorted list of the variables which are variables of some polynomial in \\axiom{ps}.")) (|mvar| ((|#3| $) "\\axiom{mvar(ps)} returns the main variable of the non constant polynomial with the greatest main variable,{} if any,{} else an error is returned.")) (|retract| (($ (|List| |#4|)) "\\axiom{retract(lp)} returns an element of the domain whose elements are the members of \\axiom{lp} if such an element exists,{} otherwise an error is produced.")) (|retractIfCan| (((|Union| $ "failed") (|List| |#4|)) "\\axiom{retractIfCan(lp)} returns an element of the domain whose elements are the members of \\axiom{lp} if such an element exists,{} otherwise \\axiom{\"failed\"} is returned."))) -((-4424 . T)) +((-4423 . T)) NIL -(-997 R E V P) +(-996 R E V P) ((|constructor| (NIL "This package provides modest routines for polynomial system solving. The aim of many of the operations of this package is to remove certain factors in some polynomials in order to avoid unnecessary computations in algorithms involving splitting techniques by partial factorization.")) (|removeIrreducibleRedundantFactors| (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeIrreducibleRedundantFactors(lp,{}lq)} returns the same as \\axiom{irreducibleFactors(concat(lp,{}lq))} assuming that \\axiom{irreducibleFactors(lp)} returns \\axiom{lp} up to replacing some polynomial \\axiom{pj} in \\axiom{lp} by some polynomial \\axiom{qj} associated to \\axiom{pj}.")) (|lazyIrreducibleFactors| (((|List| |#4|) (|List| |#4|)) "\\axiom{lazyIrreducibleFactors(lp)} returns \\axiom{lf} such that if \\axiom{lp = [\\spad{p1},{}...,{}pn]} and \\axiom{lf = [\\spad{f1},{}...,{}fm]} then \\axiom{p1*p2*...\\spad{*pn=0}} means \\axiom{f1*f2*...\\spad{*fm=0}},{} and the \\axiom{\\spad{fi}} are irreducible over \\axiom{\\spad{R}} and are pairwise distinct. The algorithm tries to avoid factorization into irreducible factors as far as possible and makes previously use of gcd techniques over \\axiom{\\spad{R}}.")) (|irreducibleFactors| (((|List| |#4|) (|List| |#4|)) "\\axiom{irreducibleFactors(lp)} returns \\axiom{lf} such that if \\axiom{lp = [\\spad{p1},{}...,{}pn]} and \\axiom{lf = [\\spad{f1},{}...,{}fm]} then \\axiom{p1*p2*...\\spad{*pn=0}} means \\axiom{f1*f2*...\\spad{*fm=0}},{} and the \\axiom{\\spad{fi}} are irreducible over \\axiom{\\spad{R}} and are pairwise distinct.")) (|removeRedundantFactorsInPols| (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRedundantFactorsInPols(lp,{}lf)} returns \\axiom{newlp} where \\axiom{newlp} is obtained from \\axiom{lp} by removing in every polynomial \\axiom{\\spad{p}} of \\axiom{lp} any non trivial factor of any polynomial \\axiom{\\spad{f}} in \\axiom{lf}. Moreover,{} squares over \\axiom{\\spad{R}} are first removed in every polynomial \\axiom{lp}.")) (|removeRedundantFactorsInContents| (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRedundantFactorsInContents(lp,{}lf)} returns \\axiom{newlp} where \\axiom{newlp} is obtained from \\axiom{lp} by removing in the content of every polynomial of \\axiom{lp} any non trivial factor of any polynomial \\axiom{\\spad{f}} in \\axiom{lf}. Moreover,{} squares over \\axiom{\\spad{R}} are first removed in the content of every polynomial of \\axiom{lp}.")) (|removeRoughlyRedundantFactorsInContents| (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRoughlyRedundantFactorsInContents(lp,{}lf)} returns \\axiom{newlp}where \\axiom{newlp} is obtained from \\axiom{lp} by removing in the content of every polynomial of \\axiom{lp} any occurence of a polynomial \\axiom{\\spad{f}} in \\axiom{lf}. Moreover,{} squares over \\axiom{\\spad{R}} are first removed in the content of every polynomial of \\axiom{lp}.")) (|univariatePolynomialsGcds| (((|List| |#4|) (|List| |#4|) (|Boolean|)) "\\axiom{univariatePolynomialsGcds(lp,{}opt)} returns the same as \\axiom{univariatePolynomialsGcds(lp)} if \\axiom{opt} is \\axiom{\\spad{false}} and if the previous operation does not return any non null and constant polynomial,{} else return \\axiom{[1]}.") (((|List| |#4|) (|List| |#4|)) "\\axiom{univariatePolynomialsGcds(lp)} returns \\axiom{lg} where \\axiom{lg} is a list of the gcds of every pair in \\axiom{lp} of univariate polynomials in the same main variable.")) (|squareFreeFactors| (((|List| |#4|) |#4|) "\\axiom{squareFreeFactors(\\spad{p})} returns the square-free factors of \\axiom{\\spad{p}} over \\axiom{\\spad{R}}")) (|rewriteIdealWithQuasiMonicGenerators| (((|List| |#4|) (|List| |#4|) (|Mapping| (|Boolean|) |#4| |#4|) (|Mapping| |#4| |#4| |#4|)) "\\axiom{rewriteIdealWithQuasiMonicGenerators(lp,{}redOp?,{}redOp)} returns \\axiom{lq} where \\axiom{lq} and \\axiom{lp} generate the same ideal in \\axiom{R^(\\spad{-1}) \\spad{P}} and \\axiom{lq} has rank not higher than the one of \\axiom{lp}. Moreover,{} \\axiom{lq} is computed by reducing \\axiom{lp} \\spad{w}.\\spad{r}.\\spad{t}. some basic set of the ideal generated by the quasi-monic polynomials in \\axiom{lp}.")) (|rewriteSetByReducingWithParticularGenerators| (((|List| |#4|) (|List| |#4|) (|Mapping| (|Boolean|) |#4|) (|Mapping| (|Boolean|) |#4| |#4|) (|Mapping| |#4| |#4| |#4|)) "\\axiom{rewriteSetByReducingWithParticularGenerators(lp,{}pred?,{}redOp?,{}redOp)} returns \\axiom{lq} where \\axiom{lq} is computed by the following algorithm. Chose a basic set \\spad{w}.\\spad{r}.\\spad{t}. the reduction-test \\axiom{redOp?} among the polynomials satisfying property \\axiom{pred?},{} if it is empty then leave,{} else reduce the other polynomials by this basic set \\spad{w}.\\spad{r}.\\spad{t}. the reduction-operation \\axiom{redOp}. Repeat while another basic set with smaller rank can be computed. See code. If \\axiom{pred?} is \\axiom{quasiMonic?} the ideal is unchanged.")) (|crushedSet| (((|List| |#4|) (|List| |#4|)) "\\axiom{crushedSet(lp)} returns \\axiom{lq} such that \\axiom{lp} and and \\axiom{lq} generate the same ideal and no rough basic sets reduce (in the sense of Groebner bases) the other polynomials in \\axiom{lq}.")) (|roughBasicSet| (((|Union| (|Record| (|:| |bas| (|GeneralTriangularSet| |#1| |#2| |#3| |#4|)) (|:| |top| (|List| |#4|))) "failed") (|List| |#4|)) "\\axiom{roughBasicSet(lp)} returns the smallest (with Ritt-Wu ordering) triangular set contained in \\axiom{lp}.")) (|interReduce| (((|List| |#4|) (|List| |#4|)) "\\axiom{interReduce(lp)} returns \\axiom{lq} such that \\axiom{lp} and \\axiom{lq} generate the same ideal and no polynomial in \\axiom{lq} is reducuble by the others in the sense of Groebner bases. Since no assumptions are required the result may depend on the ordering the reductions are performed.")) (|removeRoughlyRedundantFactorsInPol| ((|#4| |#4| (|List| |#4|)) "\\axiom{removeRoughlyRedundantFactorsInPol(\\spad{p},{}lf)} returns the same as removeRoughlyRedundantFactorsInPols([\\spad{p}],{}lf,{}\\spad{true})")) (|removeRoughlyRedundantFactorsInPols| (((|List| |#4|) (|List| |#4|) (|List| |#4|) (|Boolean|)) "\\axiom{removeRoughlyRedundantFactorsInPols(lp,{}lf,{}opt)} returns the same as \\axiom{removeRoughlyRedundantFactorsInPols(lp,{}lf)} if \\axiom{opt} is \\axiom{\\spad{false}} and if the previous operation does not return any non null and constant polynomial,{} else return \\axiom{[1]}.") (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRoughlyRedundantFactorsInPols(lp,{}lf)} returns \\axiom{newlp}where \\axiom{newlp} is obtained from \\axiom{lp} by removing in every polynomial \\axiom{\\spad{p}} of \\axiom{lp} any occurence of a polynomial \\axiom{\\spad{f}} in \\axiom{lf}. This may involve a lot of exact-quotients computations.")) (|bivariatePolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| |#4|)) "\\axiom{bivariatePolynomials(lp)} returns \\axiom{bps,{}nbps} where \\axiom{bps} is a list of the bivariate polynomials,{} and \\axiom{nbps} are the other ones.")) (|bivariate?| (((|Boolean|) |#4|) "\\axiom{bivariate?(\\spad{p})} returns \\spad{true} iff \\axiom{\\spad{p}} involves two and only two variables.")) (|linearPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| |#4|)) "\\axiom{linearPolynomials(lp)} returns \\axiom{lps,{}nlps} where \\axiom{lps} is a list of the linear polynomials in lp,{} and \\axiom{nlps} are the other ones.")) (|linear?| (((|Boolean|) |#4|) "\\axiom{linear?(\\spad{p})} returns \\spad{true} iff \\axiom{\\spad{p}} does not lie in the base ring \\axiom{\\spad{R}} and has main degree \\axiom{1}.")) (|univariatePolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| |#4|)) "\\axiom{univariatePolynomials(lp)} returns \\axiom{ups,{}nups} where \\axiom{ups} is a list of the univariate polynomials,{} and \\axiom{nups} are the other ones.")) (|univariate?| (((|Boolean|) |#4|) "\\axiom{univariate?(\\spad{p})} returns \\spad{true} iff \\axiom{\\spad{p}} involves one and only one variable.")) (|quasiMonicPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| |#4|)) "\\axiom{quasiMonicPolynomials(lp)} returns \\axiom{qmps,{}nqmps} where \\axiom{qmps} is a list of the quasi-monic polynomials in \\axiom{lp} and \\axiom{nqmps} are the other ones.")) (|selectAndPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| (|Mapping| (|Boolean|) |#4|)) (|List| |#4|)) "\\axiom{selectAndPolynomials(lpred?,{}ps)} returns \\axiom{gps,{}bps} where \\axiom{gps} is a list of the polynomial \\axiom{\\spad{p}} in \\axiom{ps} such that \\axiom{pred?(\\spad{p})} holds for every \\axiom{pred?} in \\axiom{lpred?} and \\axiom{bps} are the other ones.")) (|selectOrPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| (|Mapping| (|Boolean|) |#4|)) (|List| |#4|)) "\\axiom{selectOrPolynomials(lpred?,{}ps)} returns \\axiom{gps,{}bps} where \\axiom{gps} is a list of the polynomial \\axiom{\\spad{p}} in \\axiom{ps} such that \\axiom{pred?(\\spad{p})} holds for some \\axiom{pred?} in \\axiom{lpred?} and \\axiom{bps} are the other ones.")) (|selectPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|Mapping| (|Boolean|) |#4|) (|List| |#4|)) "\\axiom{selectPolynomials(pred?,{}ps)} returns \\axiom{gps,{}bps} where \\axiom{gps} is a list of the polynomial \\axiom{\\spad{p}} in \\axiom{ps} such that \\axiom{pred?(\\spad{p})} holds and \\axiom{bps} are the other ones.")) (|probablyZeroDim?| (((|Boolean|) (|List| |#4|)) "\\axiom{probablyZeroDim?(lp)} returns \\spad{true} iff the number of polynomials in \\axiom{lp} is not smaller than the number of variables occurring in these polynomials.")) (|possiblyNewVariety?| (((|Boolean|) (|List| |#4|) (|List| (|List| |#4|))) "\\axiom{possiblyNewVariety?(newlp,{}llp)} returns \\spad{true} iff for every \\axiom{lp} in \\axiom{llp} certainlySubVariety?(newlp,{}lp) does not hold.")) (|certainlySubVariety?| (((|Boolean|) (|List| |#4|) (|List| |#4|)) "\\axiom{certainlySubVariety?(newlp,{}lp)} returns \\spad{true} iff for every \\axiom{\\spad{p}} in \\axiom{lp} the remainder of \\axiom{\\spad{p}} by \\axiom{newlp} using the division algorithm of Groebner techniques is zero.")) (|unprotectedRemoveRedundantFactors| (((|List| |#4|) |#4| |#4|) "\\axiom{unprotectedRemoveRedundantFactors(\\spad{p},{}\\spad{q})} returns the same as \\axiom{removeRedundantFactors(\\spad{p},{}\\spad{q})} but does assume that neither \\axiom{\\spad{p}} nor \\axiom{\\spad{q}} lie in the base ring \\axiom{\\spad{R}} and assumes that \\axiom{infRittWu?(\\spad{p},{}\\spad{q})} holds. Moreover,{} if \\axiom{\\spad{R}} is gcd-domain,{} then \\axiom{\\spad{p}} and \\axiom{\\spad{q}} are assumed to be square free.")) (|removeSquaresIfCan| (((|List| |#4|) (|List| |#4|)) "\\axiom{removeSquaresIfCan(lp)} returns \\axiom{removeDuplicates [squareFreePart(\\spad{p})\\$\\spad{P} for \\spad{p} in lp]} if \\axiom{\\spad{R}} is gcd-domain else returns \\axiom{lp}.")) (|removeRedundantFactors| (((|List| |#4|) (|List| |#4|) (|List| |#4|) (|Mapping| (|List| |#4|) (|List| |#4|))) "\\axiom{removeRedundantFactors(lp,{}lq,{}remOp)} returns the same as \\axiom{concat(remOp(removeRoughlyRedundantFactorsInPols(lp,{}lq)),{}lq)} assuming that \\axiom{remOp(lq)} returns \\axiom{lq} up to similarity.") (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRedundantFactors(lp,{}lq)} returns the same as \\axiom{removeRedundantFactors(concat(lp,{}lq))} assuming that \\axiom{removeRedundantFactors(lp)} returns \\axiom{lp} up to replacing some polynomial \\axiom{pj} in \\axiom{lp} by some polynomial \\axiom{qj} associated to \\axiom{pj}.") (((|List| |#4|) (|List| |#4|) |#4|) "\\axiom{removeRedundantFactors(lp,{}\\spad{q})} returns the same as \\axiom{removeRedundantFactors(cons(\\spad{q},{}lp))} assuming that \\axiom{removeRedundantFactors(lp)} returns \\axiom{lp} up to replacing some polynomial \\axiom{pj} in \\axiom{lp} by some some polynomial \\axiom{qj} associated to \\axiom{pj}.") (((|List| |#4|) |#4| |#4|) "\\axiom{removeRedundantFactors(\\spad{p},{}\\spad{q})} returns the same as \\axiom{removeRedundantFactors([\\spad{p},{}\\spad{q}])}") (((|List| |#4|) (|List| |#4|)) "\\axiom{removeRedundantFactors(lp)} returns \\axiom{lq} such that if \\axiom{lp = [\\spad{p1},{}...,{}pn]} and \\axiom{lq = [\\spad{q1},{}...,{}qm]} then the product \\axiom{p1*p2*...*pn} vanishes iff the product \\axiom{q1*q2*...*qm} vanishes,{} and the product of degrees of the \\axiom{\\spad{qi}} is not greater than the one of the \\axiom{pj},{} and no polynomial in \\axiom{lq} divides another polynomial in \\axiom{lq}. In particular,{} polynomials lying in the base ring \\axiom{\\spad{R}} are removed. Moreover,{} \\axiom{lq} is sorted \\spad{w}.\\spad{r}.\\spad{t} \\axiom{infRittWu?}. Furthermore,{} if \\spad{R} is gcd-domain,{} the polynomials in \\axiom{lq} are pairwise without common non trivial factor."))) NIL ((-12 (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-319)))) (|HasCategory| |#1| (QUOTE (-464)))) -(-998 K) +(-997 K) ((|constructor| (NIL "PseudoLinearNormalForm provides a function for computing a block-companion form for pseudo-linear operators.")) (|companionBlocks| (((|List| (|Record| (|:| C (|Matrix| |#1|)) (|:| |g| (|Vector| |#1|)))) (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{companionBlocks(m, v)} returns \\spad{[[C_1, g_1],...,[C_k, g_k]]} such that each \\spad{C_i} is a companion block and \\spad{m = diagonal(C_1,...,C_k)}.")) (|changeBase| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Automorphism| |#1|) (|Mapping| |#1| |#1|)) "\\spad{changeBase(M, A, sig, der)}: computes the new matrix of a pseudo-linear transform given by the matrix \\spad{M} under the change of base A")) (|normalForm| (((|Record| (|:| R (|Matrix| |#1|)) (|:| A (|Matrix| |#1|)) (|:| |Ainv| (|Matrix| |#1|))) (|Matrix| |#1|) (|Automorphism| |#1|) (|Mapping| |#1| |#1|)) "\\spad{normalForm(M, sig, der)} returns \\spad{[R, A, A^{-1}]} such that the pseudo-linear operator whose matrix in the basis \\spad{y} is \\spad{M} had matrix \\spad{R} in the basis \\spad{z = A y}. \\spad{der} is a \\spad{sig}-derivation."))) NIL NIL -(-999 |VarSet| E RC P) +(-998 |VarSet| E RC P) ((|constructor| (NIL "This package computes square-free decomposition of multivariate polynomials over a coefficient ring which is an arbitrary gcd domain. The requirement on the coefficient domain guarantees that the \\spadfun{content} can be removed so that factors will be primitive as well as square-free. Over an infinite ring of finite characteristic,{}it may not be possible to guarantee that the factors are square-free.")) (|squareFree| (((|Factored| |#4|) |#4|) "\\spad{squareFree(p)} returns the square-free factorization of the polynomial \\spad{p}. Each factor has no repeated roots,{} and the factors are pairwise relatively prime."))) NIL NIL -(-1000 R) +(-999 R) ((|constructor| (NIL "PointCategory is the category of points in space which may be plotted via the graphics facilities. Functions are provided for defining points and handling elements of points.")) (|extend| (($ $ (|List| |#1|)) "\\spad{extend(x,l,r)} \\undocumented")) (|cross| (($ $ $) "\\spad{cross(p,q)} computes the cross product of the two points \\spad{p} and \\spad{q}. Error if the \\spad{p} and \\spad{q} are not 3 dimensional")) (|dimension| (((|PositiveInteger|) $) "\\spad{dimension(s)} returns the dimension of the point category \\spad{s}.")) (|point| (($ (|List| |#1|)) "\\spad{point(l)} returns a point category defined by a list \\spad{l} of elements from the domain \\spad{R}."))) -((-4425 . T) (-4424 . T)) +((-4424 . T) (-4423 . T)) NIL -(-1001 R1 R2) +(-1000 R1 R2) ((|constructor| (NIL "This package \\undocumented")) (|map| (((|Point| |#2|) (|Mapping| |#2| |#1|) (|Point| |#1|)) "\\spad{map(f,p)} \\undocumented"))) NIL NIL -(-1002 R) +(-1001 R) ((|constructor| (NIL "This package \\undocumented")) (|shade| ((|#1| (|Point| |#1|)) "\\spad{shade(pt)} returns the fourth element of the two dimensional point,{} \\spad{pt},{} although no assumptions are made with regards as to how the components of higher dimensional points are interpreted. This function is defined for the convenience of the user using specifically,{} shade to express a fourth dimension.")) (|hue| ((|#1| (|Point| |#1|)) "\\spad{hue(pt)} returns the third element of the two dimensional point,{} \\spad{pt},{} although no assumptions are made with regards as to how the components of higher dimensional points are interpreted. This function is defined for the convenience of the user using specifically,{} hue to express a third dimension.")) (|color| ((|#1| (|Point| |#1|)) "\\spad{color(pt)} returns the fourth element of the point,{} \\spad{pt},{} although no assumptions are made with regards as to how the components of higher dimensional points are interpreted. This function is defined for the convenience of the user using specifically,{} color to express a fourth dimension.")) (|phiCoord| ((|#1| (|Point| |#1|)) "\\spad{phiCoord(pt)} returns the third element of the point,{} \\spad{pt},{} although no assumptions are made as to the coordinate system being used. This function is defined for the convenience of the user dealing with a spherical coordinate system.")) (|thetaCoord| ((|#1| (|Point| |#1|)) "\\spad{thetaCoord(pt)} returns the second element of the point,{} \\spad{pt},{} although no assumptions are made as to the coordinate system being used. This function is defined for the convenience of the user dealing with a spherical or a cylindrical coordinate system.")) (|rCoord| ((|#1| (|Point| |#1|)) "\\spad{rCoord(pt)} returns the first element of the point,{} \\spad{pt},{} although no assumptions are made as to the coordinate system being used. This function is defined for the convenience of the user dealing with a spherical or a cylindrical coordinate system.")) (|zCoord| ((|#1| (|Point| |#1|)) "\\spad{zCoord(pt)} returns the third element of the point,{} \\spad{pt},{} although no assumptions are made as to the coordinate system being used. This function is defined for the convenience of the user dealing with a Cartesian or a cylindrical coordinate system.")) (|yCoord| ((|#1| (|Point| |#1|)) "\\spad{yCoord(pt)} returns the second element of the point,{} \\spad{pt},{} although no assumptions are made as to the coordinate system being used. This function is defined for the convenience of the user dealing with a Cartesian coordinate system.")) (|xCoord| ((|#1| (|Point| |#1|)) "\\spad{xCoord(pt)} returns the first element of the point,{} \\spad{pt},{} although no assumptions are made as to the coordinate system being used. This function is defined for the convenience of the user dealing with a Cartesian coordinate system."))) NIL NIL -(-1003 K) +(-1002 K) ((|constructor| (NIL "This is the description of any package which provides partial functions on a domain belonging to TranscendentalFunctionCategory.")) (|acschIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{acschIfCan(z)} returns acsch(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|asechIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{asechIfCan(z)} returns asech(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|acothIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{acothIfCan(z)} returns acoth(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|atanhIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{atanhIfCan(z)} returns atanh(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|acoshIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{acoshIfCan(z)} returns acosh(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|asinhIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{asinhIfCan(z)} returns asinh(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|cschIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{cschIfCan(z)} returns csch(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|sechIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{sechIfCan(z)} returns sech(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|cothIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{cothIfCan(z)} returns coth(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|tanhIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{tanhIfCan(z)} returns tanh(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|coshIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{coshIfCan(z)} returns cosh(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|sinhIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{sinhIfCan(z)} returns sinh(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|acscIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{acscIfCan(z)} returns acsc(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|asecIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{asecIfCan(z)} returns asec(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|acotIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{acotIfCan(z)} returns acot(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|atanIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{atanIfCan(z)} returns atan(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|acosIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{acosIfCan(z)} returns acos(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|asinIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{asinIfCan(z)} returns asin(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|cscIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{cscIfCan(z)} returns csc(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|secIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{secIfCan(z)} returns sec(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|cotIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{cotIfCan(z)} returns cot(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|tanIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{tanIfCan(z)} returns tan(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|cosIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{cosIfCan(z)} returns cos(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|sinIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{sinIfCan(z)} returns sin(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|logIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{logIfCan(z)} returns log(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|expIfCan| (((|Union| |#1| "failed") |#1|) "\\spad{expIfCan(z)} returns exp(\\spad{z}) if possible,{} and \"failed\" otherwise.")) (|nthRootIfCan| (((|Union| |#1| "failed") |#1| (|NonNegativeInteger|)) "\\spad{nthRootIfCan(z,n)} returns the \\spad{n}th root of \\spad{z} if possible,{} and \"failed\" otherwise."))) NIL NIL -(-1004 R E OV PPR) +(-1003 R E OV PPR) ((|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 -(-1005 K R UP -3494) +(-1004 K R UP -3493) ((|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 -(-1006 R |Var| |Expon| |Dpoly|) +(-1005 R |Var| |Expon| |Dpoly|) ((|constructor| (NIL "\\spadtype{QuasiAlgebraicSet} constructs a domain representing quasi-algebraic sets,{} which is the intersection of a Zariski closed set,{} defined as the common zeros of a given list of polynomials (the defining polynomials for equations),{} and a principal Zariski open set,{} defined as the complement of the common zeros of a polynomial \\spad{f} (the defining polynomial for the inequation). This domain provides simplification of a user-given representation using groebner basis computations. There are two simplification routines: the first function \\spadfun{idealSimplify} uses groebner basis of ideals alone,{} while the second,{} \\spadfun{simplify} uses both groebner basis and factorization. The resulting defining equations \\spad{L} always form a groebner basis,{} and the resulting defining inequation \\spad{f} is always reduced. The function \\spadfun{simplify} may be applied several times if desired. A third simplification routine \\spadfun{radicalSimplify} is provided in \\spadtype{QuasiAlgebraicSet2} for comparison study only,{} as it is inefficient compared to the other two,{} as well as is restricted to only certain coefficient domains. For detail analysis and a comparison of the three methods,{} please consult the reference cited. \\blankline A polynomial function \\spad{q} defined on the quasi-algebraic set is equivalent to its reduced form with respect to \\spad{L}. While this may be obtained using the usual normal form algorithm,{} there is no canonical form for \\spad{q}. \\blankline The ordering in groebner basis computation is determined by the data type of the input polynomials. If it is possible we suggest to use refinements of total degree orderings.")) (|simplify| (($ $) "\\spad{simplify(s)} returns a different and presumably simpler representation of \\spad{s} with the defining polynomials for the equations forming a groebner basis,{} and the defining polynomial for the inequation reduced with respect to the basis,{} using a heuristic algorithm based on factoring.")) (|idealSimplify| (($ $) "\\spad{idealSimplify(s)} returns a different and presumably simpler representation of \\spad{s} with the defining polynomials for the equations forming a groebner basis,{} and the defining polynomial for the inequation reduced with respect to the basis,{} using Buchberger's algorithm.")) (|definingInequation| ((|#4| $) "\\spad{definingInequation(s)} returns a single defining polynomial for the inequation,{} that is,{} the Zariski open part of \\spad{s}.")) (|definingEquations| (((|List| |#4|) $) "\\spad{definingEquations(s)} returns a list of defining polynomials for equations,{} that is,{} for the Zariski closed part of \\spad{s}.")) (|empty?| (((|Boolean|) $) "\\spad{empty?(s)} returns \\spad{true} if the quasialgebraic set \\spad{s} has no points,{} and \\spad{false} otherwise.")) (|setStatus| (($ $ (|Union| (|Boolean|) #1="failed")) "\\spad{setStatus(s,t)} returns the same representation for \\spad{s},{} but asserts the following: if \\spad{t} is \\spad{true},{} then \\spad{s} is empty,{} if \\spad{t} is \\spad{false},{} then \\spad{s} is non-empty,{} and if \\spad{t} = \"failed\",{} then no assertion is made (that is,{} \"don't know\"). Note: for internal use only,{} with care.")) (|status| (((|Union| (|Boolean|) #1#) $) "\\spad{status(s)} returns \\spad{true} if the quasi-algebraic set is empty,{} \\spad{false} if it is not,{} and \"failed\" if not yet known")) (|quasiAlgebraicSet| (($ (|List| |#4|) |#4|) "\\spad{quasiAlgebraicSet(pl,q)} returns the quasi-algebraic set with defining equations \\spad{p} = 0 for \\spad{p} belonging to the list \\spad{pl},{} and defining inequation \\spad{q} ~= 0.")) (|empty| (($) "\\spad{empty()} returns the empty quasi-algebraic set"))) NIL ((-12 (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-319))))) -(-1007 |vl| |nv|) +(-1006 |vl| |nv|) ((|constructor| (NIL "\\spadtype{QuasiAlgebraicSet2} adds a function \\spadfun{radicalSimplify} which uses \\spadtype{IdealDecompositionPackage} to simplify the representation of a quasi-algebraic set. A quasi-algebraic set is the intersection of a Zariski closed set,{} defined as the common zeros of a given list of polynomials (the defining polynomials for equations),{} and a principal Zariski open set,{} defined as the complement of the common zeros of a polynomial \\spad{f} (the defining polynomial for the inequation). Quasi-algebraic sets are implemented in the domain \\spadtype{QuasiAlgebraicSet},{} where two simplification routines are provided: \\spadfun{idealSimplify} and \\spadfun{simplify}. The function \\spadfun{radicalSimplify} is added for comparison study only. Because the domain \\spadtype{IdealDecompositionPackage} provides facilities for computing with radical ideals,{} it is necessary to restrict the ground ring to the domain \\spadtype{Fraction Integer},{} and the polynomial ring to be of type \\spadtype{DistributedMultivariatePolynomial}. The routine \\spadfun{radicalSimplify} uses these to compute groebner basis of radical ideals and is inefficient and restricted when compared to the two in \\spadtype{QuasiAlgebraicSet}.")) (|radicalSimplify| (((|QuasiAlgebraicSet| (|Fraction| (|Integer|)) (|OrderedVariableList| |#1|) (|DirectProduct| |#2| (|NonNegativeInteger|)) (|DistributedMultivariatePolynomial| |#1| (|Fraction| (|Integer|)))) (|QuasiAlgebraicSet| (|Fraction| (|Integer|)) (|OrderedVariableList| |#1|) (|DirectProduct| |#2| (|NonNegativeInteger|)) (|DistributedMultivariatePolynomial| |#1| (|Fraction| (|Integer|))))) "\\spad{radicalSimplify(s)} returns a different and presumably simpler representation of \\spad{s} with the defining polynomials for the equations forming a groebner basis,{} and the defining polynomial for the inequation reduced with respect to the basis,{} using using groebner basis of radical ideals"))) NIL NIL -(-1008 R E V P TS) +(-1007 R E V P TS) ((|constructor| (NIL "A package for removing redundant quasi-components and redundant branches when decomposing a variety by means of quasi-components of regular 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} \\indented{1}{[2] \\spad{M}. MORENO MAZA \"Calculs de pgcd au-dessus des tours} \\indented{5}{d'extensions simples et resolution des systemes d'equations} \\indented{5}{algebriques\" These,{} Universite \\spad{P}.etM. Curie,{} Paris,{} 1997.} \\indented{1}{[3] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}")) (|branchIfCan| (((|Union| (|Record| (|:| |eq| (|List| |#4|)) (|:| |tower| |#5|) (|:| |ineq| (|List| |#4|))) "failed") (|List| |#4|) |#5| (|List| |#4|) (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\axiom{branchIfCan(leq,{}ts,{}lineq,{}\\spad{b1},{}\\spad{b2},{}\\spad{b3},{}\\spad{b4},{}\\spad{b5})} is an internal subroutine,{} exported only for developement.")) (|prepareDecompose| (((|List| (|Record| (|:| |eq| (|List| |#4|)) (|:| |tower| |#5|) (|:| |ineq| (|List| |#4|)))) (|List| |#4|) (|List| |#5|) (|Boolean|) (|Boolean|)) "\\axiom{prepareDecompose(lp,{}lts,{}\\spad{b1},{}\\spad{b2})} is an internal subroutine,{} exported only for developement.")) (|removeSuperfluousCases| (((|List| (|Record| (|:| |val| (|List| |#4|)) (|:| |tower| |#5|))) (|List| (|Record| (|:| |val| (|List| |#4|)) (|:| |tower| |#5|)))) "\\axiom{removeSuperfluousCases(llpwt)} is an internal subroutine,{} exported only for developement.")) (|subCase?| (((|Boolean|) (|Record| (|:| |val| (|List| |#4|)) (|:| |tower| |#5|)) (|Record| (|:| |val| (|List| |#4|)) (|:| |tower| |#5|))) "\\axiom{subCase?(\\spad{lpwt1},{}\\spad{lpwt2})} is an internal subroutine,{} exported only for developement.")) (|removeSuperfluousQuasiComponents| (((|List| |#5|) (|List| |#5|)) "\\axiom{removeSuperfluousQuasiComponents(lts)} removes from \\axiom{lts} any \\spad{ts} such that \\axiom{subQuasiComponent?(ts,{}us)} holds for another \\spad{us} in \\axiom{lts}.")) (|subQuasiComponent?| (((|Boolean|) |#5| (|List| |#5|)) "\\axiom{subQuasiComponent?(ts,{}lus)} returns \\spad{true} iff \\axiom{subQuasiComponent?(ts,{}us)} holds for one \\spad{us} in \\spad{lus}.") (((|Boolean|) |#5| |#5|) "\\axiom{subQuasiComponent?(ts,{}us)} returns \\spad{true} iff \\axiomOpFrom{internalSubQuasiComponent?}{QuasiComponentPackage} returs \\spad{true}.")) (|internalSubQuasiComponent?| (((|Union| (|Boolean|) "failed") |#5| |#5|) "\\axiom{internalSubQuasiComponent?(ts,{}us)} returns a boolean \\spad{b} value if the fact that the regular zero set of \\axiom{us} contains that of \\axiom{ts} can be decided (and in that case \\axiom{\\spad{b}} gives this inclusion) otherwise returns \\axiom{\"failed\"}.")) (|infRittWu?| (((|Boolean|) (|List| |#4|) (|List| |#4|)) "\\axiom{infRittWu?(\\spad{lp1},{}\\spad{lp2})} is an internal subroutine,{} exported only for developement.")) (|internalInfRittWu?| (((|Boolean|) (|List| |#4|) (|List| |#4|)) "\\axiom{internalInfRittWu?(\\spad{lp1},{}\\spad{lp2})} is an internal subroutine,{} exported only for developement.")) (|internalSubPolSet?| (((|Boolean|) (|List| |#4|) (|List| |#4|)) "\\axiom{internalSubPolSet?(\\spad{lp1},{}\\spad{lp2})} returns \\spad{true} iff \\axiom{\\spad{lp1}} is a sub-set of \\axiom{\\spad{lp2}} assuming that these lists are sorted increasingly \\spad{w}.\\spad{r}.\\spad{t}. \\axiomOpFrom{infRittWu?}{RecursivePolynomialCategory}.")) (|subPolSet?| (((|Boolean|) (|List| |#4|) (|List| |#4|)) "\\axiom{subPolSet?(\\spad{lp1},{}\\spad{lp2})} returns \\spad{true} iff \\axiom{\\spad{lp1}} is a sub-set of \\axiom{\\spad{lp2}}.")) (|subTriSet?| (((|Boolean|) |#5| |#5|) "\\axiom{subTriSet?(ts,{}us)} returns \\spad{true} iff \\axiom{ts} is a sub-set of \\axiom{us}.")) (|moreAlgebraic?| (((|Boolean|) |#5| |#5|) "\\axiom{moreAlgebraic?(ts,{}us)} returns \\spad{false} iff \\axiom{ts} and \\axiom{us} are both empty,{} or \\axiom{ts} has less elements than \\axiom{us},{} or some variable is algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{us} and is not \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{ts}.")) (|algebraicSort| (((|List| |#5|) (|List| |#5|)) "\\axiom{algebraicSort(lts)} sorts \\axiom{lts} \\spad{w}.\\spad{r}.\\spad{t} \\axiomOpFrom{supDimElseRittWu?}{QuasiComponentPackage}.")) (|supDimElseRittWu?| (((|Boolean|) |#5| |#5|) "\\axiom{supDimElseRittWu(ts,{}us)} returns \\spad{true} iff \\axiom{ts} has less elements than \\axiom{us} otherwise if \\axiom{ts} has higher rank than \\axiom{us} \\spad{w}.\\spad{r}.\\spad{t}. Riit and Wu ordering.")) (|stopTable!| (((|Void|)) "\\axiom{stopTableGcd!()} is an internal subroutine,{} exported only for developement.")) (|startTable!| (((|Void|) (|String|) (|String|) (|String|)) "\\axiom{startTableGcd!(\\spad{s1},{}\\spad{s2},{}\\spad{s3})} is an internal subroutine,{} exported only for developement."))) NIL NIL -(-1009) +(-1008) ((|constructor| (NIL "This domain implements simple database queries")) (|value| (((|String|) $) "\\spad{value(q)} returns the value (\\spadignore{i.e.} right hand side) of \\axiom{\\spad{q}}.")) (|variable| (((|Symbol|) $) "\\spad{variable(q)} returns the variable (\\spadignore{i.e.} left hand side) of \\axiom{\\spad{q}}.")) (|equation| (($ (|Symbol|) (|String|)) "\\spad{equation(s,\"a\")} creates a new equation."))) NIL NIL -(-1010 A S) +(-1009 A S) ((|constructor| (NIL "QuotientField(\\spad{S}) is the category of fractions of an Integral Domain \\spad{S}.")) (|floor| ((|#2| $) "\\spad{floor(x)} returns the largest integral element below \\spad{x}.")) (|ceiling| ((|#2| $) "\\spad{ceiling(x)} returns the smallest integral element above \\spad{x}.")) (|random| (($) "\\spad{random()} returns a random fraction.")) (|fractionPart| (($ $) "\\spad{fractionPart(x)} returns the fractional part of \\spad{x}. \\spad{x} = wholePart(\\spad{x}) + fractionPart(\\spad{x})")) (|wholePart| ((|#2| $) "\\spad{wholePart(x)} returns the whole part of the fraction \\spad{x} \\spadignore{i.e.} the truncated quotient of the numerator by the denominator.")) (|denominator| (($ $) "\\spad{denominator(x)} is the denominator of the fraction \\spad{x} converted to \\%.")) (|numerator| (($ $) "\\spad{numerator(x)} is the numerator of the fraction \\spad{x} converted to \\%.")) (|denom| ((|#2| $) "\\spad{denom(x)} returns the denominator of the fraction \\spad{x}.")) (|numer| ((|#2| $) "\\spad{numer(x)} returns the numerator of the fraction \\spad{x}.")) (/ (($ |#2| |#2|) "\\spad{d1 / d2} returns the fraction \\spad{d1} divided by \\spad{d2}."))) NIL -((|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| |#2| (QUOTE (-557))) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-1197)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#2| (QUOTE (-1040))) (|HasCategory| |#2| (QUOTE (-841))) (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-1172)))) -(-1011 S) +((|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| |#2| (QUOTE (-556))) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-1196)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#2| (QUOTE (-1039))) (|HasCategory| |#2| (QUOTE (-840))) (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#2| (QUOTE (-1171)))) +(-1010 S) ((|constructor| (NIL "QuotientField(\\spad{S}) is the category of fractions of an Integral Domain \\spad{S}.")) (|floor| ((|#1| $) "\\spad{floor(x)} returns the largest integral element below \\spad{x}.")) (|ceiling| ((|#1| $) "\\spad{ceiling(x)} returns the smallest integral element above \\spad{x}.")) (|random| (($) "\\spad{random()} returns a random fraction.")) (|fractionPart| (($ $) "\\spad{fractionPart(x)} returns the fractional part of \\spad{x}. \\spad{x} = wholePart(\\spad{x}) + fractionPart(\\spad{x})")) (|wholePart| ((|#1| $) "\\spad{wholePart(x)} returns the whole part of the fraction \\spad{x} \\spadignore{i.e.} the truncated quotient of the numerator by the denominator.")) (|denominator| (($ $) "\\spad{denominator(x)} is the denominator of the fraction \\spad{x} converted to \\%.")) (|numerator| (($ $) "\\spad{numerator(x)} is the numerator of the fraction \\spad{x} converted to \\%.")) (|denom| ((|#1| $) "\\spad{denom(x)} returns the denominator of the fraction \\spad{x}.")) (|numer| ((|#1| $) "\\spad{numer(x)} returns the numerator of the fraction \\spad{x}.")) (/ (($ |#1| |#1|) "\\spad{d1 / d2} returns the fraction \\spad{d1} divided by \\spad{d2}."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1012 A B R S) +(-1011 A B R S) ((|constructor| (NIL "This package extends a function between integral domains to a mapping between their quotient fields.")) (|map| ((|#4| (|Mapping| |#2| |#1|) |#3|) "\\spad{map(func,frac)} applies the function \\spad{func} to the numerator and denominator of \\spad{frac}."))) NIL NIL -(-1013 |n| K) +(-1012 |n| K) ((|constructor| (NIL "This domain provides modest support for quadratic forms.")) (|matrix| (((|SquareMatrix| |#1| |#2|) $) "\\spad{matrix(qf)} creates a square matrix from the quadratic form \\spad{qf}.")) (|quadraticForm| (($ (|SquareMatrix| |#1| |#2|)) "\\spad{quadraticForm(m)} creates a quadratic form from a symmetric,{} square matrix \\spad{m}."))) NIL NIL -(-1014) +(-1013) ((|constructor| (NIL "This domain represents the syntax of a quasiquote \\indented{2}{expression.}")) (|expression| (((|SpadAst|) $) "\\spad{expression(e)} returns the syntax for the expression being quoted."))) NIL NIL -(-1015 S) +(-1014 S) ((|constructor| (NIL "A queue is a bag where the first item inserted is the first item extracted.")) (|back| ((|#1| $) "\\spad{back(q)} returns the element at the back of the queue. The queue \\spad{q} is unchanged by this operation. Error: if \\spad{q} is empty.")) (|front| ((|#1| $) "\\spad{front(q)} returns the element at the front of the queue. The queue \\spad{q} is unchanged by this operation. Error: if \\spad{q} is empty.")) (|length| (((|NonNegativeInteger|) $) "\\spad{length(q)} returns the number of elements in the queue. Note: \\axiom{length(\\spad{q}) = \\#q}.")) (|rotate!| (($ $) "\\spad{rotate! q} rotates queue \\spad{q} so that the element at the front of the queue goes to the back of the queue. Note: rotate! \\spad{q} is equivalent to enqueue!(dequeue!(\\spad{q})).")) (|dequeue!| ((|#1| $) "\\spad{dequeue! s} destructively extracts the first (top) element from queue \\spad{q}. The element previously second in the queue becomes the first element. Error: if \\spad{q} is empty.")) (|enqueue!| ((|#1| |#1| $) "\\spad{enqueue!(x,q)} inserts \\spad{x} into the queue \\spad{q} at the back end."))) -((-4424 . T) (-4425 . T)) +((-4423 . T) (-4424 . T)) NIL -(-1016 R) +(-1015 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.}"))) -((-4417 |has| |#1| (-302)) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#1| (QUOTE (-376))) (-3956 (|HasCategory| |#1| (QUOTE (-302))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-302))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#1| (|%list| (QUOTE -526) (QUOTE (-1197)) (|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 -918) (QUOTE (-1197)))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-1080))) (|HasCategory| |#1| (QUOTE (-557)))) -(-1017 S R) +((-4416 |has| |#1| (-302)) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#1| (QUOTE (-376))) (-3955 (|HasCategory| |#1| (QUOTE (-302))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-302))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#1| (|%list| (QUOTE -526) (QUOTE (-1196)) (|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 -917) (QUOTE (-1196)))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-556)))) +(-1016 S R) ((|constructor| (NIL "\\spadtype{QuaternionCategory} describes the category of quaternions and implements functions that are not representation specific.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(q)} returns \\spad{q} as a rational number,{} or \"failed\" if this is not possible. Note: if \\spad{rational?(q)} is \\spad{true},{} the conversion can be done and the rational number will be returned.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(q)} tries to convert \\spad{q} into a rational number. Error: if this is not possible. If \\spad{rational?(q)} is \\spad{true},{} the conversion will be done and the rational number returned.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(q)} returns {\\it \\spad{true}} if all the imaginary parts of \\spad{q} are zero and the real part can be converted into a rational number,{} and {\\it \\spad{false}} otherwise.")) (|abs| ((|#2| $) "\\spad{abs(q)} computes the absolute value of quaternion \\spad{q} (sqrt of norm).")) (|real| ((|#2| $) "\\spad{real(q)} extracts the real part of quaternion \\spad{q}.")) (|quatern| (($ |#2| |#2| |#2| |#2|) "\\spad{quatern(r,i,j,k)} constructs a quaternion from scalars.")) (|norm| ((|#2| $) "\\spad{norm(q)} computes the norm of \\spad{q} (the sum of the squares of the components).")) (|imagK| ((|#2| $) "\\spad{imagK(q)} extracts the imaginary \\spad{k} part of quaternion \\spad{q}.")) (|imagJ| ((|#2| $) "\\spad{imagJ(q)} extracts the imaginary \\spad{j} part of quaternion \\spad{q}.")) (|imagI| ((|#2| $) "\\spad{imagI(q)} extracts the imaginary \\spad{i} part of quaternion \\spad{q}.")) (|conjugate| (($ $) "\\spad{conjugate(q)} negates the imaginary parts of quaternion \\spad{q}."))) NIL -((|HasCategory| |#2| (QUOTE (-557))) (|HasCategory| |#2| (QUOTE (-1080))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-302)))) -(-1018 R) +((|HasCategory| |#2| (QUOTE (-556))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-302)))) +(-1017 R) ((|constructor| (NIL "\\spadtype{QuaternionCategory} describes the category of quaternions and implements functions that are not representation specific.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(q)} returns \\spad{q} as a rational number,{} or \"failed\" if this is not possible. Note: if \\spad{rational?(q)} is \\spad{true},{} the conversion can be done and the rational number will be returned.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(q)} tries to convert \\spad{q} into a rational number. Error: if this is not possible. If \\spad{rational?(q)} is \\spad{true},{} the conversion will be done and the rational number returned.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(q)} returns {\\it \\spad{true}} if all the imaginary parts of \\spad{q} are zero and the real part can be converted into a rational number,{} and {\\it \\spad{false}} otherwise.")) (|abs| ((|#1| $) "\\spad{abs(q)} computes the absolute value of quaternion \\spad{q} (sqrt of norm).")) (|real| ((|#1| $) "\\spad{real(q)} extracts the real part of quaternion \\spad{q}.")) (|quatern| (($ |#1| |#1| |#1| |#1|) "\\spad{quatern(r,i,j,k)} constructs a quaternion from scalars.")) (|norm| ((|#1| $) "\\spad{norm(q)} computes the norm of \\spad{q} (the sum of the squares of the components).")) (|imagK| ((|#1| $) "\\spad{imagK(q)} extracts the imaginary \\spad{k} part of quaternion \\spad{q}.")) (|imagJ| ((|#1| $) "\\spad{imagJ(q)} extracts the imaginary \\spad{j} part of quaternion \\spad{q}.")) (|imagI| ((|#1| $) "\\spad{imagI(q)} extracts the imaginary \\spad{i} part of quaternion \\spad{q}.")) (|conjugate| (($ $) "\\spad{conjugate(q)} negates the imaginary parts of quaternion \\spad{q}."))) -((-4417 |has| |#1| (-302)) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 |has| |#1| (-302)) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1019 QR R QS S) +(-1018 QR R QS S) ((|constructor| (NIL "\\spadtype{QuaternionCategoryFunctions2} implements functions between two quaternion domains. The function \\spadfun{map} is used by the system interpreter to coerce between quaternion types.")) (|map| ((|#3| (|Mapping| |#4| |#2|) |#1|) "\\spad{map(f,u)} maps \\spad{f} onto the component parts of the quaternion \\spad{u}."))) NIL NIL -(-1020 S) +(-1019 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}."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) -(-1021 S) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102)))) +(-1020 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 NIL -(-1022) +(-1021) ((|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 -(-1023 -3494 UP UPUP |radicnd| |n|) +(-1022 -3493 UP UPUP |radicnd| |n|) ((|constructor| (NIL "Function field defined by y**n = \\spad{f}(\\spad{x})."))) -((-4417 |has| (-419 |#2|) (-376)) (-4422 |has| (-419 |#2|) (-376)) (-4416 |has| (-419 |#2|) (-376)) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| (-419 |#2|) (QUOTE (-147))) (|HasCategory| (-419 |#2|) (QUOTE (-149))) (|HasCategory| (-419 |#2|) (QUOTE (-363))) (-3956 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (QUOTE (-363)))) (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (QUOTE (-381))) (-3956 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-240))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (|HasCategory| (-419 |#2|) (QUOTE (-363)))) (-3956 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-240))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-239))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (|HasCategory| (-419 |#2|) (QUOTE (-363)))) (-3956 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-363))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -916) (QUOTE (-1197)))))) (-3956 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -918) (QUOTE (-1197)))))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -657) (QUOTE (-558)))) (-3956 (|HasCategory| (-419 |#2|) (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-239))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -918) (QUOTE (-1197))))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-240))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -916) (QUOTE (-1197)))))) -(-1024 |bb|) +((-4416 |has| (-419 |#2|) (-376)) (-4421 |has| (-419 |#2|) (-376)) (-4415 |has| (-419 |#2|) (-376)) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| (-419 |#2|) (QUOTE (-147))) (|HasCategory| (-419 |#2|) (QUOTE (-149))) (|HasCategory| (-419 |#2|) (QUOTE (-363))) (-3955 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (QUOTE (-363)))) (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (QUOTE (-381))) (-3955 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-240))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (|HasCategory| (-419 |#2|) (QUOTE (-363)))) (-3955 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-240))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-239))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (|HasCategory| (-419 |#2|) (QUOTE (-363)))) (-3955 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-363))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -915) (QUOTE (-1196)))))) (-3955 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -917) (QUOTE (-1196)))))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -656) (QUOTE (-557)))) (-3955 (|HasCategory| (-419 |#2|) (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-239))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -917) (QUOTE (-1196))))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-240))) (|HasCategory| (-419 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-376))) (|HasCategory| (-419 |#2|) (|%list| (QUOTE -915) (QUOTE (-1196)))))) +(-1023 |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."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| (-558) (QUOTE (-928))) (|HasCategory| (-558) (|%list| (QUOTE -1058) (QUOTE (-1197)))) (|HasCategory| (-558) (QUOTE (-147))) (|HasCategory| (-558) (QUOTE (-149))) (|HasCategory| (-558) (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-558) (QUOTE (-1040))) (|HasCategory| (-558) (QUOTE (-841))) (|HasCategory| (-558) (QUOTE (-860))) (-3956 (|HasCategory| (-558) (QUOTE (-841))) (|HasCategory| (-558) (QUOTE (-860)))) (|HasCategory| (-558) (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| (-558) (QUOTE (-1172))) (|HasCategory| (-558) (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-558) (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-558) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-558) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-558) (QUOTE (-239))) (|HasCategory| (-558) (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| (-558) (QUOTE (-240))) (|HasCategory| (-558) (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| (-558) (|%list| (QUOTE -526) (QUOTE (-1197)) (QUOTE (-558)))) (|HasCategory| (-558) (|%list| (QUOTE -321) (QUOTE (-558)))) (|HasCategory| (-558) (|%list| (QUOTE -298) (QUOTE (-558)) (QUOTE (-558)))) (|HasCategory| (-558) (QUOTE (-319))) (|HasCategory| (-558) (QUOTE (-557))) (|HasCategory| (-558) (|%list| (QUOTE -657) (QUOTE (-558)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-558) (QUOTE (-928)))) (-3956 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-558) (QUOTE (-928)))) (|HasCategory| (-558) (QUOTE (-147))))) -(-1025) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| (-557) (QUOTE (-927))) (|HasCategory| (-557) (|%list| (QUOTE -1057) (QUOTE (-1196)))) (|HasCategory| (-557) (QUOTE (-147))) (|HasCategory| (-557) (QUOTE (-149))) (|HasCategory| (-557) (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-557) (QUOTE (-1039))) (|HasCategory| (-557) (QUOTE (-840))) (|HasCategory| (-557) (QUOTE (-859))) (-3955 (|HasCategory| (-557) (QUOTE (-840))) (|HasCategory| (-557) (QUOTE (-859)))) (|HasCategory| (-557) (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| (-557) (QUOTE (-1171))) (|HasCategory| (-557) (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-557) (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-557) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-557) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-557) (QUOTE (-239))) (|HasCategory| (-557) (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| (-557) (QUOTE (-240))) (|HasCategory| (-557) (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| (-557) (|%list| (QUOTE -526) (QUOTE (-1196)) (QUOTE (-557)))) (|HasCategory| (-557) (|%list| (QUOTE -321) (QUOTE (-557)))) (|HasCategory| (-557) (|%list| (QUOTE -298) (QUOTE (-557)) (QUOTE (-557)))) (|HasCategory| (-557) (QUOTE (-319))) (|HasCategory| (-557) (QUOTE (-556))) (|HasCategory| (-557) (|%list| (QUOTE -656) (QUOTE (-557)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-557) (QUOTE (-927)))) (-3955 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-557) (QUOTE (-927)))) (|HasCategory| (-557) (QUOTE (-147))))) +(-1024) ((|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 NIL -(-1026) +(-1025) ((|constructor| (NIL "Random number generators \\indented{2}{All random numbers used in the system should originate from} \\indented{2}{the same generator.\\space{2}This package is intended to be the source.}")) (|seed| (((|Integer|)) "\\spad{seed()} returns the current seed value.")) (|reseed| (((|Void|) (|Integer|)) "\\spad{reseed(n)} restarts the random number generator at \\spad{n}.")) (|size| (((|Integer|)) "\\spad{size()} is the base of the random number generator")) (|randnum| (((|Integer|) (|Integer|)) "\\spad{randnum(n)} is a random number between 0 and \\spad{n}.") (((|Integer|)) "\\spad{randnum()} is a random number between 0 and size()."))) NIL NIL -(-1027 RP) +(-1026 RP) ((|factorSquareFree| (((|Factored| |#1|) |#1|) "\\spad{factorSquareFree(p)} factors an extended squareFree polynomial \\spad{p} over the rational numbers.")) (|factor| (((|Factored| |#1|) |#1|) "\\spad{factor(p)} factors an extended polynomial \\spad{p} over the rational numbers."))) NIL NIL -(-1028 S) +(-1027 S) ((|constructor| (NIL "rational number testing and retraction functions. Date Created: March 1990 Date Last Updated: 9 April 1991")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") |#1|) "\\spad{rationalIfCan(x)} returns \\spad{x} as a rational number,{} \"failed\" if \\spad{x} is not a rational number.")) (|rational?| (((|Boolean|) |#1|) "\\spad{rational?(x)} returns \\spad{true} if \\spad{x} is a rational number,{} \\spad{false} otherwise.")) (|rational| (((|Fraction| (|Integer|)) |#1|) "\\spad{rational(x)} returns \\spad{x} as a rational number; error if \\spad{x} is not a rational number."))) NIL NIL -(-1029 A S) +(-1028 A S) ((|constructor| (NIL "A recursive aggregate over a type \\spad{S} is a model for a a directed graph containing values of type \\spad{S}. Recursively,{} a recursive aggregate is a {\\em node} consisting of a \\spadfun{value} from \\spad{S} and 0 or more \\spadfun{children} which are recursive aggregates. A node with no children is called a \\spadfun{leaf} node. A recursive aggregate may be cyclic for which some operations as noted may go into an infinite loop.")) (|setvalue!| ((|#2| $ |#2|) "\\spad{setvalue!(u,x)} sets the value of node \\spad{u} to \\spad{x}.")) (|setelt| ((|#2| $ "value" |#2|) "\\spad{setelt(a,\"value\",x)} (also written \\axiom{a . value := \\spad{x}}) is equivalent to \\axiom{setvalue!(a,{}\\spad{x})}")) (|setchildren!| (($ $ (|List| $)) "\\spad{setchildren!(u,v)} replaces the current children of node \\spad{u} with the members of \\spad{v} in left-to-right order.")) (|node?| (((|Boolean|) $ $) "\\spad{node?(u,v)} tests if node \\spad{u} is contained in node \\spad{v} (either as a child,{} a child of a child,{} etc.).")) (|child?| (((|Boolean|) $ $) "\\spad{child?(u,v)} tests if node \\spad{u} is a child of node \\spad{v}.")) (|distance| (((|Integer|) $ $) "\\spad{distance(u,v)} returns the path length (an integer) from node \\spad{u} to \\spad{v}.")) (|leaves| (((|List| |#2|) $) "\\spad{leaves(t)} returns the list of values in obtained by visiting the nodes of tree \\axiom{\\spad{t}} in left-to-right order.")) (|cyclic?| (((|Boolean|) $) "\\spad{cyclic?(u)} tests if \\spad{u} has a cycle.")) (|elt| ((|#2| $ "value") "\\spad{elt(u,\"value\")} (also written: \\axiom{a. value}) is equivalent to \\axiom{value(a)}.")) (|value| ((|#2| $) "\\spad{value(u)} returns the value of the node \\spad{u}.")) (|leaf?| (((|Boolean|) $) "\\spad{leaf?(u)} tests if \\spad{u} is a terminal node.")) (|nodes| (((|List| $) $) "\\spad{nodes(u)} returns a list of all of the nodes of aggregate \\spad{u}.")) (|children| (((|List| $) $) "\\spad{children(u)} returns a list of the children of aggregate \\spad{u}."))) NIL -((|HasAttribute| |#1| (QUOTE -4425)) (|HasCategory| |#2| (QUOTE (-1121)))) -(-1030 S) +((|HasAttribute| |#1| (QUOTE -4424)) (|HasCategory| |#2| (QUOTE (-1120)))) +(-1029 S) ((|constructor| (NIL "A recursive aggregate over a type \\spad{S} is a model for a a directed graph containing values of type \\spad{S}. Recursively,{} a recursive aggregate is a {\\em node} consisting of a \\spadfun{value} from \\spad{S} and 0 or more \\spadfun{children} which are recursive aggregates. A node with no children is called a \\spadfun{leaf} node. A recursive aggregate may be cyclic for which some operations as noted may go into an infinite loop.")) (|setvalue!| ((|#1| $ |#1|) "\\spad{setvalue!(u,x)} sets the value of node \\spad{u} to \\spad{x}.")) (|setelt| ((|#1| $ "value" |#1|) "\\spad{setelt(a,\"value\",x)} (also written \\axiom{a . value := \\spad{x}}) is equivalent to \\axiom{setvalue!(a,{}\\spad{x})}")) (|setchildren!| (($ $ (|List| $)) "\\spad{setchildren!(u,v)} replaces the current children of node \\spad{u} with the members of \\spad{v} in left-to-right order.")) (|node?| (((|Boolean|) $ $) "\\spad{node?(u,v)} tests if node \\spad{u} is contained in node \\spad{v} (either as a child,{} a child of a child,{} etc.).")) (|child?| (((|Boolean|) $ $) "\\spad{child?(u,v)} tests if node \\spad{u} is a child of node \\spad{v}.")) (|distance| (((|Integer|) $ $) "\\spad{distance(u,v)} returns the path length (an integer) from node \\spad{u} to \\spad{v}.")) (|leaves| (((|List| |#1|) $) "\\spad{leaves(t)} returns the list of values in obtained by visiting the nodes of tree \\axiom{\\spad{t}} in left-to-right order.")) (|cyclic?| (((|Boolean|) $) "\\spad{cyclic?(u)} tests if \\spad{u} has a cycle.")) (|elt| ((|#1| $ "value") "\\spad{elt(u,\"value\")} (also written: \\axiom{a. value}) is equivalent to \\axiom{value(a)}.")) (|value| ((|#1| $) "\\spad{value(u)} returns the value of the node \\spad{u}.")) (|leaf?| (((|Boolean|) $) "\\spad{leaf?(u)} tests if \\spad{u} is a terminal node.")) (|nodes| (((|List| $) $) "\\spad{nodes(u)} returns a list of all of the nodes of aggregate \\spad{u}.")) (|children| (((|List| $) $) "\\spad{children(u)} returns a list of the children of aggregate \\spad{u}."))) NIL NIL -(-1031 S) +(-1030 S) ((|constructor| (NIL "\\axiomType{RealClosedField} provides common acces functions for all real closed fields.")) (|approximate| (((|Fraction| (|Integer|)) $ $) "\\axiom{approximate(\\spad{n},{}\\spad{p})} gives an approximation of \\axiom{\\spad{n}} that has precision \\axiom{\\spad{p}}")) (|rename| (($ $ (|OutputForm|)) "\\axiom{rename(\\spad{x},{}name)} gives a new number that prints as name")) (|rename!| (($ $ (|OutputForm|)) "\\axiom{rename!(\\spad{x},{}name)} changes the way \\axiom{\\spad{x}} is printed")) (|sqrt| (($ (|Integer|)) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} ** (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}}"))) NIL NIL -(-1032) +(-1031) ((|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}}"))) -((-4417 . T) (-4422 . T) (-4416 . T) (-4419 . T) (-4418 . T) ((-4426 "*") . T) (-4421 . T)) +((-4416 . T) (-4421 . T) (-4415 . T) (-4418 . T) (-4417 . T) ((-4425 "*") . T) (-4420 . T)) NIL -(-1033 R -3494) +(-1032 R -3493) ((|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 -(-1034 R -3494) +(-1033 R -3493) ((|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 -(-1035 -3494 UP) +(-1034 -3493 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 -(-1036 -3494 UP) +(-1035 -3493 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 -(-1037 S) +(-1036 S) ((|constructor| (NIL "This package exports random distributions")) (|rdHack1| (((|Mapping| |#1|) (|Vector| |#1|) (|Vector| (|Integer|)) (|Integer|)) "\\spad{rdHack1(v,u,n)} \\undocumented")) (|weighted| (((|Mapping| |#1|) (|List| (|Record| (|:| |value| |#1|) (|:| |weight| (|Integer|))))) "\\spad{weighted(l)} \\undocumented")) (|uniform| (((|Mapping| |#1|) (|Set| |#1|)) "\\spad{uniform(s)} \\undocumented"))) NIL NIL -(-1038 F1 UP UPUP R F2) +(-1037 F1 UP UPUP R F2) ((|constructor| (NIL "\\indented{1}{Finds the order of a divisor over a finite field} Author: Manuel Bronstein Date Created: 1988 Date Last Updated: 8 November 1994")) (|order| (((|NonNegativeInteger|) (|FiniteDivisor| |#1| |#2| |#3| |#4|) |#3| (|Mapping| |#5| |#1|)) "\\spad{order(f,u,g)} \\undocumented"))) NIL NIL -(-1039) +(-1038) ((|constructor| (NIL "This domain represents list reduction syntax.")) (|body| (((|SpadAst|) $) "\\spad{body(e)} return the list of expressions being redcued.")) (|operator| (((|SpadAst|) $) "\\spad{operator(e)} returns the magma operation being applied."))) NIL NIL -(-1040) +(-1039) ((|constructor| (NIL "The category of real numeric domains,{} \\spadignore{i.e.} convertible to floats."))) NIL NIL -(-1041 |Pol|) +(-1040 |Pol|) ((|constructor| (NIL "\\indented{2}{This package provides functions for finding the real zeros} of univariate polynomials over the integers to arbitrary user-specified precision. The results are returned as a list of isolating intervals which are expressed as records with \"left\" and \"right\" rational number components.")) (|midpoints| (((|List| (|Fraction| (|Integer|))) (|List| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|)))))) "\\spad{midpoints(isolist)} returns the list of midpoints for the list of intervals \\spad{isolist}.")) (|midpoint| (((|Fraction| (|Integer|)) (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|))))) "\\spad{midpoint(int)} returns the midpoint of the interval \\spad{int}.")) (|refine| (((|Union| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|)))) "failed") |#1| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|)))) (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|))))) "\\spad{refine(pol, int, range)} takes a univariate polynomial \\spad{pol} and and isolating interval \\spad{int} containing exactly one real root of \\spad{pol}; the operation returns an isolating interval which is contained within range,{} or \"failed\" if no such isolating interval exists.") (((|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|)))) |#1| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|)))) (|Fraction| (|Integer|))) "\\spad{refine(pol, int, eps)} refines the interval \\spad{int} containing exactly one root of the univariate polynomial \\spad{pol} to size less than the rational number eps.")) (|realZeros| (((|List| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|))))) |#1| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|)))) (|Fraction| (|Integer|))) "\\spad{realZeros(pol, int, eps)} returns a list of intervals of length less than the rational number eps for all the real roots of the polynomial \\spad{pol} which lie in the interval expressed by the record \\spad{int}.") (((|List| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|))))) |#1| (|Fraction| (|Integer|))) "\\spad{realZeros(pol, eps)} returns a list of intervals of length less than the rational number eps for all the real roots of the polynomial \\spad{pol}.") (((|List| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|))))) |#1| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|))))) "\\spad{realZeros(pol, range)} returns a list of isolating intervals for all the real zeros of the univariate polynomial \\spad{pol} which lie in the interval expressed by the record range.") (((|List| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|))))) |#1|) "\\spad{realZeros(pol)} returns a list of isolating intervals for all the real zeros of the univariate polynomial \\spad{pol}."))) NIL NIL -(-1042 |Pol|) +(-1041 |Pol|) ((|constructor| (NIL "\\indented{2}{This package provides functions for finding the real zeros} of univariate polynomials over the rational numbers to arbitrary user-specified precision. The results are returned as a list of isolating intervals,{} expressed as records with \"left\" and \"right\" rational number components.")) (|refine| (((|Union| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|)))) "failed") |#1| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|)))) (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|))))) "\\spad{refine(pol, int, range)} takes a univariate polynomial \\spad{pol} and and isolating interval \\spad{int} which must contain exactly one real root of \\spad{pol},{} and returns an isolating interval which is contained within range,{} or \"failed\" if no such isolating interval exists.") (((|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|)))) |#1| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|)))) (|Fraction| (|Integer|))) "\\spad{refine(pol, int, eps)} refines the interval \\spad{int} containing exactly one root of the univariate polynomial \\spad{pol} to size less than the rational number eps.")) (|realZeros| (((|List| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|))))) |#1| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|)))) (|Fraction| (|Integer|))) "\\spad{realZeros(pol, int, eps)} returns a list of intervals of length less than the rational number eps for all the real roots of the polynomial \\spad{pol} which lie in the interval expressed by the record \\spad{int}.") (((|List| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|))))) |#1| (|Fraction| (|Integer|))) "\\spad{realZeros(pol, eps)} returns a list of intervals of length less than the rational number eps for all the real roots of the polynomial \\spad{pol}.") (((|List| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|))))) |#1| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|))))) "\\spad{realZeros(pol, range)} returns a list of isolating intervals for all the real zeros of the univariate polynomial \\spad{pol} which lie in the interval expressed by the record range.") (((|List| (|Record| (|:| |left| (|Fraction| (|Integer|))) (|:| |right| (|Fraction| (|Integer|))))) |#1|) "\\spad{realZeros(pol)} returns a list of isolating intervals for all the real zeros of the univariate polynomial \\spad{pol}."))) NIL NIL -(-1043) +(-1042) ((|constructor| (NIL "\\indented{1}{This package provides numerical solutions of systems of polynomial} equations for use in ACPLOT.")) (|realSolve| (((|List| (|List| (|Float|))) (|List| (|Polynomial| (|Integer|))) (|List| (|Symbol|)) (|Float|)) "\\spad{realSolve(lp,lv,eps)} = compute the list of the real solutions of the list \\spad{lp} of polynomials with integer coefficients with respect to the variables in \\spad{lv},{} with precision \\spad{eps}.")) (|solve| (((|List| (|Float|)) (|Polynomial| (|Integer|)) (|Float|)) "\\spad{solve(p,eps)} finds the real zeroes of a univariate integer polynomial \\spad{p} with precision \\spad{eps}.") (((|List| (|Float|)) (|Polynomial| (|Fraction| (|Integer|))) (|Float|)) "\\spad{solve(p,eps)} finds the real zeroes of a univariate rational polynomial \\spad{p} with precision \\spad{eps}."))) NIL NIL -(-1044 |TheField|) +(-1043 |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"))) -((-4417 . T) (-4422 . T) (-4416 . T) (-4419 . T) (-4418 . T) ((-4426 "*") . T) (-4421 . T)) -((-3956 (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| (-419 (-558)) (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| (-419 (-558)) (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| (-419 (-558)) (|%list| (QUOTE -1058) (QUOTE (-558))))) -(-1045 -3494 L) +((-4416 . T) (-4421 . T) (-4415 . T) (-4418 . T) (-4417 . T) ((-4425 "*") . T) (-4420 . T)) +((-3955 (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| (-419 (-557)) (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| (-419 (-557)) (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| (-419 (-557)) (|%list| (QUOTE -1057) (QUOTE (-557))))) +(-1044 -3493 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 -(-1046 S) +(-1045 S) ((|constructor| (NIL "\\indented{1}{\\spadtype{Reference} is for making a changeable instance} of something.")) (= (((|Boolean|) $ $) "\\spad{a=b} tests if \\spad{a} and \\spad{b} are equal.")) (|setref| ((|#1| $ |#1|) "\\spad{setref(n,m)} same as \\spad{setelt(n,m)}.")) (|deref| ((|#1| $) "\\spad{deref(n)} is equivalent to \\spad{elt(n)}.")) (|setelt| ((|#1| $ |#1|) "\\spad{setelt(n,m)} changes the value of the object \\spad{n} to \\spad{m}.")) (|elt| ((|#1| $) "\\spad{elt(n)} returns the object \\spad{n}.")) (|ref| (($ |#1|) "\\spad{ref(n)} creates a pointer (reference) to the object \\spad{n}."))) NIL -((|HasCategory| |#1| (QUOTE (-1121)))) -(-1047 R E V P) +((|HasCategory| |#1| (QUOTE (-1120)))) +(-1046 R E V P) ((|constructor| (NIL "This domain provides an implementation of regular chains. Moreover,{} the operation \\axiomOpFrom{zeroSetSplit}{RegularTriangularSetCategory} is an implementation of a new algorithm for solving polynomial systems by means of regular chains.\\newline References : \\indented{1}{[1] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}")) (|preprocess| (((|Record| (|:| |val| (|List| |#4|)) (|:| |towers| (|List| $))) (|List| |#4|) (|Boolean|) (|Boolean|)) "\\axiom{pre_process(lp,{}\\spad{b1},{}\\spad{b2})} is an internal subroutine,{} exported only for developement.")) (|internalZeroSetSplit| (((|List| $) (|List| |#4|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\axiom{internalZeroSetSplit(lp,{}\\spad{b1},{}\\spad{b2},{}\\spad{b3})} is an internal subroutine,{} exported only for developement.")) (|zeroSetSplit| (((|List| $) (|List| |#4|) (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\axiom{zeroSetSplit(lp,{}\\spad{b1},{}\\spad{b2}.\\spad{b3},{}\\spad{b4})} is an internal subroutine,{} exported only for developement.") (((|List| $) (|List| |#4|) (|Boolean|) (|Boolean|)) "\\axiom{zeroSetSplit(lp,{}clos?,{}info?)} has the same specifications as \\axiomOpFrom{zeroSetSplit}{RegularTriangularSetCategory}. Moreover,{} if \\axiom{clos?} then solves in the sense of the Zariski closure else solves in the sense of the regular zeros. If \\axiom{info?} then do print messages during the computations.")) (|internalAugment| (((|List| $) |#4| $ (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\axiom{internalAugment(\\spad{p},{}ts,{}\\spad{b1},{}\\spad{b2},{}\\spad{b3},{}\\spad{b4},{}\\spad{b5})} is an internal subroutine,{} exported only for developement."))) -((-4425 . T) (-4424 . T)) -((-12 (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (|HasCategory| |#4| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#4| (QUOTE (-102)))) -(-1048) +((-4424 . T) (-4423 . T)) +((-12 (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (|HasCategory| |#4| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#4| (QUOTE (-102)))) +(-1047) ((|constructor| (NIL "Package for the computation of eigenvalues and eigenvectors. This package works for matrices with coefficients which are rational functions over the integers. (see \\spadtype{Fraction Polynomial Integer}). The eigenvalues and eigenvectors are expressed in terms of radicals.")) (|orthonormalBasis| (((|List| (|Matrix| (|Expression| (|Integer|)))) (|Matrix| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{orthonormalBasis(m)} returns the orthogonal matrix \\spad{b} such that \\spad{b*m*(inverse b)} is diagonal. Error: if \\spad{m} is not a symmetric matrix.")) (|gramschmidt| (((|List| (|Matrix| (|Expression| (|Integer|)))) (|List| (|Matrix| (|Expression| (|Integer|))))) "\\spad{gramschmidt(lv)} converts the list of column vectors \\spad{lv} into a set of orthogonal column vectors of euclidean length 1 using the Gram-Schmidt algorithm.")) (|normalise| (((|Matrix| (|Expression| (|Integer|))) (|Matrix| (|Expression| (|Integer|)))) "\\spad{normalise(v)} returns the column vector \\spad{v} divided by its euclidean norm; when possible,{} the vector \\spad{v} is expressed in terms of radicals.")) (|eigenMatrix| (((|Union| (|Matrix| (|Expression| (|Integer|))) "failed") (|Matrix| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{eigenMatrix(m)} returns the matrix \\spad{b} such that \\spad{b*m*(inverse b)} is diagonal,{} or \"failed\" if no such \\spad{b} exists.")) (|radicalEigenvalues| (((|List| (|Expression| (|Integer|))) (|Matrix| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{radicalEigenvalues(m)} computes the eigenvalues of the matrix \\spad{m}; when possible,{} the eigenvalues are expressed in terms of radicals.")) (|radicalEigenvector| (((|List| (|Matrix| (|Expression| (|Integer|)))) (|Expression| (|Integer|)) (|Matrix| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{radicalEigenvector(c,m)} computes the eigenvector(\\spad{s}) of the matrix \\spad{m} corresponding to the eigenvalue \\spad{c}; when possible,{} values are expressed in terms of radicals.")) (|radicalEigenvectors| (((|List| (|Record| (|:| |radval| (|Expression| (|Integer|))) (|:| |radmult| (|Integer|)) (|:| |radvect| (|List| (|Matrix| (|Expression| (|Integer|))))))) (|Matrix| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{radicalEigenvectors(m)} computes the eigenvalues and the corresponding eigenvectors of the matrix \\spad{m}; when possible,{} values are expressed in terms of radicals."))) NIL NIL -(-1049 R) +(-1048 R) ((|constructor| (NIL "\\spad{RepresentationPackage1} provides functions for representation theory for finite groups and algebras. The package creates permutation representations and uses tensor products and its symmetric and antisymmetric components to create new representations of larger degree from given ones. Note: instead of having parameters from \\spadtype{Permutation} this package allows list notation of permutations as well: \\spadignore{e.g.} \\spad{[1,4,3,2]} denotes permutes 2 and 4 and fixes 1 and 3.")) (|permutationRepresentation| (((|List| (|Matrix| (|Integer|))) (|List| (|List| (|Integer|)))) "\\spad{permutationRepresentation([pi1,...,pik],n)} returns the list of matrices {\\em [(deltai,pi1(i)),...,(deltai,pik(i))]} if the permutations {\\em pi1},{}...,{}{\\em pik} are in list notation and are permuting {\\em {1,2,...,n}}.") (((|List| (|Matrix| (|Integer|))) (|List| (|Permutation| (|Integer|))) (|Integer|)) "\\spad{permutationRepresentation([pi1,...,pik],n)} returns the list of matrices {\\em [(deltai,pi1(i)),...,(deltai,pik(i))]} (Kronecker delta) for the permutations {\\em pi1,...,pik} of {\\em {1,2,...,n}}.") (((|Matrix| (|Integer|)) (|List| (|Integer|))) "\\spad{permutationRepresentation(pi,n)} returns the matrix {\\em (deltai,pi(i))} (Kronecker delta) if the permutation {\\em pi} is in list notation and permutes {\\em {1,2,...,n}}.") (((|Matrix| (|Integer|)) (|Permutation| (|Integer|)) (|Integer|)) "\\spad{permutationRepresentation(pi,n)} returns the matrix {\\em (deltai,pi(i))} (Kronecker delta) for a permutation {\\em pi} of {\\em {1,2,...,n}}.")) (|tensorProduct| (((|List| (|Matrix| |#1|)) (|List| (|Matrix| |#1|))) "\\spad{tensorProduct([a1,...ak])} calculates the list of Kronecker products of each matrix {\\em ai} with itself for {1 <= \\spad{i} <= \\spad{k}}. Note: If the list of matrices corresponds to a group representation (repr. of generators) of one group,{} then these matrices correspond to the tensor product of the representation with itself.") (((|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{tensorProduct(a)} calculates the Kronecker product of the matrix {\\em a} with itself.") (((|List| (|Matrix| |#1|)) (|List| (|Matrix| |#1|)) (|List| (|Matrix| |#1|))) "\\spad{tensorProduct([a1,...,ak],[b1,...,bk])} calculates the list of Kronecker products of the matrices {\\em ai} and {\\em bi} for {1 <= \\spad{i} <= \\spad{k}}. Note: If each list of matrices corresponds to a group representation (repr. of generators) of one group,{} then these matrices correspond to the tensor product of the two representations.") (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{tensorProduct(a,b)} calculates the Kronecker product of the matrices {\\em a} and \\spad{b}. Note: if each matrix corresponds to a group representation (repr. of generators) of one group,{} then these matrices correspond to the tensor product of the two representations.")) (|symmetricTensors| (((|List| (|Matrix| |#1|)) (|List| (|Matrix| |#1|)) (|PositiveInteger|)) "\\spad{symmetricTensors(la,n)} applies to each \\spad{m}-by-\\spad{m} square matrix in the list {\\em la} the irreducible,{} polynomial representation of the general linear group {\\em GLm} which corresponds to the partition {\\em (n,0,...,0)} of \\spad{n}. Error: if the matrices in {\\em la} are not square matrices. Note: this corresponds to the symmetrization of the representation with the trivial representation of the symmetric group {\\em Sn}. The carrier spaces of the representation are the symmetric tensors of the \\spad{n}-fold tensor product.") (((|Matrix| |#1|) (|Matrix| |#1|) (|PositiveInteger|)) "\\spad{symmetricTensors(a,n)} applies to the \\spad{m}-by-\\spad{m} square matrix {\\em a} the irreducible,{} polynomial representation of the general linear group {\\em GLm} which corresponds to the partition {\\em (n,0,...,0)} of \\spad{n}. Error: if {\\em a} is not a square matrix. Note: this corresponds to the symmetrization of the representation with the trivial representation of the symmetric group {\\em Sn}. The carrier spaces of the representation are the symmetric tensors of the \\spad{n}-fold tensor product.")) (|createGenericMatrix| (((|Matrix| (|Polynomial| |#1|)) (|NonNegativeInteger|)) "\\spad{createGenericMatrix(m)} creates a square matrix of dimension \\spad{k} whose entry at the \\spad{i}-th row and \\spad{j}-th column is the indeterminate {\\em x[i,j]} (double subscripted).")) (|antisymmetricTensors| (((|List| (|Matrix| |#1|)) (|List| (|Matrix| |#1|)) (|PositiveInteger|)) "\\spad{antisymmetricTensors(la,n)} applies to each \\spad{m}-by-\\spad{m} square matrix in the list {\\em la} the irreducible,{} polynomial representation of the general linear group {\\em GLm} which corresponds to the partition {\\em (1,1,...,1,0,0,...,0)} of \\spad{n}. Error: if \\spad{n} is greater than \\spad{m}. Note: this corresponds to the symmetrization of the representation with the sign representation of the symmetric group {\\em Sn}. The carrier spaces of the representation are the antisymmetric tensors of the \\spad{n}-fold tensor product.") (((|Matrix| |#1|) (|Matrix| |#1|) (|PositiveInteger|)) "\\spad{antisymmetricTensors(a,n)} applies to the square matrix {\\em a} the irreducible,{} polynomial representation of the general linear group {\\em GLm},{} where \\spad{m} is the number of rows of {\\em a},{} which corresponds to the partition {\\em (1,1,...,1,0,0,...,0)} of \\spad{n}. Error: if \\spad{n} is greater than \\spad{m}. Note: this corresponds to the symmetrization of the representation with the sign representation of the symmetric group {\\em Sn}. The carrier spaces of the representation are the antisymmetric tensors of the \\spad{n}-fold tensor product."))) NIL -((|HasAttribute| |#1| (QUOTE (-4426 "*")))) -(-1050 R) +((|HasAttribute| |#1| (QUOTE (-4425 "*")))) +(-1049 R) ((|constructor| (NIL "\\spad{RepresentationPackage2} provides functions for working with modular representations of finite groups and algebra. The routines in this package are created,{} using ideas of \\spad{R}. Parker,{} (the meat-Axe) to get smaller representations from bigger ones,{} \\spadignore{i.e.} finding sub- and factormodules,{} or to show,{} that such the representations are irreducible. Note: most functions are randomized functions of Las Vegas type \\spadignore{i.e.} every answer is correct,{} but with small probability the algorithm fails to get an answer.")) (|scanOneDimSubspaces| (((|Vector| |#1|) (|List| (|Vector| |#1|)) (|Integer|)) "\\spad{scanOneDimSubspaces(basis,n)} gives a canonical representative of the {\\em n}\\spad{-}th one-dimensional subspace of the vector space generated by the elements of {\\em basis},{} all from {\\em R**n}. The coefficients of the representative are of shape {\\em (0,...,0,1,*,...,*)},{} {\\em *} in \\spad{R}. If the size of \\spad{R} is \\spad{q},{} then there are {\\em (q**n-1)/(q-1)} of them. We first reduce \\spad{n} modulo this number,{} then find the largest \\spad{i} such that {\\em +/[q**i for i in 0..i-1] <= n}. Subtracting this sum of powers from \\spad{n} results in an \\spad{i}-digit number to \\spad{basis} \\spad{q}. This fills the positions of the stars.")) (|meatAxe| (((|List| (|List| (|Matrix| |#1|))) (|List| (|Matrix| |#1|)) (|PositiveInteger|)) "\\spad{meatAxe(aG, numberOfTries)} calls {\\em meatAxe(aG,true,numberOfTries,7)}. Notes: 7 covers the case of three-dimensional kernels over the field with 2 elements.") (((|List| (|List| (|Matrix| |#1|))) (|List| (|Matrix| |#1|)) (|Boolean|)) "\\spad{meatAxe(aG, randomElements)} calls {\\em meatAxe(aG,false,6,7)},{} only using Parker's fingerprints,{} if {\\em randomElemnts} is \\spad{false}. If it is \\spad{true},{} it calls {\\em meatAxe(aG,true,25,7)},{} only using random elements. Note: the choice of 25 was rather arbitrary. Also,{} 7 covers the case of three-dimensional kernels over the field with 2 elements.") (((|List| (|List| (|Matrix| |#1|))) (|List| (|Matrix| |#1|))) "\\spad{meatAxe(aG)} calls {\\em meatAxe(aG,false,25,7)} returns a 2-list of representations as follows. All matrices of argument \\spad{aG} are assumed to be square and of equal size. Then \\spad{aG} generates a subalgebra,{} say \\spad{A},{} of the algebra of all square matrices of dimension \\spad{n}. {\\em V R} is an A-module in the usual way. meatAxe(\\spad{aG}) creates at most 25 random elements of the algebra,{} tests them for singularity. If singular,{} it tries at most 7 elements of its kernel to generate a proper submodule. If successful a list which contains first the list of the representations of the submodule,{} then a list of the representations of the factor module is returned. Otherwise,{} if we know that all the kernel is already scanned,{} Norton's irreducibility test can be used either to prove irreducibility or to find the splitting. Notes: the first 6 tries use Parker's fingerprints. Also,{} 7 covers the case of three-dimensional kernels over the field with 2 elements.") (((|List| (|List| (|Matrix| |#1|))) (|List| (|Matrix| |#1|)) (|Boolean|) (|Integer|) (|Integer|)) "\\spad{meatAxe(aG,randomElements,numberOfTries, maxTests)} returns a 2-list of representations as follows. All matrices of argument \\spad{aG} are assumed to be square and of equal size. Then \\spad{aG} generates a subalgebra,{} say \\spad{A},{} of the algebra of all square matrices of dimension \\spad{n}. {\\em V R} is an A-module in the usual way. meatAxe(\\spad{aG},{}\\spad{numberOfTries},{} maxTests) creates at most {\\em numberOfTries} random elements of the algebra,{} tests them for singularity. If singular,{} it tries at most {\\em maxTests} elements of its kernel to generate a proper submodule. If successful,{} a 2-list is returned: first,{} a list containing first the list of the representations of the submodule,{} then a list of the representations of the factor module. Otherwise,{} if we know that all the kernel is already scanned,{} Norton's irreducibility test can be used either to prove irreducibility or to find the splitting. If {\\em randomElements} is {\\em false},{} the first 6 tries use Parker's fingerprints.")) (|split| (((|List| (|List| (|Matrix| |#1|))) (|List| (|Matrix| |#1|)) (|Vector| (|Vector| |#1|))) "\\spad{split(aG,submodule)} uses a proper \\spad{submodule} of {\\em R**n} to create the representations of the \\spad{submodule} and of the factor module.") (((|List| (|List| (|Matrix| |#1|))) (|List| (|Matrix| |#1|)) (|Vector| |#1|)) "\\spad{split(aG, vector)} returns a subalgebra \\spad{A} of all square matrix of dimension \\spad{n} as a list of list of matrices,{} generated by the list of matrices \\spad{aG},{} where \\spad{n} denotes both the size of vector as well as the dimension of each of the square matrices. {\\em V R} is an A-module in the natural way. split(\\spad{aG},{} vector) then checks whether the cyclic submodule generated by {\\em vector} is a proper submodule of {\\em V R}. If successful,{} it returns a two-element list,{} which contains first the list of the representations of the submodule,{} then the list of the representations of the factor module. If the vector generates the whole module,{} a one-element list of the old representation is given. Note: a later version this should call the other split.")) (|isAbsolutelyIrreducible?| (((|Boolean|) (|List| (|Matrix| |#1|))) "\\spad{isAbsolutelyIrreducible?(aG)} calls {\\em isAbsolutelyIrreducible?(aG,25)}. Note: the choice of 25 was rather arbitrary.") (((|Boolean|) (|List| (|Matrix| |#1|)) (|Integer|)) "\\spad{isAbsolutelyIrreducible?(aG, numberOfTries)} uses Norton's irreducibility test to check for absolute irreduciblity,{} assuming if a one-dimensional kernel is found. As no field extension changes create \"new\" elements in a one-dimensional space,{} the criterium stays \\spad{true} for every extension. The method looks for one-dimensionals only by creating random elements (no fingerprints) since a run of {\\em meatAxe} would have proved absolute irreducibility anyway.")) (|areEquivalent?| (((|Matrix| |#1|) (|List| (|Matrix| |#1|)) (|List| (|Matrix| |#1|)) (|Integer|)) "\\spad{areEquivalent?(aG0,aG1,numberOfTries)} calls {\\em areEquivalent?(aG0,aG1,true,25)}. Note: the choice of 25 was rather arbitrary.") (((|Matrix| |#1|) (|List| (|Matrix| |#1|)) (|List| (|Matrix| |#1|))) "\\spad{areEquivalent?(aG0,aG1)} calls {\\em areEquivalent?(aG0,aG1,true,25)}. Note: the choice of 25 was rather arbitrary.") (((|Matrix| |#1|) (|List| (|Matrix| |#1|)) (|List| (|Matrix| |#1|)) (|Boolean|) (|Integer|)) "\\spad{areEquivalent?(aG0,aG1,randomelements,numberOfTries)} tests whether the two lists of matrices,{} all assumed of same square shape,{} can be simultaneously conjugated by a non-singular matrix. If these matrices represent the same group generators,{} the representations are equivalent. The algorithm tries {\\em numberOfTries} times to create elements in the generated algebras in the same fashion. If their ranks differ,{} they are not equivalent. If an isomorphism is assumed,{} then the kernel of an element of the first algebra is mapped to the kernel of the corresponding element in the second algebra. Now consider the one-dimensional ones. If they generate the whole space (\\spadignore{e.g.} irreducibility !) we use {\\em standardBasisOfCyclicSubmodule} to create the only possible transition matrix. The method checks whether the matrix conjugates all corresponding matrices from {\\em aGi}. The way to choose the singular matrices is as in {\\em meatAxe}. If the two representations are equivalent,{} this routine returns the transformation matrix {\\em TM} with {\\em aG0.i * TM = TM * aG1.i} for all \\spad{i}. If the representations are not equivalent,{} a small 0-matrix is returned. Note: the case with different sets of group generators cannot be handled.")) (|standardBasisOfCyclicSubmodule| (((|Matrix| |#1|) (|List| (|Matrix| |#1|)) (|Vector| |#1|)) "\\spad{standardBasisOfCyclicSubmodule(lm,v)} returns a matrix as follows. It is assumed that the size \\spad{n} of the vector equals the number of rows and columns of the matrices. Then the matrices generate a subalgebra,{} say \\spad{A},{} of the algebra of all square matrices of dimension \\spad{n}. {\\em V R} is an \\spad{A}-module in the natural way. standardBasisOfCyclicSubmodule(\\spad{lm},{}\\spad{v}) calculates a matrix whose non-zero column vectors are the \\spad{R}-Basis of {\\em Av} achieved in the way as described in section 6 of \\spad{R}. A. Parker's \"The Meat-Axe\". Note: in contrast to {\\em cyclicSubmodule},{} the result is not in echelon form.")) (|cyclicSubmodule| (((|Vector| (|Vector| |#1|)) (|List| (|Matrix| |#1|)) (|Vector| |#1|)) "\\spad{cyclicSubmodule(lm,v)} generates a basis as follows. It is assumed that the size \\spad{n} of the vector equals the number of rows and columns of the matrices. Then the matrices generate a subalgebra,{} say \\spad{A},{} of the algebra of all square matrices of dimension \\spad{n}. {\\em V R} is an \\spad{A}-module in the natural way. cyclicSubmodule(\\spad{lm},{}\\spad{v}) generates the \\spad{R}-Basis of {\\em Av} as described in section 6 of \\spad{R}. A. Parker's \"The Meat-Axe\". Note: in contrast to the description in \"The Meat-Axe\" and to {\\em standardBasisOfCyclicSubmodule} the result is in echelon form.")) (|createRandomElement| (((|Matrix| |#1|) (|List| (|Matrix| |#1|)) (|Matrix| |#1|)) "\\spad{createRandomElement(aG,x)} creates a random element of the group algebra generated by {\\em aG}.")) (|completeEchelonBasis| (((|Matrix| |#1|) (|Vector| (|Vector| |#1|))) "\\spad{completeEchelonBasis(lv)} completes the basis {\\em lv} assumed to be in echelon form of a subspace of {\\em R**n} (\\spad{n} the length of all the vectors in {\\em lv}) with unit vectors to a basis of {\\em R**n}. It is assumed that the argument is not an empty vector and that it is not the basis of the 0-subspace. Note: the rows of the result correspond to the vectors of the basis."))) NIL ((-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-319)))) -(-1051 S) +(-1050 S) ((|constructor| (NIL "Implements multiplication by repeated addition")) (|double| ((|#1| (|PositiveInteger|) |#1|) "\\spad{double(i, r)} multiplies \\spad{r} by \\spad{i} using repeated doubling.")) (+ (($ $ $) "\\spad{x+y} returns the sum of \\spad{x} and \\spad{y}"))) NIL NIL -(-1052 S) +(-1051 S) ((|constructor| (NIL "Implements exponentiation by repeated squaring")) (|expt| ((|#1| |#1| (|PositiveInteger|)) "\\spad{expt(r, i)} computes r**i by repeated squaring")) (* (($ $ $) "\\spad{x*y} returns the product of \\spad{x} and \\spad{y}"))) NIL NIL -(-1053 S) +(-1052 S) ((|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 -(-1054 -3494 |Expon| |VarSet| |FPol| |LFPol|) +(-1053 -3493 |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"))) -(((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +(((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1055) +(-1054) ((|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.}"))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4289) (QUOTE (-1197))) (|%list| (QUOTE |:|) (QUOTE -2285) (QUOTE (-51)))))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-1121)))) (-3956 (|HasCategory| (-51) (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-1121)))) (-3956 (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-1121)))) (-3956 (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-51) (QUOTE (-1121))) (|HasCategory| (-51) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-1121)))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (|%list| (QUOTE -630) (QUOTE (-547)))) (-12 (|HasCategory| (-51) (QUOTE (-1121))) (|HasCategory| (-51) (|%list| (QUOTE -321) (QUOTE (-51))))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-1121))) (|HasCategory| (-1197) (QUOTE (-860))) (|HasCategory| (-51) (QUOTE (-1121))) (-3956 (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-51) (|%list| (QUOTE -629) (QUOTE (-876))))) (-3956 (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-102)))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-102)))) -(-1056) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4288) (QUOTE (-1196))) (|%list| (QUOTE |:|) (QUOTE -2284) (QUOTE (-51)))))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-1120)))) (-3955 (|HasCategory| (-51) (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-1120)))) (-3955 (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-1120)))) (-3955 (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-51) (QUOTE (-1120))) (|HasCategory| (-51) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-1120)))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (|%list| (QUOTE -629) (QUOTE (-546)))) (-12 (|HasCategory| (-51) (QUOTE (-1120))) (|HasCategory| (-51) (|%list| (QUOTE -321) (QUOTE (-51))))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-1120))) (|HasCategory| (-1196) (QUOTE (-859))) (|HasCategory| (-51) (QUOTE (-1120))) (-3955 (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-51) (|%list| (QUOTE -628) (QUOTE (-875))))) (-3955 (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-102)))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-102)))) +(-1055) ((|constructor| (NIL "This domain represents `return' expressions.")) (|expression| (((|SpadAst|) $) "\\spad{expression(e)} returns the expression returned by `e'."))) NIL NIL -(-1057 A S) +(-1056 A S) ((|constructor| (NIL "A is retractable to \\spad{B} means that some elementsif A can be converted into elements of \\spad{B} and any element of \\spad{B} can be converted into an element of A.")) (|retract| ((|#2| $) "\\spad{retract(a)} transforms a into an element of \\spad{S} if possible. Error: if a cannot be made into an element of \\spad{S}.")) (|retractIfCan| (((|Union| |#2| "failed") $) "\\spad{retractIfCan(a)} transforms a into an element of \\spad{S} if possible. Returns \"failed\" if a cannot be made into an element of \\spad{S}."))) NIL NIL -(-1058 S) +(-1057 S) ((|constructor| (NIL "A is retractable to \\spad{B} means that some elementsif A can be converted into elements of \\spad{B} and any element of \\spad{B} can be converted into an element of A.")) (|retract| ((|#1| $) "\\spad{retract(a)} transforms a into an element of \\spad{S} if possible. Error: if a cannot be made into an element of \\spad{S}.")) (|retractIfCan| (((|Union| |#1| "failed") $) "\\spad{retractIfCan(a)} transforms a into an element of \\spad{S} if possible. Returns \"failed\" if a cannot be made into an element of \\spad{S}."))) NIL NIL -(-1059 Q R) +(-1058 Q R) ((|constructor| (NIL "RetractSolvePackage is an interface to \\spadtype{SystemSolvePackage} that attempts to retract the coefficients of the equations before solving.")) (|solveRetract| (((|List| (|List| (|Equation| (|Fraction| (|Polynomial| |#2|))))) (|List| (|Polynomial| |#2|)) (|List| (|Symbol|))) "\\spad{solveRetract(lp,lv)} finds the solutions of the list \\spad{lp} of rational functions with respect to the list of symbols \\spad{lv}. The function tries to retract all the coefficients of the equations to \\spad{Q} before solving if possible."))) NIL NIL -(-1060 R) +(-1059 R) ((|constructor| (NIL "Utilities that provide the same top-level manipulations on fractions than on polynomials.")) (|coerce| (((|Fraction| (|Polynomial| |#1|)) |#1|) "\\spad{coerce(r)} returns \\spad{r} viewed as a rational function over \\spad{R}.")) (|eval| (((|Fraction| (|Polynomial| |#1|)) (|Fraction| (|Polynomial| |#1|)) (|List| (|Equation| (|Fraction| (|Polynomial| |#1|))))) "\\spad{eval(f, [v1 = g1,...,vn = gn])} returns \\spad{f} with each \\spad{vi} replaced by \\spad{gi} in parallel,{} \\spadignore{i.e.} \\spad{vi}'s appearing inside the \\spad{gi}'s are not replaced. Error: if any \\spad{vi} is not a symbol.") (((|Fraction| (|Polynomial| |#1|)) (|Fraction| (|Polynomial| |#1|)) (|Equation| (|Fraction| (|Polynomial| |#1|)))) "\\spad{eval(f, v = g)} returns \\spad{f} with \\spad{v} replaced by \\spad{g}. Error: if \\spad{v} is not a symbol.") (((|Fraction| (|Polynomial| |#1|)) (|Fraction| (|Polynomial| |#1|)) (|List| (|Symbol|)) (|List| (|Fraction| (|Polynomial| |#1|)))) "\\spad{eval(f, [v1,...,vn], [g1,...,gn])} returns \\spad{f} with each \\spad{vi} replaced by \\spad{gi} in parallel,{} \\spadignore{i.e.} \\spad{vi}'s appearing inside the \\spad{gi}'s are not replaced.") (((|Fraction| (|Polynomial| |#1|)) (|Fraction| (|Polynomial| |#1|)) (|Symbol|) (|Fraction| (|Polynomial| |#1|))) "\\spad{eval(f, v, g)} returns \\spad{f} with \\spad{v} replaced by \\spad{g}.")) (|multivariate| (((|Fraction| (|Polynomial| |#1|)) (|Fraction| (|SparseUnivariatePolynomial| (|Fraction| (|Polynomial| |#1|)))) (|Symbol|)) "\\spad{multivariate(f, v)} applies both the numerator and denominator of \\spad{f} to \\spad{v}.")) (|univariate| (((|Fraction| (|SparseUnivariatePolynomial| (|Fraction| (|Polynomial| |#1|)))) (|Fraction| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{univariate(f, v)} returns \\spad{f} viewed as a univariate rational function in \\spad{v}.")) (|mainVariable| (((|Union| (|Symbol|) "failed") (|Fraction| (|Polynomial| |#1|))) "\\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| (|Symbol|)) (|Fraction| (|Polynomial| |#1|))) "\\spad{variables(f)} returns the list of variables appearing in the numerator or the denominator of \\spad{f}."))) NIL NIL -(-1061) +(-1060) ((|t| (((|Mapping| (|Float|)) (|NonNegativeInteger|)) "\\spad{t(n)} \\undocumented")) (F (((|Mapping| (|Float|)) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{F(n,m)} \\undocumented")) (|Beta| (((|Mapping| (|Float|)) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{Beta(n,m)} \\undocumented")) (|chiSquare| (((|Mapping| (|Float|)) (|NonNegativeInteger|)) "\\spad{chiSquare(n)} \\undocumented")) (|exponential| (((|Mapping| (|Float|)) (|Float|)) "\\spad{exponential(f)} \\undocumented")) (|normal| (((|Mapping| (|Float|)) (|Float|) (|Float|)) "\\spad{normal(f,g)} \\undocumented")) (|uniform| (((|Mapping| (|Float|)) (|Float|) (|Float|)) "\\spad{uniform(f,g)} \\undocumented")) (|chiSquare1| (((|Float|) (|NonNegativeInteger|)) "\\spad{chiSquare1(n)} \\undocumented")) (|exponential1| (((|Float|)) "\\spad{exponential1()} \\undocumented")) (|normal01| (((|Float|)) "\\spad{normal01()} \\undocumented")) (|uniform01| (((|Float|)) "\\spad{uniform01()} \\undocumented"))) NIL NIL -(-1062 UP) +(-1061 UP) ((|constructor| (NIL "Factorization of univariate polynomials with coefficients which are rational functions with integer coefficients.")) (|factor| (((|Factored| |#1|) |#1|) "\\spad{factor(p)} returns a prime factorisation of \\spad{p}."))) NIL NIL -(-1063 R) +(-1062 R) ((|constructor| (NIL "\\spadtype{RationalFunctionFactorizer} contains the factor function (called factorFraction) which factors fractions of polynomials by factoring the numerator and denominator. Since any non zero fraction is a unit the usual factor operation will just return the original fraction.")) (|factorFraction| (((|Fraction| (|Factored| (|Polynomial| |#1|))) (|Fraction| (|Polynomial| |#1|))) "\\spad{factorFraction(r)} factors the numerator and the denominator of the polynomial fraction \\spad{r}."))) NIL NIL -(-1064 T$) +(-1063 T$) ((|constructor| (NIL "This category defines the common interface for RGB color models.")) (|componentUpperBound| ((|#1|) "componentUpperBound is an upper bound for all component values.")) (|blue| ((|#1| $) "\\spad{blue(c)} returns the `blue' component of `c'.")) (|green| ((|#1| $) "\\spad{green(c)} returns the `green' component of `c'.")) (|red| ((|#1| $) "\\spad{red(c)} returns the `red' component of `c'."))) NIL NIL -(-1065 T$) +(-1064 T$) ((|constructor| (NIL "This category defines the common interface for RGB color spaces.")) (|whitePoint| (($) "whitePoint is the contant indicating the white point of this color space."))) NIL NIL -(-1066 R |ls|) +(-1065 R |ls|) ((|constructor| (NIL "A domain for regular chains (\\spadignore{i.e.} regular triangular sets) over a Gcd-Domain and with a fix list of variables. This is just a front-end for the \\spadtype{RegularTriangularSet} domain constructor.")) (|zeroSetSplit| (((|List| $) (|List| (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#2|))) (|Boolean|) (|Boolean|)) "\\spad{zeroSetSplit(lp,clos?,info?)} returns a list \\spad{lts} of regular chains such that the union of the closures of their regular zero sets equals the affine variety associated with \\spad{lp}. Moreover,{} if \\spad{clos?} is \\spad{false} then the union of the regular zero set of the \\spad{ts} (for \\spad{ts} in \\spad{lts}) equals this variety. If \\spad{info?} is \\spad{true} then some information is displayed during the computations. See \\axiomOpFrom{zeroSetSplit}{RegularTriangularSet}."))) -((-4425 . T) (-4424 . T)) -((-12 (|HasCategory| (-799 |#1| (-877 |#2|)) (QUOTE (-1121))) (|HasCategory| (-799 |#1| (-877 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -799) (|devaluate| |#1|) (|%list| (QUOTE -877) (|devaluate| |#2|)))))) (|HasCategory| (-799 |#1| (-877 |#2|)) (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-799 |#1| (-877 |#2|)) (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| (-877 |#2|) (QUOTE (-381))) (|HasCategory| (-799 |#1| (-877 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-799 |#1| (-877 |#2|)) (QUOTE (-102)))) -(-1067) +((-4424 . T) (-4423 . T)) +((-12 (|HasCategory| (-798 |#1| (-876 |#2|)) (QUOTE (-1120))) (|HasCategory| (-798 |#1| (-876 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -798) (|devaluate| |#1|) (|%list| (QUOTE -876) (|devaluate| |#2|)))))) (|HasCategory| (-798 |#1| (-876 |#2|)) (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-798 |#1| (-876 |#2|)) (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| (-876 |#2|) (QUOTE (-381))) (|HasCategory| (-798 |#1| (-876 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-798 |#1| (-876 |#2|)) (QUOTE (-102)))) +(-1066) ((|constructor| (NIL "This package exports integer distributions")) (|ridHack1| (((|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{ridHack1(i,j,k,l)} \\undocumented")) (|geometric| (((|Mapping| (|Integer|)) |RationalNumber|) "\\spad{geometric(f)} \\undocumented")) (|poisson| (((|Mapping| (|Integer|)) |RationalNumber|) "\\spad{poisson(f)} \\undocumented")) (|binomial| (((|Mapping| (|Integer|)) (|Integer|) |RationalNumber|) "\\spad{binomial(n,f)} \\undocumented")) (|uniform| (((|Mapping| (|Integer|)) (|Segment| (|Integer|))) "\\spad{uniform(s)} \\undocumented"))) NIL NIL -(-1068 S) +(-1067 S) ((|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."))) NIL NIL -(-1069) +(-1068) ((|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."))) -((-4421 . T)) +((-4420 . T)) NIL -(-1070 |xx| -3494) +(-1069 |xx| -3493) ((|constructor| (NIL "This package exports rational interpolation algorithms"))) NIL NIL -(-1071 S) +(-1070 S) ((|constructor| (NIL "\\indented{2}{A set is an \\spad{S}-right linear set if it is stable by right-dilation} \\indented{2}{by elements in the semigroup \\spad{S}.} See Also: LeftLinearSet.")) (* (($ $ |#1|) "\\spad{x*s} is the right-dilation of \\spad{x} by \\spad{s}."))) NIL NIL -(-1072 S |m| |n| R |Row| |Col|) +(-1071 S |m| |n| R |Row| |Col|) ((|constructor| (NIL "\\spadtype{RectangularMatrixCategory} is a category of matrices of fixed dimensions. The dimensions of the matrix will be parameters of the domain. Domains in this category will be \\spad{R}-modules and will be non-mutable.")) (|nullSpace| (((|List| |#6|) $) "\\spad{nullSpace(m)}+ returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) $) "\\spad{nullity(m)} returns the nullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|rowEchelon| (($ $) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}.")) (/ (($ $ |#4|) "\\spad{m/r} divides the elements of \\spad{m} by \\spad{r}. Error: if \\spad{r = 0}.")) (|exquo| (((|Union| $ "failed") $ |#4|) "\\spad{exquo(m,r)} computes the exact quotient of the elements of \\spad{m} by \\spad{r},{} returning \\axiom{\"failed\"} if this is not possible.")) (|map| (($ (|Mapping| |#4| |#4| |#4|) $ $) "\\spad{map(f,a,b)} returns \\spad{c},{} where \\spad{c} is such that \\spad{c(i,j) = f(a(i,j),b(i,j))} for all \\spad{i},{} \\spad{j}.") (($ (|Mapping| |#4| |#4|) $) "\\spad{map(f,a)} returns \\spad{b},{} where \\spad{b(i,j) = a(i,j)} for all \\spad{i},{} \\spad{j}.")) (|column| ((|#6| $ (|Integer|)) "\\spad{column(m,j)} returns the \\spad{j}th column of the matrix \\spad{m}. Error: if the index outside the proper range.")) (|row| ((|#5| $ (|Integer|)) "\\spad{row(m,i)} returns the \\spad{i}th row of the matrix \\spad{m}. Error: if the index is outside the proper range.")) (|qelt| ((|#4| $ (|Integer|) (|Integer|)) "\\spad{qelt(m,i,j)} returns the element in the \\spad{i}th row and \\spad{j}th column of the matrix \\spad{m}. Note: there is NO error check to determine if indices are in the proper ranges.")) (|elt| ((|#4| $ (|Integer|) (|Integer|) |#4|) "\\spad{elt(m,i,j,r)} returns the element in the \\spad{i}th row and \\spad{j}th column of the matrix \\spad{m},{} if \\spad{m} has an \\spad{i}th row and a \\spad{j}th column,{} and returns \\spad{r} otherwise.") ((|#4| $ (|Integer|) (|Integer|)) "\\spad{elt(m,i,j)} returns the element in the \\spad{i}th row and \\spad{j}th column of the matrix \\spad{m}. Error: if indices are outside the proper ranges.")) (|listOfLists| (((|List| (|List| |#4|)) $) "\\spad{listOfLists(m)} returns the rows of the matrix \\spad{m} as a list of lists.")) (|ncols| (((|NonNegativeInteger|) $) "\\spad{ncols(m)} returns the number of columns in the matrix \\spad{m}.")) (|nrows| (((|NonNegativeInteger|) $) "\\spad{nrows(m)} returns the number of rows in the matrix \\spad{m}.")) (|maxColIndex| (((|Integer|) $) "\\spad{maxColIndex(m)} returns the index of the 'last' column of the matrix \\spad{m}.")) (|minColIndex| (((|Integer|) $) "\\spad{minColIndex(m)} returns the index of the 'first' column of the matrix \\spad{m}.")) (|maxRowIndex| (((|Integer|) $) "\\spad{maxRowIndex(m)} returns the index of the 'last' row of the matrix \\spad{m}.")) (|minRowIndex| (((|Integer|) $) "\\spad{minRowIndex(m)} returns the index of the 'first' row of the matrix \\spad{m}.")) (|antisymmetric?| (((|Boolean|) $) "\\spad{antisymmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and antisymmetric (\\spadignore{i.e.} \\spad{m[i,j] = -m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|symmetric?| (((|Boolean|) $) "\\spad{symmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and symmetric (\\spadignore{i.e.} \\spad{m[i,j] = m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|diagonal?| (((|Boolean|) $) "\\spad{diagonal?(m)} returns \\spad{true} if the matrix \\spad{m} is square and diagonal (\\spadignore{i.e.} all entries of \\spad{m} not on the diagonal are zero) and \\spad{false} otherwise.")) (|square?| (((|Boolean|) $) "\\spad{square?(m)} returns \\spad{true} if \\spad{m} is a square matrix (\\spadignore{i.e.} if \\spad{m} has the same number of rows as columns) and \\spad{false} otherwise.")) (|matrix| (($ (|List| (|List| |#4|))) "\\spad{matrix(l)} converts the list of lists \\spad{l} to a matrix,{} where the list of lists is viewed as a list of the rows of the matrix.")) (|finiteAggregate| ((|attribute|) "matrices are finite"))) NIL -((|HasCategory| |#4| (QUOTE (-319))) (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (QUOTE (-569))) (|HasCategory| |#4| (QUOTE (-175)))) -(-1073 |m| |n| R |Row| |Col|) +((|HasCategory| |#4| (QUOTE (-319))) (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (QUOTE (-568))) (|HasCategory| |#4| (QUOTE (-175)))) +(-1072 |m| |n| R |Row| |Col|) ((|constructor| (NIL "\\spadtype{RectangularMatrixCategory} is a category of matrices of fixed dimensions. The dimensions of the matrix will be parameters of the domain. Domains in this category will be \\spad{R}-modules and will be non-mutable.")) (|nullSpace| (((|List| |#5|) $) "\\spad{nullSpace(m)}+ returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) $) "\\spad{nullity(m)} returns the nullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|rowEchelon| (($ $) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}.")) (/ (($ $ |#3|) "\\spad{m/r} divides the elements of \\spad{m} by \\spad{r}. Error: if \\spad{r = 0}.")) (|exquo| (((|Union| $ "failed") $ |#3|) "\\spad{exquo(m,r)} computes the exact quotient of the elements of \\spad{m} by \\spad{r},{} returning \\axiom{\"failed\"} if this is not possible.")) (|map| (($ (|Mapping| |#3| |#3| |#3|) $ $) "\\spad{map(f,a,b)} returns \\spad{c},{} where \\spad{c} is such that \\spad{c(i,j) = f(a(i,j),b(i,j))} for all \\spad{i},{} \\spad{j}.") (($ (|Mapping| |#3| |#3|) $) "\\spad{map(f,a)} returns \\spad{b},{} where \\spad{b(i,j) = a(i,j)} for all \\spad{i},{} \\spad{j}.")) (|column| ((|#5| $ (|Integer|)) "\\spad{column(m,j)} returns the \\spad{j}th column of the matrix \\spad{m}. Error: if the index outside the proper range.")) (|row| ((|#4| $ (|Integer|)) "\\spad{row(m,i)} returns the \\spad{i}th row of the matrix \\spad{m}. Error: if the index is outside the proper range.")) (|qelt| ((|#3| $ (|Integer|) (|Integer|)) "\\spad{qelt(m,i,j)} returns the element in the \\spad{i}th row and \\spad{j}th column of the matrix \\spad{m}. Note: there is NO error check to determine if indices are in the proper ranges.")) (|elt| ((|#3| $ (|Integer|) (|Integer|) |#3|) "\\spad{elt(m,i,j,r)} returns the element in the \\spad{i}th row and \\spad{j}th column of the matrix \\spad{m},{} if \\spad{m} has an \\spad{i}th row and a \\spad{j}th column,{} and returns \\spad{r} otherwise.") ((|#3| $ (|Integer|) (|Integer|)) "\\spad{elt(m,i,j)} returns the element in the \\spad{i}th row and \\spad{j}th column of the matrix \\spad{m}. Error: if indices are outside the proper ranges.")) (|listOfLists| (((|List| (|List| |#3|)) $) "\\spad{listOfLists(m)} returns the rows of the matrix \\spad{m} as a list of lists.")) (|ncols| (((|NonNegativeInteger|) $) "\\spad{ncols(m)} returns the number of columns in the matrix \\spad{m}.")) (|nrows| (((|NonNegativeInteger|) $) "\\spad{nrows(m)} returns the number of rows in the matrix \\spad{m}.")) (|maxColIndex| (((|Integer|) $) "\\spad{maxColIndex(m)} returns the index of the 'last' column of the matrix \\spad{m}.")) (|minColIndex| (((|Integer|) $) "\\spad{minColIndex(m)} returns the index of the 'first' column of the matrix \\spad{m}.")) (|maxRowIndex| (((|Integer|) $) "\\spad{maxRowIndex(m)} returns the index of the 'last' row of the matrix \\spad{m}.")) (|minRowIndex| (((|Integer|) $) "\\spad{minRowIndex(m)} returns the index of the 'first' row of the matrix \\spad{m}.")) (|antisymmetric?| (((|Boolean|) $) "\\spad{antisymmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and antisymmetric (\\spadignore{i.e.} \\spad{m[i,j] = -m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|symmetric?| (((|Boolean|) $) "\\spad{symmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and symmetric (\\spadignore{i.e.} \\spad{m[i,j] = m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|diagonal?| (((|Boolean|) $) "\\spad{diagonal?(m)} returns \\spad{true} if the matrix \\spad{m} is square and diagonal (\\spadignore{i.e.} all entries of \\spad{m} not on the diagonal are zero) and \\spad{false} otherwise.")) (|square?| (((|Boolean|) $) "\\spad{square?(m)} returns \\spad{true} if \\spad{m} is a square matrix (\\spadignore{i.e.} if \\spad{m} has the same number of rows as columns) and \\spad{false} otherwise.")) (|matrix| (($ (|List| (|List| |#3|))) "\\spad{matrix(l)} converts the list of lists \\spad{l} to a matrix,{} where the list of lists is viewed as a list of the rows of the matrix.")) (|finiteAggregate| ((|attribute|) "matrices are finite"))) -((-4424 . T) (-4419 . T) (-4418 . T)) +((-4423 . T) (-4418 . T) (-4417 . T)) NIL -(-1074 |m| |n| R) +(-1073 |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}."))) -((-4424 . T) (-4419 . T) (-4418 . T)) -((|HasCategory| |#3| (QUOTE (-175))) (-3956 (-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 (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))))) (|HasCategory| |#3| (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376)))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (QUOTE (-319))) (|HasCategory| |#3| (QUOTE (-569))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (|HasCategory| |#3| (QUOTE (-102))) (|HasCategory| |#3| (|%list| (QUOTE -629) (QUOTE (-876))))) -(-1075 |m| |n| R1 |Row1| |Col1| M1 R2 |Row2| |Col2| M2) +((-4423 . T) (-4418 . T) (-4417 . T)) +((|HasCategory| |#3| (QUOTE (-175))) (-3955 (-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 (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))))) (|HasCategory| |#3| (|%list| (QUOTE -629) (QUOTE (-546)))) (-3955 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376)))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (QUOTE (-319))) (|HasCategory| |#3| (QUOTE (-568))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (|HasCategory| |#3| (QUOTE (-102))) (|HasCategory| |#3| (|%list| (QUOTE -628) (QUOTE (-875))))) +(-1074 |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 NIL -(-1076 R) +(-1075 R) ((|constructor| (NIL "The category of right modules over an rng (ring not necessarily with unit). This is an abelian group which supports right multiplation by elements of the rng. \\blankline"))) NIL NIL -(-1077) +(-1076) ((|constructor| (NIL "The category of associative rings,{} not necessarily commutative,{} and not necessarily with a 1. This is a combination of an abelian group and a semigroup,{} with multiplication distributing over addition. \\blankline"))) NIL NIL -(-1078 S T$) +(-1077 S T$) ((|constructor| (NIL "This domain represents the notion of binding a variable to range over a specific segment (either bounded,{} or half bounded).")) (|segment| ((|#1| $) "\\spad{segment(x)} returns the segment from the right hand side of the \\spadtype{RangeBinding}. For example,{} if \\spad{x} is \\spad{v=s},{} then \\spad{segment(x)} returns \\spad{s}.")) (|variable| (((|Symbol|) $) "\\spad{variable(x)} returns the variable from the left hand side of the \\spadtype{RangeBinding}. For example,{} if \\spad{x} is \\spad{v=s},{} then \\spad{variable(x)} returns \\spad{v}.")) (|equation| (($ (|Symbol|) |#1|) "\\spad{equation(v,s)} creates a segment binding value with variable \\spad{v} and segment \\spad{s}. Note that the interpreter parses \\spad{v=s} to this form."))) NIL -((|HasCategory| |#1| (QUOTE (-1121)))) -(-1079 S) +((|HasCategory| |#1| (QUOTE (-1120)))) +(-1078 S) ((|constructor| (NIL "The real number system category is intended as a model for the real numbers. The real numbers form an ordered normed field. Note that we have purposely not included \\spadtype{DifferentialRing} or the elementary functions (see \\spadtype{TranscendentalFunctionCategory}) in the definition.")) (|round| (($ $) "\\spad{round x} computes the integer closest to \\spad{x}.")) (|truncate| (($ $) "\\spad{truncate x} returns the integer between \\spad{x} and 0 closest to \\spad{x}.")) (|fractionPart| (($ $) "\\spad{fractionPart x} returns the fractional part of \\spad{x}.")) (|wholePart| (((|Integer|) $) "\\spad{wholePart x} returns the integer part of \\spad{x}.")) (|floor| (($ $) "\\spad{floor x} returns the largest integer \\spad{<= x}.")) (|ceiling| (($ $) "\\spad{ceiling x} returns the small integer \\spad{>= x}.")) (|norm| (($ $) "\\spad{norm x} returns the same as absolute value."))) NIL NIL -(-1080) +(-1079) ((|constructor| (NIL "The real number system category is intended as a model for the real numbers. The real numbers form an ordered normed field. Note that we have purposely not included \\spadtype{DifferentialRing} or the elementary functions (see \\spadtype{TranscendentalFunctionCategory}) in the definition.")) (|round| (($ $) "\\spad{round x} computes the integer closest to \\spad{x}.")) (|truncate| (($ $) "\\spad{truncate x} returns the integer between \\spad{x} and 0 closest to \\spad{x}.")) (|fractionPart| (($ $) "\\spad{fractionPart x} returns the fractional part of \\spad{x}.")) (|wholePart| (((|Integer|) $) "\\spad{wholePart x} returns the integer part of \\spad{x}.")) (|floor| (($ $) "\\spad{floor x} returns the largest integer \\spad{<= x}.")) (|ceiling| (($ $) "\\spad{ceiling x} returns the small integer \\spad{>= x}.")) (|norm| (($ $) "\\spad{norm x} returns the same as absolute value."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1081 |TheField| |ThePolDom|) +(-1080 |TheField| |ThePolDom|) ((|constructor| (NIL "\\axiomType{RightOpenIntervalRootCharacterization} provides work with interval root coding.")) (|relativeApprox| ((|#1| |#2| $ |#1|) "\\axiom{relativeApprox(exp,{}\\spad{c},{}\\spad{p}) = a} is relatively close to exp as a polynomial in \\spad{c} ip to precision \\spad{p}")) (|mightHaveRoots| (((|Boolean|) |#2| $) "\\axiom{mightHaveRoots(\\spad{p},{}\\spad{r})} is \\spad{false} if \\axiom{\\spad{p}.\\spad{r}} is not 0")) (|refine| (($ $) "\\axiom{refine(rootChar)} shrinks isolating interval around \\axiom{rootChar}")) (|middle| ((|#1| $) "\\axiom{middle(rootChar)} is the middle of the isolating interval")) (|size| ((|#1| $) "The size of the isolating interval")) (|right| ((|#1| $) "\\axiom{right(rootChar)} is the right bound of the isolating interval")) (|left| ((|#1| $) "\\axiom{left(rootChar)} is the left bound of the isolating interval"))) NIL NIL -(-1082) +(-1081) ((|constructor| (NIL "\\spadtype{RomanNumeral} provides functions for converting \\indented{1}{integers to roman numerals.}")) (|roman| (($ (|Integer|)) "\\spad{roman(n)} creates a roman numeral for \\spad{n}.") (($ (|Symbol|)) "\\spad{roman(n)} creates a roman numeral for symbol \\spad{n}.")) (|noetherian| ((|attribute|) "ascending chain condition on ideals.")) (|canonicalsClosed| ((|attribute|) "two positives multiply to give positive.")) (|canonical| ((|attribute|) "mathematical equality is data structure equality."))) -((-4412 . T) (-4416 . T) (-4411 . T) (-4422 . T) (-4423 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4411 . T) (-4415 . T) (-4410 . T) (-4421 . T) (-4422 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1083) +(-1082) ((|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}"))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4289) (QUOTE (-1197))) (|%list| (QUOTE |:|) (QUOTE -2285) (QUOTE (-51)))))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-1121)))) (-3956 (|HasCategory| (-51) (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-1121)))) (-3956 (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-1121)))) (-3956 (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-51) (QUOTE (-1121))) (|HasCategory| (-51) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-1121)))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (|%list| (QUOTE -630) (QUOTE (-547)))) (-12 (|HasCategory| (-51) (QUOTE (-1121))) (|HasCategory| (-51) (|%list| (QUOTE -321) (QUOTE (-51))))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-1121))) (|HasCategory| (-1197) (QUOTE (-860))) (|HasCategory| (-51) (QUOTE (-1121))) (-3956 (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-51) (|%list| (QUOTE -629) (QUOTE (-876))))) (-3956 (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-102)))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 (-1197)) (|:| -2285 (-51))) (QUOTE (-102)))) -(-1084 S R E V) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4288) (QUOTE (-1196))) (|%list| (QUOTE |:|) (QUOTE -2284) (QUOTE (-51)))))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-1120)))) (-3955 (|HasCategory| (-51) (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-1120)))) (-3955 (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-1120)))) (-3955 (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-51) (QUOTE (-1120))) (|HasCategory| (-51) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-1120)))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (|%list| (QUOTE -629) (QUOTE (-546)))) (-12 (|HasCategory| (-51) (QUOTE (-1120))) (|HasCategory| (-51) (|%list| (QUOTE -321) (QUOTE (-51))))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-1120))) (|HasCategory| (-1196) (QUOTE (-859))) (|HasCategory| (-51) (QUOTE (-1120))) (-3955 (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-51) (|%list| (QUOTE -628) (QUOTE (-875))))) (-3955 (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-102)))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 (-1196)) (|:| -2284 (-51))) (QUOTE (-102)))) +(-1083 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 -((|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-557))) (|HasCategory| |#2| (|%list| (QUOTE -38) (QUOTE (-558)))) (|HasCategory| |#2| (|%list| (QUOTE -1011) (QUOTE (-558)))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#4| (|%list| (QUOTE -630) (QUOTE (-1197))))) -(-1085 R E V) +((|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#2| (QUOTE (-556))) (|HasCategory| |#2| (|%list| (QUOTE -38) (QUOTE (-557)))) (|HasCategory| |#2| (|%list| (QUOTE -1010) (QUOTE (-557)))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#4| (|%list| (QUOTE -629) (QUOTE (-1196))))) +(-1084 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| ((|#1| |#1| $) "\\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})}") (($ $ |#1|) "\\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!") (($ $ |#1|) "\\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| |#1|)) "\\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| |#1|)) "\\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| |#1|)) "\\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| |#1|)) "\\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| |#1|)) "\\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| |#1|)) "\\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| |#1|)) "\\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| $)) $ $ |#3|) "\\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| $)) $ $ |#3|) "\\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| (($ $ $ |#3|) "\\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| (($ $ $ |#3|) "\\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| (($ $ $ |#3|) "\\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| (($ $ $ |#3|) "\\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| (($ $ |#3|) "\\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| (($ $ |#3|) "\\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| ((|#3| $) "\\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}}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) NIL -(-1086) +(-1085) ((|constructor| (NIL "This domain represents the `repeat' iterator syntax.")) (|body| (((|SpadAst|) $) "\\spad{body(e)} returns the body of the loop `e'.")) (|iterators| (((|List| (|SpadAst|)) $) "\\spad{iterators(e)} returns the list of iterators controlling the loop `e'."))) NIL NIL -(-1087 S |TheField| |ThePols|) +(-1086 S |TheField| |ThePols|) ((|constructor| (NIL "\\axiomType{RealRootCharacterizationCategory} provides common acces functions for all real root codings.")) (|relativeApprox| ((|#2| |#3| $ |#2|) "\\axiom{approximate(term,{}root,{}prec)} gives an approximation of \\axiom{term} over \\axiom{root} with precision \\axiom{prec}")) (|approximate| ((|#2| |#3| $ |#2|) "\\axiom{approximate(term,{}root,{}prec)} gives an approximation of \\axiom{term} over \\axiom{root} with precision \\axiom{prec}")) (|rootOf| (((|Union| $ "failed") |#3| (|PositiveInteger|)) "\\axiom{rootOf(pol,{}\\spad{n})} gives the \\spad{n}th root for the order of the Real Closure")) (|allRootsOf| (((|List| $) |#3|) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} in the Real Closure,{} assumed in order.")) (|definingPolynomial| ((|#3| $) "\\axiom{definingPolynomial(aRoot)} gives a polynomial such that \\axiom{definingPolynomial(aRoot).aRoot = 0}")) (|recip| (((|Union| |#3| "failed") |#3| $) "\\axiom{recip(pol,{}aRoot)} tries to inverse \\axiom{pol} interpreted as \\axiom{aRoot}")) (|positive?| (((|Boolean|) |#3| $) "\\axiom{positive?(pol,{}aRoot)} answers if \\axiom{pol} interpreted as \\axiom{aRoot} is positive")) (|negative?| (((|Boolean|) |#3| $) "\\axiom{negative?(pol,{}aRoot)} answers if \\axiom{pol} interpreted as \\axiom{aRoot} is negative")) (|zero?| (((|Boolean|) |#3| $) "\\axiom{zero?(pol,{}aRoot)} answers if \\axiom{pol} interpreted as \\axiom{aRoot} is \\axiom{0}")) (|sign| (((|Integer|) |#3| $) "\\axiom{sign(pol,{}aRoot)} gives the sign of \\axiom{pol} interpreted as \\axiom{aRoot}"))) NIL NIL -(-1088 |TheField| |ThePols|) +(-1087 |TheField| |ThePols|) ((|constructor| (NIL "\\axiomType{RealRootCharacterizationCategory} provides common acces functions for all real root codings.")) (|relativeApprox| ((|#1| |#2| $ |#1|) "\\axiom{approximate(term,{}root,{}prec)} gives an approximation of \\axiom{term} over \\axiom{root} with precision \\axiom{prec}")) (|approximate| ((|#1| |#2| $ |#1|) "\\axiom{approximate(term,{}root,{}prec)} gives an approximation of \\axiom{term} over \\axiom{root} with precision \\axiom{prec}")) (|rootOf| (((|Union| $ "failed") |#2| (|PositiveInteger|)) "\\axiom{rootOf(pol,{}\\spad{n})} gives the \\spad{n}th root for the order of the Real Closure")) (|allRootsOf| (((|List| $) |#2|) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} in the Real Closure,{} assumed in order.")) (|definingPolynomial| ((|#2| $) "\\axiom{definingPolynomial(aRoot)} gives a polynomial such that \\axiom{definingPolynomial(aRoot).aRoot = 0}")) (|recip| (((|Union| |#2| "failed") |#2| $) "\\axiom{recip(pol,{}aRoot)} tries to inverse \\axiom{pol} interpreted as \\axiom{aRoot}")) (|positive?| (((|Boolean|) |#2| $) "\\axiom{positive?(pol,{}aRoot)} answers if \\axiom{pol} interpreted as \\axiom{aRoot} is positive")) (|negative?| (((|Boolean|) |#2| $) "\\axiom{negative?(pol,{}aRoot)} answers if \\axiom{pol} interpreted as \\axiom{aRoot} is negative")) (|zero?| (((|Boolean|) |#2| $) "\\axiom{zero?(pol,{}aRoot)} answers if \\axiom{pol} interpreted as \\axiom{aRoot} is \\axiom{0}")) (|sign| (((|Integer|) |#2| $) "\\axiom{sign(pol,{}aRoot)} gives the sign of \\axiom{pol} interpreted as \\axiom{aRoot}"))) NIL NIL -(-1089 R E V P TS) +(-1088 R E V P TS) ((|constructor| (NIL "A package providing a new algorithm for solving polynomial systems by means of regular chains. Two ways of solving are proposed: in the sense of Zariski closure (like in Kalkbrener's algorithm) or in the sense of the regular zeros (like in Wu,{} Wang or Lazard methods). This algorithm is valid for nay type of regular set. It does not care about the way a polynomial is added in an regular set,{} or how two quasi-components are compared (by an inclusion-test),{} or how the invertibility test is made in the tower of simple extensions associated with a regular set. These operations are realized respectively by the domain \\spad{TS} and the packages \\axiomType{QCMPACK}(\\spad{R},{}\\spad{E},{}\\spad{V},{}\\spad{P},{}TS) and \\axiomType{RSETGCD}(\\spad{R},{}\\spad{E},{}\\spad{V},{}\\spad{P},{}TS). The same way it does not care about the way univariate polynomial gcd (with coefficients in the tower of simple extensions associated with a regular set) are computed. The only requirement is that these gcd need to have invertible initials (normalized or not). WARNING. There is no need for a user to call diectly any operation of this package since they can be accessed by the domain \\axiom{TS}. Thus,{} the operations of this package are not documented.\\newline References : \\indented{1}{[1] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}"))) NIL NIL -(-1090 S R E V P) +(-1089 S R E V P) ((|constructor| (NIL "The category of regular triangular sets,{} introduced under the name regular chains in [1] (and other papers). In [3] it is proved that regular triangular sets and towers of simple extensions of a field are equivalent notions. In the following definitions,{} all polynomials and ideals are taken from the polynomial ring \\spad{k[x1,...,xn]} where \\spad{k} is the fraction field of \\spad{R}. The triangular set \\spad{[t1,...,tm]} is regular iff for every \\spad{i} the initial of \\spad{ti+1} is invertible in the tower of simple extensions associated with \\spad{[t1,...,ti]}. A family \\spad{[T1,...,Ts]} of regular triangular sets is a split of Kalkbrener of a given ideal \\spad{I} iff the radical of \\spad{I} is equal to the intersection of the radical ideals generated by the saturated ideals of the \\spad{[T1,...,Ti]}. A family \\spad{[T1,...,Ts]} of regular triangular sets is a split of Kalkbrener of a given triangular set \\spad{T} iff it is a split of Kalkbrener of the saturated ideal of \\spad{T}. Let \\spad{K} be an algebraic closure of \\spad{k}. Assume that \\spad{V} is finite with cardinality \\spad{n} and let \\spad{A} be the affine space \\spad{K^n}. For a regular triangular set \\spad{T} let denote by \\spad{W(T)} the set of regular zeros of \\spad{T}. A family \\spad{[T1,...,Ts]} of regular triangular sets is a split of Lazard of a given subset \\spad{S} of \\spad{A} iff the union of the \\spad{W(Ti)} contains \\spad{S} and is contained in the closure of \\spad{S} (\\spad{w}.\\spad{r}.\\spad{t}. Zariski topology). A family \\spad{[T1,...,Ts]} of regular triangular sets is a split of Lazard of a given triangular set \\spad{T} if it is a split of Lazard of \\spad{W(T)}. Note that if \\spad{[T1,...,Ts]} is a split of Lazard of \\spad{T} then it is also a split of Kalkbrener of \\spad{T}. The converse is \\spad{false}. This category provides operations related to both kinds of splits,{} the former being related to ideals decomposition whereas the latter deals with varieties decomposition. See the example illustrating the \\spadtype{RegularTriangularSet} constructor for more explanations about decompositions by means of regular triangular sets. \\newline References : \\indented{1}{[1] \\spad{M}. KALKBRENER \"Three contributions to elimination theory\"} \\indented{5}{Phd Thesis,{} University of Linz,{} Austria,{} 1991.} \\indented{1}{[2] \\spad{M}. KALKBRENER \"Algorithmic properties of polynomial rings\"} \\indented{5}{Journal of Symbol. Comp. 1998} \\indented{1}{[3] \\spad{P}. AUBRY,{} \\spad{D}. LAZARD and \\spad{M}. MORENO MAZA \"On the Theories} \\indented{5}{of Triangular Sets\" Journal of Symbol. Comp. (to appear)} \\indented{1}{[4] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}")) (|zeroSetSplit| (((|List| $) (|List| |#5|) (|Boolean|)) "\\spad{zeroSetSplit(lp,clos?)} returns \\spad{lts} a split of Kalkbrener of the radical ideal associated with \\spad{lp}. If \\spad{clos?} is \\spad{false},{} it is also a decomposition of the variety associated with \\spad{lp} into the regular zero set of the \\spad{ts} in \\spad{lts} (or,{} in other words,{} a split of Lazard of this variety). See the example illustrating the \\spadtype{RegularTriangularSet} constructor for more explanations about decompositions by means of regular triangular sets.")) (|extend| (((|List| $) (|List| |#5|) (|List| $)) "\\spad{extend(lp,lts)} returns the same as \\spad{concat([extend(lp,ts) for ts in lts])|}") (((|List| $) (|List| |#5|) $) "\\spad{extend(lp,ts)} returns \\spad{ts} if \\spad{empty? lp} \\spad{extend(p,ts)} if \\spad{lp = [p]} else \\spad{extend(first lp, extend(rest lp, ts))}") (((|List| $) |#5| (|List| $)) "\\spad{extend(p,lts)} returns the same as \\spad{concat([extend(p,ts) for ts in lts])|}") (((|List| $) |#5| $) "\\spad{extend(p,ts)} assumes that \\spad{p} is a non-constant polynomial whose main variable is greater than any variable of \\spad{ts}. Then it returns a split of Kalkbrener of \\spad{ts+p}. This may not be \\spad{ts+p} itself,{} if for instance \\spad{ts+p} is not a regular triangular set.")) (|internalAugment| (($ (|List| |#5|) $) "\\spad{internalAugment(lp,ts)} returns \\spad{ts} if \\spad{lp} is empty otherwise returns \\spad{internalAugment(rest lp, internalAugment(first lp, ts))}") (($ |#5| $) "\\spad{internalAugment(p,ts)} assumes that \\spad{augment(p,ts)} returns a singleton and returns it.")) (|augment| (((|List| $) (|List| |#5|) (|List| $)) "\\spad{augment(lp,lts)} returns the same as \\spad{concat([augment(lp,ts) for ts in lts])}") (((|List| $) (|List| |#5|) $) "\\spad{augment(lp,ts)} returns \\spad{ts} if \\spad{empty? lp},{} \\spad{augment(p,ts)} if \\spad{lp = [p]},{} otherwise \\spad{augment(first lp, augment(rest lp, ts))}") (((|List| $) |#5| (|List| $)) "\\spad{augment(p,lts)} returns the same as \\spad{concat([augment(p,ts) for ts in lts])}") (((|List| $) |#5| $) "\\spad{augment(p,ts)} assumes that \\spad{p} is a non-constant polynomial whose main variable is greater than any variable of \\spad{ts}. This operation assumes also that if \\spad{p} is added to \\spad{ts} the resulting set,{} say \\spad{ts+p},{} is a regular triangular set. Then it returns a split of Kalkbrener of \\spad{ts+p}. This may not be \\spad{ts+p} itself,{} if for instance \\spad{ts+p} is required to be square-free.")) (|intersect| (((|List| $) |#5| (|List| $)) "\\spad{intersect(p,lts)} returns the same as \\spad{intersect([p],lts)}") (((|List| $) (|List| |#5|) (|List| $)) "\\spad{intersect(lp,lts)} returns the same as \\spad{concat([intersect(lp,ts) for ts in lts])|}") (((|List| $) (|List| |#5|) $) "\\spad{intersect(lp,ts)} returns \\spad{lts} a split of Lazard of the intersection of the affine variety associated with \\spad{lp} and the regular zero set of \\spad{ts}.") (((|List| $) |#5| $) "\\spad{intersect(p,ts)} returns the same as \\spad{intersect([p],ts)}")) (|squareFreePart| (((|List| (|Record| (|:| |val| |#5|) (|:| |tower| $))) |#5| $) "\\spad{squareFreePart(p,ts)} returns \\spad{lpwt} such that \\spad{lpwt.i.val} is a square-free polynomial \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower},{} this polynomial being associated with \\spad{p} modulo \\spad{lpwt.i.tower},{} for every \\spad{i}. Moreover,{} the list of the \\spad{lpwt.i.tower} is a split of Kalkbrener of \\spad{ts}. WARNING: This assumes that \\spad{p} is a non-constant polynomial such that if \\spad{p} is added to \\spad{ts},{} then the resulting set is a regular triangular set.")) (|lastSubResultant| (((|List| (|Record| (|:| |val| |#5|) (|:| |tower| $))) |#5| |#5| $) "\\spad{lastSubResultant(p1,p2,ts)} returns \\spad{lpwt} such that \\spad{lpwt.i.val} is a quasi-monic gcd of \\spad{p1} and \\spad{p2} \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower},{} for every \\spad{i},{} and such that the list of the \\spad{lpwt.i.tower} is a split of Kalkbrener of \\spad{ts}. Moreover,{} if \\spad{p1} and \\spad{p2} do not have a non-trivial gcd \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower} then \\spad{lpwt.i.val} is the resultant of these polynomials \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower}. This assumes that \\spad{p1} and \\spad{p2} have the same maim variable and that this variable is greater that any variable occurring in \\spad{ts}.")) (|lastSubResultantElseSplit| (((|Union| |#5| (|List| $)) |#5| |#5| $) "\\spad{lastSubResultantElseSplit(p1,p2,ts)} returns either \\spad{g} a quasi-monic gcd of \\spad{p1} and \\spad{p2} \\spad{w}.\\spad{r}.\\spad{t}. the \\spad{ts} or a split of Kalkbrener of \\spad{ts}. This assumes that \\spad{p1} and \\spad{p2} have the same maim variable and that this variable is greater that any variable occurring in \\spad{ts}.")) (|invertibleSet| (((|List| $) |#5| $) "\\spad{invertibleSet(p,ts)} returns a split of Kalkbrener of the quotient ideal of the ideal \\axiom{\\spad{I}} by \\spad{p} where \\spad{I} is the radical of saturated of \\spad{ts}.")) (|invertible?| (((|Boolean|) |#5| $) "\\spad{invertible?(p,ts)} returns \\spad{true} iff \\spad{p} is invertible in the tower associated with \\spad{ts}.") (((|List| (|Record| (|:| |val| (|Boolean|)) (|:| |tower| $))) |#5| $) "\\spad{invertible?(p,ts)} returns \\spad{lbwt} where \\spad{lbwt.i} is the result of \\spad{invertibleElseSplit?(p,lbwt.i.tower)} and the list of the \\spad{(lqrwt.i).tower} is a split of Kalkbrener of \\spad{ts}.")) (|invertibleElseSplit?| (((|Union| (|Boolean|) (|List| $)) |#5| $) "\\spad{invertibleElseSplit?(p,ts)} returns \\spad{true} (resp. \\spad{false}) if \\spad{p} is invertible in the tower associated with \\spad{ts} or returns a split of Kalkbrener of \\spad{ts}.")) (|purelyAlgebraicLeadingMonomial?| (((|Boolean|) |#5| $) "\\spad{purelyAlgebraicLeadingMonomial?(p,ts)} returns \\spad{true} iff the main variable of any non-constant iterarted initial of \\spad{p} is algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}.")) (|algebraicCoefficients?| (((|Boolean|) |#5| $) "\\spad{algebraicCoefficients?(p,ts)} returns \\spad{true} iff every variable of \\spad{p} which is not the main one of \\spad{p} is algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}.")) (|purelyTranscendental?| (((|Boolean|) |#5| $) "\\spad{purelyTranscendental?(p,ts)} returns \\spad{true} iff every variable of \\spad{p} is not algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}")) (|purelyAlgebraic?| (((|Boolean|) $) "\\spad{purelyAlgebraic?(ts)} returns \\spad{true} iff for every algebraic variable \\spad{v} of \\spad{ts} we have \\spad{algebraicCoefficients?(t_v,ts_v_-)} where \\spad{ts_v} is \\axiomOpFrom{select}{TriangularSetCategory}(\\spad{ts},{}\\spad{v}) and \\spad{ts_v_-} is \\axiomOpFrom{collectUnder}{TriangularSetCategory}(\\spad{ts},{}\\spad{v}).") (((|Boolean|) |#5| $) "\\spad{purelyAlgebraic?(p,ts)} returns \\spad{true} iff every variable of \\spad{p} is algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}."))) NIL NIL -(-1091 R E V P) +(-1090 R E V P) ((|constructor| (NIL "The category of regular triangular sets,{} introduced under the name regular chains in [1] (and other papers). In [3] it is proved that regular triangular sets and towers of simple extensions of a field are equivalent notions. In the following definitions,{} all polynomials and ideals are taken from the polynomial ring \\spad{k[x1,...,xn]} where \\spad{k} is the fraction field of \\spad{R}. The triangular set \\spad{[t1,...,tm]} is regular iff for every \\spad{i} the initial of \\spad{ti+1} is invertible in the tower of simple extensions associated with \\spad{[t1,...,ti]}. A family \\spad{[T1,...,Ts]} of regular triangular sets is a split of Kalkbrener of a given ideal \\spad{I} iff the radical of \\spad{I} is equal to the intersection of the radical ideals generated by the saturated ideals of the \\spad{[T1,...,Ti]}. A family \\spad{[T1,...,Ts]} of regular triangular sets is a split of Kalkbrener of a given triangular set \\spad{T} iff it is a split of Kalkbrener of the saturated ideal of \\spad{T}. Let \\spad{K} be an algebraic closure of \\spad{k}. Assume that \\spad{V} is finite with cardinality \\spad{n} and let \\spad{A} be the affine space \\spad{K^n}. For a regular triangular set \\spad{T} let denote by \\spad{W(T)} the set of regular zeros of \\spad{T}. A family \\spad{[T1,...,Ts]} of regular triangular sets is a split of Lazard of a given subset \\spad{S} of \\spad{A} iff the union of the \\spad{W(Ti)} contains \\spad{S} and is contained in the closure of \\spad{S} (\\spad{w}.\\spad{r}.\\spad{t}. Zariski topology). A family \\spad{[T1,...,Ts]} of regular triangular sets is a split of Lazard of a given triangular set \\spad{T} if it is a split of Lazard of \\spad{W(T)}. Note that if \\spad{[T1,...,Ts]} is a split of Lazard of \\spad{T} then it is also a split of Kalkbrener of \\spad{T}. The converse is \\spad{false}. This category provides operations related to both kinds of splits,{} the former being related to ideals decomposition whereas the latter deals with varieties decomposition. See the example illustrating the \\spadtype{RegularTriangularSet} constructor for more explanations about decompositions by means of regular triangular sets. \\newline References : \\indented{1}{[1] \\spad{M}. KALKBRENER \"Three contributions to elimination theory\"} \\indented{5}{Phd Thesis,{} University of Linz,{} Austria,{} 1991.} \\indented{1}{[2] \\spad{M}. KALKBRENER \"Algorithmic properties of polynomial rings\"} \\indented{5}{Journal of Symbol. Comp. 1998} \\indented{1}{[3] \\spad{P}. AUBRY,{} \\spad{D}. LAZARD and \\spad{M}. MORENO MAZA \"On the Theories} \\indented{5}{of Triangular Sets\" Journal of Symbol. Comp. (to appear)} \\indented{1}{[4] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}")) (|zeroSetSplit| (((|List| $) (|List| |#4|) (|Boolean|)) "\\spad{zeroSetSplit(lp,clos?)} returns \\spad{lts} a split of Kalkbrener of the radical ideal associated with \\spad{lp}. If \\spad{clos?} is \\spad{false},{} it is also a decomposition of the variety associated with \\spad{lp} into the regular zero set of the \\spad{ts} in \\spad{lts} (or,{} in other words,{} a split of Lazard of this variety). See the example illustrating the \\spadtype{RegularTriangularSet} constructor for more explanations about decompositions by means of regular triangular sets.")) (|extend| (((|List| $) (|List| |#4|) (|List| $)) "\\spad{extend(lp,lts)} returns the same as \\spad{concat([extend(lp,ts) for ts in lts])|}") (((|List| $) (|List| |#4|) $) "\\spad{extend(lp,ts)} returns \\spad{ts} if \\spad{empty? lp} \\spad{extend(p,ts)} if \\spad{lp = [p]} else \\spad{extend(first lp, extend(rest lp, ts))}") (((|List| $) |#4| (|List| $)) "\\spad{extend(p,lts)} returns the same as \\spad{concat([extend(p,ts) for ts in lts])|}") (((|List| $) |#4| $) "\\spad{extend(p,ts)} assumes that \\spad{p} is a non-constant polynomial whose main variable is greater than any variable of \\spad{ts}. Then it returns a split of Kalkbrener of \\spad{ts+p}. This may not be \\spad{ts+p} itself,{} if for instance \\spad{ts+p} is not a regular triangular set.")) (|internalAugment| (($ (|List| |#4|) $) "\\spad{internalAugment(lp,ts)} returns \\spad{ts} if \\spad{lp} is empty otherwise returns \\spad{internalAugment(rest lp, internalAugment(first lp, ts))}") (($ |#4| $) "\\spad{internalAugment(p,ts)} assumes that \\spad{augment(p,ts)} returns a singleton and returns it.")) (|augment| (((|List| $) (|List| |#4|) (|List| $)) "\\spad{augment(lp,lts)} returns the same as \\spad{concat([augment(lp,ts) for ts in lts])}") (((|List| $) (|List| |#4|) $) "\\spad{augment(lp,ts)} returns \\spad{ts} if \\spad{empty? lp},{} \\spad{augment(p,ts)} if \\spad{lp = [p]},{} otherwise \\spad{augment(first lp, augment(rest lp, ts))}") (((|List| $) |#4| (|List| $)) "\\spad{augment(p,lts)} returns the same as \\spad{concat([augment(p,ts) for ts in lts])}") (((|List| $) |#4| $) "\\spad{augment(p,ts)} assumes that \\spad{p} is a non-constant polynomial whose main variable is greater than any variable of \\spad{ts}. This operation assumes also that if \\spad{p} is added to \\spad{ts} the resulting set,{} say \\spad{ts+p},{} is a regular triangular set. Then it returns a split of Kalkbrener of \\spad{ts+p}. This may not be \\spad{ts+p} itself,{} if for instance \\spad{ts+p} is required to be square-free.")) (|intersect| (((|List| $) |#4| (|List| $)) "\\spad{intersect(p,lts)} returns the same as \\spad{intersect([p],lts)}") (((|List| $) (|List| |#4|) (|List| $)) "\\spad{intersect(lp,lts)} returns the same as \\spad{concat([intersect(lp,ts) for ts in lts])|}") (((|List| $) (|List| |#4|) $) "\\spad{intersect(lp,ts)} returns \\spad{lts} a split of Lazard of the intersection of the affine variety associated with \\spad{lp} and the regular zero set of \\spad{ts}.") (((|List| $) |#4| $) "\\spad{intersect(p,ts)} returns the same as \\spad{intersect([p],ts)}")) (|squareFreePart| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| $))) |#4| $) "\\spad{squareFreePart(p,ts)} returns \\spad{lpwt} such that \\spad{lpwt.i.val} is a square-free polynomial \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower},{} this polynomial being associated with \\spad{p} modulo \\spad{lpwt.i.tower},{} for every \\spad{i}. Moreover,{} the list of the \\spad{lpwt.i.tower} is a split of Kalkbrener of \\spad{ts}. WARNING: This assumes that \\spad{p} is a non-constant polynomial such that if \\spad{p} is added to \\spad{ts},{} then the resulting set is a regular triangular set.")) (|lastSubResultant| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| $))) |#4| |#4| $) "\\spad{lastSubResultant(p1,p2,ts)} returns \\spad{lpwt} such that \\spad{lpwt.i.val} is a quasi-monic gcd of \\spad{p1} and \\spad{p2} \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower},{} for every \\spad{i},{} and such that the list of the \\spad{lpwt.i.tower} is a split of Kalkbrener of \\spad{ts}. Moreover,{} if \\spad{p1} and \\spad{p2} do not have a non-trivial gcd \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower} then \\spad{lpwt.i.val} is the resultant of these polynomials \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower}. This assumes that \\spad{p1} and \\spad{p2} have the same maim variable and that this variable is greater that any variable occurring in \\spad{ts}.")) (|lastSubResultantElseSplit| (((|Union| |#4| (|List| $)) |#4| |#4| $) "\\spad{lastSubResultantElseSplit(p1,p2,ts)} returns either \\spad{g} a quasi-monic gcd of \\spad{p1} and \\spad{p2} \\spad{w}.\\spad{r}.\\spad{t}. the \\spad{ts} or a split of Kalkbrener of \\spad{ts}. This assumes that \\spad{p1} and \\spad{p2} have the same maim variable and that this variable is greater that any variable occurring in \\spad{ts}.")) (|invertibleSet| (((|List| $) |#4| $) "\\spad{invertibleSet(p,ts)} returns a split of Kalkbrener of the quotient ideal of the ideal \\axiom{\\spad{I}} by \\spad{p} where \\spad{I} is the radical of saturated of \\spad{ts}.")) (|invertible?| (((|Boolean|) |#4| $) "\\spad{invertible?(p,ts)} returns \\spad{true} iff \\spad{p} is invertible in the tower associated with \\spad{ts}.") (((|List| (|Record| (|:| |val| (|Boolean|)) (|:| |tower| $))) |#4| $) "\\spad{invertible?(p,ts)} returns \\spad{lbwt} where \\spad{lbwt.i} is the result of \\spad{invertibleElseSplit?(p,lbwt.i.tower)} and the list of the \\spad{(lqrwt.i).tower} is a split of Kalkbrener of \\spad{ts}.")) (|invertibleElseSplit?| (((|Union| (|Boolean|) (|List| $)) |#4| $) "\\spad{invertibleElseSplit?(p,ts)} returns \\spad{true} (resp. \\spad{false}) if \\spad{p} is invertible in the tower associated with \\spad{ts} or returns a split of Kalkbrener of \\spad{ts}.")) (|purelyAlgebraicLeadingMonomial?| (((|Boolean|) |#4| $) "\\spad{purelyAlgebraicLeadingMonomial?(p,ts)} returns \\spad{true} iff the main variable of any non-constant iterarted initial of \\spad{p} is algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}.")) (|algebraicCoefficients?| (((|Boolean|) |#4| $) "\\spad{algebraicCoefficients?(p,ts)} returns \\spad{true} iff every variable of \\spad{p} which is not the main one of \\spad{p} is algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}.")) (|purelyTranscendental?| (((|Boolean|) |#4| $) "\\spad{purelyTranscendental?(p,ts)} returns \\spad{true} iff every variable of \\spad{p} is not algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}")) (|purelyAlgebraic?| (((|Boolean|) $) "\\spad{purelyAlgebraic?(ts)} returns \\spad{true} iff for every algebraic variable \\spad{v} of \\spad{ts} we have \\spad{algebraicCoefficients?(t_v,ts_v_-)} where \\spad{ts_v} is \\axiomOpFrom{select}{TriangularSetCategory}(\\spad{ts},{}\\spad{v}) and \\spad{ts_v_-} is \\axiomOpFrom{collectUnder}{TriangularSetCategory}(\\spad{ts},{}\\spad{v}).") (((|Boolean|) |#4| $) "\\spad{purelyAlgebraic?(p,ts)} returns \\spad{true} iff every variable of \\spad{p} is algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}."))) -((-4425 . T) (-4424 . T)) +((-4424 . T) (-4423 . T)) NIL -(-1092 R E V P TS) +(-1091 R E V P TS) ((|constructor| (NIL "An internal package for computing gcds and resultants of univariate polynomials with coefficients in a tower of simple extensions of a field.\\newline References : \\indented{1}{[1] \\spad{M}. MORENO MAZA and \\spad{R}. RIOBOO \"Computations of gcd over} \\indented{5}{algebraic towers of simple extensions\" In proceedings of \\spad{AAECC11}} \\indented{5}{Paris,{} 1995.} \\indented{1}{[2] \\spad{M}. MORENO MAZA \"Calculs de pgcd au-dessus des tours} \\indented{5}{d'extensions simples et resolution des systemes d'equations} \\indented{5}{algebriques\" These,{} Universite \\spad{P}.etM. Curie,{} Paris,{} 1997.} \\indented{1}{[3] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}")) (|toseSquareFreePart| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#5|) "\\axiom{toseSquareFreePart(\\spad{p},{}ts)} has the same specifications as \\axiomOpFrom{squareFreePart}{RegularTriangularSetCategory}.")) (|toseInvertibleSet| (((|List| |#5|) |#4| |#5|) "\\axiom{toseInvertibleSet(\\spad{p1},{}\\spad{p2},{}ts)} has the same specifications as \\axiomOpFrom{invertibleSet}{RegularTriangularSetCategory}.")) (|toseInvertible?| (((|List| (|Record| (|:| |val| (|Boolean|)) (|:| |tower| |#5|))) |#4| |#5|) "\\axiom{toseInvertible?(\\spad{p1},{}\\spad{p2},{}ts)} has the same specifications as \\axiomOpFrom{invertible?}{RegularTriangularSetCategory}.") (((|Boolean|) |#4| |#5|) "\\axiom{toseInvertible?(\\spad{p1},{}\\spad{p2},{}ts)} has the same specifications as \\axiomOpFrom{invertible?}{RegularTriangularSetCategory}.")) (|toseLastSubResultant| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#4| |#5|) "\\axiom{toseLastSubResultant(\\spad{p1},{}\\spad{p2},{}ts)} has the same specifications as \\axiomOpFrom{lastSubResultant}{RegularTriangularSetCategory}.")) (|integralLastSubResultant| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#4| |#5|) "\\axiom{integralLastSubResultant(\\spad{p1},{}\\spad{p2},{}ts)} is an internal subroutine,{} exported only for developement.")) (|internalLastSubResultant| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) (|List| (|Record| (|:| |val| (|List| |#4|)) (|:| |tower| |#5|))) |#3| (|Boolean|)) "\\axiom{internalLastSubResultant(lpwt,{}\\spad{v},{}flag)} is an internal subroutine,{} exported only for developement.") (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#4| |#5| (|Boolean|) (|Boolean|)) "\\axiom{internalLastSubResultant(\\spad{p1},{}\\spad{p2},{}ts,{}inv?,{}break?)} is an internal subroutine,{} exported only for developement.")) (|prepareSubResAlgo| (((|List| (|Record| (|:| |val| (|List| |#4|)) (|:| |tower| |#5|))) |#4| |#4| |#5|) "\\axiom{prepareSubResAlgo(\\spad{p1},{}\\spad{p2},{}ts)} is an internal subroutine,{} exported only for developement.")) (|stopTableInvSet!| (((|Void|)) "\\axiom{stopTableInvSet!()} is an internal subroutine,{} exported only for developement.")) (|startTableInvSet!| (((|Void|) (|String|) (|String|) (|String|)) "\\axiom{startTableInvSet!(\\spad{s1},{}\\spad{s2},{}\\spad{s3})} is an internal subroutine,{} exported only for developement.")) (|stopTableGcd!| (((|Void|)) "\\axiom{stopTableGcd!()} is an internal subroutine,{} exported only for developement.")) (|startTableGcd!| (((|Void|) (|String|) (|String|) (|String|)) "\\axiom{startTableGcd!(\\spad{s1},{}\\spad{s2},{}\\spad{s3})} is an internal subroutine,{} exported only for developement."))) NIL NIL -(-1093) +(-1092) ((|constructor| (NIL "This domain represents `restrict' expressions.")) (|target| (((|TypeAst|) $) "\\spad{target(e)} returns the target type of the conversion..")) (|expression| (((|SpadAst|) $) "\\spad{expression(e)} returns the expression being converted."))) NIL NIL -(-1094) +(-1093) ((|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 -(-1095 |Base| R -3494) +(-1094 |Base| R -3493) ((|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 -(-1096 |f|) +(-1095 |f|) ((|constructor| (NIL "This domain implements named rules")) (|name| (((|Symbol|) $) "\\spad{name(x)} returns the symbol"))) NIL NIL -(-1097 |Base| R -3494) +(-1096 |Base| R -3493) ((|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 -(-1098 R |ls|) +(-1097 R |ls|) ((|constructor| (NIL "\\indented{1}{A package for computing the rational univariate representation} \\indented{1}{of a zero-dimensional algebraic variety given by a regular} \\indented{1}{triangular set. This package is essentially an interface for the} \\spadtype{InternalRationalUnivariateRepresentationPackage} constructor. It is used in the \\spadtype{ZeroDimensionalSolvePackage} for solving polynomial systems with finitely many solutions.")) (|rur| (((|List| (|Record| (|:| |complexRoots| (|SparseUnivariatePolynomial| |#1|)) (|:| |coordinates| (|List| (|Polynomial| |#1|))))) (|List| (|Polynomial| |#1|)) (|Boolean|) (|Boolean|)) "\\spad{rur(lp,univ?,check?)} returns the same as \\spad{rur(lp,true)}. Moreover,{} if \\spad{check?} is \\spad{true} then the result is checked.") (((|List| (|Record| (|:| |complexRoots| (|SparseUnivariatePolynomial| |#1|)) (|:| |coordinates| (|List| (|Polynomial| |#1|))))) (|List| (|Polynomial| |#1|))) "\\spad{rur(lp)} returns the same as \\spad{rur(lp,true)}") (((|List| (|Record| (|:| |complexRoots| (|SparseUnivariatePolynomial| |#1|)) (|:| |coordinates| (|List| (|Polynomial| |#1|))))) (|List| (|Polynomial| |#1|)) (|Boolean|)) "\\spad{rur(lp,univ?)} returns a rational univariate representation of \\spad{lp}. This assumes that \\spad{lp} defines a regular triangular \\spad{ts} whose associated variety is zero-dimensional over \\spad{R}. \\spad{rur(lp,univ?)} returns a list of items \\spad{[u,lc]} where \\spad{u} is an irreducible univariate polynomial and each \\spad{c} in \\spad{lc} involves two variables: one from \\spad{ls},{} called the coordinate of \\spad{c},{} and an extra variable which represents any root of \\spad{u}. Every root of \\spad{u} leads to a tuple of values for the coordinates of \\spad{lc}. Moreover,{} a point \\spad{x} belongs to the variety associated with \\spad{lp} iff there exists an item \\spad{[u,lc]} in \\spad{rur(lp,univ?)} and a root \\spad{r} of \\spad{u} such that \\spad{x} is given by the tuple of values for the coordinates of \\spad{lc} evaluated at \\spad{r}. If \\spad{univ?} is \\spad{true} then each polynomial \\spad{c} will have a constant leading coefficient \\spad{w}.\\spad{r}.\\spad{t}. its coordinate. See the example which illustrates the \\spadtype{ZeroDimensionalSolvePackage} package constructor."))) NIL NIL -(-1099 R UP M) +(-1098 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."))) -((-4417 |has| |#1| (-376)) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-363))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-363)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-363)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -918) (QUOTE (-1197)))))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558)))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-363)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -918) (QUOTE (-1197))))) (-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 -916) (QUOTE (-1197)))))) -(-1100 UP SAE UPA) +((-4416 |has| |#1| (-376)) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-363))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-363)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-363)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -917) (QUOTE (-1196)))))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557)))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-363)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -917) (QUOTE (-1196))))) (-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 -915) (QUOTE (-1196)))))) +(-1099 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 NIL -(-1101 UP SAE UPA) +(-1100 UP SAE UPA) ((|constructor| (NIL "Factorization of univariate polynomials with coefficients in an algebraic extension of \\spadtype{Fraction Polynomial Integer}.")) (|factor| (((|Factored| |#3|) |#3|) "\\spad{factor(p)} returns a prime factorisation of \\spad{p}."))) NIL NIL -(-1102) +(-1101) ((|constructor| (NIL "This trivial domain lets us build Univariate Polynomials in an anonymous variable"))) NIL NIL -(-1103) +(-1102) ((|constructor| (NIL "This is the category of Spad syntax objects."))) NIL NIL -(-1104 S) +(-1103 S) ((|constructor| (NIL "\\indented{1}{Cache of elements in a set} Author: Manuel Bronstein Date Created: 31 Oct 1988 Date Last Updated: 14 May 1991 \\indented{2}{A sorted cache of a cachable set \\spad{S} is a dynamic structure that} \\indented{2}{keeps the elements of \\spad{S} sorted and assigns an integer to each} \\indented{2}{element of \\spad{S} once it is in the cache. This way,{} equality and ordering} \\indented{2}{on \\spad{S} are tested directly on the integers associated with the elements} \\indented{2}{of \\spad{S},{} once they have been entered in the cache.}")) (|enterInCache| ((|#1| |#1| (|Mapping| (|Integer|) |#1| |#1|)) "\\spad{enterInCache(x, f)} enters \\spad{x} in the cache,{} calling \\spad{f(x, y)} to determine whether \\spad{x < y (f(x,y) < 0), x = y (f(x,y) = 0)},{} or \\spad{x > y (f(x,y) > 0)}. It returns \\spad{x} with an integer associated with it.") ((|#1| |#1| (|Mapping| (|Boolean|) |#1|)) "\\spad{enterInCache(x, f)} enters \\spad{x} in the cache,{} calling \\spad{f(y)} to determine whether \\spad{x} is equal to \\spad{y}. It returns \\spad{x} with an integer associated with it.")) (|cache| (((|List| |#1|)) "\\spad{cache()} returns the current cache as a list.")) (|clearCache| (((|Void|)) "\\spad{clearCache()} empties the cache."))) NIL NIL -(-1105) +(-1104) ((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: January 18,{} 2008. A `Scope' is a sequence of contours.")) (|currentCategoryFrame| (($) "\\spad{currentCategoryFrame()} returns the category frame currently in effect.")) (|currentScope| (($) "\\spad{currentScope()} returns the scope currently in effect")) (|pushNewContour| (($ (|Binding|) $) "\\spad{pushNewContour(b,s)} pushs a new contour with sole binding `b'.")) (|findBinding| (((|Maybe| (|Binding|)) (|Identifier|) $) "\\spad{findBinding(n,s)} returns the first binding of `n' in `s'; otherwise `nothing'.")) (|contours| (((|List| (|Contour|)) $) "\\spad{contours(s)} returns the list of contours in scope \\spad{s}.")) (|empty| (($) "\\spad{empty()} returns an empty scope."))) NIL NIL -(-1106 R) +(-1105 R) ((|constructor| (NIL "StructuralConstantsPackage provides functions creating structural constants from a multiplication tables or a basis of a matrix algebra and other useful functions in this context.")) (|coordinates| (((|Vector| |#1|) (|Matrix| |#1|) (|List| (|Matrix| |#1|))) "\\spad{coordinates(a,[v1,...,vn])} returns the coordinates of \\spad{a} with respect to the \\spad{R}-module basis \\spad{v1},{}...,{}\\spad{vn}.")) (|structuralConstants| (((|Vector| (|Matrix| |#1|)) (|List| (|Matrix| |#1|))) "\\spad{structuralConstants(basis)} takes the \\spad{basis} of a matrix algebra,{} \\spadignore{e.g.} the result of \\spadfun{basisOfCentroid} and calculates the structural constants. Note,{} that the it is not checked,{} whether \\spad{basis} really is a \\spad{basis} of a matrix algebra.") (((|Vector| (|Matrix| (|Polynomial| |#1|))) (|List| (|Symbol|)) (|Matrix| (|Polynomial| |#1|))) "\\spad{structuralConstants(ls,mt)} determines the structural constants of an algebra with generators \\spad{ls} and multiplication table \\spad{mt},{} the entries of which must be given as linear polynomials in the indeterminates given by \\spad{ls}. The result is in particular useful \\indented{1}{as fourth argument for \\spadtype{AlgebraGivenByStructuralConstants}} \\indented{1}{and \\spadtype{GenericNonAssociativeAlgebra}.}") (((|Vector| (|Matrix| (|Fraction| (|Polynomial| |#1|)))) (|List| (|Symbol|)) (|Matrix| (|Fraction| (|Polynomial| |#1|)))) "\\spad{structuralConstants(ls,mt)} determines the structural constants of an algebra with generators \\spad{ls} and multiplication table \\spad{mt},{} the entries of which must be given as linear polynomials in the indeterminates given by \\spad{ls}. The result is in particular useful \\indented{1}{as fourth argument for \\spadtype{AlgebraGivenByStructuralConstants}} \\indented{1}{and \\spadtype{GenericNonAssociativeAlgebra}.}"))) NIL NIL -(-1107 R) +(-1106 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"))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-928))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-1108 (-1197)) (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-1108 (-1197)) (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-1108 (-1197)) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-1108 (-1197)) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-1108 (-1197)) (|%list| (QUOTE -630) (QUOTE (-547))))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4422)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) -(-1108 S) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-927))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-1107 (-1196)) (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-1107 (-1196)) (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-1107 (-1196)) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-1107 (-1196)) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-1107 (-1196)) (|%list| (QUOTE -629) (QUOTE (-546))))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4421)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) +(-1107 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 NIL -(-1109 S) +(-1108 S) ((|constructor| (NIL "This type is used to specify a range of values from type \\spad{S}."))) NIL -((|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1121)))) -(-1110 R S) +((|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1120)))) +(-1109 R S) ((|constructor| (NIL "This package provides operations for mapping functions onto segments.")) (|map| (((|List| |#2|) (|Mapping| |#2| |#1|) (|Segment| |#1|)) "\\spad{map(f,s)} expands the segment \\spad{s},{} applying \\spad{f} to each value. For example,{} if \\spad{s = l..h by k},{} then the list \\spad{[f(l), f(l+k),..., f(lN)]} is computed,{} where \\spad{lN <= h < lN+k}.") (((|Segment| |#2|) (|Mapping| |#2| |#1|) (|Segment| |#1|)) "\\spad{map(f,l..h)} returns a new segment \\spad{f(l)..f(h)}."))) NIL -((|HasCategory| |#1| (QUOTE (-859)))) -(-1111) +((|HasCategory| |#1| (QUOTE (-858)))) +(-1110) ((|constructor| (NIL "This domain represents segement expressions.")) (|bounds| (((|List| (|SpadAst|)) $) "\\spad{bounds(s)} returns the bounds of the segment `s'. If `s' designates an infinite interval,{} then the returns list a singleton list."))) NIL NIL -(-1112 S) +(-1111 S) ((|constructor| (NIL "This domain is used to provide the function argument syntax \\spad{v=a..b}. This is used,{} for example,{} by the top-level \\spadfun{draw} functions."))) NIL -((|HasCategory| (-1109 |#1|) (QUOTE (-1121)))) -(-1113 R S) +((|HasCategory| (-1108 |#1|) (QUOTE (-1120)))) +(-1112 R S) ((|constructor| (NIL "This package provides operations for mapping functions onto \\spadtype{SegmentBinding}\\spad{s}.")) (|map| (((|SegmentBinding| |#2|) (|Mapping| |#2| |#1|) (|SegmentBinding| |#1|)) "\\spad{map(f,v=a..b)} returns the value given by \\spad{v=f(a)..f(b)}."))) NIL NIL -(-1114 S) +(-1113 S) ((|constructor| (NIL "This category provides operations on ranges,{} or {\\em segments} as they are called.")) (|segment| (($ |#1| |#1|) "\\spad{segment(i,j)} is an alternate way to create the segment \\spad{i..j}.")) (|incr| (((|Integer|) $) "\\spad{incr(s)} returns \\spad{n},{} where \\spad{s} is a segment in which every \\spad{n}\\spad{-}th element is used. Note: \\spad{incr(l..h by n) = n}.")) (|high| ((|#1| $) "\\spad{high(s)} returns the second endpoint of \\spad{s}. Note: \\spad{high(l..h) = h}.")) (|low| ((|#1| $) "\\spad{low(s)} returns the first endpoint of \\spad{s}. Note: \\spad{low(l..h) = l}.")) (|hi| ((|#1| $) "\\spad{hi(s)} returns the second endpoint of \\spad{s}. Note: \\spad{hi(l..h) = h}.")) (|lo| ((|#1| $) "\\spad{lo(s)} returns the first endpoint of \\spad{s}. Note: \\spad{lo(l..h) = l}.")) (BY (($ $ (|Integer|)) "\\spad{s by n} creates a new segment in which only every \\spad{n}\\spad{-}th element is used.")) (SEGMENT (($ |#1| |#1|) "\\spad{l..h} creates a segment with \\spad{l} and \\spad{h} as the endpoints."))) NIL NIL -(-1115 S L) +(-1114 S L) ((|constructor| (NIL "This category provides an interface for expanding segments to a stream of elements.")) (|map| ((|#2| (|Mapping| |#1| |#1|) $) "\\spad{map(f,l..h by k)} produces a value of type \\spad{L} by applying \\spad{f} to each of the succesive elements of the segment,{} that is,{} \\spad{[f(l), f(l+k), ..., f(lN)]},{} where \\spad{lN <= h < lN+k}.")) (|expand| ((|#2| $) "\\spad{expand(l..h by k)} creates value of type \\spad{L} with elements \\spad{l, l+k, ... lN} where \\spad{lN <= h < lN+k}. For example,{} \\spad{expand(1..5 by 2) = [1,3,5]}.") ((|#2| (|List| $)) "\\spad{expand(l)} creates a new value of type \\spad{L} in which each segment \\spad{l..h by k} is replaced with \\spad{l, l+k, ... lN},{} where \\spad{lN <= h < lN+k}. For example,{} \\spad{expand [1..4, 7..9] = [1,2,3,4,7,8,9]}."))) NIL NIL -(-1116) +(-1115) ((|constructor| (NIL "This domain represents a block of expressions.")) (|last| (((|SpadAst|) $) "\\spad{last(e)} returns the last instruction in `e'.")) (|body| (((|List| (|SpadAst|)) $) "\\spad{body(e)} returns the list of expressions in the sequence of instruction `e'."))) NIL NIL -(-1117 S) +(-1116 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)}}"))) -((-4424 . T) (-4414 . T) (-4425 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) -(-1118 A S) +((-4423 . T) (-4413 . T) (-4424 . T)) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +(-1117 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 NIL -(-1119 S) +(-1118 S) ((|constructor| (NIL "A set category lists a collection of set-theoretic operations useful for both finite sets and multisets. Note however that finite sets are distinct from multisets. Although the operations defined for set categories are common to both,{} the relationship between the two cannot be described by inclusion or inheritance.")) (|union| (($ |#1| $) "\\spad{union(x,u)} returns the set aggregate \\spad{u} with the element \\spad{x} added. If \\spad{u} already contains \\spad{x},{} \\axiom{union(\\spad{x},{}\\spad{u})} returns a copy of \\spad{u}.") (($ $ |#1|) "\\spad{union(u,x)} returns the set aggregate \\spad{u} with the element \\spad{x} added. If \\spad{u} already contains \\spad{x},{} \\axiom{union(\\spad{u},{}\\spad{x})} returns a copy of \\spad{u}.") (($ $ $) "\\spad{union(u,v)} returns the set aggregate of elements which are members of either set aggregate \\spad{u} or \\spad{v}.")) (|subset?| (((|Boolean|) $ $) "\\spad{subset?(u,v)} tests if \\spad{u} is a subset of \\spad{v}. Note: equivalent to \\axiom{reduce(and,{}{member?(\\spad{x},{}\\spad{v}) for \\spad{x} in \\spad{u}},{}\\spad{true},{}\\spad{false})}.")) (|symmetricDifference| (($ $ $) "\\spad{symmetricDifference(u,v)} returns the set aggregate of elements \\spad{x} which are members of set aggregate \\spad{u} or set aggregate \\spad{v} but not both. If \\spad{u} and \\spad{v} have no elements in common,{} \\axiom{symmetricDifference(\\spad{u},{}\\spad{v})} returns a copy of \\spad{u}. Note: \\axiom{symmetricDifference(\\spad{u},{}\\spad{v}) = union(difference(\\spad{u},{}\\spad{v}),{}difference(\\spad{v},{}\\spad{u}))}")) (|difference| (($ $ |#1|) "\\spad{difference(u,x)} returns the set aggregate \\spad{u} with element \\spad{x} removed. If \\spad{u} does not contain \\spad{x},{} a copy of \\spad{u} is returned. Note: \\axiom{difference(\\spad{s},{} \\spad{x}) = difference(\\spad{s},{} {\\spad{x}})}.") (($ $ $) "\\spad{difference(u,v)} returns the set aggregate \\spad{w} consisting of elements in set aggregate \\spad{u} but not in set aggregate \\spad{v}. If \\spad{u} and \\spad{v} have no elements in common,{} \\axiom{difference(\\spad{u},{}\\spad{v})} returns a copy of \\spad{u}. Note: equivalent to the notation (not currently supported) \\axiom{{\\spad{x} for \\spad{x} in \\spad{u} | not member?(\\spad{x},{}\\spad{v})}}.")) (|intersect| (($ $ $) "\\spad{intersect(u,v)} returns the set aggregate \\spad{w} consisting of elements common to both set aggregates \\spad{u} and \\spad{v}. Note: equivalent to the notation (not currently supported) {\\spad{x} for \\spad{x} in \\spad{u} | member?(\\spad{x},{}\\spad{v})}.")) (|set| (($ (|List| |#1|)) "\\spad{set([x,y,...,z])} creates a set aggregate containing items \\spad{x},{}\\spad{y},{}...,{}\\spad{z}.") (($) "\\spad{set()}\\$\\spad{D} creates an empty set aggregate of type \\spad{D}.")) (|brace| (($ (|List| |#1|)) "\\spad{brace([x,y,...,z])} creates a set aggregate containing items \\spad{x},{}\\spad{y},{}...,{}\\spad{z}. This form is considered obsolete. Use \\axiomFun{set} instead.") (($) "\\spad{brace()}\\$\\spad{D} (otherwise written {}\\$\\spad{D}) creates an empty set aggregate of type \\spad{D}. This form is considered obsolete. Use \\axiomFun{set} instead.")) (|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}."))) -((-4414 . T)) +((-4413 . T)) NIL -(-1120 S) +(-1119 S) ((|constructor| (NIL "\\spadtype{SetCategory} is the basic category for describing a collection of elements with \\spadop{=} (equality) and \\spadfun{coerce} to output form. \\blankline Conditional Attributes: \\indented{3}{canonical\\tab{15}data structure equality is the same as \\spadop{=}}")) (|latex| (((|String|) $) "\\spad{latex(s)} returns a LaTeX-printable output representation of \\spad{s}.")) (|hash| (((|SingleInteger|) $) "\\spad{hash(s)} calculates a hash code for \\spad{s}."))) NIL NIL -(-1121) +(-1120) ((|constructor| (NIL "\\spadtype{SetCategory} is the basic category for describing a collection of elements with \\spadop{=} (equality) and \\spadfun{coerce} to output form. \\blankline Conditional Attributes: \\indented{3}{canonical\\tab{15}data structure equality is the same as \\spadop{=}}")) (|latex| (((|String|) $) "\\spad{latex(s)} returns a LaTeX-printable output representation of \\spad{s}.")) (|hash| (((|SingleInteger|) $) "\\spad{hash(s)} calculates a hash code for \\spad{s}."))) NIL NIL -(-1122 |m| |n|) +(-1121 |m| |n|) ((|constructor| (NIL "\\spadtype{SetOfMIntegersInOneToN} implements the subsets of \\spad{M} integers in the interval \\spad{[1..n]}")) (|delta| (((|NonNegativeInteger|) $ (|PositiveInteger|) (|PositiveInteger|)) "\\spad{delta(S,k,p)} returns the number of elements of \\spad{S} which are strictly between \\spad{p} and the k^{th} element of \\spad{S}.")) (|member?| (((|Boolean|) (|PositiveInteger|) $) "\\spad{member?(p, s)} returns \\spad{true} is \\spad{p} is in \\spad{s},{} \\spad{false} otherwise.")) (|enumerate| (((|Vector| $)) "\\spad{enumerate()} returns a vector of all the sets of \\spad{M} integers in \\spad{1..n}.")) (|setOfMinN| (($ (|List| (|PositiveInteger|))) "\\spad{setOfMinN([a_1,...,a_m])} returns the set {\\spad{a_1},{}...,{}a_m}. Error if {\\spad{a_1},{}...,{}a_m} is not a set of \\spad{M} integers in \\spad{1..n}.")) (|elements| (((|List| (|PositiveInteger|)) $) "\\spad{elements(S)} returns the list of the elements of \\spad{S} in increasing order.")) (|replaceKthElement| (((|Union| $ #1="failed") $ (|PositiveInteger|) (|PositiveInteger|)) "\\spad{replaceKthElement(S,k,p)} replaces the k^{th} element of \\spad{S} by \\spad{p},{} and returns \"failed\" if the result is not a set of \\spad{M} integers in \\spad{1..n} any more.")) (|incrementKthElement| (((|Union| $ #1#) $ (|PositiveInteger|)) "\\spad{incrementKthElement(S,k)} increments the k^{th} element of \\spad{S},{} and returns \"failed\" if the result is not a set of \\spad{M} integers in \\spad{1..n} any more."))) NIL NIL -(-1123) +(-1122) ((|constructor| (NIL "This domain allows the manipulation of the usual Lisp values."))) NIL NIL -(-1124 |Str| |Sym| |Int| |Flt| |Expr|) +(-1123 |Str| |Sym| |Int| |Flt| |Expr|) ((|constructor| (NIL "This category allows the manipulation of Lisp values while keeping the grunge fairly localized.")) (|#| (((|Integer|) $) "\\spad{\\#((a1,...,an))} returns \\spad{n}.")) (|cdr| (($ $) "\\spad{cdr((a1,...,an))} returns \\spad{(a2,...,an)}.")) (|car| (($ $) "\\spad{car((a1,...,an))} returns \\spad{a1}.")) (|expr| ((|#5| $) "\\spad{expr(s)} returns \\spad{s} as an element of Expr; Error: if \\spad{s} is not an atom that also belongs to Expr.")) (|float| ((|#4| $) "\\spad{float(s)} returns \\spad{s} as an element of Flt; Error: if \\spad{s} is not an atom that also belongs to Flt.")) (|integer| ((|#3| $) "\\spad{integer(s)} returns \\spad{s} as an element of Int. Error: if \\spad{s} is not an atom that also belongs to Int.")) (|symbol| ((|#2| $) "\\spad{symbol(s)} returns \\spad{s} as an element of Sym. Error: if \\spad{s} is not an atom that also belongs to Sym.")) (|string| ((|#1| $) "\\spad{string(s)} returns \\spad{s} as an element of Str. Error: if \\spad{s} is not an atom that also belongs to Str.")) (|destruct| (((|List| $) $) "\\spad{destruct((a1,...,an))} returns the list [\\spad{a1},{}...,{}an].")) (|float?| (((|Boolean|) $) "\\spad{float?(s)} is \\spad{true} if \\spad{s} is an atom and belong to Flt.")) (|integer?| (((|Boolean|) $) "\\spad{integer?(s)} is \\spad{true} if \\spad{s} is an atom and belong to Int.")) (|symbol?| (((|Boolean|) $) "\\spad{symbol?(s)} is \\spad{true} if \\spad{s} is an atom and belong to Sym.")) (|string?| (((|Boolean|) $) "\\spad{string?(s)} is \\spad{true} if \\spad{s} is an atom and belong to Str.")) (|list?| (((|Boolean|) $) "\\spad{list?(s)} is \\spad{true} if \\spad{s} is a Lisp list,{} possibly ().")) (|pair?| (((|Boolean|) $) "\\spad{pair?(s)} is \\spad{true} if \\spad{s} has is a non-null Lisp list.")) (|atom?| (((|Boolean|) $) "\\spad{atom?(s)} is \\spad{true} if \\spad{s} is a Lisp atom.")) (|null?| (((|Boolean|) $) "\\spad{null?(s)} is \\spad{true} if \\spad{s} is the \\spad{S}-expression ().")) (|eq| (((|Boolean|) $ $) "\\spad{eq(s, t)} is \\spad{true} if \\%peq(\\spad{s},{}\\spad{t}) is \\spad{true} for pointers."))) NIL NIL -(-1125 |Str| |Sym| |Int| |Flt| |Expr|) +(-1124 |Str| |Sym| |Int| |Flt| |Expr|) ((|constructor| (NIL "This domain allows the manipulation of Lisp values over arbitrary atomic types."))) NIL NIL -(-1126 R FS) +(-1125 R FS) ((|constructor| (NIL "\\axiomType{SimpleFortranProgram(\\spad{f},{}type)} provides a simple model of some FORTRAN subprograms,{} making it possible to coerce objects of various domains into a FORTRAN subprogram called \\axiom{\\spad{f}}. These can then be translated into legal FORTRAN code.")) (|fortran| (($ (|Symbol|) (|FortranScalarType|) |#2|) "\\spad{fortran(fname,ftype,body)} builds an object of type \\axiomType{FortranProgramCategory}. The three arguments specify the name,{} the type and the \\spad{body} of the program."))) NIL NIL -(-1127 R E V P TS) +(-1126 R E V P TS) ((|constructor| (NIL "\\indented{2}{A internal package for removing redundant quasi-components and redundant} \\indented{2}{branches when decomposing a variety by means of quasi-components} \\indented{2}{of regular 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} \\indented{5}{Tech. Report (PoSSo project)} \\indented{1}{[2] \\spad{M}. MORENO MAZA \"Calculs de pgcd au-dessus des tours} \\indented{5}{d'extensions simples et resolution des systemes d'equations} \\indented{5}{algebriques\" These,{} Universite \\spad{P}.etM. Curie,{} Paris,{} 1997.} \\indented{1}{[3] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}")) (|branchIfCan| (((|Union| (|Record| (|:| |eq| (|List| |#4|)) (|:| |tower| |#5|) (|:| |ineq| (|List| |#4|))) "failed") (|List| |#4|) |#5| (|List| |#4|) (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\axiom{branchIfCan(leq,{}ts,{}lineq,{}\\spad{b1},{}\\spad{b2},{}\\spad{b3},{}\\spad{b4},{}\\spad{b5})} is an internal subroutine,{} exported only for developement.")) (|prepareDecompose| (((|List| (|Record| (|:| |eq| (|List| |#4|)) (|:| |tower| |#5|) (|:| |ineq| (|List| |#4|)))) (|List| |#4|) (|List| |#5|) (|Boolean|) (|Boolean|)) "\\axiom{prepareDecompose(lp,{}lts,{}\\spad{b1},{}\\spad{b2})} is an internal subroutine,{} exported only for developement.")) (|removeSuperfluousCases| (((|List| (|Record| (|:| |val| (|List| |#4|)) (|:| |tower| |#5|))) (|List| (|Record| (|:| |val| (|List| |#4|)) (|:| |tower| |#5|)))) "\\axiom{removeSuperfluousCases(llpwt)} is an internal subroutine,{} exported only for developement.")) (|subCase?| (((|Boolean|) (|Record| (|:| |val| (|List| |#4|)) (|:| |tower| |#5|)) (|Record| (|:| |val| (|List| |#4|)) (|:| |tower| |#5|))) "\\axiom{subCase?(\\spad{lpwt1},{}\\spad{lpwt2})} is an internal subroutine,{} exported only for developement.")) (|removeSuperfluousQuasiComponents| (((|List| |#5|) (|List| |#5|)) "\\axiom{removeSuperfluousQuasiComponents(lts)} removes from \\axiom{lts} any \\spad{ts} such that \\axiom{subQuasiComponent?(ts,{}us)} holds for another \\spad{us} in \\axiom{lts}.")) (|subQuasiComponent?| (((|Boolean|) |#5| (|List| |#5|)) "\\axiom{subQuasiComponent?(ts,{}lus)} returns \\spad{true} iff \\axiom{subQuasiComponent?(ts,{}us)} holds for one \\spad{us} in \\spad{lus}.") (((|Boolean|) |#5| |#5|) "\\axiom{subQuasiComponent?(ts,{}us)} returns \\spad{true} iff \\axiomOpFrom{internalSubQuasiComponent?(ts,{}us)}{QuasiComponentPackage} returs \\spad{true}.")) (|internalSubQuasiComponent?| (((|Union| (|Boolean|) "failed") |#5| |#5|) "\\axiom{internalSubQuasiComponent?(ts,{}us)} returns a boolean \\spad{b} value if the fact the regular zero set of \\axiom{us} contains that of \\axiom{ts} can be decided (and in that case \\axiom{\\spad{b}} gives this inclusion) otherwise returns \\axiom{\"failed\"}.")) (|infRittWu?| (((|Boolean|) (|List| |#4|) (|List| |#4|)) "\\axiom{infRittWu?(\\spad{lp1},{}\\spad{lp2})} is an internal subroutine,{} exported only for developement.")) (|internalInfRittWu?| (((|Boolean|) (|List| |#4|) (|List| |#4|)) "\\axiom{internalInfRittWu?(\\spad{lp1},{}\\spad{lp2})} is an internal subroutine,{} exported only for developement.")) (|internalSubPolSet?| (((|Boolean|) (|List| |#4|) (|List| |#4|)) "\\axiom{internalSubPolSet?(\\spad{lp1},{}\\spad{lp2})} returns \\spad{true} iff \\axiom{\\spad{lp1}} is a sub-set of \\axiom{\\spad{lp2}} assuming that these lists are sorted increasingly \\spad{w}.\\spad{r}.\\spad{t}. \\axiomOpFrom{infRittWu?}{RecursivePolynomialCategory}.")) (|subPolSet?| (((|Boolean|) (|List| |#4|) (|List| |#4|)) "\\axiom{subPolSet?(\\spad{lp1},{}\\spad{lp2})} returns \\spad{true} iff \\axiom{\\spad{lp1}} is a sub-set of \\axiom{\\spad{lp2}}.")) (|subTriSet?| (((|Boolean|) |#5| |#5|) "\\axiom{subTriSet?(ts,{}us)} returns \\spad{true} iff \\axiom{ts} is a sub-set of \\axiom{us}.")) (|moreAlgebraic?| (((|Boolean|) |#5| |#5|) "\\axiom{moreAlgebraic?(ts,{}us)} returns \\spad{false} iff \\axiom{ts} and \\axiom{us} are both empty,{} or \\axiom{ts} has less elements than \\axiom{us},{} or some variable is algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{us} and is not \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{ts}.")) (|algebraicSort| (((|List| |#5|) (|List| |#5|)) "\\axiom{algebraicSort(lts)} sorts \\axiom{lts} \\spad{w}.\\spad{r}.\\spad{t} \\axiomOpFrom{supDimElseRittWu}{QuasiComponentPackage}.")) (|supDimElseRittWu?| (((|Boolean|) |#5| |#5|) "\\axiom{supDimElseRittWu(ts,{}us)} returns \\spad{true} iff \\axiom{ts} has less elements than \\axiom{us} otherwise if \\axiom{ts} has higher rank than \\axiom{us} \\spad{w}.\\spad{r}.\\spad{t}. Riit and Wu ordering.")) (|stopTable!| (((|Void|)) "\\axiom{stopTableGcd!()} is an internal subroutine,{} exported only for developement.")) (|startTable!| (((|Void|) (|String|) (|String|) (|String|)) "\\axiom{startTableGcd!(\\spad{s1},{}\\spad{s2},{}\\spad{s3})} is an internal subroutine,{} exported only for developement."))) NIL NIL -(-1128 R E V P TS) +(-1127 R E V P TS) ((|constructor| (NIL "A internal package for computing gcds and resultants of univariate polynomials with coefficients in a tower of simple extensions of a field. There is no need to use directly this package since its main operations are available from \\spad{TS}. \\newline References : \\indented{1}{[1] \\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}{[2] \\spad{M}. MORENO MAZA \"Calculs de pgcd au-dessus des tours} \\indented{5}{d'extensions simples et resolution des systemes d'equations} \\indented{5}{algebriques\" These,{} Universite \\spad{P}.etM. Curie,{} Paris,{} 1997.} \\indented{1}{[3] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}"))) NIL NIL -(-1129 R E V P) +(-1128 R E V P) ((|constructor| (NIL "The category of square-free regular triangular sets. A regular triangular set \\spad{ts} is square-free if the gcd of any polynomial \\spad{p} in \\spad{ts} and \\spad{differentiate(p,mvar(p))} \\spad{w}.\\spad{r}.\\spad{t}. \\axiomOpFrom{collectUnder}{TriangularSetCategory}(ts,{}\\axiomOpFrom{mvar}{RecursivePolynomialCategory}(\\spad{p})) has degree zero \\spad{w}.\\spad{r}.\\spad{t}. \\spad{mvar(p)}. Thus any square-free regular set defines a tower of square-free simple extensions.\\newline References : \\indented{1}{[1] \\spad{D}. LAZARD \"A new method for solving algebraic systems of} \\indented{5}{positive dimension\" Discr. App. Math. 33:147-160,{}1991} \\indented{1}{[2] \\spad{M}. KALKBRENER \"Algorithmic properties of polynomial rings\"} \\indented{5}{Habilitation Thesis,{} ETZH,{} Zurich,{} 1995.} \\indented{1}{[3] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}"))) -((-4425 . T) (-4424 . T)) +((-4424 . T) (-4423 . T)) NIL -(-1130) +(-1129) ((|constructor| (NIL "SymmetricGroupCombinatoricFunctions contains combinatoric functions concerning symmetric groups and representation theory: list young tableaus,{} improper partitions,{} subsets bijection of Coleman.")) (|unrankImproperPartitions1| (((|List| (|Integer|)) (|Integer|) (|Integer|) (|Integer|)) "\\spad{unrankImproperPartitions1(n,m,k)} computes the {\\em k}\\spad{-}th improper partition of nonnegative \\spad{n} in at most \\spad{m} nonnegative parts ordered as follows: first,{} in reverse lexicographically according to their non-zero parts,{} then according to their positions (\\spadignore{i.e.} lexicographical order using {\\em subSet}: {\\em [3,0,0] < [0,3,0] < [0,0,3] < [2,1,0] < [2,0,1] < [0,2,1] < [1,2,0] < [1,0,2] < [0,1,2] < [1,1,1]}). Note: counting of subtrees is done by {\\em numberOfImproperPartitionsInternal}.")) (|unrankImproperPartitions0| (((|List| (|Integer|)) (|Integer|) (|Integer|) (|Integer|)) "\\spad{unrankImproperPartitions0(n,m,k)} computes the {\\em k}\\spad{-}th improper partition of nonnegative \\spad{n} in \\spad{m} nonnegative parts in reverse lexicographical order. Example: {\\em [0,0,3] < [0,1,2] < [0,2,1] < [0,3,0] < [1,0,2] < [1,1,1] < [1,2,0] < [2,0,1] < [2,1,0] < [3,0,0]}. Error: if \\spad{k} is negative or too big. Note: counting of subtrees is done by \\spadfunFrom{numberOfImproperPartitions}{SymmetricGroupCombinatoricFunctions}.")) (|subSet| (((|List| (|Integer|)) (|Integer|) (|Integer|) (|Integer|)) "\\spad{subSet(n,m,k)} calculates the {\\em k}\\spad{-}th {\\em m}-subset of the set {\\em 0,1,...,(n-1)} in the lexicographic order considered as a decreasing map from {\\em 0,...,(m-1)} into {\\em 0,...,(n-1)}. See \\spad{S}.\\spad{G}. Williamson: Theorem 1.60. Error: if not {\\em (0 <= m <= n and 0 < = k < (n choose m))}.")) (|numberOfImproperPartitions| (((|Integer|) (|Integer|) (|Integer|)) "\\spad{numberOfImproperPartitions(n,m)} computes the number of partitions of the nonnegative integer \\spad{n} in \\spad{m} nonnegative parts with regarding the order (improper partitions). Example: {\\em numberOfImproperPartitions (3,3)} is 10,{} since {\\em [0,0,3], [0,1,2], [0,2,1], [0,3,0], [1,0,2], [1,1,1], [1,2,0], [2,0,1], [2,1,0], [3,0,0]} are the possibilities. Note: this operation has a recursive implementation.")) (|nextPartition| (((|Vector| (|Integer|)) (|List| (|Integer|)) (|Vector| (|Integer|)) (|Integer|)) "\\spad{nextPartition(gamma,part,number)} generates the partition of {\\em number} which follows {\\em part} according to the right-to-left lexicographical order. The partition has the property that its components do not exceed the corresponding components of {\\em gamma}. the first partition is achieved by {\\em part=[]}. Also,{} {\\em []} indicates that {\\em part} is the last partition.") (((|Vector| (|Integer|)) (|Vector| (|Integer|)) (|Vector| (|Integer|)) (|Integer|)) "\\spad{nextPartition(gamma,part,number)} generates the partition of {\\em number} which follows {\\em part} according to the right-to-left lexicographical order. The partition has the property that its components do not exceed the corresponding components of {\\em gamma}. The first partition is achieved by {\\em part=[]}. Also,{} {\\em []} indicates that {\\em part} is the last partition.")) (|nextLatticePermutation| (((|List| (|Integer|)) (|List| (|PositiveInteger|)) (|List| (|Integer|)) (|Boolean|)) "\\spad{nextLatticePermutation(lambda,lattP,constructNotFirst)} generates the lattice permutation according to the proper partition {\\em lambda} succeeding the lattice permutation {\\em lattP} in lexicographical order as long as {\\em constructNotFirst} is \\spad{true}. If {\\em constructNotFirst} is \\spad{false},{} the first lattice permutation is returned. The result {\\em nil} indicates that {\\em lattP} has no successor.")) (|nextColeman| (((|Matrix| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|)) (|Matrix| (|Integer|))) "\\spad{nextColeman(alpha,beta,C)} generates the next Coleman matrix of column sums {\\em alpha} and row sums {\\em beta} according to the lexicographical order from bottom-to-top. The first Coleman matrix is achieved by {\\em C=new(1,1,0)}. Also,{} {\\em new(1,1,0)} indicates that \\spad{C} is the last Coleman matrix.")) (|makeYoungTableau| (((|Matrix| (|Integer|)) (|List| (|PositiveInteger|)) (|List| (|Integer|))) "\\spad{makeYoungTableau(lambda,gitter)} computes for a given lattice permutation {\\em gitter} and for an improper partition {\\em lambda} the corresponding standard tableau of shape {\\em lambda}. Notes: see {\\em listYoungTableaus}. The entries are from {\\em 0,...,n-1}.")) (|listYoungTableaus| (((|List| (|Matrix| (|Integer|))) (|List| (|PositiveInteger|))) "\\spad{listYoungTableaus(lambda)} where {\\em lambda} is a proper partition generates the list of all standard tableaus of shape {\\em lambda} by means of lattice permutations. The numbers of the lattice permutation are interpreted as column labels. Hence the contents of these lattice permutations are the conjugate of {\\em lambda}. Notes: the functions {\\em nextLatticePermutation} and {\\em makeYoungTableau} are used. The entries are from {\\em 0,...,n-1}.")) (|inverseColeman| (((|List| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|)) (|Matrix| (|Integer|))) "\\spad{inverseColeman(alpha,beta,C)}: there is a bijection from the set of matrices having nonnegative entries and row sums {\\em alpha},{} column sums {\\em beta} to the set of {\\em Salpha - Sbeta} double cosets of the symmetric group {\\em Sn}. ({\\em Salpha} is the Young subgroup corresponding to the improper partition {\\em alpha}). For such a matrix \\spad{C},{} inverseColeman(\\spad{alpha},{}\\spad{beta},{}\\spad{C}) calculates the lexicographical smallest {\\em pi} in the corresponding double coset. Note: the resulting permutation {\\em pi} of {\\em {1,2,...,n}} is given in list form. Notes: the inverse of this map is {\\em coleman}. For details,{} see James/Kerber.")) (|coleman| (((|Matrix| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{coleman(alpha,beta,pi)}: there is a bijection from the set of matrices having nonnegative entries and row sums {\\em alpha},{} column sums {\\em beta} to the set of {\\em Salpha - Sbeta} double cosets of the symmetric group {\\em Sn}. ({\\em Salpha} is the Young subgroup corresponding to the improper partition {\\em alpha}). For a representing element {\\em pi} of such a double coset,{} coleman(\\spad{alpha},{}\\spad{beta},{}\\spad{pi}) generates the Coleman-matrix corresponding to {\\em alpha, beta, pi}. Note: The permutation {\\em pi} of {\\em {1,2,...,n}} has to be given in list form. Note: the inverse of this map is {\\em inverseColeman} (if {\\em pi} is the lexicographical smallest permutation in the coset). For details see James/Kerber."))) NIL NIL -(-1131 S) +(-1130 S) ((|constructor| (NIL "the class of all multiplicative semigroups,{} \\spadignore{i.e.} a set with an associative operation \\spadop{*}. \\blankline")) (** (($ $ (|PositiveInteger|)) "\\spad{x**n} returns the repeated product of \\spad{x} \\spad{n} times,{} \\spadignore{i.e.} exponentiation.")) (* (($ $ $) "\\spad{x*y} returns the product of \\spad{x} and \\spad{y}."))) NIL NIL -(-1132) +(-1131) ((|constructor| (NIL "the class of all multiplicative semigroups,{} \\spadignore{i.e.} a set with an associative operation \\spadop{*}. \\blankline")) (** (($ $ (|PositiveInteger|)) "\\spad{x**n} returns the repeated product of \\spad{x} \\spad{n} times,{} \\spadignore{i.e.} exponentiation.")) (* (($ $ $) "\\spad{x*y} returns the product of \\spad{x} and \\spad{y}."))) NIL NIL -(-1133 |dimtot| |dim1| S) +(-1132 |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}."))) -((-4418 |has| |#3| (-1069)) (-4419 |has| |#3| (-1069)) (-4421 |has| |#3| (-6 -4421)) (-4424 . T)) -((-3956 (-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 (-745))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-814))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-860))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197)))))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1069)))) (|HasCategory| |#3| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#3| (QUOTE (-376))) (-3956 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1069)))) (-3956 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (QUOTE (-745))) (|HasCategory| |#3| (QUOTE (-814))) (-3956 (|HasCategory| |#3| (QUOTE (-814))) (|HasCategory| |#3| (QUOTE (-860)))) (|HasCategory| |#3| (QUOTE (-860))) (|HasCategory| |#3| (QUOTE (-381))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197)))))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197)))) (-3956 (|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 (-745))) (|HasCategory| |#3| (QUOTE (-814))) (|HasCategory| |#3| (QUOTE (-860))) (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|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 (-745))) (|HasCategory| |#3| (QUOTE (-814))) (|HasCategory| |#3| (QUOTE (-860))) (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|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 (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|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 (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-3956 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#3| (QUOTE (-240))) (-3956 (|HasCategory| |#3| (QUOTE (-240))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1069))))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -918) (QUOTE (-1197))))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#3| (QUOTE (-1121))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-745))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-814))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-860))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-745))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-814))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-860))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#3| (QUOTE (-1069)))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-745))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-814))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-860))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558)))))) (|HasCategory| (-558) (QUOTE (-860))) (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1069)))) (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -918) (QUOTE (-1197))))) (-3956 (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#3| (QUOTE (-1069)))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasAttribute| |#3| (QUOTE -4421)) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1069)))) (-12 (|HasCategory| |#3| (QUOTE (-1069))) (|HasCategory| |#3| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#3| (QUOTE (-102))) (-12 (|HasCategory| |#3| (QUOTE (-1121))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))))) -(-1134 R |x|) +((-4417 |has| |#3| (-1068)) (-4418 |has| |#3| (-1068)) (-4420 |has| |#3| (-6 -4420)) (-4423 . T)) +((-3955 (-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 (-744))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-813))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-859))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196)))))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1068)))) (|HasCategory| |#3| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#3| (QUOTE (-376))) (-3955 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1068)))) (-3955 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (QUOTE (-744))) (|HasCategory| |#3| (QUOTE (-813))) (-3955 (|HasCategory| |#3| (QUOTE (-813))) (|HasCategory| |#3| (QUOTE (-859)))) (|HasCategory| |#3| (QUOTE (-859))) (|HasCategory| |#3| (QUOTE (-381))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196)))))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196)))) (-3955 (|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 (-744))) (|HasCategory| |#3| (QUOTE (-813))) (|HasCategory| |#3| (QUOTE (-859))) (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|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 (-744))) (|HasCategory| |#3| (QUOTE (-813))) (|HasCategory| |#3| (QUOTE (-859))) (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|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 (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|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 (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-3955 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#3| (QUOTE (-240))) (-3955 (|HasCategory| |#3| (QUOTE (-240))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1068))))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -917) (QUOTE (-1196))))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#3| (QUOTE (-1120))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-744))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-813))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-859))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-744))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-813))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-859))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#3| (QUOTE (-1068)))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-744))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-813))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-859))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557)))))) (|HasCategory| (-557) (QUOTE (-859))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1068)))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -917) (QUOTE (-1196))))) (-3955 (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#3| (QUOTE (-1068)))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasAttribute| |#3| (QUOTE -4420)) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1068)))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#3| (QUOTE (-102))) (-12 (|HasCategory| |#3| (QUOTE (-1120))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))))) +(-1133 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 ((|HasCategory| |#1| (QUOTE (-464)))) -(-1135) +(-1134) ((|constructor| (NIL "This is the datatype for operation signatures as \\indented{2}{used by the compiler and the interpreter.\\space{2}Note that this domain} \\indented{2}{differs from SignatureAst.} See also: ConstructorCall,{} Domain.")) (|source| (((|List| (|Syntax|)) $) "\\spad{source(s)} returns the list of parameter types of `s'.")) (|target| (((|Syntax|) $) "\\spad{target(s)} returns the target type of the signature `s'.")) (|signature| (($ (|List| (|Syntax|)) (|Syntax|)) "\\spad{signature(s,t)} constructs a Signature object with parameter types indicaded by `s',{} and return type indicated by `t'."))) NIL NIL -(-1136) +(-1135) ((|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 -(-1137 R -3494) +(-1136 R -3493) ((|constructor| (NIL "This package provides functions to determine the sign of an elementary function around a point or infinity.")) (|sign| (((|Union| (|Integer|) #1="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|) #1#) |#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|) #1#) |#2|) "\\spad{sign(f)} returns the sign of \\spad{f} if it is constant everywhere."))) NIL NIL -(-1138 R) +(-1137 R) ((|constructor| (NIL "Find the sign of a rational function around a point or infinity.")) (|sign| (((|Union| (|Integer|) #1="failed") (|Fraction| (|Polynomial| |#1|)) (|Symbol|) (|Fraction| (|Polynomial| |#1|)) (|String|)) "\\spad{sign(f, x, a, s)} returns the sign of \\spad{f} as \\spad{x} nears \\spad{a} from the left (below) if \\spad{s} is the string \\spad{\"left\"},{} or from the right (above) if \\spad{s} is the string \\spad{\"right\"}.") (((|Union| (|Integer|) #1#) (|Fraction| (|Polynomial| |#1|)) (|Symbol|) (|OrderedCompletion| (|Fraction| (|Polynomial| |#1|)))) "\\spad{sign(f, x, a)} returns the sign of \\spad{f} as \\spad{x} approaches \\spad{a},{} from both sides if \\spad{a} is finite.") (((|Union| (|Integer|) #1#) (|Fraction| (|Polynomial| |#1|))) "\\spad{sign f} returns the sign of \\spad{f} if it is constant everywhere."))) NIL NIL -(-1139) +(-1138) ((|constructor| (NIL "\\indented{1}{Package to allow simplify to be called on AlgebraicNumbers} by converting to EXPR(INT)")) (|simplify| (((|Expression| (|Integer|)) (|AlgebraicNumber|)) "\\spad{simplify(an)} applies simplifications to \\spad{an}"))) NIL NIL -(-1140) +(-1139) ((|constructor| (NIL "SingleInteger is intended to support machine integer arithmetic.")) (|Or| (($ $ $) "\\spad{Or(n,m)} returns the bit-by-bit logical {\\em or} of the single integers \\spad{n} and \\spad{m}.")) (|And| (($ $ $) "\\spad{And(n,m)} returns the bit-by-bit logical {\\em and} of the single integers \\spad{n} and \\spad{m}.")) (|Not| (($ $) "\\spad{Not(n)} returns the bit-by-bit logical {\\em not} of the single integer \\spad{n}.")) (|xor| (($ $ $) "\\spad{xor(n,m)} returns the bit-by-bit logical {\\em xor} of the single integers \\spad{n} and \\spad{m}.")) (|noetherian| ((|attribute|) "\\spad{noetherian} all ideals are finitely generated (in fact principal).")) (|canonicalsClosed| ((|attribute|) "\\spad{canonicalClosed} means two positives multiply to give positive.")) (|canonical| ((|attribute|) "\\spad{canonical} means that mathematical equality is implied by data structure equality."))) -((-4412 . T) (-4416 . T) (-4411 . T) (-4422 . T) (-4423 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4411 . T) (-4415 . T) (-4410 . T) (-4421 . T) (-4422 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1141 S) +(-1140 S) ((|constructor| (NIL "A stack is a bag where the last item inserted is the first item extracted.")) (|depth| (((|NonNegativeInteger|) $) "\\spad{depth(s)} returns the number of elements of stack \\spad{s}. Note: \\axiom{depth(\\spad{s}) = \\#s}.")) (|top| ((|#1| $) "\\spad{top(s)} returns the top element \\spad{x} from \\spad{s}; \\spad{s} remains unchanged. Note: Use \\axiom{pop!(\\spad{s})} to obtain \\spad{x} and remove it from \\spad{s}.")) (|pop!| ((|#1| $) "\\spad{pop!(s)} returns the top element \\spad{x},{} destructively removing \\spad{x} from \\spad{s}. Note: Use \\axiom{top(\\spad{s})} to obtain \\spad{x} without removing it from \\spad{s}. Error: if \\spad{s} is empty.")) (|push!| ((|#1| |#1| $) "\\spad{push!(x,s)} pushes \\spad{x} onto stack \\spad{s},{} \\spadignore{i.e.} destructively changing \\spad{s} so as to have a new first (top) element \\spad{x}. Afterwards,{} pop!(\\spad{s}) produces \\spad{x} and pop!(\\spad{s}) produces the original \\spad{s}."))) -((-4424 . T) (-4425 . T)) +((-4423 . T) (-4424 . T)) NIL -(-1142 S |ndim| R |Row| |Col|) +(-1141 S |ndim| R |Row| |Col|) ((|constructor| (NIL "\\spadtype{SquareMatrixCategory} is a general square matrix category which allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and colums returned as objects of type Col.")) (** (($ $ (|Integer|)) "\\spad{m**n} computes an integral power of the matrix \\spad{m}. Error: if the matrix is not invertible.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m},{} if that matrix is invertible and returns \"failed\" otherwise.")) (|minordet| ((|#3| $) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors.")) (|determinant| ((|#3| $) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}.")) (* ((|#4| |#4| $) "\\spad{r * x} is the product of the row vector \\spad{r} and the matrix \\spad{x}. Error: if the dimensions are incompatible.") ((|#5| $ |#5|) "\\spad{x * c} is the product of the matrix \\spad{x} and the column vector \\spad{c}. Error: if the dimensions are incompatible.")) (|diagonalProduct| ((|#3| $) "\\spad{diagonalProduct(m)} returns the product of the elements on the diagonal of the matrix \\spad{m}.")) (|trace| ((|#3| $) "\\spad{trace(m)} returns the trace of the matrix \\spad{m}. this is the sum of the elements on the diagonal of the matrix \\spad{m}.")) (|diagonal| ((|#4| $) "\\spad{diagonal(m)} returns a row consisting of the elements on the diagonal of the matrix \\spad{m}.")) (|diagonalMatrix| (($ (|List| |#3|)) "\\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \\spad{l} on the diagonal.")) (|scalarMatrix| (($ |#3|) "\\spad{scalarMatrix(r)} returns an \\spad{n}-by-\\spad{n} matrix with \\spad{r}'s on the diagonal and zeroes elsewhere."))) NIL -((|HasCategory| |#3| (QUOTE (-376))) (|HasAttribute| |#3| (QUOTE (-4426 "*"))) (|HasCategory| |#3| (QUOTE (-175)))) -(-1143 |ndim| R |Row| |Col|) +((|HasCategory| |#3| (QUOTE (-376))) (|HasAttribute| |#3| (QUOTE (-4425 "*"))) (|HasCategory| |#3| (QUOTE (-175)))) +(-1142 |ndim| R |Row| |Col|) ((|constructor| (NIL "\\spadtype{SquareMatrixCategory} is a general square matrix category which allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and colums returned as objects of type Col.")) (** (($ $ (|Integer|)) "\\spad{m**n} computes an integral power of the matrix \\spad{m}. Error: if the matrix is not invertible.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m},{} if that matrix is invertible and returns \"failed\" otherwise.")) (|minordet| ((|#2| $) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors.")) (|determinant| ((|#2| $) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}.")) (* ((|#3| |#3| $) "\\spad{r * x} is the product of the row vector \\spad{r} and the matrix \\spad{x}. Error: if the dimensions are incompatible.") ((|#4| $ |#4|) "\\spad{x * c} is the product of the matrix \\spad{x} and the column vector \\spad{c}. Error: if the dimensions are incompatible.")) (|diagonalProduct| ((|#2| $) "\\spad{diagonalProduct(m)} returns the product of the elements on the diagonal of the matrix \\spad{m}.")) (|trace| ((|#2| $) "\\spad{trace(m)} returns the trace of the matrix \\spad{m}. this is the sum of the elements on the diagonal of the matrix \\spad{m}.")) (|diagonal| ((|#3| $) "\\spad{diagonal(m)} returns a row consisting of the elements on the diagonal of the matrix \\spad{m}.")) (|diagonalMatrix| (($ (|List| |#2|)) "\\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \\spad{l} on the diagonal.")) (|scalarMatrix| (($ |#2|) "\\spad{scalarMatrix(r)} returns an \\spad{n}-by-\\spad{n} matrix with \\spad{r}'s on the diagonal and zeroes elsewhere."))) -((-4424 . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4423 . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1144 R |Row| |Col| M) +(-1143 R |Row| |Col| M) ((|constructor| (NIL "\\spadtype{SmithNormalForm} is a package which provides some standard canonical forms for matrices.")) (|diophantineSystem| (((|Record| (|:| |particular| (|Union| |#3| "failed")) (|:| |basis| (|List| |#3|))) |#4| |#3|) "\\spad{diophantineSystem(A,B)} returns a particular integer solution and an integer basis of the equation \\spad{AX = B}.")) (|completeSmith| (((|Record| (|:| |Smith| |#4|) (|:| |leftEqMat| |#4|) (|:| |rightEqMat| |#4|)) |#4|) "\\spad{completeSmith} returns a record that contains the Smith normal form \\spad{H} of the matrix and the left and right equivalence matrices \\spad{U} and \\spad{V} such that U*m*v = \\spad{H}")) (|smith| ((|#4| |#4|) "\\spad{smith(m)} returns the Smith Normal form of the matrix \\spad{m}.")) (|completeHermite| (((|Record| (|:| |Hermite| |#4|) (|:| |eqMat| |#4|)) |#4|) "\\spad{completeHermite} returns a record that contains the Hermite normal form \\spad{H} of the matrix and the equivalence matrix \\spad{U} such that U*m = \\spad{H}")) (|hermite| ((|#4| |#4|) "\\spad{hermite(m)} returns the Hermite normal form of the matrix \\spad{m}."))) NIL NIL -(-1145 R |VarSet|) +(-1144 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."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-928))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547))))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4422)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) -(-1146 |Coef| |Var| SMP) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-927))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546))))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4421)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) +(-1145 |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}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-376)))) -(-1147 R E V P) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-376)))) +(-1146 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}"))) -((-4425 . T) (-4424 . T)) +((-4424 . T) (-4423 . T)) NIL -(-1148 UP -3494) +(-1147 UP -3493) ((|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 -(-1149 R) +(-1148 R) ((|constructor| (NIL "This package tries to find solutions expressed in terms of radicals for systems of equations of rational functions with coefficients in an integral domain \\spad{R}.")) (|contractSolve| (((|SuchThat| (|List| (|Expression| |#1|)) (|List| (|Equation| (|Expression| |#1|)))) (|Fraction| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{contractSolve(rf,x)} finds the solutions expressed in terms of radicals of the equation \\spad{rf} = 0 with respect to the symbol \\spad{x},{} where \\spad{rf} is a rational function. The result contains new symbols for common subexpressions in order to reduce the size of the output.") (((|SuchThat| (|List| (|Expression| |#1|)) (|List| (|Equation| (|Expression| |#1|)))) (|Equation| (|Fraction| (|Polynomial| |#1|))) (|Symbol|)) "\\spad{contractSolve(eq,x)} finds the solutions expressed in terms of radicals of the equation of rational functions \\spad{eq} with respect to the symbol \\spad{x}. The result contains new symbols for common subexpressions in order to reduce the size of the output.")) (|radicalRoots| (((|List| (|List| (|Expression| |#1|))) (|List| (|Fraction| (|Polynomial| |#1|))) (|List| (|Symbol|))) "\\spad{radicalRoots(lrf,lvar)} finds the roots expressed in terms of radicals of the list of rational functions \\spad{lrf} with respect to the list of symbols \\spad{lvar}.") (((|List| (|Expression| |#1|)) (|Fraction| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{radicalRoots(rf,x)} finds the roots expressed in terms of radicals of the rational function \\spad{rf} with respect to the symbol \\spad{x}.")) (|radicalSolve| (((|List| (|List| (|Equation| (|Expression| |#1|)))) (|List| (|Equation| (|Fraction| (|Polynomial| |#1|))))) "\\spad{radicalSolve(leq)} finds the solutions expressed in terms of radicals of the system of equations of rational functions \\spad{leq} with respect to the unique symbol \\spad{x} appearing in \\spad{leq}.") (((|List| (|List| (|Equation| (|Expression| |#1|)))) (|List| (|Equation| (|Fraction| (|Polynomial| |#1|)))) (|List| (|Symbol|))) "\\spad{radicalSolve(leq,lvar)} finds the solutions expressed in terms of radicals of the system of equations of rational functions \\spad{leq} with respect to the list of symbols \\spad{lvar}.") (((|List| (|List| (|Equation| (|Expression| |#1|)))) (|List| (|Fraction| (|Polynomial| |#1|)))) "\\spad{radicalSolve(lrf)} finds the solutions expressed in terms of radicals of the system of equations \\spad{lrf} = 0,{} where \\spad{lrf} is a system of univariate rational functions.") (((|List| (|List| (|Equation| (|Expression| |#1|)))) (|List| (|Fraction| (|Polynomial| |#1|))) (|List| (|Symbol|))) "\\spad{radicalSolve(lrf,lvar)} finds the solutions expressed in terms of radicals of the system of equations \\spad{lrf} = 0 with respect to the list of symbols \\spad{lvar},{} where \\spad{lrf} is a list of rational functions.") (((|List| (|Equation| (|Expression| |#1|))) (|Equation| (|Fraction| (|Polynomial| |#1|)))) "\\spad{radicalSolve(eq)} finds the solutions expressed in terms of radicals of the equation of rational functions \\spad{eq} with respect to the unique symbol \\spad{x} appearing in \\spad{eq}.") (((|List| (|Equation| (|Expression| |#1|))) (|Equation| (|Fraction| (|Polynomial| |#1|))) (|Symbol|)) "\\spad{radicalSolve(eq,x)} finds the solutions expressed in terms of radicals of the equation of rational functions \\spad{eq} with respect to the symbol \\spad{x}.") (((|List| (|Equation| (|Expression| |#1|))) (|Fraction| (|Polynomial| |#1|))) "\\spad{radicalSolve(rf)} finds the solutions expressed in terms of radicals of the equation \\spad{rf} = 0,{} where \\spad{rf} is a univariate rational function.") (((|List| (|Equation| (|Expression| |#1|))) (|Fraction| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{radicalSolve(rf,x)} finds the solutions expressed in terms of radicals of the equation \\spad{rf} = 0 with respect to the symbol \\spad{x},{} where \\spad{rf} is a rational function."))) NIL NIL -(-1150 R) +(-1149 R) ((|constructor| (NIL "This package finds the function \\spad{func3} where \\spad{func1} and \\spad{func2} \\indented{1}{are given and\\space{2}\\spad{func1} = \\spad{func3}(\\spad{func2}) .\\space{2}If there is no solution then} \\indented{1}{function \\spad{func1} will be returned.} \\indented{1}{An example would be\\space{2}\\spad{func1:= 8*X**3+32*X**2-14*X ::EXPR INT} and} \\indented{1}{\\spad{func2:=2*X ::EXPR INT} convert them via univariate} \\indented{1}{to FRAC SUP EXPR INT and then the solution is \\spad{func3:=X**3+X**2-X}} \\indented{1}{of type FRAC SUP EXPR INT}")) (|unvectorise| (((|Fraction| (|SparseUnivariatePolynomial| (|Expression| |#1|))) (|Vector| (|Expression| |#1|)) (|Fraction| (|SparseUnivariatePolynomial| (|Expression| |#1|))) (|Integer|)) "\\spad{unvectorise(vect, var, n)} returns \\spad{vect(1) + vect(2)*var + ... + vect(n+1)*var**(n)} where \\spad{vect} is the vector of the coefficients of the polynomail ,{} \\spad{var} the new variable and \\spad{n} the degree.")) (|decomposeFunc| (((|Fraction| (|SparseUnivariatePolynomial| (|Expression| |#1|))) (|Fraction| (|SparseUnivariatePolynomial| (|Expression| |#1|))) (|Fraction| (|SparseUnivariatePolynomial| (|Expression| |#1|))) (|Fraction| (|SparseUnivariatePolynomial| (|Expression| |#1|)))) "\\spad{decomposeFunc(func1, func2, newvar)} returns a function \\spad{func3} where \\spad{func1} = \\spad{func3}(\\spad{func2}) and expresses it in the new variable newvar. If there is no solution then \\spad{func1} will be returned."))) NIL NIL -(-1151 R) +(-1150 R) ((|constructor| (NIL "This package tries to find solutions of equations of type Expression(\\spad{R}). This means expressions involving transcendental,{} exponential,{} logarithmic and nthRoot functions. After trying to transform different kernels to one kernel by applying several rules,{} it calls zerosOf for the SparseUnivariatePolynomial in the remaining kernel. For example the expression \\spad{sin(x)*cos(x)-2} will be transformed to \\indented{3}{\\spad{-2 tan(x/2)**4 -2 tan(x/2)**3 -4 tan(x/2)**2 +2 tan(x/2) -2}} by using the function normalize and then to \\indented{3}{\\spad{-2 tan(x)**2 + tan(x) -2}} with help of subsTan. This function tries to express the given function in terms of \\spad{tan(x/2)} to express in terms of \\spad{tan(x)} . Other examples are the expressions \\spad{sqrt(x+1)+sqrt(x+7)+1} or \\indented{1}{\\spad{sqrt(sin(x))+1} .}")) (|solve| (((|List| (|List| (|Equation| (|Expression| |#1|)))) (|List| (|Equation| (|Expression| |#1|))) (|List| (|Symbol|))) "\\spad{solve(leqs, lvar)} returns a list of solutions to the list of equations \\spad{leqs} with respect to the list of symbols lvar.") (((|List| (|Equation| (|Expression| |#1|))) (|Expression| |#1|) (|Symbol|)) "\\spad{solve(expr,x)} finds the solutions of the equation \\spad{expr} = 0 with respect to the symbol \\spad{x} where \\spad{expr} is a function of type Expression(\\spad{R}).") (((|List| (|Equation| (|Expression| |#1|))) (|Equation| (|Expression| |#1|)) (|Symbol|)) "\\spad{solve(eq,x)} finds the solutions of the equation \\spad{eq} where \\spad{eq} is an equation of functions of type Expression(\\spad{R}) with respect to the symbol \\spad{x}.") (((|List| (|Equation| (|Expression| |#1|))) (|Equation| (|Expression| |#1|))) "\\spad{solve(eq)} finds the solutions of the equation \\spad{eq} where \\spad{eq} is an equation of functions of type Expression(\\spad{R}) with respect to the unique symbol \\spad{x} appearing in \\spad{eq}.") (((|List| (|Equation| (|Expression| |#1|))) (|Expression| |#1|)) "\\spad{solve(expr)} finds the solutions of the equation \\spad{expr} = 0 where \\spad{expr} is a function of type Expression(\\spad{R}) with respect to the unique symbol \\spad{x} appearing in eq."))) NIL NIL -(-1152 S A) +(-1151 S A) ((|constructor| (NIL "This package exports sorting algorithnms")) (|insertionSort!| ((|#2| |#2|) "\\spad{insertionSort! }\\undocumented") ((|#2| |#2| (|Mapping| (|Boolean|) |#1| |#1|)) "\\spad{insertionSort!(a,f)} \\undocumented")) (|bubbleSort!| ((|#2| |#2|) "\\spad{bubbleSort!(a)} \\undocumented") ((|#2| |#2| (|Mapping| (|Boolean|) |#1| |#1|)) "\\spad{bubbleSort!(a,f)} \\undocumented"))) NIL -((|HasCategory| |#1| (QUOTE (-860)))) -(-1153 R) +((|HasCategory| |#1| (QUOTE (-859)))) +(-1152 R) ((|constructor| (NIL "The domain ThreeSpace is used for creating three dimensional objects using functions for defining points,{} curves,{} polygons,{} constructs and the subspaces containing them."))) NIL NIL -(-1154 R) +(-1153 R) ((|constructor| (NIL "The category ThreeSpaceCategory is used for creating three dimensional objects using functions for defining points,{} curves,{} polygons,{} constructs and the subspaces containing them.")) (|coerce| (((|OutputForm|) $) "\\spad{coerce(s)} returns the \\spadtype{ThreeSpace} \\spad{s} to Output format.")) (|subspace| (((|SubSpace| 3 |#1|) $) "\\spad{subspace(s)} returns the \\spadtype{SubSpace} which holds all the point information in the \\spadtype{ThreeSpace},{} \\spad{s}.")) (|check| (($ $) "\\spad{check(s)} returns lllpt,{} list of lists of lists of point information about the \\spadtype{ThreeSpace} \\spad{s}.")) (|objects| (((|Record| (|:| |points| (|NonNegativeInteger|)) (|:| |curves| (|NonNegativeInteger|)) (|:| |polygons| (|NonNegativeInteger|)) (|:| |constructs| (|NonNegativeInteger|))) $) "\\spad{objects(s)} returns the \\spadtype{ThreeSpace},{} \\spad{s},{} in the form of a 3D object record containing information on the number of points,{} curves,{} polygons and constructs comprising the \\spadtype{ThreeSpace}..")) (|lprop| (((|List| (|SubSpaceComponentProperty|)) $) "\\spad{lprop(s)} checks to see if the \\spadtype{ThreeSpace},{} \\spad{s},{} is composed of a list of subspace component properties,{} and if so,{} returns the list; An error is signaled otherwise.")) (|llprop| (((|List| (|List| (|SubSpaceComponentProperty|))) $) "\\spad{llprop(s)} checks to see if the \\spadtype{ThreeSpace},{} \\spad{s},{} is composed of a list of curves which are lists of the subspace component properties of the curves,{} and if so,{} returns the list of lists; An error is signaled otherwise.")) (|lllp| (((|List| (|List| (|List| (|Point| |#1|)))) $) "\\spad{lllp(s)} checks to see if the \\spadtype{ThreeSpace},{} \\spad{s},{} is composed of a list of components,{} which are lists of curves,{} which are lists of points,{} and if so,{} returns the list of lists of lists; An error is signaled otherwise.")) (|lllip| (((|List| (|List| (|List| (|NonNegativeInteger|)))) $) "\\spad{lllip(s)} checks to see if the \\spadtype{ThreeSpace},{} \\spad{s},{} is composed of a list of components,{} which are lists of curves,{} which are lists of indices to points,{} and if so,{} returns the list of lists of lists; An error is signaled otherwise.")) (|lp| (((|List| (|Point| |#1|)) $) "\\spad{lp(s)} returns the list of points component which the \\spadtype{ThreeSpace},{} \\spad{s},{} contains; these points are used by reference,{} \\spadignore{i.e.} the component holds indices referring to the points rather than the points themselves. This allows for sharing of the points.")) (|mesh?| (((|Boolean|) $) "\\spad{mesh?(s)} returns \\spad{true} if the \\spadtype{ThreeSpace} \\spad{s} is composed of one component,{} a mesh comprising a list of curves which are lists of points,{} or returns \\spad{false} if otherwise")) (|mesh| (((|List| (|List| (|Point| |#1|))) $) "\\spad{mesh(s)} checks to see if the \\spadtype{ThreeSpace},{} \\spad{s},{} is composed of a single surface component defined by a list curves which contain lists of points,{} and if so,{} returns the list of lists of points; An error is signaled otherwise.") (($ (|List| (|List| (|Point| |#1|))) (|Boolean|) (|Boolean|)) "\\spad{mesh([[p0],[p1],...,[pn]], close1, close2)} creates a surface defined over a list of curves,{} \\spad{p0} through pn,{} which are lists of points; the booleans \\spad{close1} and \\spad{close2} indicate how the surface is to be closed: \\spad{close1} set to \\spad{true} means that each individual list (a curve) is to be closed (that is,{} the last point of the list is to be connected to the first point); \\spad{close2} set to \\spad{true} means that the boundary at one end of the surface is to be connected to the boundary at the other end (the boundaries are defined as the first list of points (curve) and the last list of points (curve)); the \\spadtype{ThreeSpace} containing this surface is returned.") (($ (|List| (|List| (|Point| |#1|)))) "\\spad{mesh([[p0],[p1],...,[pn]])} creates a surface defined by a list of curves which are lists,{} \\spad{p0} through pn,{} of points,{} and returns a \\spadtype{ThreeSpace} whose component is the surface.") (($ $ (|List| (|List| (|List| |#1|))) (|Boolean|) (|Boolean|)) "\\spad{mesh(s,[ [[r10]...,[r1m]], [[r20]...,[r2m]],..., [[rn0]...,[rnm]] ], close1, close2)} adds a surface component to the \\spadtype{ThreeSpace} \\spad{s},{} which is defined over a rectangular domain of size WxH where \\spad{W} is the number of lists of points from the domain \\spad{PointDomain(R)} and \\spad{H} is the number of elements in each of those lists; the booleans \\spad{close1} and \\spad{close2} indicate how the surface is to be closed: if \\spad{close1} is \\spad{true} this means that each individual list (a curve) is to be closed (\\spadignore{i.e.} the last point of the list is to be connected to the first point); if \\spad{close2} is \\spad{true},{} this means that the boundary at one end of the surface is to be connected to the boundary at the other end (the boundaries are defined as the first list of points (curve) and the last list of points (curve)).") (($ $ (|List| (|List| (|Point| |#1|))) (|Boolean|) (|Boolean|)) "\\spad{mesh(s,[[p0],[p1],...,[pn]], close1, close2)} adds a surface component to the \\spadtype{ThreeSpace},{} which is defined over a list of curves,{} in which each of these curves is a list of points. The boolean arguments \\spad{close1} and \\spad{close2} indicate how the surface is to be closed. Argument \\spad{close1} equal \\spad{true} means that each individual list (a curve) is to be closed,{} \\spadignore{i.e.} the last point of the list is to be connected to the first point. Argument \\spad{close2} equal \\spad{true} means that the boundary at one end of the surface is to be connected to the boundary at the other end,{} \\spadignore{i.e.} the boundaries are defined as the first list of points (curve) and the last list of points (curve).") (($ $ (|List| (|List| (|List| |#1|))) (|List| (|SubSpaceComponentProperty|)) (|SubSpaceComponentProperty|)) "\\spad{mesh(s,[ [[r10]...,[r1m]], [[r20]...,[r2m]],..., [[rn0]...,[rnm]] ], [props], prop)} adds a surface component to the \\spadtype{ThreeSpace} \\spad{s},{} which is defined over a rectangular domain of size WxH where \\spad{W} is the number of lists of points from the domain \\spad{PointDomain(R)} and \\spad{H} is the number of elements in each of those lists; lprops is the list of the subspace component properties for each curve list,{} and prop is the subspace component property by which the points are defined.") (($ $ (|List| (|List| (|Point| |#1|))) (|List| (|SubSpaceComponentProperty|)) (|SubSpaceComponentProperty|)) "\\spad{mesh(s,[[p0],[p1],...,[pn]],[props],prop)} adds a surface component,{} defined over a list curves which contains lists of points,{} to the \\spadtype{ThreeSpace} \\spad{s}; props is a list which contains the subspace component properties for each surface parameter,{} and \\spad{prop} is the subspace component property by which the points are defined.")) (|polygon?| (((|Boolean|) $) "\\spad{polygon?(s)} returns \\spad{true} if the \\spadtype{ThreeSpace} \\spad{s} contains a single polygon component,{} or \\spad{false} otherwise.")) (|polygon| (((|List| (|Point| |#1|)) $) "\\spad{polygon(s)} checks to see if the \\spadtype{ThreeSpace},{} \\spad{s},{} is composed of a single polygon component defined by a list of points,{} and if so,{} returns the list of points; An error is signaled otherwise.") (($ (|List| (|Point| |#1|))) "\\spad{polygon([p0,p1,...,pn])} creates a polygon defined by a list of points,{} \\spad{p0} through pn,{} and returns a \\spadtype{ThreeSpace} whose component is the polygon.") (($ $ (|List| (|List| |#1|))) "\\spad{polygon(s,[[r0],[r1],...,[rn]])} adds a polygon component defined by a list of points \\spad{r0} through \\spad{rn},{} which are lists of elements from the domain \\spad{PointDomain(m,R)} to the \\spadtype{ThreeSpace} \\spad{s},{} where \\spad{m} is the dimension of the points and \\spad{R} is the \\spadtype{Ring} over which the points are defined.") (($ $ (|List| (|Point| |#1|))) "\\spad{polygon(s,[p0,p1,...,pn])} adds a polygon component defined by a list of points,{} \\spad{p0} throught pn,{} to the \\spadtype{ThreeSpace} \\spad{s}.")) (|closedCurve?| (((|Boolean|) $) "\\spad{closedCurve?(s)} returns \\spad{true} if the \\spadtype{ThreeSpace} \\spad{s} contains a single closed curve component,{} \\spadignore{i.e.} the first element of the curve is also the last element,{} or \\spad{false} otherwise.")) (|closedCurve| (((|List| (|Point| |#1|)) $) "\\spad{closedCurve(s)} checks to see if the \\spadtype{ThreeSpace},{} \\spad{s},{} is composed of a single closed curve component defined by a list of points in which the first point is also the last point,{} all of which are from the domain \\spad{PointDomain(m,R)} and if so,{} returns the list of points. An error is signaled otherwise.") (($ (|List| (|Point| |#1|))) "\\spad{closedCurve(lp)} sets a list of points defined by the first element of \\spad{lp} through the last element of \\spad{lp} and back to the first elelment again and returns a \\spadtype{ThreeSpace} whose component is the closed curve defined by \\spad{lp}.") (($ $ (|List| (|List| |#1|))) "\\spad{closedCurve(s,[[lr0],[lr1],...,[lrn],[lr0]])} adds a closed curve component defined by a list of points \\spad{lr0} through \\spad{lrn},{} which are lists of elements from the domain \\spad{PointDomain(m,R)},{} where \\spad{R} is the \\spadtype{Ring} over which the point elements are defined and \\spad{m} is the dimension of the points,{} in which the last element of the list of points contains a copy of the first element list,{} \\spad{lr0}. The closed curve is added to the \\spadtype{ThreeSpace},{} \\spad{s}.") (($ $ (|List| (|Point| |#1|))) "\\spad{closedCurve(s,[p0,p1,...,pn,p0])} adds a closed curve component which is a list of points defined by the first element \\spad{p0} through the last element \\spad{pn} and back to the first element \\spad{p0} again,{} to the \\spadtype{ThreeSpace} \\spad{s}.")) (|curve?| (((|Boolean|) $) "\\spad{curve?(s)} queries whether the \\spadtype{ThreeSpace},{} \\spad{s},{} is a curve,{} \\spadignore{i.e.} has one component,{} a list of list of points,{} and returns \\spad{true} if it is,{} or \\spad{false} otherwise.")) (|curve| (((|List| (|Point| |#1|)) $) "\\spad{curve(s)} checks to see if the \\spadtype{ThreeSpace},{} \\spad{s},{} is composed of a single curve defined by a list of points and if so,{} returns the curve,{} \\spadignore{i.e.} list of points. An error is signaled otherwise.") (($ (|List| (|Point| |#1|))) "\\spad{curve([p0,p1,p2,...,pn])} creates a space curve defined by the list of points \\spad{p0} through \\spad{pn},{} and returns the \\spadtype{ThreeSpace} whose component is the curve.") (($ $ (|List| (|List| |#1|))) "\\spad{curve(s,[[p0],[p1],...,[pn]])} adds a space curve which is a list of points \\spad{p0} through pn defined by lists of elements from the domain \\spad{PointDomain(m,R)},{} where \\spad{R} is the \\spadtype{Ring} over which the point elements are defined and \\spad{m} is the dimension of the points,{} to the \\spadtype{ThreeSpace} \\spad{s}.") (($ $ (|List| (|Point| |#1|))) "\\spad{curve(s,[p0,p1,...,pn])} adds a space curve component defined by a list of points \\spad{p0} through \\spad{pn},{} to the \\spadtype{ThreeSpace} \\spad{s}.")) (|point?| (((|Boolean|) $) "\\spad{point?(s)} queries whether the \\spadtype{ThreeSpace},{} \\spad{s},{} is composed of a single component which is a point and returns the boolean result.")) (|point| (((|Point| |#1|) $) "\\spad{point(s)} checks to see if the \\spadtype{ThreeSpace},{} \\spad{s},{} is composed of only a single point and if so,{} returns the point. An error is signaled otherwise.") (($ (|Point| |#1|)) "\\spad{point(p)} returns a \\spadtype{ThreeSpace} object which is composed of one component,{} the point \\spad{p}.") (($ $ (|NonNegativeInteger|)) "\\spad{point(s,i)} adds a point component which is placed into a component list of the \\spadtype{ThreeSpace},{} \\spad{s},{} at the index given by \\spad{i}.") (($ $ (|List| |#1|)) "\\spad{point(s,[x,y,z])} adds a point component defined by a list of elements which are from the \\spad{PointDomain(R)} to the \\spadtype{ThreeSpace},{} \\spad{s},{} where \\spad{R} is the \\spadtype{Ring} over which the point elements are defined.") (($ $ (|Point| |#1|)) "\\spad{point(s,p)} adds a point component defined by the point,{} \\spad{p},{} specified as a list from \\spad{List(R)},{} to the \\spadtype{ThreeSpace},{} \\spad{s},{} where \\spad{R} is the \\spadtype{Ring} over which the point is defined.")) (|modifyPointData| (($ $ (|NonNegativeInteger|) (|Point| |#1|)) "\\spad{modifyPointData(s,i,p)} changes the point at the indexed location \\spad{i} in the \\spadtype{ThreeSpace},{} \\spad{s},{} to that of point \\spad{p}. This is useful for making changes to a point which has been transformed.")) (|enterPointData| (((|NonNegativeInteger|) $ (|List| (|Point| |#1|))) "\\spad{enterPointData(s,[p0,p1,...,pn])} adds a list of points from \\spad{p0} through pn to the \\spadtype{ThreeSpace},{} \\spad{s},{} and returns the index,{} to the starting point of the list.")) (|copy| (($ $) "\\spad{copy(s)} returns a new \\spadtype{ThreeSpace} that is an exact copy of \\spad{s}.")) (|composites| (((|List| $) $) "\\spad{composites(s)} takes the \\spadtype{ThreeSpace} \\spad{s},{} and creates a list containing a unique \\spadtype{ThreeSpace} for each single composite of \\spad{s}. If \\spad{s} has no composites defined (composites need to be explicitly created),{} the list returned is empty. Note that not all the components need to be part of a composite.")) (|components| (((|List| $) $) "\\spad{components(s)} takes the \\spadtype{ThreeSpace} \\spad{s},{} and creates a list containing a unique \\spadtype{ThreeSpace} for each single component of \\spad{s}. If \\spad{s} has no components defined,{} the list returned is empty.")) (|composite| (($ (|List| $)) "\\spad{composite([s1,s2,...,sn])} will create a new \\spadtype{ThreeSpace} that is a union of all the components from each \\spadtype{ThreeSpace} in the parameter list,{} grouped as a composite.")) (|merge| (($ $ $) "\\spad{merge(s1,s2)} will create a new \\spadtype{ThreeSpace} that has the components of \\spad{s1} and \\spad{s2}; Groupings of components into composites are maintained.") (($ (|List| $)) "\\spad{merge([s1,s2,...,sn])} will create a new \\spadtype{ThreeSpace} that has the components of all the ones in the list; Groupings of components into composites are maintained.")) (|numberOfComposites| (((|NonNegativeInteger|) $) "\\spad{numberOfComposites(s)} returns the number of supercomponents,{} or composites,{} in the \\spadtype{ThreeSpace},{} \\spad{s}; Composites are arbitrary groupings of otherwise distinct and unrelated components; A \\spadtype{ThreeSpace} need not have any composites defined at all and,{} outside of the requirement that no component can belong to more than one composite at a time,{} the definition and interpretation of composites are unrestricted.")) (|numberOfComponents| (((|NonNegativeInteger|) $) "\\spad{numberOfComponents(s)} returns the number of distinct object components in the indicated \\spadtype{ThreeSpace},{} \\spad{s},{} such as points,{} curves,{} polygons,{} and constructs.")) (|create3Space| (($ (|SubSpace| 3 |#1|)) "\\spad{create3Space(s)} creates a \\spadtype{ThreeSpace} object containing objects pre-defined within some \\spadtype{SubSpace} \\spad{s}.") (($) "\\spad{create3Space()} creates a \\spadtype{ThreeSpace} object capable of holding point,{} curve,{} mesh components and any combination."))) NIL NIL -(-1155) +(-1154) ((|constructor| (NIL "This domain represents a kind of base domain \\indented{2}{for Spad syntax domain.\\space{2}It merely exists as a kind of} \\indented{2}{of abstract base in object-oriented programming language.} \\indented{2}{However,{} this is not an abstract class.}"))) NIL NIL -(-1156) +(-1155) ((|constructor| (NIL "\\indented{1}{This package provides a simple Spad algebra parser.} Related Constructors: Syntax. See Also: Syntax.")) (|parse| (((|List| (|Syntax|)) (|String|)) "\\spad{parse(f)} parses the source file \\spad{f} (supposedly containing Spad algebras) and returns a List Syntax. The filename \\spad{f} is supposed to have the proper extension. Note that this function has the side effect of executing any system command contained in the file \\spad{f},{} even if it might not be meaningful."))) NIL NIL -(-1157) +(-1156) ((|constructor| (NIL "This category describes the exported \\indented{2}{signatures of the SpadAst domain.}")) (|autoCoerce| (((|Integer|) $) "\\spad{autoCoerce(s)} returns the Integer view of `s'. Left at the discretion of the compiler.") (((|String|) $) "\\spad{autoCoerce(s)} returns the String view of `s'. Left at the discretion of the compiler.") (((|Identifier|) $) "\\spad{autoCoerce(s)} returns the Identifier view of `s'. Left at the discretion of the compiler.") (((|IsAst|) $) "\\spad{autoCoerce(s)} returns the IsAst view of `s'. Left at the discretion of the compiler.") (((|HasAst|) $) "\\spad{autoCoerce(s)} returns the HasAst view of `s'. Left at the discretion of the compiler.") (((|CaseAst|) $) "\\spad{autoCoerce(s)} returns the CaseAst view of `s'. Left at the discretion of the compiler.") (((|ColonAst|) $) "\\spad{autoCoerce(s)} returns the ColoonAst view of `s'. Left at the discretion of the compiler.") (((|SuchThatAst|) $) "\\spad{autoCoerce(s)} returns the SuchThatAst view of `s'. Left at the discretion of the compiler.") (((|LetAst|) $) "\\spad{autoCoerce(s)} returns the LetAst view of `s'. Left at the discretion of the compiler.") (((|SequenceAst|) $) "\\spad{autoCoerce(s)} returns the SequenceAst view of `s'. Left at the discretion of the compiler.") (((|SegmentAst|) $) "\\spad{autoCoerce(s)} returns the SegmentAst view of `s'. Left at the discretion of the compiler.") (((|RestrictAst|) $) "\\spad{autoCoerce(s)} returns the RestrictAst view of `s'. Left at the discretion of the compiler.") (((|PretendAst|) $) "\\spad{autoCoerce(s)} returns the PretendAst view of `s'. Left at the discretion of the compiler.") (((|CoerceAst|) $) "\\spad{autoCoerce(s)} returns the CoerceAst view of `s'. Left at the discretion of the compiler.") (((|ReturnAst|) $) "\\spad{autoCoerce(s)} returns the ReturnAst view of `s'. Left at the discretion of the compiler.") (((|ExitAst|) $) "\\spad{autoCoerce(s)} returns the ExitAst view of `s'. Left at the discretion of the compiler.") (((|ConstructAst|) $) "\\spad{autoCoerce(s)} returns the ConstructAst view of `s'. Left at the discretion of the compiler.") (((|CollectAst|) $) "\\spad{autoCoerce(s)} returns the CollectAst view of `s'. Left at the discretion of the compiler.") (((|StepAst|) $) "\\spad{autoCoerce(s)} returns the InAst view of \\spad{s}. Left at the discretion of the compiler.") (((|InAst|) $) "\\spad{autoCoerce(s)} returns the InAst view of `s'. Left at the discretion of the compiler.") (((|WhileAst|) $) "\\spad{autoCoerce(s)} returns the WhileAst view of `s'. Left at the discretion of the compiler.") (((|RepeatAst|) $) "\\spad{autoCoerce(s)} returns the RepeatAst view of `s'. Left at the discretion of the compiler.") (((|IfAst|) $) "\\spad{autoCoerce(s)} returns the IfAst view of `s'. Left at the discretion of the compiler.") (((|MappingAst|) $) "\\spad{autoCoerce(s)} returns the MappingAst view of `s'. Left at the discretion of the compiler.") (((|AttributeAst|) $) "\\spad{autoCoerce(s)} returns the AttributeAst view of `s'. Left at the discretion of the compiler.") (((|SignatureAst|) $) "\\spad{autoCoerce(s)} returns the SignatureAst view of `s'. Left at the discretion of the compiler.") (((|CapsuleAst|) $) "\\spad{autoCoerce(s)} returns the CapsuleAst view of `s'. Left at the discretion of the compiler.") (((|JoinAst|) $) "\\spad{autoCoerce(s)} returns the \\spadype{JoinAst} view of of the AST object \\spad{s}. Left at the discretion of the compiler.") (((|CategoryAst|) $) "\\spad{autoCoerce(s)} returns the CategoryAst view of `s'. Left at the discretion of the compiler.") (((|WhereAst|) $) "\\spad{autoCoerce(s)} returns the WhereAst view of `s'. Left at the discretion of the compiler.") (((|MacroAst|) $) "\\spad{autoCoerce(s)} returns the MacroAst view of `s'. Left at the discretion of the compiler.") (((|DefinitionAst|) $) "\\spad{autoCoerce(s)} returns the DefinitionAst view of `s'. Left at the discretion of the compiler.") (((|ImportAst|) $) "\\spad{autoCoerce(s)} returns the ImportAst view of `s'. Left at the discretion of the compiler.")) (|case| (((|Boolean|) $ (|[\|\|]| (|Integer|))) "\\spad{s case Integer} holds if `s' represents an integer literal.") (((|Boolean|) $ (|[\|\|]| (|String|))) "\\spad{s case String} holds if `s' represents a string literal.") (((|Boolean|) $ (|[\|\|]| (|Identifier|))) "\\spad{s case Identifier} holds if `s' represents an identifier.") (((|Boolean|) $ (|[\|\|]| (|IsAst|))) "\\spad{s case IsAst} holds if `s' represents an is-expression.") (((|Boolean|) $ (|[\|\|]| (|HasAst|))) "\\spad{s case HasAst} holds if `s' represents a has-expression.") (((|Boolean|) $ (|[\|\|]| (|CaseAst|))) "\\spad{s case CaseAst} holds if `s' represents a case-expression.") (((|Boolean|) $ (|[\|\|]| (|ColonAst|))) "\\spad{s case ColonAst} holds if `s' represents a colon-expression.") (((|Boolean|) $ (|[\|\|]| (|SuchThatAst|))) "\\spad{s case SuchThatAst} holds if `s' represents a qualified-expression.") (((|Boolean|) $ (|[\|\|]| (|LetAst|))) "\\spad{s case LetAst} holds if `s' represents an assignment-expression.") (((|Boolean|) $ (|[\|\|]| (|SequenceAst|))) "\\spad{s case SequenceAst} holds if `s' represents a sequence-of-statements.") (((|Boolean|) $ (|[\|\|]| (|SegmentAst|))) "\\spad{s case SegmentAst} holds if `s' represents a segment-expression.") (((|Boolean|) $ (|[\|\|]| (|RestrictAst|))) "\\spad{s case RestrictAst} holds if `s' represents a restrict-expression.") (((|Boolean|) $ (|[\|\|]| (|PretendAst|))) "\\spad{s case PretendAst} holds if `s' represents a pretend-expression.") (((|Boolean|) $ (|[\|\|]| (|CoerceAst|))) "\\spad{s case ReturnAst} holds if `s' represents a coerce-expression.") (((|Boolean|) $ (|[\|\|]| (|ReturnAst|))) "\\spad{s case ReturnAst} holds if `s' represents a return-statement.") (((|Boolean|) $ (|[\|\|]| (|ExitAst|))) "\\spad{s case ExitAst} holds if `s' represents an exit-expression.") (((|Boolean|) $ (|[\|\|]| (|ConstructAst|))) "\\spad{s case ConstructAst} holds if `s' represents a list-expression.") (((|Boolean|) $ (|[\|\|]| (|CollectAst|))) "\\spad{s case CollectAst} holds if `s' represents a list-comprehension.") (((|Boolean|) $ (|[\|\|]| (|StepAst|))) "\\spad{s case StepAst} holds if \\spad{s} represents an arithmetic progression iterator.") (((|Boolean|) $ (|[\|\|]| (|InAst|))) "\\spad{s case InAst} holds if `s' represents a in-iterator") (((|Boolean|) $ (|[\|\|]| (|WhileAst|))) "\\spad{s case WhileAst} holds if `s' represents a while-iterator") (((|Boolean|) $ (|[\|\|]| (|RepeatAst|))) "\\spad{s case RepeatAst} holds if `s' represents an repeat-loop.") (((|Boolean|) $ (|[\|\|]| (|IfAst|))) "\\spad{s case IfAst} holds if `s' represents an if-statement.") (((|Boolean|) $ (|[\|\|]| (|MappingAst|))) "\\spad{s case MappingAst} holds if `s' represents a mapping type.") (((|Boolean|) $ (|[\|\|]| (|AttributeAst|))) "\\spad{s case AttributeAst} holds if `s' represents an attribute.") (((|Boolean|) $ (|[\|\|]| (|SignatureAst|))) "\\spad{s case SignatureAst} holds if `s' represents a signature export.") (((|Boolean|) $ (|[\|\|]| (|CapsuleAst|))) "\\spad{s case CapsuleAst} holds if `s' represents a domain capsule.") (((|Boolean|) $ (|[\|\|]| (|JoinAst|))) "\\spad{s case JoinAst} holds is the syntax object \\spad{s} denotes the join of several categories.") (((|Boolean|) $ (|[\|\|]| (|CategoryAst|))) "\\spad{s case CategoryAst} holds if `s' represents an unnamed category.") (((|Boolean|) $ (|[\|\|]| (|WhereAst|))) "\\spad{s case WhereAst} holds if `s' represents an expression with local definitions.") (((|Boolean|) $ (|[\|\|]| (|MacroAst|))) "\\spad{s case MacroAst} holds if `s' represents a macro definition.") (((|Boolean|) $ (|[\|\|]| (|DefinitionAst|))) "\\spad{s case DefinitionAst} holds if `s' represents a definition.") (((|Boolean|) $ (|[\|\|]| (|ImportAst|))) "\\spad{s case ImportAst} holds if `s' represents an `import' statement."))) NIL NIL -(-1158) +(-1157) ((|constructor| (NIL "SpecialOutputPackage allows FORTRAN,{} Tex and \\indented{2}{Script Formula Formatter output from programs.}")) (|outputAsTex| (((|Void|) (|List| (|OutputForm|))) "\\spad{outputAsTex(l)} sends (for each expression in the list \\spad{l}) output in Tex format to the destination as defined by \\spadsyscom{set output tex}.") (((|Void|) (|OutputForm|)) "\\spad{outputAsTex(o)} sends output \\spad{o} in Tex format to the destination defined by \\spadsyscom{set output tex}.")) (|outputAsScript| (((|Void|) (|List| (|OutputForm|))) "\\spad{outputAsScript(l)} sends (for each expression in the list \\spad{l}) output in Script Formula Formatter format to the destination defined. by \\spadsyscom{set output forumula}.") (((|Void|) (|OutputForm|)) "\\spad{outputAsScript(o)} sends output \\spad{o} in Script Formula Formatter format to the destination defined by \\spadsyscom{set output formula}.")) (|outputAsFortran| (((|Void|) (|List| (|OutputForm|))) "\\spad{outputAsFortran(l)} sends (for each expression in the list \\spad{l}) output in FORTRAN format to the destination defined by \\spadsyscom{set output fortran}.") (((|Void|) (|OutputForm|)) "\\spad{outputAsFortran(o)} sends output \\spad{o} in FORTRAN format.") (((|Void|) (|String|) (|OutputForm|)) "\\spad{outputAsFortran(v,o)} sends output \\spad{v} = \\spad{o} in FORTRAN format to the destination defined by \\spadsyscom{set output fortran}."))) NIL NIL -(-1159) +(-1158) ((|constructor| (NIL "Category for the other special functions.")) (|airyBi| (($ $) "\\spad{airyBi(x)} is the Airy function \\spad{Bi(x)}.")) (|airyAi| (($ $) "\\spad{airyAi(x)} is the Airy function \\spad{Ai(x)}.")) (|besselK| (($ $ $) "\\spad{besselK(v,z)} is the modified Bessel function of the second kind.")) (|besselI| (($ $ $) "\\spad{besselI(v,z)} is the modified Bessel function of the first kind.")) (|besselY| (($ $ $) "\\spad{besselY(v,z)} is the Bessel function of the second kind.")) (|besselJ| (($ $ $) "\\spad{besselJ(v,z)} is the Bessel function of the first kind.")) (|polygamma| (($ $ $) "\\spad{polygamma(k,x)} is the \\spad{k-th} derivative of \\spad{digamma(x)},{} (often written \\spad{psi(k,x)} in the literature).")) (|digamma| (($ $) "\\spad{digamma(x)} is the logarithmic derivative of \\spad{Gamma(x)} (often written \\spad{psi(x)} in the literature).")) (|Beta| (($ $ $) "\\spad{Beta(x,y)} is \\spad{Gamma(x) * Gamma(y)/Gamma(x+y)}.")) (|Gamma| (($ $ $) "\\spad{Gamma(a,x)} is the incomplete Gamma function.") (($ $) "\\spad{Gamma(x)} is the Euler Gamma function.")) (|abs| (($ $) "\\spad{abs(x)} returns the absolute value of \\spad{x}."))) NIL NIL -(-1160 V C) +(-1159 V C) ((|constructor| (NIL "This domain exports a modest implementation for the vertices of splitting trees. These vertices are called here splitting nodes. Every of these nodes store 3 informations. The first one is its value,{} that is the current expression to evaluate. The second one is its condition,{} that is the hypothesis under which the value has to be evaluated. The last one is its status,{} that is a boolean flag which is \\spad{true} iff the value is the result of its evaluation under its condition. Two splitting vertices are equal iff they have the sane values and the same conditions (so their status do not matter).")) (|subNode?| (((|Boolean|) $ $ (|Mapping| (|Boolean|) |#2| |#2|)) "\\axiom{subNode?(\\spad{n1},{}\\spad{n2},{}\\spad{o2})} returns \\spad{true} iff \\axiom{value(\\spad{n1}) = value(\\spad{n2})} and \\axiom{\\spad{o2}(condition(\\spad{n1}),{}condition(\\spad{n2}))}")) (|infLex?| (((|Boolean|) $ $ (|Mapping| (|Boolean|) |#1| |#1|) (|Mapping| (|Boolean|) |#2| |#2|)) "\\axiom{infLex?(\\spad{n1},{}\\spad{n2},{}\\spad{o1},{}\\spad{o2})} returns \\spad{true} iff \\axiom{\\spad{o1}(value(\\spad{n1}),{}value(\\spad{n2}))} or \\axiom{value(\\spad{n1}) = value(\\spad{n2})} and \\axiom{\\spad{o2}(condition(\\spad{n1}),{}condition(\\spad{n2}))}.")) (|setEmpty!| (($ $) "\\axiom{setEmpty!(\\spad{n})} replaces \\spad{n} by \\axiom{empty()\\$\\%}.")) (|setStatus!| (($ $ (|Boolean|)) "\\axiom{setStatus!(\\spad{n},{}\\spad{b})} returns \\spad{n} whose status has been replaced by \\spad{b} if it is not empty,{} else an error is produced.")) (|setCondition!| (($ $ |#2|) "\\axiom{setCondition!(\\spad{n},{}\\spad{t})} returns \\spad{n} whose condition has been replaced by \\spad{t} if it is not empty,{} else an error is produced.")) (|setValue!| (($ $ |#1|) "\\axiom{setValue!(\\spad{n},{}\\spad{v})} returns \\spad{n} whose value has been replaced by \\spad{v} if it is not empty,{} else an error is produced.")) (|copy| (($ $) "\\axiom{copy(\\spad{n})} returns a copy of \\spad{n}.")) (|construct| (((|List| $) |#1| (|List| |#2|)) "\\axiom{construct(\\spad{v},{}lt)} returns the same as \\axiom{[construct(\\spad{v},{}\\spad{t}) for \\spad{t} in lt]}") (((|List| $) (|List| (|Record| (|:| |val| |#1|) (|:| |tower| |#2|)))) "\\axiom{construct(lvt)} returns the same as \\axiom{[construct(vt.val,{}vt.tower) for vt in lvt]}") (($ (|Record| (|:| |val| |#1|) (|:| |tower| |#2|))) "\\axiom{construct(vt)} returns the same as \\axiom{construct(vt.val,{}vt.tower)}") (($ |#1| |#2|) "\\axiom{construct(\\spad{v},{}\\spad{t})} returns the same as \\axiom{construct(\\spad{v},{}\\spad{t},{}\\spad{false})}") (($ |#1| |#2| (|Boolean|)) "\\axiom{construct(\\spad{v},{}\\spad{t},{}\\spad{b})} returns the non-empty node with value \\spad{v},{} condition \\spad{t} and flag \\spad{b}")) (|status| (((|Boolean|) $) "\\axiom{status(\\spad{n})} returns the status of the node \\spad{n}.")) (|condition| ((|#2| $) "\\axiom{condition(\\spad{n})} returns the condition of the node \\spad{n}.")) (|value| ((|#1| $) "\\axiom{value(\\spad{n})} returns the value of the node \\spad{n}.")) (|empty?| (((|Boolean|) $) "\\axiom{empty?(\\spad{n})} returns \\spad{true} iff the node \\spad{n} is \\axiom{empty()\\$\\%}.")) (|empty| (($) "\\axiom{empty()} returns the same as \\axiom{[empty()\\$\\spad{V},{}empty()\\$\\spad{C},{}\\spad{false}]\\$\\%}"))) NIL NIL -(-1161 V C) +(-1160 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."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| (-1160 |#1| |#2|) (|%list| (QUOTE -321) (|%list| (QUOTE -1160) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1160 |#1| |#2|) (QUOTE (-1121)))) (|HasCategory| (-1160 |#1| |#2|) (QUOTE (-1121))) (-3956 (|HasCategory| (-1160 |#1| |#2|) (QUOTE (-102))) (|HasCategory| (-1160 |#1| |#2|) (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| (-1160 |#1| |#2|) (|%list| (QUOTE -321) (|%list| (QUOTE -1160) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1160 |#1| |#2|) (QUOTE (-1121)))) (|HasCategory| (-1160 |#1| |#2|) (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| (-1160 |#1| |#2|) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-1160 |#1| |#2|) (QUOTE (-102)))) -(-1162 |ndim| R) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| (-1159 |#1| |#2|) (|%list| (QUOTE -321) (|%list| (QUOTE -1159) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1159 |#1| |#2|) (QUOTE (-1120)))) (|HasCategory| (-1159 |#1| |#2|) (QUOTE (-1120))) (-3955 (|HasCategory| (-1159 |#1| |#2|) (QUOTE (-102))) (|HasCategory| (-1159 |#1| |#2|) (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| (-1159 |#1| |#2|) (|%list| (QUOTE -321) (|%list| (QUOTE -1159) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1159 |#1| |#2|) (QUOTE (-1120)))) (|HasCategory| (-1159 |#1| |#2|) (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| (-1159 |#1| |#2|) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-1159 |#1| |#2|) (QUOTE (-102)))) +(-1161 |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}."))) -((-4421 . T) (-4413 |has| |#2| (-6 (-4426 "*"))) (-4424 . T) (-4418 . T) (-4419 . T)) -((|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#2| (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-239))) (|HasAttribute| |#2| (QUOTE (-4426 #1="*"))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (QUOTE (-376))) (-3956 (|HasAttribute| |#2| (QUOTE (-4426 #1#))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-175)))) -(-1163 S) +((-4420 . T) (-4412 |has| |#2| (-6 (-4425 "*"))) (-4423 . T) (-4417 . T) (-4418 . T)) +((|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#2| (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-239))) (|HasAttribute| |#2| (QUOTE (-4425 #1="*"))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (QUOTE (-376))) (-3955 (|HasAttribute| |#2| (QUOTE (-4425 #1#))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-175)))) +(-1162 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 NIL -(-1164) +(-1163) ((|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."))) -((-4425 . T) (-4424 . T)) +((-4424 . T) (-4423 . T)) NIL -(-1165 R E V P TS) +(-1164 R E V P TS) ((|constructor| (NIL "A package providing a new algorithm for solving polynomial systems by means of regular chains. Two ways of solving are provided: in the sense of Zariski closure (like in Kalkbrener's algorithm) or in the sense of the regular zeros (like in Wu,{} Wang or Lazard- Moreno methods). This algorithm is valid for nay type of regular set. It does not care about the way a polynomial is added in an regular set,{} or how two quasi-components are compared (by an inclusion-test),{} or how the invertibility test is made in the tower of simple extensions associated with a regular set. These operations are realized respectively by the domain \\spad{TS} and the packages \\spad{QCMPPK(R,E,V,P,TS)} and \\spad{RSETGCD(R,E,V,P,TS)}. The same way it does not care about the way univariate polynomial gcds (with coefficients in the tower of simple extensions associated with a regular set) are computed. The only requirement is that these gcds need to have invertible initials (normalized or not). WARNING. There is no need for a user to call diectly any operation of this package since they can be accessed by the domain \\axiomType{TS}. Thus,{} the operations of this package are not documented.\\newline References : \\indented{1}{[1] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}"))) NIL NIL -(-1166 R E V P) +(-1165 R E V P) ((|constructor| (NIL "This domain provides an implementation of square-free regular chains. Moreover,{} the operation \\axiomOpFrom{zeroSetSplit}{SquareFreeRegularTriangularSetCategory} is an implementation of a new algorithm for solving polynomial systems by means of regular chains.\\newline References : \\indented{1}{[1] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.} \\indented{2}{Version: 2}")) (|preprocess| (((|Record| (|:| |val| (|List| |#4|)) (|:| |towers| (|List| $))) (|List| |#4|) (|Boolean|) (|Boolean|)) "\\axiom{pre_process(lp,{}\\spad{b1},{}\\spad{b2})} is an internal subroutine,{} exported only for developement.")) (|internalZeroSetSplit| (((|List| $) (|List| |#4|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\axiom{internalZeroSetSplit(lp,{}\\spad{b1},{}\\spad{b2},{}\\spad{b3})} is an internal subroutine,{} exported only for developement.")) (|zeroSetSplit| (((|List| $) (|List| |#4|) (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\axiom{zeroSetSplit(lp,{}\\spad{b1},{}\\spad{b2}.\\spad{b3},{}\\spad{b4})} is an internal subroutine,{} exported only for developement.") (((|List| $) (|List| |#4|) (|Boolean|) (|Boolean|)) "\\axiom{zeroSetSplit(lp,{}clos?,{}info?)} has the same specifications as \\axiomOpFrom{zeroSetSplit}{RegularTriangularSetCategory} from \\spadtype{RegularTriangularSetCategory} Moreover,{} if \\axiom{clos?} then solves in the sense of the Zariski closure else solves in the sense of the regular zeros. If \\axiom{info?} then do print messages during the computations.")) (|internalAugment| (((|List| $) |#4| $ (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\axiom{internalAugment(\\spad{p},{}ts,{}\\spad{b1},{}\\spad{b2},{}\\spad{b3},{}\\spad{b4},{}\\spad{b5})} is an internal subroutine,{} exported only for developement."))) -((-4425 . T) (-4424 . T)) -((-12 (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (|HasCategory| |#4| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#4| (QUOTE (-102)))) -(-1167) +((-4424 . T) (-4423 . T)) +((-12 (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (|HasCategory| |#4| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#4| (QUOTE (-102)))) +(-1166) ((|constructor| (NIL "The category of all semiring structures,{} \\spadignore{e.g.} triples (\\spad{D},{}+,{}*) such that (\\spad{D},{}+) is an Abelian monoid and (\\spad{D},{}*) is a monoid with the following laws:"))) NIL NIL -(-1168 S) +(-1167 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}."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) -(-1169 A S) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102)))) +(-1168 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}.")) (|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 -(-1170 S) +(-1169 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 -(-1171 |Key| |Ent| |dent|) +(-1170 |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."))) -((-4425 . T)) -((-12 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4289) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2285) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -630) (QUOTE (-547)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-860))) (-3956 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102)))) (-3956 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) -(-1172) +((-4424 . T)) +((-12 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4288) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2284) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -629) (QUOTE (-546)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-859))) (-3955 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102)))) (-3955 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) +(-1171) ((|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 non-fiinite domains,{} repeated application of \\spadfun{nextItem} is not required to reach all possible domain elements starting from any initial element. \\blankline")) (|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 NIL -(-1173) +(-1172) ((|constructor| (NIL "This domain represents an arithmetic progression iterator syntax.")) (|step| (((|SpadAst|) $) "\\spad{step(i)} returns the Spad AST denoting the step of the arithmetic progression represented by the iterator \\spad{i}.")) (|upperBound| (((|Maybe| (|SpadAst|)) $) "If the set of values assumed by the iteration variable is bounded from above,{} \\spad{upperBound(i)} returns the upper bound. Otherwise,{} its returns \\spad{nothing}.")) (|lowerBound| (((|SpadAst|) $) "\\spad{lowerBound(i)} returns the lower bound on the values assumed by the iteration variable.")) (|iterationVar| (((|Identifier|) $) "\\spad{iterationVar(i)} returns the name of the iterating variable of the arithmetic progression iterator \\spad{i}."))) NIL NIL -(-1174 |Coef|) +(-1173 |Coef|) ((|constructor| (NIL "This package computes infinite products of Taylor series over an integral domain of characteristic 0. Here Taylor series are represented by streams of Taylor coefficients.")) (|generalInfiniteProduct| (((|Stream| |#1|) (|Stream| |#1|) (|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| (((|Stream| |#1|) (|Stream| |#1|)) "\\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| (((|Stream| |#1|) (|Stream| |#1|)) "\\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| (((|Stream| |#1|) (|Stream| |#1|)) "\\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 -(-1175 S) +(-1174 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."))) -((-4425 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) -(-1176 S) +((-4424 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102)))) +(-1175 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 NIL -(-1177 A B) +(-1176 A B) ((|constructor| (NIL "Functions defined on streams with entries in two sets.")) (|reduce| ((|#2| |#2| (|Mapping| |#2| |#1| |#2|) (|Stream| |#1|)) "\\spad{reduce(b,f,u)},{} where \\spad{u} is a finite stream \\spad{[x0,x1,...,xn]},{} returns the value \\spad{r(n)} computed as follows: \\spad{r0 = f(x0,b), r1 = f(x1,r0),..., r(n) = f(xn,r(n-1))}.")) (|scan| (((|Stream| |#2|) |#2| (|Mapping| |#2| |#1| |#2|) (|Stream| |#1|)) "\\spad{scan(b,h,[x0,x1,x2,...])} returns \\spad{[y0,y1,y2,...]},{} where \\spad{y0 = h(x0,b)},{} \\spad{y1 = h(x1,y0)},{}\\spad{...} \\spad{yn = h(xn,y(n-1))}.")) (|map| (((|Stream| |#2|) (|Mapping| |#2| |#1|) (|Stream| |#1|)) "\\spad{map(f,s)} returns a stream whose elements are the function \\spad{f} applied to the corresponding elements of \\spad{s}. Note: \\spad{map(f,[x0,x1,x2,...]) = [f(x0),f(x1),f(x2),..]}."))) NIL NIL -(-1178 A B C) +(-1177 A B C) ((|constructor| (NIL "Functions defined on streams with entries in three sets.")) (|map| (((|Stream| |#3|) (|Mapping| |#3| |#1| |#2|) (|Stream| |#1|) (|Stream| |#2|)) "\\spad{map(f,st1,st2)} returns the stream whose elements are the function \\spad{f} applied to the corresponding elements of \\spad{st1} and \\spad{st2}. Note: \\spad{map(f,[x0,x1,x2,..],[y0,y1,y2,..]) = [f(x0,y0),f(x1,y1),..]}."))) NIL NIL -(-1179) +(-1178) ((|constructor| (NIL "This is the domain of character strings.")) (|string| (($ (|Identifier|)) "\\spad{string id} is the string representation of the identifier \\spad{id}") (($ (|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"))) -((-4425 . T) (-4424 . T)) -((-3956 (-12 (|HasCategory| (-146) (QUOTE (-860))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146))))) (-12 (|HasCategory| (-146) (QUOTE (-1121))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (-3956 (-12 (|HasCategory| (-146) (QUOTE (-1121))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146))))) (|HasCategory| (-146) (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| (-146) (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| (-146) (QUOTE (-860))) (|HasCategory| (-146) (QUOTE (-1121)))) (|HasCategory| (-146) (QUOTE (-860))) (-3956 (|HasCategory| (-146) (QUOTE (-102))) (|HasCategory| (-146) (QUOTE (-860))) (|HasCategory| (-146) (QUOTE (-1121)))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| (-146) (QUOTE (-1121))) (|HasCategory| (-146) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-146) (QUOTE (-102))) (-12 (|HasCategory| (-146) (QUOTE (-1121))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) -(-1180 |Entry|) +((-4424 . T) (-4423 . T)) +((-3955 (-12 (|HasCategory| (-146) (QUOTE (-859))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146))))) (-12 (|HasCategory| (-146) (QUOTE (-1120))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (-3955 (-12 (|HasCategory| (-146) (QUOTE (-1120))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146))))) (|HasCategory| (-146) (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| (-146) (|%list| (QUOTE -629) (QUOTE (-546)))) (-3955 (|HasCategory| (-146) (QUOTE (-859))) (|HasCategory| (-146) (QUOTE (-1120)))) (|HasCategory| (-146) (QUOTE (-859))) (-3955 (|HasCategory| (-146) (QUOTE (-102))) (|HasCategory| (-146) (QUOTE (-859))) (|HasCategory| (-146) (QUOTE (-1120)))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| (-146) (QUOTE (-1120))) (|HasCategory| (-146) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-146) (QUOTE (-102))) (-12 (|HasCategory| (-146) (QUOTE (-1120))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) +(-1179 |Entry|) ((|constructor| (NIL "This domain provides tables where the keys are strings. A specialized hash function for strings is used."))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4289) (QUOTE (-1179))) (|%list| (QUOTE |:|) (QUOTE -2285) (|devaluate| |#1|))))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (QUOTE (-1121)))) (-3956 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (QUOTE (-1121)))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (QUOTE (-1121)))) (-3956 (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (QUOTE (-1121)))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (|%list| (QUOTE -630) (QUOTE (-547)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (QUOTE (-1121))) (|HasCategory| (-1179) (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (QUOTE (-102)))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 (-1179)) (|:| -2285 |#1|)) (QUOTE (-102)))) -(-1181 A) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4288) (QUOTE (-1178))) (|%list| (QUOTE |:|) (QUOTE -2284) (|devaluate| |#1|))))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (QUOTE (-1120)))) (-3955 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (QUOTE (-1120)))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (QUOTE (-1120)))) (-3955 (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (QUOTE (-1120)))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (|%list| (QUOTE -629) (QUOTE (-546)))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (QUOTE (-1120))) (|HasCategory| (-1178) (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (QUOTE (-102)))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 (-1178)) (|:| -2284 |#1|)) (QUOTE (-102)))) +(-1180 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 -((|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558)))))) -(-1182 |Coef|) +((|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557)))))) +(-1181 |Coef|) ((|constructor| (NIL "StreamTranscendentalFunctions implements transcendental functions on Taylor series,{} where a Taylor series is represented by a stream of its coefficients.")) (|acsch| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{acsch(st)} computes the inverse hyperbolic cosecant of a power series \\spad{st}.")) (|asech| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{asech(st)} computes the inverse hyperbolic secant of a power series \\spad{st}.")) (|acoth| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{acoth(st)} computes the inverse hyperbolic cotangent of a power series \\spad{st}.")) (|atanh| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{atanh(st)} computes the inverse hyperbolic tangent of a power series \\spad{st}.")) (|acosh| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{acosh(st)} computes the inverse hyperbolic cosine of a power series \\spad{st}.")) (|asinh| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{asinh(st)} computes the inverse hyperbolic sine of a power series \\spad{st}.")) (|csch| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{csch(st)} computes the hyperbolic cosecant of a power series \\spad{st}.")) (|sech| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{sech(st)} computes the hyperbolic secant of a power series \\spad{st}.")) (|coth| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{coth(st)} computes the hyperbolic cotangent of a power series \\spad{st}.")) (|tanh| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{tanh(st)} computes the hyperbolic tangent of a power series \\spad{st}.")) (|cosh| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{cosh(st)} computes the hyperbolic cosine of a power series \\spad{st}.")) (|sinh| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{sinh(st)} computes the hyperbolic sine of a power series \\spad{st}.")) (|sinhcosh| (((|Record| (|:| |sinh| (|Stream| |#1|)) (|:| |cosh| (|Stream| |#1|))) (|Stream| |#1|)) "\\spad{sinhcosh(st)} returns a record containing the hyperbolic sine and cosine of a power series \\spad{st}.")) (|acsc| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{acsc(st)} computes arccosecant of a power series \\spad{st}.")) (|asec| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{asec(st)} computes arcsecant of a power series \\spad{st}.")) (|acot| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{acot(st)} computes arccotangent of a power series \\spad{st}.")) (|atan| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{atan(st)} computes arctangent of a power series \\spad{st}.")) (|acos| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{acos(st)} computes arccosine of a power series \\spad{st}.")) (|asin| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{asin(st)} computes arcsine of a power series \\spad{st}.")) (|csc| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{csc(st)} computes cosecant of a power series \\spad{st}.")) (|sec| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{sec(st)} computes secant of a power series \\spad{st}.")) (|cot| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{cot(st)} computes cotangent of a power series \\spad{st}.")) (|tan| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{tan(st)} computes tangent of a power series \\spad{st}.")) (|cos| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{cos(st)} computes cosine of a power series \\spad{st}.")) (|sin| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{sin(st)} computes sine of a power series \\spad{st}.")) (|sincos| (((|Record| (|:| |sin| (|Stream| |#1|)) (|:| |cos| (|Stream| |#1|))) (|Stream| |#1|)) "\\spad{sincos(st)} returns a record containing the sine and cosine of a power series \\spad{st}.")) (** (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{st1 ** st2} computes the power of a power series \\spad{st1} by another power series \\spad{st2}.")) (|log| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{log(st)} computes the log of a power series.")) (|exp| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{exp(st)} computes the exponential of a power series \\spad{st}."))) NIL NIL -(-1183 |Coef|) +(-1182 |Coef|) ((|constructor| (NIL "StreamTranscendentalFunctionsNonCommutative implements transcendental functions on Taylor series over a non-commutative ring,{} where a Taylor series is represented by a stream of its coefficients.")) (|acsch| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{acsch(st)} computes the inverse hyperbolic cosecant of a power series \\spad{st}.")) (|asech| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{asech(st)} computes the inverse hyperbolic secant of a power series \\spad{st}.")) (|acoth| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{acoth(st)} computes the inverse hyperbolic cotangent of a power series \\spad{st}.")) (|atanh| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{atanh(st)} computes the inverse hyperbolic tangent of a power series \\spad{st}.")) (|acosh| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{acosh(st)} computes the inverse hyperbolic cosine of a power series \\spad{st}.")) (|asinh| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{asinh(st)} computes the inverse hyperbolic sine of a power series \\spad{st}.")) (|csch| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{csch(st)} computes the hyperbolic cosecant of a power series \\spad{st}.")) (|sech| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{sech(st)} computes the hyperbolic secant of a power series \\spad{st}.")) (|coth| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{coth(st)} computes the hyperbolic cotangent of a power series \\spad{st}.")) (|tanh| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{tanh(st)} computes the hyperbolic tangent of a power series \\spad{st}.")) (|cosh| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{cosh(st)} computes the hyperbolic cosine of a power series \\spad{st}.")) (|sinh| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{sinh(st)} computes the hyperbolic sine of a power series \\spad{st}.")) (|acsc| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{acsc(st)} computes arccosecant of a power series \\spad{st}.")) (|asec| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{asec(st)} computes arcsecant of a power series \\spad{st}.")) (|acot| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{acot(st)} computes arccotangent of a power series \\spad{st}.")) (|atan| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{atan(st)} computes arctangent of a power series \\spad{st}.")) (|acos| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{acos(st)} computes arccosine of a power series \\spad{st}.")) (|asin| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{asin(st)} computes arcsine of a power series \\spad{st}.")) (|csc| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{csc(st)} computes cosecant of a power series \\spad{st}.")) (|sec| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{sec(st)} computes secant of a power series \\spad{st}.")) (|cot| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{cot(st)} computes cotangent of a power series \\spad{st}.")) (|tan| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{tan(st)} computes tangent of a power series \\spad{st}.")) (|cos| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{cos(st)} computes cosine of a power series \\spad{st}.")) (|sin| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{sin(st)} computes sine of a power series \\spad{st}.")) (** (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{st1 ** st2} computes the power of a power series \\spad{st1} by another power series \\spad{st2}.")) (|log| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{log(st)} computes the log of a power series.")) (|exp| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{exp(st)} computes the exponential of a power series \\spad{st}."))) NIL NIL -(-1184 R UP) +(-1183 R UP) ((|constructor| (NIL "This package computes the subresultants of two polynomials which is needed for the `Lazard Rioboo' enhancement to Tragers integrations formula For efficiency reasons this has been rewritten to call Lionel Ducos package which is currently the best one. \\blankline")) (|primitivePart| ((|#2| |#2| |#1|) "\\spad{primitivePart(p, q)} reduces the coefficient of \\spad{p} modulo \\spad{q},{} takes the primitive part of the result,{} and ensures that the leading coefficient of that result is monic.")) (|subresultantVector| (((|PrimitiveArray| |#2|) |#2| |#2|) "\\spad{subresultantVector(p, q)} returns \\spad{[p0,...,pn]} where \\spad{pi} is the \\spad{i}-th subresultant of \\spad{p} and \\spad{q}. In particular,{} \\spad{p0 = resultant(p, q)}."))) NIL ((|HasCategory| |#1| (QUOTE (-319)))) -(-1185 |n| R) +(-1184 |n| R) ((|constructor| (NIL "This domain \\undocumented")) (|pointData| (((|List| (|Point| |#2|)) $) "\\spad{pointData(s)} returns the list of points from the point data field of the 3 dimensional subspace \\spad{s}.")) (|parent| (($ $) "\\spad{parent(s)} returns the subspace which is the parent of the indicated 3 dimensional subspace \\spad{s}. If \\spad{s} is the top level subspace an error message is returned.")) (|level| (((|NonNegativeInteger|) $) "\\spad{level(s)} returns a non negative integer which is the current level field of the indicated 3 dimensional subspace \\spad{s}.")) (|extractProperty| (((|SubSpaceComponentProperty|) $) "\\spad{extractProperty(s)} returns the property of domain \\spadtype{SubSpaceComponentProperty} of the indicated 3 dimensional subspace \\spad{s}.")) (|extractClosed| (((|Boolean|) $) "\\spad{extractClosed(s)} returns the \\spadtype{Boolean} value of the closed property for the indicated 3 dimensional subspace \\spad{s}. If the property is closed,{} \\spad{True} is returned,{} otherwise \\spad{False} is returned.")) (|extractIndex| (((|NonNegativeInteger|) $) "\\spad{extractIndex(s)} returns a non negative integer which is the current index of the 3 dimensional subspace \\spad{s}.")) (|extractPoint| (((|Point| |#2|) $) "\\spad{extractPoint(s)} returns the point which is given by the current index location into the point data field of the 3 dimensional subspace \\spad{s}.")) (|traverse| (($ $ (|List| (|NonNegativeInteger|))) "\\spad{traverse(s,li)} follows the branch list of the 3 dimensional subspace,{} \\spad{s},{} along the path dictated by the list of non negative integers,{} \\spad{li},{} which points to the component which has been traversed to. The subspace,{} \\spad{s},{} is returned,{} where \\spad{s} is now the subspace pointed to by \\spad{li}.")) (|defineProperty| (($ $ (|List| (|NonNegativeInteger|)) (|SubSpaceComponentProperty|)) "\\spad{defineProperty(s,li,p)} defines the component property in the 3 dimensional subspace,{} \\spad{s},{} to be that of \\spad{p},{} where \\spad{p} is of the domain \\spadtype{SubSpaceComponentProperty}. The list of non negative integers,{} \\spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component whose property is being defined. The subspace,{} \\spad{s},{} is returned with the component property definition.")) (|closeComponent| (($ $ (|List| (|NonNegativeInteger|)) (|Boolean|)) "\\spad{closeComponent(s,li,b)} sets the property of the component in the 3 dimensional subspace,{} \\spad{s},{} to be closed if \\spad{b} is \\spad{true},{} or open if \\spad{b} is \\spad{false}. The list of non negative integers,{} \\spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component whose closed property is to be set. The subspace,{} \\spad{s},{} is returned with the component property modification.")) (|modifyPoint| (($ $ (|NonNegativeInteger|) (|Point| |#2|)) "\\spad{modifyPoint(s,ind,p)} modifies the point referenced by the index location,{} \\spad{ind},{} by replacing it with the point,{} \\spad{p} in the 3 dimensional subspace,{} \\spad{s}. An error message occurs if \\spad{s} is empty,{} otherwise the subspace \\spad{s} is returned with the point modification.") (($ $ (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{modifyPoint(s,li,i)} replaces an existing point in the 3 dimensional subspace,{} \\spad{s},{} with the 4 dimensional point indicated by the index location,{} \\spad{i}. The list of non negative integers,{} \\spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component in which the existing point is to be modified. An error message occurs if \\spad{s} is empty,{} otherwise the subspace \\spad{s} is returned with the point modification.") (($ $ (|List| (|NonNegativeInteger|)) (|Point| |#2|)) "\\spad{modifyPoint(s,li,p)} replaces an existing point in the 3 dimensional subspace,{} \\spad{s},{} with the 4 dimensional point,{} \\spad{p}. The list of non negative integers,{} \\spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component in which the existing point is to be modified. An error message occurs if \\spad{s} is empty,{} otherwise the subspace \\spad{s} is returned with the point modification.")) (|addPointLast| (($ $ $ (|Point| |#2|) (|NonNegativeInteger|)) "\\spad{addPointLast(s,s2,li,p)} adds the 4 dimensional point,{} \\spad{p},{} to the 3 dimensional subspace,{} \\spad{s}. \\spad{s2} point to the end of the subspace \\spad{s}. \\spad{n} is the path in the \\spad{s2} component. The subspace \\spad{s} is returned with the additional point.")) (|addPoint2| (($ $ (|Point| |#2|)) "\\spad{addPoint2(s,p)} adds the 4 dimensional point,{} \\spad{p},{} to the 3 dimensional subspace,{} \\spad{s}. The subspace \\spad{s} is returned with the additional point.")) (|addPoint| (((|NonNegativeInteger|) $ (|Point| |#2|)) "\\spad{addPoint(s,p)} adds the point,{} \\spad{p},{} to the 3 dimensional subspace,{} \\spad{s},{} and returns the new total number of points in \\spad{s}.") (($ $ (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{addPoint(s,li,i)} adds the 4 dimensional point indicated by the index location,{} \\spad{i},{} to the 3 dimensional subspace,{} \\spad{s}. The list of non negative integers,{} \\spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component in which the point is to be added. It's length should range from 0 to \\spad{n - 1} where \\spad{n} is the dimension of the subspace. If the length is \\spad{n - 1},{} then a specific lowest level component is being referenced. If it is less than \\spad{n - 1},{} then some higher level component (0 indicates top level component) is being referenced and a component of that level with the desired point is created. The subspace \\spad{s} is returned with the additional point.") (($ $ (|List| (|NonNegativeInteger|)) (|Point| |#2|)) "\\spad{addPoint(s,li,p)} adds the 4 dimensional point,{} \\spad{p},{} to the 3 dimensional subspace,{} \\spad{s}. The list of non negative integers,{} \\spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component in which the point is to be added. It's length should range from 0 to \\spad{n - 1} where \\spad{n} is the dimension of the subspace. If the length is \\spad{n - 1},{} then a specific lowest level component is being referenced. If it is less than \\spad{n - 1},{} then some higher level component (0 indicates top level component) is being referenced and a component of that level with the desired point is created. The subspace \\spad{s} is returned with the additional point.")) (|separate| (((|List| $) $) "\\spad{separate(s)} makes each of the components of the \\spadtype{SubSpace},{} \\spad{s},{} into a list of separate and distinct subspaces and returns the list.")) (|merge| (($ (|List| $)) "\\spad{merge(ls)} a list of subspaces,{} \\spad{ls},{} into one subspace.") (($ $ $) "\\spad{merge(s1,s2)} the subspaces \\spad{s1} and \\spad{s2} into a single subspace.")) (|deepCopy| (($ $) "\\spad{deepCopy(x)} \\undocumented")) (|shallowCopy| (($ $) "\\spad{shallowCopy(x)} \\undocumented")) (|numberOfChildren| (((|NonNegativeInteger|) $) "\\spad{numberOfChildren(x)} \\undocumented")) (|children| (((|List| $) $) "\\spad{children(x)} \\undocumented")) (|child| (($ $ (|NonNegativeInteger|)) "\\spad{child(x,n)} \\undocumented")) (|birth| (($ $) "\\spad{birth(x)} \\undocumented")) (|subspace| (($) "\\spad{subspace()} \\undocumented")) (|new| (($) "\\spad{new()} \\undocumented")) (|internal?| (((|Boolean|) $) "\\spad{internal?(x)} \\undocumented")) (|root?| (((|Boolean|) $) "\\spad{root?(x)} \\undocumented")) (|leaf?| (((|Boolean|) $) "\\spad{leaf?(x)} \\undocumented"))) NIL NIL -(-1186 S1 S2) +(-1185 S1 S2) ((|constructor| (NIL "This domain implements \"such that\" forms")) (|rhs| ((|#2| $) "\\spad{rhs(f)} returns the right side of \\spad{f}")) (|lhs| ((|#1| $) "\\spad{lhs(f)} returns the left side of \\spad{f}")) (|construct| (($ |#1| |#2|) "\\spad{construct(s,t)} makes a form s:t"))) NIL NIL -(-1187) +(-1186) ((|constructor| (NIL "This domain represents the filter iterator syntax.")) (|predicate| (((|SpadAst|) $) "\\spad{predicate(e)} returns the syntax object for the predicate in the filter iterator syntax `e'."))) NIL NIL -(-1188 |Coef| |var| |cen|) +(-1187 |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."))) -(((-4426 "*") -3956 (-2960 (|has| |#1| (-376)) (|has| (-1195 |#1| |#2| |#3|) (-841))) (|has| |#1| (-175)) (-2960 (|has| |#1| (-376)) (|has| (-1195 |#1| |#2| |#3|) (-928)))) (-4417 -3956 (-2960 (|has| |#1| (-376)) (|has| (-1195 |#1| |#2| |#3|) (-841))) (|has| |#1| (-569)) (-2960 (|has| |#1| (-376)) (|has| (-1195 |#1| |#2| |#3|) (-928)))) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) (-4418 . T) (-4419 . T) (-4421 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-841)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-928)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -630) (QUOTE (-547))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1195) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1195) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1195) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -526) (QUOTE (-1197)) (|%list| (QUOTE -1195) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -1058) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-860)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-1040)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-1172)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-149)))) (|HasCategory| |#1| (QUOTE (-149)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|)))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -918) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|)))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-240)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-240)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-239)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|))))) (|HasCategory| (-558) (QUOTE (-1132))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-928)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -1058) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -630) (QUOTE (-547))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-1040)))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-841)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-841)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-860))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-1172)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1195) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1195) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1195) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -526) (QUOTE (-1197)) (|%list| (QUOTE -1195) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (|HasSignature| |#1| (|%list| (QUOTE -4375) (|%list| (|devaluate| |#1|) (QUOTE (-1197)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-978))) (|HasCategory| |#1| (QUOTE (-1223))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasSignature| |#1| (|%list| (QUOTE -4241) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1197))))) (|HasSignature| |#1| (|%list| (QUOTE -3483) (|%list| (|%list| (QUOTE -660) (QUOTE (-1197))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-557)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-319)))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-928))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-147))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-841)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-569)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-841)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-175)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (|%list| (QUOTE -918) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-239)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-860)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-928)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-147)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1195 |#1| |#2| |#3|) (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-147))))) -(-1189 R -3494) +(((-4425 "*") -3955 (-2959 (|has| |#1| (-376)) (|has| (-1194 |#1| |#2| |#3|) (-840))) (|has| |#1| (-175)) (-2959 (|has| |#1| (-376)) (|has| (-1194 |#1| |#2| |#3|) (-927)))) (-4416 -3955 (-2959 (|has| |#1| (-376)) (|has| (-1194 |#1| |#2| |#3|) (-840))) (|has| |#1| (-568)) (-2959 (|has| |#1| (-376)) (|has| (-1194 |#1| |#2| |#3|) (-927)))) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) (-4417 . T) (-4418 . T) (-4420 . T)) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-840)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-927)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -629) (QUOTE (-546))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1194) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1194) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1194) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -526) (QUOTE (-1196)) (|%list| (QUOTE -1194) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -1057) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-859)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-1039)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-1171)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-149)))) (|HasCategory| |#1| (QUOTE (-149)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|)))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -917) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|)))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-240)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-240)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-239)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|))))) (|HasCategory| (-557) (QUOTE (-1131))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-927)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -1057) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -629) (QUOTE (-546))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-1039)))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-840)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-840)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-859))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-1171)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1194) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1194) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1194) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -526) (QUOTE (-1196)) (|%list| (QUOTE -1194) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-557))))) (|HasSignature| |#1| (|%list| (QUOTE -4374) (|%list| (|devaluate| |#1|) (QUOTE (-1196)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-557))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-977))) (|HasCategory| |#1| (QUOTE (-1222))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasSignature| |#1| (|%list| (QUOTE -4240) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1196))))) (|HasSignature| |#1| (|%list| (QUOTE -3482) (|%list| (|%list| (QUOTE -659) (QUOTE (-1196))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-556)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-319)))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-927))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-147))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-840)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-568)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-840)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-175)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (|%list| (QUOTE -917) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-239)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-859)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-927)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-147)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1194 |#1| |#2| |#3|) (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-147))))) +(-1188 R -3493) ((|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 -(-1190 R) +(-1189 R) ((|constructor| (NIL "Computes sums of rational functions.")) (|sum| (((|Union| (|Fraction| (|Polynomial| |#1|)) (|Expression| |#1|)) (|Fraction| (|Polynomial| |#1|)) (|SegmentBinding| (|Fraction| (|Polynomial| |#1|)))) "\\spad{sum(f(n), n = a..b)} returns \\spad{f(a) + f(a+1) + ... f(b)}.") (((|Fraction| (|Polynomial| |#1|)) (|Polynomial| |#1|) (|SegmentBinding| (|Polynomial| |#1|))) "\\spad{sum(f(n), n = a..b)} returns \\spad{f(a) + f(a+1) + ... f(b)}.") (((|Union| (|Fraction| (|Polynomial| |#1|)) (|Expression| |#1|)) (|Fraction| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{sum(a(n), n)} returns \\spad{A} which is the indefinite sum of \\spad{a} with respect to upward difference on \\spad{n},{} \\spadignore{i.e.} \\spad{A(n+1) - A(n) = a(n)}.") (((|Fraction| (|Polynomial| |#1|)) (|Polynomial| |#1|) (|Symbol|)) "\\spad{sum(a(n), n)} returns \\spad{A} which is the indefinite sum of \\spad{a} with respect to upward difference on \\spad{n},{} \\spadignore{i.e.} \\spad{A(n+1) - A(n) = a(n)}."))) NIL NIL -(-1191 R) +(-1190 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."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4420 |has| |#1| (-376)) (-4422 |has| |#1| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-1102) (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-1102) (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-1102) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-1102) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-1102) (|%list| (QUOTE -630) (QUOTE (-547))))) (|HasCategory| |#1| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-928)))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1172))) (|HasCategory| |#1| (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-240))) (|HasAttribute| |#1| (QUOTE -4422)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) -(-1192 R S) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4419 |has| |#1| (-376)) (-4421 |has| |#1| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-1101) (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-1101) (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-1101) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-1101) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-1101) (|%list| (QUOTE -629) (QUOTE (-546))))) (|HasCategory| |#1| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-927)))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1171))) (|HasCategory| |#1| (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-240))) (|HasAttribute| |#1| (QUOTE -4421)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))))) +(-1191 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 NIL -(-1193 E OV R P) +(-1192 E OV R P) ((|constructor| (NIL "\\indented{1}{SupFractionFactorize} contains the factor function for univariate polynomials over the quotient field of a ring \\spad{S} such that the package MultivariateFactorize works for \\spad{S}")) (|squareFree| (((|Factored| (|SparseUnivariatePolynomial| (|Fraction| |#4|))) (|SparseUnivariatePolynomial| (|Fraction| |#4|))) "\\spad{squareFree(p)} returns the square-free factorization of the univariate polynomial \\spad{p} with coefficients which are fractions of polynomials over \\spad{R}. Each factor has no repeated roots and the factors are pairwise relatively prime.")) (|factor| (((|Factored| (|SparseUnivariatePolynomial| (|Fraction| |#4|))) (|SparseUnivariatePolynomial| (|Fraction| |#4|))) "\\spad{factor(p)} factors the univariate polynomial \\spad{p} with coefficients which are fractions of polynomials over \\spad{R}."))) NIL NIL -(-1194 |Coef| |var| |cen|) +(-1193 |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."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-558)) (QUOTE (-1132))) (|HasCategory| |#1| (QUOTE (-376))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasSignature| |#1| (|%list| (QUOTE -4375) (|%list| (|devaluate| |#1|) (QUOTE (-1197)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-978))) (|HasCategory| |#1| (QUOTE (-1223))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasSignature| |#1| (|%list| (QUOTE -4241) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1197))))) (|HasSignature| |#1| (|%list| (QUOTE -3483) (|%list| (|%list| (QUOTE -660) (QUOTE (-1197))) (|devaluate| |#1|))))))) -(-1195 |Coef| |var| |cen|) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-557)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-376))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasSignature| |#1| (|%list| (QUOTE -4374) (|%list| (|devaluate| |#1|) (QUOTE (-1196)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-977))) (|HasCategory| |#1| (QUOTE (-1222))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasSignature| |#1| (|%list| (QUOTE -4240) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1196))))) (|HasSignature| |#1| (|%list| (QUOTE -3482) (|%list| (|%list| (QUOTE -659) (QUOTE (-1196))) (|devaluate| |#1|))))))) +(-1194 |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}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-569))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-790)) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-790)) (|devaluate| |#1|)))) (|HasCategory| (-790) (QUOTE (-1132))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-790))))) (|HasSignature| |#1| (|%list| (QUOTE -4375) (|%list| (|devaluate| |#1|) (QUOTE (-1197)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-790))))) (|HasCategory| |#1| (QUOTE (-376))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-978))) (|HasCategory| |#1| (QUOTE (-1223))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasSignature| |#1| (|%list| (QUOTE -4241) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1197))))) (|HasSignature| |#1| (|%list| (QUOTE -3483) (|%list| (|%list| (QUOTE -660) (QUOTE (-1197))) (|devaluate| |#1|))))))) -(-1196) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-568))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-789)) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-789)) (|devaluate| |#1|)))) (|HasCategory| (-789) (QUOTE (-1131))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-789))))) (|HasSignature| |#1| (|%list| (QUOTE -4374) (|%list| (|devaluate| |#1|) (QUOTE (-1196)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-789))))) (|HasCategory| |#1| (QUOTE (-376))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-977))) (|HasCategory| |#1| (QUOTE (-1222))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasSignature| |#1| (|%list| (QUOTE -4240) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1196))))) (|HasSignature| |#1| (|%list| (QUOTE -3482) (|%list| (|%list| (QUOTE -659) (QUOTE (-1196))) (|devaluate| |#1|))))))) +(-1195) ((|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 NIL -(-1197) +(-1196) ((|constructor| (NIL "Basic and scripted symbols.")) (|sample| (($) "\\spad{sample()} returns a sample of \\%")) (|list| (((|List| $) $) "\\spad{list(sy)} takes a scripted symbol and produces a list of the name followed by the scripts.")) (|string| (((|String|) $) "\\spad{string(s)} converts the symbol \\spad{s} to a string. Error: if the symbol is subscripted.")) (|elt| (($ $ (|List| (|OutputForm|))) "\\spad{elt(s,[a1,...,an])} or \\spad{s}([\\spad{a1},{}...,{}an]) returns \\spad{s} subscripted by \\spad{[a1,...,an]}.")) (|argscript| (($ $ (|List| (|OutputForm|))) "\\spad{argscript(s, [a1,...,an])} returns \\spad{s} arg-scripted by \\spad{[a1,...,an]}.")) (|superscript| (($ $ (|List| (|OutputForm|))) "\\spad{superscript(s, [a1,...,an])} returns \\spad{s} superscripted by \\spad{[a1,...,an]}.")) (|subscript| (($ $ (|List| (|OutputForm|))) "\\spad{subscript(s, [a1,...,an])} returns \\spad{s} subscripted by \\spad{[a1,...,an]}.")) (|script| (($ $ (|Record| (|:| |sub| (|List| (|OutputForm|))) (|:| |sup| (|List| (|OutputForm|))) (|:| |presup| (|List| (|OutputForm|))) (|:| |presub| (|List| (|OutputForm|))) (|:| |args| (|List| (|OutputForm|))))) "\\spad{script(s, [a,b,c,d,e])} returns \\spad{s} with subscripts a,{} superscripts \\spad{b},{} pre-superscripts \\spad{c},{} pre-subscripts \\spad{d},{} and argument-scripts \\spad{e}.") (($ $ (|List| (|List| (|OutputForm|)))) "\\spad{script(s, [a,b,c,d,e])} returns \\spad{s} with subscripts a,{} superscripts \\spad{b},{} pre-superscripts \\spad{c},{} pre-subscripts \\spad{d},{} and argument-scripts \\spad{e}. Omitted components are taken to be empty. For example,{} \\spad{script(s, [a,b,c])} is equivalent to \\spad{script(s,[a,b,c,[],[]])}.")) (|scripts| (((|Record| (|:| |sub| (|List| (|OutputForm|))) (|:| |sup| (|List| (|OutputForm|))) (|:| |presup| (|List| (|OutputForm|))) (|:| |presub| (|List| (|OutputForm|))) (|:| |args| (|List| (|OutputForm|)))) $) "\\spad{scripts(s)} returns all the scripts of \\spad{s}.")) (|scripted?| (((|Boolean|) $) "\\spad{scripted?(s)} is \\spad{true} if \\spad{s} has been given any scripts.")) (|name| (($ $) "\\spad{name(s)} returns \\spad{s} without its scripts.")) (|resetNew| (((|Void|)) "\\spad{resetNew()} resets the internals counters that new() and new(\\spad{s}) use to return distinct symbols every time.")) (|new| (($ $) "\\spad{new(s)} returns a new symbol whose name starts with \\%\\spad{s}.") (($) "\\spad{new()} returns a new symbol whose name starts with \\%."))) NIL NIL -(-1198 R) +(-1197 R) ((|constructor| (NIL "Computes all the symmetric functions in \\spad{n} variables.")) (|symFunc| (((|Vector| |#1|) |#1| (|PositiveInteger|)) "\\spad{symFunc(r, n)} returns the vector of the elementary symmetric functions in \\spad{[r,r,...,r]} \\spad{n} times.") (((|Vector| |#1|) (|List| |#1|)) "\\spad{symFunc([r1,...,rn])} returns the vector of the elementary symmetric functions in the \\spad{ri's}: \\spad{[r1 + ... + rn, r1 r2 + ... + r(n-1) rn, ..., r1 r2 ... rn]}."))) NIL NIL -(-1199 R) +(-1198 R) ((|constructor| (NIL "This domain implements symmetric polynomial"))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-6 -4422)) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-569))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-3956 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| (-991) (QUOTE (-133)))) (|HasAttribute| |#1| (QUOTE -4422))) -(-1200) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-6 -4421)) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-568))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-3955 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| (-990) (QUOTE (-133)))) (|HasAttribute| |#1| (QUOTE -4421))) +(-1199) ((|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| #1="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| #1#))) "\\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| #1#))) "\\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| #1#)) $) "\\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 NIL -(-1201) +(-1200) ((|constructor| (NIL "Create and manipulate a symbol table for generated FORTRAN code")) (|symbolTable| (($ (|List| (|Record| (|:| |key| (|Symbol|)) (|:| |entry| (|FortranType|))))) "\\spad{symbolTable(l)} creates a symbol table from the elements of \\spad{l}.")) (|printTypes| (((|Void|) $) "\\spad{printTypes(tab)} produces FORTRAN type declarations from \\spad{tab},{} on the current FORTRAN output stream")) (|newTypeLists| (((|SExpression|) $) "\\spad{newTypeLists(x)} \\undocumented")) (|typeLists| (((|List| (|List| (|Union| (|:| |name| (|Symbol|)) (|:| |bounds| (|List| (|Union| (|:| S (|Symbol|)) (|:| P (|Polynomial| (|Integer|))))))))) $) "\\spad{typeLists(tab)} returns a list of lists of types of objects in \\spad{tab}")) (|externalList| (((|List| (|Symbol|)) $) "\\spad{externalList(tab)} returns a list of all the external symbols in \\spad{tab}")) (|typeList| (((|List| (|Union| (|:| |name| (|Symbol|)) (|:| |bounds| (|List| (|Union| (|:| S (|Symbol|)) (|:| P (|Polynomial| (|Integer|)))))))) (|FortranScalarType|) $) "\\spad{typeList(t,tab)} returns a list of all the objects of type \\spad{t} in \\spad{tab}")) (|parametersOf| (((|List| (|Symbol|)) $) "\\spad{parametersOf(tab)} returns a list of all the symbols declared in \\spad{tab}")) (|fortranTypeOf| (((|FortranType|) (|Symbol|) $) "\\spad{fortranTypeOf(u,tab)} returns the type of \\spad{u} in \\spad{tab}")) (|declare!| (((|FortranType|) (|Symbol|) (|FortranType|) $) "\\spad{declare!(u,t,tab)} creates a new entry in \\spad{tab},{} declaring \\spad{u} to be of type \\spad{t}") (((|FortranType|) (|List| (|Symbol|)) (|FortranType|) $) "\\spad{declare!(l,t,tab)} creates new entrys in \\spad{tab},{} declaring each of \\spad{l} to be of type \\spad{t}")) (|empty| (($) "\\spad{empty()} returns a new,{} empty symbol table")) (|coerce| (((|Table| (|Symbol|) (|FortranType|)) $) "\\spad{coerce(x)} returns a table view of \\spad{x}"))) NIL NIL -(-1202) +(-1201) ((|constructor| (NIL "\\indented{1}{This domain provides a simple domain,{} general enough for} \\indented{2}{building complete representation of Spad programs as objects} \\indented{2}{of a term algebra built from ground terms of type integers,{} foats,{}} \\indented{2}{identifiers,{} and strings.} \\indented{2}{This domain differs from InputForm in that it represents} \\indented{2}{any entity in a Spad program,{} not just expressions.\\space{2}Furthermore,{}} \\indented{2}{while InputForm may contain atoms like vectors and other Lisp} \\indented{2}{objects,{} the Syntax domain is supposed to contain only that} \\indented{2}{initial algebra build from the primitives listed above.} Related Constructors: \\indented{2}{Integer,{} DoubleFloat,{} Identifier,{} String,{} SExpression.} See Also: SExpression,{} InputForm. The equality supported by this domain is structural.")) (|case| (((|Boolean|) $ (|[\|\|]| (|String|))) "\\spad{x case String} is \\spad{true} if `x' really is a String") (((|Boolean|) $ (|[\|\|]| (|Identifier|))) "\\spad{x case Identifier} is \\spad{true} if `x' really is an Identifier") (((|Boolean|) $ (|[\|\|]| (|DoubleFloat|))) "\\spad{x case DoubleFloat} is \\spad{true} if `x' really is a DoubleFloat") (((|Boolean|) $ (|[\|\|]| (|Integer|))) "\\spad{x case Integer} is \\spad{true} if `x' really is an Integer")) (|compound?| (((|Boolean|) $) "\\spad{compound? x} is \\spad{true} when `x' is not an atomic syntax.")) (|getOperands| (((|List| $) $) "\\spad{getOperands(x)} returns the list of operands to the operator in `x'.")) (|getOperator| (((|Union| (|Integer|) (|DoubleFloat|) (|Identifier|) (|String|) $) $) "\\spad{getOperator(x)} returns the operator,{} or tag,{} of the syntax `x'. The value returned is itself a syntax if `x' really is an application of a function symbol as opposed to being an atomic ground term.")) (|nil?| (((|Boolean|) $) "\\spad{nil?(s)} is \\spad{true} when `s' is a syntax for the constant nil.")) (|buildSyntax| (($ $ (|List| $)) "\\spad{buildSyntax(op, [a1, ..., an])} builds a syntax object for \\spad{op}(\\spad{a1},{}...,{}an).") (($ (|Identifier|) (|List| $)) "\\spad{buildSyntax(op, [a1, ..., an])} builds a syntax object for \\spad{op}(\\spad{a1},{}...,{}an).")) (|autoCoerce| (((|String|) $) "\\spad{autoCoerce(s)} forcibly extracts a string value from the syntax `s'; no check performed. To be called only at the discretion of the compiler.") (((|Identifier|) $) "\\spad{autoCoerce(s)} forcibly extracts an identifier from the Syntax domain `s'; no check performed. To be called only at at the discretion of the compiler.") (((|DoubleFloat|) $) "\\spad{autoCoerce(s)} forcibly extracts a float value from the syntax `s'; no check performed. To be called only at the discretion of the compiler") (((|Integer|) $) "\\spad{autoCoerce(s)} forcibly extracts an integer value from the syntax `s'; no check performed. To be called only at the discretion of the compiler.")) (|coerce| (((|String|) $) "\\spad{coerce(s)} extracts a string value from the syntax `s'.") (((|Identifier|) $) "\\spad{coerce(s)} extracts an identifier from the syntax `s'.") (((|DoubleFloat|) $) "\\spad{coerce(s)} extracts a float value from the syntax `s'.") (((|Integer|) $) "\\spad{coerce(s)} extracts and integer value from the syntax `s'")) (|convert| (($ (|SExpression|)) "\\spad{convert(s)} converts an \\spad{s}-expression to Syntax. Note,{} when `s' is not an atom,{} it is expected that it designates a proper list,{} \\spadignore{e.g.} a sequence of cons cells ending with nil.") (((|SExpression|) $) "\\spad{convert(s)} returns the \\spad{s}-expression representation of a syntax."))) NIL NIL -(-1203 N) +(-1202 N) ((|constructor| (NIL "This domain implements sized (signed) integer datatypes parameterized by the precision (or width) of the underlying representation. The intent is that they map directly to the hosting hardware natural integer datatypes. Consequently,{} natural values for \\spad{N} are: 8,{} 16,{} 32,{} 64,{} etc. These datatypes are mostly useful for system programming tasks,{} \\spadignore{i.e.} interfacting with the hosting operating system,{} reading/writing external binary format files.")) (|sample| (($) "\\spad{sample} gives a sample datum of this type."))) NIL NIL -(-1204 N) +(-1203 N) ((|constructor| (NIL "This domain implements sized (unsigned) integer datatypes parameterized by the precision (or width) of the underlying representation. The intent is that they map directly to the hosting hardware natural integer datatypes. Consequently,{} natural values for \\spad{N} are: 8,{} 16,{} 32,{} 64,{} etc. These datatypes are mostly useful for system programming tasks,{} \\spadignore{i.e.} interfacting with the hosting operating system,{} reading/writing external binary format files.")) (|sample| (($) "\\spad{sample} gives a sample datum of type Byte.")) (|bitior| (($ $ $) "\\spad{bitior(x,y)} returns the bitwise `inclusive or' of `x' and `y'.")) (|bitand| (($ $ $) "\\spad{bitand(x,y)} returns the bitwise `and' of `x' and `y'."))) NIL NIL -(-1205) +(-1204) ((|constructor| (NIL "This domain is a datatype system-level pointer values."))) NIL NIL -(-1206 R) +(-1205 R) ((|triangularSystems| (((|List| (|List| (|Polynomial| |#1|))) (|List| (|Fraction| (|Polynomial| |#1|))) (|List| (|Symbol|))) "\\spad{triangularSystems(lf,lv)} solves the system of equations defined by \\spad{lf} with respect to the list of symbols \\spad{lv}; the system of equations is obtaining by equating to zero the list of rational functions \\spad{lf}. The output is a list of solutions where each solution is expressed as a \"reduced\" triangular system of polynomials.")) (|solve| (((|List| (|Equation| (|Fraction| (|Polynomial| |#1|)))) (|Equation| (|Fraction| (|Polynomial| |#1|)))) "\\spad{solve(eq)} finds the solutions of the equation \\spad{eq} with respect to the unique variable appearing in \\spad{eq}.") (((|List| (|Equation| (|Fraction| (|Polynomial| |#1|)))) (|Fraction| (|Polynomial| |#1|))) "\\spad{solve(p)} finds the solution of a rational function \\spad{p} = 0 with respect to the unique variable appearing in \\spad{p}.") (((|List| (|Equation| (|Fraction| (|Polynomial| |#1|)))) (|Equation| (|Fraction| (|Polynomial| |#1|))) (|Symbol|)) "\\spad{solve(eq,v)} finds the solutions of the equation \\spad{eq} with respect to the variable \\spad{v}.") (((|List| (|Equation| (|Fraction| (|Polynomial| |#1|)))) (|Fraction| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{solve(p,v)} solves the equation \\spad{p=0},{} where \\spad{p} is a rational function with respect to the variable \\spad{v}.") (((|List| (|List| (|Equation| (|Fraction| (|Polynomial| |#1|))))) (|List| (|Equation| (|Fraction| (|Polynomial| |#1|))))) "\\spad{solve(le)} finds the solutions of the list \\spad{le} of equations of rational functions with respect to all symbols appearing in \\spad{le}.") (((|List| (|List| (|Equation| (|Fraction| (|Polynomial| |#1|))))) (|List| (|Fraction| (|Polynomial| |#1|)))) "\\spad{solve(lp)} finds the solutions of the list \\spad{lp} of rational functions with respect to all symbols appearing in \\spad{lp}.") (((|List| (|List| (|Equation| (|Fraction| (|Polynomial| |#1|))))) (|List| (|Equation| (|Fraction| (|Polynomial| |#1|)))) (|List| (|Symbol|))) "\\spad{solve(le,lv)} finds the solutions of the list \\spad{le} of equations of rational functions with respect to the list of symbols \\spad{lv}.") (((|List| (|List| (|Equation| (|Fraction| (|Polynomial| |#1|))))) (|List| (|Fraction| (|Polynomial| |#1|))) (|List| (|Symbol|))) "\\spad{solve(lp,lv)} finds the solutions of the list \\spad{lp} of rational functions with respect to the list of symbols \\spad{lv}."))) NIL NIL -(-1207) +(-1206) ((|constructor| (NIL "The package \\spadtype{System} provides information about the runtime system and its characteristics.")) (|loadNativeModule| (((|Void|) (|String|)) "\\spad{loadNativeModule(path)} loads the native modile designated by \\spadvar{\\spad{path}}.")) (|nativeModuleExtension| (((|String|)) "\\spad{nativeModuleExtension} is a string representation of a filename extension for native modules.")) (|hostByteOrder| (((|ByteOrder|)) "\\sapd{hostByteOrder}")) (|hostPlatform| (((|String|)) "\\spad{hostPlatform} is a string `triplet' description of the platform hosting the running OpenAxiom system.")) (|rootDirectory| (((|String|)) "\\spad{rootDirectory()} returns the pathname of the root directory for the running OpenAxiom system."))) NIL NIL -(-1208 S) +(-1207 S) ((|constructor| (NIL "TableauBumpers implements the Schenstead-Knuth correspondence between sequences and pairs of Young tableaux. The 2 Young tableaux are represented as a single tableau with pairs as components.")) (|mr| (((|Record| (|:| |f1| (|List| |#1|)) (|:| |f2| (|List| (|List| (|List| |#1|)))) (|:| |f3| (|List| (|List| |#1|))) (|:| |f4| (|List| (|List| (|List| |#1|))))) (|List| (|List| (|List| |#1|)))) "\\spad{mr(t)} is an auxiliary function which finds the position of the maximum element of a tableau \\spad{t} which is in the lowest row,{} producing a record of results")) (|maxrow| (((|Record| (|:| |f1| (|List| |#1|)) (|:| |f2| (|List| (|List| (|List| |#1|)))) (|:| |f3| (|List| (|List| |#1|))) (|:| |f4| (|List| (|List| (|List| |#1|))))) (|List| |#1|) (|List| (|List| (|List| |#1|))) (|List| (|List| |#1|)) (|List| (|List| (|List| |#1|))) (|List| (|List| (|List| |#1|))) (|List| (|List| (|List| |#1|)))) "\\spad{maxrow(a,b,c,d,e)} is an auxiliary function for mr")) (|inverse| (((|List| |#1|) (|List| |#1|)) "\\spad{inverse(ls)} forms the inverse of a sequence \\spad{ls}")) (|slex| (((|List| (|List| |#1|)) (|List| |#1|)) "\\spad{slex(ls)} sorts the argument sequence \\spad{ls},{} then zips (see \\spadfunFrom{map}{\\spad{ListFunctions3}}) the original argument sequence with the sorted result to a list of pairs")) (|lex| (((|List| (|List| |#1|)) (|List| (|List| |#1|))) "\\spad{lex(ls)} sorts a list of pairs to lexicographic order")) (|tab| (((|Tableau| (|List| |#1|)) (|List| |#1|)) "\\spad{tab(ls)} creates a tableau from \\spad{ls} by first creating a list of pairs using \\spadfunFrom{slex}{TableauBumpers},{} then creating a tableau using \\spadfunFrom{\\spad{tab1}}{TableauBumpers}.")) (|tab1| (((|List| (|List| (|List| |#1|))) (|List| (|List| |#1|))) "\\spad{tab1(lp)} creates a tableau from a list of pairs \\spad{lp}")) (|bat| (((|List| (|List| |#1|)) (|Tableau| (|List| |#1|))) "\\spad{bat(ls)} unbumps a tableau \\spad{ls}")) (|bat1| (((|List| (|List| |#1|)) (|List| (|List| (|List| |#1|)))) "\\spad{bat1(llp)} unbumps a tableau \\spad{llp}. Operation \\spad{bat1} is the inverse of \\spad{tab1}.")) (|untab| (((|List| (|List| |#1|)) (|List| (|List| |#1|)) (|List| (|List| (|List| |#1|)))) "\\spad{untab(lp,llp)} is an auxiliary function which unbumps a tableau \\spad{llp},{} using \\spad{lp} to accumulate pairs")) (|bumptab1| (((|List| (|List| (|List| |#1|))) (|List| |#1|) (|List| (|List| (|List| |#1|)))) "\\spad{bumptab1(pr,t)} bumps a tableau \\spad{t} with a pair \\spad{pr} using comparison function \\spadfun{<},{} returning a new tableau")) (|bumptab| (((|List| (|List| (|List| |#1|))) (|Mapping| (|Boolean|) |#1| |#1|) (|List| |#1|) (|List| (|List| (|List| |#1|)))) "\\spad{bumptab(cf,pr,t)} bumps a tableau \\spad{t} with a pair \\spad{pr} using comparison function \\spad{cf},{} returning a new tableau")) (|bumprow| (((|Record| (|:| |fs| (|Boolean|)) (|:| |sd| (|List| |#1|)) (|:| |td| (|List| (|List| |#1|)))) (|Mapping| (|Boolean|) |#1| |#1|) (|List| |#1|) (|List| (|List| |#1|))) "\\spad{bumprow(cf,pr,r)} is an auxiliary function which bumps a row \\spad{r} with a pair \\spad{pr} using comparison function \\spad{cf},{} and returns a record"))) NIL NIL -(-1209 |Key| |Entry|) +(-1208 |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}"))) -((-4424 . T) (-4425 . T)) -((-12 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4289) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2285) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (-3956 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -630) (QUOTE (-547)))) (-12 (|HasCategory| |#2| (QUOTE (-1121))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#2| (QUOTE (-1121))) (-3956 (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876))))) (-3956 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| (-2 (|:| -4289 |#1|) (|:| -2285 |#2|)) (QUOTE (-102)))) -(-1210 S) +((-4423 . T) (-4424 . T)) +((-12 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -4288) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -2284) (|devaluate| |#2|))))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (-3955 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -629) (QUOTE (-546)))) (-12 (|HasCategory| |#2| (QUOTE (-1120))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#2| (QUOTE (-1120))) (-3955 (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875))))) (-3955 (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| (-2 (|:| -4288 |#1|) (|:| -2284 |#2|)) (QUOTE (-102)))) +(-1209 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 NIL -(-1211 S) +(-1210 S) ((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: April 17,{} 2010 Date Last Modified: April 17,{} 2010")) (|operator| (($ |#1| (|Arity|)) "\\spad{operator(n,a)} returns an operator named \\spad{n} and with arity \\spad{a}."))) NIL NIL -(-1212 R) +(-1211 R) ((|constructor| (NIL "Expands tangents of sums and scalar products.")) (|tanNa| ((|#1| |#1| (|Integer|)) "\\spad{tanNa(a, n)} returns \\spad{f(a)} such that if \\spad{a = tan(u)} then \\spad{f(a) = tan(n * u)}.")) (|tanAn| (((|SparseUnivariatePolynomial| |#1|) |#1| (|PositiveInteger|)) "\\spad{tanAn(a, n)} returns \\spad{P(x)} such that if \\spad{a = tan(u)} then \\spad{P(tan(u/n)) = 0}.")) (|tanSum| ((|#1| (|List| |#1|)) "\\spad{tanSum([a1,...,an])} returns \\spad{f(a1,...,an)} such that if \\spad{ai = tan(ui)} then \\spad{f(a1,...,an) = tan(u1 + ... + un)}."))) NIL NIL -(-1213 S |Key| |Entry|) +(-1212 S |Key| |Entry|) ((|constructor| (NIL "A table aggregate is a model of a table,{} \\spadignore{i.e.} a discrete many-to-one mapping from keys to entries.")) (|map| (($ (|Mapping| |#3| |#3| |#3|) $ $) "\\spad{map(fn,t1,t2)} creates a new table \\spad{t} from given tables \\spad{t1} and \\spad{t2} with elements \\spad{fn}(\\spad{x},{}\\spad{y}) where \\spad{x} and \\spad{y} are corresponding elements from \\spad{t1} and \\spad{t2} respectively.")) (|table| (($ (|List| (|Record| (|:| |key| |#2|) (|:| |entry| |#3|)))) "\\spad{table([x,y,...,z])} creates a table consisting of entries \\axiom{\\spad{x},{}\\spad{y},{}...,{}\\spad{z}}.") (($) "\\spad{table()}\\$\\spad{T} creates an empty table of type \\spad{T}.")) (|setelt| ((|#3| $ |#2| |#3|) "\\spad{setelt(t,k,e)} (also written \\axiom{\\spad{t}.\\spad{k} := \\spad{e}}) is equivalent to \\axiom{(insert([\\spad{k},{}\\spad{e}],{}\\spad{t}); \\spad{e})}."))) NIL NIL -(-1214 |Key| |Entry|) +(-1213 |Key| |Entry|) ((|constructor| (NIL "A table aggregate is a model of a table,{} \\spadignore{i.e.} a discrete many-to-one mapping from keys to entries.")) (|map| (($ (|Mapping| |#2| |#2| |#2|) $ $) "\\spad{map(fn,t1,t2)} creates a new table \\spad{t} from given tables \\spad{t1} and \\spad{t2} with elements \\spad{fn}(\\spad{x},{}\\spad{y}) where \\spad{x} and \\spad{y} are corresponding elements from \\spad{t1} and \\spad{t2} respectively.")) (|table| (($ (|List| (|Record| (|:| |key| |#1|) (|:| |entry| |#2|)))) "\\spad{table([x,y,...,z])} creates a table consisting of entries \\axiom{\\spad{x},{}\\spad{y},{}...,{}\\spad{z}}.") (($) "\\spad{table()}\\$\\spad{T} creates an empty table of type \\spad{T}.")) (|setelt| ((|#2| $ |#1| |#2|) "\\spad{setelt(t,k,e)} (also written \\axiom{\\spad{t}.\\spad{k} := \\spad{e}}) is equivalent to \\axiom{(insert([\\spad{k},{}\\spad{e}],{}\\spad{t}); \\spad{e})}."))) -((-4425 . T)) +((-4424 . T)) NIL -(-1215 |Key| |Entry|) +(-1214 |Key| |Entry|) ((|constructor| (NIL "\\axiom{TabulatedComputationPackage(Key ,{}Entry)} provides some modest support for dealing with operations with type \\axiom{Key -> Entry}. The result of such operations can be stored and retrieved with this package by using a hash-table. The user does not need to worry about the management of this hash-table. However,{} onnly one hash-table is built by calling \\axiom{TabulatedComputationPackage(Key ,{}Entry)}.")) (|insert!| (((|Void|) |#1| |#2|) "\\axiom{insert!(\\spad{x},{}\\spad{y})} stores the item whose key is \\axiom{\\spad{x}} and whose entry is \\axiom{\\spad{y}}.")) (|extractIfCan| (((|Union| |#2| "failed") |#1|) "\\axiom{extractIfCan(\\spad{x})} searches the item whose key is \\axiom{\\spad{x}}.")) (|makingStats?| (((|Boolean|)) "\\axiom{makingStats?()} returns \\spad{true} iff the statisitics process is running.")) (|printingInfo?| (((|Boolean|)) "\\axiom{printingInfo?()} returns \\spad{true} iff messages are printed when manipulating items from the hash-table.")) (|usingTable?| (((|Boolean|)) "\\axiom{usingTable?()} returns \\spad{true} iff the hash-table is used")) (|clearTable!| (((|Void|)) "\\axiom{clearTable!()} clears the hash-table and assumes that it will no longer be used.")) (|printStats!| (((|Void|)) "\\axiom{printStats!()} prints the statistics.")) (|startStats!| (((|Void|) (|String|)) "\\axiom{startStats!(\\spad{x})} initializes the statisitics process and sets the comments to display when statistics are printed")) (|printInfo!| (((|Void|) (|String|) (|String|)) "\\axiom{printInfo!(\\spad{x},{}\\spad{y})} initializes the mesages to be printed when manipulating items from the hash-table. If a key is retrieved then \\axiom{\\spad{x}} is displayed. If an item is stored then \\axiom{\\spad{y}} is displayed.")) (|initTable!| (((|Void|)) "\\axiom{initTable!()} initializes the hash-table."))) NIL NIL -(-1216) +(-1215) ((|constructor| (NIL "This package provides functions for template manipulation")) (|stripCommentsAndBlanks| (((|String|) (|String|)) "\\spad{stripCommentsAndBlanks(s)} treats \\spad{s} as a piece of AXIOM input,{} and removes comments,{} and leading and trailing blanks.")) (|interpretString| (((|Any|) (|String|)) "\\spad{interpretString(s)} treats a string as a piece of AXIOM input,{} by parsing and interpreting it."))) NIL NIL -(-1217) +(-1216) ((|constructor| (NIL "\\spadtype{TexFormat} provides a coercion from \\spadtype{OutputForm} to \\TeX{} format. The particular dialect of \\TeX{} used is \\LaTeX{}. The basic object consists of three parts: a prologue,{} a tex part and an epilogue. The functions \\spadfun{prologue},{} \\spadfun{tex} and \\spadfun{epilogue} extract these parts,{} respectively. The main guts of the expression go into the tex part. The other parts can be set (\\spadfun{setPrologue!},{} \\spadfun{setEpilogue!}) so that contain the appropriate tags for printing. For example,{} the prologue and epilogue might simply contain ``\\verb+\\[+'' and ``\\verb+\\]+'',{} respectively,{} so that the TeX section will be printed in LaTeX display math mode.")) (|setPrologue!| (((|List| (|String|)) $ (|List| (|String|))) "\\spad{setPrologue!(t,strings)} sets the prologue section of a TeX form \\spad{t} to \\spad{strings}.")) (|setTex!| (((|List| (|String|)) $ (|List| (|String|))) "\\spad{setTex!(t,strings)} sets the TeX section of a TeX form \\spad{t} to \\spad{strings}.")) (|setEpilogue!| (((|List| (|String|)) $ (|List| (|String|))) "\\spad{setEpilogue!(t,strings)} sets the epilogue section of a TeX form \\spad{t} to \\spad{strings}.")) (|prologue| (((|List| (|String|)) $) "\\spad{prologue(t)} extracts the prologue section of a TeX form \\spad{t}.")) (|new| (($) "\\spad{new()} create a new,{} empty object. Use \\spadfun{setPrologue!},{} \\spadfun{setTex!} and \\spadfun{setEpilogue!} to set the various components of this object.")) (|tex| (((|List| (|String|)) $) "\\spad{tex(t)} extracts the TeX section of a TeX form \\spad{t}.")) (|epilogue| (((|List| (|String|)) $) "\\spad{epilogue(t)} extracts the epilogue section of a TeX form \\spad{t}.")) (|display| (((|Void|) $) "\\spad{display(t)} outputs the TeX formatted code \\spad{t} so that each line has length less than or equal to the value set by the system command \\spadsyscom{set output length}.") (((|Void|) $ (|Integer|)) "\\spad{display(t,width)} outputs the TeX formatted code \\spad{t} so that each line has length less than or equal to \\spadvar{\\spad{width}}.")) (|convert| (($ (|OutputForm|) (|Integer|) (|OutputForm|)) "\\spad{convert(o,step,type)} changes \\spad{o} in standard output format to TeX format and also adds the given \\spad{step} number and \\spad{type}. This is useful if you want to create equations with given numbers or have the equation numbers correspond to the interpreter \\spad{step} numbers.") (($ (|OutputForm|) (|Integer|)) "\\spad{convert(o,step)} changes \\spad{o} in standard output format to TeX format and also adds the given \\spad{step} number. This is useful if you want to create equations with given numbers or have the equation numbers correspond to the interpreter \\spad{step} numbers."))) NIL NIL -(-1218 S) +(-1217 S) ((|constructor| (NIL "\\spadtype{TexFormat1} provides a utility coercion for changing to TeX format anything that has a coercion to the standard output format.")) (|coerce| (((|TexFormat|) |#1|) "\\spad{coerce(s)} provides a direct coercion from a domain \\spad{S} to TeX format. This allows the user to skip the step of first manually coercing the object to standard output format before it is coerced to TeX format."))) NIL NIL -(-1219) +(-1218) ((|constructor| (NIL "This domain provides an implementation of text files. Text is stored in these files using the native character set of the computer.")) (|endOfFile?| (((|Boolean|) $) "\\spad{endOfFile?(f)} tests whether the file \\spad{f} is positioned after the end of all text. If the file is open for output,{} then this test is always \\spad{true}.")) (|readIfCan!| (((|Union| (|String|) "failed") $) "\\spad{readIfCan!(f)} returns a string of the contents of a line from file \\spad{f},{} if possible. If \\spad{f} is not readable or if it is positioned at the end of file,{} then \\spad{\"failed\"} is returned.")) (|readLineIfCan!| (((|Union| (|String|) "failed") $) "\\spad{readLineIfCan!(f)} returns a string of the contents of a line from file \\spad{f},{} if possible. If \\spad{f} is not readable or if it is positioned at the end of file,{} then \\spad{\"failed\"} is returned.")) (|readLine!| (((|String|) $) "\\spad{readLine!(f)} returns a string of the contents of a line from the file \\spad{f}.")) (|writeLine!| (((|String|) $) "\\spad{writeLine!(f)} finishes the current line in the file \\spad{f}. An empty string is returned. The call \\spad{writeLine!(f)} is equivalent to \\spad{writeLine!(f,\"\")}.") (((|String|) $ (|String|)) "\\spad{writeLine!(f,s)} writes the contents of the string \\spad{s} and finishes the current line in the file \\spad{f}. The value of \\spad{s} is returned."))) NIL NIL -(-1220 R) +(-1219 R) ((|constructor| (NIL "Tools for the sign finding utilities.")) (|direction| (((|Integer|) (|String|)) "\\spad{direction(s)} \\undocumented")) (|nonQsign| (((|Union| (|Integer|) "failed") |#1|) "\\spad{nonQsign(r)} \\undocumented")) (|sign| (((|Union| (|Integer|) "failed") |#1|) "\\spad{sign(r)} \\undocumented"))) NIL NIL -(-1221) +(-1220) ((|constructor| (NIL "This package exports a function for making a \\spadtype{ThreeSpace}")) (|createThreeSpace| (((|ThreeSpace| (|DoubleFloat|))) "\\spad{createThreeSpace()} creates a \\spadtype{ThreeSpace(DoubleFloat)} object capable of holding point,{} curve,{} mesh components and any combination."))) NIL NIL -(-1222 S) +(-1221 S) ((|constructor| (NIL "Category for the transcendental elementary functions.")) (|pi| (($) "\\spad{pi()} returns the constant \\spad{pi}."))) NIL NIL -(-1223) +(-1222) ((|constructor| (NIL "Category for the transcendental elementary functions.")) (|pi| (($) "\\spad{pi()} returns the constant \\spad{pi}."))) NIL NIL -(-1224 S) +(-1223 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}."))) -((-4425 . T) (-4424 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1121))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1121)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102)))) -(-1225 S) +((-4424 . T) (-4423 . T)) +((-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1120))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1120)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102)))) +(-1224 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 NIL -(-1226) +(-1225) ((|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 -(-1227 R -3494) +(-1226 R -3493) ((|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 -(-1228 R |Row| |Col| M) +(-1227 R |Row| |Col| M) ((|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 -(-1229 R -3494) +(-1228 R -3493) ((|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 -630) (|%list| (QUOTE -904) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -900) (|devaluate| |#1|))) (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (|devaluate| |#1|)))) (|HasCategory| |#2| (|%list| (QUOTE -900) (|devaluate| |#1|))))) -(-1230 |Coef|) +((-12 (|HasCategory| |#1| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -899) (|devaluate| |#1|))) (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (|devaluate| |#1|)))) (|HasCategory| |#2| (|%list| (QUOTE -899) (|devaluate| |#1|))))) +(-1229 |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}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-376)))) -(-1231 S R E V P) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-376)))) +(-1230 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 ((|HasCategory| |#4| (QUOTE (-381)))) -(-1232 R E V P) +(-1231 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| (($ $ |#4|) "\\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") $ |#4|) "\\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| |#4| "failed") $ |#3|) "\\axiom{select(ts,{}\\spad{v})} returns the polynomial of \\axiom{ts} with \\axiom{\\spad{v}} as main variable,{} if any.")) (|algebraic?| (((|Boolean|) |#3| $) "\\axiom{algebraic?(\\spad{v},{}ts)} returns \\spad{true} iff \\axiom{\\spad{v}} is the main variable of some polynomial in \\axiom{ts}.")) (|algebraicVariables| (((|List| |#3|) $) "\\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| |#4| "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| |#4| "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| |#4|)))) (|List| |#4|)) "\\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| |#4|)) "\\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| ((|#4| |#4| $) "\\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| ((|#4| |#4| $) "\\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| ((|#4| |#4| $) "\\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| ((|#4| |#4| $) "\\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| ((|#4| |#4| $) "\\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| |#4|) (|List| |#4|) $ (|Mapping| |#4| |#4| |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\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| ((|#4| |#4| $ (|Mapping| |#4| |#4| |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\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|) |#4| (|List| |#4|))) "\\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|) |#4| $) "\\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|) |#4| $) "\\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|) |#4| $) "\\axiom{stronglyReduced?(\\spad{p},{}ts)} returns \\spad{true} iff \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{ts}.")) (|reduced?| (((|Boolean|) |#4| $ (|Mapping| (|Boolean|) |#4| |#4|)) "\\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|) |#4| $) "\\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| |#4|)) (|:| |open| (|List| |#4|))) $) "\\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| |#4|) $) "\\axiom{initials(ts)} returns the list of the non-constant initials of the members of \\axiom{ts}.")) (|basicSet| (((|Union| (|Record| (|:| |bas| $) (|:| |top| (|List| |#4|))) "failed") (|List| |#4|) (|Mapping| (|Boolean|) |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\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| |#4|))) "failed") (|List| |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\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."))) -((-4425 . T) (-4424 . T)) +((-4424 . T) (-4423 . T)) NIL -(-1233 |Curve|) +(-1232 |Curve|) ((|constructor| (NIL "\\indented{2}{Package for constructing tubes around 3-dimensional parametric curves.} Domain of tubes around 3-dimensional parametric curves.")) (|tube| (($ |#1| (|List| (|List| (|Point| (|DoubleFloat|)))) (|Boolean|)) "\\spad{tube(c,ll,b)} creates a tube of the domain \\spadtype{TubePlot} from a space curve \\spad{c} of the category \\spadtype{PlottableSpaceCurveCategory},{} a list of lists of points (loops) \\spad{ll} and a boolean \\spad{b} which if \\spad{true} indicates a closed tube,{} or if \\spad{false} an open tube.")) (|setClosed| (((|Boolean|) $ (|Boolean|)) "\\spad{setClosed(t,b)} declares the given tube plot \\spad{t} to be closed if \\spad{b} is \\spad{true},{} or if \\spad{b} is \\spad{false},{} \\spad{t} is set to be open.")) (|open?| (((|Boolean|) $) "\\spad{open?(t)} tests whether the given tube plot \\spad{t} is open.")) (|closed?| (((|Boolean|) $) "\\spad{closed?(t)} tests whether the given tube plot \\spad{t} is closed.")) (|listLoops| (((|List| (|List| (|Point| (|DoubleFloat|)))) $) "\\spad{listLoops(t)} returns the list of lists of points,{} or the 'loops',{} of the given tube plot \\spad{t}.")) (|getCurve| ((|#1| $) "\\spad{getCurve(t)} returns the \\spadtype{PlottableSpaceCurveCategory} representing the parametric curve of the given tube plot \\spad{t}."))) NIL NIL -(-1234) +(-1233) ((|constructor| (NIL "Tools for constructing tubes around 3-dimensional parametric curves.")) (|loopPoints| (((|List| (|Point| (|DoubleFloat|))) (|Point| (|DoubleFloat|)) (|Point| (|DoubleFloat|)) (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|List| (|List| (|DoubleFloat|)))) "\\spad{loopPoints(p,n,b,r,lls)} creates and returns a list of points which form the loop with radius \\spad{r},{} around the center point indicated by the point \\spad{p},{} with the principal normal vector of the space curve at point \\spad{p} given by the point(vector) \\spad{n},{} and the binormal vector given by the point(vector) \\spad{b},{} and a list of lists,{} \\spad{lls},{} which is the \\spadfun{cosSinInfo} of the number of points defining the loop.")) (|cosSinInfo| (((|List| (|List| (|DoubleFloat|))) (|Integer|)) "\\spad{cosSinInfo(n)} returns the list of lists of values for \\spad{n},{} in the form: \\spad{[[cos(n - 1) a,sin(n - 1) a],...,[cos 2 a,sin 2 a],[cos a,sin a]]} where \\spad{a = 2 pi/n}. Note: \\spad{n} should be greater than 2.")) (|unitVector| (((|Point| (|DoubleFloat|)) (|Point| (|DoubleFloat|))) "\\spad{unitVector(p)} creates the unit vector of the point \\spad{p} and returns the result as a point. Note: \\spad{unitVector(p) = p/|p|}.")) (|cross| (((|Point| (|DoubleFloat|)) (|Point| (|DoubleFloat|)) (|Point| (|DoubleFloat|))) "\\spad{cross(p,q)} computes the cross product of the two points \\spad{p} and \\spad{q} using only the first three coordinates,{} and keeping the color of the first point \\spad{p}. The result is returned as a point.")) (|dot| (((|DoubleFloat|) (|Point| (|DoubleFloat|)) (|Point| (|DoubleFloat|))) "\\spad{dot(p,q)} computes the dot product of the two points \\spad{p} and \\spad{q} using only the first three coordinates,{} and returns the resulting \\spadtype{DoubleFloat}.")) (- (((|Point| (|DoubleFloat|)) (|Point| (|DoubleFloat|)) (|Point| (|DoubleFloat|))) "\\spad{p - q} computes and returns a point whose coordinates are the differences of the coordinates of two points \\spad{p} and \\spad{q},{} using the color,{} or fourth coordinate,{} of the first point \\spad{p} as the color also of the point \\spad{q}.")) (+ (((|Point| (|DoubleFloat|)) (|Point| (|DoubleFloat|)) (|Point| (|DoubleFloat|))) "\\spad{p + q} computes and returns a point whose coordinates are the sums of the coordinates of the two points \\spad{p} and \\spad{q},{} using the color,{} or fourth coordinate,{} of the first point \\spad{p} as the color also of the point \\spad{q}.")) (* (((|Point| (|DoubleFloat|)) (|DoubleFloat|) (|Point| (|DoubleFloat|))) "\\spad{s * p} returns a point whose coordinates are the scalar multiple of the point \\spad{p} by the scalar \\spad{s},{} preserving the color,{} or fourth coordinate,{} of \\spad{p}.")) (|point| (((|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "\\spad{point(x1,x2,x3,c)} creates and returns a point from the three specified coordinates \\spad{x1},{} \\spad{x2},{} \\spad{x3},{} and also a fourth coordinate,{} \\spad{c},{} which is generally used to specify the color of the point."))) NIL NIL -(-1235 S) +(-1234 S) ((|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 (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) -(-1236 -3494) +((|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) +(-1235 -3493) ((|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 -(-1237) +(-1236) ((|constructor| (NIL "The fundamental Type."))) NIL NIL -(-1238) +(-1237) ((|constructor| (NIL "This domain represents a type AST."))) NIL NIL -(-1239 S) +(-1238 S) ((|constructor| (NIL "Provides functions to force a partial ordering on any set.")) (|more?| (((|Boolean|) |#1| |#1|) "\\spad{more?(a, b)} compares \\spad{a} and \\spad{b} in the partial ordering induced by setOrder,{} and uses the ordering on \\spad{S} if \\spad{a} and \\spad{b} are not comparable in the partial ordering.")) (|userOrdered?| (((|Boolean|)) "\\spad{userOrdered?()} tests if the partial ordering induced by \\spadfunFrom{setOrder}{UserDefinedPartialOrdering} is not empty.")) (|largest| ((|#1| (|List| |#1|)) "\\spad{largest l} returns the largest element of \\spad{l} where the partial ordering induced by setOrder is completed into a total one by the ordering on \\spad{S}.") ((|#1| (|List| |#1|) (|Mapping| (|Boolean|) |#1| |#1|)) "\\spad{largest(l, fn)} returns the largest element of \\spad{l} where the partial ordering induced by setOrder is completed into a total one by fn.")) (|less?| (((|Boolean|) |#1| |#1| (|Mapping| (|Boolean|) |#1| |#1|)) "\\spad{less?(a, b, fn)} compares \\spad{a} and \\spad{b} in the partial ordering induced by setOrder,{} and returns \\spad{fn(a, b)} if \\spad{a} and \\spad{b} are not comparable in that ordering.") (((|Union| (|Boolean|) "failed") |#1| |#1|) "\\spad{less?(a, b)} compares \\spad{a} and \\spad{b} in the partial ordering induced by setOrder.")) (|getOrder| (((|Record| (|:| |low| (|List| |#1|)) (|:| |high| (|List| |#1|)))) "\\spad{getOrder()} returns \\spad{[[b1,...,bm], [a1,...,an]]} such that the partial ordering on \\spad{S} was given by \\spad{setOrder([b1,...,bm],[a1,...,an])}.")) (|setOrder| (((|Void|) (|List| |#1|) (|List| |#1|)) "\\spad{setOrder([b1,...,bm], [a1,...,an])} defines a partial ordering on \\spad{S} given by: \\indented{3}{(1)\\space{2}\\spad{b1 < b2 < ... < bm < a1 < a2 < ... < an}.} \\indented{3}{(2)\\space{2}\\spad{bj < c < ai}\\space{2}for \\spad{c} not among the \\spad{ai}'s and bj's.} \\indented{3}{(3)\\space{2}undefined on \\spad{(c,d)} if neither is among the \\spad{ai}'s,{}bj's.}") (((|Void|) (|List| |#1|)) "\\spad{setOrder([a1,...,an])} defines a partial ordering on \\spad{S} given by: \\indented{3}{(1)\\space{2}\\spad{a1 < a2 < ... < an}.} \\indented{3}{(2)\\space{2}\\spad{b < ai\\space{3}for i = 1..n} and \\spad{b} not among the \\spad{ai}'s.} \\indented{3}{(3)\\space{2}undefined on \\spad{(b, c)} if neither is among the \\spad{ai}'s.}"))) NIL -((|HasCategory| |#1| (QUOTE (-860)))) -(-1240) +((|HasCategory| |#1| (QUOTE (-859)))) +(-1239) ((|constructor| (NIL "This packages provides functions to allow the user to select the ordering on the variables and operators for displaying polynomials,{} fractions and expressions. The ordering affects the display only and not the computations.")) (|resetVariableOrder| (((|Void|)) "\\spad{resetVariableOrder()} cancels any previous use of setVariableOrder and returns to the default system ordering.")) (|getVariableOrder| (((|Record| (|:| |high| (|List| (|Symbol|))) (|:| |low| (|List| (|Symbol|))))) "\\spad{getVariableOrder()} returns \\spad{[[b1,...,bm], [a1,...,an]]} such that the ordering on the variables was given by \\spad{setVariableOrder([b1,...,bm], [a1,...,an])}.")) (|setVariableOrder| (((|Void|) (|List| (|Symbol|)) (|List| (|Symbol|))) "\\spad{setVariableOrder([b1,...,bm], [a1,...,an])} defines an ordering on the variables given by \\spad{b1 > b2 > ... > bm >} other variables \\spad{> a1 > a2 > ... > an}.") (((|Void|) (|List| (|Symbol|))) "\\spad{setVariableOrder([a1,...,an])} defines an ordering on the variables given by \\spad{a1 > a2 > ... > an > other variables}."))) NIL NIL -(-1241 S) +(-1240 S) ((|constructor| (NIL "A constructive unique factorization domain,{} \\spadignore{i.e.} where we can constructively factor members into a product of a finite number of irreducible elements.")) (|factor| (((|Factored| $) $) "\\spad{factor(x)} returns the factorization of \\spad{x} into irreducibles.")) (|squareFreePart| (($ $) "\\spad{squareFreePart(x)} returns a product of prime factors of \\spad{x} each taken with multiplicity one.")) (|squareFree| (((|Factored| $) $) "\\spad{squareFree(x)} returns the square-free factorization of \\spad{x} \\spadignore{i.e.} such that the factors are pairwise relatively prime and each has multiple prime factors.")) (|prime?| (((|Boolean|) $) "\\spad{prime?(x)} tests if \\spad{x} can never be written as the product of two non-units of the ring,{} \\spadignore{i.e.} \\spad{x} is an irreducible element."))) NIL NIL -(-1242) +(-1241) ((|constructor| (NIL "A constructive unique factorization domain,{} \\spadignore{i.e.} where we can constructively factor members into a product of a finite number of irreducible elements.")) (|factor| (((|Factored| $) $) "\\spad{factor(x)} returns the factorization of \\spad{x} into irreducibles.")) (|squareFreePart| (($ $) "\\spad{squareFreePart(x)} returns a product of prime factors of \\spad{x} each taken with multiplicity one.")) (|squareFree| (((|Factored| $) $) "\\spad{squareFree(x)} returns the square-free factorization of \\spad{x} \\spadignore{i.e.} such that the factors are pairwise relatively prime and each has multiple prime factors.")) (|prime?| (((|Boolean|) $) "\\spad{prime?(x)} tests if \\spad{x} can never be written as the product of two non-units of the ring,{} \\spadignore{i.e.} \\spad{x} is an irreducible element."))) -((-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1243) +(-1242) ((|constructor| (NIL "This domain is a datatype for (unsigned) integer values of precision 16 bits."))) NIL NIL -(-1244) +(-1243) ((|constructor| (NIL "This domain is a datatype for (unsigned) integer values of precision 32 bits."))) NIL NIL -(-1245) +(-1244) ((|constructor| (NIL "This domain is a datatype for (unsigned) integer values of precision 64 bits."))) NIL NIL -(-1246) +(-1245) ((|constructor| (NIL "This domain is a datatype for (unsigned) integer values of precision 8 bits."))) NIL NIL -(-1247 |Coef| |var| |cen|) +(-1246 |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."))) -(((-4426 "*") -3956 (-2960 (|has| |#1| (-376)) (|has| (-1277 |#1| |#2| |#3|) (-841))) (|has| |#1| (-175)) (-2960 (|has| |#1| (-376)) (|has| (-1277 |#1| |#2| |#3|) (-928)))) (-4417 -3956 (-2960 (|has| |#1| (-376)) (|has| (-1277 |#1| |#2| |#3|) (-841))) (|has| |#1| (-569)) (-2960 (|has| |#1| (-376)) (|has| (-1277 |#1| |#2| |#3|) (-928)))) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) (-4418 . T) (-4419 . T) (-4421 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-928)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -630) (QUOTE (-547))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1277) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1277) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1277) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -526) (QUOTE (-1197)) (|%list| (QUOTE -1277) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -1058) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-841)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-860)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-1040)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-1172)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-149)))) (|HasCategory| |#1| (QUOTE (-149)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|)))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -918) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|)))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-240)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-240)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-239)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|))))) (|HasCategory| (-558) (QUOTE (-1132))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-928)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -1058) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -630) (QUOTE (-547))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-1040)))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-841)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-841)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-860))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-1172)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1277) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1277) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1277) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -526) (QUOTE (-1197)) (|%list| (QUOTE -1277) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (|HasSignature| |#1| (|%list| (QUOTE -4375) (|%list| (|devaluate| |#1|) (QUOTE (-1197)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-978))) (|HasCategory| |#1| (QUOTE (-1223))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasSignature| |#1| (|%list| (QUOTE -4241) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1197))))) (|HasSignature| |#1| (|%list| (QUOTE -3483) (|%list| (|%list| (QUOTE -660) (QUOTE (-1197))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-557)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-319)))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-928))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-147))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-928)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-841)))) (|HasCategory| |#1| (QUOTE (-569)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -1058) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-928)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-841)))) (|HasCategory| |#1| (QUOTE (-175)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (|%list| (QUOTE -918) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-239)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-860)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-928)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-147)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1277 |#1| |#2| |#3|) (QUOTE (-928)))) (|HasCategory| |#1| (QUOTE (-147))))) -(-1248 |Coef1| |Coef2| |var1| |var2| |cen1| |cen2|) +(((-4425 "*") -3955 (-2959 (|has| |#1| (-376)) (|has| (-1276 |#1| |#2| |#3|) (-840))) (|has| |#1| (-175)) (-2959 (|has| |#1| (-376)) (|has| (-1276 |#1| |#2| |#3|) (-927)))) (-4416 -3955 (-2959 (|has| |#1| (-376)) (|has| (-1276 |#1| |#2| |#3|) (-840))) (|has| |#1| (-568)) (-2959 (|has| |#1| (-376)) (|has| (-1276 |#1| |#2| |#3|) (-927)))) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) (-4417 . T) (-4418 . T) (-4420 . T)) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-927)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -629) (QUOTE (-546))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1276) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1276) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1276) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -526) (QUOTE (-1196)) (|%list| (QUOTE -1276) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -1057) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-840)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-859)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-1039)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-1171)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-149)))) (|HasCategory| |#1| (QUOTE (-149)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|)))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -917) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|)))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-240)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-240)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-239)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|))))) (|HasCategory| (-557) (QUOTE (-1131))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-927)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -1057) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -629) (QUOTE (-546))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-1039)))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-840)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-840)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-859))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-1171)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1276) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1276) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1276) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -526) (QUOTE (-1196)) (|%list| (QUOTE -1276) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-557))))) (|HasSignature| |#1| (|%list| (QUOTE -4374) (|%list| (|devaluate| |#1|) (QUOTE (-1196)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-557))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-977))) (|HasCategory| |#1| (QUOTE (-1222))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasSignature| |#1| (|%list| (QUOTE -4240) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1196))))) (|HasSignature| |#1| (|%list| (QUOTE -3482) (|%list| (|%list| (QUOTE -659) (QUOTE (-1196))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-556)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-319)))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-927))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-147))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-927)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-840)))) (|HasCategory| |#1| (QUOTE (-568)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -1057) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-927)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-840)))) (|HasCategory| |#1| (QUOTE (-175)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (|%list| (QUOTE -917) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-239)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-859)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-927)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-147)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1276 |#1| |#2| |#3|) (QUOTE (-927)))) (|HasCategory| |#1| (QUOTE (-147))))) +(-1247 |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 NIL -(-1249 |Coef|) +(-1248 |Coef|) ((|constructor| (NIL "\\spadtype{UnivariateLaurentSeriesCategory} is the category of Laurent 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 1. We may integrate a series when we can divide coefficients by integers.")) (|rationalFunction| (((|Fraction| (|Polynomial| |#1|)) $ (|Integer|) (|Integer|)) "\\spad{rationalFunction(f,k1,k2)} returns a rational function consisting of the sum of all terms of \\spad{f} of degree \\spad{d} with \\spad{k1 <= d <= k2}.") (((|Fraction| (|Polynomial| |#1|)) $ (|Integer|)) "\\spad{rationalFunction(f,k)} returns a rational function consisting of the sum of all terms of \\spad{f} of degree <= \\spad{k}.")) (|multiplyCoefficients| (($ (|Mapping| |#1| (|Integer|)) $) "\\spad{multiplyCoefficients(f,sum(n = n0..infinity,a[n] * x**n)) = sum(n = 0..infinity,f(n) * a[n] * x**n)}. This function is used when Puiseux series are represented by a Laurent series and an exponent.")) (|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."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) (-4418 . T) (-4419 . T) (-4421 . T)) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1250 S |Coef| UTS) +(-1249 S |Coef| UTS) ((|constructor| (NIL "This is a category of univariate Laurent series constructed from univariate Taylor series. A Laurent series is represented by a pair \\spad{[n,f(x)]},{} where \\spad{n} is an arbitrary integer and \\spad{f(x)} is a Taylor series. This pair represents the Laurent series \\spad{x**n * f(x)}.")) (|taylorIfCan| (((|Union| |#3| "failed") $) "\\spad{taylorIfCan(f(x))} converts the Laurent series \\spad{f(x)} to a Taylor series,{} if possible. If this is not possible,{} \"failed\" is returned.")) (|taylor| ((|#3| $) "\\spad{taylor(f(x))} converts the Laurent series \\spad{f}(\\spad{x}) to a Taylor series,{} if possible. Error: if this is not possible.")) (|removeZeroes| (($ (|Integer|) $) "\\spad{removeZeroes(n,f(x))} removes up to \\spad{n} leading zeroes from the Laurent series \\spad{f(x)}. A Laurent series is represented by (1) an exponent and (2) a Taylor series which may have leading zero coefficients. When the Taylor series has a leading zero coefficient,{} the 'leading zero' is removed from the Laurent series as follows: the series is rewritten by increasing the exponent by 1 and dividing the Taylor series by its variable.") (($ $) "\\spad{removeZeroes(f(x))} removes leading zeroes from the representation of the Laurent series \\spad{f(x)}. A Laurent series is represented by (1) an exponent and (2) a Taylor series which may have leading zero coefficients. When the Taylor series has a leading zero coefficient,{} the 'leading zero' is removed from the Laurent series as follows: the series is rewritten by increasing the exponent by 1 and dividing the Taylor series by its variable. Note: \\spad{removeZeroes(f)} removes all leading zeroes from \\spad{f}")) (|taylorRep| ((|#3| $) "\\spad{taylorRep(f(x))} returns \\spad{g(x)},{} where \\spad{f = x**n * g(x)} is represented by \\spad{[n,g(x)]}.")) (|degree| (((|Integer|) $) "\\spad{degree(f(x))} returns the degree of the lowest order term of \\spad{f(x)},{} which may have zero as a coefficient.")) (|laurent| (($ (|Integer|) |#3|) "\\spad{laurent(n,f(x))} returns \\spad{x**n * f(x)}."))) NIL ((|HasCategory| |#2| (QUOTE (-376)))) -(-1251 |Coef| UTS) +(-1250 |Coef| UTS) ((|constructor| (NIL "This is a category of univariate Laurent series constructed from univariate Taylor series. A Laurent series is represented by a pair \\spad{[n,f(x)]},{} where \\spad{n} is an arbitrary integer and \\spad{f(x)} is a Taylor series. This pair represents the Laurent series \\spad{x**n * f(x)}.")) (|taylorIfCan| (((|Union| |#2| "failed") $) "\\spad{taylorIfCan(f(x))} converts the Laurent series \\spad{f(x)} to a Taylor series,{} if possible. If this is not possible,{} \"failed\" is returned.")) (|taylor| ((|#2| $) "\\spad{taylor(f(x))} converts the Laurent series \\spad{f}(\\spad{x}) to a Taylor series,{} if possible. Error: if this is not possible.")) (|removeZeroes| (($ (|Integer|) $) "\\spad{removeZeroes(n,f(x))} removes up to \\spad{n} leading zeroes from the Laurent series \\spad{f(x)}. A Laurent series is represented by (1) an exponent and (2) a Taylor series which may have leading zero coefficients. When the Taylor series has a leading zero coefficient,{} the 'leading zero' is removed from the Laurent series as follows: the series is rewritten by increasing the exponent by 1 and dividing the Taylor series by its variable.") (($ $) "\\spad{removeZeroes(f(x))} removes leading zeroes from the representation of the Laurent series \\spad{f(x)}. A Laurent series is represented by (1) an exponent and (2) a Taylor series which may have leading zero coefficients. When the Taylor series has a leading zero coefficient,{} the 'leading zero' is removed from the Laurent series as follows: the series is rewritten by increasing the exponent by 1 and dividing the Taylor series by its variable. Note: \\spad{removeZeroes(f)} removes all leading zeroes from \\spad{f}")) (|taylorRep| ((|#2| $) "\\spad{taylorRep(f(x))} returns \\spad{g(x)},{} where \\spad{f = x**n * g(x)} is represented by \\spad{[n,g(x)]}.")) (|degree| (((|Integer|) $) "\\spad{degree(f(x))} returns the degree of the lowest order term of \\spad{f(x)},{} which may have zero as a coefficient.")) (|laurent| (($ (|Integer|) |#2|) "\\spad{laurent(n,f(x))} returns \\spad{x**n * f(x)}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) (-4418 . T) (-4419 . T) (-4421 . T)) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1252 |Coef| UTS) +(-1251 |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)}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) (-4418 . T) (-4419 . T) (-4421 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-928)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -526) (QUOTE (-1197)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-841)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-860)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1040)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1172)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (-3956 (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-147))))) (-3956 (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-149))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|)))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -918) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|)))))) (-3956 (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-240))))) (-3956 (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239))))) (|HasCategory| (-558) (QUOTE (-1132))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-928)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1040)))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-841)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-841)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-860))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-928)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -526) (QUOTE (-1197)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-841)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-860)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1040)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1172)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1172)))) (-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 -526) (QUOTE (-1197)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (|HasSignature| |#1| (|%list| (QUOTE -4375) (|%list| (|devaluate| |#1|) (QUOTE (-1197)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-978))) (|HasCategory| |#1| (QUOTE (-1223))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasSignature| |#1| (|%list| (QUOTE -4241) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1197))))) (|HasSignature| |#1| (|%list| (QUOTE -3483) (|%list| (|%list| (QUOTE -660) (QUOTE (-1197))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-860)))) (|HasCategory| |#2| (QUOTE (-928))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-557)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-319)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-147))) (-3956 (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -918) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -918) (QUOTE (-1197))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-147)))))) -(-1253 ZP) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) (-4417 . T) (-4418 . T) (-4420 . T)) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-927)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -526) (QUOTE (-1196)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-840)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-859)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1039)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1171)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (-3955 (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-147))))) (-3955 (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-149))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|)))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -917) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|)))))) (-3955 (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-240))))) (-3955 (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239))))) (|HasCategory| (-557) (QUOTE (-1131))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-927)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1039)))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-840)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-840)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-859))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-927)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -526) (QUOTE (-1196)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-840)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-859)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1039)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1171)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1171)))) (-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 -526) (QUOTE (-1196)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-557))))) (|HasSignature| |#1| (|%list| (QUOTE -4374) (|%list| (|devaluate| |#1|) (QUOTE (-1196)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-557))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-977))) (|HasCategory| |#1| (QUOTE (-1222))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasSignature| |#1| (|%list| (QUOTE -4240) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1196))))) (|HasSignature| |#1| (|%list| (QUOTE -3482) (|%list| (|%list| (QUOTE -659) (QUOTE (-1196))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-859)))) (|HasCategory| |#2| (QUOTE (-927))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-556)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-319)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-147))) (-3955 (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -917) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-557)) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -917) (QUOTE (-1196))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-147)))))) +(-1252 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 NIL -(-1254 S) +(-1253 S) ((|constructor| (NIL "This domain provides segments which may be half open. That is,{} ranges of the form \\spad{a..} or \\spad{a..b}.")) (|hasHi| (((|Boolean|) $) "\\spad{hasHi(s)} tests whether the segment \\spad{s} has an upper bound.")) (|coerce| (($ (|Segment| |#1|)) "\\spad{coerce(x)} allows \\spadtype{Segment} values to be used as \\%.")) (|segment| (($ |#1|) "\\spad{segment(l)} is an alternate way to construct the segment \\spad{l..}.")) (SEGMENT (($ |#1|) "\\spad{l..} produces a half open segment,{} that is,{} one with no upper bound."))) NIL -((|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1121)))) -(-1255 R S) +((|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1120)))) +(-1254 R S) ((|constructor| (NIL "This package provides operations for mapping functions onto segments.")) (|map| (((|Stream| |#2|) (|Mapping| |#2| |#1|) (|UniversalSegment| |#1|)) "\\spad{map(f,s)} expands the segment \\spad{s},{} applying \\spad{f} to each value.") (((|UniversalSegment| |#2|) (|Mapping| |#2| |#1|) (|UniversalSegment| |#1|)) "\\spad{map(f,seg)} returns the new segment obtained by applying \\spad{f} to the endpoints of \\spad{seg}."))) NIL -((|HasCategory| |#1| (QUOTE (-859)))) -(-1256 |x| R) +((|HasCategory| |#1| (QUOTE (-858)))) +(-1255 |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}"))) -(((-4426 "*") |has| |#2| (-175)) (-4417 |has| |#2| (-569)) (-4420 |has| |#2| (-376)) (-4422 |has| |#2| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-175))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-569)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-391)))) (|HasCategory| (-1102) (|%list| (QUOTE -900) (QUOTE (-391))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -900) (QUOTE (-558)))) (|HasCategory| (-1102) (|%list| (QUOTE -900) (QUOTE (-558))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391))))) (|HasCategory| (-1102) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-391)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558))))) (|HasCategory| (-1102) (|%list| (QUOTE -630) (|%list| (QUOTE -904) (QUOTE (-558)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| (-1102) (|%list| (QUOTE -630) (QUOTE (-547))))) (|HasCategory| |#2| (|%list| (QUOTE -657) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (QUOTE (-558)))) (-3956 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| |#2| (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (-3956 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-928)))) (-3956 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-928)))) (-3956 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-928)))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1172))) (|HasCategory| |#2| (|%list| (QUOTE -918) (QUOTE (-1197)))) (|HasCategory| |#2| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-240))) (|HasAttribute| |#2| (QUOTE -4422)) (|HasCategory| |#2| (QUOTE (-464))) (-12 (|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (-3956 (-12 (|HasCategory| |#2| (QUOTE (-928))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#2| (QUOTE (-147))))) -(-1257 |x| R |y| S) +(((-4425 "*") |has| |#2| (-175)) (-4416 |has| |#2| (-568)) (-4419 |has| |#2| (-376)) (-4421 |has| |#2| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-175))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-568)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-391)))) (|HasCategory| (-1101) (|%list| (QUOTE -899) (QUOTE (-391))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -899) (QUOTE (-557)))) (|HasCategory| (-1101) (|%list| (QUOTE -899) (QUOTE (-557))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391))))) (|HasCategory| (-1101) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-391)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557))))) (|HasCategory| (-1101) (|%list| (QUOTE -629) (|%list| (QUOTE -903) (QUOTE (-557)))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| (-1101) (|%list| (QUOTE -629) (QUOTE (-546))))) (|HasCategory| |#2| (|%list| (QUOTE -656) (QUOTE (-557)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (QUOTE (-557)))) (-3955 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| |#2| (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (-3955 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-927)))) (-3955 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-927)))) (-3955 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-927)))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1171))) (|HasCategory| |#2| (|%list| (QUOTE -917) (QUOTE (-1196)))) (|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-240))) (|HasAttribute| |#2| (QUOTE -4421)) (|HasCategory| |#2| (QUOTE (-464))) (-12 (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (-3955 (-12 (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| $ (QUOTE (-147)))) (|HasCategory| |#2| (QUOTE (-147))))) +(-1256 |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 NIL -(-1258 R Q UP) +(-1257 R Q UP) ((|constructor| (NIL "UnivariatePolynomialCommonDenominator provides functions to compute the common denominator of the coefficients of univariate polynomials over the quotient field of a gcd domain.")) (|splitDenominator| (((|Record| (|:| |num| |#3|) (|:| |den| |#1|)) |#3|) "\\spad{splitDenominator(q)} returns \\spad{[p, d]} such that \\spad{q = p/d} and \\spad{d} is a common denominator for the coefficients of \\spad{q}.")) (|clearDenominator| ((|#3| |#3|) "\\spad{clearDenominator(q)} returns \\spad{p} such that \\spad{q = p/d} where \\spad{d} is a common denominator for the coefficients of \\spad{q}.")) (|commonDenominator| ((|#1| |#3|) "\\spad{commonDenominator(q)} returns a common denominator \\spad{d} for the coefficients of \\spad{q}."))) NIL NIL -(-1259 R UP) +(-1258 R UP) ((|constructor| (NIL "UnivariatePolynomialDecompositionPackage implements functional decomposition of univariate polynomial with coefficients in an \\spad{IntegralDomain} of \\spad{CharacteristicZero}.")) (|monicCompleteDecompose| (((|List| |#2|) |#2|) "\\spad{monicCompleteDecompose(f)} returns a list of factors of \\spad{f} for the functional decomposition ([ \\spad{f1},{} ...,{} fn ] means \\spad{f} = \\spad{f1} \\spad{o} ... \\spad{o} fn).")) (|monicDecomposeIfCan| (((|Union| (|Record| (|:| |left| |#2|) (|:| |right| |#2|)) "failed") |#2|) "\\spad{monicDecomposeIfCan(f)} returns a functional decomposition of the monic polynomial \\spad{f} of \"failed\" if it has not found any.")) (|leftFactorIfCan| (((|Union| |#2| "failed") |#2| |#2|) "\\spad{leftFactorIfCan(f,h)} returns the left factor (\\spad{g} in \\spad{f} = \\spad{g} \\spad{o} \\spad{h}) of the functional decomposition of the polynomial \\spad{f} with given \\spad{h} or \\spad{\"failed\"} if \\spad{g} does not exist.")) (|rightFactorIfCan| (((|Union| |#2| "failed") |#2| (|NonNegativeInteger|) |#1|) "\\spad{rightFactorIfCan(f,d,c)} returns a candidate to be the right factor (\\spad{h} in \\spad{f} = \\spad{g} \\spad{o} \\spad{h}) of degree \\spad{d} with leading coefficient \\spad{c} of a functional decomposition of the polynomial \\spad{f} or \\spad{\"failed\"} if no such candidate.")) (|monicRightFactorIfCan| (((|Union| |#2| "failed") |#2| (|NonNegativeInteger|)) "\\spad{monicRightFactorIfCan(f,d)} returns a candidate to be the monic right factor (\\spad{h} in \\spad{f} = \\spad{g} \\spad{o} \\spad{h}) of degree \\spad{d} of a functional decomposition of the polynomial \\spad{f} or \\spad{\"failed\"} if no such candidate."))) NIL NIL -(-1260 R UP) +(-1259 R UP) ((|constructor| (NIL "UnivariatePolynomialDivisionPackage provides a division for non monic univarite polynomials with coefficients in an \\spad{IntegralDomain}.")) (|divideIfCan| (((|Union| (|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) "failed") |#2| |#2|) "\\spad{divideIfCan(f,g)} returns quotient and remainder of the division of \\spad{f} by \\spad{g} or \"failed\" if it has not succeeded."))) NIL NIL -(-1261 R U) +(-1260 R U) ((|constructor| (NIL "This package implements Karatsuba's trick for multiplying (large) univariate polynomials. It could be improved with a version doing the work on place and also with a special case for squares. We've done this in Basicmath,{} but we believe that this out of the scope of AXIOM.")) (|karatsuba| ((|#2| |#2| |#2| (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{karatsuba(a,b,l,k)} returns \\spad{a*b} by applying Karatsuba's trick provided that both \\spad{a} and \\spad{b} have at least \\spad{l} terms and \\spad{k > 0} holds and by calling \\spad{noKaratsuba} otherwise. The other multiplications are performed by recursive calls with the same third argument and \\spad{k-1} as fourth argument.")) (|karatsubaOnce| ((|#2| |#2| |#2|) "\\spad{karatsuba(a,b)} returns \\spad{a*b} by applying Karatsuba's trick once. The other multiplications are performed by calling \\spad{*} from \\spad{U}.")) (|noKaratsuba| ((|#2| |#2| |#2|) "\\spad{noKaratsuba(a,b)} returns \\spad{a*b} without using Karatsuba's trick at all."))) NIL NIL -(-1262 S R) +(-1261 S R) ((|constructor| (NIL "The category of univariate polynomials over a ring \\spad{R}. No particular model is assumed - implementations can be either sparse or dense.")) (|integrate| (($ $) "\\spad{integrate(p)} integrates the univariate polynomial \\spad{p} with respect to its distinguished variable.")) (|additiveValuation| ((|attribute|) "euclideanSize(a*b) = euclideanSize(a) + euclideanSize(\\spad{b})")) (|separate| (((|Record| (|:| |primePart| $) (|:| |commonPart| $)) $ $) "\\spad{separate(p, q)} returns \\spad{[a, b]} such that polynomial \\spad{p = a b} and \\spad{a} is relatively prime to \\spad{q}.")) (|pseudoDivide| (((|Record| (|:| |coef| |#2|) (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{pseudoDivide(p,q)} returns \\spad{[c, q, r]},{} when \\spad{p' := p*lc(q)**(deg p - deg q + 1) = c * p} is pseudo right-divided by \\spad{q},{} \\spadignore{i.e.} \\spad{p' = s q + r}.")) (|pseudoQuotient| (($ $ $) "\\spad{pseudoQuotient(p,q)} returns \\spad{r},{} the quotient when \\spad{p' := p*lc(q)**(deg p - deg q + 1)} is pseudo right-divided by \\spad{q},{} \\spadignore{i.e.} \\spad{p' = s q + r}.")) (|composite| (((|Union| (|Fraction| $) "failed") (|Fraction| $) $) "\\spad{composite(f, q)} returns \\spad{h} if \\spad{f} = \\spad{h}(\\spad{q}),{} and \"failed\" is no such \\spad{h} exists.") (((|Union| $ "failed") $ $) "\\spad{composite(p, q)} returns \\spad{h} if \\spad{p = h(q)},{} and \"failed\" no such \\spad{h} exists.")) (|subResultantGcd| (($ $ $) "\\spad{subResultantGcd(p,q)} computes the gcd of the polynomials \\spad{p} and \\spad{q} using the SubResultant GCD algorithm.")) (|order| (((|NonNegativeInteger|) $ $) "\\spad{order(p, q)} returns the largest \\spad{n} such that \\spad{q**n} divides polynomial \\spad{p} \\spadignore{i.e.} the order of \\spad{p(x)} at \\spad{q(x)=0}.")) (|elt| ((|#2| (|Fraction| $) |#2|) "\\spad{elt(a,r)} evaluates the fraction of univariate polynomials \\spad{a} with the distinguished variable replaced by the constant \\spad{r}.") (((|Fraction| $) (|Fraction| $) (|Fraction| $)) "\\spad{elt(a,b)} evaluates the fraction of univariate polynomials \\spad{a} with the distinguished variable replaced by \\spad{b}.")) (|resultant| ((|#2| $ $) "\\spad{resultant(p,q)} returns the resultant of the polynomials \\spad{p} and \\spad{q}.")) (|discriminant| ((|#2| $) "\\spad{discriminant(p)} returns the discriminant of the polynomial \\spad{p}.")) (|differentiate| (($ $ (|Mapping| |#2| |#2|) $) "\\spad{differentiate(p, d, x')} extends the \\spad{R}-derivation \\spad{d} to an extension \\spad{D} in \\spad{R[x]} where Dx is given by x',{} and returns \\spad{Dp}.")) (|pseudoRemainder| (($ $ $) "\\spad{pseudoRemainder(p,q)} = \\spad{r},{} for polynomials \\spad{p} and \\spad{q},{} returns the remainder when \\spad{p' := p*lc(q)**(deg p - deg q + 1)} is pseudo right-divided by \\spad{q},{} \\spadignore{i.e.} \\spad{p' = s q + r}.")) (|shiftLeft| (($ $ (|NonNegativeInteger|)) "\\spad{shiftLeft(p,n)} returns \\spad{p * monomial(1,n)}")) (|shiftRight| (($ $ (|NonNegativeInteger|)) "\\spad{shiftRight(p,n)} returns \\spad{monicDivide(p,monomial(1,n)).quotient}")) (|karatsubaDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ (|NonNegativeInteger|)) "\\spad{karatsubaDivide(p,n)} returns the same as \\spad{monicDivide(p,monomial(1,n))}")) (|monicDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{monicDivide(p,q)} divide the polynomial \\spad{p} by the monic polynomial \\spad{q},{} returning the pair \\spad{[quotient, remainder]}. Error: if \\spad{q} isn't monic.")) (|divideExponents| (((|Union| $ "failed") $ (|NonNegativeInteger|)) "\\spad{divideExponents(p,n)} returns a new polynomial resulting from dividing all exponents of the polynomial \\spad{p} by the non negative integer \\spad{n},{} or \"failed\" if some exponent is not exactly divisible by \\spad{n}.")) (|multiplyExponents| (($ $ (|NonNegativeInteger|)) "\\spad{multiplyExponents(p,n)} returns a new polynomial resulting from multiplying all exponents of the polynomial \\spad{p} by the non negative integer \\spad{n}.")) (|unmakeSUP| (($ (|SparseUnivariatePolynomial| |#2|)) "\\spad{unmakeSUP(sup)} converts \\spad{sup} of type \\spadtype{SparseUnivariatePolynomial(R)} to be a member of the given type. Note: converse of makeSUP.")) (|makeSUP| (((|SparseUnivariatePolynomial| |#2|) $) "\\spad{makeSUP(p)} converts the polynomial \\spad{p} to be of type SparseUnivariatePolynomial over the same coefficients.")) (|vectorise| (((|Vector| |#2|) $ (|NonNegativeInteger|)) "\\spad{vectorise(p, n)} returns \\spad{[a0,...,a(n-1)]} where \\spad{p = a0 + a1*x + ... + a(n-1)*x**(n-1)} + higher order terms. The degree of polynomial \\spad{p} can be different from \\spad{n-1}."))) NIL -((|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-569))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-1172)))) -(-1263 R) +((|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-568))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-1171)))) +(-1262 R) ((|constructor| (NIL "The category of univariate polynomials over a ring \\spad{R}. No particular model is assumed - implementations can be either sparse or dense.")) (|integrate| (($ $) "\\spad{integrate(p)} integrates the univariate polynomial \\spad{p} with respect to its distinguished variable.")) (|additiveValuation| ((|attribute|) "euclideanSize(a*b) = euclideanSize(a) + euclideanSize(\\spad{b})")) (|separate| (((|Record| (|:| |primePart| $) (|:| |commonPart| $)) $ $) "\\spad{separate(p, q)} returns \\spad{[a, b]} such that polynomial \\spad{p = a b} and \\spad{a} is relatively prime to \\spad{q}.")) (|pseudoDivide| (((|Record| (|:| |coef| |#1|) (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{pseudoDivide(p,q)} returns \\spad{[c, q, r]},{} when \\spad{p' := p*lc(q)**(deg p - deg q + 1) = c * p} is pseudo right-divided by \\spad{q},{} \\spadignore{i.e.} \\spad{p' = s q + r}.")) (|pseudoQuotient| (($ $ $) "\\spad{pseudoQuotient(p,q)} returns \\spad{r},{} the quotient when \\spad{p' := p*lc(q)**(deg p - deg q + 1)} is pseudo right-divided by \\spad{q},{} \\spadignore{i.e.} \\spad{p' = s q + r}.")) (|composite| (((|Union| (|Fraction| $) "failed") (|Fraction| $) $) "\\spad{composite(f, q)} returns \\spad{h} if \\spad{f} = \\spad{h}(\\spad{q}),{} and \"failed\" is no such \\spad{h} exists.") (((|Union| $ "failed") $ $) "\\spad{composite(p, q)} returns \\spad{h} if \\spad{p = h(q)},{} and \"failed\" no such \\spad{h} exists.")) (|subResultantGcd| (($ $ $) "\\spad{subResultantGcd(p,q)} computes the gcd of the polynomials \\spad{p} and \\spad{q} using the SubResultant GCD algorithm.")) (|order| (((|NonNegativeInteger|) $ $) "\\spad{order(p, q)} returns the largest \\spad{n} such that \\spad{q**n} divides polynomial \\spad{p} \\spadignore{i.e.} the order of \\spad{p(x)} at \\spad{q(x)=0}.")) (|elt| ((|#1| (|Fraction| $) |#1|) "\\spad{elt(a,r)} evaluates the fraction of univariate polynomials \\spad{a} with the distinguished variable replaced by the constant \\spad{r}.") (((|Fraction| $) (|Fraction| $) (|Fraction| $)) "\\spad{elt(a,b)} evaluates the fraction of univariate polynomials \\spad{a} with the distinguished variable replaced by \\spad{b}.")) (|resultant| ((|#1| $ $) "\\spad{resultant(p,q)} returns the resultant of the polynomials \\spad{p} and \\spad{q}.")) (|discriminant| ((|#1| $) "\\spad{discriminant(p)} returns the discriminant of the polynomial \\spad{p}.")) (|differentiate| (($ $ (|Mapping| |#1| |#1|) $) "\\spad{differentiate(p, d, x')} extends the \\spad{R}-derivation \\spad{d} to an extension \\spad{D} in \\spad{R[x]} where Dx is given by x',{} and returns \\spad{Dp}.")) (|pseudoRemainder| (($ $ $) "\\spad{pseudoRemainder(p,q)} = \\spad{r},{} for polynomials \\spad{p} and \\spad{q},{} returns the remainder when \\spad{p' := p*lc(q)**(deg p - deg q + 1)} is pseudo right-divided by \\spad{q},{} \\spadignore{i.e.} \\spad{p' = s q + r}.")) (|shiftLeft| (($ $ (|NonNegativeInteger|)) "\\spad{shiftLeft(p,n)} returns \\spad{p * monomial(1,n)}")) (|shiftRight| (($ $ (|NonNegativeInteger|)) "\\spad{shiftRight(p,n)} returns \\spad{monicDivide(p,monomial(1,n)).quotient}")) (|karatsubaDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ (|NonNegativeInteger|)) "\\spad{karatsubaDivide(p,n)} returns the same as \\spad{monicDivide(p,monomial(1,n))}")) (|monicDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{monicDivide(p,q)} divide the polynomial \\spad{p} by the monic polynomial \\spad{q},{} returning the pair \\spad{[quotient, remainder]}. Error: if \\spad{q} isn't monic.")) (|divideExponents| (((|Union| $ "failed") $ (|NonNegativeInteger|)) "\\spad{divideExponents(p,n)} returns a new polynomial resulting from dividing all exponents of the polynomial \\spad{p} by the non negative integer \\spad{n},{} or \"failed\" if some exponent is not exactly divisible by \\spad{n}.")) (|multiplyExponents| (($ $ (|NonNegativeInteger|)) "\\spad{multiplyExponents(p,n)} returns a new polynomial resulting from multiplying all exponents of the polynomial \\spad{p} by the non negative integer \\spad{n}.")) (|unmakeSUP| (($ (|SparseUnivariatePolynomial| |#1|)) "\\spad{unmakeSUP(sup)} converts \\spad{sup} of type \\spadtype{SparseUnivariatePolynomial(R)} to be a member of the given type. Note: converse of makeSUP.")) (|makeSUP| (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{makeSUP(p)} converts the polynomial \\spad{p} to be of type SparseUnivariatePolynomial over the same coefficients.")) (|vectorise| (((|Vector| |#1|) $ (|NonNegativeInteger|)) "\\spad{vectorise(p, n)} returns \\spad{[a0,...,a(n-1)]} where \\spad{p = a0 + a1*x + ... + a(n-1)*x**(n-1)} + higher order terms. The degree of polynomial \\spad{p} can be different from \\spad{n-1}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4420 |has| |#1| (-376)) (-4422 |has| |#1| (-6 -4422)) (-4419 . T) (-4418 . T) (-4421 . T)) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4419 |has| |#1| (-376)) (-4421 |has| |#1| (-6 -4421)) (-4418 . T) (-4417 . T) (-4420 . T)) NIL -(-1264 R PR S PS) +(-1263 R PR S PS) ((|constructor| (NIL "Mapping from polynomials over \\spad{R} to polynomials over \\spad{S} given a map from \\spad{R} to \\spad{S} assumed to send zero to zero.")) (|map| ((|#4| (|Mapping| |#3| |#1|) |#2|) "\\spad{map(f, p)} takes a function \\spad{f} from \\spad{R} to \\spad{S},{} and applies it to each (non-zero) coefficient of a polynomial \\spad{p} over \\spad{R},{} getting a new polynomial over \\spad{S}. Note: since the map is not applied to zero elements,{} it may map zero to zero."))) NIL NIL -(-1265 S |Coef| |Expon|) +(-1264 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 -916) (QUOTE (-1197)))) (|HasSignature| |#2| (|%list| (QUOTE *) (|%list| (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1132))) (|HasSignature| |#2| (|%list| (QUOTE **) (|%list| (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (|%list| (QUOTE -4375) (|%list| (|devaluate| |#2|) (QUOTE (-1197)))))) -(-1266 |Coef| |Expon|) +((|HasCategory| |#2| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#2| (|%list| (QUOTE *) (|%list| (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1131))) (|HasSignature| |#2| (|%list| (QUOTE **) (|%list| (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (|%list| (QUOTE -4374) (|%list| (|devaluate| |#2|) (QUOTE (-1196)))))) +(-1265 |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."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4418 . T) (-4419 . T) (-4421 . T)) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1267 RC P) +(-1266 RC P) ((|constructor| (NIL "This package provides for square-free decomposition of univariate polynomials over arbitrary rings,{} \\spadignore{i.e.} a partial factorization such that each factor is a product of irreducibles with multiplicity one and the factors are pairwise relatively prime. If the ring has characteristic zero,{} the result is guaranteed to satisfy this condition. If the ring is an infinite ring of finite characteristic,{} then it may not be possible to decide when polynomials contain factors which are \\spad{p}th powers. In this case,{} the flag associated with that polynomial is set to \"nil\" (meaning that that polynomials are not guaranteed to be square-free).")) (|BumInSepFFE| (((|Record| (|:| |flg| (|Union| #1="nil" #2="sqfr" #3="irred" #4="prime")) (|:| |fctr| |#2|) (|:| |xpnt| (|Integer|))) (|Record| (|:| |flg| (|Union| #1# #2# #3# #4#)) (|:| |fctr| |#2|) (|:| |xpnt| (|Integer|)))) "\\spad{BumInSepFFE(f)} is a local function,{} exported only because it has multiple conditional definitions.")) (|squareFreePart| ((|#2| |#2|) "\\spad{squareFreePart(p)} returns a polynomial which has the same irreducible factors as the univariate polynomial \\spad{p},{} but each factor has multiplicity one.")) (|squareFree| (((|Factored| |#2|) |#2|) "\\spad{squareFree(p)} computes the square-free factorization of the univariate polynomial \\spad{p}. Each factor has no repeated roots,{} and the factors are pairwise relatively prime.")) (|gcd| (($ $ $) "\\spad{gcd(p,q)} computes the greatest-common-divisor of \\spad{p} and \\spad{q}."))) NIL NIL -(-1268 |Coef| |var| |cen|) +(-1267 |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."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-558)) (QUOTE (-1132))) (|HasCategory| |#1| (QUOTE (-376))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasSignature| |#1| (|%list| (QUOTE -4375) (|%list| (|devaluate| |#1|) (QUOTE (-1197)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-978))) (|HasCategory| |#1| (QUOTE (-1223))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasSignature| |#1| (|%list| (QUOTE -4241) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1197))))) (|HasSignature| |#1| (|%list| (QUOTE -3483) (|%list| (|%list| (QUOTE -660) (QUOTE (-1197))) (|devaluate| |#1|))))))) -(-1269 |Coef1| |Coef2| |var1| |var2| |cen1| |cen2|) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-557)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-376))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasSignature| |#1| (|%list| (QUOTE -4374) (|%list| (|devaluate| |#1|) (QUOTE (-1196)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-977))) (|HasCategory| |#1| (QUOTE (-1222))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasSignature| |#1| (|%list| (QUOTE -4240) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1196))))) (|HasSignature| |#1| (|%list| (QUOTE -3482) (|%list| (|%list| (QUOTE -659) (QUOTE (-1196))) (|devaluate| |#1|))))))) +(-1268 |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 NIL -(-1270 |Coef|) +(-1269 |Coef|) ((|constructor| (NIL "\\spadtype{UnivariatePuiseuxSeriesCategory} is the category of Puiseux 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),var)} returns an anti-derivative of the power series \\spad{f(x)} with respect to the variable \\spad{var}.") (($ $) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 1. We may integrate a series when we can divide coefficients by rational numbers.")) (|multiplyExponents| (($ $ (|Fraction| (|Integer|))) "\\spad{multiplyExponents(f,r)} multiplies all exponents of the power series \\spad{f} by the positive rational number \\spad{r}.")) (|series| (($ (|NonNegativeInteger|) (|Stream| (|Record| (|:| |k| (|Fraction| (|Integer|))) (|:| |c| |#1|)))) "\\spad{series(n,st)} creates a series from a common denomiator and 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 and \\spad{n} should be a common denominator for the exponents in the stream of terms."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) (-4418 . T) (-4419 . T) (-4421 . T)) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1271 S |Coef| ULS) +(-1270 S |Coef| ULS) ((|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)}.")) (|laurentIfCan| (((|Union| |#3| "failed") $) "\\spad{laurentIfCan(f(x))} converts the Puiseux series \\spad{f(x)} to a Laurent series if possible. If this is not possible,{} \"failed\" is returned.")) (|laurent| ((|#3| $) "\\spad{laurent(f(x))} converts the Puiseux series \\spad{f(x)} to a Laurent series if possible. Error: if this is not possible.")) (|degree| (((|Fraction| (|Integer|)) $) "\\spad{degree(f(x))} returns the degree of the leading term of the Puiseux series \\spad{f(x)},{} which may have zero as a coefficient.")) (|laurentRep| ((|#3| $) "\\spad{laurentRep(f(x))} returns \\spad{g(x)} where the Puiseux series \\spad{f(x) = g(x^r)} is represented by \\spad{[r,g(x)]}.")) (|rationalPower| (((|Fraction| (|Integer|)) $) "\\spad{rationalPower(f(x))} returns \\spad{r} where the Puiseux series \\spad{f(x) = g(x^r)}.")) (|puiseux| (($ (|Fraction| (|Integer|)) |#3|) "\\spad{puiseux(r,f(x))} returns \\spad{f(x^r)}."))) NIL NIL -(-1272 |Coef| ULS) +(-1271 |Coef| ULS) ((|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)}.")) (|laurentIfCan| (((|Union| |#2| "failed") $) "\\spad{laurentIfCan(f(x))} converts the Puiseux series \\spad{f(x)} to a Laurent series if possible. If this is not possible,{} \"failed\" is returned.")) (|laurent| ((|#2| $) "\\spad{laurent(f(x))} converts the Puiseux series \\spad{f(x)} to a Laurent series if possible. Error: if this is not possible.")) (|degree| (((|Fraction| (|Integer|)) $) "\\spad{degree(f(x))} returns the degree of the leading term of the Puiseux series \\spad{f(x)},{} which may have zero as a coefficient.")) (|laurentRep| ((|#2| $) "\\spad{laurentRep(f(x))} returns \\spad{g(x)} where the Puiseux series \\spad{f(x) = g(x^r)} is represented by \\spad{[r,g(x)]}.")) (|rationalPower| (((|Fraction| (|Integer|)) $) "\\spad{rationalPower(f(x))} returns \\spad{r} where the Puiseux series \\spad{f(x) = g(x^r)}.")) (|puiseux| (($ (|Fraction| (|Integer|)) |#2|) "\\spad{puiseux(r,f(x))} returns \\spad{f(x^r)}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) (-4418 . T) (-4419 . T) (-4421 . T)) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1273 |Coef| ULS) +(-1272 |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)}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4422 |has| |#1| (-376)) (-4416 |has| |#1| (-376)) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#1| (QUOTE (-175))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-558)) (QUOTE (-1132))) (|HasCategory| |#1| (QUOTE (-376))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (-3956 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-569)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasSignature| |#1| (|%list| (QUOTE -4375) (|%list| (|devaluate| |#1|) (QUOTE (-1197)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-558)))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-978))) (|HasCategory| |#1| (QUOTE (-1223))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasSignature| |#1| (|%list| (QUOTE -4241) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1197))))) (|HasSignature| |#1| (|%list| (QUOTE -3483) (|%list| (|%list| (QUOTE -660) (QUOTE (-1197))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558)))))) -(-1274 R FE |var| |cen|) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4421 |has| |#1| (-376)) (-4415 |has| |#1| (-376)) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-175))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-557)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-376))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (-3955 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasSignature| |#1| (|%list| (QUOTE -4374) (|%list| (|devaluate| |#1|) (QUOTE (-1196)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -419) (QUOTE (-557)))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-977))) (|HasCategory| |#1| (QUOTE (-1222))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasSignature| |#1| (|%list| (QUOTE -4240) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1196))))) (|HasSignature| |#1| (|%list| (QUOTE -3482) (|%list| (|%list| (QUOTE -659) (QUOTE (-1196))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557)))))) +(-1273 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))}."))) -(((-4426 "*") |has| (-1268 |#2| |#3| |#4|) (-175)) (-4417 |has| (-1268 |#2| |#3| |#4|) (-569)) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| (-1268 |#2| |#3| |#4|) (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| (-1268 |#2| |#3| |#4|) (QUOTE (-147))) (|HasCategory| (-1268 |#2| |#3| |#4|) (QUOTE (-149))) (|HasCategory| (-1268 |#2| |#3| |#4|) (QUOTE (-175))) (-3956 (|HasCategory| (-1268 |#2| |#3| |#4|) (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| (-1268 |#2| |#3| |#4|) (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558)))))) (|HasCategory| (-1268 |#2| |#3| |#4|) (|%list| (QUOTE -1058) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| (-1268 |#2| |#3| |#4|) (|%list| (QUOTE -1058) (QUOTE (-558)))) (|HasCategory| (-1268 |#2| |#3| |#4|) (QUOTE (-376))) (|HasCategory| (-1268 |#2| |#3| |#4|) (QUOTE (-464))) (|HasCategory| (-1268 |#2| |#3| |#4|) (QUOTE (-569)))) -(-1275 A S) +(((-4425 "*") |has| (-1267 |#2| |#3| |#4|) (-175)) (-4416 |has| (-1267 |#2| |#3| |#4|) (-568)) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| (-1267 |#2| |#3| |#4|) (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| (-1267 |#2| |#3| |#4|) (QUOTE (-147))) (|HasCategory| (-1267 |#2| |#3| |#4|) (QUOTE (-149))) (|HasCategory| (-1267 |#2| |#3| |#4|) (QUOTE (-175))) (-3955 (|HasCategory| (-1267 |#2| |#3| |#4|) (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| (-1267 |#2| |#3| |#4|) (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557)))))) (|HasCategory| (-1267 |#2| |#3| |#4|) (|%list| (QUOTE -1057) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| (-1267 |#2| |#3| |#4|) (|%list| (QUOTE -1057) (QUOTE (-557)))) (|HasCategory| (-1267 |#2| |#3| |#4|) (QUOTE (-376))) (|HasCategory| (-1267 |#2| |#3| |#4|) (QUOTE (-464))) (|HasCategory| (-1267 |#2| |#3| |#4|) (QUOTE (-568)))) +(-1274 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 -((|HasAttribute| |#1| (QUOTE -4425))) -(-1276 S) +((|HasAttribute| |#1| (QUOTE -4424))) +(-1275 S) ((|constructor| (NIL "A unary-recursive aggregate is a one where nodes may have either 0 or 1 children. This aggregate models,{} though not precisely,{} a linked list possibly with a single cycle. A node with one children models a non-empty list,{} with the \\spadfun{value} of the list designating the head,{} or \\spadfun{first},{} of the list,{} and the child designating the tail,{} or \\spadfun{rest},{} of the list. A node with no child then designates the empty list. Since these aggregates are recursive aggregates,{} they may be cyclic.")) (|split!| (($ $ (|Integer|)) "\\spad{split!(u,n)} splits \\spad{u} into two aggregates: \\axiom{\\spad{v} = rest(\\spad{u},{}\\spad{n})} and \\axiom{\\spad{w} = first(\\spad{u},{}\\spad{n})},{} returning \\axiom{\\spad{v}}. Note: afterwards \\axiom{rest(\\spad{u},{}\\spad{n})} returns \\axiom{empty()}.")) (|setlast!| ((|#1| $ |#1|) "\\spad{setlast!(u,x)} destructively changes the last element of \\spad{u} to \\spad{x}.")) (|setrest!| (($ $ $) "\\spad{setrest!(u,v)} destructively changes the rest of \\spad{u} to \\spad{v}.")) (|setelt| ((|#1| $ "last" |#1|) "\\spad{setelt(u,\"last\",x)} (also written: \\axiom{\\spad{u}.last := \\spad{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})}.") ((|#1| $ "first" |#1|) "\\spad{setelt(u,\"first\",x)} (also written: \\axiom{\\spad{u}.first := \\spad{x}}) is equivalent to \\axiom{setfirst!(\\spad{u},{}\\spad{x})}.")) (|setfirst!| ((|#1| $ |#1|) "\\spad{setfirst!(u,x)} destructively changes the first element of a to \\spad{x}.")) (|cycleSplit!| (($ $) "\\spad{cycleSplit!(u)} splits the aggregate by dropping off the cycle. The value returned is the cycle entry,{} or nil if none exists. For example,{} if \\axiom{\\spad{w} = concat(\\spad{u},{}\\spad{v})} is the cyclic list where \\spad{v} is the head of the cycle,{} \\axiom{cycleSplit!(\\spad{w})} will drop \\spad{v} off \\spad{w} thus destructively changing \\spad{w} to \\spad{u},{} and returning \\spad{v}.")) (|concat!| (($ $ |#1|) "\\spad{concat!(u,x)} destructively adds element \\spad{x} to the end of \\spad{u}. Note: \\axiom{concat!(a,{}\\spad{x}) = setlast!(a,{}[\\spad{x}])}.") (($ $ $) "\\spad{concat!(u,v)} destructively concatenates \\spad{v} to the end of \\spad{u}. Note: \\axiom{concat!(\\spad{u},{}\\spad{v}) = setlast!(\\spad{u},{}\\spad{v})}.")) (|cycleTail| (($ $) "\\spad{cycleTail(u)} returns the last node in the cycle,{} or empty if none exists.")) (|cycleLength| (((|NonNegativeInteger|) $) "\\spad{cycleLength(u)} returns the length of a top-level cycle contained in aggregate \\spad{u},{} or 0 is \\spad{u} has no such cycle.")) (|cycleEntry| (($ $) "\\spad{cycleEntry(u)} returns the head of a top-level cycle contained in aggregate \\spad{u},{} or \\axiom{empty()} if none exists.")) (|third| ((|#1| $) "\\spad{third(u)} returns the third element of \\spad{u}. Note: \\axiom{third(\\spad{u}) = first(rest(rest(\\spad{u})))}.")) (|second| ((|#1| $) "\\spad{second(u)} returns the second element of \\spad{u}. Note: \\axiom{second(\\spad{u}) = first(rest(\\spad{u}))}.")) (|tail| (($ $) "\\spad{tail(u)} returns the last node of \\spad{u}. Note: if \\spad{u} is \\axiom{shallowlyMutable},{} \\axiom{setrest(tail(\\spad{u}),{}\\spad{v}) = concat(\\spad{u},{}\\spad{v})}.")) (|last| (($ $ (|NonNegativeInteger|)) "\\spad{last(u,n)} returns a copy of the last \\spad{n} (\\axiom{\\spad{n} >= 0}) nodes of \\spad{u}. Note: \\axiom{last(\\spad{u},{}\\spad{n})} is a list of \\spad{n} elements.") ((|#1| $) "\\spad{last(u)} resturn the last element of \\spad{u}. Note: for lists,{} \\axiom{last(\\spad{u}) = \\spad{u} . (maxIndex \\spad{u}) = \\spad{u} . (\\# \\spad{u} - 1)}.")) (|rest| (($ $ (|NonNegativeInteger|)) "\\spad{rest(u,n)} returns the \\axiom{\\spad{n}}th (\\spad{n} >= 0) node of \\spad{u}. Note: \\axiom{rest(\\spad{u},{}0) = \\spad{u}}.") (($ $) "\\spad{rest(u)} returns an aggregate consisting of all but the first element of \\spad{u} (equivalently,{} the next node of \\spad{u}).")) (|elt| ((|#1| $ "last") "\\spad{elt(u,\"last\")} (also written: \\axiom{\\spad{u} . last}) is equivalent to last \\spad{u}.") (($ $ "rest") "\\spad{elt(\\%,\"rest\")} (also written: \\axiom{\\spad{u}.rest}) is equivalent to \\axiom{rest \\spad{u}}.") ((|#1| $ "first") "\\spad{elt(u,\"first\")} (also written: \\axiom{\\spad{u} . first}) is equivalent to first \\spad{u}.")) (|first| (($ $ (|NonNegativeInteger|)) "\\spad{first(u,n)} returns a copy of the first \\spad{n} (\\axiom{\\spad{n} >= 0}) elements of \\spad{u}.") ((|#1| $) "\\spad{first(u)} returns the first element of \\spad{u} (equivalently,{} the value at the current node).")) (|concat| (($ |#1| $) "\\spad{concat(x,u)} returns aggregate consisting of \\spad{x} followed by the elements of \\spad{u}. Note: if \\axiom{\\spad{v} = concat(\\spad{x},{}\\spad{u})} then \\axiom{\\spad{x} = first \\spad{v}} and \\axiom{\\spad{u} = rest \\spad{v}}.") (($ $ $) "\\spad{concat(u,v)} returns an aggregate \\spad{w} consisting of the elements of \\spad{u} followed by the elements of \\spad{v}. Note: \\axiom{\\spad{v} = rest(\\spad{w},{}\\#a)}."))) NIL NIL -(-1277 |Coef| |var| |cen|) +(-1276 |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}."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4418 . T) (-4419 . T) (-4421 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-569))) (-3956 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-569)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -916) (QUOTE (-1197)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-790)) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-790)) (|devaluate| |#1|)))) (|HasCategory| (-790) (QUOTE (-1132))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-790))))) (|HasSignature| |#1| (|%list| (QUOTE -4375) (|%list| (|devaluate| |#1|) (QUOTE (-1197)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-790))))) (|HasCategory| |#1| (QUOTE (-376))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-978))) (|HasCategory| |#1| (QUOTE (-1223))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasSignature| |#1| (|%list| (QUOTE -4241) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1197))))) (|HasSignature| |#1| (|%list| (QUOTE -3483) (|%list| (|%list| (QUOTE -660) (QUOTE (-1197))) (|devaluate| |#1|))))))) -(-1278 |Coef1| |Coef2| UTS1 UTS2) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4417 . T) (-4418 . T) (-4420 . T)) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (QUOTE (-568))) (-3955 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -915) (QUOTE (-1196)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-789)) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-789)) (|devaluate| |#1|)))) (|HasCategory| (-789) (QUOTE (-1131))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-789))))) (|HasSignature| |#1| (|%list| (QUOTE -4374) (|%list| (|devaluate| |#1|) (QUOTE (-1196)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-789))))) (|HasCategory| |#1| (QUOTE (-376))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-977))) (|HasCategory| |#1| (QUOTE (-1222))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-557))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasSignature| |#1| (|%list| (QUOTE -4240) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1196))))) (|HasSignature| |#1| (|%list| (QUOTE -3482) (|%list| (|%list| (QUOTE -659) (QUOTE (-1196))) (|devaluate| |#1|))))))) +(-1277 |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 NIL -(-1279 S |Coef|) +(-1278 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 (-558)))) (|HasCategory| |#2| (QUOTE (-978))) (|HasCategory| |#2| (QUOTE (-1223))) (|HasSignature| |#2| (|%list| (QUOTE -3483) (|%list| (|%list| (QUOTE -660) (QUOTE (-1197))) (|devaluate| |#2|)))) (|HasSignature| |#2| (|%list| (QUOTE -4241) (|%list| (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1197))))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasCategory| |#2| (QUOTE (-376)))) -(-1280 |Coef|) +((|HasCategory| |#2| (|%list| (QUOTE -29) (QUOTE (-557)))) (|HasCategory| |#2| (QUOTE (-977))) (|HasCategory| |#2| (QUOTE (-1222))) (|HasSignature| |#2| (|%list| (QUOTE -3482) (|%list| (|%list| (QUOTE -659) (QUOTE (-1196))) (|devaluate| |#2|)))) (|HasSignature| |#2| (|%list| (QUOTE -4240) (|%list| (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1196))))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasCategory| |#2| (QUOTE (-376)))) +(-1279 |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."))) -(((-4426 "*") |has| |#1| (-175)) (-4417 |has| |#1| (-569)) (-4418 . T) (-4419 . T) (-4421 . T)) +(((-4425 "*") |has| |#1| (-175)) (-4416 |has| |#1| (-568)) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1281 |Coef| UTS) +(-1280 |Coef| UTS) ((|constructor| (NIL "\\indented{1}{This package provides Taylor series solutions to regular} linear or non-linear ordinary differential equations of arbitrary order.")) (|mpsode| (((|List| |#2|) (|List| |#1|) (|List| (|Mapping| |#2| (|List| |#2|)))) "\\spad{mpsode(r,f)} solves the system of differential equations \\spad{dy[i]/dx =f[i] [x,y[1],y[2],...,y[n]]},{} \\spad{y[i](a) = r[i]} for \\spad{i} in 1..\\spad{n}.")) (|ode| ((|#2| (|Mapping| |#2| (|List| |#2|)) (|List| |#1|)) "\\spad{ode(f,cl)} is the solution to \\spad{y<n>=f(y,y',..,y<n-1>)} such that \\spad{y<i>(a) = cl.i} for \\spad{i} in 1..\\spad{n}.")) (|ode2| ((|#2| (|Mapping| |#2| |#2| |#2|) |#1| |#1|) "\\spad{ode2(f,c0,c1)} is the solution to \\spad{y'' = f(y,y')} such that \\spad{y(a) = c0} and \\spad{y'(a) = c1}.")) (|ode1| ((|#2| (|Mapping| |#2| |#2|) |#1|) "\\spad{ode1(f,c)} is the solution to \\spad{y' = f(y)} such that \\spad{y(a) = c}.")) (|fixedPointExquo| ((|#2| |#2| |#2|) "\\spad{fixedPointExquo(f,g)} computes the exact quotient of \\spad{f} and \\spad{g} using a fixed point computation.")) (|stFuncN| (((|Mapping| (|Stream| |#1|) (|List| (|Stream| |#1|))) (|Mapping| |#2| (|List| |#2|))) "\\spad{stFuncN(f)} is a local function xported due to compiler problem. This function is of no interest to the top-level user.")) (|stFunc2| (((|Mapping| (|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) (|Mapping| |#2| |#2| |#2|)) "\\spad{stFunc2(f)} is a local function exported due to compiler problem. This function is of no interest to the top-level user.")) (|stFunc1| (((|Mapping| (|Stream| |#1|) (|Stream| |#1|)) (|Mapping| |#2| |#2|)) "\\spad{stFunc1(f)} is a local function exported due to compiler problem. This function is of no interest to the top-level user."))) NIL NIL -(-1282 -3494 UP L UTS) +(-1281 -3493 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 (-569)))) -(-1283) +((|HasCategory| |#1| (QUOTE (-568)))) +(-1282) ((|constructor| (NIL "The category of domains that act like unions. UnionType,{} like Type or Category,{} acts mostly as a take that communicates `union-like' intended semantics to the compiler. A domain \\spad{D} that satifies UnionType should provide definitions for `case' operators,{} with corresponding `autoCoerce' operators."))) NIL NIL -(-1284 |sym|) +(-1283 |sym|) ((|constructor| (NIL "This domain implements variables")) (|variable| (((|Symbol|)) "\\spad{variable()} returns the symbol")) (|coerce| (((|Symbol|) $) "\\spad{coerce(x)} returns the symbol"))) NIL NIL -(-1285 S R) +(-1284 S R) ((|constructor| (NIL "\\spadtype{VectorCategory} represents the type of vector like objects,{} \\spadignore{i.e.} finite sequences indexed by some finite segment of the integers. The operations available on vectors depend on the structure of the underlying components. Many operations from the component domain are defined for vectors componentwise. It can by assumed that extraction or updating components can be done in constant time.")) (|magnitude| ((|#2| $) "\\spad{magnitude(v)} computes the sqrt(dot(\\spad{v},{}\\spad{v})),{} \\spadignore{i.e.} the length")) (|length| ((|#2| $) "\\spad{length(v)} computes the sqrt(dot(\\spad{v},{}\\spad{v})),{} \\spadignore{i.e.} the magnitude")) (|cross| (($ $ $) "vectorProduct(\\spad{u},{}\\spad{v}) constructs the cross product of \\spad{u} and \\spad{v}. Error: if \\spad{u} and \\spad{v} are not of length 3.")) (|outerProduct| (((|Matrix| |#2|) $ $) "\\spad{outerProduct(u,v)} constructs the matrix whose (\\spad{i},{}\\spad{j})\\spad{'}th element is \\spad{u}(\\spad{i})*v(\\spad{j}).")) (|dot| ((|#2| $ $) "\\spad{dot(x,y)} computes the inner product of the two vectors \\spad{x} and \\spad{y}. Error: if \\spad{x} and \\spad{y} are not of the same length.")) (* (($ $ |#2|) "\\spad{y * r} multiplies each component of the vector \\spad{y} by the element \\spad{r}.") (($ |#2| $) "\\spad{r * y} multiplies the element \\spad{r} times each component of the vector \\spad{y}.") (($ (|Integer|) $) "\\spad{n * y} multiplies each component of the vector \\spad{y} by the integer \\spad{n}.")) (- (($ $ $) "\\spad{x - y} returns the component-wise difference of the vectors \\spad{x} and \\spad{y}. Error: if \\spad{x} and \\spad{y} are not of the same length.") (($ $) "\\spad{-x} negates all components of the vector \\spad{x}.")) (|zero| (($ (|NonNegativeInteger|)) "\\spad{zero(n)} creates a zero vector of length \\spad{n}.")) (+ (($ $ $) "\\spad{x + y} returns the component-wise sum of the vectors \\spad{x} and \\spad{y}. Error: if \\spad{x} and \\spad{y} are not of the same length."))) NIL -((|HasCategory| |#2| (QUOTE (-1022))) (|HasCategory| |#2| (QUOTE (-1069))) (|HasCategory| |#2| (QUOTE (-745))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25)))) -(-1286 R) +((|HasCategory| |#2| (QUOTE (-1021))) (|HasCategory| |#2| (QUOTE (-1068))) (|HasCategory| |#2| (QUOTE (-744))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25)))) +(-1285 R) ((|constructor| (NIL "\\spadtype{VectorCategory} represents the type of vector like objects,{} \\spadignore{i.e.} finite sequences indexed by some finite segment of the integers. The operations available on vectors depend on the structure of the underlying components. Many operations from the component domain are defined for vectors componentwise. It can by assumed that extraction or updating components can be done in constant time.")) (|magnitude| ((|#1| $) "\\spad{magnitude(v)} computes the sqrt(dot(\\spad{v},{}\\spad{v})),{} \\spadignore{i.e.} the length")) (|length| ((|#1| $) "\\spad{length(v)} computes the sqrt(dot(\\spad{v},{}\\spad{v})),{} \\spadignore{i.e.} the magnitude")) (|cross| (($ $ $) "vectorProduct(\\spad{u},{}\\spad{v}) constructs the cross product of \\spad{u} and \\spad{v}. Error: if \\spad{u} and \\spad{v} are not of length 3.")) (|outerProduct| (((|Matrix| |#1|) $ $) "\\spad{outerProduct(u,v)} constructs the matrix whose (\\spad{i},{}\\spad{j})\\spad{'}th element is \\spad{u}(\\spad{i})*v(\\spad{j}).")) (|dot| ((|#1| $ $) "\\spad{dot(x,y)} computes the inner product of the two vectors \\spad{x} and \\spad{y}. Error: if \\spad{x} and \\spad{y} are not of the same length.")) (* (($ $ |#1|) "\\spad{y * r} multiplies each component of the vector \\spad{y} by the element \\spad{r}.") (($ |#1| $) "\\spad{r * y} multiplies the element \\spad{r} times each component of the vector \\spad{y}.") (($ (|Integer|) $) "\\spad{n * y} multiplies each component of the vector \\spad{y} by the integer \\spad{n}.")) (- (($ $ $) "\\spad{x - y} returns the component-wise difference of the vectors \\spad{x} and \\spad{y}. Error: if \\spad{x} and \\spad{y} are not of the same length.") (($ $) "\\spad{-x} negates all components of the vector \\spad{x}.")) (|zero| (($ (|NonNegativeInteger|)) "\\spad{zero(n)} creates a zero vector of length \\spad{n}.")) (+ (($ $ $) "\\spad{x + y} returns the component-wise sum of the vectors \\spad{x} and \\spad{y}. Error: if \\spad{x} and \\spad{y} are not of the same length."))) -((-4425 . T) (-4424 . T)) +((-4424 . T) (-4423 . T)) NIL -(-1287 R) +(-1286 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."))) -((-4425 . T) (-4424 . T)) -((-3956 (-12 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3956 (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876))))) (|HasCategory| |#1| (|%list| (QUOTE -630) (QUOTE (-547)))) (-3956 (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| |#1| (QUOTE (-860))) (-3956 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121)))) (|HasCategory| (-558) (QUOTE (-860))) (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-745))) (|HasCategory| |#1| (QUOTE (-1069))) (-12 (|HasCategory| |#1| (QUOTE (-1022))) (|HasCategory| |#1| (QUOTE (-1069)))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1121))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) -(-1288 A B) +((-4424 . T) (-4423 . T)) +((-3955 (-12 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-3955 (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875))))) (|HasCategory| |#1| (|%list| (QUOTE -629) (QUOTE (-546)))) (-3955 (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| |#1| (QUOTE (-859))) (-3955 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120)))) (|HasCategory| (-557) (QUOTE (-859))) (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-744))) (|HasCategory| |#1| (QUOTE (-1068))) (-12 (|HasCategory| |#1| (QUOTE (-1021))) (|HasCategory| |#1| (QUOTE (-1068)))) (|HasCategory| |#1| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1120))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +(-1287 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 NIL -(-1289) +(-1288) ((|constructor| (NIL "ViewportPackage provides functions for creating GraphImages and TwoDimensionalViewports from lists of lists of points.")) (|coerce| (((|TwoDimensionalViewport|) (|GraphImage|)) "\\spad{coerce(gi)} converts the indicated \\spadtype{GraphImage},{} \\spad{gi},{} into the \\spadtype{TwoDimensionalViewport} form.")) (|drawCurves| (((|TwoDimensionalViewport|) (|List| (|List| (|Point| (|DoubleFloat|)))) (|List| (|DrawOption|))) "\\spad{drawCurves([[p0],[p1],...,[pn]],[options])} creates a \\spadtype{TwoDimensionalViewport} from the list of lists of points,{} \\spad{p0} throught pn,{} using the options specified in the list \\spad{options}.") (((|TwoDimensionalViewport|) (|List| (|List| (|Point| (|DoubleFloat|)))) (|Palette|) (|Palette|) (|PositiveInteger|) (|List| (|DrawOption|))) "\\spad{drawCurves([[p0],[p1],...,[pn]],ptColor,lineColor,ptSize,[options])} creates a \\spadtype{TwoDimensionalViewport} from the list of lists of points,{} \\spad{p0} throught pn,{} using the options specified in the list \\spad{options}. The point color is specified by \\spad{ptColor},{} the line color is specified by \\spad{lineColor},{} and the point size is specified by \\spad{ptSize}.")) (|graphCurves| (((|GraphImage|) (|List| (|List| (|Point| (|DoubleFloat|)))) (|List| (|DrawOption|))) "\\spad{graphCurves([[p0],[p1],...,[pn]],[options])} creates a \\spadtype{GraphImage} from the list of lists of points,{} \\spad{p0} throught pn,{} using the options specified in the list \\spad{options}.") (((|GraphImage|) (|List| (|List| (|Point| (|DoubleFloat|))))) "\\spad{graphCurves([[p0],[p1],...,[pn]])} creates a \\spadtype{GraphImage} from the list of lists of points indicated by \\spad{p0} through pn.") (((|GraphImage|) (|List| (|List| (|Point| (|DoubleFloat|)))) (|Palette|) (|Palette|) (|PositiveInteger|) (|List| (|DrawOption|))) "\\spad{graphCurves([[p0],[p1],...,[pn]],ptColor,lineColor,ptSize,[options])} creates a \\spadtype{GraphImage} from the list of lists of points,{} \\spad{p0} throught pn,{} using the options specified in the list \\spad{options}. The graph point color is specified by \\spad{ptColor},{} the graph line color is specified by \\spad{lineColor},{} and the size of the points is specified by \\spad{ptSize}."))) NIL NIL -(-1290) +(-1289) ((|constructor| (NIL "TwoDimensionalViewport creates viewports to display graphs.")) (|coerce| (((|OutputForm|) $) "\\spad{coerce(v)} returns the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport} as output of the domain \\spadtype{OutputForm}.")) (|key| (((|Integer|) $) "\\spad{key(v)} returns the process ID number of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport}.")) (|reset| (((|Void|) $) "\\spad{reset(v)} sets the current state of the graph characteristics of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} back to their initial settings.")) (|write| (((|String|) $ (|String|) (|List| (|String|))) "\\spad{write(v,s,lf)} takes the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} and creates a directory indicated by \\spad{s},{} which contains the graph data files for \\spad{v} and the optional file types indicated by the list \\spad{lf}.") (((|String|) $ (|String|) (|String|)) "\\spad{write(v,s,f)} takes the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} and creates a directory indicated by \\spad{s},{} which contains the graph data files for \\spad{v} and an optional file type \\spad{f}.") (((|String|) $ (|String|)) "\\spad{write(v,s)} takes the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} and creates a directory indicated by \\spad{s},{} which contains the graph data files for \\spad{v}.")) (|resize| (((|Void|) $ (|PositiveInteger|) (|PositiveInteger|)) "\\spad{resize(v,w,h)} displays the two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} with a width of \\spad{w} and a height of \\spad{h},{} keeping the upper left-hand corner position unchanged.")) (|update| (((|Void|) $ (|GraphImage|) (|PositiveInteger|)) "\\spad{update(v,gr,n)} drops the graph \\spad{gr} in slot \\spad{n} of viewport \\spad{v}. The graph \\spad{gr} must have been transmitted already and acquired an integer key.")) (|move| (((|Void|) $ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{move(v,x,y)} displays the two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} with the upper left-hand corner of the viewport window at the screen coordinate position \\spad{x},{} \\spad{y}.")) (|show| (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{show(v,n,s)} displays the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the graph if \\spad{s} is \"off\".")) (|translate| (((|Void|) $ (|PositiveInteger|) (|Float|) (|Float|)) "\\spad{translate(v,n,dx,dy)} displays the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} translated by \\spad{dx} in the \\spad{x}-coordinate direction from the center of the viewport,{} and by \\spad{dy} in the \\spad{y}-coordinate direction from the center. Setting \\spad{dx} and \\spad{dy} to \\spad{0} places the center of the graph at the center of the viewport.")) (|scale| (((|Void|) $ (|PositiveInteger|) (|Float|) (|Float|)) "\\spad{scale(v,n,sx,sy)} displays the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} scaled by the factor \\spad{sx} in the \\spad{x}-coordinate direction and by the factor \\spad{sy} in the \\spad{y}-coordinate direction.")) (|dimensions| (((|Void|) $ (|NonNegativeInteger|) (|NonNegativeInteger|) (|PositiveInteger|) (|PositiveInteger|)) "\\spad{dimensions(v,x,y,width,height)} sets the position of the upper left-hand corner of the two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} to the window coordinate \\spad{x},{} \\spad{y},{} and sets the dimensions of the window to that of \\spad{width},{} \\spad{height}. The new dimensions are not displayed until the function \\spadfun{makeViewport2D} is executed again for \\spad{v}.")) (|close| (((|Void|) $) "\\spad{close(v)} closes the viewport window of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} and terminates the corresponding process ID.")) (|controlPanel| (((|Void|) $ (|String|)) "\\spad{controlPanel(v,s)} displays the control panel of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or hides the control panel if \\spad{s} is \"off\".")) (|connect| (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{connect(v,n,s)} displays the lines connecting the graph points in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the lines if \\spad{s} is \"off\".")) (|region| (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{region(v,n,s)} displays the bounding box of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the bounding box if \\spad{s} is \"off\".")) (|points| (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{points(v,n,s)} displays the points of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the points if \\spad{s} is \"off\".")) (|units| (((|Void|) $ (|PositiveInteger|) (|Palette|)) "\\spad{units(v,n,c)} displays the units of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} with the units color set to the given palette color \\spad{c}.") (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{units(v,n,s)} displays the units of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the units if \\spad{s} is \"off\".")) (|axes| (((|Void|) $ (|PositiveInteger|) (|Palette|)) "\\spad{axes(v,n,c)} displays the axes of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} with the axes color set to the given palette color \\spad{c}.") (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{axes(v,n,s)} displays the axes of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the axes if \\spad{s} is \"off\".")) (|getGraph| (((|GraphImage|) $ (|PositiveInteger|)) "\\spad{getGraph(v,n)} returns the graph which is of the domain \\spadtype{GraphImage} which is located in graph field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of the domain \\spadtype{TwoDimensionalViewport}.")) (|putGraph| (((|Void|) $ (|GraphImage|) (|PositiveInteger|)) "\\spad{putGraph(v,gi,n)} sets the graph field indicated by \\spad{n},{} of the indicated two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} to be the graph,{} \\spad{gi} of domain \\spadtype{GraphImage}. The contents of viewport,{} \\spad{v},{} will contain \\spad{gi} when the function \\spadfun{makeViewport2D} is called to create the an updated viewport \\spad{v}.")) (|title| (((|Void|) $ (|String|)) "\\spad{title(v,s)} changes the title which is shown in the two-dimensional viewport window,{} \\spad{v} of domain \\spadtype{TwoDimensionalViewport}.")) (|graphs| (((|Vector| (|Union| (|GraphImage|) "undefined")) $) "\\spad{graphs(v)} returns a vector,{} or list,{} which is a union of all the graphs,{} of the domain \\spadtype{GraphImage},{} which are allocated for the two-dimensional viewport,{} \\spad{v},{} of domain \\spadtype{TwoDimensionalViewport}. Those graphs which have no data are labeled \"undefined\",{} otherwise their contents are shown.")) (|graphStates| (((|Vector| (|Record| (|:| |scaleX| (|DoubleFloat|)) (|:| |scaleY| (|DoubleFloat|)) (|:| |deltaX| (|DoubleFloat|)) (|:| |deltaY| (|DoubleFloat|)) (|:| |points| (|Integer|)) (|:| |connect| (|Integer|)) (|:| |spline| (|Integer|)) (|:| |axes| (|Integer|)) (|:| |axesColor| (|Palette|)) (|:| |units| (|Integer|)) (|:| |unitsColor| (|Palette|)) (|:| |showing| (|Integer|)))) $) "\\spad{graphStates(v)} returns and shows a listing of a record containing the current state of the characteristics of each of the ten graph records in the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport}.")) (|graphState| (((|Void|) $ (|PositiveInteger|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Palette|) (|Integer|) (|Palette|) (|Integer|)) "\\spad{graphState(v,num,sX,sY,dX,dY,pts,lns,box,axes,axesC,un,unC,cP)} sets the state of the characteristics for the graph indicated by \\spad{num} in the given two-dimensional viewport \\spad{v},{} of domain \\spadtype{TwoDimensionalViewport},{} to the values given as parameters. The scaling of the graph in the \\spad{x} and \\spad{y} component directions is set to be \\spad{sX} and \\spad{sY}; the window translation in the \\spad{x} and \\spad{y} component directions is set to be \\spad{dX} and \\spad{dY}; The graph points,{} lines,{} bounding \\spad{box},{} \\spad{axes},{} or units will be shown in the viewport if their given parameters \\spad{pts},{} \\spad{lns},{} \\spad{box},{} \\spad{axes} or \\spad{un} are set to be \\spad{1},{} but will not be shown if they are set to \\spad{0}. The color of the \\spad{axes} and the color of the units are indicated by the palette colors \\spad{axesC} and \\spad{unC} respectively. To display the control panel when the viewport window is displayed,{} set \\spad{cP} to \\spad{1},{} otherwise set it to \\spad{0}.")) (|options| (($ $ (|List| (|DrawOption|))) "\\spad{options(v,lopt)} takes the given two-dimensional viewport,{} \\spad{v},{} of the domain \\spadtype{TwoDimensionalViewport} and returns \\spad{v} with it's draw options modified to be those which are indicated in the given list,{} \\spad{lopt} of domain \\spadtype{DrawOption}.") (((|List| (|DrawOption|)) $) "\\spad{options(v)} takes the given two-dimensional viewport,{} \\spad{v},{} of the domain \\spadtype{TwoDimensionalViewport} and returns a list containing the draw options from the domain \\spadtype{DrawOption} for \\spad{v}.")) (|makeViewport2D| (($ (|GraphImage|) (|List| (|DrawOption|))) "\\spad{makeViewport2D(gi,lopt)} creates and displays a viewport window of the domain \\spadtype{TwoDimensionalViewport} whose graph field is assigned to be the given graph,{} \\spad{gi},{} of domain \\spadtype{GraphImage},{} and whose options field is set to be the list of options,{} \\spad{lopt} of domain \\spadtype{DrawOption}.") (($ $) "\\spad{makeViewport2D(v)} takes the given two-dimensional viewport,{} \\spad{v},{} of the domain \\spadtype{TwoDimensionalViewport} and displays a viewport window on the screen which contains the contents of \\spad{v}.")) (|viewport2D| (($) "\\spad{viewport2D()} returns an undefined two-dimensional viewport of the domain \\spadtype{TwoDimensionalViewport} whose contents are empty.")) (|getPickedPoints| (((|List| (|Point| (|DoubleFloat|))) $) "\\spad{getPickedPoints(x)} returns a list of small floats for the points the user interactively picked on the viewport for full integration into the system,{} some design issues need to be addressed: \\spadignore{e.g.} how to go through the GraphImage interface,{} how to default to graphs,{} etc."))) NIL NIL -(-1291) +(-1290) ((|key| (((|Integer|) $) "\\spad{key(v)} returns the process ID number of the given three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport}.")) (|close| (((|Void|) $) "\\spad{close(v)} closes the viewport window of the given three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport},{} and terminates the corresponding process ID.")) (|write| (((|String|) $ (|String|) (|List| (|String|))) "\\spad{write(v,s,lf)} takes the given three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport},{} and creates a directory indicated by \\spad{s},{} which contains the graph data file for \\spad{v} and the optional file types indicated by the list \\spad{lf}.") (((|String|) $ (|String|) (|String|)) "\\spad{write(v,s,f)} takes the given three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport},{} and creates a directory indicated by \\spad{s},{} which contains the graph data file for \\spad{v} and an optional file type \\spad{f}.") (((|String|) $ (|String|)) "\\spad{write(v,s)} takes the given three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport},{} and creates a directory indicated by \\spad{s},{} which contains the graph data file for \\spad{v}.")) (|colorDef| (((|Void|) $ (|Color|) (|Color|)) "\\spad{colorDef(v,c1,c2)} sets the range of colors along the colormap so that the lower end of the colormap is defined by \\spad{c1} and the top end of the colormap is defined by \\spad{c2},{} for the given three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport}.")) (|reset| (((|Void|) $) "\\spad{reset(v)} sets the current state of the graph characteristics of the given three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport},{} back to their initial settings.")) (|intensity| (((|Void|) $ (|Float|)) "\\spad{intensity(v,i)} sets the intensity of the light source to \\spad{i},{} for the given three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport}.")) (|lighting| (((|Void|) $ (|Float|) (|Float|) (|Float|)) "\\spad{lighting(v,x,y,z)} sets the position of the light source to the coordinates \\spad{x},{} \\spad{y},{} and \\spad{z} and displays the graph for the given three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport}.")) (|clipSurface| (((|Void|) $ (|String|)) "\\spad{clipSurface(v,s)} displays the graph with the specified clipping region removed if \\spad{s} is \"on\",{} or displays the graph without clipping implemented if \\spad{s} is \"off\",{} for the given three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport}.")) (|showClipRegion| (((|Void|) $ (|String|)) "\\spad{showClipRegion(v,s)} displays the clipping region of the given three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the region if \\spad{s} is \"off\".")) (|showRegion| (((|Void|) $ (|String|)) "\\spad{showRegion(v,s)} displays the bounding box of the given three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the box if \\spad{s} is \"off\".")) (|hitherPlane| (((|Void|) $ (|Float|)) "\\spad{hitherPlane(v,h)} sets the hither clipping plane of the graph to \\spad{h},{} for the viewport \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport}.")) (|eyeDistance| (((|Void|) $ (|Float|)) "\\spad{eyeDistance(v,d)} sets the distance of the observer from the center of the graph to \\spad{d},{} for the viewport \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport}.")) (|perspective| (((|Void|) $ (|String|)) "\\spad{perspective(v,s)} displays the graph in perspective if \\spad{s} is \"on\",{} or does not display perspective if \\spad{s} is \"off\" for the given three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport}.")) (|translate| (((|Void|) $ (|Float|) (|Float|)) "\\spad{translate(v,dx,dy)} sets the horizontal viewport offset to \\spad{dx} and the vertical viewport offset to \\spad{dy},{} for the viewport \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport}.")) (|zoom| (((|Void|) $ (|Float|) (|Float|) (|Float|)) "\\spad{zoom(v,sx,sy,sz)} sets the graph scaling factors for the \\spad{x}-coordinate axis to \\spad{sx},{} the \\spad{y}-coordinate axis to \\spad{sy} and the \\spad{z}-coordinate axis to \\spad{sz} for the viewport \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport}.") (((|Void|) $ (|Float|)) "\\spad{zoom(v,s)} sets the graph scaling factor to \\spad{s},{} for the viewport \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport}.")) (|rotate| (((|Void|) $ (|Integer|) (|Integer|)) "\\spad{rotate(v,th,phi)} rotates the graph to the longitudinal view angle \\spad{th} degrees and the latitudinal view angle \\spad{phi} degrees for the viewport \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport}. The new rotation position is not displayed until the function \\spadfun{makeViewport3D} is executed again for \\spad{v}.") (((|Void|) $ (|Float|) (|Float|)) "\\spad{rotate(v,th,phi)} rotates the graph to the longitudinal view angle \\spad{th} radians and the latitudinal view angle \\spad{phi} radians for the viewport \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport}.")) (|drawStyle| (((|Void|) $ (|String|)) "\\spad{drawStyle(v,s)} displays the surface for the given three-dimensional viewport \\spad{v} which is of domain \\spadtype{ThreeDimensionalViewport} in the style of drawing indicated by \\spad{s}. If \\spad{s} is not a valid drawing style the style is wireframe by default. Possible styles are \\spad{\"shade\"},{} \\spad{\"solid\"} or \\spad{\"opaque\"},{} \\spad{\"smooth\"},{} and \\spad{\"wireMesh\"}.")) (|outlineRender| (((|Void|) $ (|String|)) "\\spad{outlineRender(v,s)} displays the polygon outline showing either triangularized surface or a quadrilateral surface outline depending on the whether the \\spadfun{diagonals} function has been set,{} for the given three-dimensional viewport \\spad{v} which is of domain \\spadtype{ThreeDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the polygon outline if \\spad{s} is \"off\".")) (|diagonals| (((|Void|) $ (|String|)) "\\spad{diagonals(v,s)} displays the diagonals of the polygon outline showing a triangularized surface instead of a quadrilateral surface outline,{} for the given three-dimensional viewport \\spad{v} which is of domain \\spadtype{ThreeDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the diagonals if \\spad{s} is \"off\".")) (|axes| (((|Void|) $ (|String|)) "\\spad{axes(v,s)} displays the axes of the given three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the axes if \\spad{s} is \"off\".")) (|controlPanel| (((|Void|) $ (|String|)) "\\spad{controlPanel(v,s)} displays the control panel of the given three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport},{} if \\spad{s} is \"on\",{} or hides the control panel if \\spad{s} is \"off\".")) (|viewpoint| (((|Void|) $ (|Float|) (|Float|) (|Float|)) "\\spad{viewpoint(v,rotx,roty,rotz)} sets the rotation about the \\spad{x}-axis to be \\spad{rotx} radians,{} sets the rotation about the \\spad{y}-axis to be \\spad{roty} radians,{} and sets the rotation about the \\spad{z}-axis to be \\spad{rotz} radians,{} for the viewport \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport} and displays \\spad{v} with the new view position.") (((|Void|) $ (|Float|) (|Float|)) "\\spad{viewpoint(v,th,phi)} sets the longitudinal view angle to \\spad{th} radians and the latitudinal view angle to \\spad{phi} radians for the viewport \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport}. The new viewpoint position is not displayed until the function \\spadfun{makeViewport3D} is executed again for \\spad{v}.") (((|Void|) $ (|Integer|) (|Integer|) (|Float|) (|Float|) (|Float|)) "\\spad{viewpoint(v,th,phi,s,dx,dy)} sets the longitudinal view angle to \\spad{th} degrees,{} the latitudinal view angle to \\spad{phi} degrees,{} the scale factor to \\spad{s},{} the horizontal viewport offset to \\spad{dx},{} and the vertical viewport offset to \\spad{dy} for the viewport \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport}. The new viewpoint position is not displayed until the function \\spadfun{makeViewport3D} is executed again for \\spad{v}.") (((|Void|) $ (|Record| (|:| |theta| (|DoubleFloat|)) (|:| |phi| (|DoubleFloat|)) (|:| |scale| (|DoubleFloat|)) (|:| |scaleX| (|DoubleFloat|)) (|:| |scaleY| (|DoubleFloat|)) (|:| |scaleZ| (|DoubleFloat|)) (|:| |deltaX| (|DoubleFloat|)) (|:| |deltaY| (|DoubleFloat|)))) "\\spad{viewpoint(v,viewpt)} sets the viewpoint for the viewport. The viewport record consists of the latitudal and longitudal angles,{} the zoom factor,{} the \\spad{X},{} \\spad{Y},{} and \\spad{Z} scales,{} and the \\spad{X} and \\spad{Y} displacements.") (((|Record| (|:| |theta| (|DoubleFloat|)) (|:| |phi| (|DoubleFloat|)) (|:| |scale| (|DoubleFloat|)) (|:| |scaleX| (|DoubleFloat|)) (|:| |scaleY| (|DoubleFloat|)) (|:| |scaleZ| (|DoubleFloat|)) (|:| |deltaX| (|DoubleFloat|)) (|:| |deltaY| (|DoubleFloat|))) $) "\\spad{viewpoint(v)} returns the current viewpoint setting of the given viewport,{} \\spad{v}. This function is useful in the situation where the user has created a viewport,{} proceeded to interact with it via the control panel and desires to save the values of the viewpoint as the default settings for another viewport to be created using the system.") (((|Void|) $ (|Float|) (|Float|) (|Float|) (|Float|) (|Float|)) "\\spad{viewpoint(v,th,phi,s,dx,dy)} sets the longitudinal view angle to \\spad{th} radians,{} the latitudinal view angle to \\spad{phi} radians,{} the scale factor to \\spad{s},{} the horizontal viewport offset to \\spad{dx},{} and the vertical viewport offset to \\spad{dy} for the viewport \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport}. The new viewpoint position is not displayed until the function \\spadfun{makeViewport3D} is executed again for \\spad{v}.")) (|dimensions| (((|Void|) $ (|NonNegativeInteger|) (|NonNegativeInteger|) (|PositiveInteger|) (|PositiveInteger|)) "\\spad{dimensions(v,x,y,width,height)} sets the position of the upper left-hand corner of the three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport},{} to the window coordinate \\spad{x},{} \\spad{y},{} and sets the dimensions of the window to that of \\spad{width},{} \\spad{height}. The new dimensions are not displayed until the function \\spadfun{makeViewport3D} is executed again for \\spad{v}.")) (|title| (((|Void|) $ (|String|)) "\\spad{title(v,s)} changes the title which is shown in the three-dimensional viewport window,{} \\spad{v} of domain \\spadtype{ThreeDimensionalViewport}.")) (|resize| (((|Void|) $ (|PositiveInteger|) (|PositiveInteger|)) "\\spad{resize(v,w,h)} displays the three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport},{} with a width of \\spad{w} and a height of \\spad{h},{} keeping the upper left-hand corner position unchanged.")) (|move| (((|Void|) $ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{move(v,x,y)} displays the three-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{ThreeDimensionalViewport},{} with the upper left-hand corner of the viewport window at the screen coordinate position \\spad{x},{} \\spad{y}.")) (|options| (($ $ (|List| (|DrawOption|))) "\\spad{options(v,lopt)} takes the viewport,{} \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport} and sets the draw options being used by \\spad{v} to those indicated in the list,{} \\spad{lopt},{} which is a list of options from the domain \\spad{DrawOption}.") (((|List| (|DrawOption|)) $) "\\spad{options(v)} takes the viewport,{} \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport} and returns a list of all the draw options from the domain \\spad{DrawOption} which are being used by \\spad{v}.")) (|modifyPointData| (((|Void|) $ (|NonNegativeInteger|) (|Point| (|DoubleFloat|))) "\\spad{modifyPointData(v,ind,pt)} takes the viewport,{} \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport},{} and places the data point,{} \\spad{pt} into the list of points database of \\spad{v} at the index location given by \\spad{ind}.")) (|subspace| (($ $ (|ThreeSpace| (|DoubleFloat|))) "\\spad{subspace(v,sp)} places the contents of the viewport \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport},{} in the subspace \\spad{sp},{} which is of the domain \\spad{ThreeSpace}.") (((|ThreeSpace| (|DoubleFloat|)) $) "\\spad{subspace(v)} returns the contents of the viewport \\spad{v},{} which is of the domain \\spadtype{ThreeDimensionalViewport},{} as a subspace of the domain \\spad{ThreeSpace}.")) (|makeViewport3D| (($ (|ThreeSpace| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{makeViewport3D(sp,lopt)} takes the given space,{} \\spad{sp} which is of the domain \\spadtype{ThreeSpace} and displays a viewport window on the screen which contains the contents of \\spad{sp},{} and whose draw options are indicated by the list \\spad{lopt},{} which is a list of options from the domain \\spad{DrawOption}.") (($ (|ThreeSpace| (|DoubleFloat|)) (|String|)) "\\spad{makeViewport3D(sp,s)} takes the given space,{} \\spad{sp} which is of the domain \\spadtype{ThreeSpace} and displays a viewport window on the screen which contains the contents of \\spad{sp},{} and whose title is given by \\spad{s}.") (($ $) "\\spad{makeViewport3D(v)} takes the given three-dimensional viewport,{} \\spad{v},{} of the domain \\spadtype{ThreeDimensionalViewport} and displays a viewport window on the screen which contains the contents of \\spad{v}.")) (|viewport3D| (($) "\\spad{viewport3D()} returns an undefined three-dimensional viewport of the domain \\spadtype{ThreeDimensionalViewport} whose contents are empty.")) (|viewDeltaYDefault| (((|Float|) (|Float|)) "\\spad{viewDeltaYDefault(dy)} sets the current default vertical offset from the center of the viewport window to be \\spad{dy} and returns \\spad{dy}.") (((|Float|)) "\\spad{viewDeltaYDefault()} returns the current default vertical offset from the center of the viewport window.")) (|viewDeltaXDefault| (((|Float|) (|Float|)) "\\spad{viewDeltaXDefault(dx)} sets the current default horizontal offset from the center of the viewport window to be \\spad{dx} and returns \\spad{dx}.") (((|Float|)) "\\spad{viewDeltaXDefault()} returns the current default horizontal offset from the center of the viewport window.")) (|viewZoomDefault| (((|Float|) (|Float|)) "\\spad{viewZoomDefault(s)} sets the current default graph scaling value to \\spad{s} and returns \\spad{s}.") (((|Float|)) "\\spad{viewZoomDefault()} returns the current default graph scaling value.")) (|viewPhiDefault| (((|Float|) (|Float|)) "\\spad{viewPhiDefault(p)} sets the current default latitudinal view angle in radians to the value \\spad{p} and returns \\spad{p}.") (((|Float|)) "\\spad{viewPhiDefault()} returns the current default latitudinal view angle in radians.")) (|viewThetaDefault| (((|Float|) (|Float|)) "\\spad{viewThetaDefault(t)} sets the current default longitudinal view angle in radians to the value \\spad{t} and returns \\spad{t}.") (((|Float|)) "\\spad{viewThetaDefault()} returns the current default longitudinal view angle in radians."))) NIL NIL -(-1292) +(-1291) ((|constructor| (NIL "ViewportDefaultsPackage describes default and user definable values for graphics")) (|tubeRadiusDefault| (((|DoubleFloat|)) "\\spad{tubeRadiusDefault()} returns the radius used for a 3D tube plot.") (((|DoubleFloat|) (|Float|)) "\\spad{tubeRadiusDefault(r)} sets the default radius for a 3D tube plot to \\spad{r}.")) (|tubePointsDefault| (((|PositiveInteger|)) "\\spad{tubePointsDefault()} returns the number of points to be used when creating the circle to be used in creating a 3D tube plot.") (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{tubePointsDefault(i)} sets the number of points to use when creating the circle to be used in creating a 3D tube plot to \\spad{i}.")) (|var2StepsDefault| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{var2StepsDefault(i)} sets the number of steps to take when creating a 3D mesh in the direction of the first defined free variable to \\spad{i} (a free variable is considered defined when its range is specified (\\spadignore{e.g.} \\spad{x=0}..10)).") (((|PositiveInteger|)) "\\spad{var2StepsDefault()} is the current setting for the number of steps to take when creating a 3D mesh in the direction of the first defined free variable (a free variable is considered defined when its range is specified (\\spadignore{e.g.} \\spad{x=0}..10)).")) (|var1StepsDefault| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{var1StepsDefault(i)} sets the number of steps to take when creating a 3D mesh in the direction of the first defined free variable to \\spad{i} (a free variable is considered defined when its range is specified (\\spadignore{e.g.} \\spad{x=0}..10)).") (((|PositiveInteger|)) "\\spad{var1StepsDefault()} is the current setting for the number of steps to take when creating a 3D mesh in the direction of the first defined free variable (a free variable is considered defined when its range is specified (\\spadignore{e.g.} \\spad{x=0}..10)).")) (|viewWriteAvailable| (((|List| (|String|))) "\\spad{viewWriteAvailable()} returns a list of available methods for writing,{} such as BITMAP,{} POSTSCRIPT,{} etc.")) (|viewWriteDefault| (((|List| (|String|)) (|List| (|String|))) "\\spad{viewWriteDefault(l)} sets the default list of things to write in a viewport data file to the strings in \\spad{l}; a viewAlone file is always genereated.") (((|List| (|String|))) "\\spad{viewWriteDefault()} returns the list of things to write in a viewport data file; a viewAlone file is always generated.")) (|viewDefaults| (((|Void|)) "\\spad{viewDefaults()} resets all the default graphics settings.")) (|viewSizeDefault| (((|List| (|PositiveInteger|)) (|List| (|PositiveInteger|))) "\\spad{viewSizeDefault([w,h])} sets the default viewport width to \\spad{w} and height to \\spad{h}.") (((|List| (|PositiveInteger|))) "\\spad{viewSizeDefault()} returns the default viewport width and height.")) (|viewPosDefault| (((|List| (|NonNegativeInteger|)) (|List| (|NonNegativeInteger|))) "\\spad{viewPosDefault([x,y])} sets the default \\spad{X} and \\spad{Y} position of a viewport window unless overriden explicityly,{} newly created viewports will have th \\spad{X} and \\spad{Y} coordinates \\spad{x},{} \\spad{y}.") (((|List| (|NonNegativeInteger|))) "\\spad{viewPosDefault()} returns the default \\spad{X} and \\spad{Y} position of a viewport window unless overriden explicityly,{} newly created viewports will have this \\spad{X} and \\spad{Y} coordinate.")) (|pointSizeDefault| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{pointSizeDefault(i)} sets the default size of the points in a 2D viewport to \\spad{i}.") (((|PositiveInteger|)) "\\spad{pointSizeDefault()} returns the default size of the points in a 2D viewport.")) (|unitsColorDefault| (((|Palette|) (|Palette|)) "\\spad{unitsColorDefault(p)} sets the default color of the unit ticks in a 2D viewport to the palette \\spad{p}.") (((|Palette|)) "\\spad{unitsColorDefault()} returns the default color of the unit ticks in a 2D viewport.")) (|axesColorDefault| (((|Palette|) (|Palette|)) "\\spad{axesColorDefault(p)} sets the default color of the axes in a 2D viewport to the palette \\spad{p}.") (((|Palette|)) "\\spad{axesColorDefault()} returns the default color of the axes in a 2D viewport.")) (|lineColorDefault| (((|Palette|) (|Palette|)) "\\spad{lineColorDefault(p)} sets the default color of lines connecting points in a 2D viewport to the palette \\spad{p}.") (((|Palette|)) "\\spad{lineColorDefault()} returns the default color of lines connecting points in a 2D viewport.")) (|pointColorDefault| (((|Palette|) (|Palette|)) "\\spad{pointColorDefault(p)} sets the default color of points in a 2D viewport to the palette \\spad{p}.") (((|Palette|)) "\\spad{pointColorDefault()} returns the default color of points in a 2D viewport."))) NIL NIL -(-1293) +(-1292) ((|constructor| (NIL "This type is used when no value is needed,{} \\spadignore{e.g.} in the \\spad{then} part of a one armed \\spad{if}. All values can be coerced to type Void. Once a value has been coerced to Void,{} it cannot be recovered.")) (|void| (($) "\\spad{void()} produces a void object."))) NIL NIL -(-1294 A S) +(-1293 A S) ((|constructor| (NIL "Vector Spaces (not necessarily finite dimensional) over a field.")) (|dimension| (((|CardinalNumber|)) "\\spad{dimension()} returns the dimensionality of the vector space.")) (/ (($ $ |#2|) "\\spad{x/y} divides the vector \\spad{x} by the scalar \\spad{y}."))) NIL NIL -(-1295 S) +(-1294 S) ((|constructor| (NIL "Vector Spaces (not necessarily finite dimensional) over a field.")) (|dimension| (((|CardinalNumber|)) "\\spad{dimension()} returns the dimensionality of the vector space.")) (/ (($ $ |#1|) "\\spad{x/y} divides the vector \\spad{x} by the scalar \\spad{y}."))) -((-4419 . T) (-4418 . T)) +((-4418 . T) (-4417 . T)) NIL -(-1296 R) +(-1295 R) ((|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 -(-1297 K R UP -3494) +(-1296 K R UP -3493) ((|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 -(-1298) +(-1297) ((|constructor| (NIL "This domain represents the syntax of a `where' expression.")) (|qualifier| (((|SpadAst|) $) "\\spad{qualifier(e)} returns the qualifier of the expression `e'.")) (|mainExpression| (((|SpadAst|) $) "\\spad{mainExpression(e)} returns the main expression of the `where' expression `e'."))) NIL NIL -(-1299) +(-1298) ((|constructor| (NIL "This domain represents the `while' iterator syntax.")) (|condition| (((|SpadAst|) $) "\\spad{condition(i)} returns the condition of the while iterator `i'."))) NIL NIL -(-1300 R |VarSet| E P |vl| |wl| |wtlevel|) +(-1299 R |VarSet| E P |vl| |wl| |wtlevel|) ((|constructor| (NIL "This domain represents truncated weighted polynomials over a general (not necessarily commutative) polynomial type. The variables must be specified,{} as must the weights. The representation is sparse in the sense that only non-zero terms are represented.")) (|changeWeightLevel| (((|Void|) (|NonNegativeInteger|)) "\\spad{changeWeightLevel(n)} changes the weight level to the new value given: NB: previously calculated terms are not affected")) (/ (((|Union| $ "failed") $ $) "\\spad{x/y} division (only works if minimum weight of divisor is zero,{} and if \\spad{R} is a Field)"))) -((-4419 |has| |#1| (-175)) (-4418 |has| |#1| (-175)) (-4421 . T)) +((-4418 |has| |#1| (-175)) (-4417 |has| |#1| (-175)) (-4420 . T)) ((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376)))) -(-1301 R E V P) +(-1300 R E V P) ((|constructor| (NIL "A domain constructor of the category \\axiomType{GeneralTriangularSet}. The only requirement for a list of polynomials to be a member of such a domain is the following: no polynomial is constant and two distinct polynomials have distinct main variables. Such a triangular set may not be auto-reduced or consistent. The \\axiomOpFrom{construct}{WuWenTsunTriangularSet} operation does not check the previous requirement. Triangular sets are stored as sorted lists \\spad{w}.\\spad{r}.\\spad{t}. the main variables of their members. Furthermore,{} this domain exports operations dealing with the characteristic set method of Wu Wen Tsun and some optimizations mainly proposed by Dong Ming Wang.\\newline References : \\indented{1}{[1] \\spad{W}. \\spad{T}. WU \"A Zero Structure Theorem for polynomial equations solving\"} \\indented{6}{MM Research Preprints,{} 1987.} \\indented{1}{[2] \\spad{D}. \\spad{M}. WANG \"An implementation of the characteristic set method in Maple\"} \\indented{6}{Proc. \\spad{DISCO'92}. Bath,{} England.}")) (|characteristicSerie| (((|List| $) (|List| |#4|)) "\\axiom{characteristicSerie(ps)} returns the same as \\axiom{characteristicSerie(ps,{}initiallyReduced?,{}initiallyReduce)}.") (((|List| $) (|List| |#4|) (|Mapping| (|Boolean|) |#4| |#4|) (|Mapping| |#4| |#4| |#4|)) "\\axiom{characteristicSerie(ps,{}redOp?,{}redOp)} returns a list \\axiom{lts} of triangular sets such that the zero set of \\axiom{ps} is the union of the regular zero sets of the members of \\axiom{lts}. This is made by the Ritt and Wu Wen Tsun process applying the operation \\axiom{characteristicSet(ps,{}redOp?,{}redOp)} to compute characteristic sets in Wu Wen Tsun sense.")) (|characteristicSet| (((|Union| $ "failed") (|List| |#4|)) "\\axiom{characteristicSet(ps)} returns the same as \\axiom{characteristicSet(ps,{}initiallyReduced?,{}initiallyReduce)}.") (((|Union| $ "failed") (|List| |#4|) (|Mapping| (|Boolean|) |#4| |#4|) (|Mapping| |#4| |#4| |#4|)) "\\axiom{characteristicSet(ps,{}redOp?,{}redOp)} returns a non-contradictory characteristic set of \\axiom{ps} in Wu Wen Tsun sense \\spad{w}.\\spad{r}.\\spad{t} the reduction-test \\axiom{redOp?} (using \\axiom{redOp} to reduce polynomials \\spad{w}.\\spad{r}.\\spad{t} a \\axiom{redOp?} basic set),{} if no non-zero constant polynomial appear during those reductions,{} else \\axiom{\"failed\"} is returned. The operations \\axiom{redOp} and \\axiom{redOp?} must satisfy the following conditions: \\axiom{redOp?(redOp(\\spad{p},{}\\spad{q}),{}\\spad{q})} holds for every polynomials \\axiom{\\spad{p},{}\\spad{q}} and there exists an integer \\axiom{\\spad{e}} and a polynomial \\axiom{\\spad{f}} such that we have \\axiom{init(\\spad{q})^e*p = f*q + redOp(\\spad{p},{}\\spad{q})}.")) (|medialSet| (((|Union| $ "failed") (|List| |#4|)) "\\axiom{medial(ps)} returns the same as \\axiom{medialSet(ps,{}initiallyReduced?,{}initiallyReduce)}.") (((|Union| $ "failed") (|List| |#4|) (|Mapping| (|Boolean|) |#4| |#4|) (|Mapping| |#4| |#4| |#4|)) "\\axiom{medialSet(ps,{}redOp?,{}redOp)} returns \\axiom{bs} a basic set (in Wu Wen Tsun sense \\spad{w}.\\spad{r}.\\spad{t} the reduction-test \\axiom{redOp?}) of some set generating the same ideal as \\axiom{ps} (with rank not higher than any basic set of \\axiom{ps}),{} if no non-zero constant polynomials appear during the computatioms,{} else \\axiom{\"failed\"} is returned. In the former case,{} \\axiom{bs} has to be understood as a candidate for being a characteristic set of \\axiom{ps}. In the original algorithm,{} \\axiom{bs} is simply a basic set of \\axiom{ps}."))) -((-4425 . T) (-4424 . T)) -((-12 (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (|HasCategory| |#4| (|%list| (QUOTE -630) (QUOTE (-547)))) (|HasCategory| |#4| (QUOTE (-1121))) (|HasCategory| |#1| (QUOTE (-569))) (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -629) (QUOTE (-876)))) (|HasCategory| |#4| (QUOTE (-102)))) -(-1302 R) +((-4424 . T) (-4423 . T)) +((-12 (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (|HasCategory| |#4| (|%list| (QUOTE -629) (QUOTE (-546)))) (|HasCategory| |#4| (QUOTE (-1120))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -628) (QUOTE (-875)))) (|HasCategory| |#4| (QUOTE (-102)))) +(-1301 R) ((|constructor| (NIL "This is the category of algebras over non-commutative rings. It is used by constructors of non-commutative algebras such as: \\indented{4}{\\spadtype{XPolynomialRing}.} \\indented{4}{\\spadtype{XFreeAlgebra}} Author: Michel Petitot (petitot@lifl.fr)"))) -((-4418 . T) (-4419 . T) (-4421 . T)) +((-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1303 |vl| R) +(-1302 |vl| R) ((|constructor| (NIL "\\indented{2}{This type supports distributed multivariate polynomials} whose variables do not commute. The coefficient ring may be non-commutative too. However,{} coefficients and variables commute."))) -((-4421 . T) (-4417 |has| |#2| (-6 -4417)) (-4419 . T) (-4418 . T)) -((|HasCategory| |#2| (QUOTE (-175))) (|HasAttribute| |#2| (QUOTE -4417))) -(-1304 R |VarSet| XPOLY) +((-4420 . T) (-4416 |has| |#2| (-6 -4416)) (-4418 . T) (-4417 . T)) +((|HasCategory| |#2| (QUOTE (-175))) (|HasAttribute| |#2| (QUOTE -4416))) +(-1303 R |VarSet| XPOLY) ((|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 -(-1305 S -3494) +(-1304 S -3493) ((|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)))) -(-1306 -3494) +(-1305 -3493) ((|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}."))) -((-4416 . T) (-4422 . T) (-4417 . T) ((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +((-4415 . T) (-4421 . T) (-4416 . T) ((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL -(-1307 |vl| R) +(-1306 |vl| R) ((|constructor| (NIL "This category specifies opeations for polynomials and formal series with non-commutative variables.")) (|varList| (((|List| |#1|) $) "\\spad{varList(x)} returns the list of variables which appear in \\spad{x}.")) (|map| (($ (|Mapping| |#2| |#2|) $) "\\spad{map(fn,x)} returns \\spad{Sum(fn(r_i) w_i)} if \\spad{x} writes \\spad{Sum(r_i w_i)}.")) (|sh| (($ $ (|NonNegativeInteger|)) "\\spad{sh(x,n)} returns the shuffle power of \\spad{x} to the \\spad{n}.") (($ $ $) "\\spad{sh(x,y)} returns the shuffle-product of \\spad{x} by \\spad{y}. This multiplication is associative and commutative.")) (|quasiRegular| (($ $) "\\spad{quasiRegular(x)} return \\spad{x} minus its constant term.")) (|quasiRegular?| (((|Boolean|) $) "\\spad{quasiRegular?(x)} return \\spad{true} if \\spad{constant(x)} is zero.")) (|constant| ((|#2| $) "\\spad{constant(x)} returns the constant term of \\spad{x}.")) (|constant?| (((|Boolean|) $) "\\spad{constant?(x)} returns \\spad{true} if \\spad{x} is constant.")) (|coerce| (($ |#1|) "\\spad{coerce(v)} returns \\spad{v}.")) (|mirror| (($ $) "\\spad{mirror(x)} returns \\spad{Sum(r_i mirror(w_i))} if \\spad{x} writes \\spad{Sum(r_i w_i)}.")) (|monomial?| (((|Boolean|) $) "\\spad{monomial?(x)} returns \\spad{true} if \\spad{x} is a monomial")) (|monom| (($ (|OrderedFreeMonoid| |#1|) |#2|) "\\spad{monom(w,r)} returns the product of the word \\spad{w} by the coefficient \\spad{r}.")) (|rquo| (($ $ $) "\\spad{rquo(x,y)} returns the right simplification of \\spad{x} by \\spad{y}.") (($ $ (|OrderedFreeMonoid| |#1|)) "\\spad{rquo(x,w)} returns the right simplification of \\spad{x} by \\spad{w}.") (($ $ |#1|) "\\spad{rquo(x,v)} returns the right simplification of \\spad{x} by the variable \\spad{v}.")) (|lquo| (($ $ $) "\\spad{lquo(x,y)} returns the left simplification of \\spad{x} by \\spad{y}.") (($ $ (|OrderedFreeMonoid| |#1|)) "\\spad{lquo(x,w)} returns the left simplification of \\spad{x} by the word \\spad{w}.") (($ $ |#1|) "\\spad{lquo(x,v)} returns the left simplification of \\spad{x} by the variable \\spad{v}.")) (|coef| ((|#2| $ $) "\\spad{coef(x,y)} returns scalar product of \\spad{x} by \\spad{y},{} the set of words being regarded as an orthogonal basis.") ((|#2| $ (|OrderedFreeMonoid| |#1|)) "\\spad{coef(x,w)} returns the coefficient of the word \\spad{w} in \\spad{x}.")) (|mindegTerm| (((|Record| (|:| |k| (|OrderedFreeMonoid| |#1|)) (|:| |c| |#2|)) $) "\\spad{mindegTerm(x)} returns the term whose word is \\spad{mindeg(x)}.")) (|mindeg| (((|OrderedFreeMonoid| |#1|) $) "\\spad{mindeg(x)} returns the little word which appears in \\spad{x}. Error if \\spad{x=0}.")) (* (($ $ |#2|) "\\spad{x * r} returns the product of \\spad{x} by \\spad{r}. Usefull if \\spad{R} is a non-commutative Ring.") (($ |#1| $) "\\spad{v * x} returns the product of a variable \\spad{x} by \\spad{x}."))) -((-4417 |has| |#2| (-6 -4417)) (-4419 . T) (-4418 . T) (-4421 . T)) +((-4416 |has| |#2| (-6 -4416)) (-4418 . T) (-4417 . T) (-4420 . T)) NIL -(-1308 |VarSet| R) +(-1307 |VarSet| R) ((|constructor| (NIL "This domain constructor implements polynomials in non-commutative variables written in the Poincare-Birkhoff-Witt basis from the Lyndon basis. These polynomials can be used to compute Baker-Campbell-Hausdorff relations. \\newline Author: Michel Petitot (petitot@lifl.fr).")) (|log| (($ $ (|NonNegativeInteger|)) "\\axiom{log(\\spad{p},{}\\spad{n})} returns the logarithm of \\axiom{\\spad{p}} (truncated up to order \\axiom{\\spad{n}}).")) (|exp| (($ $ (|NonNegativeInteger|)) "\\axiom{exp(\\spad{p},{}\\spad{n})} returns the exponential of \\axiom{\\spad{p}} (truncated up to order \\axiom{\\spad{n}}).")) (|product| (($ $ $ (|NonNegativeInteger|)) "\\axiom{product(a,{}\\spad{b},{}\\spad{n})} returns \\axiom{a*b} (truncated up to order \\axiom{\\spad{n}}).")) (|LiePolyIfCan| (((|Union| (|LiePolynomial| |#1| |#2|) "failed") $) "\\axiom{LiePolyIfCan(\\spad{p})} return \\axiom{\\spad{p}} if \\axiom{\\spad{p}} is a Lie polynomial.")) (|coerce| (((|XRecursivePolynomial| |#1| |#2|) $) "\\axiom{coerce(\\spad{p})} returns \\axiom{\\spad{p}} as a recursive polynomial.") (((|XDistributedPolynomial| |#1| |#2|) $) "\\axiom{coerce(\\spad{p})} returns \\axiom{\\spad{p}} as a distributed polynomial.") (($ (|LiePolynomial| |#1| |#2|)) "\\axiom{coerce(\\spad{p})} returns \\axiom{\\spad{p}}."))) -((-4417 |has| |#2| (-6 -4417)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -736) (|%list| (QUOTE -419) (QUOTE (-558))))) (|HasAttribute| |#2| (QUOTE -4417))) -(-1309 R) +((-4416 |has| |#2| (-6 -4416)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -735) (|%list| (QUOTE -419) (QUOTE (-557))))) (|HasAttribute| |#2| (QUOTE -4416))) +(-1308 R) ((|constructor| (NIL "\\indented{2}{This type supports multivariate polynomials} whose set of variables is \\spadtype{Symbol}. The representation is recursive. The coefficient ring may be non-commutative and the variables do not commute. However,{} coefficients and variables commute."))) -((-4417 |has| |#1| (-6 -4417)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#1| (QUOTE (-175))) (|HasAttribute| |#1| (QUOTE -4417))) -(-1310 |vl| R) +((-4416 |has| |#1| (-6 -4416)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#1| (QUOTE (-175))) (|HasAttribute| |#1| (QUOTE -4416))) +(-1309 |vl| R) ((|constructor| (NIL "The Category of polynomial rings with non-commutative variables. The coefficient ring may be non-commutative too. However coefficients commute with vaiables.")) (|trunc| (($ $ (|NonNegativeInteger|)) "\\spad{trunc(p,n)} returns the polynomial \\spad{p} truncated at order \\spad{n}.")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(p)} returns the degree of \\spad{p}. \\indented{1}{Note that the degree of a word is its length.}")) (|maxdeg| (((|OrderedFreeMonoid| |#1|) $) "\\spad{maxdeg(p)} returns the greatest leading word in the support of \\spad{p}."))) -((-4417 |has| |#2| (-6 -4417)) (-4419 . T) (-4418 . T) (-4421 . T)) +((-4416 |has| |#2| (-6 -4416)) (-4418 . T) (-4417 . T) (-4420 . T)) NIL -(-1311 R E) +(-1310 R E) ((|constructor| (NIL "This domain represents generalized polynomials with coefficients (from a not necessarily commutative ring),{} and words belonging to an arbitrary \\spadtype{OrderedMonoid}. This type is used,{} for instance,{} by the \\spadtype{XDistributedPolynomial} domain constructor where the Monoid is free.")) (|canonicalUnitNormal| ((|attribute|) "canonicalUnitNormal guarantees that the function unitCanonical returns the same representative for all associates of any particular element.")) (/ (($ $ |#1|) "\\spad{p/r} returns \\spad{p*(1/r)}.")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(fn,x)} returns \\spad{Sum(fn(r_i) w_i)} if \\spad{x} writes \\spad{Sum(r_i w_i)}.")) (|quasiRegular| (($ $) "\\spad{quasiRegular(x)} return \\spad{x} minus its constant term.")) (|quasiRegular?| (((|Boolean|) $) "\\spad{quasiRegular?(x)} return \\spad{true} if \\spad{constant(p)} is zero.")) (|constant| ((|#1| $) "\\spad{constant(p)} return the constant term of \\spad{p}.")) (|constant?| (((|Boolean|) $) "\\spad{constant?(p)} tests whether the polynomial \\spad{p} belongs to the coefficient ring.")) (|coef| ((|#1| $ |#2|) "\\spad{coef(p,e)} extracts the coefficient of the monomial \\spad{e}. Returns zero if \\spad{e} is not present.")) (|reductum| (($ $) "\\spad{reductum(p)} returns \\spad{p} minus its leading term. An error is produced if \\spad{p} is zero.")) (|mindeg| ((|#2| $) "\\spad{mindeg(p)} returns the smallest word occurring in the polynomial \\spad{p} with a non-zero coefficient. An error is produced if \\spad{p} is zero.")) (|maxdeg| ((|#2| $) "\\spad{maxdeg(p)} returns the greatest word occurring in the polynomial \\spad{p} with a non-zero coefficient. An error is produced if \\spad{p} is zero.")) (|#| (((|NonNegativeInteger|) $) "\\spad{\\# p} returns the number of terms in \\spad{p}.")) (* (($ $ |#1|) "\\spad{p*r} returns the product of \\spad{p} by \\spad{r}."))) -((-4421 . T) (-4422 |has| |#1| (-6 -4422)) (-4417 |has| |#1| (-6 -4417)) (-4419 . T) (-4418 . T)) -((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4421)) (|HasAttribute| |#1| (QUOTE -4422)) (|HasAttribute| |#1| (QUOTE -4417))) -(-1312 |VarSet| R) +((-4420 . T) (-4421 |has| |#1| (-6 -4421)) (-4416 |has| |#1| (-6 -4416)) (-4418 . T) (-4417 . T)) +((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4420)) (|HasAttribute| |#1| (QUOTE -4421)) (|HasAttribute| |#1| (QUOTE -4416))) +(-1311 |VarSet| R) ((|constructor| (NIL "\\indented{2}{This type supports multivariate polynomials} whose variables do not commute. The representation is recursive. The coefficient ring may be non-commutative. Coefficients and variables commute.")) (|RemainderList| (((|List| (|Record| (|:| |k| |#1|) (|:| |c| $))) $) "\\spad{RemainderList(p)} returns the regular part of \\spad{p} as a list of terms.")) (|unexpand| (($ (|XDistributedPolynomial| |#1| |#2|)) "\\spad{unexpand(p)} returns \\spad{p} in recursive form.")) (|expand| (((|XDistributedPolynomial| |#1| |#2|) $) "\\spad{expand(p)} returns \\spad{p} in distributed form."))) -((-4417 |has| |#2| (-6 -4417)) (-4419 . T) (-4418 . T) (-4421 . T)) -((|HasCategory| |#2| (QUOTE (-175))) (|HasAttribute| |#2| (QUOTE -4417))) -(-1313) +((-4416 |has| |#2| (-6 -4416)) (-4418 . T) (-4417 . T) (-4420 . T)) +((|HasCategory| |#2| (QUOTE (-175))) (|HasAttribute| |#2| (QUOTE -4416))) +(-1312) ((|constructor| (NIL "This domain provides representations of Young diagrams.")) (|shape| (((|Partition|) $) "\\spad{shape x} returns the partition shaping \\spad{x}.")) (|youngDiagram| (($ (|List| (|PositiveInteger|))) "\\spad{youngDiagram l} returns an object representing a Young diagram with shape given by the list of integers \\spad{l}"))) NIL NIL -(-1314 A) +(-1313 A) ((|constructor| (NIL "This package implements fixed-point computations on streams.")) (Y (((|List| (|Stream| |#1|)) (|Mapping| (|List| (|Stream| |#1|)) (|List| (|Stream| |#1|))) (|Integer|)) "\\spad{Y(g,n)} computes a fixed point of the function \\spad{g},{} where \\spad{g} takes a list of \\spad{n} streams and returns a list of \\spad{n} streams.") (((|Stream| |#1|) (|Mapping| (|Stream| |#1|) (|Stream| |#1|))) "\\spad{Y(f)} computes a fixed point of the function \\spad{f}."))) NIL NIL -(-1315 R |ls| |ls2|) +(-1314 R |ls| |ls2|) ((|constructor| (NIL "A package for computing symbolically the complex and real roots of zero-dimensional algebraic systems over the integer or rational numbers. Complex roots are given by means of univariate representations of irreducible regular chains. Real roots are given by means of tuples of coordinates lying in the \\spadtype{RealClosure} of the coefficient ring. This constructor takes three arguments. The first one \\spad{R} is the coefficient ring. The second one \\spad{ls} is the list of variables involved in the systems to solve. The third one must be \\spad{concat(ls,s)} where \\spad{s} is an additional symbol used for the univariate representations. WARNING: The third argument is not checked. All operations are based on triangular decompositions. The default is to compute these decompositions directly from the input system by using the \\spadtype{RegularChain} domain constructor. The lexTriangular algorithm can also be used for computing these decompositions (see the \\spadtype{LexTriangularPackage} package constructor). For that purpose,{} the operations \\axiomOpFrom{univariateSolve}{ZeroDimensionalSolvePackage},{} \\axiomOpFrom{realSolve}{ZeroDimensionalSolvePackage} and \\axiomOpFrom{positiveSolve}{ZeroDimensionalSolvePackage} admit an optional argument. \\newline Author: Marc Moreno Maza.")) (|convert| (((|List| (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#3|))) (|SquareFreeRegularTriangularSet| |#1| (|IndexedExponents| (|OrderedVariableList| |#3|)) (|OrderedVariableList| |#3|) (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#3|)))) "\\spad{convert(st)} returns the members of \\spad{st}. ") (((|SparseUnivariatePolynomial| (|RealClosure| (|Fraction| |#1|))) (|SparseUnivariatePolynomial| |#1|)) "\\spad{convert(u)} converts \\spad{u}.") (((|Polynomial| (|RealClosure| (|Fraction| |#1|))) (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#3|))) "\\spad{convert(q)} converts \\spad{q}.") (((|Polynomial| (|RealClosure| (|Fraction| |#1|))) (|Polynomial| |#1|)) "\\spad{convert(p)} converts \\spad{p}.") (((|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#3|)) (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#2|))) "\\spad{convert(q)} converts \\spad{q}.")) (|squareFree| (((|List| (|SquareFreeRegularTriangularSet| |#1| (|IndexedExponents| (|OrderedVariableList| |#3|)) (|OrderedVariableList| |#3|) (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#3|)))) (|RegularChain| |#1| |#2|)) "\\spad{squareFree(ts)} returns the square-free factorization of \\spad{ts}. Moreover,{} each factor is a Lazard triangular set and the decomposition is a Kalkbrener split of \\spad{ts},{} which is enough here for the matter of solving zero-dimensional algebraic systems. WARNING: \\spad{ts} is not checked to be zero-dimensional.")) (|positiveSolve| (((|List| (|List| (|RealClosure| (|Fraction| |#1|)))) (|List| (|Polynomial| |#1|))) "\\spad{positiveSolve(lp)} returns the same as \\spad{positiveSolve(lp,false,false)}.") (((|List| (|List| (|RealClosure| (|Fraction| |#1|)))) (|List| (|Polynomial| |#1|)) (|Boolean|)) "\\spad{positiveSolve(lp)} returns the same as \\spad{positiveSolve(lp,info?,false)}.") (((|List| (|List| (|RealClosure| (|Fraction| |#1|)))) (|List| (|Polynomial| |#1|)) (|Boolean|) (|Boolean|)) "\\spad{positiveSolve(lp,info?,lextri?)} returns the set of the points in the variety associated with \\spad{lp} whose coordinates are (real) strictly positive. Moreover,{} if \\spad{info?} is \\spad{true} then some information is displayed during decomposition into regular chains. If \\spad{lextri?} is \\spad{true} then the lexTriangular algorithm is called from the \\spadtype{LexTriangularPackage} constructor (see \\axiomOpFrom{zeroSetSplit}{LexTriangularPackage}(\\spad{lp},{}\\spad{false})). Otherwise,{} the triangular decomposition is computed directly from the input system by using the \\axiomOpFrom{zeroSetSplit}{RegularChain} from \\spadtype{RegularChain}. WARNING: For each set of coordinates given by \\spad{positiveSolve(lp,info?,lextri?)} the ordering of the indeterminates is reversed \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ls}.") (((|List| (|List| (|RealClosure| (|Fraction| |#1|)))) (|RegularChain| |#1| |#2|)) "\\spad{positiveSolve(ts)} returns the points of the regular set of \\spad{ts} with (real) strictly positive coordinates.")) (|realSolve| (((|List| (|List| (|RealClosure| (|Fraction| |#1|)))) (|List| (|Polynomial| |#1|))) "\\spad{realSolve(lp)} returns the same as \\spad{realSolve(ts,false,false,false)}") (((|List| (|List| (|RealClosure| (|Fraction| |#1|)))) (|List| (|Polynomial| |#1|)) (|Boolean|)) "\\spad{realSolve(ts,info?)} returns the same as \\spad{realSolve(ts,info?,false,false)}.") (((|List| (|List| (|RealClosure| (|Fraction| |#1|)))) (|List| (|Polynomial| |#1|)) (|Boolean|) (|Boolean|)) "\\spad{realSolve(ts,info?,check?)} returns the same as \\spad{realSolve(ts,info?,check?,false)}.") (((|List| (|List| (|RealClosure| (|Fraction| |#1|)))) (|List| (|Polynomial| |#1|)) (|Boolean|) (|Boolean|) (|Boolean|)) "\\spad{realSolve(ts,info?,check?,lextri?)} returns the set of the points in the variety associated with \\spad{lp} whose coordinates are all real. Moreover,{} if \\spad{info?} is \\spad{true} then some information is displayed during decomposition into regular chains. If \\spad{check?} is \\spad{true} then the result is checked. If \\spad{lextri?} is \\spad{true} then the lexTriangular algorithm is called from the \\spadtype{LexTriangularPackage} constructor (see \\axiomOpFrom{zeroSetSplit}{LexTriangularPackage}(lp,{}\\spad{false})). Otherwise,{} the triangular decomposition is computed directly from the input system by using the \\axiomOpFrom{zeroSetSplit}{RegularChain} from \\spadtype{RegularChain}. WARNING: For each set of coordinates given by \\spad{realSolve(ts,info?,check?,lextri?)} the ordering of the indeterminates is reversed \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ls}.") (((|List| (|List| (|RealClosure| (|Fraction| |#1|)))) (|RegularChain| |#1| |#2|)) "\\spad{realSolve(ts)} returns the set of the points in the regular zero set of \\spad{ts} whose coordinates are all real. WARNING: For each set of coordinates given by \\spad{realSolve(ts)} the ordering of the indeterminates is reversed \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ls}.")) (|univariateSolve| (((|List| (|Record| (|:| |complexRoots| (|SparseUnivariatePolynomial| |#1|)) (|:| |coordinates| (|List| (|Polynomial| |#1|))))) (|List| (|Polynomial| |#1|))) "\\spad{univariateSolve(lp)} returns the same as \\spad{univariateSolve(lp,false,false,false)}.") (((|List| (|Record| (|:| |complexRoots| (|SparseUnivariatePolynomial| |#1|)) (|:| |coordinates| (|List| (|Polynomial| |#1|))))) (|List| (|Polynomial| |#1|)) (|Boolean|)) "\\spad{univariateSolve(lp,info?)} returns the same as \\spad{univariateSolve(lp,info?,false,false)}.") (((|List| (|Record| (|:| |complexRoots| (|SparseUnivariatePolynomial| |#1|)) (|:| |coordinates| (|List| (|Polynomial| |#1|))))) (|List| (|Polynomial| |#1|)) (|Boolean|) (|Boolean|)) "\\spad{univariateSolve(lp,info?,check?)} returns the same as \\spad{univariateSolve(lp,info?,check?,false)}.") (((|List| (|Record| (|:| |complexRoots| (|SparseUnivariatePolynomial| |#1|)) (|:| |coordinates| (|List| (|Polynomial| |#1|))))) (|List| (|Polynomial| |#1|)) (|Boolean|) (|Boolean|) (|Boolean|)) "\\spad{univariateSolve(lp,info?,check?,lextri?)} returns a univariate representation of the variety associated with \\spad{lp}. Moreover,{} if \\spad{info?} is \\spad{true} then some information is displayed during the decomposition into regular chains. If \\spad{check?} is \\spad{true} then the result is checked. See \\axiomOpFrom{rur}{RationalUnivariateRepresentationPackage}(\\spad{lp},{}\\spad{true}). If \\spad{lextri?} is \\spad{true} then the lexTriangular algorithm is called from the \\spadtype{LexTriangularPackage} constructor (see \\axiomOpFrom{zeroSetSplit}{LexTriangularPackage}(\\spad{lp},{}\\spad{false})). Otherwise,{} the triangular decomposition is computed directly from the input system by using the \\axiomOpFrom{zeroSetSplit}{RegularChain} from \\spadtype{RegularChain}.") (((|List| (|Record| (|:| |complexRoots| (|SparseUnivariatePolynomial| |#1|)) (|:| |coordinates| (|List| (|Polynomial| |#1|))))) (|RegularChain| |#1| |#2|)) "\\spad{univariateSolve(ts)} returns a univariate representation of \\spad{ts}. See \\axiomOpFrom{rur}{RationalUnivariateRepresentationPackage}(lp,{}\\spad{true}).")) (|triangSolve| (((|List| (|RegularChain| |#1| |#2|)) (|List| (|Polynomial| |#1|))) "\\spad{triangSolve(lp)} returns the same as \\spad{triangSolve(lp,false,false)}") (((|List| (|RegularChain| |#1| |#2|)) (|List| (|Polynomial| |#1|)) (|Boolean|)) "\\spad{triangSolve(lp,info?)} returns the same as \\spad{triangSolve(lp,false)}") (((|List| (|RegularChain| |#1| |#2|)) (|List| (|Polynomial| |#1|)) (|Boolean|) (|Boolean|)) "\\spad{triangSolve(lp,info?,lextri?)} decomposes the variety associated with \\axiom{\\spad{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{\\spad{lp}} needs to generate a zero-dimensional ideal. If \\axiom{\\spad{lp}} is not zero-dimensional then the result is only a decomposition of its zero-set in the sense of the closure (\\spad{w}.\\spad{r}.\\spad{t}. Zarisky topology). Moreover,{} if \\spad{info?} is \\spad{true} then some information is displayed during the computations. See \\axiomOpFrom{zeroSetSplit}{RegularTriangularSetCategory}(\\spad{lp},{}\\spad{true},{}\\spad{info?}). If \\spad{lextri?} is \\spad{true} then the lexTriangular algorithm is called from the \\spadtype{LexTriangularPackage} constructor (see \\axiomOpFrom{zeroSetSplit}{LexTriangularPackage}(\\spad{lp},{}\\spad{false})). Otherwise,{} the triangular decomposition is computed directly from the input system by using the \\axiomOpFrom{zeroSetSplit}{RegularChain} from \\spadtype{RegularChain}."))) NIL NIL -(-1316 R) +(-1315 R) ((|constructor| (NIL "Test for linear dependence over the integers.")) (|solveLinearlyOverQ| (((|Union| (|Vector| (|Fraction| (|Integer|))) "failed") (|Vector| |#1|) |#1|) "\\spad{solveLinearlyOverQ([v1,...,vn], u)} returns \\spad{[c1,...,cn]} such that \\spad{c1*v1 + ... + cn*vn = u},{} \"failed\" if no such rational numbers \\spad{ci}'s exist.")) (|linearDependenceOverZ| (((|Union| (|Vector| (|Integer|)) "failed") (|Vector| |#1|)) "\\spad{linearlyDependenceOverZ([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 the integers.")) (|linearlyDependentOverZ?| (((|Boolean|) (|Vector| |#1|)) "\\spad{linearlyDependentOverZ?([v1,...,vn])} returns \\spad{true} if the \\spad{vi}'s are linearly dependent over the integers,{} \\spad{false} otherwise."))) NIL NIL -(-1317 |p|) +(-1316 |p|) ((|constructor| (NIL "IntegerMod(\\spad{n}) creates the ring of integers reduced modulo the integer \\spad{n}."))) -(((-4426 "*") . T) (-4418 . T) (-4419 . T) (-4421 . T)) +(((-4425 "*") . T) (-4417 . T) (-4418 . T) (-4420 . T)) NIL NIL NIL @@ -5216,4 +5212,4 @@ NIL NIL NIL NIL -((-3 NIL 2275956 2275961 2275966 2275971) (-2 NIL 2275936 2275941 2275946 2275951) (-1 NIL 2275916 2275921 2275926 2275931) (0 NIL 2275896 2275901 2275906 2275911) (-1317 "ZMOD.spad" 2275705 2275718 2275834 2275891) (-1316 "ZLINDEP.spad" 2274803 2274814 2275695 2275700) (-1315 "ZDSOLVE.spad" 2264763 2264785 2274793 2274798) (-1314 "YSTREAM.spad" 2264258 2264269 2264753 2264758) (-1313 "YDIAGRAM.spad" 2263892 2263901 2264248 2264253) (-1312 "XRPOLY.spad" 2263112 2263132 2263748 2263817) (-1311 "XPR.spad" 2260907 2260920 2262830 2262929) (-1310 "XPOLYC.spad" 2260226 2260242 2260833 2260902) (-1309 "XPOLY.spad" 2259781 2259792 2260082 2260151) (-1308 "XPBWPOLY.spad" 2258220 2258240 2259555 2259624) (-1307 "XFALG.spad" 2255268 2255284 2258146 2258215) (-1306 "XF.spad" 2253731 2253746 2255170 2255263) (-1305 "XF.spad" 2252174 2252191 2253615 2253620) (-1304 "XEXPPKG.spad" 2251433 2251459 2252164 2252169) (-1303 "XDPOLY.spad" 2251047 2251063 2251289 2251358) (-1302 "XALG.spad" 2250715 2250726 2251003 2251042) (-1301 "WUTSET.spad" 2246685 2246702 2250316 2250343) (-1300 "WP.spad" 2245892 2245936 2246543 2246610) (-1299 "WHILEAST.spad" 2245690 2245699 2245882 2245887) (-1298 "WHEREAST.spad" 2245361 2245370 2245680 2245685) (-1297 "WFFINTBS.spad" 2243024 2243046 2245351 2245356) (-1296 "WEIER.spad" 2241246 2241257 2243014 2243019) (-1295 "VSPACE.spad" 2240919 2240930 2241214 2241241) (-1294 "VSPACE.spad" 2240612 2240625 2240909 2240914) (-1293 "VOID.spad" 2240289 2240298 2240602 2240607) (-1292 "VIEWDEF.spad" 2235490 2235499 2240279 2240284) (-1291 "VIEW3D.spad" 2219451 2219460 2235480 2235485) (-1290 "VIEW2D.spad" 2207350 2207359 2219441 2219446) (-1289 "VIEW.spad" 2205070 2205079 2207340 2207345) (-1288 "VECTOR2.spad" 2203709 2203722 2205060 2205065) (-1287 "VECTOR.spad" 2202209 2202220 2202460 2202487) (-1286 "VECTCAT.spad" 2200121 2200132 2202177 2202204) (-1285 "VECTCAT.spad" 2197840 2197853 2199898 2199903) (-1284 "VARIABLE.spad" 2197620 2197635 2197830 2197835) (-1283 "UTYPE.spad" 2197264 2197273 2197610 2197615) (-1282 "UTSODETL.spad" 2196559 2196583 2197220 2197225) (-1281 "UTSODE.spad" 2194775 2194795 2196549 2196554) (-1280 "UTSCAT.spad" 2192254 2192270 2194673 2194770) (-1279 "UTSCAT.spad" 2189353 2189371 2191774 2191779) (-1278 "UTS2.spad" 2188948 2188983 2189343 2189348) (-1277 "UTS.spad" 2183826 2183854 2187346 2187443) (-1276 "URAGG.spad" 2178547 2178558 2183816 2183821) (-1275 "URAGG.spad" 2173232 2173245 2178503 2178508) (-1274 "UPXSSING.spad" 2170850 2170876 2172286 2172419) (-1273 "UPXSCONS.spad" 2168528 2168548 2168901 2169050) (-1272 "UPXSCCA.spad" 2167099 2167119 2168374 2168523) (-1271 "UPXSCCA.spad" 2165812 2165834 2167089 2167094) (-1270 "UPXSCAT.spad" 2164401 2164417 2165658 2165807) (-1269 "UPXS2.spad" 2163944 2163997 2164391 2164396) (-1268 "UPXS.spad" 2161159 2161187 2161995 2162144) (-1267 "UPSQFREE.spad" 2159574 2159588 2161149 2161154) (-1266 "UPSCAT.spad" 2157369 2157393 2159472 2159569) (-1265 "UPSCAT.spad" 2154849 2154875 2156954 2156959) (-1264 "UPOLYC2.spad" 2154320 2154339 2154839 2154844) (-1263 "UPOLYC.spad" 2149400 2149411 2154162 2154315) (-1262 "UPOLYC.spad" 2144366 2144379 2149130 2149135) (-1261 "UPMP.spad" 2143298 2143311 2144356 2144361) (-1260 "UPDIVP.spad" 2142863 2142877 2143288 2143293) (-1259 "UPDECOMP.spad" 2141124 2141138 2142853 2142858) (-1258 "UPCDEN.spad" 2140341 2140357 2141114 2141119) (-1257 "UP2.spad" 2139705 2139726 2140331 2140336) (-1256 "UP.spad" 2136733 2136748 2137120 2137273) (-1255 "UNISEG2.spad" 2136230 2136243 2136689 2136694) (-1254 "UNISEG.spad" 2135583 2135594 2136149 2136154) (-1253 "UNIFACT.spad" 2134686 2134698 2135573 2135578) (-1252 "ULSCONS.spad" 2125598 2125618 2125968 2126117) (-1251 "ULSCCAT.spad" 2123335 2123355 2125444 2125593) (-1250 "ULSCCAT.spad" 2121180 2121202 2123291 2123296) (-1249 "ULSCAT.spad" 2119420 2119436 2121026 2121175) (-1248 "ULS2.spad" 2118934 2118987 2119410 2119415) (-1247 "ULS.spad" 2108505 2108533 2109450 2109879) (-1246 "UINT8.spad" 2108382 2108391 2108495 2108500) (-1245 "UINT64.spad" 2108258 2108267 2108372 2108377) (-1244 "UINT32.spad" 2108134 2108143 2108248 2108253) (-1243 "UINT16.spad" 2108010 2108019 2108124 2108129) (-1242 "UFD.spad" 2107075 2107084 2107936 2108005) (-1241 "UFD.spad" 2106202 2106213 2107065 2107070) (-1240 "UDVO.spad" 2105083 2105092 2106192 2106197) (-1239 "UDPO.spad" 2102664 2102675 2105039 2105044) (-1238 "TYPEAST.spad" 2102583 2102592 2102654 2102659) (-1237 "TYPE.spad" 2102515 2102524 2102573 2102578) (-1236 "TWOFACT.spad" 2101167 2101182 2102505 2102510) (-1235 "TUPLE.spad" 2100658 2100669 2101063 2101068) (-1234 "TUBETOOL.spad" 2097525 2097534 2100648 2100653) (-1233 "TUBE.spad" 2096172 2096189 2097515 2097520) (-1232 "TSETCAT.spad" 2084243 2084260 2096140 2096167) (-1231 "TSETCAT.spad" 2072300 2072319 2084199 2084204) (-1230 "TS.spad" 2070893 2070909 2071859 2071956) (-1229 "TRMANIP.spad" 2065257 2065274 2070581 2070586) (-1228 "TRIMAT.spad" 2064220 2064245 2065247 2065252) (-1227 "TRIGMNIP.spad" 2062747 2062764 2064210 2064215) (-1226 "TRIGCAT.spad" 2062259 2062268 2062737 2062742) (-1225 "TRIGCAT.spad" 2061769 2061780 2062249 2062254) (-1224 "TREE.spad" 2060215 2060226 2061247 2061274) (-1223 "TRANFUN.spad" 2060054 2060063 2060205 2060210) (-1222 "TRANFUN.spad" 2059891 2059902 2060044 2060049) (-1221 "TOPSP.spad" 2059565 2059574 2059881 2059886) (-1220 "TOOLSIGN.spad" 2059228 2059239 2059555 2059560) (-1219 "TEXTFILE.spad" 2057789 2057798 2059218 2059223) (-1218 "TEX1.spad" 2057345 2057356 2057779 2057784) (-1217 "TEX.spad" 2054539 2054548 2057335 2057340) (-1216 "TEMUTL.spad" 2054094 2054103 2054529 2054534) (-1215 "TBCMPPK.spad" 2052195 2052218 2054084 2054089) (-1214 "TBAGG.spad" 2051253 2051276 2052175 2052190) (-1213 "TBAGG.spad" 2050319 2050344 2051243 2051248) (-1212 "TANEXP.spad" 2049727 2049738 2050309 2050314) (-1211 "TALGOP.spad" 2049451 2049462 2049717 2049722) (-1210 "TABLEAU.spad" 2048932 2048943 2049441 2049446) (-1209 "TABLE.spad" 2046865 2046888 2047135 2047162) (-1208 "TABLBUMP.spad" 2043644 2043655 2046855 2046860) (-1207 "SYSTEM.spad" 2042872 2042881 2043634 2043639) (-1206 "SYSSOLP.spad" 2040355 2040366 2042862 2042867) (-1205 "SYSPTR.spad" 2040254 2040263 2040345 2040350) (-1204 "SYSNNI.spad" 2039477 2039488 2040244 2040249) (-1203 "SYSINT.spad" 2038881 2038892 2039467 2039472) (-1202 "SYNTAX.spad" 2035215 2035224 2038871 2038876) (-1201 "SYMTAB.spad" 2033283 2033292 2035205 2035210) (-1200 "SYMS.spad" 2029312 2029321 2033273 2033278) (-1199 "SYMPOLY.spad" 2028292 2028303 2028374 2028501) (-1198 "SYMFUNC.spad" 2027793 2027804 2028282 2028287) (-1197 "SYMBOL.spad" 2025288 2025297 2027783 2027788) (-1196 "SWITCH.spad" 2022059 2022068 2025278 2025283) (-1195 "SUTS.spad" 2019038 2019066 2020457 2020554) (-1194 "SUPXS.spad" 2016240 2016268 2017089 2017238) (-1193 "SUPFRACF.spad" 2015345 2015363 2016230 2016235) (-1192 "SUP2.spad" 2014737 2014750 2015335 2015340) (-1191 "SUP.spad" 2011379 2011390 2012152 2012305) (-1190 "SUMRF.spad" 2010353 2010364 2011369 2011374) (-1189 "SUMFS.spad" 2009982 2009999 2010343 2010348) (-1188 "SULS.spad" 1999540 1999568 2000498 2000927) (-1187 "SUCHTAST.spad" 1999309 1999318 1999530 1999535) (-1186 "SUCH.spad" 1998999 1999014 1999299 1999304) (-1185 "SUBSPACE.spad" 1991130 1991145 1998989 1998994) (-1184 "SUBRESP.spad" 1990300 1990314 1991086 1991091) (-1183 "STTFNC.spad" 1986768 1986784 1990290 1990295) (-1182 "STTF.spad" 1982867 1982883 1986758 1986763) (-1181 "STTAYLOR.spad" 1975512 1975523 1982742 1982747) (-1180 "STRTBL.spad" 1973527 1973544 1973676 1973703) (-1179 "STRING.spad" 1972129 1972138 1972514 1972541) (-1178 "STREAM3.spad" 1971702 1971717 1972119 1972124) (-1177 "STREAM2.spad" 1970830 1970843 1971692 1971697) (-1176 "STREAM1.spad" 1970536 1970547 1970820 1970825) (-1175 "STREAM.spad" 1967322 1967333 1969929 1969944) (-1174 "STINPROD.spad" 1966258 1966274 1967312 1967317) (-1173 "STEPAST.spad" 1965492 1965501 1966248 1966253) (-1172 "STEP.spad" 1964809 1964818 1965482 1965487) (-1171 "STBL.spad" 1962857 1962885 1963024 1963039) (-1170 "STAGG.spad" 1961556 1961567 1962847 1962852) (-1169 "STAGG.spad" 1960253 1960266 1961546 1961551) (-1168 "STACK.spad" 1959481 1959492 1959731 1959758) (-1167 "SRING.spad" 1959241 1959250 1959471 1959476) (-1166 "SREGSET.spad" 1956940 1956957 1958842 1958869) (-1165 "SRDCMPK.spad" 1955517 1955537 1956930 1956935) (-1164 "SRAGG.spad" 1950700 1950709 1955485 1955512) (-1163 "SRAGG.spad" 1945903 1945914 1950690 1950695) (-1162 "SQMATRIX.spad" 1943395 1943413 1944311 1944398) (-1161 "SPLTREE.spad" 1937861 1937874 1942657 1942684) (-1160 "SPLNODE.spad" 1934481 1934494 1937851 1937856) (-1159 "SPFCAT.spad" 1933290 1933299 1934471 1934476) (-1158 "SPECOUT.spad" 1931842 1931851 1933280 1933285) (-1157 "SPADXPT.spad" 1923933 1923942 1931832 1931837) (-1156 "spad-parser.spad" 1923398 1923407 1923923 1923928) (-1155 "SPADAST.spad" 1923099 1923108 1923388 1923393) (-1154 "SPACEC.spad" 1907314 1907325 1923089 1923094) (-1153 "SPACE3.spad" 1907090 1907101 1907304 1907309) (-1152 "SORTPAK.spad" 1906639 1906652 1907046 1907051) (-1151 "SOLVETRA.spad" 1904402 1904413 1906629 1906634) (-1150 "SOLVESER.spad" 1902858 1902869 1904392 1904397) (-1149 "SOLVERAD.spad" 1898884 1898895 1902848 1902853) (-1148 "SOLVEFOR.spad" 1897346 1897364 1898874 1898879) (-1147 "SNTSCAT.spad" 1896946 1896963 1897314 1897341) (-1146 "SMTS.spad" 1895228 1895254 1896505 1896602) (-1145 "SMP.spad" 1892631 1892651 1893021 1893148) (-1144 "SMITH.spad" 1891476 1891501 1892621 1892626) (-1143 "SMATCAT.spad" 1889594 1889624 1891420 1891471) (-1142 "SMATCAT.spad" 1887644 1887676 1889472 1889477) (-1141 "SKAGG.spad" 1886613 1886624 1887612 1887639) (-1140 "SINT.spad" 1885553 1885562 1886479 1886608) (-1139 "SIMPAN.spad" 1885281 1885290 1885543 1885548) (-1138 "SIGNRF.spad" 1884406 1884417 1885271 1885276) (-1137 "SIGNEF.spad" 1883692 1883709 1884396 1884401) (-1136 "SIGAST.spad" 1883109 1883118 1883682 1883687) (-1135 "SIG.spad" 1882471 1882480 1883099 1883104) (-1134 "SHP.spad" 1880415 1880430 1882427 1882432) (-1133 "SHDP.spad" 1867770 1867797 1868287 1868386) (-1132 "SGROUP.spad" 1867378 1867387 1867760 1867765) (-1131 "SGROUP.spad" 1866984 1866995 1867368 1867373) (-1130 "SGCF.spad" 1860123 1860132 1866974 1866979) (-1129 "SFRTCAT.spad" 1859069 1859086 1860091 1860118) (-1128 "SFRGCD.spad" 1858132 1858152 1859059 1859064) (-1127 "SFQCMPK.spad" 1852945 1852965 1858122 1858127) (-1126 "SFORT.spad" 1852384 1852398 1852935 1852940) (-1125 "SEXOF.spad" 1852227 1852267 1852374 1852379) (-1124 "SEXCAT.spad" 1850055 1850095 1852217 1852222) (-1123 "SEX.spad" 1849947 1849956 1850045 1850050) (-1122 "SETMN.spad" 1848407 1848424 1849937 1849942) (-1121 "SETCAT.spad" 1847892 1847901 1848397 1848402) (-1120 "SETCAT.spad" 1847375 1847386 1847882 1847887) (-1119 "SETAGG.spad" 1843924 1843935 1847355 1847370) (-1118 "SETAGG.spad" 1840481 1840494 1843914 1843919) (-1117 "SET.spad" 1838754 1838765 1839851 1839890) (-1116 "SEQAST.spad" 1838457 1838466 1838744 1838749) (-1115 "SEGXCAT.spad" 1837613 1837626 1838447 1838452) (-1114 "SEGCAT.spad" 1836538 1836549 1837603 1837608) (-1113 "SEGBIND2.spad" 1836236 1836249 1836528 1836533) (-1112 "SEGBIND.spad" 1835994 1836005 1836183 1836188) (-1111 "SEGAST.spad" 1835724 1835733 1835984 1835989) (-1110 "SEG2.spad" 1835159 1835172 1835680 1835685) (-1109 "SEG.spad" 1834972 1834983 1835078 1835083) (-1108 "SDVAR.spad" 1834248 1834259 1834962 1834967) (-1107 "SDPOL.spad" 1831503 1831514 1831794 1831921) (-1106 "SCPKG.spad" 1829592 1829603 1831493 1831498) (-1105 "SCOPE.spad" 1828769 1828778 1829582 1829587) (-1104 "SCACHE.spad" 1827465 1827476 1828759 1828764) (-1103 "SASTCAT.spad" 1827374 1827383 1827455 1827460) (-1102 "SAOS.spad" 1827246 1827255 1827364 1827369) (-1101 "SAERFFC.spad" 1826959 1826979 1827236 1827241) (-1100 "SAEFACT.spad" 1826660 1826680 1826949 1826954) (-1099 "SAE.spad" 1824094 1824110 1824705 1824840) (-1098 "RURPK.spad" 1821753 1821769 1824084 1824089) (-1097 "RULESET.spad" 1821206 1821230 1821743 1821748) (-1096 "RULECOLD.spad" 1821058 1821071 1821196 1821201) (-1095 "RULE.spad" 1819306 1819330 1821048 1821053) (-1094 "RTVALUE.spad" 1819041 1819050 1819296 1819301) (-1093 "RSTRCAST.spad" 1818758 1818767 1819031 1819036) (-1092 "RSETGCD.spad" 1815200 1815220 1818748 1818753) (-1091 "RSETCAT.spad" 1805168 1805185 1815168 1815195) (-1090 "RSETCAT.spad" 1795156 1795175 1805158 1805163) (-1089 "RSDCMPK.spad" 1793656 1793676 1795146 1795151) (-1088 "RRCC.spad" 1792040 1792070 1793646 1793651) (-1087 "RRCC.spad" 1790422 1790454 1792030 1792035) (-1086 "RPTAST.spad" 1790124 1790133 1790412 1790417) (-1085 "RPOLCAT.spad" 1769628 1769643 1789992 1790119) (-1084 "RPOLCAT.spad" 1748827 1748844 1769193 1769198) (-1083 "ROUTINE.spad" 1744228 1744237 1746976 1747003) (-1082 "ROMAN.spad" 1743556 1743565 1744094 1744223) (-1081 "ROIRC.spad" 1742636 1742668 1743546 1743551) (-1080 "RNS.spad" 1741612 1741621 1742538 1742631) (-1079 "RNS.spad" 1740674 1740685 1741602 1741607) (-1078 "RNGBIND.spad" 1739834 1739848 1740629 1740634) (-1077 "RNG.spad" 1739569 1739578 1739824 1739829) (-1076 "RMODULE.spad" 1739350 1739361 1739559 1739564) (-1075 "RMCAT2.spad" 1738770 1738827 1739340 1739345) (-1074 "RMATRIX.spad" 1737540 1737559 1737883 1737922) (-1073 "RMATCAT.spad" 1733119 1733150 1737496 1737535) (-1072 "RMATCAT.spad" 1728588 1728621 1732967 1732972) (-1071 "RLINSET.spad" 1728292 1728303 1728578 1728583) (-1070 "RINTERP.spad" 1728180 1728200 1728282 1728287) (-1069 "RING.spad" 1727650 1727659 1728160 1728175) (-1068 "RING.spad" 1727128 1727139 1727640 1727645) (-1067 "RIDIST.spad" 1726520 1726529 1727118 1727123) (-1066 "RGCHAIN.spad" 1725041 1725057 1725935 1725962) (-1065 "RGBCSPC.spad" 1724830 1724842 1725031 1725036) (-1064 "RGBCMDL.spad" 1724392 1724404 1724820 1724825) (-1063 "RFFACTOR.spad" 1723854 1723865 1724382 1724387) (-1062 "RFFACT.spad" 1723589 1723601 1723844 1723849) (-1061 "RFDIST.spad" 1722585 1722594 1723579 1723584) (-1060 "RF.spad" 1720259 1720270 1722575 1722580) (-1059 "RETSOL.spad" 1719678 1719691 1720249 1720254) (-1058 "RETRACT.spad" 1719106 1719117 1719668 1719673) (-1057 "RETRACT.spad" 1718532 1718545 1719096 1719101) (-1056 "RETAST.spad" 1718344 1718353 1718522 1718527) (-1055 "RESULT.spad" 1715906 1715915 1716493 1716520) (-1054 "RESRING.spad" 1715253 1715300 1715844 1715901) (-1053 "RESLATC.spad" 1714577 1714588 1715243 1715248) (-1052 "REPSQ.spad" 1714308 1714319 1714567 1714572) (-1051 "REPDB.spad" 1714015 1714026 1714298 1714303) (-1050 "REP2.spad" 1703729 1703740 1713857 1713862) (-1049 "REP1.spad" 1697949 1697960 1703679 1703684) (-1048 "REP.spad" 1695503 1695512 1697939 1697944) (-1047 "REGSET.spad" 1693295 1693312 1695104 1695131) (-1046 "REF.spad" 1692630 1692641 1693250 1693255) (-1045 "REDORDER.spad" 1691836 1691853 1692620 1692625) (-1044 "RECLOS.spad" 1690595 1690615 1691299 1691392) (-1043 "REALSOLV.spad" 1689735 1689744 1690585 1690590) (-1042 "REAL0Q.spad" 1687033 1687048 1689725 1689730) (-1041 "REAL0.spad" 1683877 1683892 1687023 1687028) (-1040 "REAL.spad" 1683749 1683758 1683867 1683872) (-1039 "RDUCEAST.spad" 1683470 1683479 1683739 1683744) (-1038 "RDIV.spad" 1683125 1683150 1683460 1683465) (-1037 "RDIST.spad" 1682692 1682703 1683115 1683120) (-1036 "RDETRS.spad" 1681556 1681574 1682682 1682687) (-1035 "RDETR.spad" 1679695 1679713 1681546 1681551) (-1034 "RDEEFS.spad" 1678794 1678811 1679685 1679690) (-1033 "RDEEF.spad" 1677804 1677821 1678784 1678789) (-1032 "RCFIELD.spad" 1675022 1675031 1677706 1677799) (-1031 "RCFIELD.spad" 1672326 1672337 1675012 1675017) (-1030 "RCAGG.spad" 1670262 1670273 1672316 1672321) (-1029 "RCAGG.spad" 1668125 1668138 1670181 1670186) (-1028 "RATRET.spad" 1667485 1667496 1668115 1668120) (-1027 "RATFACT.spad" 1667177 1667189 1667475 1667480) (-1026 "RANDSRC.spad" 1666496 1666505 1667167 1667172) (-1025 "RADUTIL.spad" 1666252 1666261 1666486 1666491) (-1024 "RADIX.spad" 1663031 1663045 1664577 1664670) (-1023 "RADFF.spad" 1660734 1660771 1660853 1661009) (-1022 "RADCAT.spad" 1660329 1660338 1660724 1660729) (-1021 "RADCAT.spad" 1659922 1659933 1660319 1660324) (-1020 "QUEUE.spad" 1659141 1659152 1659400 1659427) (-1019 "QUATCT2.spad" 1658761 1658780 1659131 1659136) (-1018 "QUATCAT.spad" 1656931 1656942 1658691 1658756) (-1017 "QUATCAT.spad" 1654849 1654862 1656611 1656616) (-1016 "QUAT.spad" 1653301 1653312 1653644 1653709) (-1015 "QUAGG.spad" 1652134 1652145 1653269 1653296) (-1014 "QQUTAST.spad" 1651902 1651911 1652124 1652129) (-1013 "QFORM.spad" 1651520 1651535 1651892 1651897) (-1012 "QFCAT2.spad" 1651212 1651229 1651510 1651515) (-1011 "QFCAT.spad" 1649914 1649925 1651114 1651207) (-1010 "QFCAT.spad" 1648198 1648211 1649400 1649405) (-1009 "QEQUAT.spad" 1647756 1647765 1648188 1648193) (-1008 "QCMPACK.spad" 1642670 1642690 1647746 1647751) (-1007 "QALGSET2.spad" 1640665 1640684 1642660 1642665) (-1006 "QALGSET.spad" 1636769 1636802 1640579 1640584) (-1005 "PWFFINTB.spad" 1634184 1634206 1636759 1636764) (-1004 "PUSHVAR.spad" 1633522 1633542 1634174 1634179) (-1003 "PTRANFN.spad" 1629657 1629668 1633512 1633517) (-1002 "PTPACK.spad" 1626744 1626755 1629647 1629652) (-1001 "PTFUNC2.spad" 1626566 1626581 1626734 1626739) (-1000 "PTCAT.spad" 1625820 1625831 1626534 1626561) (-999 "PSQFR.spad" 1625135 1625159 1625810 1625815) (-998 "PSEUDLIN.spad" 1624021 1624031 1625125 1625130) (-997 "PSETPK.spad" 1610726 1610742 1623899 1623904) (-996 "PSETCAT.spad" 1605126 1605149 1610706 1610721) (-995 "PSETCAT.spad" 1599500 1599525 1605082 1605087) (-994 "PSCURVE.spad" 1598499 1598507 1599490 1599495) (-993 "PSCAT.spad" 1597282 1597311 1598397 1598494) (-992 "PSCAT.spad" 1596155 1596186 1597272 1597277) (-991 "PRTITION.spad" 1594853 1594861 1596145 1596150) (-990 "PRTDAST.spad" 1594572 1594580 1594843 1594848) (-989 "PRS.spad" 1584190 1584207 1594528 1594533) (-988 "PRQAGG.spad" 1583625 1583635 1584158 1584185) (-987 "PROPLOG.spad" 1583229 1583237 1583615 1583620) (-986 "PROPFUN2.spad" 1582852 1582865 1583219 1583224) (-985 "PROPFUN1.spad" 1582258 1582269 1582842 1582847) (-984 "PROPFRML.spad" 1580826 1580837 1582248 1582253) (-983 "PROPERTY.spad" 1580322 1580330 1580816 1580821) (-982 "PRODUCT.spad" 1578004 1578016 1578288 1578343) (-981 "PRINT.spad" 1577756 1577764 1577994 1577999) (-980 "PRIMES.spad" 1576017 1576027 1577746 1577751) (-979 "PRIMELT.spad" 1574138 1574152 1576007 1576012) (-978 "PRIMCAT.spad" 1573781 1573789 1574128 1574133) (-977 "PRIMARR2.spad" 1572548 1572560 1573771 1573776) (-976 "PRIMARR.spad" 1571387 1571397 1571557 1571584) (-975 "PREASSOC.spad" 1570769 1570781 1571377 1571382) (-974 "PR.spad" 1569134 1569146 1569833 1569960) (-973 "PPCURVE.spad" 1568271 1568279 1569124 1569129) (-972 "PORTNUM.spad" 1568062 1568070 1568261 1568266) (-971 "POLYROOT.spad" 1566911 1566933 1568018 1568023) (-970 "POLYLIFT.spad" 1566176 1566199 1566901 1566906) (-969 "POLYCATQ.spad" 1564302 1564324 1566166 1566171) (-968 "POLYCAT.spad" 1557804 1557825 1564170 1564297) (-967 "POLYCAT.spad" 1550602 1550625 1556970 1556975) (-966 "POLY2UP.spad" 1550054 1550068 1550592 1550597) (-965 "POLY2.spad" 1549651 1549663 1550044 1550049) (-964 "POLY.spad" 1546914 1546924 1547429 1547556) (-963 "POLUTIL.spad" 1545879 1545908 1546870 1546875) (-962 "POLTOPOL.spad" 1544627 1544642 1545869 1545874) (-961 "POINT.spad" 1543291 1543301 1543378 1543405) (-960 "PNTHEORY.spad" 1539993 1540001 1543281 1543286) (-959 "PMTOOLS.spad" 1538768 1538782 1539983 1539988) (-958 "PMSYM.spad" 1538317 1538327 1538758 1538763) (-957 "PMQFCAT.spad" 1537908 1537922 1538307 1538312) (-956 "PMPREDFS.spad" 1537370 1537392 1537898 1537903) (-955 "PMPRED.spad" 1536857 1536871 1537360 1537365) (-954 "PMPLCAT.spad" 1535934 1535952 1536786 1536791) (-953 "PMLSAGG.spad" 1535519 1535533 1535924 1535929) (-952 "PMKERNEL.spad" 1535098 1535110 1535509 1535514) (-951 "PMINS.spad" 1534678 1534688 1535088 1535093) (-950 "PMFS.spad" 1534255 1534273 1534668 1534673) (-949 "PMDOWN.spad" 1533545 1533559 1534245 1534250) (-948 "PMASSFS.spad" 1532520 1532536 1533535 1533540) (-947 "PMASS.spad" 1531538 1531546 1532510 1532515) (-946 "PLOTTOOL.spad" 1531318 1531326 1531528 1531533) (-945 "PLOT3D.spad" 1527782 1527790 1531308 1531313) (-944 "PLOT1.spad" 1526955 1526965 1527772 1527777) (-943 "PLOT.spad" 1521878 1521886 1526945 1526950) (-942 "PLEQN.spad" 1509280 1509307 1521868 1521873) (-941 "PINTERPA.spad" 1509064 1509080 1509270 1509275) (-940 "PINTERP.spad" 1508686 1508705 1509054 1509059) (-939 "PID.spad" 1507660 1507668 1508612 1508681) (-938 "PICOERCE.spad" 1507317 1507327 1507650 1507655) (-937 "PI.spad" 1506934 1506942 1507291 1507312) (-936 "PGROEB.spad" 1505543 1505557 1506924 1506929) (-935 "PGE.spad" 1497216 1497224 1505533 1505538) (-934 "PGCD.spad" 1496170 1496187 1497206 1497211) (-933 "PFRPAC.spad" 1495319 1495329 1496160 1496165) (-932 "PFR.spad" 1492022 1492032 1495221 1495314) (-931 "PFOTOOLS.spad" 1491280 1491296 1492012 1492017) (-930 "PFOQ.spad" 1490650 1490668 1491270 1491275) (-929 "PFO.spad" 1490069 1490096 1490640 1490645) (-928 "PFECAT.spad" 1487779 1487787 1489995 1490064) (-927 "PFECAT.spad" 1485517 1485527 1487735 1487740) (-926 "PFBRU.spad" 1483405 1483417 1485507 1485512) (-925 "PFBR.spad" 1480965 1480988 1483395 1483400) (-924 "PF.spad" 1480539 1480551 1480770 1480863) (-923 "PERMGRP.spad" 1475309 1475319 1480529 1480534) (-922 "PERMCAT.spad" 1473970 1473980 1475289 1475304) (-921 "PERMAN.spad" 1472526 1472540 1473960 1473965) (-920 "PERM.spad" 1468333 1468343 1472356 1472371) (-919 "PENDTREE.spad" 1467553 1467563 1467833 1467838) (-918 "PDSPC.spad" 1466366 1466376 1467543 1467548) (-917 "PDSPC.spad" 1465177 1465189 1466356 1466361) (-916 "PDRING.spad" 1465019 1465029 1465157 1465172) (-915 "PDMOD.spad" 1464835 1464847 1464987 1465014) (-914 "PDEPROB.spad" 1463850 1463858 1464825 1464830) (-913 "PDEPACK.spad" 1457986 1457994 1463840 1463845) (-912 "PDECOMP.spad" 1457456 1457473 1457976 1457981) (-911 "PDECAT.spad" 1455812 1455820 1457446 1457451) (-910 "PDDOM.spad" 1455250 1455263 1455802 1455807) (-909 "PDDOM.spad" 1454686 1454701 1455240 1455245) (-908 "PCOMP.spad" 1454539 1454552 1454676 1454681) (-907 "PBWLB.spad" 1453135 1453152 1454529 1454534) (-906 "PATTERN2.spad" 1452873 1452885 1453125 1453130) (-905 "PATTERN1.spad" 1451217 1451233 1452863 1452868) (-904 "PATTERN.spad" 1445788 1445798 1451207 1451212) (-903 "PATRES2.spad" 1445460 1445474 1445778 1445783) (-902 "PATRES.spad" 1443043 1443055 1445450 1445455) (-901 "PATMATCH.spad" 1441231 1441262 1442742 1442747) (-900 "PATMAB.spad" 1440660 1440670 1441221 1441226) (-899 "PATLRES.spad" 1439746 1439760 1440650 1440655) (-898 "PATAB.spad" 1439510 1439520 1439736 1439741) (-897 "PARTPERM.spad" 1437566 1437574 1439500 1439505) (-896 "PARSURF.spad" 1437000 1437028 1437556 1437561) (-895 "PARSU2.spad" 1436797 1436813 1436990 1436995) (-894 "script-parser.spad" 1436317 1436325 1436787 1436792) (-893 "PARSCURV.spad" 1435751 1435779 1436307 1436312) (-892 "PARSC2.spad" 1435542 1435558 1435741 1435746) (-891 "PARPCURV.spad" 1435004 1435032 1435532 1435537) (-890 "PARPC2.spad" 1434795 1434811 1434994 1434999) (-889 "PARAMAST.spad" 1433923 1433931 1434785 1434790) (-888 "PAN2EXPR.spad" 1433335 1433343 1433913 1433918) (-887 "PALETTE.spad" 1432321 1432329 1433325 1433330) (-886 "PAIR.spad" 1431328 1431341 1431897 1431902) (-885 "PADICRC.spad" 1428532 1428550 1429695 1429788) (-884 "PADICRAT.spad" 1426391 1426403 1426604 1426697) (-883 "PADICCT.spad" 1424940 1424952 1426317 1426386) (-882 "PADIC.spad" 1424643 1424655 1424866 1424935) (-881 "PADEPAC.spad" 1423332 1423351 1424633 1424638) (-880 "PADE.spad" 1422084 1422100 1423322 1423327) (-879 "OWP.spad" 1421332 1421362 1421942 1422009) (-878 "OVERSET.spad" 1420905 1420913 1421322 1421327) (-877 "OVAR.spad" 1420686 1420709 1420895 1420900) (-876 "OUTFORM.spad" 1410094 1410102 1420676 1420681) (-875 "OUTBFILE.spad" 1409528 1409536 1410084 1410089) (-874 "OUTBCON.spad" 1408598 1408606 1409518 1409523) (-873 "OUTBCON.spad" 1407666 1407676 1408588 1408593) (-872 "OUT.spad" 1406784 1406792 1407656 1407661) (-871 "OSI.spad" 1406259 1406267 1406774 1406779) (-870 "OSGROUP.spad" 1406177 1406185 1406249 1406254) (-869 "ORTHPOL.spad" 1404656 1404666 1406088 1406093) (-868 "OREUP.spad" 1404100 1404128 1404327 1404366) (-867 "ORESUP.spad" 1403392 1403416 1403771 1403810) (-866 "OREPCTO.spad" 1401281 1401293 1403312 1403317) (-865 "OREPCAT.spad" 1395468 1395478 1401237 1401276) (-864 "OREPCAT.spad" 1389545 1389557 1395316 1395321) (-863 "ORDTYPE.spad" 1388782 1388790 1389535 1389540) (-862 "ORDTYPE.spad" 1388017 1388027 1388772 1388777) (-861 "ORDSTRCT.spad" 1387787 1387802 1387950 1387955) (-860 "ORDSET.spad" 1387487 1387495 1387777 1387782) (-859 "ORDRING.spad" 1387304 1387312 1387467 1387482) (-858 "ORDMON.spad" 1387159 1387167 1387294 1387299) (-857 "ORDFUNS.spad" 1386291 1386307 1387149 1387154) (-856 "ORDFIN.spad" 1386111 1386119 1386281 1386286) (-855 "ORDCOMP2.spad" 1385404 1385416 1386101 1386106) (-854 "ORDCOMP.spad" 1383857 1383867 1384939 1384968) (-853 "OPTPROB.spad" 1382495 1382503 1383847 1383852) (-852 "OPTPACK.spad" 1374904 1374912 1382485 1382490) (-851 "OPTCAT.spad" 1372583 1372591 1374894 1374899) (-850 "OPSIG.spad" 1372245 1372253 1372573 1372578) (-849 "OPQUERY.spad" 1371826 1371834 1372235 1372240) (-848 "OPERCAT.spad" 1371292 1371302 1371816 1371821) (-847 "OPERCAT.spad" 1370756 1370768 1371282 1371287) (-846 "OP.spad" 1370498 1370508 1370578 1370645) (-845 "ONECOMP2.spad" 1369922 1369934 1370488 1370493) (-844 "ONECOMP.spad" 1368655 1368665 1369457 1369486) (-843 "OMSAGG.spad" 1368443 1368453 1368611 1368650) (-842 "OMLO.spad" 1367876 1367888 1368329 1368368) (-841 "OINTDOM.spad" 1367639 1367647 1367802 1367871) (-840 "OFMONOID.spad" 1365778 1365788 1367595 1367600) (-839 "ODVAR.spad" 1365039 1365049 1365768 1365773) (-838 "ODR.spad" 1364683 1364709 1364851 1365000) (-837 "ODPOL.spad" 1361894 1361904 1362234 1362361) (-836 "ODP.spad" 1349393 1349413 1349766 1349865) (-835 "ODETOOLS.spad" 1348042 1348061 1349383 1349388) (-834 "ODESYS.spad" 1345736 1345753 1348032 1348037) (-833 "ODERTRIC.spad" 1341769 1341786 1345693 1345698) (-832 "ODERED.spad" 1341168 1341192 1341759 1341764) (-831 "ODERAT.spad" 1338801 1338818 1341158 1341163) (-830 "ODEPRRIC.spad" 1335894 1335916 1338791 1338796) (-829 "ODEPROB.spad" 1335151 1335159 1335884 1335889) (-828 "ODEPRIM.spad" 1332549 1332571 1335141 1335146) (-827 "ODEPAL.spad" 1331935 1331959 1332539 1332544) (-826 "ODEPACK.spad" 1318665 1318673 1331925 1331930) (-825 "ODEINT.spad" 1318100 1318116 1318655 1318660) (-824 "ODEIFTBL.spad" 1315503 1315511 1318090 1318095) (-823 "ODEEF.spad" 1310998 1311014 1315493 1315498) (-822 "ODECONST.spad" 1310543 1310561 1310988 1310993) (-821 "ODECAT.spad" 1309141 1309149 1310533 1310538) (-820 "OCTCT2.spad" 1308779 1308800 1309131 1309136) (-819 "OCT.spad" 1306867 1306877 1307581 1307620) (-818 "OCAMON.spad" 1306715 1306723 1306857 1306862) (-817 "OC.spad" 1304511 1304521 1306671 1306710) (-816 "OC.spad" 1302029 1302041 1304191 1304196) (-815 "OASGP.spad" 1301844 1301852 1302019 1302024) (-814 "OAMONS.spad" 1301366 1301374 1301834 1301839) (-813 "OAMON.spad" 1301124 1301132 1301356 1301361) (-812 "OAMON.spad" 1300880 1300890 1301114 1301119) (-811 "OAGROUP.spad" 1300418 1300426 1300870 1300875) (-810 "OAGROUP.spad" 1299954 1299964 1300408 1300413) (-809 "NUMTUBE.spad" 1299545 1299561 1299944 1299949) (-808 "NUMQUAD.spad" 1287521 1287529 1299535 1299540) (-807 "NUMODE.spad" 1278873 1278881 1287511 1287516) (-806 "NUMINT.spad" 1276439 1276447 1278863 1278868) (-805 "NUMFMT.spad" 1275279 1275287 1276429 1276434) (-804 "NUMERIC.spad" 1267393 1267403 1275084 1275089) (-803 "NTSCAT.spad" 1265901 1265917 1267361 1267388) (-802 "NTPOLFN.spad" 1265446 1265456 1265812 1265817) (-801 "NSUP2.spad" 1264838 1264850 1265436 1265441) (-800 "NSUP.spad" 1257833 1257843 1262253 1262406) (-799 "NSMP.spad" 1253932 1253951 1254224 1254351) (-798 "NREP.spad" 1252334 1252348 1253922 1253927) (-797 "NPCOEF.spad" 1251580 1251600 1252324 1252329) (-796 "NORMRETR.spad" 1251178 1251217 1251570 1251575) (-795 "NORMPK.spad" 1249120 1249139 1251168 1251173) (-794 "NORMMA.spad" 1248808 1248834 1249110 1249115) (-793 "NONE1.spad" 1248484 1248494 1248798 1248803) (-792 "NONE.spad" 1248225 1248233 1248474 1248479) (-791 "NODE1.spad" 1247712 1247728 1248215 1248220) (-790 "NNI.spad" 1246607 1246615 1247686 1247707) (-789 "NLINSOL.spad" 1245233 1245243 1246597 1246602) (-788 "NIPROB.spad" 1243774 1243782 1245223 1245228) (-787 "NFINTBAS.spad" 1241334 1241351 1243764 1243769) (-786 "NETCLT.spad" 1241308 1241319 1241324 1241329) (-785 "NCODIV.spad" 1239532 1239548 1241298 1241303) (-784 "NCNTFRAC.spad" 1239174 1239188 1239522 1239527) (-783 "NCEP.spad" 1237340 1237354 1239164 1239169) (-782 "NASRING.spad" 1236944 1236952 1237330 1237335) (-781 "NASRING.spad" 1236546 1236556 1236934 1236939) (-780 "NARNG.spad" 1235946 1235954 1236536 1236541) (-779 "NARNG.spad" 1235344 1235354 1235936 1235941) (-778 "NAGSP.spad" 1234421 1234429 1235334 1235339) (-777 "NAGS.spad" 1224138 1224146 1234411 1234416) (-776 "NAGF07.spad" 1222569 1222577 1224128 1224133) (-775 "NAGF04.spad" 1216971 1216979 1222559 1222564) (-774 "NAGF02.spad" 1211064 1211072 1216961 1216966) (-773 "NAGF01.spad" 1206833 1206841 1211054 1211059) (-772 "NAGE04.spad" 1200541 1200549 1206823 1206828) (-771 "NAGE02.spad" 1191193 1191201 1200531 1200536) (-770 "NAGE01.spad" 1187187 1187195 1191183 1191188) (-769 "NAGD03.spad" 1185183 1185191 1187177 1187182) (-768 "NAGD02.spad" 1177914 1177922 1185173 1185178) (-767 "NAGD01.spad" 1172199 1172207 1177904 1177909) (-766 "NAGC06.spad" 1168066 1168074 1172189 1172194) (-765 "NAGC05.spad" 1166559 1166567 1168056 1168061) (-764 "NAGC02.spad" 1165834 1165842 1166549 1166554) (-763 "NAALG.spad" 1165399 1165409 1165802 1165829) (-762 "NAALG.spad" 1164984 1164996 1165389 1165394) (-761 "MULTSQFR.spad" 1161942 1161959 1164974 1164979) (-760 "MULTFACT.spad" 1161325 1161342 1161932 1161937) (-759 "MTSCAT.spad" 1159419 1159440 1161223 1161320) (-758 "MTHING.spad" 1159078 1159088 1159409 1159414) (-757 "MSYSCMD.spad" 1158512 1158520 1159068 1159073) (-756 "MSETAGG.spad" 1158357 1158367 1158480 1158507) (-755 "MSET.spad" 1156270 1156280 1158018 1158057) (-754 "MRING.spad" 1153247 1153259 1155978 1156045) (-753 "MRF2.spad" 1152809 1152823 1153237 1153242) (-752 "MRATFAC.spad" 1152355 1152372 1152799 1152804) (-751 "MPRFF.spad" 1150395 1150414 1152345 1152350) (-750 "MPOLY.spad" 1147794 1147809 1148153 1148280) (-749 "MPCPF.spad" 1147058 1147077 1147784 1147789) (-748 "MPC3.spad" 1146875 1146915 1147048 1147053) (-747 "MPC2.spad" 1146528 1146561 1146865 1146870) (-746 "MONOTOOL.spad" 1144879 1144896 1146518 1146523) (-745 "MONOID.spad" 1144198 1144206 1144869 1144874) (-744 "MONOID.spad" 1143515 1143525 1144188 1144193) (-743 "MONOGEN.spad" 1142263 1142276 1143375 1143510) (-742 "MONOGEN.spad" 1141033 1141048 1142147 1142152) (-741 "MONADWU.spad" 1139111 1139119 1141023 1141028) (-740 "MONADWU.spad" 1137187 1137197 1139101 1139106) (-739 "MONAD.spad" 1136347 1136355 1137177 1137182) (-738 "MONAD.spad" 1135505 1135515 1136337 1136342) (-737 "MOEBIUS.spad" 1134241 1134255 1135485 1135500) (-736 "MODULE.spad" 1134111 1134121 1134209 1134236) (-735 "MODULE.spad" 1134001 1134013 1134101 1134106) (-734 "MODRING.spad" 1133336 1133375 1133981 1133996) (-733 "MODOP.spad" 1131993 1132005 1133158 1133225) (-732 "MODMONOM.spad" 1131724 1131742 1131983 1131988) (-731 "MODMON.spad" 1128348 1128364 1129067 1129220) (-730 "MODFIELD.spad" 1127710 1127749 1128250 1128343) (-729 "MMLFORM.spad" 1126570 1126578 1127700 1127705) (-728 "MMAP.spad" 1126312 1126346 1126560 1126565) (-727 "MLO.spad" 1124771 1124781 1126268 1126307) (-726 "MLIFT.spad" 1123383 1123400 1124761 1124766) (-725 "MKUCFUNC.spad" 1122918 1122936 1123373 1123378) (-724 "MKRECORD.spad" 1122506 1122519 1122908 1122913) (-723 "MKFUNC.spad" 1121913 1121923 1122496 1122501) (-722 "MKFLCFN.spad" 1120881 1120891 1121903 1121908) (-721 "MKBCFUNC.spad" 1120376 1120394 1120871 1120876) (-720 "MINT.spad" 1119815 1119823 1120278 1120371) (-719 "MHROWRED.spad" 1118326 1118336 1119805 1119810) (-718 "MFLOAT.spad" 1116846 1116854 1118216 1118321) (-717 "MFINFACT.spad" 1116246 1116268 1116836 1116841) (-716 "MESH.spad" 1114041 1114049 1116236 1116241) (-715 "MDDFACT.spad" 1112260 1112270 1114031 1114036) (-714 "MDAGG.spad" 1111551 1111561 1112240 1112255) (-713 "MCMPLX.spad" 1106916 1106924 1107530 1107731) (-712 "MCDEN.spad" 1106126 1106138 1106906 1106911) (-711 "MCALCFN.spad" 1103224 1103250 1106116 1106121) (-710 "MAYBE.spad" 1102524 1102535 1103214 1103219) (-709 "MATSTOR.spad" 1099840 1099850 1102514 1102519) (-708 "MATRIX.spad" 1098406 1098416 1098890 1098917) (-707 "MATLIN.spad" 1095774 1095798 1098290 1098295) (-706 "MATCAT2.spad" 1095056 1095104 1095764 1095769) (-705 "MATCAT.spad" 1086618 1086640 1095024 1095051) (-704 "MATCAT.spad" 1078052 1078076 1086460 1086465) (-703 "MAPPKG3.spad" 1076967 1076981 1078042 1078047) (-702 "MAPPKG2.spad" 1076305 1076317 1076957 1076962) (-701 "MAPPKG1.spad" 1075133 1075143 1076295 1076300) (-700 "MAPPAST.spad" 1074472 1074480 1075123 1075128) (-699 "MAPHACK3.spad" 1074284 1074298 1074462 1074467) (-698 "MAPHACK2.spad" 1074053 1074065 1074274 1074279) (-697 "MAPHACK1.spad" 1073697 1073707 1074043 1074048) (-696 "MAGMA.spad" 1071503 1071520 1073687 1073692) (-695 "MACROAST.spad" 1071098 1071106 1071493 1071498) (-694 "M3D.spad" 1068683 1068693 1070341 1070346) (-693 "LZSTAGG.spad" 1065937 1065947 1068673 1068678) (-692 "LZSTAGG.spad" 1063189 1063201 1065927 1065932) (-691 "LWORD.spad" 1059934 1059951 1063179 1063184) (-690 "LSTAST.spad" 1059718 1059726 1059924 1059929) (-689 "LSQM.spad" 1057827 1057841 1058221 1058272) (-688 "LSPP.spad" 1057362 1057379 1057817 1057822) (-687 "LSMP1.spad" 1055205 1055219 1057352 1057357) (-686 "LSMP.spad" 1054062 1054090 1055195 1055200) (-685 "LSAGG.spad" 1053731 1053741 1054030 1054057) (-684 "LSAGG.spad" 1053420 1053432 1053721 1053726) (-683 "LPOLY.spad" 1052382 1052401 1053276 1053345) (-682 "LPEFRAC.spad" 1051653 1051663 1052372 1052377) (-681 "LOGIC.spad" 1051255 1051263 1051643 1051648) (-680 "LOGIC.spad" 1050855 1050865 1051245 1051250) (-679 "LODOOPS.spad" 1049785 1049797 1050845 1050850) (-678 "LODOF.spad" 1048831 1048848 1049742 1049747) (-677 "LODOCAT.spad" 1047497 1047507 1048787 1048826) (-676 "LODOCAT.spad" 1046161 1046173 1047453 1047458) (-675 "LODO2.spad" 1045425 1045437 1045832 1045871) (-674 "LODO1.spad" 1044816 1044826 1045096 1045135) (-673 "LODO.spad" 1044191 1044207 1044487 1044526) (-672 "LODEEF.spad" 1042993 1043011 1044181 1044186) (-671 "LO.spad" 1042394 1042408 1042927 1042954) (-670 "LNAGG.spad" 1038581 1038591 1042384 1042389) (-669 "LNAGG.spad" 1034732 1034744 1038537 1038542) (-668 "LMOPS.spad" 1031500 1031517 1034722 1034727) (-667 "LMODULE.spad" 1031284 1031294 1031490 1031495) (-666 "LMDICT.spad" 1030455 1030465 1030703 1030730) (-665 "LLINSET.spad" 1030162 1030172 1030445 1030450) (-664 "LITERAL.spad" 1030068 1030079 1030152 1030157) (-663 "LIST3.spad" 1029379 1029393 1030058 1030063) (-662 "LIST2MAP.spad" 1026306 1026318 1029369 1029374) (-661 "LIST2.spad" 1025008 1025020 1026296 1026301) (-660 "LIST.spad" 1022605 1022615 1024017 1024044) (-659 "LINSET.spad" 1022384 1022394 1022595 1022600) (-658 "LINFORM.spad" 1021847 1021859 1022352 1022379) (-657 "LINEXP.spad" 1020590 1020600 1021837 1021842) (-656 "LINELT.spad" 1019961 1019973 1020473 1020500) (-655 "LINDEP.spad" 1018810 1018822 1019873 1019878) (-654 "LINBASIS.spad" 1018446 1018461 1018800 1018805) (-653 "LIMITRF.spad" 1016393 1016403 1018436 1018441) (-652 "LIMITPS.spad" 1015303 1015316 1016383 1016388) (-651 "LIECAT.spad" 1014787 1014797 1015229 1015298) (-650 "LIECAT.spad" 1014299 1014311 1014743 1014748) (-649 "LIE.spad" 1012294 1012306 1013568 1013713) (-648 "LIB.spad" 1010009 1010017 1010455 1010470) (-647 "LGROBP.spad" 1007362 1007381 1009999 1010004) (-646 "LFCAT.spad" 1006421 1006429 1007352 1007357) (-645 "LF.spad" 1005376 1005392 1006411 1006416) (-644 "LEXTRIPK.spad" 1000999 1001014 1005366 1005371) (-643 "LEXP.spad" 999018 999045 1000979 1000994) (-642 "LETAST.spad" 998717 998725 999008 999013) (-641 "LEADCDET.spad" 997123 997140 998707 998712) (-640 "LAZM3PK.spad" 995867 995889 997113 997118) (-639 "LAUPOL.spad" 994452 994465 995352 995421) (-638 "LAPLACE.spad" 994035 994051 994442 994447) (-637 "LALG.spad" 993811 993821 994015 994030) (-636 "LALG.spad" 993595 993607 993801 993806) (-635 "LA.spad" 993035 993049 993517 993556) (-634 "KVTFROM.spad" 992778 992788 993025 993030) (-633 "KTVLOGIC.spad" 992322 992330 992768 992773) (-632 "KRCFROM.spad" 992068 992078 992312 992317) (-631 "KOVACIC.spad" 990799 990816 992058 992063) (-630 "KONVERT.spad" 990521 990531 990789 990794) (-629 "KOERCE.spad" 990258 990268 990511 990516) (-628 "KERNEL2.spad" 989961 989973 990248 990253) (-627 "KERNEL.spad" 988601 988611 989730 989735) (-626 "KDAGG.spad" 987710 987732 988581 988596) (-625 "KDAGG.spad" 986827 986851 987700 987705) (-624 "KAFILE.spad" 985657 985673 985892 985919) (-623 "JVMOP.spad" 985570 985578 985647 985652) (-622 "JVMMDACC.spad" 984624 984632 985560 985565) (-621 "JVMFDACC.spad" 983940 983948 984614 984619) (-620 "JVMCSTTG.spad" 982669 982677 983930 983935) (-619 "JVMCFACC.spad" 982115 982123 982659 982664) (-618 "JVMBCODE.spad" 982026 982034 982105 982110) (-617 "JORDAN.spad" 979834 979846 981295 981440) (-616 "JOINAST.spad" 979536 979544 979824 979829) (-615 "IXAGG.spad" 977669 977693 979526 979531) (-614 "IXAGG.spad" 975657 975683 977516 977521) (-613 "IVECTOR.spad" 974253 974268 974408 974435) (-612 "ITUPLE.spad" 973429 973439 974243 974248) (-611 "ITRIGMNP.spad" 972276 972295 973419 973424) (-610 "ITFUN3.spad" 971782 971796 972266 972271) (-609 "ITFUN2.spad" 971526 971538 971772 971777) (-608 "ITFORM.spad" 970881 970889 971516 971521) (-607 "ITAYLOR.spad" 968875 968890 970745 970842) (-606 "ISUPS.spad" 961273 961288 967810 967907) (-605 "ISUMP.spad" 960774 960790 961263 961268) (-604 "ISAST.spad" 960493 960501 960764 960769) (-603 "IRURPK.spad" 959210 959229 960483 960488) (-602 "IRSN.spad" 957214 957222 959200 959205) (-601 "IRRF2F.spad" 955707 955717 957170 957175) (-600 "IRREDFFX.spad" 955308 955319 955697 955702) (-599 "IROOT.spad" 953647 953657 955298 955303) (-598 "IRFORM.spad" 952971 952979 953637 953642) (-597 "IR2F.spad" 952185 952201 952961 952966) (-596 "IR2.spad" 951213 951229 952175 952180) (-595 "IR.spad" 949016 949030 951062 951089) (-594 "IPRNTPK.spad" 948776 948784 949006 949011) (-593 "IPF.spad" 948341 948353 948581 948674) (-592 "IPADIC.spad" 948110 948136 948267 948336) (-591 "IP4ADDR.spad" 947667 947675 948100 948105) (-590 "IOMODE.spad" 947189 947197 947657 947662) (-589 "IOBFILE.spad" 946574 946582 947179 947184) (-588 "IOBCON.spad" 946439 946447 946564 946569) (-587 "INVLAPLA.spad" 946088 946104 946429 946434) (-586 "INTTR.spad" 939482 939499 946078 946083) (-585 "INTTOOLS.spad" 937225 937241 939044 939049) (-584 "INTSLPE.spad" 936553 936561 937215 937220) (-583 "INTRVL.spad" 936119 936129 936467 936548) (-582 "INTRF.spad" 934551 934565 936109 936114) (-581 "INTRET.spad" 933983 933993 934541 934546) (-580 "INTRAT.spad" 932718 932735 933973 933978) (-579 "INTPM.spad" 931085 931101 932343 932348) (-578 "INTPAF.spad" 928961 928979 931014 931019) (-577 "INTPACK.spad" 919527 919535 928951 928956) (-576 "INTHERTR.spad" 918801 918818 919517 919522) (-575 "INTHERAL.spad" 918471 918495 918791 918796) (-574 "INTHEORY.spad" 914910 914918 918461 918466) (-573 "INTG0.spad" 908674 908692 914839 914844) (-572 "INTFTBL.spad" 904128 904136 908664 908669) (-571 "INTFACT.spad" 903195 903205 904118 904123) (-570 "INTEF.spad" 901606 901622 903185 903190) (-569 "INTDOM.spad" 900229 900237 901532 901601) (-568 "INTDOM.spad" 898914 898924 900219 900224) (-567 "INTCAT.spad" 897181 897191 898828 898909) (-566 "INTBIT.spad" 896688 896696 897171 897176) (-565 "INTALG.spad" 895876 895903 896678 896683) (-564 "INTAF.spad" 895376 895392 895866 895871) (-563 "INTABL.spad" 893416 893447 893579 893606) (-562 "INT8.spad" 893296 893304 893406 893411) (-561 "INT64.spad" 893175 893183 893286 893291) (-560 "INT32.spad" 893054 893062 893165 893170) (-559 "INT16.spad" 892933 892941 893044 893049) (-558 "INT.spad" 892459 892467 892799 892928) (-557 "INS.spad" 889962 889970 892361 892454) (-556 "INS.spad" 887551 887561 889952 889957) (-555 "INPSIGN.spad" 887021 887034 887541 887546) (-554 "INPRODPF.spad" 886117 886136 887011 887016) (-553 "INPRODFF.spad" 885205 885229 886107 886112) (-552 "INNMFACT.spad" 884180 884197 885195 885200) (-551 "INMODGCD.spad" 883684 883714 884170 884175) (-550 "INFSP.spad" 881981 882003 883674 883679) (-549 "INFPROD0.spad" 881061 881080 881971 881976) (-548 "INFORM1.spad" 880686 880696 881051 881056) (-547 "INFORM.spad" 877893 877901 880676 880681) (-546 "INFINITY.spad" 877445 877453 877883 877888) (-545 "INETCLTS.spad" 877422 877430 877435 877440) (-544 "INEP.spad" 875968 875990 877412 877417) (-543 "INDE.spad" 875617 875634 875878 875883) (-542 "INCRMAPS.spad" 875054 875064 875607 875612) (-541 "INBFILE.spad" 874150 874158 875044 875049) (-540 "INBFF.spad" 870000 870011 874140 874145) (-539 "INBCON.spad" 868266 868274 869990 869995) (-538 "INBCON.spad" 866530 866540 868256 868261) (-537 "INAST.spad" 866191 866199 866520 866525) (-536 "IMPTAST.spad" 865899 865907 866181 866186) (-535 "IMATRIX.spad" 864715 864741 865227 865254) (-534 "IMATQF.spad" 863809 863853 864671 864676) (-533 "IMATLIN.spad" 862430 862454 863765 863770) (-532 "ILIST.spad" 860914 860929 861439 861466) (-531 "IIARRAY2.spad" 860189 860227 860392 860419) (-530 "IFF.spad" 859599 859615 859870 859963) (-529 "IFAST.spad" 859213 859221 859589 859594) (-528 "IFARRAY.spad" 856524 856539 858222 858249) (-527 "IFAMON.spad" 856386 856403 856480 856485) (-526 "IEVALAB.spad" 855799 855811 856376 856381) (-525 "IEVALAB.spad" 855210 855224 855789 855794) (-524 "IDPOAMS.spad" 854888 854900 855122 855127) (-523 "IDPOAM.spad" 854530 854542 854800 854805) (-522 "IDPO.spad" 854265 854277 854442 854447) (-521 "IDPC.spad" 852994 853006 854255 854260) (-520 "IDPAM.spad" 852661 852673 852906 852911) (-519 "IDPAG.spad" 852330 852342 852573 852578) (-518 "IDENT.spad" 851982 851990 852320 852325) (-517 "IDECOMP.spad" 849221 849239 851972 851977) (-516 "IDEAL.spad" 844167 844206 849153 849158) (-515 "ICDEN.spad" 843380 843396 844157 844162) (-514 "ICARD.spad" 842571 842579 843370 843375) (-513 "IBPTOOLS.spad" 841178 841195 842561 842566) (-512 "IBITS.spad" 840334 840347 840767 840794) (-511 "IBATOOL.spad" 837319 837338 840324 840329) (-510 "IBACHIN.spad" 835826 835841 837309 837314) (-509 "IARRAY2.spad" 834693 834719 835304 835331) (-508 "IARRAY1.spad" 833556 833571 833702 833729) (-507 "IAN.spad" 831776 831784 833369 833462) (-506 "IALGFACT.spad" 831387 831420 831766 831771) (-505 "HYPCAT.spad" 830811 830819 831377 831382) (-504 "HYPCAT.spad" 830233 830243 830801 830806) (-503 "HOSTNAME.spad" 830049 830057 830223 830228) (-502 "HOMOTOP.spad" 829792 829802 830039 830044) (-501 "HOAGG.spad" 827074 827084 829782 829787) (-500 "HOAGG.spad" 824089 824101 826799 826804) (-499 "HEXADEC.spad" 822049 822057 822414 822507) (-498 "HEUGCD.spad" 821140 821151 822039 822044) (-497 "HELLFDIV.spad" 820746 820770 821130 821135) (-496 "HEAP.spad" 820009 820019 820224 820251) (-495 "HEADAST.spad" 819550 819558 819999 820004) (-494 "HDP.spad" 807045 807061 807422 807521) (-493 "HDMP.spad" 804187 804202 804803 804930) (-492 "HB.spad" 802462 802470 804177 804182) (-491 "HASHTBL.spad" 800454 800485 800665 800692) (-490 "HASAST.spad" 800170 800178 800444 800449) (-489 "HACKPI.spad" 799661 799669 800072 800165) (-488 "GTSET.spad" 798555 798571 799262 799289) (-487 "GSTBL.spad" 796596 796631 796770 796785) (-486 "GSERIES.spad" 793828 793855 794647 794796) (-485 "GROUP.spad" 793101 793109 793808 793823) (-484 "GROUP.spad" 792382 792392 793091 793096) (-483 "GROEBSOL.spad" 790876 790897 792372 792377) (-482 "GRMOD.spad" 789455 789467 790866 790871) (-481 "GRMOD.spad" 788032 788046 789445 789450) (-480 "GRIMAGE.spad" 780945 780953 788022 788027) (-479 "GRDEF.spad" 779324 779332 780935 780940) (-478 "GRAY.spad" 777795 777803 779314 779319) (-477 "GRALG.spad" 776888 776900 777785 777790) (-476 "GRALG.spad" 775979 775993 776878 776883) (-475 "GPOLSET.spad" 775404 775427 775616 775643) (-474 "GOSPER.spad" 774681 774699 775394 775399) (-473 "GMODPOL.spad" 773829 773856 774649 774676) (-472 "GHENSEL.spad" 772912 772926 773819 773824) (-471 "GENUPS.spad" 769205 769218 772902 772907) (-470 "GENUFACT.spad" 768782 768792 769195 769200) (-469 "GENPGCD.spad" 768384 768401 768772 768777) (-468 "GENMFACT.spad" 767836 767855 768374 768379) (-467 "GENEEZ.spad" 765795 765808 767826 767831) (-466 "GDMP.spad" 762779 762796 763553 763680) (-465 "GCNAALG.spad" 756702 756729 762573 762640) (-464 "GCDDOM.spad" 755894 755902 756628 756697) (-463 "GCDDOM.spad" 755148 755158 755884 755889) (-462 "GBINTERN.spad" 751168 751206 755138 755143) (-461 "GBF.spad" 746951 746989 751158 751163) (-460 "GBEUCLID.spad" 744833 744871 746941 746946) (-459 "GB.spad" 742359 742397 744789 744794) (-458 "GAUSSFAC.spad" 741672 741680 742349 742354) (-457 "GALUTIL.spad" 739998 740008 741628 741633) (-456 "GALPOLYU.spad" 738452 738465 739988 739993) (-455 "GALFACTU.spad" 736665 736684 738442 738447) (-454 "GALFACT.spad" 726878 726889 736655 736660) (-453 "FVFUN.spad" 723901 723909 726868 726873) (-452 "FVC.spad" 722953 722961 723891 723896) (-451 "FUNDESC.spad" 722631 722639 722943 722948) (-450 "FUNCTION.spad" 722480 722492 722621 722626) (-449 "FTEM.spad" 721645 721653 722470 722475) (-448 "FT.spad" 719945 719953 721635 721640) (-447 "FSUPFACT.spad" 718842 718861 719878 719883) (-446 "FST.spad" 716928 716936 718832 718837) (-445 "FSRED.spad" 716408 716424 716918 716923) (-444 "FSPRMELT.spad" 715274 715290 716365 716370) (-443 "FSPECF.spad" 713365 713381 715264 715269) (-442 "FSINT.spad" 713025 713041 713355 713360) (-441 "FSERIES.spad" 712216 712228 712845 712944) (-440 "FSCINT.spad" 711533 711549 712206 712211) (-439 "FSAGG2.spad" 710268 710284 711523 711528) (-438 "FSAGG.spad" 709385 709395 710224 710263) (-437 "FSAGG.spad" 708464 708476 709305 709310) (-436 "FS2UPS.spad" 702979 703013 708454 708459) (-435 "FS2EXPXP.spad" 702120 702143 702969 702974) (-434 "FS2.spad" 701775 701791 702110 702115) (-433 "FS.spad" 696043 696053 701550 701770) (-432 "FS.spad" 690083 690095 695592 695597) (-431 "FRUTIL.spad" 689037 689047 690073 690078) (-430 "FRNAALG.spad" 684314 684324 688979 689032) (-429 "FRNAALG.spad" 679603 679615 684270 684275) (-428 "FRNAAF2.spad" 679051 679069 679593 679598) (-427 "FRMOD.spad" 678458 678488 678979 678984) (-426 "FRIDEAL2.spad" 678062 678094 678448 678453) (-425 "FRIDEAL.spad" 677287 677308 678042 678057) (-424 "FRETRCT.spad" 676806 676816 677277 677282) (-423 "FRETRCT.spad" 676182 676194 676655 676660) (-422 "FRAMALG.spad" 674562 674575 676138 676177) (-421 "FRAMALG.spad" 672974 672989 674552 674557) (-420 "FRAC2.spad" 672579 672591 672964 672969) (-419 "FRAC.spad" 670365 670375 670752 670925) (-418 "FR2.spad" 669701 669713 670355 670360) (-417 "FR.spad" 663323 663333 668596 668665) (-416 "FPS.spad" 660162 660170 663213 663318) (-415 "FPS.spad" 657029 657039 660082 660087) (-414 "FPC.spad" 656075 656083 656931 657024) (-413 "FPC.spad" 655207 655217 656065 656070) (-412 "FPATMAB.spad" 654969 654979 655197 655202) (-411 "FPARFRAC.spad" 653811 653828 654959 654964) (-410 "FORTRAN.spad" 652317 652360 653801 653806) (-409 "FORTFN.spad" 649487 649495 652307 652312) (-408 "FORTCAT.spad" 649171 649179 649477 649482) (-407 "FORT.spad" 648120 648128 649161 649166) (-406 "FORDER.spad" 647811 647835 648110 648115) (-405 "FOP.spad" 647012 647020 647801 647806) (-404 "FNLA.spad" 646436 646458 646980 647007) (-403 "FNCAT.spad" 645031 645039 646426 646431) (-402 "FNAME.spad" 644923 644931 645021 645026) (-401 "FMTC.spad" 644721 644729 644849 644918) (-400 "FMONOID.spad" 644402 644412 644677 644682) (-399 "FMONCAT.spad" 641571 641581 644392 644397) (-398 "FMFUN.spad" 638601 638609 641561 641566) (-397 "FMCAT.spad" 636277 636295 638569 638596) (-396 "FMC.spad" 635329 635337 636267 636272) (-395 "FM1.spad" 634694 634706 635263 635290) (-394 "FM.spad" 634309 634321 634548 634575) (-393 "FLOATRP.spad" 632052 632066 634299 634304) (-392 "FLOATCP.spad" 629491 629505 632042 632047) (-391 "FLOAT.spad" 622805 622813 629357 629486) (-390 "FLINEXP.spad" 622527 622537 622795 622800) (-389 "FLINEXP.spad" 622190 622202 622460 622465) (-388 "FLASORT.spad" 621516 621528 622180 622185) (-387 "FLALG.spad" 619186 619205 621442 621511) (-386 "FLAGG2.spad" 617903 617919 619176 619181) (-385 "FLAGG.spad" 614969 614979 617883 617898) (-384 "FLAGG.spad" 611936 611948 614852 614857) (-383 "FINRALG.spad" 610021 610034 611892 611931) (-382 "FINRALG.spad" 608032 608047 609905 609910) (-381 "FINITE.spad" 607184 607192 608022 608027) (-380 "FINAALG.spad" 596369 596379 607126 607179) (-379 "FINAALG.spad" 585566 585578 596325 596330) (-378 "FILECAT.spad" 584100 584117 585556 585561) (-377 "FILE.spad" 583683 583693 584090 584095) (-376 "FIELD.spad" 583089 583097 583585 583678) (-375 "FIELD.spad" 582581 582591 583079 583084) (-374 "FGROUP.spad" 581244 581254 582561 582576) (-373 "FGLMICPK.spad" 580039 580054 581234 581239) (-372 "FFX.spad" 579422 579437 579755 579848) (-371 "FFSLPE.spad" 578933 578954 579412 579417) (-370 "FFPOLY2.spad" 577993 578010 578923 578928) (-369 "FFPOLY.spad" 569335 569346 577983 577988) (-368 "FFP.spad" 568740 568760 569051 569144) (-367 "FFNBX.spad" 567260 567280 568456 568549) (-366 "FFNBP.spad" 565781 565798 566976 567069) (-365 "FFNB.spad" 564246 564267 565462 565555) (-364 "FFINTBAS.spad" 561760 561779 564236 564241) (-363 "FFIELDC.spad" 559345 559353 561662 561755) (-362 "FFIELDC.spad" 557016 557026 559335 559340) (-361 "FFHOM.spad" 555788 555805 557006 557011) (-360 "FFF.spad" 553231 553242 555778 555783) (-359 "FFCGX.spad" 552086 552106 552947 553040) (-358 "FFCGP.spad" 550983 551003 551802 551895) (-357 "FFCG.spad" 549775 549796 550664 550757) (-356 "FFCAT2.spad" 549522 549562 549765 549770) (-355 "FFCAT.spad" 542687 542709 549361 549517) (-354 "FFCAT.spad" 535931 535955 542607 542612) (-353 "FF.spad" 535379 535395 535612 535705) (-352 "FEXPR.spad" 527079 527125 535126 535165) (-351 "FEVALAB.spad" 526787 526797 527069 527074) (-350 "FEVALAB.spad" 526271 526283 526555 526560) (-349 "FDIVCAT.spad" 524367 524391 526261 526266) (-348 "FDIVCAT.spad" 522461 522487 524357 524362) (-347 "FDIV2.spad" 522117 522157 522451 522456) (-346 "FDIV.spad" 521575 521599 522107 522112) (-345 "FCTRDATA.spad" 520583 520591 521565 521570) (-344 "FCPAK1.spad" 519118 519126 520573 520578) (-343 "FCOMP.spad" 518497 518507 519108 519113) (-342 "FC.spad" 508504 508512 518487 518492) (-341 "FAXF.spad" 501539 501553 508406 508499) (-340 "FAXF.spad" 494626 494642 501495 501500) (-339 "FARRAY.spad" 492602 492612 493635 493662) (-338 "FAMR.spad" 490746 490758 492500 492597) (-337 "FAMR.spad" 488874 488888 490630 490635) (-336 "FAMONOID.spad" 488558 488568 488828 488833) (-335 "FAMONC.spad" 486878 486890 488548 488553) (-334 "FAGROUP.spad" 486518 486528 486774 486801) (-333 "FACUTIL.spad" 484730 484747 486508 486513) (-332 "FACTFUNC.spad" 483932 483942 484720 484725) (-331 "EXPUPXS.spad" 480684 480707 481983 482132) (-330 "EXPRTUBE.spad" 477972 477980 480674 480679) (-329 "EXPRODE.spad" 475140 475156 477962 477967) (-328 "EXPR2UPS.spad" 471262 471275 475130 475135) (-327 "EXPR2.spad" 470967 470979 471252 471257) (-326 "EXPR.spad" 466052 466062 466766 467061) (-325 "EXPEXPAN.spad" 462796 462821 463428 463521) (-324 "EXITAST.spad" 462532 462540 462786 462791) (-323 "EXIT.spad" 462203 462211 462522 462527) (-322 "EVALCYC.spad" 461663 461677 462193 462198) (-321 "EVALAB.spad" 461243 461253 461653 461658) (-320 "EVALAB.spad" 460821 460833 461233 461238) (-319 "EUCDOM.spad" 458411 458419 460747 460816) (-318 "EUCDOM.spad" 456063 456073 458401 458406) (-317 "ESTOOLS2.spad" 455658 455672 456053 456058) (-316 "ESTOOLS1.spad" 455335 455346 455648 455653) (-315 "ESTOOLS.spad" 447213 447221 455325 455330) (-314 "ESCONT1.spad" 446954 446966 447203 447208) (-313 "ESCONT.spad" 443747 443755 446944 446949) (-312 "ES2.spad" 443260 443276 443737 443742) (-311 "ES1.spad" 442830 442846 443250 443255) (-310 "ES.spad" 435701 435709 442820 442825) (-309 "ES.spad" 428475 428485 435596 435601) (-308 "ERROR.spad" 425802 425810 428465 428470) (-307 "EQTBL.spad" 423796 423818 424005 424032) (-306 "EQ2.spad" 423514 423526 423786 423791) (-305 "EQ.spad" 418290 418300 421085 421197) (-304 "EP.spad" 414616 414626 418280 418285) (-303 "ENV.spad" 413294 413302 414606 414611) (-302 "ENTIRER.spad" 412962 412970 413238 413289) (-301 "EMR.spad" 412250 412291 412888 412957) (-300 "ELTAGG.spad" 410504 410523 412240 412245) (-299 "ELTAGG.spad" 408722 408743 410460 410465) (-298 "ELTAB.spad" 408197 408210 408712 408717) (-297 "ELFUTS.spad" 407632 407651 408187 408192) (-296 "ELEMFUN.spad" 407321 407329 407622 407627) (-295 "ELEMFUN.spad" 407008 407018 407311 407316) (-294 "ELAGG.spad" 404979 404989 406988 407003) (-293 "ELAGG.spad" 402887 402899 404898 404903) (-292 "ELABOR.spad" 402233 402241 402877 402882) (-291 "ELABEXPR.spad" 401165 401173 402223 402228) (-290 "EFUPXS.spad" 397941 397971 401121 401126) (-289 "EFULS.spad" 394777 394800 397897 397902) (-288 "EFSTRUC.spad" 392792 392808 394767 394772) (-287 "EF.spad" 387568 387584 392782 392787) (-286 "EAB.spad" 385868 385876 387558 387563) (-285 "E04UCFA.spad" 385404 385412 385858 385863) (-284 "E04NAFA.spad" 384981 384989 385394 385399) (-283 "E04MBFA.spad" 384561 384569 384971 384976) (-282 "E04JAFA.spad" 384097 384105 384551 384556) (-281 "E04GCFA.spad" 383633 383641 384087 384092) (-280 "E04FDFA.spad" 383169 383177 383623 383628) (-279 "E04DGFA.spad" 382705 382713 383159 383164) (-278 "E04AGNT.spad" 378579 378587 382695 382700) (-277 "DVARCAT.spad" 375469 375479 378569 378574) (-276 "DVARCAT.spad" 372357 372369 375459 375464) (-275 "DSMP.spad" 369653 369667 369958 370085) (-274 "DSEXT.spad" 368955 368965 369643 369648) (-273 "DSEXT.spad" 368161 368173 368851 368856) (-272 "DROPT1.spad" 367826 367836 368151 368156) (-271 "DROPT0.spad" 362691 362699 367816 367821) (-270 "DROPT.spad" 356650 356658 362681 362686) (-269 "DRAWPT.spad" 354823 354831 356640 356645) (-268 "DRAWHACK.spad" 354131 354141 354813 354818) (-267 "DRAWCX.spad" 351609 351617 354121 354126) (-266 "DRAWCURV.spad" 351156 351171 351599 351604) (-265 "DRAWCFUN.spad" 340688 340696 351146 351151) (-264 "DRAW.spad" 333564 333577 340678 340683) (-263 "DQAGG.spad" 331742 331752 333532 333559) (-262 "DPOLCAT.spad" 327099 327115 331610 331737) (-261 "DPOLCAT.spad" 322542 322560 327055 327060) (-260 "DPMO.spad" 314065 314081 314203 314416) (-259 "DPMM.spad" 305601 305619 305726 305939) (-258 "DOMTMPLT.spad" 305372 305380 305591 305596) (-257 "DOMCTOR.spad" 305127 305135 305362 305367) (-256 "DOMAIN.spad" 304238 304246 305117 305122) (-255 "DMP.spad" 301426 301441 301996 302123) (-254 "DMEXT.spad" 301293 301303 301394 301421) (-253 "DLP.spad" 300653 300663 301283 301288) (-252 "DLIST.spad" 299058 299068 299662 299689) (-251 "DLAGG.spad" 297475 297485 299048 299053) (-250 "DIVRING.spad" 297017 297025 297419 297470) (-249 "DIVRING.spad" 296603 296613 297007 297012) (-248 "DISPLAY.spad" 294793 294801 296593 296598) (-247 "DIRPROD2.spad" 293611 293629 294783 294788) (-246 "DIRPROD.spad" 280843 280859 281483 281582) (-245 "DIRPCAT.spad" 280036 280052 280739 280838) (-244 "DIRPCAT.spad" 278856 278874 279561 279566) (-243 "DIOSP.spad" 277681 277689 278846 278851) (-242 "DIOPS.spad" 276677 276687 277661 277676) (-241 "DIOPS.spad" 275647 275659 276633 276638) (-240 "DIFRING.spad" 275485 275493 275627 275642) (-239 "DIFFSPC.spad" 275064 275072 275475 275480) (-238 "DIFFSPC.spad" 274641 274651 275054 275059) (-237 "DIFFMOD.spad" 274130 274140 274609 274636) (-236 "DIFFDOM.spad" 273295 273306 274120 274125) (-235 "DIFFDOM.spad" 272458 272471 273285 273290) (-234 "DIFEXT.spad" 272277 272287 272438 272453) (-233 "DIAGG.spad" 271907 271917 272257 272272) (-232 "DIAGG.spad" 271545 271557 271897 271902) (-231 "DHMATRIX.spad" 269728 269738 270873 270900) (-230 "DFSFUN.spad" 263368 263376 269718 269723) (-229 "DFLOAT.spad" 259975 259983 263258 263363) (-228 "DFINTTLS.spad" 258206 258222 259965 259970) (-227 "DERHAM.spad" 256120 256152 258186 258201) (-226 "DEQUEUE.spad" 255315 255325 255598 255625) (-225 "DEGRED.spad" 254932 254946 255305 255310) (-224 "DEFINTRF.spad" 252514 252524 254922 254927) (-223 "DEFINTEF.spad" 251052 251068 252504 252509) (-222 "DEFAST.spad" 250436 250444 251042 251047) (-221 "DECIMAL.spad" 248400 248408 248761 248854) (-220 "DDFACT.spad" 246221 246238 248390 248395) (-219 "DBLRESP.spad" 245821 245845 246211 246216) (-218 "DBASIS.spad" 245447 245462 245811 245816) (-217 "DBASE.spad" 244111 244121 245437 245442) (-216 "DATAARY.spad" 243597 243610 244101 244106) (-215 "D03FAFA.spad" 243425 243433 243587 243592) (-214 "D03EEFA.spad" 243245 243253 243415 243420) (-213 "D03AGNT.spad" 242331 242339 243235 243240) (-212 "D02EJFA.spad" 241793 241801 242321 242326) (-211 "D02CJFA.spad" 241271 241279 241783 241788) (-210 "D02BHFA.spad" 240761 240769 241261 241266) (-209 "D02BBFA.spad" 240251 240259 240751 240756) (-208 "D02AGNT.spad" 235121 235129 240241 240246) (-207 "D01WGTS.spad" 233440 233448 235111 235116) (-206 "D01TRNS.spad" 233417 233425 233430 233435) (-205 "D01GBFA.spad" 232939 232947 233407 233412) (-204 "D01FCFA.spad" 232461 232469 232929 232934) (-203 "D01ASFA.spad" 231929 231937 232451 232456) (-202 "D01AQFA.spad" 231383 231391 231919 231924) (-201 "D01APFA.spad" 230823 230831 231373 231378) (-200 "D01ANFA.spad" 230317 230325 230813 230818) (-199 "D01AMFA.spad" 229827 229835 230307 230312) (-198 "D01ALFA.spad" 229367 229375 229817 229822) (-197 "D01AKFA.spad" 228893 228901 229357 229362) (-196 "D01AJFA.spad" 228416 228424 228883 228888) (-195 "D01AGNT.spad" 224483 224491 228406 228411) (-194 "CYCLOTOM.spad" 223989 223997 224473 224478) (-193 "CYCLES.spad" 220781 220789 223979 223984) (-192 "CVMP.spad" 220198 220208 220771 220776) (-191 "CTRIGMNP.spad" 218698 218714 220188 220193) (-190 "CTORKIND.spad" 218301 218309 218688 218693) (-189 "CTORCAT.spad" 217542 217550 218291 218296) (-188 "CTORCAT.spad" 216781 216791 217532 217537) (-187 "CTORCALL.spad" 216370 216380 216771 216776) (-186 "CTOR.spad" 216061 216069 216360 216365) (-185 "CSTTOOLS.spad" 215306 215319 216051 216056) (-184 "CRFP.spad" 209078 209091 215296 215301) (-183 "CRCEAST.spad" 208798 208806 209068 209073) (-182 "CRAPACK.spad" 207865 207875 208788 208793) (-181 "CPMATCH.spad" 207366 207381 207787 207792) (-180 "CPIMA.spad" 207071 207090 207356 207361) (-179 "COORDSYS.spad" 202080 202090 207061 207066) (-178 "CONTOUR.spad" 201507 201515 202070 202075) (-177 "CONTFRAC.spad" 197257 197267 201409 201502) (-176 "CONDUIT.spad" 197015 197023 197247 197252) (-175 "COMRING.spad" 196689 196697 196953 197010) (-174 "COMPPROP.spad" 196207 196215 196679 196684) (-173 "COMPLPAT.spad" 195974 195989 196197 196202) (-172 "COMPLEX2.spad" 195689 195701 195964 195969) (-171 "COMPLEX.spad" 191036 191046 191280 191541) (-170 "COMPILER.spad" 190585 190593 191026 191031) (-169 "COMPFACT.spad" 190187 190201 190575 190580) (-168 "COMPCAT.spad" 188259 188269 189921 190182) (-167 "COMPCAT.spad" 186056 186068 187720 187725) (-166 "COMMUPC.spad" 185804 185822 186046 186051) (-165 "COMMONOP.spad" 185337 185345 185794 185799) (-164 "COMMAAST.spad" 185100 185108 185327 185332) (-163 "COMM.spad" 184911 184919 185090 185095) (-162 "COMBOPC.spad" 183834 183842 184901 184906) (-161 "COMBINAT.spad" 182601 182611 183824 183829) (-160 "COMBF.spad" 180023 180039 182591 182596) (-159 "COLOR.spad" 178860 178868 180013 180018) (-158 "COLONAST.spad" 178526 178534 178850 178855) (-157 "CMPLXRT.spad" 178237 178254 178516 178521) (-156 "CLLCTAST.spad" 177899 177907 178227 178232) (-155 "CLIP.spad" 174007 174015 177889 177894) (-154 "CLIF.spad" 172662 172678 173963 174002) (-153 "CLAGG.spad" 169199 169209 172652 172657) (-152 "CLAGG.spad" 165604 165616 169059 169064) (-151 "CINTSLPE.spad" 164959 164972 165594 165599) (-150 "CHVAR.spad" 163097 163119 164949 164954) (-149 "CHARZ.spad" 163012 163020 163077 163092) (-148 "CHARPOL.spad" 162538 162548 163002 163007) (-147 "CHARNZ.spad" 162300 162308 162518 162533) (-146 "CHAR.spad" 159668 159676 162290 162295) (-145 "CFCAT.spad" 158996 159004 159658 159663) (-144 "CDEN.spad" 158216 158230 158986 158991) (-143 "CCLASS.spad" 156312 156320 157574 157613) (-142 "CATEGORY.spad" 155386 155394 156302 156307) (-141 "CATCTOR.spad" 155277 155285 155376 155381) (-140 "CATAST.spad" 154903 154911 155267 155272) (-139 "CASEAST.spad" 154617 154625 154893 154898) (-138 "CARTEN2.spad" 154007 154034 154607 154612) (-137 "CARTEN.spad" 149374 149398 153997 154002) (-136 "CARD.spad" 146669 146677 149348 149369) (-135 "CAPSLAST.spad" 146451 146459 146659 146664) (-134 "CACHSET.spad" 146075 146083 146441 146446) (-133 "CABMON.spad" 145630 145638 146065 146070) (-132 "BYTEORD.spad" 145305 145313 145620 145625) (-131 "BYTEBUF.spad" 143006 143014 144292 144319) (-130 "BYTE.spad" 142481 142489 142996 143001) (-129 "BTREE.spad" 141425 141435 141959 141986) (-128 "BTOURN.spad" 140301 140311 140903 140930) (-127 "BTCAT.spad" 139693 139703 140269 140296) (-126 "BTCAT.spad" 139105 139117 139683 139688) (-125 "BTAGG.spad" 138571 138579 139073 139100) (-124 "BTAGG.spad" 138057 138067 138561 138566) (-123 "BSTREE.spad" 136669 136679 137535 137562) (-122 "BRILL.spad" 134874 134885 136659 136664) (-121 "BRAGG.spad" 133830 133840 134864 134869) (-120 "BRAGG.spad" 132750 132762 133786 133791) (-119 "BPADICRT.spad" 130575 130587 130822 130915) (-118 "BPADIC.spad" 130247 130259 130501 130570) (-117 "BOUNDZRO.spad" 129903 129920 130237 130242) (-116 "BOP1.spad" 127361 127371 129893 129898) (-115 "BOP.spad" 122503 122511 127351 127356) (-114 "BOOLEAN.spad" 122051 122059 122493 122498) (-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 +((-3 NIL 2274370 2274375 2274380 2274385) (-2 NIL 2274350 2274355 2274360 2274365) (-1 NIL 2274330 2274335 2274340 2274345) (0 NIL 2274310 2274315 2274320 2274325) (-1316 "ZMOD.spad" 2274119 2274132 2274248 2274305) (-1315 "ZLINDEP.spad" 2273217 2273228 2274109 2274114) (-1314 "ZDSOLVE.spad" 2263177 2263199 2273207 2273212) (-1313 "YSTREAM.spad" 2262672 2262683 2263167 2263172) (-1312 "YDIAGRAM.spad" 2262306 2262315 2262662 2262667) (-1311 "XRPOLY.spad" 2261526 2261546 2262162 2262231) (-1310 "XPR.spad" 2259321 2259334 2261244 2261343) (-1309 "XPOLYC.spad" 2258640 2258656 2259247 2259316) (-1308 "XPOLY.spad" 2258195 2258206 2258496 2258565) (-1307 "XPBWPOLY.spad" 2256634 2256654 2257969 2258038) (-1306 "XFALG.spad" 2253682 2253698 2256560 2256629) (-1305 "XF.spad" 2252145 2252160 2253584 2253677) (-1304 "XF.spad" 2250588 2250605 2252029 2252034) (-1303 "XEXPPKG.spad" 2249847 2249873 2250578 2250583) (-1302 "XDPOLY.spad" 2249461 2249477 2249703 2249772) (-1301 "XALG.spad" 2249129 2249140 2249417 2249456) (-1300 "WUTSET.spad" 2245099 2245116 2248730 2248757) (-1299 "WP.spad" 2244306 2244350 2244957 2245024) (-1298 "WHILEAST.spad" 2244104 2244113 2244296 2244301) (-1297 "WHEREAST.spad" 2243775 2243784 2244094 2244099) (-1296 "WFFINTBS.spad" 2241438 2241460 2243765 2243770) (-1295 "WEIER.spad" 2239660 2239671 2241428 2241433) (-1294 "VSPACE.spad" 2239333 2239344 2239628 2239655) (-1293 "VSPACE.spad" 2239026 2239039 2239323 2239328) (-1292 "VOID.spad" 2238703 2238712 2239016 2239021) (-1291 "VIEWDEF.spad" 2233904 2233913 2238693 2238698) (-1290 "VIEW3D.spad" 2217865 2217874 2233894 2233899) (-1289 "VIEW2D.spad" 2205764 2205773 2217855 2217860) (-1288 "VIEW.spad" 2203484 2203493 2205754 2205759) (-1287 "VECTOR2.spad" 2202123 2202136 2203474 2203479) (-1286 "VECTOR.spad" 2200623 2200634 2200874 2200901) (-1285 "VECTCAT.spad" 2198535 2198546 2200591 2200618) (-1284 "VECTCAT.spad" 2196254 2196267 2198312 2198317) (-1283 "VARIABLE.spad" 2196034 2196049 2196244 2196249) (-1282 "UTYPE.spad" 2195678 2195687 2196024 2196029) (-1281 "UTSODETL.spad" 2194973 2194997 2195634 2195639) (-1280 "UTSODE.spad" 2193189 2193209 2194963 2194968) (-1279 "UTSCAT.spad" 2190668 2190684 2193087 2193184) (-1278 "UTSCAT.spad" 2187767 2187785 2190188 2190193) (-1277 "UTS2.spad" 2187362 2187397 2187757 2187762) (-1276 "UTS.spad" 2182240 2182268 2185760 2185857) (-1275 "URAGG.spad" 2176961 2176972 2182230 2182235) (-1274 "URAGG.spad" 2171646 2171659 2176917 2176922) (-1273 "UPXSSING.spad" 2169264 2169290 2170700 2170833) (-1272 "UPXSCONS.spad" 2166942 2166962 2167315 2167464) (-1271 "UPXSCCA.spad" 2165513 2165533 2166788 2166937) (-1270 "UPXSCCA.spad" 2164226 2164248 2165503 2165508) (-1269 "UPXSCAT.spad" 2162815 2162831 2164072 2164221) (-1268 "UPXS2.spad" 2162358 2162411 2162805 2162810) (-1267 "UPXS.spad" 2159573 2159601 2160409 2160558) (-1266 "UPSQFREE.spad" 2157988 2158002 2159563 2159568) (-1265 "UPSCAT.spad" 2155783 2155807 2157886 2157983) (-1264 "UPSCAT.spad" 2153263 2153289 2155368 2155373) (-1263 "UPOLYC2.spad" 2152734 2152753 2153253 2153258) (-1262 "UPOLYC.spad" 2147814 2147825 2152576 2152729) (-1261 "UPOLYC.spad" 2142780 2142793 2147544 2147549) (-1260 "UPMP.spad" 2141712 2141725 2142770 2142775) (-1259 "UPDIVP.spad" 2141277 2141291 2141702 2141707) (-1258 "UPDECOMP.spad" 2139538 2139552 2141267 2141272) (-1257 "UPCDEN.spad" 2138755 2138771 2139528 2139533) (-1256 "UP2.spad" 2138119 2138140 2138745 2138750) (-1255 "UP.spad" 2135147 2135162 2135534 2135687) (-1254 "UNISEG2.spad" 2134644 2134657 2135103 2135108) (-1253 "UNISEG.spad" 2133997 2134008 2134563 2134568) (-1252 "UNIFACT.spad" 2133100 2133112 2133987 2133992) (-1251 "ULSCONS.spad" 2124012 2124032 2124382 2124531) (-1250 "ULSCCAT.spad" 2121749 2121769 2123858 2124007) (-1249 "ULSCCAT.spad" 2119594 2119616 2121705 2121710) (-1248 "ULSCAT.spad" 2117834 2117850 2119440 2119589) (-1247 "ULS2.spad" 2117348 2117401 2117824 2117829) (-1246 "ULS.spad" 2106919 2106947 2107864 2108293) (-1245 "UINT8.spad" 2106796 2106805 2106909 2106914) (-1244 "UINT64.spad" 2106672 2106681 2106786 2106791) (-1243 "UINT32.spad" 2106548 2106557 2106662 2106667) (-1242 "UINT16.spad" 2106424 2106433 2106538 2106543) (-1241 "UFD.spad" 2105489 2105498 2106350 2106419) (-1240 "UFD.spad" 2104616 2104627 2105479 2105484) (-1239 "UDVO.spad" 2103497 2103506 2104606 2104611) (-1238 "UDPO.spad" 2101078 2101089 2103453 2103458) (-1237 "TYPEAST.spad" 2100997 2101006 2101068 2101073) (-1236 "TYPE.spad" 2100929 2100938 2100987 2100992) (-1235 "TWOFACT.spad" 2099581 2099596 2100919 2100924) (-1234 "TUPLE.spad" 2099072 2099083 2099477 2099482) (-1233 "TUBETOOL.spad" 2095939 2095948 2099062 2099067) (-1232 "TUBE.spad" 2094586 2094603 2095929 2095934) (-1231 "TSETCAT.spad" 2082657 2082674 2094554 2094581) (-1230 "TSETCAT.spad" 2070714 2070733 2082613 2082618) (-1229 "TS.spad" 2069307 2069323 2070273 2070370) (-1228 "TRMANIP.spad" 2063671 2063688 2068995 2069000) (-1227 "TRIMAT.spad" 2062634 2062659 2063661 2063666) (-1226 "TRIGMNIP.spad" 2061161 2061178 2062624 2062629) (-1225 "TRIGCAT.spad" 2060673 2060682 2061151 2061156) (-1224 "TRIGCAT.spad" 2060183 2060194 2060663 2060668) (-1223 "TREE.spad" 2058629 2058640 2059661 2059688) (-1222 "TRANFUN.spad" 2058468 2058477 2058619 2058624) (-1221 "TRANFUN.spad" 2058305 2058316 2058458 2058463) (-1220 "TOPSP.spad" 2057979 2057988 2058295 2058300) (-1219 "TOOLSIGN.spad" 2057642 2057653 2057969 2057974) (-1218 "TEXTFILE.spad" 2056203 2056212 2057632 2057637) (-1217 "TEX1.spad" 2055759 2055770 2056193 2056198) (-1216 "TEX.spad" 2052953 2052962 2055749 2055754) (-1215 "TEMUTL.spad" 2052508 2052517 2052943 2052948) (-1214 "TBCMPPK.spad" 2050609 2050632 2052498 2052503) (-1213 "TBAGG.spad" 2049667 2049690 2050589 2050604) (-1212 "TBAGG.spad" 2048733 2048758 2049657 2049662) (-1211 "TANEXP.spad" 2048141 2048152 2048723 2048728) (-1210 "TALGOP.spad" 2047865 2047876 2048131 2048136) (-1209 "TABLEAU.spad" 2047346 2047357 2047855 2047860) (-1208 "TABLE.spad" 2045279 2045302 2045549 2045576) (-1207 "TABLBUMP.spad" 2042058 2042069 2045269 2045274) (-1206 "SYSTEM.spad" 2041286 2041295 2042048 2042053) (-1205 "SYSSOLP.spad" 2038769 2038780 2041276 2041281) (-1204 "SYSPTR.spad" 2038668 2038677 2038759 2038764) (-1203 "SYSNNI.spad" 2037891 2037902 2038658 2038663) (-1202 "SYSINT.spad" 2037295 2037306 2037881 2037886) (-1201 "SYNTAX.spad" 2033629 2033638 2037285 2037290) (-1200 "SYMTAB.spad" 2031697 2031706 2033619 2033624) (-1199 "SYMS.spad" 2027726 2027735 2031687 2031692) (-1198 "SYMPOLY.spad" 2026706 2026717 2026788 2026915) (-1197 "SYMFUNC.spad" 2026207 2026218 2026696 2026701) (-1196 "SYMBOL.spad" 2023702 2023711 2026197 2026202) (-1195 "SWITCH.spad" 2020473 2020482 2023692 2023697) (-1194 "SUTS.spad" 2017452 2017480 2018871 2018968) (-1193 "SUPXS.spad" 2014654 2014682 2015503 2015652) (-1192 "SUPFRACF.spad" 2013759 2013777 2014644 2014649) (-1191 "SUP2.spad" 2013151 2013164 2013749 2013754) (-1190 "SUP.spad" 2009793 2009804 2010566 2010719) (-1189 "SUMRF.spad" 2008767 2008778 2009783 2009788) (-1188 "SUMFS.spad" 2008396 2008413 2008757 2008762) (-1187 "SULS.spad" 1997954 1997982 1998912 1999341) (-1186 "SUCHTAST.spad" 1997723 1997732 1997944 1997949) (-1185 "SUCH.spad" 1997413 1997428 1997713 1997718) (-1184 "SUBSPACE.spad" 1989544 1989559 1997403 1997408) (-1183 "SUBRESP.spad" 1988714 1988728 1989500 1989505) (-1182 "STTFNC.spad" 1985182 1985198 1988704 1988709) (-1181 "STTF.spad" 1981281 1981297 1985172 1985177) (-1180 "STTAYLOR.spad" 1973926 1973937 1981156 1981161) (-1179 "STRTBL.spad" 1971941 1971958 1972090 1972117) (-1178 "STRING.spad" 1970543 1970552 1970928 1970955) (-1177 "STREAM3.spad" 1970116 1970131 1970533 1970538) (-1176 "STREAM2.spad" 1969244 1969257 1970106 1970111) (-1175 "STREAM1.spad" 1968950 1968961 1969234 1969239) (-1174 "STREAM.spad" 1965736 1965747 1968343 1968358) (-1173 "STINPROD.spad" 1964672 1964688 1965726 1965731) (-1172 "STEPAST.spad" 1963906 1963915 1964662 1964667) (-1171 "STEP.spad" 1963223 1963232 1963896 1963901) (-1170 "STBL.spad" 1961271 1961299 1961438 1961453) (-1169 "STAGG.spad" 1959970 1959981 1961261 1961266) (-1168 "STAGG.spad" 1958667 1958680 1959960 1959965) (-1167 "STACK.spad" 1957895 1957906 1958145 1958172) (-1166 "SRING.spad" 1957655 1957664 1957885 1957890) (-1165 "SREGSET.spad" 1955354 1955371 1957256 1957283) (-1164 "SRDCMPK.spad" 1953931 1953951 1955344 1955349) (-1163 "SRAGG.spad" 1949114 1949123 1953899 1953926) (-1162 "SRAGG.spad" 1944317 1944328 1949104 1949109) (-1161 "SQMATRIX.spad" 1941809 1941827 1942725 1942812) (-1160 "SPLTREE.spad" 1936275 1936288 1941071 1941098) (-1159 "SPLNODE.spad" 1932895 1932908 1936265 1936270) (-1158 "SPFCAT.spad" 1931704 1931713 1932885 1932890) (-1157 "SPECOUT.spad" 1930256 1930265 1931694 1931699) (-1156 "SPADXPT.spad" 1922347 1922356 1930246 1930251) (-1155 "spad-parser.spad" 1921812 1921821 1922337 1922342) (-1154 "SPADAST.spad" 1921513 1921522 1921802 1921807) (-1153 "SPACEC.spad" 1905728 1905739 1921503 1921508) (-1152 "SPACE3.spad" 1905504 1905515 1905718 1905723) (-1151 "SORTPAK.spad" 1905053 1905066 1905460 1905465) (-1150 "SOLVETRA.spad" 1902816 1902827 1905043 1905048) (-1149 "SOLVESER.spad" 1901272 1901283 1902806 1902811) (-1148 "SOLVERAD.spad" 1897298 1897309 1901262 1901267) (-1147 "SOLVEFOR.spad" 1895760 1895778 1897288 1897293) (-1146 "SNTSCAT.spad" 1895360 1895377 1895728 1895755) (-1145 "SMTS.spad" 1893642 1893668 1894919 1895016) (-1144 "SMP.spad" 1891045 1891065 1891435 1891562) (-1143 "SMITH.spad" 1889890 1889915 1891035 1891040) (-1142 "SMATCAT.spad" 1888008 1888038 1889834 1889885) (-1141 "SMATCAT.spad" 1886058 1886090 1887886 1887891) (-1140 "SKAGG.spad" 1885027 1885038 1886026 1886053) (-1139 "SINT.spad" 1883967 1883976 1884893 1885022) (-1138 "SIMPAN.spad" 1883695 1883704 1883957 1883962) (-1137 "SIGNRF.spad" 1882820 1882831 1883685 1883690) (-1136 "SIGNEF.spad" 1882106 1882123 1882810 1882815) (-1135 "SIGAST.spad" 1881523 1881532 1882096 1882101) (-1134 "SIG.spad" 1880885 1880894 1881513 1881518) (-1133 "SHP.spad" 1878829 1878844 1880841 1880846) (-1132 "SHDP.spad" 1866184 1866211 1866701 1866800) (-1131 "SGROUP.spad" 1865792 1865801 1866174 1866179) (-1130 "SGROUP.spad" 1865398 1865409 1865782 1865787) (-1129 "SGCF.spad" 1858537 1858546 1865388 1865393) (-1128 "SFRTCAT.spad" 1857483 1857500 1858505 1858532) (-1127 "SFRGCD.spad" 1856546 1856566 1857473 1857478) (-1126 "SFQCMPK.spad" 1851359 1851379 1856536 1856541) (-1125 "SFORT.spad" 1850798 1850812 1851349 1851354) (-1124 "SEXOF.spad" 1850641 1850681 1850788 1850793) (-1123 "SEXCAT.spad" 1848469 1848509 1850631 1850636) (-1122 "SEX.spad" 1848361 1848370 1848459 1848464) (-1121 "SETMN.spad" 1846821 1846838 1848351 1848356) (-1120 "SETCAT.spad" 1846306 1846315 1846811 1846816) (-1119 "SETCAT.spad" 1845789 1845800 1846296 1846301) (-1118 "SETAGG.spad" 1842338 1842349 1845769 1845784) (-1117 "SETAGG.spad" 1838895 1838908 1842328 1842333) (-1116 "SET.spad" 1837168 1837179 1838265 1838304) (-1115 "SEQAST.spad" 1836871 1836880 1837158 1837163) (-1114 "SEGXCAT.spad" 1836027 1836040 1836861 1836866) (-1113 "SEGCAT.spad" 1834952 1834963 1836017 1836022) (-1112 "SEGBIND2.spad" 1834650 1834663 1834942 1834947) (-1111 "SEGBIND.spad" 1834408 1834419 1834597 1834602) (-1110 "SEGAST.spad" 1834138 1834147 1834398 1834403) (-1109 "SEG2.spad" 1833573 1833586 1834094 1834099) (-1108 "SEG.spad" 1833386 1833397 1833492 1833497) (-1107 "SDVAR.spad" 1832662 1832673 1833376 1833381) (-1106 "SDPOL.spad" 1829917 1829928 1830208 1830335) (-1105 "SCPKG.spad" 1828006 1828017 1829907 1829912) (-1104 "SCOPE.spad" 1827183 1827192 1827996 1828001) (-1103 "SCACHE.spad" 1825879 1825890 1827173 1827178) (-1102 "SASTCAT.spad" 1825788 1825797 1825869 1825874) (-1101 "SAOS.spad" 1825660 1825669 1825778 1825783) (-1100 "SAERFFC.spad" 1825373 1825393 1825650 1825655) (-1099 "SAEFACT.spad" 1825074 1825094 1825363 1825368) (-1098 "SAE.spad" 1822508 1822524 1823119 1823254) (-1097 "RURPK.spad" 1820167 1820183 1822498 1822503) (-1096 "RULESET.spad" 1819620 1819644 1820157 1820162) (-1095 "RULECOLD.spad" 1819472 1819485 1819610 1819615) (-1094 "RULE.spad" 1817720 1817744 1819462 1819467) (-1093 "RTVALUE.spad" 1817455 1817464 1817710 1817715) (-1092 "RSTRCAST.spad" 1817172 1817181 1817445 1817450) (-1091 "RSETGCD.spad" 1813614 1813634 1817162 1817167) (-1090 "RSETCAT.spad" 1803582 1803599 1813582 1813609) (-1089 "RSETCAT.spad" 1793570 1793589 1803572 1803577) (-1088 "RSDCMPK.spad" 1792070 1792090 1793560 1793565) (-1087 "RRCC.spad" 1790454 1790484 1792060 1792065) (-1086 "RRCC.spad" 1788836 1788868 1790444 1790449) (-1085 "RPTAST.spad" 1788538 1788547 1788826 1788831) (-1084 "RPOLCAT.spad" 1768042 1768057 1788406 1788533) (-1083 "RPOLCAT.spad" 1747241 1747258 1767607 1767612) (-1082 "ROUTINE.spad" 1742642 1742651 1745390 1745417) (-1081 "ROMAN.spad" 1741970 1741979 1742508 1742637) (-1080 "ROIRC.spad" 1741050 1741082 1741960 1741965) (-1079 "RNS.spad" 1740026 1740035 1740952 1741045) (-1078 "RNS.spad" 1739088 1739099 1740016 1740021) (-1077 "RNGBIND.spad" 1738248 1738262 1739043 1739048) (-1076 "RNG.spad" 1737983 1737992 1738238 1738243) (-1075 "RMODULE.spad" 1737764 1737775 1737973 1737978) (-1074 "RMCAT2.spad" 1737184 1737241 1737754 1737759) (-1073 "RMATRIX.spad" 1735954 1735973 1736297 1736336) (-1072 "RMATCAT.spad" 1731533 1731564 1735910 1735949) (-1071 "RMATCAT.spad" 1727002 1727035 1731381 1731386) (-1070 "RLINSET.spad" 1726706 1726717 1726992 1726997) (-1069 "RINTERP.spad" 1726594 1726614 1726696 1726701) (-1068 "RING.spad" 1726064 1726073 1726574 1726589) (-1067 "RING.spad" 1725542 1725553 1726054 1726059) (-1066 "RIDIST.spad" 1724934 1724943 1725532 1725537) (-1065 "RGCHAIN.spad" 1723455 1723471 1724349 1724376) (-1064 "RGBCSPC.spad" 1723244 1723256 1723445 1723450) (-1063 "RGBCMDL.spad" 1722806 1722818 1723234 1723239) (-1062 "RFFACTOR.spad" 1722268 1722279 1722796 1722801) (-1061 "RFFACT.spad" 1722003 1722015 1722258 1722263) (-1060 "RFDIST.spad" 1720999 1721008 1721993 1721998) (-1059 "RF.spad" 1718673 1718684 1720989 1720994) (-1058 "RETSOL.spad" 1718092 1718105 1718663 1718668) (-1057 "RETRACT.spad" 1717520 1717531 1718082 1718087) (-1056 "RETRACT.spad" 1716946 1716959 1717510 1717515) (-1055 "RETAST.spad" 1716758 1716767 1716936 1716941) (-1054 "RESULT.spad" 1714320 1714329 1714907 1714934) (-1053 "RESRING.spad" 1713667 1713714 1714258 1714315) (-1052 "RESLATC.spad" 1712991 1713002 1713657 1713662) (-1051 "REPSQ.spad" 1712722 1712733 1712981 1712986) (-1050 "REPDB.spad" 1712429 1712440 1712712 1712717) (-1049 "REP2.spad" 1702143 1702154 1712271 1712276) (-1048 "REP1.spad" 1696363 1696374 1702093 1702098) (-1047 "REP.spad" 1693917 1693926 1696353 1696358) (-1046 "REGSET.spad" 1691709 1691726 1693518 1693545) (-1045 "REF.spad" 1691044 1691055 1691664 1691669) (-1044 "REDORDER.spad" 1690250 1690267 1691034 1691039) (-1043 "RECLOS.spad" 1689009 1689029 1689713 1689806) (-1042 "REALSOLV.spad" 1688149 1688158 1688999 1689004) (-1041 "REAL0Q.spad" 1685447 1685462 1688139 1688144) (-1040 "REAL0.spad" 1682291 1682306 1685437 1685442) (-1039 "REAL.spad" 1682163 1682172 1682281 1682286) (-1038 "RDUCEAST.spad" 1681884 1681893 1682153 1682158) (-1037 "RDIV.spad" 1681539 1681564 1681874 1681879) (-1036 "RDIST.spad" 1681106 1681117 1681529 1681534) (-1035 "RDETRS.spad" 1679970 1679988 1681096 1681101) (-1034 "RDETR.spad" 1678109 1678127 1679960 1679965) (-1033 "RDEEFS.spad" 1677208 1677225 1678099 1678104) (-1032 "RDEEF.spad" 1676218 1676235 1677198 1677203) (-1031 "RCFIELD.spad" 1673436 1673445 1676120 1676213) (-1030 "RCFIELD.spad" 1670740 1670751 1673426 1673431) (-1029 "RCAGG.spad" 1668676 1668687 1670730 1670735) (-1028 "RCAGG.spad" 1666539 1666552 1668595 1668600) (-1027 "RATRET.spad" 1665899 1665910 1666529 1666534) (-1026 "RATFACT.spad" 1665591 1665603 1665889 1665894) (-1025 "RANDSRC.spad" 1664910 1664919 1665581 1665586) (-1024 "RADUTIL.spad" 1664666 1664675 1664900 1664905) (-1023 "RADIX.spad" 1661445 1661459 1662991 1663084) (-1022 "RADFF.spad" 1659148 1659185 1659267 1659423) (-1021 "RADCAT.spad" 1658743 1658752 1659138 1659143) (-1020 "RADCAT.spad" 1658336 1658347 1658733 1658738) (-1019 "QUEUE.spad" 1657555 1657566 1657814 1657841) (-1018 "QUATCT2.spad" 1657175 1657194 1657545 1657550) (-1017 "QUATCAT.spad" 1655345 1655356 1657105 1657170) (-1016 "QUATCAT.spad" 1653263 1653276 1655025 1655030) (-1015 "QUAT.spad" 1651715 1651726 1652058 1652123) (-1014 "QUAGG.spad" 1650548 1650559 1651683 1651710) (-1013 "QQUTAST.spad" 1650316 1650325 1650538 1650543) (-1012 "QFORM.spad" 1649934 1649949 1650306 1650311) (-1011 "QFCAT2.spad" 1649626 1649643 1649924 1649929) (-1010 "QFCAT.spad" 1648328 1648339 1649528 1649621) (-1009 "QFCAT.spad" 1646612 1646625 1647814 1647819) (-1008 "QEQUAT.spad" 1646170 1646179 1646602 1646607) (-1007 "QCMPACK.spad" 1641084 1641104 1646160 1646165) (-1006 "QALGSET2.spad" 1639079 1639098 1641074 1641079) (-1005 "QALGSET.spad" 1635183 1635216 1638993 1638998) (-1004 "PWFFINTB.spad" 1632598 1632620 1635173 1635178) (-1003 "PUSHVAR.spad" 1631936 1631956 1632588 1632593) (-1002 "PTRANFN.spad" 1628071 1628082 1631926 1631931) (-1001 "PTPACK.spad" 1625158 1625169 1628061 1628066) (-1000 "PTFUNC2.spad" 1624980 1624995 1625148 1625153) (-999 "PTCAT.spad" 1624235 1624245 1624948 1624975) (-998 "PSQFR.spad" 1623550 1623574 1624225 1624230) (-997 "PSEUDLIN.spad" 1622436 1622446 1623540 1623545) (-996 "PSETPK.spad" 1609141 1609157 1622314 1622319) (-995 "PSETCAT.spad" 1603541 1603564 1609121 1609136) (-994 "PSETCAT.spad" 1597915 1597940 1603497 1603502) (-993 "PSCURVE.spad" 1596914 1596922 1597905 1597910) (-992 "PSCAT.spad" 1595697 1595726 1596812 1596909) (-991 "PSCAT.spad" 1594570 1594601 1595687 1595692) (-990 "PRTITION.spad" 1593268 1593276 1594560 1594565) (-989 "PRTDAST.spad" 1592987 1592995 1593258 1593263) (-988 "PRS.spad" 1582605 1582622 1592943 1592948) (-987 "PRQAGG.spad" 1582040 1582050 1582573 1582600) (-986 "PROPLOG.spad" 1581644 1581652 1582030 1582035) (-985 "PROPFUN2.spad" 1581267 1581280 1581634 1581639) (-984 "PROPFUN1.spad" 1580673 1580684 1581257 1581262) (-983 "PROPFRML.spad" 1579241 1579252 1580663 1580668) (-982 "PROPERTY.spad" 1578737 1578745 1579231 1579236) (-981 "PRODUCT.spad" 1576419 1576431 1576703 1576758) (-980 "PRINT.spad" 1576171 1576179 1576409 1576414) (-979 "PRIMES.spad" 1574432 1574442 1576161 1576166) (-978 "PRIMELT.spad" 1572553 1572567 1574422 1574427) (-977 "PRIMCAT.spad" 1572196 1572204 1572543 1572548) (-976 "PRIMARR2.spad" 1570963 1570975 1572186 1572191) (-975 "PRIMARR.spad" 1569802 1569812 1569972 1569999) (-974 "PREASSOC.spad" 1569184 1569196 1569792 1569797) (-973 "PR.spad" 1567549 1567561 1568248 1568375) (-972 "PPCURVE.spad" 1566686 1566694 1567539 1567544) (-971 "PORTNUM.spad" 1566477 1566485 1566676 1566681) (-970 "POLYROOT.spad" 1565326 1565348 1566433 1566438) (-969 "POLYLIFT.spad" 1564591 1564614 1565316 1565321) (-968 "POLYCATQ.spad" 1562717 1562739 1564581 1564586) (-967 "POLYCAT.spad" 1556219 1556240 1562585 1562712) (-966 "POLYCAT.spad" 1549017 1549040 1555385 1555390) (-965 "POLY2UP.spad" 1548469 1548483 1549007 1549012) (-964 "POLY2.spad" 1548066 1548078 1548459 1548464) (-963 "POLY.spad" 1545329 1545339 1545844 1545971) (-962 "POLUTIL.spad" 1544294 1544323 1545285 1545290) (-961 "POLTOPOL.spad" 1543042 1543057 1544284 1544289) (-960 "POINT.spad" 1541706 1541716 1541793 1541820) (-959 "PNTHEORY.spad" 1538408 1538416 1541696 1541701) (-958 "PMTOOLS.spad" 1537183 1537197 1538398 1538403) (-957 "PMSYM.spad" 1536732 1536742 1537173 1537178) (-956 "PMQFCAT.spad" 1536323 1536337 1536722 1536727) (-955 "PMPREDFS.spad" 1535785 1535807 1536313 1536318) (-954 "PMPRED.spad" 1535272 1535286 1535775 1535780) (-953 "PMPLCAT.spad" 1534349 1534367 1535201 1535206) (-952 "PMLSAGG.spad" 1533934 1533948 1534339 1534344) (-951 "PMKERNEL.spad" 1533513 1533525 1533924 1533929) (-950 "PMINS.spad" 1533093 1533103 1533503 1533508) (-949 "PMFS.spad" 1532670 1532688 1533083 1533088) (-948 "PMDOWN.spad" 1531960 1531974 1532660 1532665) (-947 "PMASSFS.spad" 1530935 1530951 1531950 1531955) (-946 "PMASS.spad" 1529953 1529961 1530925 1530930) (-945 "PLOTTOOL.spad" 1529733 1529741 1529943 1529948) (-944 "PLOT3D.spad" 1526197 1526205 1529723 1529728) (-943 "PLOT1.spad" 1525370 1525380 1526187 1526192) (-942 "PLOT.spad" 1520293 1520301 1525360 1525365) (-941 "PLEQN.spad" 1507695 1507722 1520283 1520288) (-940 "PINTERPA.spad" 1507479 1507495 1507685 1507690) (-939 "PINTERP.spad" 1507101 1507120 1507469 1507474) (-938 "PID.spad" 1506075 1506083 1507027 1507096) (-937 "PICOERCE.spad" 1505732 1505742 1506065 1506070) (-936 "PI.spad" 1505349 1505357 1505706 1505727) (-935 "PGROEB.spad" 1503958 1503972 1505339 1505344) (-934 "PGE.spad" 1495631 1495639 1503948 1503953) (-933 "PGCD.spad" 1494585 1494602 1495621 1495626) (-932 "PFRPAC.spad" 1493734 1493744 1494575 1494580) (-931 "PFR.spad" 1490437 1490447 1493636 1493729) (-930 "PFOTOOLS.spad" 1489695 1489711 1490427 1490432) (-929 "PFOQ.spad" 1489065 1489083 1489685 1489690) (-928 "PFO.spad" 1488484 1488511 1489055 1489060) (-927 "PFECAT.spad" 1486194 1486202 1488410 1488479) (-926 "PFECAT.spad" 1483932 1483942 1486150 1486155) (-925 "PFBRU.spad" 1481820 1481832 1483922 1483927) (-924 "PFBR.spad" 1479380 1479403 1481810 1481815) (-923 "PF.spad" 1478954 1478966 1479185 1479278) (-922 "PERMGRP.spad" 1473724 1473734 1478944 1478949) (-921 "PERMCAT.spad" 1472385 1472395 1473704 1473719) (-920 "PERMAN.spad" 1470941 1470955 1472375 1472380) (-919 "PERM.spad" 1466748 1466758 1470771 1470786) (-918 "PENDTREE.spad" 1465968 1465978 1466248 1466253) (-917 "PDSPC.spad" 1464781 1464791 1465958 1465963) (-916 "PDSPC.spad" 1463592 1463604 1464771 1464776) (-915 "PDRING.spad" 1463434 1463444 1463572 1463587) (-914 "PDMOD.spad" 1463250 1463262 1463402 1463429) (-913 "PDEPROB.spad" 1462265 1462273 1463240 1463245) (-912 "PDEPACK.spad" 1456401 1456409 1462255 1462260) (-911 "PDECOMP.spad" 1455871 1455888 1456391 1456396) (-910 "PDECAT.spad" 1454227 1454235 1455861 1455866) (-909 "PDDOM.spad" 1453665 1453678 1454217 1454222) (-908 "PDDOM.spad" 1453101 1453116 1453655 1453660) (-907 "PCOMP.spad" 1452954 1452967 1453091 1453096) (-906 "PBWLB.spad" 1451550 1451567 1452944 1452949) (-905 "PATTERN2.spad" 1451288 1451300 1451540 1451545) (-904 "PATTERN1.spad" 1449632 1449648 1451278 1451283) (-903 "PATTERN.spad" 1444203 1444213 1449622 1449627) (-902 "PATRES2.spad" 1443875 1443889 1444193 1444198) (-901 "PATRES.spad" 1441458 1441470 1443865 1443870) (-900 "PATMATCH.spad" 1439646 1439677 1441157 1441162) (-899 "PATMAB.spad" 1439075 1439085 1439636 1439641) (-898 "PATLRES.spad" 1438161 1438175 1439065 1439070) (-897 "PATAB.spad" 1437925 1437935 1438151 1438156) (-896 "PARTPERM.spad" 1435981 1435989 1437915 1437920) (-895 "PARSURF.spad" 1435415 1435443 1435971 1435976) (-894 "PARSU2.spad" 1435212 1435228 1435405 1435410) (-893 "script-parser.spad" 1434732 1434740 1435202 1435207) (-892 "PARSCURV.spad" 1434166 1434194 1434722 1434727) (-891 "PARSC2.spad" 1433957 1433973 1434156 1434161) (-890 "PARPCURV.spad" 1433419 1433447 1433947 1433952) (-889 "PARPC2.spad" 1433210 1433226 1433409 1433414) (-888 "PARAMAST.spad" 1432338 1432346 1433200 1433205) (-887 "PAN2EXPR.spad" 1431750 1431758 1432328 1432333) (-886 "PALETTE.spad" 1430736 1430744 1431740 1431745) (-885 "PAIR.spad" 1429743 1429756 1430312 1430317) (-884 "PADICRC.spad" 1426947 1426965 1428110 1428203) (-883 "PADICRAT.spad" 1424806 1424818 1425019 1425112) (-882 "PADICCT.spad" 1423355 1423367 1424732 1424801) (-881 "PADIC.spad" 1423058 1423070 1423281 1423350) (-880 "PADEPAC.spad" 1421747 1421766 1423048 1423053) (-879 "PADE.spad" 1420499 1420515 1421737 1421742) (-878 "OWP.spad" 1419747 1419777 1420357 1420424) (-877 "OVERSET.spad" 1419320 1419328 1419737 1419742) (-876 "OVAR.spad" 1419101 1419124 1419310 1419315) (-875 "OUTFORM.spad" 1408509 1408517 1419091 1419096) (-874 "OUTBFILE.spad" 1407943 1407951 1408499 1408504) (-873 "OUTBCON.spad" 1407013 1407021 1407933 1407938) (-872 "OUTBCON.spad" 1406081 1406091 1407003 1407008) (-871 "OUT.spad" 1405199 1405207 1406071 1406076) (-870 "OSI.spad" 1404674 1404682 1405189 1405194) (-869 "OSGROUP.spad" 1404592 1404600 1404664 1404669) (-868 "ORTHPOL.spad" 1403071 1403081 1404503 1404508) (-867 "OREUP.spad" 1402515 1402543 1402742 1402781) (-866 "ORESUP.spad" 1401807 1401831 1402186 1402225) (-865 "OREPCTO.spad" 1399696 1399708 1401727 1401732) (-864 "OREPCAT.spad" 1393883 1393893 1399652 1399691) (-863 "OREPCAT.spad" 1387960 1387972 1393731 1393736) (-862 "ORDTYPE.spad" 1387197 1387205 1387950 1387955) (-861 "ORDTYPE.spad" 1386432 1386442 1387187 1387192) (-860 "ORDSTRCT.spad" 1386202 1386217 1386365 1386370) (-859 "ORDSET.spad" 1385902 1385910 1386192 1386197) (-858 "ORDRING.spad" 1385719 1385727 1385882 1385897) (-857 "ORDMON.spad" 1385574 1385582 1385709 1385714) (-856 "ORDFUNS.spad" 1384706 1384722 1385564 1385569) (-855 "ORDFIN.spad" 1384526 1384534 1384696 1384701) (-854 "ORDCOMP2.spad" 1383819 1383831 1384516 1384521) (-853 "ORDCOMP.spad" 1382272 1382282 1383354 1383383) (-852 "OPTPROB.spad" 1380910 1380918 1382262 1382267) (-851 "OPTPACK.spad" 1373319 1373327 1380900 1380905) (-850 "OPTCAT.spad" 1370998 1371006 1373309 1373314) (-849 "OPSIG.spad" 1370660 1370668 1370988 1370993) (-848 "OPQUERY.spad" 1370241 1370249 1370650 1370655) (-847 "OPERCAT.spad" 1369707 1369717 1370231 1370236) (-846 "OPERCAT.spad" 1369171 1369183 1369697 1369702) (-845 "OP.spad" 1368913 1368923 1368993 1369060) (-844 "ONECOMP2.spad" 1368337 1368349 1368903 1368908) (-843 "ONECOMP.spad" 1367070 1367080 1367872 1367901) (-842 "OMSAGG.spad" 1366858 1366868 1367026 1367065) (-841 "OMLO.spad" 1366291 1366303 1366744 1366783) (-840 "OINTDOM.spad" 1366054 1366062 1366217 1366286) (-839 "OFMONOID.spad" 1364193 1364203 1366010 1366015) (-838 "ODVAR.spad" 1363454 1363464 1364183 1364188) (-837 "ODR.spad" 1363098 1363124 1363266 1363415) (-836 "ODPOL.spad" 1360309 1360319 1360649 1360776) (-835 "ODP.spad" 1347808 1347828 1348181 1348280) (-834 "ODETOOLS.spad" 1346457 1346476 1347798 1347803) (-833 "ODESYS.spad" 1344151 1344168 1346447 1346452) (-832 "ODERTRIC.spad" 1340184 1340201 1344108 1344113) (-831 "ODERED.spad" 1339583 1339607 1340174 1340179) (-830 "ODERAT.spad" 1337216 1337233 1339573 1339578) (-829 "ODEPRRIC.spad" 1334309 1334331 1337206 1337211) (-828 "ODEPROB.spad" 1333566 1333574 1334299 1334304) (-827 "ODEPRIM.spad" 1330964 1330986 1333556 1333561) (-826 "ODEPAL.spad" 1330350 1330374 1330954 1330959) (-825 "ODEPACK.spad" 1317080 1317088 1330340 1330345) (-824 "ODEINT.spad" 1316515 1316531 1317070 1317075) (-823 "ODEIFTBL.spad" 1313918 1313926 1316505 1316510) (-822 "ODEEF.spad" 1309413 1309429 1313908 1313913) (-821 "ODECONST.spad" 1308958 1308976 1309403 1309408) (-820 "ODECAT.spad" 1307556 1307564 1308948 1308953) (-819 "OCTCT2.spad" 1307194 1307215 1307546 1307551) (-818 "OCT.spad" 1305282 1305292 1305996 1306035) (-817 "OCAMON.spad" 1305130 1305138 1305272 1305277) (-816 "OC.spad" 1302926 1302936 1305086 1305125) (-815 "OC.spad" 1300444 1300456 1302606 1302611) (-814 "OASGP.spad" 1300259 1300267 1300434 1300439) (-813 "OAMONS.spad" 1299781 1299789 1300249 1300254) (-812 "OAMON.spad" 1299539 1299547 1299771 1299776) (-811 "OAMON.spad" 1299295 1299305 1299529 1299534) (-810 "OAGROUP.spad" 1298833 1298841 1299285 1299290) (-809 "OAGROUP.spad" 1298369 1298379 1298823 1298828) (-808 "NUMTUBE.spad" 1297960 1297976 1298359 1298364) (-807 "NUMQUAD.spad" 1285936 1285944 1297950 1297955) (-806 "NUMODE.spad" 1277288 1277296 1285926 1285931) (-805 "NUMINT.spad" 1274854 1274862 1277278 1277283) (-804 "NUMFMT.spad" 1273694 1273702 1274844 1274849) (-803 "NUMERIC.spad" 1265808 1265818 1273499 1273504) (-802 "NTSCAT.spad" 1264316 1264332 1265776 1265803) (-801 "NTPOLFN.spad" 1263861 1263871 1264227 1264232) (-800 "NSUP2.spad" 1263253 1263265 1263851 1263856) (-799 "NSUP.spad" 1256248 1256258 1260668 1260821) (-798 "NSMP.spad" 1252347 1252366 1252639 1252766) (-797 "NREP.spad" 1250749 1250763 1252337 1252342) (-796 "NPCOEF.spad" 1249995 1250015 1250739 1250744) (-795 "NORMRETR.spad" 1249593 1249632 1249985 1249990) (-794 "NORMPK.spad" 1247535 1247554 1249583 1249588) (-793 "NORMMA.spad" 1247223 1247249 1247525 1247530) (-792 "NONE1.spad" 1246899 1246909 1247213 1247218) (-791 "NONE.spad" 1246640 1246648 1246889 1246894) (-790 "NODE1.spad" 1246127 1246143 1246630 1246635) (-789 "NNI.spad" 1245022 1245030 1246101 1246122) (-788 "NLINSOL.spad" 1243648 1243658 1245012 1245017) (-787 "NIPROB.spad" 1242189 1242197 1243638 1243643) (-786 "NFINTBAS.spad" 1239749 1239766 1242179 1242184) (-785 "NETCLT.spad" 1239723 1239734 1239739 1239744) (-784 "NCODIV.spad" 1237947 1237963 1239713 1239718) (-783 "NCNTFRAC.spad" 1237589 1237603 1237937 1237942) (-782 "NCEP.spad" 1235755 1235769 1237579 1237584) (-781 "NASRING.spad" 1235359 1235367 1235745 1235750) (-780 "NASRING.spad" 1234961 1234971 1235349 1235354) (-779 "NARNG.spad" 1234361 1234369 1234951 1234956) (-778 "NARNG.spad" 1233759 1233769 1234351 1234356) (-777 "NAGSP.spad" 1232836 1232844 1233749 1233754) (-776 "NAGS.spad" 1222553 1222561 1232826 1232831) (-775 "NAGF07.spad" 1220984 1220992 1222543 1222548) (-774 "NAGF04.spad" 1215386 1215394 1220974 1220979) (-773 "NAGF02.spad" 1209479 1209487 1215376 1215381) (-772 "NAGF01.spad" 1205248 1205256 1209469 1209474) (-771 "NAGE04.spad" 1198956 1198964 1205238 1205243) (-770 "NAGE02.spad" 1189608 1189616 1198946 1198951) (-769 "NAGE01.spad" 1185602 1185610 1189598 1189603) (-768 "NAGD03.spad" 1183598 1183606 1185592 1185597) (-767 "NAGD02.spad" 1176329 1176337 1183588 1183593) (-766 "NAGD01.spad" 1170614 1170622 1176319 1176324) (-765 "NAGC06.spad" 1166481 1166489 1170604 1170609) (-764 "NAGC05.spad" 1164974 1164982 1166471 1166476) (-763 "NAGC02.spad" 1164249 1164257 1164964 1164969) (-762 "NAALG.spad" 1163814 1163824 1164217 1164244) (-761 "NAALG.spad" 1163399 1163411 1163804 1163809) (-760 "MULTSQFR.spad" 1160357 1160374 1163389 1163394) (-759 "MULTFACT.spad" 1159740 1159757 1160347 1160352) (-758 "MTSCAT.spad" 1157834 1157855 1159638 1159735) (-757 "MTHING.spad" 1157493 1157503 1157824 1157829) (-756 "MSYSCMD.spad" 1156927 1156935 1157483 1157488) (-755 "MSETAGG.spad" 1156772 1156782 1156895 1156922) (-754 "MSET.spad" 1154685 1154695 1156433 1156472) (-753 "MRING.spad" 1151662 1151674 1154393 1154460) (-752 "MRF2.spad" 1151224 1151238 1151652 1151657) (-751 "MRATFAC.spad" 1150770 1150787 1151214 1151219) (-750 "MPRFF.spad" 1148810 1148829 1150760 1150765) (-749 "MPOLY.spad" 1146209 1146224 1146568 1146695) (-748 "MPCPF.spad" 1145473 1145492 1146199 1146204) (-747 "MPC3.spad" 1145290 1145330 1145463 1145468) (-746 "MPC2.spad" 1144943 1144976 1145280 1145285) (-745 "MONOTOOL.spad" 1143294 1143311 1144933 1144938) (-744 "MONOID.spad" 1142613 1142621 1143284 1143289) (-743 "MONOID.spad" 1141930 1141940 1142603 1142608) (-742 "MONOGEN.spad" 1140678 1140691 1141790 1141925) (-741 "MONOGEN.spad" 1139448 1139463 1140562 1140567) (-740 "MONADWU.spad" 1137526 1137534 1139438 1139443) (-739 "MONADWU.spad" 1135602 1135612 1137516 1137521) (-738 "MONAD.spad" 1134762 1134770 1135592 1135597) (-737 "MONAD.spad" 1133920 1133930 1134752 1134757) (-736 "MOEBIUS.spad" 1132656 1132670 1133900 1133915) (-735 "MODULE.spad" 1132526 1132536 1132624 1132651) (-734 "MODULE.spad" 1132416 1132428 1132516 1132521) (-733 "MODRING.spad" 1131751 1131790 1132396 1132411) (-732 "MODOP.spad" 1130408 1130420 1131573 1131640) (-731 "MODMONOM.spad" 1130139 1130157 1130398 1130403) (-730 "MODMON.spad" 1126763 1126779 1127482 1127635) (-729 "MODFIELD.spad" 1126125 1126164 1126665 1126758) (-728 "MMLFORM.spad" 1124985 1124993 1126115 1126120) (-727 "MMAP.spad" 1124727 1124761 1124975 1124980) (-726 "MLO.spad" 1123186 1123196 1124683 1124722) (-725 "MLIFT.spad" 1121798 1121815 1123176 1123181) (-724 "MKUCFUNC.spad" 1121333 1121351 1121788 1121793) (-723 "MKRECORD.spad" 1120921 1120934 1121323 1121328) (-722 "MKFUNC.spad" 1120328 1120338 1120911 1120916) (-721 "MKFLCFN.spad" 1119296 1119306 1120318 1120323) (-720 "MKBCFUNC.spad" 1118791 1118809 1119286 1119291) (-719 "MINT.spad" 1118230 1118238 1118693 1118786) (-718 "MHROWRED.spad" 1116741 1116751 1118220 1118225) (-717 "MFLOAT.spad" 1115261 1115269 1116631 1116736) (-716 "MFINFACT.spad" 1114661 1114683 1115251 1115256) (-715 "MESH.spad" 1112456 1112464 1114651 1114656) (-714 "MDDFACT.spad" 1110675 1110685 1112446 1112451) (-713 "MDAGG.spad" 1109966 1109976 1110655 1110670) (-712 "MCMPLX.spad" 1105331 1105339 1105945 1106146) (-711 "MCDEN.spad" 1104541 1104553 1105321 1105326) (-710 "MCALCFN.spad" 1101639 1101665 1104531 1104536) (-709 "MAYBE.spad" 1100939 1100950 1101629 1101634) (-708 "MATSTOR.spad" 1098255 1098265 1100929 1100934) (-707 "MATRIX.spad" 1096821 1096831 1097305 1097332) (-706 "MATLIN.spad" 1094189 1094213 1096705 1096710) (-705 "MATCAT2.spad" 1093471 1093519 1094179 1094184) (-704 "MATCAT.spad" 1085033 1085055 1093439 1093466) (-703 "MATCAT.spad" 1076467 1076491 1084875 1084880) (-702 "MAPPKG3.spad" 1075382 1075396 1076457 1076462) (-701 "MAPPKG2.spad" 1074720 1074732 1075372 1075377) (-700 "MAPPKG1.spad" 1073548 1073558 1074710 1074715) (-699 "MAPPAST.spad" 1072887 1072895 1073538 1073543) (-698 "MAPHACK3.spad" 1072699 1072713 1072877 1072882) (-697 "MAPHACK2.spad" 1072468 1072480 1072689 1072694) (-696 "MAPHACK1.spad" 1072112 1072122 1072458 1072463) (-695 "MAGMA.spad" 1069918 1069935 1072102 1072107) (-694 "MACROAST.spad" 1069513 1069521 1069908 1069913) (-693 "M3D.spad" 1067098 1067108 1068756 1068761) (-692 "LZSTAGG.spad" 1064352 1064362 1067088 1067093) (-691 "LZSTAGG.spad" 1061604 1061616 1064342 1064347) (-690 "LWORD.spad" 1058349 1058366 1061594 1061599) (-689 "LSTAST.spad" 1058133 1058141 1058339 1058344) (-688 "LSQM.spad" 1056242 1056256 1056636 1056687) (-687 "LSPP.spad" 1055777 1055794 1056232 1056237) (-686 "LSMP1.spad" 1053620 1053634 1055767 1055772) (-685 "LSMP.spad" 1052477 1052505 1053610 1053615) (-684 "LSAGG.spad" 1052146 1052156 1052445 1052472) (-683 "LSAGG.spad" 1051835 1051847 1052136 1052141) (-682 "LPOLY.spad" 1050797 1050816 1051691 1051760) (-681 "LPEFRAC.spad" 1050068 1050078 1050787 1050792) (-680 "LOGIC.spad" 1049670 1049678 1050058 1050063) (-679 "LOGIC.spad" 1049270 1049280 1049660 1049665) (-678 "LODOOPS.spad" 1048200 1048212 1049260 1049265) (-677 "LODOF.spad" 1047246 1047263 1048157 1048162) (-676 "LODOCAT.spad" 1045912 1045922 1047202 1047241) (-675 "LODOCAT.spad" 1044576 1044588 1045868 1045873) (-674 "LODO2.spad" 1043840 1043852 1044247 1044286) (-673 "LODO1.spad" 1043231 1043241 1043511 1043550) (-672 "LODO.spad" 1042606 1042622 1042902 1042941) (-671 "LODEEF.spad" 1041408 1041426 1042596 1042601) (-670 "LO.spad" 1040809 1040823 1041342 1041369) (-669 "LNAGG.spad" 1036996 1037006 1040799 1040804) (-668 "LNAGG.spad" 1033147 1033159 1036952 1036957) (-667 "LMOPS.spad" 1029915 1029932 1033137 1033142) (-666 "LMODULE.spad" 1029699 1029709 1029905 1029910) (-665 "LMDICT.spad" 1028870 1028880 1029118 1029145) (-664 "LLINSET.spad" 1028577 1028587 1028860 1028865) (-663 "LITERAL.spad" 1028483 1028494 1028567 1028572) (-662 "LIST3.spad" 1027794 1027808 1028473 1028478) (-661 "LIST2MAP.spad" 1024721 1024733 1027784 1027789) (-660 "LIST2.spad" 1023423 1023435 1024711 1024716) (-659 "LIST.spad" 1021089 1021099 1022432 1022459) (-658 "LINSET.spad" 1020868 1020878 1021079 1021084) (-657 "LINFORM.spad" 1020331 1020343 1020836 1020863) (-656 "LINEXP.spad" 1019074 1019084 1020321 1020326) (-655 "LINELT.spad" 1018445 1018457 1018957 1018984) (-654 "LINDEP.spad" 1017294 1017306 1018357 1018362) (-653 "LINBASIS.spad" 1016930 1016945 1017284 1017289) (-652 "LIMITRF.spad" 1014877 1014887 1016920 1016925) (-651 "LIMITPS.spad" 1013787 1013800 1014867 1014872) (-650 "LIECAT.spad" 1013271 1013281 1013713 1013782) (-649 "LIECAT.spad" 1012783 1012795 1013227 1013232) (-648 "LIE.spad" 1010778 1010790 1012052 1012197) (-647 "LIB.spad" 1008493 1008501 1008939 1008954) (-646 "LGROBP.spad" 1005846 1005865 1008483 1008488) (-645 "LFCAT.spad" 1004905 1004913 1005836 1005841) (-644 "LF.spad" 1003860 1003876 1004895 1004900) (-643 "LEXTRIPK.spad" 999483 999498 1003850 1003855) (-642 "LEXP.spad" 997502 997529 999463 999478) (-641 "LETAST.spad" 997201 997209 997492 997497) (-640 "LEADCDET.spad" 995607 995624 997191 997196) (-639 "LAZM3PK.spad" 994351 994373 995597 995602) (-638 "LAUPOL.spad" 992936 992949 993836 993905) (-637 "LAPLACE.spad" 992519 992535 992926 992931) (-636 "LALG.spad" 992295 992305 992499 992514) (-635 "LALG.spad" 992079 992091 992285 992290) (-634 "LA.spad" 991519 991533 992001 992040) (-633 "KVTFROM.spad" 991262 991272 991509 991514) (-632 "KTVLOGIC.spad" 990806 990814 991252 991257) (-631 "KRCFROM.spad" 990552 990562 990796 990801) (-630 "KOVACIC.spad" 989283 989300 990542 990547) (-629 "KONVERT.spad" 989005 989015 989273 989278) (-628 "KOERCE.spad" 988742 988752 988995 989000) (-627 "KERNEL2.spad" 988445 988457 988732 988737) (-626 "KERNEL.spad" 987085 987095 988214 988219) (-625 "KDAGG.spad" 986194 986216 987065 987080) (-624 "KDAGG.spad" 985311 985335 986184 986189) (-623 "KAFILE.spad" 984141 984157 984376 984403) (-622 "JVMOP.spad" 984054 984062 984131 984136) (-621 "JVMMDACC.spad" 983108 983116 984044 984049) (-620 "JVMFDACC.spad" 982424 982432 983098 983103) (-619 "JVMCSTTG.spad" 981153 981161 982414 982419) (-618 "JVMCFACC.spad" 980599 980607 981143 981148) (-617 "JVMBCODE.spad" 980510 980518 980589 980594) (-616 "JORDAN.spad" 978318 978330 979779 979924) (-615 "JOINAST.spad" 978020 978028 978308 978313) (-614 "IXAGG.spad" 976153 976177 978010 978015) (-613 "IXAGG.spad" 974141 974167 976000 976005) (-612 "IVECTOR.spad" 972737 972752 972892 972919) (-611 "ITUPLE.spad" 971913 971923 972727 972732) (-610 "ITRIGMNP.spad" 970760 970779 971903 971908) (-609 "ITFUN3.spad" 970266 970280 970750 970755) (-608 "ITFUN2.spad" 970010 970022 970256 970261) (-607 "ITFORM.spad" 969365 969373 970000 970005) (-606 "ITAYLOR.spad" 967359 967374 969229 969326) (-605 "ISUPS.spad" 959757 959772 966294 966391) (-604 "ISUMP.spad" 959258 959274 959747 959752) (-603 "ISAST.spad" 958977 958985 959248 959253) (-602 "IRURPK.spad" 957694 957713 958967 958972) (-601 "IRSN.spad" 955698 955706 957684 957689) (-600 "IRRF2F.spad" 954191 954201 955654 955659) (-599 "IRREDFFX.spad" 953792 953803 954181 954186) (-598 "IROOT.spad" 952131 952141 953782 953787) (-597 "IRFORM.spad" 951455 951463 952121 952126) (-596 "IR2F.spad" 950669 950685 951445 951450) (-595 "IR2.spad" 949697 949713 950659 950664) (-594 "IR.spad" 947500 947514 949546 949573) (-593 "IPRNTPK.spad" 947260 947268 947490 947495) (-592 "IPF.spad" 946825 946837 947065 947158) (-591 "IPADIC.spad" 946594 946620 946751 946820) (-590 "IP4ADDR.spad" 946151 946159 946584 946589) (-589 "IOMODE.spad" 945673 945681 946141 946146) (-588 "IOBFILE.spad" 945058 945066 945663 945668) (-587 "IOBCON.spad" 944923 944931 945048 945053) (-586 "INVLAPLA.spad" 944572 944588 944913 944918) (-585 "INTTR.spad" 937966 937983 944562 944567) (-584 "INTTOOLS.spad" 935709 935725 937528 937533) (-583 "INTSLPE.spad" 935037 935045 935699 935704) (-582 "INTRVL.spad" 934603 934613 934951 935032) (-581 "INTRF.spad" 933035 933049 934593 934598) (-580 "INTRET.spad" 932467 932477 933025 933030) (-579 "INTRAT.spad" 931202 931219 932457 932462) (-578 "INTPM.spad" 929569 929585 930827 930832) (-577 "INTPAF.spad" 927445 927463 929498 929503) (-576 "INTPACK.spad" 918011 918019 927435 927440) (-575 "INTHERTR.spad" 917285 917302 918001 918006) (-574 "INTHERAL.spad" 916955 916979 917275 917280) (-573 "INTHEORY.spad" 913394 913402 916945 916950) (-572 "INTG0.spad" 907158 907176 913323 913328) (-571 "INTFTBL.spad" 902612 902620 907148 907153) (-570 "INTFACT.spad" 901679 901689 902602 902607) (-569 "INTEF.spad" 900090 900106 901669 901674) (-568 "INTDOM.spad" 898713 898721 900016 900085) (-567 "INTDOM.spad" 897398 897408 898703 898708) (-566 "INTCAT.spad" 895665 895675 897312 897393) (-565 "INTBIT.spad" 895172 895180 895655 895660) (-564 "INTALG.spad" 894360 894387 895162 895167) (-563 "INTAF.spad" 893860 893876 894350 894355) (-562 "INTABL.spad" 891900 891931 892063 892090) (-561 "INT8.spad" 891780 891788 891890 891895) (-560 "INT64.spad" 891659 891667 891770 891775) (-559 "INT32.spad" 891538 891546 891649 891654) (-558 "INT16.spad" 891417 891425 891528 891533) (-557 "INT.spad" 890943 890951 891283 891412) (-556 "INS.spad" 888446 888454 890845 890938) (-555 "INS.spad" 886035 886045 888436 888441) (-554 "INPSIGN.spad" 885505 885518 886025 886030) (-553 "INPRODPF.spad" 884601 884620 885495 885500) (-552 "INPRODFF.spad" 883689 883713 884591 884596) (-551 "INNMFACT.spad" 882664 882681 883679 883684) (-550 "INMODGCD.spad" 882168 882198 882654 882659) (-549 "INFSP.spad" 880465 880487 882158 882163) (-548 "INFPROD0.spad" 879545 879564 880455 880460) (-547 "INFORM1.spad" 879170 879180 879535 879540) (-546 "INFORM.spad" 876377 876385 879160 879165) (-545 "INFINITY.spad" 875929 875937 876367 876372) (-544 "INETCLTS.spad" 875906 875914 875919 875924) (-543 "INEP.spad" 874452 874474 875896 875901) (-542 "INDE.spad" 874101 874118 874362 874367) (-541 "INCRMAPS.spad" 873538 873548 874091 874096) (-540 "INBFILE.spad" 872634 872642 873528 873533) (-539 "INBFF.spad" 868484 868495 872624 872629) (-538 "INBCON.spad" 866750 866758 868474 868479) (-537 "INBCON.spad" 865014 865024 866740 866745) (-536 "INAST.spad" 864675 864683 865004 865009) (-535 "IMPTAST.spad" 864383 864391 864665 864670) (-534 "IMATRIX.spad" 863199 863225 863711 863738) (-533 "IMATQF.spad" 862293 862337 863155 863160) (-532 "IMATLIN.spad" 860914 860938 862249 862254) (-531 "IIARRAY2.spad" 860189 860227 860392 860419) (-530 "IFF.spad" 859599 859615 859870 859963) (-529 "IFAST.spad" 859213 859221 859589 859594) (-528 "IFARRAY.spad" 856524 856539 858222 858249) (-527 "IFAMON.spad" 856386 856403 856480 856485) (-526 "IEVALAB.spad" 855799 855811 856376 856381) (-525 "IEVALAB.spad" 855210 855224 855789 855794) (-524 "IDPOAMS.spad" 854888 854900 855122 855127) (-523 "IDPOAM.spad" 854530 854542 854800 854805) (-522 "IDPO.spad" 854265 854277 854442 854447) (-521 "IDPC.spad" 852994 853006 854255 854260) (-520 "IDPAM.spad" 852661 852673 852906 852911) (-519 "IDPAG.spad" 852330 852342 852573 852578) (-518 "IDENT.spad" 851982 851990 852320 852325) (-517 "IDECOMP.spad" 849221 849239 851972 851977) (-516 "IDEAL.spad" 844167 844206 849153 849158) (-515 "ICDEN.spad" 843380 843396 844157 844162) (-514 "ICARD.spad" 842571 842579 843370 843375) (-513 "IBPTOOLS.spad" 841178 841195 842561 842566) (-512 "IBITS.spad" 840334 840347 840767 840794) (-511 "IBATOOL.spad" 837319 837338 840324 840329) (-510 "IBACHIN.spad" 835826 835841 837309 837314) (-509 "IARRAY2.spad" 834693 834719 835304 835331) (-508 "IARRAY1.spad" 833556 833571 833702 833729) (-507 "IAN.spad" 831776 831784 833369 833462) (-506 "IALGFACT.spad" 831387 831420 831766 831771) (-505 "HYPCAT.spad" 830811 830819 831377 831382) (-504 "HYPCAT.spad" 830233 830243 830801 830806) (-503 "HOSTNAME.spad" 830049 830057 830223 830228) (-502 "HOMOTOP.spad" 829792 829802 830039 830044) (-501 "HOAGG.spad" 827074 827084 829782 829787) (-500 "HOAGG.spad" 824089 824101 826799 826804) (-499 "HEXADEC.spad" 822049 822057 822414 822507) (-498 "HEUGCD.spad" 821140 821151 822039 822044) (-497 "HELLFDIV.spad" 820746 820770 821130 821135) (-496 "HEAP.spad" 820009 820019 820224 820251) (-495 "HEADAST.spad" 819550 819558 819999 820004) (-494 "HDP.spad" 807045 807061 807422 807521) (-493 "HDMP.spad" 804187 804202 804803 804930) (-492 "HB.spad" 802462 802470 804177 804182) (-491 "HASHTBL.spad" 800454 800485 800665 800692) (-490 "HASAST.spad" 800170 800178 800444 800449) (-489 "HACKPI.spad" 799661 799669 800072 800165) (-488 "GTSET.spad" 798555 798571 799262 799289) (-487 "GSTBL.spad" 796596 796631 796770 796785) (-486 "GSERIES.spad" 793828 793855 794647 794796) (-485 "GROUP.spad" 793101 793109 793808 793823) (-484 "GROUP.spad" 792382 792392 793091 793096) (-483 "GROEBSOL.spad" 790876 790897 792372 792377) (-482 "GRMOD.spad" 789455 789467 790866 790871) (-481 "GRMOD.spad" 788032 788046 789445 789450) (-480 "GRIMAGE.spad" 780945 780953 788022 788027) (-479 "GRDEF.spad" 779324 779332 780935 780940) (-478 "GRAY.spad" 777795 777803 779314 779319) (-477 "GRALG.spad" 776888 776900 777785 777790) (-476 "GRALG.spad" 775979 775993 776878 776883) (-475 "GPOLSET.spad" 775404 775427 775616 775643) (-474 "GOSPER.spad" 774681 774699 775394 775399) (-473 "GMODPOL.spad" 773829 773856 774649 774676) (-472 "GHENSEL.spad" 772912 772926 773819 773824) (-471 "GENUPS.spad" 769205 769218 772902 772907) (-470 "GENUFACT.spad" 768782 768792 769195 769200) (-469 "GENPGCD.spad" 768384 768401 768772 768777) (-468 "GENMFACT.spad" 767836 767855 768374 768379) (-467 "GENEEZ.spad" 765795 765808 767826 767831) (-466 "GDMP.spad" 762779 762796 763553 763680) (-465 "GCNAALG.spad" 756702 756729 762573 762640) (-464 "GCDDOM.spad" 755894 755902 756628 756697) (-463 "GCDDOM.spad" 755148 755158 755884 755889) (-462 "GBINTERN.spad" 751168 751206 755138 755143) (-461 "GBF.spad" 746951 746989 751158 751163) (-460 "GBEUCLID.spad" 744833 744871 746941 746946) (-459 "GB.spad" 742359 742397 744789 744794) (-458 "GAUSSFAC.spad" 741672 741680 742349 742354) (-457 "GALUTIL.spad" 739998 740008 741628 741633) (-456 "GALPOLYU.spad" 738452 738465 739988 739993) (-455 "GALFACTU.spad" 736665 736684 738442 738447) (-454 "GALFACT.spad" 726878 726889 736655 736660) (-453 "FVFUN.spad" 723901 723909 726868 726873) (-452 "FVC.spad" 722953 722961 723891 723896) (-451 "FUNDESC.spad" 722631 722639 722943 722948) (-450 "FUNCTION.spad" 722480 722492 722621 722626) (-449 "FTEM.spad" 721645 721653 722470 722475) (-448 "FT.spad" 719945 719953 721635 721640) (-447 "FSUPFACT.spad" 718842 718861 719878 719883) (-446 "FST.spad" 716928 716936 718832 718837) (-445 "FSRED.spad" 716408 716424 716918 716923) (-444 "FSPRMELT.spad" 715274 715290 716365 716370) (-443 "FSPECF.spad" 713365 713381 715264 715269) (-442 "FSINT.spad" 713025 713041 713355 713360) (-441 "FSERIES.spad" 712216 712228 712845 712944) (-440 "FSCINT.spad" 711533 711549 712206 712211) (-439 "FSAGG2.spad" 710268 710284 711523 711528) (-438 "FSAGG.spad" 709385 709395 710224 710263) (-437 "FSAGG.spad" 708464 708476 709305 709310) (-436 "FS2UPS.spad" 702979 703013 708454 708459) (-435 "FS2EXPXP.spad" 702120 702143 702969 702974) (-434 "FS2.spad" 701775 701791 702110 702115) (-433 "FS.spad" 696043 696053 701550 701770) (-432 "FS.spad" 690083 690095 695592 695597) (-431 "FRUTIL.spad" 689037 689047 690073 690078) (-430 "FRNAALG.spad" 684314 684324 688979 689032) (-429 "FRNAALG.spad" 679603 679615 684270 684275) (-428 "FRNAAF2.spad" 679051 679069 679593 679598) (-427 "FRMOD.spad" 678458 678488 678979 678984) (-426 "FRIDEAL2.spad" 678062 678094 678448 678453) (-425 "FRIDEAL.spad" 677287 677308 678042 678057) (-424 "FRETRCT.spad" 676806 676816 677277 677282) (-423 "FRETRCT.spad" 676182 676194 676655 676660) (-422 "FRAMALG.spad" 674562 674575 676138 676177) (-421 "FRAMALG.spad" 672974 672989 674552 674557) (-420 "FRAC2.spad" 672579 672591 672964 672969) (-419 "FRAC.spad" 670365 670375 670752 670925) (-418 "FR2.spad" 669701 669713 670355 670360) (-417 "FR.spad" 663323 663333 668596 668665) (-416 "FPS.spad" 660162 660170 663213 663318) (-415 "FPS.spad" 657029 657039 660082 660087) (-414 "FPC.spad" 656075 656083 656931 657024) (-413 "FPC.spad" 655207 655217 656065 656070) (-412 "FPATMAB.spad" 654969 654979 655197 655202) (-411 "FPARFRAC.spad" 653811 653828 654959 654964) (-410 "FORTRAN.spad" 652317 652360 653801 653806) (-409 "FORTFN.spad" 649487 649495 652307 652312) (-408 "FORTCAT.spad" 649171 649179 649477 649482) (-407 "FORT.spad" 648120 648128 649161 649166) (-406 "FORDER.spad" 647811 647835 648110 648115) (-405 "FOP.spad" 647012 647020 647801 647806) (-404 "FNLA.spad" 646436 646458 646980 647007) (-403 "FNCAT.spad" 645031 645039 646426 646431) (-402 "FNAME.spad" 644923 644931 645021 645026) (-401 "FMTC.spad" 644721 644729 644849 644918) (-400 "FMONOID.spad" 644402 644412 644677 644682) (-399 "FMONCAT.spad" 641571 641581 644392 644397) (-398 "FMFUN.spad" 638601 638609 641561 641566) (-397 "FMCAT.spad" 636277 636295 638569 638596) (-396 "FMC.spad" 635329 635337 636267 636272) (-395 "FM1.spad" 634694 634706 635263 635290) (-394 "FM.spad" 634309 634321 634548 634575) (-393 "FLOATRP.spad" 632052 632066 634299 634304) (-392 "FLOATCP.spad" 629491 629505 632042 632047) (-391 "FLOAT.spad" 622805 622813 629357 629486) (-390 "FLINEXP.spad" 622527 622537 622795 622800) (-389 "FLINEXP.spad" 622190 622202 622460 622465) (-388 "FLASORT.spad" 621516 621528 622180 622185) (-387 "FLALG.spad" 619186 619205 621442 621511) (-386 "FLAGG2.spad" 617903 617919 619176 619181) (-385 "FLAGG.spad" 614969 614979 617883 617898) (-384 "FLAGG.spad" 611936 611948 614852 614857) (-383 "FINRALG.spad" 610021 610034 611892 611931) (-382 "FINRALG.spad" 608032 608047 609905 609910) (-381 "FINITE.spad" 607184 607192 608022 608027) (-380 "FINAALG.spad" 596369 596379 607126 607179) (-379 "FINAALG.spad" 585566 585578 596325 596330) (-378 "FILECAT.spad" 584100 584117 585556 585561) (-377 "FILE.spad" 583683 583693 584090 584095) (-376 "FIELD.spad" 583089 583097 583585 583678) (-375 "FIELD.spad" 582581 582591 583079 583084) (-374 "FGROUP.spad" 581244 581254 582561 582576) (-373 "FGLMICPK.spad" 580039 580054 581234 581239) (-372 "FFX.spad" 579422 579437 579755 579848) (-371 "FFSLPE.spad" 578933 578954 579412 579417) (-370 "FFPOLY2.spad" 577993 578010 578923 578928) (-369 "FFPOLY.spad" 569335 569346 577983 577988) (-368 "FFP.spad" 568740 568760 569051 569144) (-367 "FFNBX.spad" 567260 567280 568456 568549) (-366 "FFNBP.spad" 565781 565798 566976 567069) (-365 "FFNB.spad" 564246 564267 565462 565555) (-364 "FFINTBAS.spad" 561760 561779 564236 564241) (-363 "FFIELDC.spad" 559345 559353 561662 561755) (-362 "FFIELDC.spad" 557016 557026 559335 559340) (-361 "FFHOM.spad" 555788 555805 557006 557011) (-360 "FFF.spad" 553231 553242 555778 555783) (-359 "FFCGX.spad" 552086 552106 552947 553040) (-358 "FFCGP.spad" 550983 551003 551802 551895) (-357 "FFCG.spad" 549775 549796 550664 550757) (-356 "FFCAT2.spad" 549522 549562 549765 549770) (-355 "FFCAT.spad" 542687 542709 549361 549517) (-354 "FFCAT.spad" 535931 535955 542607 542612) (-353 "FF.spad" 535379 535395 535612 535705) (-352 "FEXPR.spad" 527079 527125 535126 535165) (-351 "FEVALAB.spad" 526787 526797 527069 527074) (-350 "FEVALAB.spad" 526271 526283 526555 526560) (-349 "FDIVCAT.spad" 524367 524391 526261 526266) (-348 "FDIVCAT.spad" 522461 522487 524357 524362) (-347 "FDIV2.spad" 522117 522157 522451 522456) (-346 "FDIV.spad" 521575 521599 522107 522112) (-345 "FCTRDATA.spad" 520583 520591 521565 521570) (-344 "FCPAK1.spad" 519118 519126 520573 520578) (-343 "FCOMP.spad" 518497 518507 519108 519113) (-342 "FC.spad" 508504 508512 518487 518492) (-341 "FAXF.spad" 501539 501553 508406 508499) (-340 "FAXF.spad" 494626 494642 501495 501500) (-339 "FARRAY.spad" 492602 492612 493635 493662) (-338 "FAMR.spad" 490746 490758 492500 492597) (-337 "FAMR.spad" 488874 488888 490630 490635) (-336 "FAMONOID.spad" 488558 488568 488828 488833) (-335 "FAMONC.spad" 486878 486890 488548 488553) (-334 "FAGROUP.spad" 486518 486528 486774 486801) (-333 "FACUTIL.spad" 484730 484747 486508 486513) (-332 "FACTFUNC.spad" 483932 483942 484720 484725) (-331 "EXPUPXS.spad" 480684 480707 481983 482132) (-330 "EXPRTUBE.spad" 477972 477980 480674 480679) (-329 "EXPRODE.spad" 475140 475156 477962 477967) (-328 "EXPR2UPS.spad" 471262 471275 475130 475135) (-327 "EXPR2.spad" 470967 470979 471252 471257) (-326 "EXPR.spad" 466052 466062 466766 467061) (-325 "EXPEXPAN.spad" 462796 462821 463428 463521) (-324 "EXITAST.spad" 462532 462540 462786 462791) (-323 "EXIT.spad" 462203 462211 462522 462527) (-322 "EVALCYC.spad" 461663 461677 462193 462198) (-321 "EVALAB.spad" 461243 461253 461653 461658) (-320 "EVALAB.spad" 460821 460833 461233 461238) (-319 "EUCDOM.spad" 458411 458419 460747 460816) (-318 "EUCDOM.spad" 456063 456073 458401 458406) (-317 "ESTOOLS2.spad" 455658 455672 456053 456058) (-316 "ESTOOLS1.spad" 455335 455346 455648 455653) (-315 "ESTOOLS.spad" 447213 447221 455325 455330) (-314 "ESCONT1.spad" 446954 446966 447203 447208) (-313 "ESCONT.spad" 443747 443755 446944 446949) (-312 "ES2.spad" 443260 443276 443737 443742) (-311 "ES1.spad" 442830 442846 443250 443255) (-310 "ES.spad" 435701 435709 442820 442825) (-309 "ES.spad" 428475 428485 435596 435601) (-308 "ERROR.spad" 425802 425810 428465 428470) (-307 "EQTBL.spad" 423796 423818 424005 424032) (-306 "EQ2.spad" 423514 423526 423786 423791) (-305 "EQ.spad" 418290 418300 421085 421197) (-304 "EP.spad" 414616 414626 418280 418285) (-303 "ENV.spad" 413294 413302 414606 414611) (-302 "ENTIRER.spad" 412962 412970 413238 413289) (-301 "EMR.spad" 412250 412291 412888 412957) (-300 "ELTAGG.spad" 410504 410523 412240 412245) (-299 "ELTAGG.spad" 408722 408743 410460 410465) (-298 "ELTAB.spad" 408197 408210 408712 408717) (-297 "ELFUTS.spad" 407632 407651 408187 408192) (-296 "ELEMFUN.spad" 407321 407329 407622 407627) (-295 "ELEMFUN.spad" 407008 407018 407311 407316) (-294 "ELAGG.spad" 404979 404989 406988 407003) (-293 "ELAGG.spad" 402887 402899 404898 404903) (-292 "ELABOR.spad" 402233 402241 402877 402882) (-291 "ELABEXPR.spad" 401165 401173 402223 402228) (-290 "EFUPXS.spad" 397941 397971 401121 401126) (-289 "EFULS.spad" 394777 394800 397897 397902) (-288 "EFSTRUC.spad" 392792 392808 394767 394772) (-287 "EF.spad" 387568 387584 392782 392787) (-286 "EAB.spad" 385868 385876 387558 387563) (-285 "E04UCFA.spad" 385404 385412 385858 385863) (-284 "E04NAFA.spad" 384981 384989 385394 385399) (-283 "E04MBFA.spad" 384561 384569 384971 384976) (-282 "E04JAFA.spad" 384097 384105 384551 384556) (-281 "E04GCFA.spad" 383633 383641 384087 384092) (-280 "E04FDFA.spad" 383169 383177 383623 383628) (-279 "E04DGFA.spad" 382705 382713 383159 383164) (-278 "E04AGNT.spad" 378579 378587 382695 382700) (-277 "DVARCAT.spad" 375469 375479 378569 378574) (-276 "DVARCAT.spad" 372357 372369 375459 375464) (-275 "DSMP.spad" 369653 369667 369958 370085) (-274 "DSEXT.spad" 368955 368965 369643 369648) (-273 "DSEXT.spad" 368161 368173 368851 368856) (-272 "DROPT1.spad" 367826 367836 368151 368156) (-271 "DROPT0.spad" 362691 362699 367816 367821) (-270 "DROPT.spad" 356650 356658 362681 362686) (-269 "DRAWPT.spad" 354823 354831 356640 356645) (-268 "DRAWHACK.spad" 354131 354141 354813 354818) (-267 "DRAWCX.spad" 351609 351617 354121 354126) (-266 "DRAWCURV.spad" 351156 351171 351599 351604) (-265 "DRAWCFUN.spad" 340688 340696 351146 351151) (-264 "DRAW.spad" 333564 333577 340678 340683) (-263 "DQAGG.spad" 331742 331752 333532 333559) (-262 "DPOLCAT.spad" 327099 327115 331610 331737) (-261 "DPOLCAT.spad" 322542 322560 327055 327060) (-260 "DPMO.spad" 314065 314081 314203 314416) (-259 "DPMM.spad" 305601 305619 305726 305939) (-258 "DOMTMPLT.spad" 305372 305380 305591 305596) (-257 "DOMCTOR.spad" 305127 305135 305362 305367) (-256 "DOMAIN.spad" 304238 304246 305117 305122) (-255 "DMP.spad" 301426 301441 301996 302123) (-254 "DMEXT.spad" 301293 301303 301394 301421) (-253 "DLP.spad" 300653 300663 301283 301288) (-252 "DLIST.spad" 299058 299068 299662 299689) (-251 "DLAGG.spad" 297475 297485 299048 299053) (-250 "DIVRING.spad" 297017 297025 297419 297470) (-249 "DIVRING.spad" 296603 296613 297007 297012) (-248 "DISPLAY.spad" 294793 294801 296593 296598) (-247 "DIRPROD2.spad" 293611 293629 294783 294788) (-246 "DIRPROD.spad" 280843 280859 281483 281582) (-245 "DIRPCAT.spad" 280036 280052 280739 280838) (-244 "DIRPCAT.spad" 278856 278874 279561 279566) (-243 "DIOSP.spad" 277681 277689 278846 278851) (-242 "DIOPS.spad" 276677 276687 277661 277676) (-241 "DIOPS.spad" 275647 275659 276633 276638) (-240 "DIFRING.spad" 275485 275493 275627 275642) (-239 "DIFFSPC.spad" 275064 275072 275475 275480) (-238 "DIFFSPC.spad" 274641 274651 275054 275059) (-237 "DIFFMOD.spad" 274130 274140 274609 274636) (-236 "DIFFDOM.spad" 273295 273306 274120 274125) (-235 "DIFFDOM.spad" 272458 272471 273285 273290) (-234 "DIFEXT.spad" 272277 272287 272438 272453) (-233 "DIAGG.spad" 271907 271917 272257 272272) (-232 "DIAGG.spad" 271545 271557 271897 271902) (-231 "DHMATRIX.spad" 269728 269738 270873 270900) (-230 "DFSFUN.spad" 263368 263376 269718 269723) (-229 "DFLOAT.spad" 259975 259983 263258 263363) (-228 "DFINTTLS.spad" 258206 258222 259965 259970) (-227 "DERHAM.spad" 256120 256152 258186 258201) (-226 "DEQUEUE.spad" 255315 255325 255598 255625) (-225 "DEGRED.spad" 254932 254946 255305 255310) (-224 "DEFINTRF.spad" 252514 252524 254922 254927) (-223 "DEFINTEF.spad" 251052 251068 252504 252509) (-222 "DEFAST.spad" 250436 250444 251042 251047) (-221 "DECIMAL.spad" 248400 248408 248761 248854) (-220 "DDFACT.spad" 246221 246238 248390 248395) (-219 "DBLRESP.spad" 245821 245845 246211 246216) (-218 "DBASIS.spad" 245447 245462 245811 245816) (-217 "DBASE.spad" 244111 244121 245437 245442) (-216 "DATAARY.spad" 243597 243610 244101 244106) (-215 "D03FAFA.spad" 243425 243433 243587 243592) (-214 "D03EEFA.spad" 243245 243253 243415 243420) (-213 "D03AGNT.spad" 242331 242339 243235 243240) (-212 "D02EJFA.spad" 241793 241801 242321 242326) (-211 "D02CJFA.spad" 241271 241279 241783 241788) (-210 "D02BHFA.spad" 240761 240769 241261 241266) (-209 "D02BBFA.spad" 240251 240259 240751 240756) (-208 "D02AGNT.spad" 235121 235129 240241 240246) (-207 "D01WGTS.spad" 233440 233448 235111 235116) (-206 "D01TRNS.spad" 233417 233425 233430 233435) (-205 "D01GBFA.spad" 232939 232947 233407 233412) (-204 "D01FCFA.spad" 232461 232469 232929 232934) (-203 "D01ASFA.spad" 231929 231937 232451 232456) (-202 "D01AQFA.spad" 231383 231391 231919 231924) (-201 "D01APFA.spad" 230823 230831 231373 231378) (-200 "D01ANFA.spad" 230317 230325 230813 230818) (-199 "D01AMFA.spad" 229827 229835 230307 230312) (-198 "D01ALFA.spad" 229367 229375 229817 229822) (-197 "D01AKFA.spad" 228893 228901 229357 229362) (-196 "D01AJFA.spad" 228416 228424 228883 228888) (-195 "D01AGNT.spad" 224483 224491 228406 228411) (-194 "CYCLOTOM.spad" 223989 223997 224473 224478) (-193 "CYCLES.spad" 220781 220789 223979 223984) (-192 "CVMP.spad" 220198 220208 220771 220776) (-191 "CTRIGMNP.spad" 218698 218714 220188 220193) (-190 "CTORKIND.spad" 218301 218309 218688 218693) (-189 "CTORCAT.spad" 217542 217550 218291 218296) (-188 "CTORCAT.spad" 216781 216791 217532 217537) (-187 "CTORCALL.spad" 216370 216380 216771 216776) (-186 "CTOR.spad" 216061 216069 216360 216365) (-185 "CSTTOOLS.spad" 215306 215319 216051 216056) (-184 "CRFP.spad" 209078 209091 215296 215301) (-183 "CRCEAST.spad" 208798 208806 209068 209073) (-182 "CRAPACK.spad" 207865 207875 208788 208793) (-181 "CPMATCH.spad" 207366 207381 207787 207792) (-180 "CPIMA.spad" 207071 207090 207356 207361) (-179 "COORDSYS.spad" 202080 202090 207061 207066) (-178 "CONTOUR.spad" 201507 201515 202070 202075) (-177 "CONTFRAC.spad" 197257 197267 201409 201502) (-176 "CONDUIT.spad" 197015 197023 197247 197252) (-175 "COMRING.spad" 196689 196697 196953 197010) (-174 "COMPPROP.spad" 196207 196215 196679 196684) (-173 "COMPLPAT.spad" 195974 195989 196197 196202) (-172 "COMPLEX2.spad" 195689 195701 195964 195969) (-171 "COMPLEX.spad" 191036 191046 191280 191541) (-170 "COMPILER.spad" 190585 190593 191026 191031) (-169 "COMPFACT.spad" 190187 190201 190575 190580) (-168 "COMPCAT.spad" 188259 188269 189921 190182) (-167 "COMPCAT.spad" 186056 186068 187720 187725) (-166 "COMMUPC.spad" 185804 185822 186046 186051) (-165 "COMMONOP.spad" 185337 185345 185794 185799) (-164 "COMMAAST.spad" 185100 185108 185327 185332) (-163 "COMM.spad" 184911 184919 185090 185095) (-162 "COMBOPC.spad" 183834 183842 184901 184906) (-161 "COMBINAT.spad" 182601 182611 183824 183829) (-160 "COMBF.spad" 180023 180039 182591 182596) (-159 "COLOR.spad" 178860 178868 180013 180018) (-158 "COLONAST.spad" 178526 178534 178850 178855) (-157 "CMPLXRT.spad" 178237 178254 178516 178521) (-156 "CLLCTAST.spad" 177899 177907 178227 178232) (-155 "CLIP.spad" 174007 174015 177889 177894) (-154 "CLIF.spad" 172662 172678 173963 174002) (-153 "CLAGG.spad" 169199 169209 172652 172657) (-152 "CLAGG.spad" 165604 165616 169059 169064) (-151 "CINTSLPE.spad" 164959 164972 165594 165599) (-150 "CHVAR.spad" 163097 163119 164949 164954) (-149 "CHARZ.spad" 163012 163020 163077 163092) (-148 "CHARPOL.spad" 162538 162548 163002 163007) (-147 "CHARNZ.spad" 162300 162308 162518 162533) (-146 "CHAR.spad" 159668 159676 162290 162295) (-145 "CFCAT.spad" 158996 159004 159658 159663) (-144 "CDEN.spad" 158216 158230 158986 158991) (-143 "CCLASS.spad" 156312 156320 157574 157613) (-142 "CATEGORY.spad" 155386 155394 156302 156307) (-141 "CATCTOR.spad" 155277 155285 155376 155381) (-140 "CATAST.spad" 154903 154911 155267 155272) (-139 "CASEAST.spad" 154617 154625 154893 154898) (-138 "CARTEN2.spad" 154007 154034 154607 154612) (-137 "CARTEN.spad" 149374 149398 153997 154002) (-136 "CARD.spad" 146669 146677 149348 149369) (-135 "CAPSLAST.spad" 146451 146459 146659 146664) (-134 "CACHSET.spad" 146075 146083 146441 146446) (-133 "CABMON.spad" 145630 145638 146065 146070) (-132 "BYTEORD.spad" 145305 145313 145620 145625) (-131 "BYTEBUF.spad" 143006 143014 144292 144319) (-130 "BYTE.spad" 142481 142489 142996 143001) (-129 "BTREE.spad" 141425 141435 141959 141986) (-128 "BTOURN.spad" 140301 140311 140903 140930) (-127 "BTCAT.spad" 139693 139703 140269 140296) (-126 "BTCAT.spad" 139105 139117 139683 139688) (-125 "BTAGG.spad" 138571 138579 139073 139100) (-124 "BTAGG.spad" 138057 138067 138561 138566) (-123 "BSTREE.spad" 136669 136679 137535 137562) (-122 "BRILL.spad" 134874 134885 136659 136664) (-121 "BRAGG.spad" 133830 133840 134864 134869) (-120 "BRAGG.spad" 132750 132762 133786 133791) (-119 "BPADICRT.spad" 130575 130587 130822 130915) (-118 "BPADIC.spad" 130247 130259 130501 130570) (-117 "BOUNDZRO.spad" 129903 129920 130237 130242) (-116 "BOP1.spad" 127361 127371 129893 129898) (-115 "BOP.spad" 122503 122511 127351 127356) (-114 "BOOLEAN.spad" 122051 122059 122493 122498) (-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 |