diff options
Diffstat (limited to 'src/share/algebra/browse.daase')
| -rw-r--r-- | src/share/algebra/browse.daase | 874 |
1 files changed, 437 insertions, 437 deletions
diff --git a/src/share/algebra/browse.daase b/src/share/algebra/browse.daase index 9c8912b2..92a64920 100644 --- a/src/share/algebra/browse.daase +++ b/src/share/algebra/browse.daase @@ -1,12 +1,12 @@ -(2272506 . 3436193628) +(2273396 . 3437447581) (-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."))) -((-4370 . T) (-4369 . T) (-4284 . T)) +((-4370 . T) (-4369 . T)) NIL (-20 S) ((|constructor| (NIL "The class of abelian groups,{} \\spadignore{i.e.} additive monoids where each element has an additive inverse. \\blankline")) (* (($ (|Integer|) $) "\\spad{n*x} is the product of \\spad{x} by the integer \\spad{n}.")) (- (($ $ $) "\\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}."))) @@ -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(\\spad{yi}) = 0}. The \\spad{yi}\\spad{'s} are expressed in radicals if possible,{} and otherwise as implicit algebraic quantities which display as \\spad{'yi}. The returned symbols \\spad{y1},{}...,{}\\spad{yn} are bound in the interpreter to respective root values.") (((|List| $) $) "\\spad{zerosOf(p)} returns \\spad{[y1,{}...,{}yn]} such that \\spad{p(\\spad{yi}) = 0}. The \\spad{yi}\\spad{'s} are expressed in radicals if possible. The returned symbols \\spad{y1},{}...,{}\\spad{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(\\spad{yi}) = 0}; The returned roots display as \\spad{'y1},{}...,{}\\spad{'yn}. Note: the returned symbols \\spad{y1},{}...,{}\\spad{yn} are bound in the interpreter to respective root values.") (((|List| $) $) "\\spad{rootsOf(p,{} y)} returns \\spad{[y1,{}...,{}yn]} such that \\spad{p(\\spad{yi}) = 0}; Note: the returned symbols \\spad{y1},{}...,{}\\spad{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}."))) -((-4366 . T) (-4364 . T) (-4363 . T) ((-4371 "*") . T) (-4362 . T) (-4367 . T) (-4361 . T) (-4284 . T)) +((-4366 . T) (-4364 . T) (-4363 . T) ((-4371 "*") . T) (-4362 . T) (-4367 . T) (-4361 . 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,7 +56,7 @@ NIL ((|constructor| (NIL "This domain represents the syntax for an add-expression.")) (|body| (((|SpadAst|) $) "base(\\spad{d}) returns the actual body of the add-domain expression \\spad{`d'}.")) (|base| (((|SpadAst|) $) "\\spad{base(d)} returns the base domain(\\spad{s}) of the add-domain expression."))) NIL NIL -(-32 R -3219) +(-32 R -3105) ((|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 -1020) (QUOTE (-553))))) @@ -66,7 +66,7 @@ NIL ((|HasAttribute| |#1| (QUOTE -4369))) (-34) ((|constructor| (NIL "The notion of aggregate serves to model any data structure aggregate,{} designating any collection of objects,{} with heterogenous or homogeneous members,{} with a finite or infinite number of members,{} explicitly or implicitly represented. An aggregate can in principle represent everything from a string of characters to abstract sets such as \"the set of \\spad{x} satisfying relation {\\em r(x)}\" An attribute \\spadatt{finiteAggregate} is used to assert that a domain has a finite number of elements.")) (|#| (((|NonNegativeInteger|) $) "\\spad{\\# u} returns the number of items in \\spad{u}.")) (|sample| (($) "\\spad{sample yields} a value of type \\%")) (|size?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{size?(u,{}n)} tests if \\spad{u} has exactly \\spad{n} elements.")) (|more?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{more?(u,{}n)} tests if \\spad{u} has greater than \\spad{n} elements.")) (|less?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{less?(u,{}n)} tests if \\spad{u} has less than \\spad{n} elements.")) (|empty?| (((|Boolean|) $) "\\spad{empty?(u)} tests if \\spad{u} has 0 elements.")) (|empty| (($) "\\spad{empty()}\\$\\spad{D} creates an aggregate of type \\spad{D} with 0 elements. Note: The {\\em \\$D} can be dropped if understood by context,{} \\spadignore{e.g.} \\axiom{u: \\spad{D} \\spad{:=} empty()}.")) (|copy| (($ $) "\\spad{copy(u)} returns a top-level (non-recursive) copy of \\spad{u}. Note: for collections,{} \\axiom{copy(\\spad{u}) \\spad{==} [\\spad{x} for \\spad{x} in \\spad{u}]}.")) (|eq?| (((|Boolean|) $ $) "\\spad{eq?(u,{}v)} tests if \\spad{u} and \\spad{v} are same objects."))) -((-4284 . T)) +NIL NIL (-35) ((|constructor| (NIL "Category for the inverse hyperbolic trigonometric functions.")) (|atanh| (($ $) "\\spad{atanh(x)} returns the hyperbolic arc-tangent of \\spad{x}.")) (|asinh| (($ $) "\\spad{asinh(x)} returns the hyperbolic arc-sine of \\spad{x}.")) (|asech| (($ $) "\\spad{asech(x)} returns the hyperbolic arc-secant of \\spad{x}.")) (|acsch| (($ $) "\\spad{acsch(x)} returns the hyperbolic arc-cosecant of \\spad{x}.")) (|acoth| (($ $) "\\spad{acoth(x)} returns the hyperbolic arc-cotangent of \\spad{x}.")) (|acosh| (($ $) "\\spad{acosh(x)} returns the hyperbolic arc-cosine of \\spad{x}."))) @@ -74,25 +74,25 @@ 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}."))) -((-4369 . T) (-4370 . T) (-4284 . T)) +((-4369 . T) (-4370 . T)) NIL (-37 S R) -((|constructor| (NIL "The category of associative algebras (modules which are themselves rings). \\blankline")) (|coerce| (($ |#2|) "\\spad{coerce(r)} maps the ring element \\spad{r} to a member of the algebra."))) +((|constructor| (NIL "The category of associative algebras (modules which are themselves rings). \\blankline"))) NIL NIL (-38 R) -((|constructor| (NIL "The category of associative algebras (modules which are themselves rings). \\blankline")) (|coerce| (($ |#1|) "\\spad{coerce(r)} maps the ring element \\spad{r} to a member of the algebra."))) +((|constructor| (NIL "The category of associative algebras (modules which are themselves rings). \\blankline"))) ((-4363 . T) (-4364 . T) (-4366 . 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 a1,{}...,{}an."))) NIL NIL -(-40 -3219 UP UPUP -4304) +(-40 -3105 UP UPUP -2326) ((|constructor| (NIL "Function field defined by \\spad{f}(\\spad{x},{} \\spad{y}) = 0.")) (|knownInfBasis| (((|Void|) (|NonNegativeInteger|)) "\\spad{knownInfBasis(n)} \\undocumented{}"))) ((-4362 |has| (-401 |#2|) (-357)) (-4367 |has| (-401 |#2|) (-357)) (-4361 |has| (-401 |#2|) (-357)) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| (-401 |#2|) (QUOTE (-142))) (|HasCategory| (-401 |#2|) (QUOTE (-144))) (|HasCategory| (-401 |#2|) (QUOTE (-343))) (-4028 (|HasCategory| (-401 |#2|) (QUOTE (-357))) (|HasCategory| (-401 |#2|) (QUOTE (-343)))) (|HasCategory| (-401 |#2|) (QUOTE (-357))) (|HasCategory| (-401 |#2|) (QUOTE (-362))) (-4028 (-12 (|HasCategory| (-401 |#2|) (QUOTE (-228))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (|HasCategory| (-401 |#2|) (QUOTE (-343)))) (-4028 (-12 (|HasCategory| (-401 |#2|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (-12 (|HasCategory| (-401 |#2|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-401 |#2|) (QUOTE (-343))))) (|HasCategory| (-401 |#2|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| (-401 |#2|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-401 |#2|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-362))) (-4028 (|HasCategory| (-401 |#2|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (-12 (|HasCategory| (-401 |#2|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (-12 (|HasCategory| (-401 |#2|) (QUOTE (-228))) (|HasCategory| (-401 |#2|) (QUOTE (-357))))) -(-41 R -3219) +((|HasCategory| (-401 |#2|) (QUOTE (-142))) (|HasCategory| (-401 |#2|) (QUOTE (-144))) (|HasCategory| (-401 |#2|) (QUOTE (-343))) (-3988 (|HasCategory| (-401 |#2|) (QUOTE (-357))) (|HasCategory| (-401 |#2|) (QUOTE (-343)))) (|HasCategory| (-401 |#2|) (QUOTE (-357))) (|HasCategory| (-401 |#2|) (QUOTE (-362))) (-3988 (-12 (|HasCategory| (-401 |#2|) (QUOTE (-228))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (|HasCategory| (-401 |#2|) (QUOTE (-343)))) (-3988 (-12 (|HasCategory| (-401 |#2|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (-12 (|HasCategory| (-401 |#2|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-401 |#2|) (QUOTE (-343))))) (|HasCategory| (-401 |#2|) (LIST (QUOTE -626) (QUOTE (-553)))) (-3988 (|HasCategory| (-401 |#2|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (|HasCategory| (-401 |#2|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-401 |#2|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-362))) (-12 (|HasCategory| (-401 |#2|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (-12 (|HasCategory| (-401 |#2|) (QUOTE (-228))) (|HasCategory| (-401 |#2|) (QUOTE (-357))))) +(-41 R -3105) ((|constructor| (NIL "AlgebraicManipulations provides functions to simplify and expand expressions involving algebraic operators.")) (|rootKerSimp| ((|#2| (|BasicOperator|) |#2| (|NonNegativeInteger|)) "\\spad{rootKerSimp(op,{}f,{}n)} should be local but conditional.")) (|rootSimp| ((|#2| |#2|) "\\spad{rootSimp(f)} transforms every radical of the form \\spad{(a * b**(q*n+r))**(1/n)} appearing in \\spad{f} into \\spad{b**q * (a * b**r)**(1/n)}. This transformation is not in general valid for all complex numbers \\spad{b}.")) (|rootProduct| ((|#2| |#2|) "\\spad{rootProduct(f)} combines every product of the form \\spad{(a**(1/n))**m * (a**(1/s))**t} into a single power of a root of \\spad{a},{} and transforms every radical power of the form \\spad{(a**(1/n))**m} into a simpler form.")) (|rootPower| ((|#2| |#2|) "\\spad{rootPower(f)} transforms every radical power of the form \\spad{(a**(1/n))**m} into a simpler form if \\spad{m} and \\spad{n} have a common factor.")) (|ratPoly| (((|SparseUnivariatePolynomial| |#2|) |#2|) "\\spad{ratPoly(f)} returns a polynomial \\spad{p} such that \\spad{p} has no algebraic coefficients,{} and \\spad{p(f) = 0}.")) (|ratDenom| ((|#2| |#2| (|List| (|Kernel| |#2|))) "\\spad{ratDenom(f,{} [a1,{}...,{}an])} removes the \\spad{ai}\\spad{'s} which are algebraic from the denominators in \\spad{f}.") ((|#2| |#2| (|List| |#2|)) "\\spad{ratDenom(f,{} [a1,{}...,{}an])} removes the \\spad{ai}\\spad{'s} which are algebraic kernels from the denominators in \\spad{f}.") ((|#2| |#2| |#2|) "\\spad{ratDenom(f,{} a)} removes \\spad{a} from the denominators in \\spad{f} if \\spad{a} is an algebraic kernel.") ((|#2| |#2|) "\\spad{ratDenom(f)} rationalizes the denominators appearing in \\spad{f} by moving all the algebraic quantities into the numerators.")) (|rootSplit| ((|#2| |#2|) "\\spad{rootSplit(f)} transforms every radical of the form \\spad{(a/b)**(1/n)} appearing in \\spad{f} into \\spad{a**(1/n) / b**(1/n)}. This transformation is not in general valid for all complex numbers \\spad{a} and \\spad{b}.")) (|coerce| (($ (|SparseMultivariatePolynomial| |#1| (|Kernel| $))) "\\spad{coerce(x)} \\undocumented")) (|denom| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{denom(x)} \\undocumented")) (|numer| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{numer(x)} \\undocumented"))) NIL ((-12 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -424) (|devaluate| |#1|))))) @@ -111,7 +111,7 @@ NIL (-45 |Key| |Entry|) ((|constructor| (NIL "\\spadtype{AssociationList} implements association lists. These may be viewed as lists of pairs where the first part is a key and the second is the stored value. For example,{} the key might be a string with a persons employee identification number and the value might be a record with personnel data."))) ((-4369 . T) (-4370 . T)) -((-4028 (-12 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-833))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2669) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3359) (|devaluate| |#2|)))))) (-12 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2669) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3359) (|devaluate| |#2|))))))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-833))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-833))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2669) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3359) (|devaluate| |#2|)))))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-833))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2578) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3256) (|devaluate| |#2|)))))) (-12 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2578) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3256) (|devaluate| |#2|))))))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-833))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-833))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2578) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3256) (|devaluate| |#2|))))))) (-46 S R E) ((|constructor| (NIL "Abelian monoid ring elements (not necessarily of finite support) of this ring are of the form formal SUM (r_i * e_i) where the r_i are coefficents and the e_i,{} elements of the ordered abelian monoid,{} are thought of as exponents or monomials. The monomials commute with each other,{} and with the coefficients (which themselves may or may not be commutative). See \\spadtype{FiniteAbelianMonoidRing} for the case of finite support a useful common model for polynomials and power series. Conceptually at least,{} only the non-zero terms are ever operated on.")) (/ (($ $ |#2|) "\\spad{p/c} divides \\spad{p} by the coefficient \\spad{c}.")) (|coefficient| ((|#2| $ |#3|) "\\spad{coefficient(p,{}e)} extracts the coefficient of the monomial with exponent \\spad{e} from polynomial \\spad{p},{} or returns zero if exponent is not present.")) (|reductum| (($ $) "\\spad{reductum(u)} returns \\spad{u} minus its leading monomial returns zero if handed the zero element.")) (|monomial| (($ |#2| |#3|) "\\spad{monomial(r,{}e)} makes a term from a coefficient \\spad{r} and an exponent \\spad{e}.")) (|monomial?| (((|Boolean|) $) "\\spad{monomial?(p)} tests if \\spad{p} is a single monomial.")) (|map| (($ (|Mapping| |#2| |#2|) $) "\\spad{map(fn,{}u)} maps function \\spad{fn} onto the coefficients of the non-zero monomials of \\spad{u}.")) (|degree| ((|#3| $) "\\spad{degree(p)} returns the maximum of the exponents of the terms of \\spad{p}.")) (|leadingMonomial| (($ $) "\\spad{leadingMonomial(p)} returns the monomial of \\spad{p} with the highest degree.")) (|leadingCoefficient| ((|#2| $) "\\spad{leadingCoefficient(p)} returns the coefficient highest degree term of \\spad{p}."))) NIL @@ -144,7 +144,7 @@ NIL ((|constructor| (NIL "\\spad{ApplyUnivariateSkewPolynomial} (internal) allows univariate skew polynomials to be applied to appropriate modules.")) (|apply| ((|#2| |#3| (|Mapping| |#2| |#2|) |#2|) "\\spad{apply(p,{} f,{} m)} returns \\spad{p(m)} where the action is given by \\spad{x m = f(m)}. \\spad{f} must be an \\spad{R}-pseudo linear map on \\spad{M}."))) NIL NIL -(-54 |Base| R -3219) +(-54 |Base| R -3105) ((|constructor| (NIL "This package apply rewrite rules to expressions,{} calling the pattern matcher.")) (|localUnquote| ((|#3| |#3| (|List| (|Symbol|))) "\\spad{localUnquote(f,{}ls)} is a local function.")) (|applyRules| ((|#3| (|List| (|RewriteRule| |#1| |#2| |#3|)) |#3| (|PositiveInteger|)) "\\spad{applyRules([r1,{}...,{}rn],{} expr,{} n)} applies the rules \\spad{r1},{}...,{}\\spad{rn} to \\spad{f} a most \\spad{n} times.") ((|#3| (|List| (|RewriteRule| |#1| |#2| |#3|)) |#3|) "\\spad{applyRules([r1,{}...,{}rn],{} expr)} applies the rules \\spad{r1},{}...,{}\\spad{rn} to \\spad{f} an unlimited number of times,{} \\spadignore{i.e.} until none of \\spad{r1},{}...,{}\\spad{rn} is applicable to the expression."))) NIL NIL @@ -154,7 +154,7 @@ NIL NIL (-56 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}\\spad{'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"))) -((-4369 . T) (-4370 . T) (-4284 . T)) +((-4369 . T) (-4370 . T)) NIL (-57 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),{}...]}."))) @@ -163,64 +163,64 @@ 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}"))) ((-4370 . T) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-4028 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-59 R) ((|constructor| (NIL "\\indented{1}{A TwoDimensionalArray is a two dimensional array with} 1-based indexing for both rows and columns.")) (|shallowlyMutable| ((|attribute|) "One may destructively alter TwoDimensionalArray\\spad{'s}."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) -(-60 -4292) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +(-60 -4298) ((|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 -(-61 -4292) +(-61 -4298) ((|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 -(-62 -4292) +(-62 -4298) ((|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 -(-63 -4292) +(-63 -4298) ((|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 -(-64 -4292) -((|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}")) (|coerce| (($ (|Matrix| (|FortranExpression| (|construct|) (|construct| (QUOTE X) (QUOTE HESS)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) +(-64 -4298) +((|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 -(-65 -4292) +(-65 -4298) ((|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 -(-66 -4292) +(-66 -4298) ((|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 -(-67 -4292) +(-67 -4298) ((|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 -(-68 -4292) +(-68 -4298) ((|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 -(-69 -4292) +(-69 -4298) ((|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 -(-70 -4292) +(-70 -4298) ((|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 -(-71 -4292) +(-71 -4298) ((|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 -(-72 -4292) +(-72 -4298) ((|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 -(-73 -4292) +(-73 -4298) ((|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 @@ -232,55 +232,55 @@ NIL ((|constructor| (NIL "\\spadtype{Asp42} produces Fortran for Type 42 ASPs,{} needed for NAG routines \\axiomOpFrom{d02raf}{d02Package} and \\axiomOpFrom{d02saf}{d02Package} in particular. These ASPs are in fact three Fortran routines which return a vector of functions,{} and their derivatives \\spad{wrt} \\spad{Y}(\\spad{i}) and also a continuation parameter EPS,{} for example:\\begin{verbatim} SUBROUTINE G(EPS,YA,YB,BC,N) DOUBLE PRECISION EPS,YA(N),YB(N),BC(N) INTEGER N BC(1)=YA(1) BC(2)=YA(2) BC(3)=YB(2)-1.0D0 RETURN END SUBROUTINE JACOBG(EPS,YA,YB,AJ,BJ,N) DOUBLE PRECISION EPS,YA(N),AJ(N,N),BJ(N,N),YB(N) INTEGER N AJ(1,1)=1.0D0 AJ(1,2)=0.0D0 AJ(1,3)=0.0D0 AJ(2,1)=0.0D0 AJ(2,2)=1.0D0 AJ(2,3)=0.0D0 AJ(3,1)=0.0D0 AJ(3,2)=0.0D0 AJ(3,3)=0.0D0 BJ(1,1)=0.0D0 BJ(1,2)=0.0D0 BJ(1,3)=0.0D0 BJ(2,1)=0.0D0 BJ(2,2)=0.0D0 BJ(2,3)=0.0D0 BJ(3,1)=0.0D0 BJ(3,2)=1.0D0 BJ(3,3)=0.0D0 RETURN END SUBROUTINE JACGEP(EPS,YA,YB,BCEP,N) DOUBLE PRECISION EPS,YA(N),YB(N),BCEP(N) INTEGER N BCEP(1)=0.0D0 BCEP(2)=0.0D0 BCEP(3)=0.0D0 RETURN END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct| (QUOTE EPS)) (|construct| (QUOTE YA) (QUOTE YB)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) NIL NIL -(-76 -4292) +(-76 -4298) ((|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 -(-77 -4292) +(-77 -4298) ((|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 -(-78 -4292) +(-78 -4298) ((|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 -(-79 -4292) +(-79 -4298) ((|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 -(-80 -4292) -((|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}")) (|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."))) +(-80 -4298) +((|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 -(-81 -4292) +(-81 -4298) ((|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 -(-82 -4292) +(-82 -4298) ((|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 -(-83 -4292) +(-83 -4298) ((|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 -(-84 -4292) +(-84 -4298) ((|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 -(-85 -4292) +(-85 -4298) ((|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 -(-86 -4292) +(-86 -4298) ((|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 -(-87 -4292) +(-87 -4298) ((|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 -4292) +(-88 -4298) ((|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 @@ -291,13 +291,13 @@ NIL (-90 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}."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-91 S) -((|constructor| (NIL "This is the category of Spad abstract syntax trees.")) (|coerce| (($ (|Syntax|)) "\\spad{coerce(s)} parses syntax object \\spad{`s'} as a Spad construct."))) +((|constructor| (NIL "This is the category of Spad abstract syntax trees."))) NIL NIL (-92) -((|constructor| (NIL "This is the category of Spad abstract syntax trees.")) (|coerce| (($ (|Syntax|)) "\\spad{coerce(s)} parses syntax object \\spad{`s'} as a Spad construct."))) +((|constructor| (NIL "This is the category of Spad abstract syntax trees."))) NIL NIL (-93 S) @@ -339,7 +339,7 @@ NIL (-102 S) ((|constructor| (NIL "\\spadtype{BalancedBinaryTree(S)} is the domain of balanced binary trees (bbtree). A balanced binary tree of \\spad{2**k} leaves,{} for some \\spad{k > 0},{} is symmetric,{} that is,{} the left and right subtree of each interior node have identical shape. In general,{} the left and right subtree of a given node can differ by at most leaf node.")) (|mapDown!| (($ $ |#1| (|Mapping| (|List| |#1|) |#1| |#1| |#1|)) "\\spad{mapDown!(t,{}p,{}f)} returns \\spad{t} after traversing \\spad{t} in \"preorder\" (node then left then right) fashion replacing the successive interior nodes as follows. Let \\spad{l} and \\spad{r} denote the left and right subtrees of \\spad{t}. The root value \\spad{x} of \\spad{t} is replaced by \\spad{p}. Then \\spad{f}(value \\spad{l},{} value \\spad{r},{} \\spad{p}),{} where \\spad{l} and \\spad{r} denote the left and right subtrees of \\spad{t},{} is evaluated producing two values \\spad{pl} and \\spad{pr}. Then \\spad{mapDown!(l,{}pl,{}f)} and \\spad{mapDown!(l,{}pr,{}f)} are evaluated.") (($ $ |#1| (|Mapping| |#1| |#1| |#1|)) "\\spad{mapDown!(t,{}p,{}f)} returns \\spad{t} after traversing \\spad{t} in \"preorder\" (node then left then right) fashion replacing the successive interior nodes as follows. The root value \\spad{x} is replaced by \\spad{q} \\spad{:=} \\spad{f}(\\spad{p},{}\\spad{x}). The mapDown!(\\spad{l},{}\\spad{q},{}\\spad{f}) and mapDown!(\\spad{r},{}\\spad{q},{}\\spad{f}) are evaluated for the left and right subtrees \\spad{l} and \\spad{r} of \\spad{t}.")) (|mapUp!| (($ $ $ (|Mapping| |#1| |#1| |#1| |#1| |#1|)) "\\spad{mapUp!(t,{}t1,{}f)} traverses \\spad{t} in an \"endorder\" (left then right then node) fashion returning \\spad{t} with the value at each successive interior node of \\spad{t} replaced by \\spad{f}(\\spad{l},{}\\spad{r},{}\\spad{l1},{}\\spad{r1}) where \\spad{l} and \\spad{r} are the values at the immediate left and right nodes. Values \\spad{l1} and \\spad{r1} are values at the corresponding nodes of a balanced binary tree \\spad{t1},{} of identical shape at \\spad{t}.") ((|#1| $ (|Mapping| |#1| |#1| |#1|)) "\\spad{mapUp!(t,{}f)} traverses balanced binary tree \\spad{t} in an \"endorder\" (left then right then node) fashion returning \\spad{t} with the value at each successive interior node of \\spad{t} replaced by \\spad{f}(\\spad{l},{}\\spad{r}) where \\spad{l} and \\spad{r} are the values at the immediate left and right nodes.")) (|setleaves!| (($ $ (|List| |#1|)) "\\spad{setleaves!(t,{} ls)} sets the leaves of \\spad{t} in left-to-right order to the elements of \\spad{ls}.")) (|balancedBinaryTree| (($ (|NonNegativeInteger|) |#1|) "\\spad{balancedBinaryTree(n,{} s)} creates a balanced binary tree with \\spad{n} nodes each with value \\spad{s}."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-103 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 @@ -354,12 +354,12 @@ NIL NIL (-106 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."))) -((-4370 . T) (-4284 . T)) +((-4370 . T)) NIL (-107) -((|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.")) (|coerce| (((|RadixExpansion| 2) $) "\\spad{coerce(b)} converts a binary expansion to a radix expansion with base 2.") (((|Fraction| (|Integer|)) $) "\\spad{coerce(b)} converts a binary expansion to a rational number."))) +((|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."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| (-553) (QUOTE (-891))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| (-553) (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-144))) (|HasCategory| (-553) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-553) (QUOTE (-1004))) (|HasCategory| (-553) (QUOTE (-806))) (-4028 (|HasCategory| (-553) (QUOTE (-806))) (|HasCategory| (-553) (QUOTE (-833)))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-1130))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-553) (QUOTE (-228))) (|HasCategory| (-553) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-553) (LIST (QUOTE -507) (QUOTE (-1155)) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -303) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -280) (QUOTE (-553)) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-301))) (|HasCategory| (-553) (QUOTE (-538))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-553) (LIST (QUOTE -626) (QUOTE (-553)))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (|HasCategory| (-553) (QUOTE (-142))))) +((|HasCategory| (-553) (QUOTE (-891))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| (-553) (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-144))) (|HasCategory| (-553) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-553) (QUOTE (-1004))) (|HasCategory| (-553) (QUOTE (-806))) (-3988 (|HasCategory| (-553) (QUOTE (-806))) (|HasCategory| (-553) (QUOTE (-833)))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-1130))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-553) (QUOTE (-228))) (|HasCategory| (-553) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-553) (LIST (QUOTE -507) (QUOTE (-1155)) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -303) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -280) (QUOTE (-553)) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-301))) (|HasCategory| (-553) (QUOTE (-538))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-553) (LIST (QUOTE -626) (QUOTE (-553)))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (|HasCategory| (-553) (QUOTE (-142))))) (-108) ((|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| (($ (|Symbol|) (|List| (|Property|))) "\\spad{binding(n,{}props)} constructs a binding with name \\spad{`n'} and property list `props'.")) (|properties| (((|List| (|Property|)) $) "\\spad{properties(b)} returns the properties associated with binding \\spad{b}.")) (|name| (((|Symbol|) $) "\\spad{name(b)} returns the name of binding \\spad{b}"))) NIL @@ -384,7 +384,7 @@ NIL ((|constructor| (NIL "A basic operator is an object that can be applied to a list of arguments from a set,{} the result being a kernel over that set.")) (|setProperties| (($ $ (|AssociationList| (|String|) (|None|))) "\\spad{setProperties(op,{} l)} sets the property list of \\spad{op} to \\spad{l}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|setProperty| (($ $ (|String|) (|None|)) "\\spad{setProperty(op,{} s,{} v)} attaches property \\spad{s} to \\spad{op},{} and sets its value to \\spad{v}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|property| (((|Union| (|None|) "failed") $ (|String|)) "\\spad{property(op,{} s)} returns the value of property \\spad{s} if it is attached to \\spad{op},{} and \"failed\" otherwise.")) (|deleteProperty!| (($ $ (|String|)) "\\spad{deleteProperty!(op,{} s)} unattaches property \\spad{s} from \\spad{op}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|assert| (($ $ (|String|)) "\\spad{assert(op,{} s)} attaches property \\spad{s} to \\spad{op}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|has?| (((|Boolean|) $ (|String|)) "\\spad{has?(op,{} s)} tests if property \\spad{s} is attached to \\spad{op}.")) (|is?| (((|Boolean|) $ (|Symbol|)) "\\spad{is?(op,{} s)} tests if the name of \\spad{op} is \\spad{s}.")) (|input| (((|Union| (|Mapping| (|InputForm|) (|List| (|InputForm|))) "failed") $) "\\spad{input(op)} returns the \"\\%input\" property of \\spad{op} if it has one attached,{} \"failed\" otherwise.") (($ $ (|Mapping| (|InputForm|) (|List| (|InputForm|)))) "\\spad{input(op,{} foo)} attaches foo as the \"\\%input\" property of \\spad{op}. If \\spad{op} has a \"\\%input\" property \\spad{f},{} then \\spad{op(a1,{}...,{}an)} gets converted to InputForm as \\spad{f(a1,{}...,{}an)}.")) (|display| (($ $ (|Mapping| (|OutputForm|) (|OutputForm|))) "\\spad{display(op,{} foo)} attaches foo as the \"\\%display\" property of \\spad{op}. If \\spad{op} has a \"\\%display\" property \\spad{f},{} then \\spad{op(a)} gets converted to OutputForm as \\spad{f(a)}. Argument \\spad{op} must be unary.") (($ $ (|Mapping| (|OutputForm|) (|List| (|OutputForm|)))) "\\spad{display(op,{} foo)} attaches foo as the \"\\%display\" property of \\spad{op}. If \\spad{op} has a \"\\%display\" property \\spad{f},{} then \\spad{op(a1,{}...,{}an)} gets converted to OutputForm as \\spad{f(a1,{}...,{}an)}.") (((|Union| (|Mapping| (|OutputForm|) (|List| (|OutputForm|))) "failed") $) "\\spad{display(op)} returns the \"\\%display\" property of \\spad{op} if it has one attached,{} and \"failed\" otherwise.")) (|comparison| (($ $ (|Mapping| (|Boolean|) $ $)) "\\spad{comparison(op,{} foo?)} attaches foo? as the \"\\%less?\" property to \\spad{op}. If op1 and op2 have the same name,{} and one of them has a \"\\%less?\" property \\spad{f},{} then \\spad{f(op1,{} op2)} is called to decide whether \\spad{op1 < op2}.")) (|equality| (($ $ (|Mapping| (|Boolean|) $ $)) "\\spad{equality(op,{} foo?)} attaches foo? as the \"\\%equal?\" property to \\spad{op}. If op1 and op2 have the same name,{} and one of them has an \"\\%equal?\" property \\spad{f},{} then \\spad{f(op1,{} op2)} is called to decide whether op1 and op2 should be considered equal.")) (|weight| (($ $ (|NonNegativeInteger|)) "\\spad{weight(op,{} n)} attaches the weight \\spad{n} to \\spad{op}.") (((|NonNegativeInteger|) $) "\\spad{weight(op)} returns the weight attached to \\spad{op}.")) (|nary?| (((|Boolean|) $) "\\spad{nary?(op)} tests if \\spad{op} has arbitrary arity.")) (|unary?| (((|Boolean|) $) "\\spad{unary?(op)} tests if \\spad{op} is unary.")) (|nullary?| (((|Boolean|) $) "\\spad{nullary?(op)} tests if \\spad{op} is nullary.")) (|arity| (((|Union| (|NonNegativeInteger|) "failed") $) "\\spad{arity(op)} returns \\spad{n} if \\spad{op} is \\spad{n}-ary,{} and \"failed\" if \\spad{op} has arbitrary arity.")) (|operator| (($ (|Symbol|) (|NonNegativeInteger|)) "\\spad{operator(f,{} n)} makes \\spad{f} into an \\spad{n}-ary operator.") (($ (|Symbol|)) "\\spad{operator(f)} makes \\spad{f} into an operator with arbitrary arity.")) (|copy| (($ $) "\\spad{copy(op)} returns a copy of \\spad{op}.")) (|properties| (((|AssociationList| (|String|) (|None|)) $) "\\spad{properties(op)} returns the list of all the properties currently attached to \\spad{op}.")) (|name| (((|Symbol|) $) "\\spad{name(op)} returns the name of \\spad{op}."))) NIL NIL -(-114 -3219 UP) +(-114 -3105 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 @@ -395,14 +395,14 @@ NIL (-116 |p|) ((|constructor| (NIL "Stream-based implementation of \\spad{Qp:} numbers are represented as sum(\\spad{i} = \\spad{k}..,{} a[\\spad{i}] * p^i),{} where the a[\\spad{i}] lie in -(\\spad{p} - 1)\\spad{/2},{}...,{}(\\spad{p} - 1)\\spad{/2}."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| (-115 |#1|) (QUOTE (-891))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| (-115 |#1|) (QUOTE (-142))) (|HasCategory| (-115 |#1|) (QUOTE (-144))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-115 |#1|) (QUOTE (-1004))) (|HasCategory| (-115 |#1|) (QUOTE (-806))) (-4028 (|HasCategory| (-115 |#1|) (QUOTE (-806))) (|HasCategory| (-115 |#1|) (QUOTE (-833)))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-115 |#1|) (QUOTE (-1130))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| (-115 |#1|) (QUOTE (-228))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -507) (QUOTE (-1155)) (LIST (QUOTE -115) (|devaluate| |#1|)))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -303) (LIST (QUOTE -115) (|devaluate| |#1|)))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -280) (LIST (QUOTE -115) (|devaluate| |#1|)) (LIST (QUOTE -115) (|devaluate| |#1|)))) (|HasCategory| (-115 |#1|) (QUOTE (-301))) (|HasCategory| (-115 |#1|) (QUOTE (-538))) (|HasCategory| (-115 |#1|) (QUOTE (-833))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-115 |#1|) (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-115 |#1|) (QUOTE (-891)))) (|HasCategory| (-115 |#1|) (QUOTE (-142))))) +((|HasCategory| (-115 |#1|) (QUOTE (-891))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| (-115 |#1|) (QUOTE (-142))) (|HasCategory| (-115 |#1|) (QUOTE (-144))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-115 |#1|) (QUOTE (-1004))) (|HasCategory| (-115 |#1|) (QUOTE (-806))) (-3988 (|HasCategory| (-115 |#1|) (QUOTE (-806))) (|HasCategory| (-115 |#1|) (QUOTE (-833)))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-115 |#1|) (QUOTE (-1130))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| (-115 |#1|) (QUOTE (-228))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -507) (QUOTE (-1155)) (LIST (QUOTE -115) (|devaluate| |#1|)))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -303) (LIST (QUOTE -115) (|devaluate| |#1|)))) (|HasCategory| (-115 |#1|) (LIST (QUOTE -280) (LIST (QUOTE -115) (|devaluate| |#1|)) (LIST (QUOTE -115) (|devaluate| |#1|)))) (|HasCategory| (-115 |#1|) (QUOTE (-301))) (|HasCategory| (-115 |#1|) (QUOTE (-538))) (|HasCategory| (-115 |#1|) (QUOTE (-833))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-115 |#1|) (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-115 |#1|) (QUOTE (-891)))) (|HasCategory| (-115 |#1|) (QUOTE (-142))))) (-117 A S) ((|constructor| (NIL "A binary-recursive aggregate has 0,{} 1 or 2 children and serves as a model for a binary tree or a doubly-linked aggregate structure")) (|setright!| (($ $ $) "\\spad{setright!(a,{}x)} sets the right child of \\spad{t} to be \\spad{x}.")) (|setleft!| (($ $ $) "\\spad{setleft!(a,{}b)} sets the left child of \\axiom{a} to be \\spad{b}.")) (|setelt| (($ $ "right" $) "\\spad{setelt(a,{}\"right\",{}b)} (also written \\axiom{\\spad{b} . right \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setright!(a,{}\\spad{b})}.") (($ $ "left" $) "\\spad{setelt(a,{}\"left\",{}b)} (also written \\axiom{a . left \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setleft!(a,{}\\spad{b})}.")) (|right| (($ $) "\\spad{right(a)} returns the right child.")) (|elt| (($ $ "right") "\\spad{elt(a,{}\"right\")} (also written: \\axiom{a . right}) is equivalent to \\axiom{right(a)}.") (($ $ "left") "\\spad{elt(u,{}\"left\")} (also written: \\axiom{a . left}) is equivalent to \\axiom{left(a)}.")) (|left| (($ $) "\\spad{left(u)} returns the left child."))) NIL ((|HasAttribute| |#1| (QUOTE -4370))) (-118 S) ((|constructor| (NIL "A binary-recursive aggregate has 0,{} 1 or 2 children and serves as a model for a binary tree or a doubly-linked aggregate structure")) (|setright!| (($ $ $) "\\spad{setright!(a,{}x)} sets the right child of \\spad{t} to be \\spad{x}.")) (|setleft!| (($ $ $) "\\spad{setleft!(a,{}b)} sets the left child of \\axiom{a} to be \\spad{b}.")) (|setelt| (($ $ "right" $) "\\spad{setelt(a,{}\"right\",{}b)} (also written \\axiom{\\spad{b} . right \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setright!(a,{}\\spad{b})}.") (($ $ "left" $) "\\spad{setelt(a,{}\"left\",{}b)} (also written \\axiom{a . left \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setleft!(a,{}\\spad{b})}.")) (|right| (($ $) "\\spad{right(a)} returns the right child.")) (|elt| (($ $ "right") "\\spad{elt(a,{}\"right\")} (also written: \\axiom{a . right}) is equivalent to \\axiom{right(a)}.") (($ $ "left") "\\spad{elt(u,{}\"left\")} (also written: \\axiom{a . left}) is equivalent to \\axiom{left(a)}.")) (|left| (($ $) "\\spad{left(u)} returns the left child."))) -((-4284 . T)) +NIL NIL (-119 UP) ((|constructor| (NIL "\\indented{1}{Author: Frederic Lehobey,{} James \\spad{H}. Davenport} Date Created: 28 June 1994 Date Last Updated: 11 July 1997 Basic Operations: brillhartIrreducible? Related Domains: Also See: AMS Classifications: Keywords: factorization Examples: References: [1] John Brillhart,{} Note on Irreducibility Testing,{} Mathematics of Computation,{} vol. 35,{} num. 35,{} Oct. 1980,{} 1379-1381 [2] James Davenport,{} On Brillhart Irreducibility. To appear. [3] John Brillhart,{} On the Euler and Bernoulli polynomials,{} \\spad{J}. Reine Angew. Math.,{} \\spad{v}. 234,{} (1969),{} \\spad{pp}. 45-64")) (|noLinearFactor?| (((|Boolean|) |#1|) "\\spad{noLinearFactor?(p)} returns \\spad{true} if \\spad{p} can be shown to have no linear factor by a theorem of Lehmer,{} \\spad{false} else. \\spad{I} insist on the fact that \\spad{false} does not mean that \\spad{p} has a linear factor.")) (|brillhartTrials| (((|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{brillhartTrials(n)} sets to \\spad{n} the number of tests in \\spadfun{brillhartIrreducible?} and returns the previous value.") (((|NonNegativeInteger|)) "\\spad{brillhartTrials()} returns the number of tests in \\spadfun{brillhartIrreducible?}.")) (|brillhartIrreducible?| (((|Boolean|) |#1| (|Boolean|)) "\\spad{brillhartIrreducible?(p,{}noLinears)} returns \\spad{true} if \\spad{p} can be shown to be irreducible by a remark of Brillhart,{} \\spad{false} else. If \\spad{noLinears} is \\spad{true},{} we are being told \\spad{p} has no linear factors \\spad{false} does not mean that \\spad{p} is reducible.") (((|Boolean|) |#1|) "\\spad{brillhartIrreducible?(p)} returns \\spad{true} if \\spad{p} can be shown to be irreducible by a remark of Brillhart,{} \\spad{false} is inconclusive."))) @@ -411,14 +411,14 @@ NIL (-120 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"))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-121 S) ((|constructor| (NIL "The bit aggregate category models aggregates representing large quantities of Boolean data.")) (|xor| (($ $ $) "\\spad{xor(a,{}b)} returns the logical {\\em exclusive-or} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|or| (($ $ $) "\\spad{a or b} returns the logical {\\em or} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|and| (($ $ $) "\\spad{a and b} returns the logical {\\em and} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nor| (($ $ $) "\\spad{nor(a,{}b)} returns the logical {\\em nor} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nand| (($ $ $) "\\spad{nand(a,{}b)} returns the logical {\\em nand} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|not| (($ $) "\\spad{not(b)} returns the logical {\\em not} of bit aggregate \\axiom{\\spad{b}}."))) NIL NIL (-122) ((|constructor| (NIL "The bit aggregate category models aggregates representing large quantities of Boolean data.")) (|xor| (($ $ $) "\\spad{xor(a,{}b)} returns the logical {\\em exclusive-or} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|or| (($ $ $) "\\spad{a or b} returns the logical {\\em or} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|and| (($ $ $) "\\spad{a and b} returns the logical {\\em and} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nor| (($ $ $) "\\spad{nor(a,{}b)} returns the logical {\\em nor} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nand| (($ $ $) "\\spad{nand(a,{}b)} returns the logical {\\em nand} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|not| (($ $) "\\spad{not(b)} returns the logical {\\em not} of bit aggregate \\axiom{\\spad{b}}."))) -((-4370 . T) (-4369 . T) (-4284 . T)) +((-4370 . T) (-4369 . T)) NIL (-123 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"))) @@ -426,22 +426,22 @@ NIL NIL (-124 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"))) -((-4369 . T) (-4370 . T) (-4284 . T)) +((-4369 . T) (-4370 . T)) NIL (-125 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."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-126 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."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-127) ((|constructor| (NIL "ByteBuffer provides datatype for buffers of bytes. This domain differs from PrimitiveArray Byte in that it has it is not as rigid as PrimitiveArray Byte is. That is,{} the typical use of ByteBuffer is to pre-allocate a vector of Byte of some capacity \\spad{`c'}. The array can then store up to \\spad{`c'} 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.}")) (|setLength!| (((|NonNegativeInteger|) $ (|NonNegativeInteger|)) "\\spad{setLength!(buf,{}n)} sets the number of active bytes in the `buf'. Error if \\spad{`n'} is more than the capacity.")) (|capacity| (((|NonNegativeInteger|) $) "\\spad{capacity(buf)} returns the pre-allocated maximum size of `buf'.")) (|#| (((|NonNegativeInteger|) $) "\\spad{\\#buf} returns the number of active elements in the buffer.")) (|byteBuffer| (($ (|NonNegativeInteger|)) "\\spad{byteBuffer(n)} creates a buffer of capacity \\spad{n},{} and length 0."))) ((-4370 . T) (-4369 . T)) -((-4028 (-12 (|HasCategory| (-128) (QUOTE (-833))) (|HasCategory| (-128) (LIST (QUOTE -303) (QUOTE (-128))))) (-12 (|HasCategory| (-128) (QUOTE (-1079))) (|HasCategory| (-128) (LIST (QUOTE -303) (QUOTE (-128)))))) (-4028 (-12 (|HasCategory| (-128) (QUOTE (-1079))) (|HasCategory| (-128) (LIST (QUOTE -303) (QUOTE (-128))))) (|HasCategory| (-128) (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-128) (LIST (QUOTE -601) (QUOTE (-529)))) (-4028 (|HasCategory| (-128) (QUOTE (-833))) (|HasCategory| (-128) (QUOTE (-1079)))) (|HasCategory| (-128) (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-128) (QUOTE (-1079))) (-12 (|HasCategory| (-128) (QUOTE (-1079))) (|HasCategory| (-128) (LIST (QUOTE -303) (QUOTE (-128))))) (|HasCategory| (-128) (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| (-128) (QUOTE (-833))) (|HasCategory| (-128) (LIST (QUOTE -303) (QUOTE (-128))))) (-12 (|HasCategory| (-128) (QUOTE (-1079))) (|HasCategory| (-128) (LIST (QUOTE -303) (QUOTE (-128)))))) (-3988 (-12 (|HasCategory| (-128) (QUOTE (-1079))) (|HasCategory| (-128) (LIST (QUOTE -303) (QUOTE (-128))))) (|HasCategory| (-128) (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-128) (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| (-128) (QUOTE (-833))) (|HasCategory| (-128) (QUOTE (-1079)))) (|HasCategory| (-128) (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-128) (QUOTE (-1079))) (|HasCategory| (-128) (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| (-128) (QUOTE (-1079))) (|HasCategory| (-128) (LIST (QUOTE -303) (QUOTE (-128)))))) (-128) -((|constructor| (NIL "Byte is the datatype of 8-bit sized unsigned integer values.")) (|sample| (($) "\\spad{sample()} returns a sample datum of type Byte.")) (|bitior| (($ $ $) "bitor(\\spad{x},{}\\spad{y}) returns the bitwise `inclusive or' of \\spad{`x'} and \\spad{`y'}.")) (|bitand| (($ $ $) "\\spad{bitand(x,{}y)} returns the bitwise `and' of \\spad{`x'} and \\spad{`y'}.")) (|coerce| (($ (|Character|)) "\\spad{coerce(c)} views \\spad{`c'} a a byte. In particular \\spad{`c'} is supposed to have a numerical value less than 256.") (($ (|NonNegativeInteger|)) "\\spad{coerce(x)} has the same effect as byte(\\spad{x}).")) (|byte| (($ (|NonNegativeInteger|)) "\\spad{byte(x)} injects the unsigned integer value \\spad{`v'} into the Byte algebra. \\spad{`v'} must be non-negative and less than 256."))) +((|constructor| (NIL "Byte is the datatype of 8-bit sized unsigned integer values.")) (|sample| (($) "\\spad{sample()} returns a sample datum of type Byte.")) (|bitior| (($ $ $) "bitor(\\spad{x},{}\\spad{y}) returns the bitwise `inclusive or' of \\spad{`x'} and \\spad{`y'}.")) (|bitand| (($ $ $) "\\spad{bitand(x,{}y)} returns the bitwise `and' of \\spad{`x'} and \\spad{`y'}.")) (|coerce| (($ (|NonNegativeInteger|)) "\\spad{coerce(x)} has the same effect as byte(\\spad{x}).")) (|byte| (($ (|NonNegativeInteger|)) "\\spad{byte(x)} injects the unsigned integer value \\spad{`v'} into the Byte algebra. \\spad{`v'} must be non-negative and less than 256."))) NIL NIL (-129) @@ -460,11 +460,11 @@ NIL ((|constructor| (NIL "Members of the domain CardinalNumber are values indicating the cardinality of sets,{} both finite and infinite. Arithmetic operations are defined on cardinal numbers as follows. \\blankline If \\spad{x = \\#X} and \\spad{y = \\#Y} then \\indented{2}{\\spad{x+y\\space{2}= \\#(X+Y)}\\space{3}\\tab{30}disjoint union} \\indented{2}{\\spad{x-y\\space{2}= \\#(X-Y)}\\space{3}\\tab{30}relative complement} \\indented{2}{\\spad{x*y\\space{2}= \\#(X*Y)}\\space{3}\\tab{30}cartesian product} \\indented{2}{\\spad{x**y = \\#(X**Y)}\\space{2}\\tab{30}\\spad{X**Y = \\{g| g:Y->X\\}}} \\blankline The non-negative integers have a natural construction as cardinals \\indented{2}{\\spad{0 = \\#\\{\\}},{} \\spad{1 = \\{0\\}},{} \\spad{2 = \\{0,{} 1\\}},{} ...,{} \\spad{n = \\{i| 0 <= i < n\\}}.} \\blankline That \\spad{0} acts as a zero for the multiplication of cardinals is equivalent to the axiom of choice. \\blankline The generalized continuum hypothesis asserts \\center{\\spad{2**Aleph i = Aleph(i+1)}} and is independent of the axioms of set theory [Goedel 1940]. \\blankline Three commonly encountered cardinal numbers are \\indented{3}{\\spad{a = \\#Z}\\space{7}\\tab{30}countable infinity} \\indented{3}{\\spad{c = \\#R}\\space{7}\\tab{30}the continuum} \\indented{3}{\\spad{f = \\#\\{g| g:[0,{}1]->R\\}}} \\blankline In this domain,{} these values are obtained using \\indented{3}{\\spad{a := Aleph 0},{} \\spad{c := 2**a},{} \\spad{f := 2**c}.} \\blankline")) (|generalizedContinuumHypothesisAssumed| (((|Boolean|) (|Boolean|)) "\\spad{generalizedContinuumHypothesisAssumed(bool)} is used to dictate whether the hypothesis is to be assumed.")) (|generalizedContinuumHypothesisAssumed?| (((|Boolean|)) "\\spad{generalizedContinuumHypothesisAssumed?()} tests if the hypothesis is currently assumed.")) (|countable?| (((|Boolean|) $) "\\spad{countable?(\\spad{a})} determines whether \\spad{a} is a countable cardinal,{} \\spadignore{i.e.} an integer or \\spad{Aleph 0}.")) (|finite?| (((|Boolean|) $) "\\spad{finite?(\\spad{a})} determines whether \\spad{a} is a finite cardinal,{} \\spadignore{i.e.} an integer.")) (|Aleph| (($ (|NonNegativeInteger|)) "\\spad{Aleph(n)} provides the named (infinite) cardinal number.")) (** (($ $ $) "\\spad{x**y} returns \\spad{\\#(X**Y)} where \\spad{X**Y} is defined \\indented{1}{as \\spad{\\{g| g:Y->X\\}}.}")) (- (((|Union| $ "failed") $ $) "\\spad{x - y} returns an element \\spad{z} such that \\spad{z+y=x} or \"failed\" if no such element exists.")) (|commutative| ((|attribute| "*") "a domain \\spad{D} has \\spad{commutative(\"*\")} if it has an operation \\spad{\"*\": (D,{}D) -> D} which is commutative."))) (((-4371 "*") . T)) NIL -(-133 |minix| -2073 S T$) +(-133 |minix| -2026 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 -(-134 |minix| -2073 R) +(-134 |minix| -2026 R) ((|constructor| (NIL "CartesianTensor(minix,{}dim,{}\\spad{R}) provides Cartesian tensors with components belonging to a commutative ring \\spad{R}. These tensors can have any number of indices. Each index takes values from \\spad{minix} to \\spad{minix + dim - 1}.")) (|sample| (($) "\\spad{sample()} returns an object of type \\%.")) (|unravel| (($ (|List| |#3|)) "\\spad{unravel(t)} produces a tensor from a list of components such that \\indented{2}{\\spad{unravel(ravel(t)) = t}.}")) (|ravel| (((|List| |#3|) $) "\\spad{ravel(t)} produces a list of components from a tensor such that \\indented{2}{\\spad{unravel(ravel(t)) = t}.}")) (|leviCivitaSymbol| (($) "\\spad{leviCivitaSymbol()} is the rank \\spad{dim} tensor defined by \\spad{leviCivitaSymbol()(i1,{}...idim) = +1/0/-1} if \\spad{i1,{}...,{}idim} is an even/is nota /is an odd permutation of \\spad{minix,{}...,{}minix+dim-1}.")) (|kroneckerDelta| (($) "\\spad{kroneckerDelta()} is the rank 2 tensor defined by \\indented{3}{\\spad{kroneckerDelta()(i,{}j)}} \\indented{6}{\\spad{= 1\\space{2}if i = j}} \\indented{6}{\\spad{= 0 if\\space{2}i \\~= j}}")) (|reindex| (($ $ (|List| (|Integer|))) "\\spad{reindex(t,{}[i1,{}...,{}idim])} permutes the indices of \\spad{t}. For example,{} if \\spad{r = reindex(t,{} [4,{}1,{}2,{}3])} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank for tensor given by \\indented{4}{\\spad{r(i,{}j,{}k,{}l) = t(l,{}i,{}j,{}k)}.}")) (|transpose| (($ $ (|Integer|) (|Integer|)) "\\spad{transpose(t,{}i,{}j)} exchanges the \\spad{i}\\spad{-}th and \\spad{j}\\spad{-}th indices of \\spad{t}. For example,{} if \\spad{r = transpose(t,{}2,{}3)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 4 tensor given by \\indented{4}{\\spad{r(i,{}j,{}k,{}l) = t(i,{}k,{}j,{}l)}.}") (($ $) "\\spad{transpose(t)} exchanges the first and last indices of \\spad{t}. For example,{} if \\spad{r = transpose(t)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 4 tensor given by \\indented{4}{\\spad{r(i,{}j,{}k,{}l) = t(l,{}j,{}k,{}i)}.}")) (|contract| (($ $ (|Integer|) (|Integer|)) "\\spad{contract(t,{}i,{}j)} is the contraction of tensor \\spad{t} which sums along the \\spad{i}\\spad{-}th and \\spad{j}\\spad{-}th indices. For example,{} if \\spad{r = contract(t,{}1,{}3)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 2 \\spad{(= 4 - 2)} tensor given by \\indented{4}{\\spad{r(i,{}j) = sum(h=1..dim,{}t(h,{}i,{}h,{}j))}.}") (($ $ (|Integer|) $ (|Integer|)) "\\spad{contract(t,{}i,{}s,{}j)} is the inner product of tenors \\spad{s} and \\spad{t} which sums along the \\spad{k1}\\spad{-}th index of \\spad{t} and the \\spad{k2}\\spad{-}th index of \\spad{s}. For example,{} if \\spad{r = contract(s,{}2,{}t,{}1)} for rank 3 tensors rank 3 tensors \\spad{s} and \\spad{t},{} then \\spad{r} is the rank 4 \\spad{(= 3 + 3 - 2)} tensor given by \\indented{4}{\\spad{r(i,{}j,{}k,{}l) = sum(h=1..dim,{}s(i,{}h,{}j)*t(h,{}k,{}l))}.}")) (* (($ $ $) "\\spad{s*t} is the inner product of the tensors \\spad{s} and \\spad{t} which contracts the last index of \\spad{s} with the first index of \\spad{t},{} \\spadignore{i.e.} \\indented{4}{\\spad{t*s = contract(t,{}rank t,{} s,{} 1)}} \\indented{4}{\\spad{t*s = sum(k=1..N,{} t[i1,{}..,{}iN,{}k]*s[k,{}j1,{}..,{}jM])}} This is compatible with the use of \\spad{M*v} to denote the matrix-vector inner product.")) (|product| (($ $ $) "\\spad{product(s,{}t)} is the outer product of the tensors \\spad{s} and \\spad{t}. For example,{} if \\spad{r = product(s,{}t)} for rank 2 tensors \\spad{s} and \\spad{t},{} then \\spad{r} is a rank 4 tensor given by \\indented{4}{\\spad{r(i,{}j,{}k,{}l) = s(i,{}j)*t(k,{}l)}.}")) (|elt| ((|#3| $ (|List| (|Integer|))) "\\spad{elt(t,{}[i1,{}...,{}iN])} gives a component of a rank \\spad{N} tensor.") ((|#3| $ (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{elt(t,{}i,{}j,{}k,{}l)} gives a component of a rank 4 tensor.") ((|#3| $ (|Integer|) (|Integer|) (|Integer|)) "\\spad{elt(t,{}i,{}j,{}k)} gives a component of a rank 3 tensor.") ((|#3| $ (|Integer|) (|Integer|)) "\\spad{elt(t,{}i,{}j)} gives a component of a rank 2 tensor.") ((|#3| $ (|Integer|)) "\\spad{elt(t,{}i)} gives a component of a rank 1 tensor.") ((|#3| $) "\\spad{elt(t)} gives the component of a rank 0 tensor.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(t)} returns the tensorial rank of \\spad{t} (that is,{} the number of indices). This is the same as the graded module degree.")) (|coerce| (($ (|List| $)) "\\spad{coerce([t_1,{}...,{}t_dim])} allows tensors to be constructed using lists.") (($ (|List| |#3|)) "\\spad{coerce([r_1,{}...,{}r_dim])} allows tensors to be constructed using lists.") (($ (|SquareMatrix| |#2| |#3|)) "\\spad{coerce(m)} views a matrix as a rank 2 tensor.") (($ (|DirectProduct| |#2| |#3|)) "\\spad{coerce(v)} views a vector as a rank 1 tensor."))) NIL NIL @@ -483,7 +483,7 @@ NIL (-138) ((|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}."))) ((-4369 . T) (-4359 . T) (-4370 . T)) -((-4028 (-12 (|HasCategory| (-141) (QUOTE (-362))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141))))) (-12 (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141)))))) (|HasCategory| (-141) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-141) (QUOTE (-362))) (|HasCategory| (-141) (QUOTE (-833))) (|HasCategory| (-141) (QUOTE (-1079))) (-12 (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141))))) (|HasCategory| (-141) (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| (-141) (QUOTE (-362))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141))))) (-12 (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141)))))) (|HasCategory| (-141) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-141) (QUOTE (-362))) (|HasCategory| (-141) (QUOTE (-833))) (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141)))))) (-139 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{\\spad{qi} = pi/d} and \\spad{d} is a common denominator for the \\spad{qi}\\spad{'s}.")) (|clearDenominator| ((|#3| |#3|) "\\spad{clearDenominator([q1,{}...,{}qn])} returns \\spad{[p1,{}...,{}pn]} such that \\spad{\\spad{qi} = pi/d} where \\spad{d} is a common denominator for the \\spad{qi}\\spad{'s}.")) (|commonDenominator| ((|#1| |#3|) "\\spad{commonDenominator([q1,{}...,{}qn])} returns a common denominator \\spad{d} for \\spad{q1},{}...,{}\\spad{qn}."))) NIL @@ -508,7 +508,7 @@ NIL ((|constructor| (NIL "Rings of Characteristic Zero."))) ((-4366 . T)) NIL -(-145 -3219 UP UPUP) +(-145 -3105 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 @@ -522,7 +522,7 @@ NIL ((|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasAttribute| |#1| (QUOTE -4369))) (-148 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{==} [\\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{==} [\\spad{x} for \\spad{x} in \\spad{c} | \\spad{x} \\spad{~=} \\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{==} [\\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."))) -((-4284 . T)) +NIL NIL (-149 |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."))) @@ -548,7 +548,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 -(-155 R -3219) +(-155 R -3105) ((|constructor| (NIL "Provides combinatorial functions over an integral domain.")) (|ipow| ((|#2| (|List| |#2|)) "\\spad{ipow(l)} should be local but conditional.")) (|iidprod| ((|#2| (|List| |#2|)) "\\spad{iidprod(l)} should be local but conditional.")) (|iidsum| ((|#2| (|List| |#2|)) "\\spad{iidsum(l)} should be local but conditional.")) (|iipow| ((|#2| (|List| |#2|)) "\\spad{iipow(l)} should be local but conditional.")) (|iiperm| ((|#2| (|List| |#2|)) "\\spad{iiperm(l)} should be local but conditional.")) (|iibinom| ((|#2| (|List| |#2|)) "\\spad{iibinom(l)} should be local but conditional.")) (|iifact| ((|#2| |#2|) "\\spad{iifact(x)} should be local but conditional.")) (|product| ((|#2| |#2| (|SegmentBinding| |#2|)) "\\spad{product(f(n),{} n = a..b)} returns \\spad{f}(a) * ... * \\spad{f}(\\spad{b}) as a formal product.") ((|#2| |#2| (|Symbol|)) "\\spad{product(f(n),{} n)} returns the formal product \\spad{P}(\\spad{n}) which verifies \\spad{P}(\\spad{n+1})\\spad{/P}(\\spad{n}) = \\spad{f}(\\spad{n}).")) (|summation| ((|#2| |#2| (|SegmentBinding| |#2|)) "\\spad{summation(f(n),{} n = a..b)} returns \\spad{f}(a) + ... + \\spad{f}(\\spad{b}) as a formal sum.") ((|#2| |#2| (|Symbol|)) "\\spad{summation(f(n),{} n)} returns the formal sum \\spad{S}(\\spad{n}) which verifies \\spad{S}(\\spad{n+1}) - \\spad{S}(\\spad{n}) = \\spad{f}(\\spad{n}).")) (|factorials| ((|#2| |#2| (|Symbol|)) "\\spad{factorials(f,{} x)} rewrites the permutations and binomials in \\spad{f} involving \\spad{x} in terms of factorials.") ((|#2| |#2|) "\\spad{factorials(f)} rewrites the permutations and binomials in \\spad{f} in terms of factorials.")) (|factorial| ((|#2| |#2|) "\\spad{factorial(n)} returns the factorial of \\spad{n},{} \\spadignore{i.e.} \\spad{n!}.")) (|permutation| ((|#2| |#2| |#2|) "\\spad{permutation(n,{} r)} returns the number of permutations of \\spad{n} objects taken \\spad{r} at a time,{} \\spadignore{i.e.} \\spad{n!/}(\\spad{n}-\\spad{r})!.")) (|binomial| ((|#2| |#2| |#2|) "\\spad{binomial(n,{} r)} returns the number of subsets of \\spad{r} objects taken among \\spad{n} objects,{} \\spadignore{i.e.} \\spad{n!/}(\\spad{r!} * (\\spad{n}-\\spad{r})!).")) (** ((|#2| |#2| |#2|) "\\spad{a ** b} is the formal exponential a**b.")) (|operator| (((|BasicOperator|) (|BasicOperator|)) "\\spad{operator(op)} returns a copy of \\spad{op} with the domain-dependent properties appropriate for \\spad{F}; error if \\spad{op} is not a combinatorial operator.")) (|belong?| (((|Boolean|) (|BasicOperator|)) "\\spad{belong?(op)} is \\spad{true} if \\spad{op} is a combinatorial operator."))) NIL NIL @@ -582,7 +582,7 @@ NIL ((|HasCategory| |#2| (QUOTE (-891))) (|HasCategory| |#2| (QUOTE (-538))) (|HasCategory| |#2| (QUOTE (-984))) (|HasCategory| |#2| (QUOTE (-1177))) (|HasCategory| |#2| (QUOTE (-1040))) (|HasCategory| |#2| (QUOTE (-1004))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (QUOTE (-357))) (|HasAttribute| |#2| (QUOTE -4365)) (|HasAttribute| |#2| (QUOTE -4368)) (|HasCategory| |#2| (QUOTE (-301))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-833)))) (-163 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}.")) (|complex| (($ |#1| |#1|) "\\spad{complex(x,{}y)} constructs \\spad{x} + \\%i*y.")) (|conjugate| (($ $) "\\spad{conjugate(x + \\%i y)} returns \\spad{x} - \\%\\spad{i} \\spad{y}.")) (|imaginary| (($) "\\spad{imaginary()} = sqrt(\\spad{-1}) = \\%\\spad{i}."))) -((-4362 -4028 (|has| |#1| (-545)) (-12 (|has| |#1| (-301)) (|has| |#1| (-891)))) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4365 |has| |#1| (-6 -4365)) (-4368 |has| |#1| (-6 -4368)) (-4284 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) +((-4362 -3988 (|has| |#1| (-545)) (-12 (|has| |#1| (-301)) (|has| |#1| (-891)))) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4365 |has| |#1| (-6 -4365)) (-4368 |has| |#1| (-6 -4368)) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-164 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."))) @@ -594,8 +594,8 @@ NIL NIL (-166 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}."))) -((-4362 -4028 (|has| |#1| (-545)) (-12 (|has| |#1| (-301)) (|has| |#1| (-891)))) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4365 |has| |#1| (-6 -4365)) (-4368 |has| |#1| (-6 -4368)) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-343))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-343)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-362))) (-4028 (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (QUOTE (-343)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-343)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-343)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-343)))) (-12 (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-343)))) (-12 (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-343)))) (|HasCategory| |#1| (QUOTE (-228))) (-12 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-343)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-343)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -280) (|devaluate| |#1|) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-814)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-833)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-1004)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-1177)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-357))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-891))))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-891)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-891))))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (QUOTE (-984))) (|HasCategory| |#1| (QUOTE (-1177)))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (QUOTE (-1004))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-4028 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-545)))) (-4028 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-343)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -280) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-814))) (|HasCategory| |#1| (QUOTE (-1040))) (-12 (|HasCategory| |#1| (QUOTE (-1040))) (|HasCategory| |#1| (QUOTE (-1177)))) (|HasCategory| |#1| (QUOTE (-538))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-357)))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-228))) (-12 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasAttribute| |#1| (QUOTE -4365)) (|HasAttribute| |#1| (QUOTE -4368)) (-12 (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155))))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-343))))) +((-4362 -3988 (|has| |#1| (-545)) (-12 (|has| |#1| (-301)) (|has| |#1| (-891)))) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4365 |has| |#1| (-6 -4365)) (-4368 |has| |#1| (-6 -4368)) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) +((|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-343))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-343)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-362))) (-3988 (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (QUOTE (-343)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-343)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-343)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-343)))) (-12 (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-343)))) (-12 (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-343)))) (|HasCategory| |#1| (QUOTE (-228))) (-12 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-343)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-343)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -280) (|devaluate| |#1|) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-814)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-833)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-1004)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-1177)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-357))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-891))))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-891)))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-891))))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (QUOTE (-984))) (|HasCategory| |#1| (QUOTE (-1177)))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (QUOTE (-1004))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-545)))) (-3988 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-343)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -280) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-814))) (|HasCategory| |#1| (QUOTE (-1040))) (-12 (|HasCategory| |#1| (QUOTE (-1040))) (|HasCategory| |#1| (QUOTE (-1177)))) (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-357)))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-228))) (-12 (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasAttribute| |#1| (QUOTE -4365)) (|HasAttribute| |#1| (QUOTE -4368)) (-12 (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155))))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-343))))) (-167 R S CS) ((|constructor| (NIL "This package supports converting complex expressions to patterns")) (|convert| (((|Pattern| |#1|) |#3|) "\\spad{convert(cs)} converts the complex expression \\spad{cs} to a pattern"))) NIL @@ -660,7 +660,7 @@ NIL ((|constructor| (NIL "This domain provides implementations for constructors.")) (|arity| (((|SingleInteger|) $) "\\spad{arity(ctor)} returns the arity of the constructor `ctor'. \\indented{2}{A negative value means that the \\spad{ctor} takes a variable} \\indented{2}{length argument list,{} \\spadignore{e.g.} Mapping,{} Record,{} etc.}")) (|kind| (((|ConstructorKind|) $) "\\spad{kind(ctor)} returns the kind of the constructor `ctor'.")) (|name| (((|Identifier|) $) "\\spad{name(ctor)} returns the name of the constructor `ctor'."))) NIL NIL -(-183 R -3219) +(-183 R -3105) ((|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 @@ -765,26 +765,26 @@ NIL NIL NIL (-209 S) -((|constructor| (NIL "\\indented{1}{This domain implements a simple view of a database whose fields are} indexed by symbols")) (|coerce| (($ (|List| |#1|)) "\\spad{coerce(l)} makes a database out of a list")) (- (($ $ $) "\\spad{db1-db2} returns the difference of databases \\spad{db1} and \\spad{db2} \\spadignore{i.e.} consisting of elements in \\spad{db1} but not in \\spad{db2}")) (+ (($ $ $) "\\spad{db1+db2} returns the merge of databases \\spad{db1} and \\spad{db2}")) (|fullDisplay| (((|Void|) $ (|PositiveInteger|) (|PositiveInteger|)) "\\spad{fullDisplay(db,{}start,{}end )} prints full details of entries in the range \\axiom{\\spad{start}..end} in \\axiom{\\spad{db}}.") (((|Void|) $) "\\spad{fullDisplay(db)} prints full details of each entry in \\axiom{\\spad{db}}.") (((|Void|) $) "\\spad{fullDisplay(x)} displays \\spad{x} in detail")) (|display| (((|Void|) $) "\\spad{display(db)} prints a summary line for each entry in \\axiom{\\spad{db}}.") (((|Void|) $) "\\spad{display(x)} displays \\spad{x} in some form")) (|elt| (((|DataList| (|String|)) $ (|Symbol|)) "\\spad{elt(db,{}s)} returns the \\axiom{\\spad{s}} field of each element of \\axiom{\\spad{db}}.") (($ $ (|QueryEquation|)) "\\spad{elt(db,{}q)} returns all elements of \\axiom{\\spad{db}} which satisfy \\axiom{\\spad{q}}.") (((|String|) $ (|Symbol|)) "\\spad{elt(x,{}s)} returns an element of \\spad{x} indexed by \\spad{s}"))) +((|constructor| (NIL "\\indented{1}{This domain implements a simple view of a database whose fields are} indexed by symbols")) (- (($ $ $) "\\spad{db1-db2} returns the difference of databases \\spad{db1} and \\spad{db2} \\spadignore{i.e.} consisting of elements in \\spad{db1} but not in \\spad{db2}")) (+ (($ $ $) "\\spad{db1+db2} returns the merge of databases \\spad{db1} and \\spad{db2}")) (|fullDisplay| (((|Void|) $ (|PositiveInteger|) (|PositiveInteger|)) "\\spad{fullDisplay(db,{}start,{}end )} prints full details of entries in the range \\axiom{\\spad{start}..end} in \\axiom{\\spad{db}}.") (((|Void|) $) "\\spad{fullDisplay(db)} prints full details of each entry in \\axiom{\\spad{db}}.") (((|Void|) $) "\\spad{fullDisplay(x)} displays \\spad{x} in detail")) (|display| (((|Void|) $) "\\spad{display(db)} prints a summary line for each entry in \\axiom{\\spad{db}}.") (((|Void|) $) "\\spad{display(x)} displays \\spad{x} in some form")) (|elt| (((|DataList| (|String|)) $ (|Symbol|)) "\\spad{elt(db,{}s)} returns the \\axiom{\\spad{s}} field of each element of \\axiom{\\spad{db}}.") (($ $ (|QueryEquation|)) "\\spad{elt(db,{}q)} returns all elements of \\axiom{\\spad{db}} which satisfy \\axiom{\\spad{q}}.") (((|String|) $ (|Symbol|)) "\\spad{elt(x,{}s)} returns an element of \\spad{x} indexed by \\spad{s}"))) NIL NIL -(-210 -3219 UP UPUP R) +(-210 -3105 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 -(-211 -3219 FP) +(-211 -3105 FP) ((|constructor| (NIL "Package for the factorization of a univariate polynomial with coefficients in a finite field. The algorithm used is the \"distinct degree\" algorithm of Cantor-Zassenhaus,{} modified to use trace instead of the norm and a table for computing Frobenius as suggested by Naudin and Quitte .")) (|irreducible?| (((|Boolean|) |#2|) "\\spad{irreducible?(p)} tests whether the polynomial \\spad{p} is irreducible.")) (|tracePowMod| ((|#2| |#2| (|NonNegativeInteger|) |#2|) "\\spad{tracePowMod(u,{}k,{}v)} produces the sum of \\spad{u**(q**i)} for \\spad{i} running and \\spad{q=} size \\spad{F}")) (|trace2PowMod| ((|#2| |#2| (|NonNegativeInteger|) |#2|) "\\spad{trace2PowMod(u,{}k,{}v)} produces the sum of \\spad{u**(2**i)} for \\spad{i} running from 1 to \\spad{k} all computed modulo the polynomial \\spad{v}.")) (|exptMod| ((|#2| |#2| (|NonNegativeInteger|) |#2|) "\\spad{exptMod(u,{}k,{}v)} raises the polynomial \\spad{u} to the \\spad{k}th power modulo the polynomial \\spad{v}.")) (|separateFactors| (((|List| |#2|) (|List| (|Record| (|:| |deg| (|NonNegativeInteger|)) (|:| |prod| |#2|)))) "\\spad{separateFactors(lfact)} takes the list produced by \\spadfunFrom{separateDegrees}{DistinctDegreeFactorization} and produces the complete list of factors.")) (|separateDegrees| (((|List| (|Record| (|:| |deg| (|NonNegativeInteger|)) (|:| |prod| |#2|))) |#2|) "\\spad{separateDegrees(p)} splits the square free polynomial \\spad{p} into factors each of which is a product of irreducibles of the same degree.")) (|distdfact| (((|Record| (|:| |cont| |#1|) (|:| |factors| (|List| (|Record| (|:| |irr| |#2|) (|:| |pow| (|Integer|)))))) |#2| (|Boolean|)) "\\spad{distdfact(p,{}sqfrflag)} produces the complete factorization of the polynomial \\spad{p} returning an internal data structure. If argument \\spad{sqfrflag} is \\spad{true},{} the polynomial is assumed square free.")) (|factorSquareFree| (((|Factored| |#2|) |#2|) "\\spad{factorSquareFree(p)} produces the complete factorization of the square free polynomial \\spad{p}.")) (|factor| (((|Factored| |#2|) |#2|) "\\spad{factor(p)} produces the complete factorization of the polynomial \\spad{p}."))) NIL NIL (-212) -((|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.")) (|coerce| (((|RadixExpansion| 10) $) "\\spad{coerce(d)} converts a decimal expansion to a radix expansion with base 10.") (((|Fraction| (|Integer|)) $) "\\spad{coerce(d)} converts a decimal expansion to a rational number."))) +((|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."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| (-553) (QUOTE (-891))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| (-553) (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-144))) (|HasCategory| (-553) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-553) (QUOTE (-1004))) (|HasCategory| (-553) (QUOTE (-806))) (-4028 (|HasCategory| (-553) (QUOTE (-806))) (|HasCategory| (-553) (QUOTE (-833)))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-1130))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-553) (QUOTE (-228))) (|HasCategory| (-553) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-553) (LIST (QUOTE -507) (QUOTE (-1155)) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -303) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -280) (QUOTE (-553)) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-301))) (|HasCategory| (-553) (QUOTE (-538))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-553) (LIST (QUOTE -626) (QUOTE (-553)))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (|HasCategory| (-553) (QUOTE (-142))))) +((|HasCategory| (-553) (QUOTE (-891))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| (-553) (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-144))) (|HasCategory| (-553) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-553) (QUOTE (-1004))) (|HasCategory| (-553) (QUOTE (-806))) (-3988 (|HasCategory| (-553) (QUOTE (-806))) (|HasCategory| (-553) (QUOTE (-833)))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-1130))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-553) (QUOTE (-228))) (|HasCategory| (-553) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-553) (LIST (QUOTE -507) (QUOTE (-1155)) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -303) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -280) (QUOTE (-553)) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-301))) (|HasCategory| (-553) (QUOTE (-538))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-553) (LIST (QUOTE -626) (QUOTE (-553)))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (|HasCategory| (-553) (QUOTE (-142))))) (-213) ((|constructor| (NIL "This domain represents the syntax of a definition.")) (|body| (((|SpadAst|) $) "\\spad{body(d)} returns the right hand side of the definition \\spad{`d'}.")) (|signature| (((|Signature|) $) "\\spad{signature(d)} returns the signature of the operation being defined. Note that this list may be partial in that it contains only the types actually specified in the definition.")) (|head| (((|HeadAst|) $) "\\spad{head(d)} returns the head of the definition \\spad{`d'}. This is a list of identifiers starting with the name of the operation followed by the name of the parameters,{} if any."))) NIL NIL -(-214 R -3219) +(-214 R -3105) ((|constructor| (NIL "\\spadtype{ElementaryFunctionDefiniteIntegration} provides functions to compute definite integrals of elementary functions.")) (|innerint| (((|Union| (|:| |f1| (|OrderedCompletion| |#2|)) (|:| |f2| (|List| (|OrderedCompletion| |#2|))) (|:| |fail| "failed") (|:| |pole| "potentialPole")) |#2| (|Symbol|) (|OrderedCompletion| |#2|) (|OrderedCompletion| |#2|) (|Boolean|)) "\\spad{innerint(f,{} x,{} a,{} b,{} ignore?)} should be local but conditional")) (|integrate| (((|Union| (|:| |f1| (|OrderedCompletion| |#2|)) (|:| |f2| (|List| (|OrderedCompletion| |#2|))) (|:| |fail| "failed") (|:| |pole| "potentialPole")) |#2| (|SegmentBinding| (|OrderedCompletion| |#2|)) (|String|)) "\\spad{integrate(f,{} x = a..b,{} \"noPole\")} returns the integral of \\spad{f(x)dx} from a to \\spad{b}. If it is not possible to check whether \\spad{f} has a pole for \\spad{x} between a and \\spad{b} (because of parameters),{} then this function will assume that \\spad{f} has no such pole. Error: if \\spad{f} has a pole for \\spad{x} between a and \\spad{b} or if the last argument is not \"noPole\".") (((|Union| (|:| |f1| (|OrderedCompletion| |#2|)) (|:| |f2| (|List| (|OrderedCompletion| |#2|))) (|:| |fail| "failed") (|:| |pole| "potentialPole")) |#2| (|SegmentBinding| (|OrderedCompletion| |#2|))) "\\spad{integrate(f,{} x = a..b)} returns the integral of \\spad{f(x)dx} from a to \\spad{b}. Error: if \\spad{f} has a pole for \\spad{x} between a and \\spad{b}."))) NIL NIL @@ -799,18 +799,18 @@ NIL (-217 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}."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-218 |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}."))) ((-4366 . T)) NIL -(-219 R -3219) +(-219 R -3105) ((|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 (-220) ((|constructor| (NIL "\\indented{1}{\\spadtype{DoubleFloat} is intended to make accessible} hardware floating point arithmetic in \\Language{},{} either native double precision,{} or IEEE. On most machines,{} there will be hardware support for the arithmetic operations: \\spadfunFrom{+}{DoubleFloat},{} \\spadfunFrom{*}{DoubleFloat},{} \\spadfunFrom{/}{DoubleFloat} and possibly also the \\spadfunFrom{sqrt}{DoubleFloat} operation. The operations \\spadfunFrom{exp}{DoubleFloat},{} \\spadfunFrom{log}{DoubleFloat},{} \\spadfunFrom{sin}{DoubleFloat},{} \\spadfunFrom{cos}{DoubleFloat},{} \\spadfunFrom{atan}{DoubleFloat} are normally coded in software based on minimax polynomial/rational approximations. Note that under Lisp/VM,{} \\spadfunFrom{atan}{DoubleFloat} is not available at this time. Some general comments about the accuracy of the operations: the operations \\spadfunFrom{+}{DoubleFloat},{} \\spadfunFrom{*}{DoubleFloat},{} \\spadfunFrom{/}{DoubleFloat} and \\spadfunFrom{sqrt}{DoubleFloat} are expected to be fully accurate. The operations \\spadfunFrom{exp}{DoubleFloat},{} \\spadfunFrom{log}{DoubleFloat},{} \\spadfunFrom{sin}{DoubleFloat},{} \\spadfunFrom{cos}{DoubleFloat} and \\spadfunFrom{atan}{DoubleFloat} are not expected to be fully accurate. In particular,{} \\spadfunFrom{sin}{DoubleFloat} and \\spadfunFrom{cos}{DoubleFloat} will lose all precision for large arguments. \\blankline The \\spadtype{Float} domain provides an alternative to the \\spad{DoubleFloat} domain. It provides an arbitrary precision model of floating point arithmetic. This means that accuracy problems like those above are eliminated by increasing the working precision where necessary. \\spadtype{Float} provides some special functions such as \\spadfunFrom{erf}{DoubleFloat},{} the error function in addition to the elementary functions. The disadvantage of \\spadtype{Float} is that it is much more expensive than small floats when the latter can be used.")) (|rationalApproximation| (((|Fraction| (|Integer|)) $ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{rationalApproximation(f,{} n,{} b)} computes a rational approximation \\spad{r} to \\spad{f} with relative error \\spad{< b**(-n)} (that is,{} \\spad{|(r-f)/f| < b**(-n)}).") (((|Fraction| (|Integer|)) $ (|NonNegativeInteger|)) "\\spad{rationalApproximation(f,{} n)} computes a rational approximation \\spad{r} to \\spad{f} with relative error \\spad{< 10**(-n)}.")) (|Beta| (($ $ $) "\\spad{Beta(x,{}y)} is \\spad{Gamma(x) * Gamma(y)/Gamma(x+y)}.")) (|Gamma| (($ $) "\\spad{Gamma(x)} is the Euler Gamma function.")) (|atan| (($ $ $) "\\spad{atan(x,{}y)} computes the arc tangent from \\spad{x} with phase \\spad{y}.")) (|log10| (($ $) "\\spad{log10(x)} computes the logarithm with base 10 for \\spad{x}.")) (|log2| (($ $) "\\spad{log2(x)} computes the logarithm with base 2 for \\spad{x}.")) (|exp1| (($) "\\spad{exp1()} returns the natural log base \\spad{2.718281828...}.")) (** (($ $ $) "\\spad{x ** y} returns the \\spad{y}th power of \\spad{x} (equal to \\spad{exp(y log x)}).")) (/ (($ $ (|Integer|)) "\\spad{x / i} computes the division from \\spad{x} by an integer \\spad{i}."))) -((-4312 . T) (-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) +((-4327 . T) (-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-221) ((|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{\\spad{Bi}(x)}. This function satisfies the differential equation: \\indented{2}{\\spad{\\spad{Bi}''(x) - x * \\spad{Bi}(x) = 0}.}") (((|DoubleFloat|) (|DoubleFloat|)) "\\spad{airyBi(x)} is the Airy function \\spad{\\spad{Bi}(x)}. This function satisfies the differential equation: \\indented{2}{\\spad{\\spad{Bi}''(x) - x * \\spad{Bi}(x) = 0}.}")) (|airyAi| (((|DoubleFloat|) (|DoubleFloat|)) "\\spad{airyAi(x)} is the Airy function \\spad{\\spad{Ai}(x)}. This function satisfies the differential equation: \\indented{2}{\\spad{\\spad{Ai}''(x) - x * \\spad{Ai}(x) = 0}.}") (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{airyAi(x)} is the Airy function \\spad{\\spad{Ai}(x)}. This function satisfies the differential equation: \\indented{2}{\\spad{\\spad{Ai}''(x) - x * \\spad{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*\\%\\spad{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*\\%\\spad{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*\\%\\spad{pi}) - J(-v,{}x))/sin(v*\\%\\spad{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*\\%\\spad{pi}) - J(-v,{}x))/sin(v*\\%\\spad{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)}.}"))) @@ -819,14 +819,14 @@ NIL (-222 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}"))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-545))) (|HasAttribute| |#1| (QUOTE (-4371 "*"))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-545))) (|HasAttribute| |#1| (QUOTE (-4371 "*"))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-223 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 (-224 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."))) -((-4370 . T) (-4284 . T)) +((-4370 . T)) NIL (-225 S R) ((|constructor| (NIL "Differential extensions of a ring \\spad{R}. Given a differentiation on \\spad{R},{} extend it to a differentiation on \\%.")) (D (($ $ (|Mapping| |#2| |#2|) (|NonNegativeInteger|)) "\\spad{D(x,{} deriv,{} n)} differentiate \\spad{x} \\spad{n} times using a derivation which extends \\spad{deriv} on \\spad{R}.") (($ $ (|Mapping| |#2| |#2|)) "\\spad{D(x,{} deriv)} differentiates \\spad{x} extending the derivation deriv on \\spad{R}.")) (|differentiate| (($ $ (|Mapping| |#2| |#2|) (|NonNegativeInteger|)) "\\spad{differentiate(x,{} deriv,{} n)} differentiate \\spad{x} \\spad{n} times using a derivation which extends \\spad{deriv} on \\spad{R}.") (($ $ (|Mapping| |#2| |#2|)) "\\spad{differentiate(x,{} deriv)} differentiates \\spad{x} extending the derivation deriv on \\spad{R}."))) @@ -850,28 +850,28 @@ NIL ((|HasAttribute| |#1| (QUOTE -4369))) (-230 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}."))) -((-4370 . T) (-4284 . T)) +((-4370 . T)) NIL (-231) ((|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 -(-232 S -2073 R) +(-232 S -2026 R) ((|constructor| (NIL "\\indented{2}{This category represents a finite cartesian product of a given type.} Many categorical properties are preserved under this construction.")) (* (($ $ |#3|) "\\spad{y * r} multiplies each component of the vector \\spad{y} by the element \\spad{r}.") (($ |#3| $) "\\spad{r * y} multiplies the element \\spad{r} times each component of the vector \\spad{y}.")) (|dot| ((|#3| $ $) "\\spad{dot(x,{}y)} computes the inner product of the vectors \\spad{x} and \\spad{y}.")) (|unitVector| (($ (|PositiveInteger|)) "\\spad{unitVector(n)} produces a vector with 1 in position \\spad{n} and zero elsewhere.")) (|directProduct| (($ (|Vector| |#3|)) "\\spad{directProduct(v)} converts the vector \\spad{v} to become a direct product. Error: if the length of \\spad{v} is different from dim.")) (|finiteAggregate| ((|attribute|) "attribute to indicate an aggregate of finite size"))) NIL ((|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (QUOTE (-831))) (|HasAttribute| |#3| (QUOTE -4366)) (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (QUOTE (-1079)))) -(-233 -2073 R) +(-233 -2026 R) ((|constructor| (NIL "\\indented{2}{This category represents a finite cartesian product of a given type.} Many categorical properties are preserved under this construction.")) (* (($ $ |#2|) "\\spad{y * r} multiplies each component of the vector \\spad{y} by the element \\spad{r}.") (($ |#2| $) "\\spad{r * y} multiplies the element \\spad{r} times each component of the vector \\spad{y}.")) (|dot| ((|#2| $ $) "\\spad{dot(x,{}y)} computes the inner product of the vectors \\spad{x} and \\spad{y}.")) (|unitVector| (($ (|PositiveInteger|)) "\\spad{unitVector(n)} produces a vector with 1 in position \\spad{n} and zero elsewhere.")) (|directProduct| (($ (|Vector| |#2|)) "\\spad{directProduct(v)} converts the vector \\spad{v} to become a direct product. Error: if the length of \\spad{v} is different from dim.")) (|finiteAggregate| ((|attribute|) "attribute to indicate an aggregate of finite size"))) -((-4363 |has| |#2| (-1031)) (-4364 |has| |#2| (-1031)) (-4366 |has| |#2| (-6 -4366)) ((-4371 "*") |has| |#2| (-169)) (-4369 . T) (-4284 . T)) +((-4363 |has| |#2| (-1031)) (-4364 |has| |#2| (-1031)) (-4366 |has| |#2| (-6 -4366)) ((-4371 "*") |has| |#2| (-169)) (-4369 . T)) NIL -(-234 -2073 A B) +(-234 -2026 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 -(-235 -2073 R) +(-235 -2026 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."))) ((-4363 |has| |#2| (-1031)) (-4364 |has| |#2| (-1031)) (-4366 |has| |#2| (-6 -4366)) ((-4371 "*") |has| |#2| (-169)) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))))) (-4028 (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079)))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (QUOTE (-357))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-357)))) (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (QUOTE (-779))) (-4028 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-831)))) (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-169))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-1031)))) (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (QUOTE (-1079)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-129)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-169)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-228)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-362)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-712)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-779)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-831)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079))))) (-4028 (-12 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| (-553) (QUOTE (-833))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-4028 (|HasCategory| |#2| (QUOTE (-1031))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079)))) (|HasAttribute| |#2| (QUOTE -4366)) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-25))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))))) (-3988 (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079)))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (QUOTE (-357))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-357)))) (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (QUOTE (-779))) (-3988 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-831)))) (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-169))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-1031)))) (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (QUOTE (-1079)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-129)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-169)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-228)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-362)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-712)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-779)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-831)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079))))) (-3988 (-12 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1031))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-3988 (-12 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| (-553) (QUOTE (-833))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-3988 (|HasCategory| |#2| (QUOTE (-1031))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079)))) (|HasAttribute| |#2| (QUOTE -4366)) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))))) (-236) ((|constructor| (NIL "DisplayPackage allows one to print strings in a nice manner,{} including highlighting substrings.")) (|sayLength| (((|Integer|) (|List| (|String|))) "\\spad{sayLength(l)} returns the length of a list of strings \\spad{l} as an integer.") (((|Integer|) (|String|)) "\\spad{sayLength(s)} returns the length of a string \\spad{s} as an integer.")) (|say| (((|Void|) (|List| (|String|))) "\\spad{say(l)} sends a list of strings \\spad{l} to output.") (((|Void|) (|String|)) "\\spad{say(s)} sends a string \\spad{s} to output.")) (|center| (((|List| (|String|)) (|List| (|String|)) (|Integer|) (|String|)) "\\spad{center(l,{}i,{}s)} takes a list of strings \\spad{l},{} and centers them within a list of strings which is \\spad{i} characters long,{} in which the remaining spaces are filled with strings composed of as many repetitions as possible of the last string parameter \\spad{s}.") (((|String|) (|String|) (|Integer|) (|String|)) "\\spad{center(s,{}i,{}s)} takes the first string \\spad{s},{} and centers it within a string of length \\spad{i},{} in which the other elements of the string are composed of as many replications as possible of the second indicated string,{} \\spad{s} which must have a length greater than that of an empty string.")) (|copies| (((|String|) (|Integer|) (|String|)) "\\spad{copies(i,{}s)} will take a string \\spad{s} and create a new string composed of \\spad{i} copies of \\spad{s}.")) (|newLine| (((|String|)) "\\spad{newLine()} sends a new line command to output.")) (|bright| (((|List| (|String|)) (|List| (|String|))) "\\spad{bright(l)} sets the font property of a list of strings,{} \\spad{l},{} to bold-face type.") (((|List| (|String|)) (|String|)) "\\spad{bright(s)} sets the font property of the string \\spad{s} to bold-face type."))) NIL @@ -886,12 +886,12 @@ NIL NIL (-239 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."))) -((-4284 . T)) +NIL NIL (-240 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}")) (|coerce| (((|List| |#1|) $) "\\spad{coerce(x)} returns the list of elements in \\spad{x}") (($ (|List| |#1|)) "\\spad{coerce(l)} creates a datalist from \\spad{l}"))) +((|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}"))) ((-4370 . T) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-4028 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-241 M) ((|constructor| (NIL "DiscreteLogarithmPackage implements help functions for discrete logarithms in monoids using small cyclic groups.")) (|shanksDiscLogAlgorithm| (((|Union| (|NonNegativeInteger|) "failed") |#1| |#1| (|NonNegativeInteger|)) "\\spad{shanksDiscLogAlgorithm(b,{}a,{}p)} computes \\spad{s} with \\spad{b**s = a} for assuming that \\spad{a} and \\spad{b} are elements in a 'small' cyclic group of order \\spad{p} by Shank\\spad{'s} algorithm. Note: this is a subroutine of the function \\spadfun{discreteLog}.")) (** ((|#1| |#1| (|Integer|)) "\\spad{x ** n} returns \\spad{x} raised to the integer power \\spad{n}"))) NIL @@ -899,19 +899,19 @@ NIL (-242 |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"))) (((-4371 "*") |has| |#2| (-169)) (-4362 |has| |#2| (-545)) (-4367 |has| |#2| (-6 -4367)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#2| (QUOTE (-891))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-169))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-545)))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#2| (QUOTE (-833))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasAttribute| |#2| (QUOTE -4367)) (|HasCategory| |#2| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-142))))) +((|HasCategory| |#2| (QUOTE (-891))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-169))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-545)))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#2| (QUOTE (-833))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357))) (|HasAttribute| |#2| (QUOTE -4367)) (|HasCategory| |#2| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-142))))) (-243) ((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Create: October 18,{} 2007. Date Last Updated: January 19,{} 2008. Basic Operations: coerce,{} reify Related Constructors: Type,{} Syntax,{} OutputForm Also See: Type,{} ConstructorCall")) (|showSummary| (((|Void|) $) "\\spad{showSummary(d)} prints out implementation detail information of domain \\spad{`d'}.")) (|reflect| (($ (|ConstructorCall|)) "\\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|) $) "\\spad{reify(d)} returns the abstract syntax for the domain \\spad{`x'}."))) NIL NIL (-244 |n| R M S) ((|constructor| (NIL "This constructor provides a direct product type with a left matrix-module view."))) -((-4366 -4028 (-3791 (|has| |#4| (-1031)) (|has| |#4| (-228))) (-3791 (|has| |#4| (-1031)) (|has| |#4| (-882 (-1155)))) (|has| |#4| (-6 -4366)) (-3791 (|has| |#4| (-1031)) (|has| |#4| (-626 (-553))))) (-4363 |has| |#4| (-1031)) (-4364 |has| |#4| (-1031)) ((-4371 "*") |has| |#4| (-169)) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#4| (QUOTE (-169))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-228))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-357))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-362))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-712))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-779))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-831))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1079))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155)))))) (|HasCategory| |#4| (QUOTE (-357))) (-4028 (|HasCategory| |#4| (QUOTE (-169))) (|HasCategory| |#4| (QUOTE (-357))) (|HasCategory| |#4| (QUOTE (-1031)))) (-4028 (|HasCategory| |#4| (QUOTE (-169))) (|HasCategory| |#4| (QUOTE (-357)))) (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (QUOTE (-779))) (-4028 (|HasCategory| |#4| (QUOTE (-779))) (|HasCategory| |#4| (QUOTE (-831)))) (|HasCategory| |#4| (QUOTE (-831))) (|HasCategory| |#4| (QUOTE (-712))) (|HasCategory| |#4| (QUOTE (-169))) (-4028 (|HasCategory| |#4| (QUOTE (-169))) (|HasCategory| |#4| (QUOTE (-1031)))) (|HasCategory| |#4| (QUOTE (-362))) (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155)))) (-4028 (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#4| (QUOTE (-169))) (|HasCategory| |#4| (QUOTE (-228))) (|HasCategory| |#4| (QUOTE (-1031)))) (|HasCategory| |#4| (QUOTE (-228))) (|HasCategory| |#4| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-169)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-228)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-357)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-362)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-712)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-779)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-831)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-1031)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-1079))))) (-4028 (-12 (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-169))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-228))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-357))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-362))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-712))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-779))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-831))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-1079))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| (-553) (QUOTE (-833))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#4| (QUOTE (-228))) (|HasCategory| |#4| (QUOTE (-1031)))) (-4028 (-12 (|HasCategory| |#4| (QUOTE (-228))) (|HasCategory| |#4| (QUOTE (-1031)))) (|HasCategory| |#4| (QUOTE (-712))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155)))))) (-12 (|HasCategory| |#4| (QUOTE (-1079))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-4028 (|HasCategory| |#4| (QUOTE (-1031))) (-12 (|HasCategory| |#4| (QUOTE (-1079))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-1079)))) (-4028 (|HasAttribute| |#4| (QUOTE -4366)) (-12 (|HasCategory| |#4| (QUOTE (-228))) (|HasCategory| |#4| (QUOTE (-1031)))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155)))))) (|HasCategory| |#4| (QUOTE (-129))) (|HasCategory| |#4| (QUOTE (-25))) (-12 (|HasCategory| |#4| (QUOTE (-1079))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (|HasCategory| |#4| (LIST (QUOTE -600) (QUOTE (-845))))) +((-4366 -3988 (-3726 (|has| |#4| (-1031)) (|has| |#4| (-228))) (-3726 (|has| |#4| (-1031)) (|has| |#4| (-882 (-1155)))) (|has| |#4| (-6 -4366)) (-3726 (|has| |#4| (-1031)) (|has| |#4| (-626 (-553))))) (-4363 |has| |#4| (-1031)) (-4364 |has| |#4| (-1031)) ((-4371 "*") |has| |#4| (-169)) (-4369 . T)) +((-3988 (-12 (|HasCategory| |#4| (QUOTE (-169))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-228))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-357))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-362))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-712))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-779))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-831))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1079))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155)))))) (|HasCategory| |#4| (QUOTE (-357))) (-3988 (|HasCategory| |#4| (QUOTE (-169))) (|HasCategory| |#4| (QUOTE (-357))) (|HasCategory| |#4| (QUOTE (-1031)))) (-3988 (|HasCategory| |#4| (QUOTE (-169))) (|HasCategory| |#4| (QUOTE (-357)))) (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (QUOTE (-779))) (-3988 (|HasCategory| |#4| (QUOTE (-779))) (|HasCategory| |#4| (QUOTE (-831)))) (|HasCategory| |#4| (QUOTE (-831))) (|HasCategory| |#4| (QUOTE (-712))) (|HasCategory| |#4| (QUOTE (-169))) (-3988 (|HasCategory| |#4| (QUOTE (-169))) (|HasCategory| |#4| (QUOTE (-1031)))) (|HasCategory| |#4| (QUOTE (-362))) (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155)))) (-3988 (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#4| (QUOTE (-169))) (|HasCategory| |#4| (QUOTE (-228))) (|HasCategory| |#4| (QUOTE (-1031)))) (|HasCategory| |#4| (QUOTE (-228))) (|HasCategory| |#4| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-169)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-228)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-357)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-362)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-712)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-779)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-831)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-1031)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-1079))))) (-3988 (-12 (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-169))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-228))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-357))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-362))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-712))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-779))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-831))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-1031))) (-12 (|HasCategory| |#4| (QUOTE (-1079))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-3988 (-12 (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-169))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-228))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-357))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-362))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-712))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-779))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-831))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-1079))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| (-553) (QUOTE (-833))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#4| (QUOTE (-228))) (|HasCategory| |#4| (QUOTE (-1031)))) (-3988 (-12 (|HasCategory| |#4| (QUOTE (-228))) (|HasCategory| |#4| (QUOTE (-1031)))) (|HasCategory| |#4| (QUOTE (-712))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155)))))) (-12 (|HasCategory| |#4| (QUOTE (-1079))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553))))) (-3988 (|HasCategory| |#4| (QUOTE (-1031))) (-12 (|HasCategory| |#4| (QUOTE (-1079))) (|HasCategory| |#4| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#4| (QUOTE (-1079)))) (-3988 (|HasAttribute| |#4| (QUOTE -4366)) (-12 (|HasCategory| |#4| (QUOTE (-228))) (|HasCategory| |#4| (QUOTE (-1031)))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#4| (QUOTE (-1031))) (|HasCategory| |#4| (LIST (QUOTE -882) (QUOTE (-1155)))))) (|HasCategory| |#4| (QUOTE (-129))) (|HasCategory| |#4| (QUOTE (-25))) (|HasCategory| |#4| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#4| (QUOTE (-1079))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|))))) (-245 |n| R S) ((|constructor| (NIL "This constructor provides a direct product of \\spad{R}-modules with an \\spad{R}-module view."))) -((-4366 -4028 (-3791 (|has| |#3| (-1031)) (|has| |#3| (-228))) (-3791 (|has| |#3| (-1031)) (|has| |#3| (-882 (-1155)))) (|has| |#3| (-6 -4366)) (-3791 (|has| |#3| (-1031)) (|has| |#3| (-626 (-553))))) (-4363 |has| |#3| (-1031)) (-4364 |has| |#3| (-1031)) ((-4371 "*") |has| |#3| (-169)) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))))) (|HasCategory| |#3| (QUOTE (-357))) (-4028 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (QUOTE (-1031)))) (-4028 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-357)))) (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (QUOTE (-779))) (-4028 (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (QUOTE (-831)))) (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (QUOTE (-169))) (-4028 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-1031)))) (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (-4028 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1031)))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-169)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-228)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-357)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-362)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-712)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-779)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-831)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1031)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1079))))) (-4028 (-12 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| (-553) (QUOTE (-833))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1031)))) (-4028 (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1031)))) (|HasCategory| |#3| (QUOTE (-712))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-4028 (|HasCategory| |#3| (QUOTE (-1031))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1079)))) (-4028 (|HasAttribute| |#3| (QUOTE -4366)) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1031)))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))))) (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (QUOTE (-25))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (|HasCategory| |#3| (LIST (QUOTE -600) (QUOTE (-845))))) +((-4366 -3988 (-3726 (|has| |#3| (-1031)) (|has| |#3| (-228))) (-3726 (|has| |#3| (-1031)) (|has| |#3| (-882 (-1155)))) (|has| |#3| (-6 -4366)) (-3726 (|has| |#3| (-1031)) (|has| |#3| (-626 (-553))))) (-4363 |has| |#3| (-1031)) (-4364 |has| |#3| (-1031)) ((-4371 "*") |has| |#3| (-169)) (-4369 . T)) +((-3988 (-12 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))))) (|HasCategory| |#3| (QUOTE (-357))) (-3988 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (QUOTE (-1031)))) (-3988 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-357)))) (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (QUOTE (-779))) (-3988 (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (QUOTE (-831)))) (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (QUOTE (-169))) (-3988 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-1031)))) (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (-3988 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1031)))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-169)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-228)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-357)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-362)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-712)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-779)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-831)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1031)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1079))))) (-3988 (-12 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1031))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-3988 (-12 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| (-553) (QUOTE (-833))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1031)))) (-3988 (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1031)))) (|HasCategory| |#3| (QUOTE (-712))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-3988 (|HasCategory| |#3| (QUOTE (-1031))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1079)))) (-3988 (|HasAttribute| |#3| (QUOTE -4366)) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1031)))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))))) (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|))))) (-246 A R S V E) ((|constructor| (NIL "\\spadtype{DifferentialPolynomialCategory} is a category constructor specifying basic functions in an ordinary differential polynomial ring with a given ordered set of differential indeterminates. In addition,{} it implements defaults for the basic functions. The functions \\spadfun{order} and \\spadfun{weight} are extended from the set of derivatives of differential indeterminates to the set of differential polynomials. Other operations provided on differential polynomials are \\spadfun{leader},{} \\spadfun{initial},{} \\spadfun{separant},{} \\spadfun{differentialVariables},{} and \\spadfun{isobaric?}. Furthermore,{} if the ground ring is a differential ring,{} then evaluation (substitution of differential indeterminates by elements of the ground ring or by differential polynomials) is provided by \\spadfun{eval}. A convenient way of referencing derivatives is provided by the functions \\spadfun{makeVariable}. \\blankline To construct a domain using this constructor,{} one needs to provide a ground ring \\spad{R},{} an ordered set \\spad{S} of differential indeterminates,{} a ranking \\spad{V} on the set of derivatives of the differential indeterminates,{} and a set \\spad{E} of exponents in bijection with the set of differential monomials in the given differential indeterminates. \\blankline")) (|separant| (($ $) "\\spad{separant(p)} returns the partial derivative of the differential polynomial \\spad{p} with respect to its leader.")) (|initial| (($ $) "\\spad{initial(p)} returns the leading coefficient when the differential polynomial \\spad{p} is written as a univariate polynomial in its leader.")) (|leader| ((|#4| $) "\\spad{leader(p)} returns the derivative of the highest rank appearing in the differential polynomial \\spad{p} Note: an error occurs if \\spad{p} is in the ground ring.")) (|isobaric?| (((|Boolean|) $) "\\spad{isobaric?(p)} returns \\spad{true} if every differential monomial appearing in the differential polynomial \\spad{p} has same weight,{} and returns \\spad{false} otherwise.")) (|weight| (((|NonNegativeInteger|) $ |#3|) "\\spad{weight(p,{} s)} returns the maximum weight of all differential monomials appearing in the differential polynomial \\spad{p} when \\spad{p} is viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.") (((|NonNegativeInteger|) $) "\\spad{weight(p)} returns the maximum weight of all differential monomials appearing in the differential polynomial \\spad{p}.")) (|weights| (((|List| (|NonNegativeInteger|)) $ |#3|) "\\spad{weights(p,{} s)} returns a list of weights of differential monomials appearing in the differential polynomial \\spad{p} when \\spad{p} is viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.") (((|List| (|NonNegativeInteger|)) $) "\\spad{weights(p)} returns a list of weights of differential monomials appearing in differential polynomial \\spad{p}.")) (|degree| (((|NonNegativeInteger|) $ |#3|) "\\spad{degree(p,{} s)} returns the maximum degree of the differential polynomial \\spad{p} viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(p)} returns the order of the differential polynomial \\spad{p},{} which is the maximum number of differentiations of a differential indeterminate,{} among all those appearing in \\spad{p}.") (((|NonNegativeInteger|) $ |#3|) "\\spad{order(p,{}s)} returns the order of the differential polynomial \\spad{p} in differential indeterminate \\spad{s}.")) (|differentialVariables| (((|List| |#3|) $) "\\spad{differentialVariables(p)} returns a list of differential indeterminates occurring in a differential polynomial \\spad{p}.")) (|makeVariable| (((|Mapping| $ (|NonNegativeInteger|)) $) "\\spad{makeVariable(p)} views \\spad{p} as an element of a differential ring,{} in such a way that the \\spad{n}-th derivative of \\spad{p} may be simply referenced as \\spad{z}.\\spad{n} where \\spad{z} \\spad{:=} makeVariable(\\spad{p}). Note: In the interpreter,{} \\spad{z} is given as an internal map,{} which may be ignored.") (((|Mapping| $ (|NonNegativeInteger|)) |#3|) "\\spad{makeVariable(s)} views \\spad{s} as a differential indeterminate,{} in such a way that the \\spad{n}-th derivative of \\spad{s} may be simply referenced as \\spad{z}.\\spad{n} where \\spad{z} :=makeVariable(\\spad{s}). Note: In the interpreter,{} \\spad{z} is given as an internal map,{} which may be ignored."))) NIL @@ -922,7 +922,7 @@ NIL NIL (-248 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}."))) -((-4369 . T) (-4370 . T) (-4284 . T)) +((-4369 . T) (-4370 . T)) NIL (-249) ((|constructor| (NIL "TopLevelDrawFunctionsForCompiledFunctions provides top level functions for drawing graphics of expressions.")) (|recolor| (((|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) "\\spad{recolor()},{} uninteresting to top level user; exported in order to compile package.")) (|makeObject| (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSurface| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{makeObject(surface(f,{}g,{}h),{}a..b,{}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)}.") (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSurface| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(surface(f,{}g,{}h),{}a..b,{}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)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{makeObject(f,{}a..b,{}c..d,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric surface \\spad{f(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)}.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(f,{}a..b,{}c..d,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric surface \\spad{f(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)}; The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{makeObject(f,{}a..b,{}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)}.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(f,{}a..b,{}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)},{} and the options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|Float|))) "\\spad{makeObject(sp,{}curve(f,{}g,{}h),{}a..b)} returns the space \\spad{sp} of the domain \\spadtype{ThreeSpace} with the addition of the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(curve(f,{}g,{}h),{}a..b,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSpaceCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|))) "\\spad{makeObject(sp,{}curve(f,{}g,{}h),{}a..b)} returns the space \\spad{sp} of the domain \\spadtype{ThreeSpace} with the addition of the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSpaceCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(curve(f,{}g,{}h),{}a..b,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}; The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.")) (|draw| (((|ThreeDimensionalViewport|) (|ParametricSurface| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{draw(surface(f,{}g,{}h),{}a..b,{}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)}.") (((|ThreeDimensionalViewport|) (|ParametricSurface| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(surface(f,{}g,{}h),{}a..b,{}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)}; The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{draw(f,{}a..b,{}c..d)} draws the graph of the parametric surface \\spad{f(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)} The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(f,{}a..b,{}c..d)} draws the graph of the parametric surface \\spad{f(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)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{draw(f,{}a..b,{}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)}.") (((|ThreeDimensionalViewport|) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(f,{}a..b,{}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)}. and the options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|Float|))) "\\spad{draw(f,{}a..b,{}l)} draws the graph of the parametric curve \\spad{f} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|ThreeDimensionalViewport|) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(f,{}a..b,{}l)} draws the graph of the parametric curve \\spad{f} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|ParametricSpaceCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|))) "\\spad{draw(curve(f,{}g,{}h),{}a..b,{}l)} draws the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|ThreeDimensionalViewport|) (|ParametricSpaceCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(curve(f,{}g,{}h),{}a..b,{}l)} draws the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|TwoDimensionalViewport|) (|ParametricPlaneCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|))) "\\spad{draw(curve(f,{}g),{}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)}.") (((|TwoDimensionalViewport|) (|ParametricPlaneCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(curve(f,{}g),{}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)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|TwoDimensionalViewport|) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|))) "\\spad{draw(f,{}a..b)} draws the graph of \\spad{y = f(x)} as \\spad{x} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|TwoDimensionalViewport|) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(f,{}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)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied."))) @@ -963,7 +963,7 @@ NIL (-258 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"))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-6 -4367)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#1| (QUOTE (-891))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#3| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#3| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#3| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#3| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) +((|HasCategory| |#1| (QUOTE (-891))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#3| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#3| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#3| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#3| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) (-259 A S) ((|constructor| (NIL "\\spadtype{DifferentialVariableCategory} constructs the set of derivatives of a given set of (ordinary) differential indeterminates. If \\spad{x},{}...,{}\\spad{y} is an ordered set of differential indeterminates,{} and the prime notation is used for differentiation,{} then the set of derivatives (including zero-th order) of the differential indeterminates is \\spad{x},{}\\spad{x'},{}\\spad{x''},{}...,{} \\spad{y},{}\\spad{y'},{}\\spad{y''},{}... (Note: in the interpreter,{} the \\spad{n}-th derivative of \\spad{y} is displayed as \\spad{y} with a subscript \\spad{n}.) This set is viewed as a set of algebraic indeterminates,{} totally ordered in a way compatible with differentiation and the given order on the differential indeterminates. Such a total order is called a ranking of the differential indeterminates. \\blankline A domain in this category is needed to construct a differential polynomial domain. Differential polynomials are ordered by a ranking on the derivatives,{} and by an order (extending the ranking) on on the set of differential monomials. One may thus associate a domain in this category with a ranking of the differential indeterminates,{} just as one associates a domain in the category \\spadtype{OrderedAbelianMonoidSup} with an ordering of the set of monomials in a set of algebraic indeterminates. The ranking is specified through the binary relation \\spadfun{<}. For example,{} one may define one derivative to be less than another by lexicographically comparing first the \\spadfun{order},{} then the given order of the differential indeterminates appearing in the derivatives. This is the default implementation. \\blankline The notion of weight generalizes that of degree. A polynomial domain may be made into a graded ring if a weight function is given on the set of indeterminates,{} Very often,{} a grading is the first step in ordering the set of monomials. For differential polynomial domains,{} this constructor provides a function \\spadfun{weight},{} which allows the assignment of a non-negative number to each derivative of a differential indeterminate. For example,{} one may define the weight of a derivative to be simply its \\spadfun{order} (this is the default assignment). This weight function can then be extended to the set of all differential polynomials,{} providing a graded ring structure.")) (|coerce| (($ |#2|) "\\spad{coerce(s)} returns \\spad{s},{} viewed as the zero-th order derivative of \\spad{s}.")) (|differentiate| (($ $ (|NonNegativeInteger|)) "\\spad{differentiate(v,{} n)} returns the \\spad{n}-th derivative of \\spad{v}.") (($ $) "\\spad{differentiate(v)} returns the derivative of \\spad{v}.")) (|weight| (((|NonNegativeInteger|) $) "\\spad{weight(v)} returns the weight of the derivative \\spad{v}.")) (|variable| ((|#2| $) "\\spad{variable(v)} returns \\spad{s} if \\spad{v} is any derivative of the differential indeterminate \\spad{s}.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(v)} returns \\spad{n} if \\spad{v} is the \\spad{n}-th derivative of any differential indeterminate.")) (|makeVariable| (($ |#2| (|NonNegativeInteger|)) "\\spad{makeVariable(s,{} n)} returns the \\spad{n}-th derivative of a differential indeterminate \\spad{s} as an algebraic indeterminate."))) NIL @@ -1008,11 +1008,11 @@ NIL ((|constructor| (NIL "A domain used in the construction of the exterior algebra on a set \\spad{X} over a ring \\spad{R}. This domain represents the set of all ordered subsets of the set \\spad{X},{} assumed to be in correspondance with {1,{}2,{}3,{} ...}. The ordered subsets are themselves ordered lexicographically and are in bijective correspondance with an ordered basis of the exterior algebra. In this domain we are dealing strictly with the exponents of basis elements which can only be 0 or 1. \\blankline The multiplicative identity element of the exterior algebra corresponds to the empty subset of \\spad{X}. A coerce from List Integer to an ordered basis element is provided to allow the convenient input of expressions. Another exported function forgets the ordered structure and simply returns the list corresponding to an ordered subset.")) (|Nul| (($ (|NonNegativeInteger|)) "\\spad{Nul()} gives the basis element 1 for the algebra generated by \\spad{n} generators.")) (|exponents| (((|List| (|Integer|)) $) "\\spad{exponents(x)} converts a domain element into a list of zeros and ones corresponding to the exponents in the basis element that \\spad{x} represents.")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(x)} gives the numbers of 1\\spad{'s} in \\spad{x},{} \\spadignore{i.e.} the number of non-zero exponents in the basis element that \\spad{x} represents.")) (|coerce| (($ (|List| (|Integer|))) "\\spad{coerce(l)} converts a list of 0\\spad{'s} and 1\\spad{'s} into a basis element,{} where 1 (respectively 0) designates that the variable of the corresponding index of \\spad{l} is (respectively,{} is not) present. Error: if an element of \\spad{l} is not 0 or 1."))) NIL NIL -(-270 R -3219) +(-270 R -3105) ((|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{\\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 -(-271 R -3219) +(-271 R -3105) ((|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{\\spad{ki}} was rewritten as \\spad{\\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 @@ -1034,7 +1034,7 @@ NIL ((|HasCategory| |#2| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-1079)))) (-276 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}."))) -((-4370 . T) (-4284 . T)) +((-4370 . T)) NIL (-277 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}."))) @@ -1060,7 +1060,7 @@ NIL ((|constructor| (NIL "An eltable aggregate is one which can be viewed as a function. For example,{} the list \\axiom{[1,{}7,{}4]} can applied to 0,{}1,{} and 2 respectively will return the integers 1,{}7,{} and 4; thus this list may be viewed as mapping 0 to 1,{} 1 to 7 and 2 to 4. In general,{} an aggregate can map members of a domain {\\em Dom} to an image domain {\\em Im}.")) (|qsetelt!| ((|#2| $ |#1| |#2|) "\\spad{qsetelt!(u,{}x,{}y)} sets the image of \\axiom{\\spad{x}} to be \\axiom{\\spad{y}} under \\axiom{\\spad{u}},{} without checking that \\axiom{\\spad{x}} is in the domain of \\axiom{\\spad{u}}. If such a check is required use the function \\axiom{setelt}.")) (|setelt| ((|#2| $ |#1| |#2|) "\\spad{setelt(u,{}x,{}y)} sets the image of \\spad{x} to be \\spad{y} under \\spad{u},{} assuming \\spad{x} is in the domain of \\spad{u}. Error: if \\spad{x} is not in the domain of \\spad{u}.")) (|qelt| ((|#2| $ |#1|) "\\spad{qelt(u,{} x)} applies \\axiom{\\spad{u}} to \\axiom{\\spad{x}} without checking whether \\axiom{\\spad{x}} is in the domain of \\axiom{\\spad{u}}. If \\axiom{\\spad{x}} is not in the domain of \\axiom{\\spad{u}} a memory-access violation may occur. If a check on whether \\axiom{\\spad{x}} is in the domain of \\axiom{\\spad{u}} is required,{} use the function \\axiom{elt}.")) (|elt| ((|#2| $ |#1| |#2|) "\\spad{elt(u,{} x,{} y)} applies \\spad{u} to \\spad{x} if \\spad{x} is in the domain of \\spad{u},{} and returns \\spad{y} otherwise. For example,{} if \\spad{u} is a polynomial in \\axiom{\\spad{x}} over the rationals,{} \\axiom{elt(\\spad{u},{}\\spad{n},{}0)} may define the coefficient of \\axiom{\\spad{x}} to the power \\spad{n},{} returning 0 when \\spad{n} is out of range."))) NIL NIL -(-283 S R |Mod| -3233 -3858 |exactQuo|) +(-283 S R |Mod| -3668 -3160 |exactQuo|) ((|constructor| (NIL "These domains are used for the factorization and gcds of univariate polynomials over the integers in order to work modulo different primes. See \\spadtype{ModularRing},{} \\spadtype{ModularField}")) (|elt| ((|#2| $ |#2|) "\\spad{elt(x,{}r)} or \\spad{x}.\\spad{r} \\undocumented")) (|inv| (($ $) "\\spad{inv(x)} \\undocumented")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(x)} \\undocumented")) (|exQuo| (((|Union| $ "failed") $ $) "\\spad{exQuo(x,{}y)} \\undocumented")) (|reduce| (($ |#2| |#3|) "\\spad{reduce(r,{}m)} \\undocumented")) (|coerce| ((|#2| $) "\\spad{coerce(x)} \\undocumented")) (|modulus| ((|#3| $) "\\spad{modulus(x)} \\undocumented"))) ((-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL @@ -1082,21 +1082,21 @@ NIL NIL (-288 S) ((|constructor| (NIL "Equations as mathematical objects. All properties of the basis domain,{} \\spadignore{e.g.} being an abelian group are carried over the equation domain,{} by performing the structural operations on the left and on the right hand side.")) (|subst| (($ $ $) "\\spad{subst(eq1,{}eq2)} substitutes \\spad{eq2} into both sides of \\spad{eq1} the \\spad{lhs} of \\spad{eq2} should be a kernel")) (|inv| (($ $) "\\spad{inv(x)} returns the multiplicative inverse of \\spad{x}.")) (/ (($ $ $) "\\spad{e1/e2} produces a new equation by dividing the left and right hand sides of equations e1 and e2.")) (|factorAndSplit| (((|List| $) $) "\\spad{factorAndSplit(eq)} make the right hand side 0 and factors the new left hand side. Each factor is equated to 0 and put into the resulting list without repetitions.")) (|rightOne| (((|Union| $ "failed") $) "\\spad{rightOne(eq)} divides by the right hand side.") (((|Union| $ "failed") $) "\\spad{rightOne(eq)} divides by the right hand side,{} if possible.")) (|leftOne| (((|Union| $ "failed") $) "\\spad{leftOne(eq)} divides by the left hand side.") (((|Union| $ "failed") $) "\\spad{leftOne(eq)} divides by the left hand side,{} if possible.")) (* (($ $ |#1|) "\\spad{eqn*x} produces a new equation by multiplying both sides of equation eqn by \\spad{x}.") (($ |#1| $) "\\spad{x*eqn} produces a new equation by multiplying both sides of equation eqn by \\spad{x}.")) (- (($ $ |#1|) "\\spad{eqn-x} produces a new equation by subtracting \\spad{x} from both sides of equation eqn.") (($ |#1| $) "\\spad{x-eqn} produces a new equation by subtracting both sides of equation eqn from \\spad{x}.")) (|rightZero| (($ $) "\\spad{rightZero(eq)} subtracts the right hand side.")) (|leftZero| (($ $) "\\spad{leftZero(eq)} subtracts the left hand side.")) (+ (($ $ |#1|) "\\spad{eqn+x} produces a new equation by adding \\spad{x} to both sides of equation eqn.") (($ |#1| $) "\\spad{x+eqn} produces a new equation by adding \\spad{x} to both sides of equation eqn.")) (|eval| (($ $ (|List| $)) "\\spad{eval(eqn,{} [x1=v1,{} ... xn=vn])} replaces \\spad{xi} by \\spad{vi} in equation \\spad{eqn}.") (($ $ $) "\\spad{eval(eqn,{} x=f)} replaces \\spad{x} by \\spad{f} in equation \\spad{eqn}.")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(f,{}eqn)} constructs a new equation by applying \\spad{f} to both sides of \\spad{eqn}.")) (|rhs| ((|#1| $) "\\spad{rhs(eqn)} returns the right hand side of equation \\spad{eqn}.")) (|lhs| ((|#1| $) "\\spad{lhs(eqn)} returns the left hand side of equation \\spad{eqn}.")) (|swap| (($ $) "\\spad{swap(eq)} interchanges left and right hand side of equation \\spad{eq}.")) (|equation| (($ |#1| |#1|) "\\spad{equation(a,{}b)} creates an equation.")) (= (($ |#1| |#1|) "\\spad{a=b} creates an equation."))) -((-4366 -4028 (|has| |#1| (-1031)) (|has| |#1| (-466))) (-4363 |has| |#1| (-1031)) (-4364 |has| |#1| (-1031))) -((|HasCategory| |#1| (QUOTE (-357))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-1031)))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-1031)))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-1031)))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-1031)))) (-4028 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-712)))) (|HasCategory| |#1| (QUOTE (-466))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-1079)))) (-4028 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#1| (QUOTE (-1091)))) (|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-296))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-466)))) (-4028 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-712)))) (-4028 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-1031)))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#1| (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25)))) +((-4366 -3988 (|has| |#1| (-1031)) (|has| |#1| (-466))) (-4363 |has| |#1| (-1031)) (-4364 |has| |#1| (-1031))) +((|HasCategory| |#1| (QUOTE (-357))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-1031)))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-1031)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-1031)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-1031)))) (-3988 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-712)))) (|HasCategory| |#1| (QUOTE (-466))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-1079)))) (-3988 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#1| (QUOTE (-1091)))) (|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-296))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-466)))) (-3988 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-712)))) (-3988 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-1031)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#1| (QUOTE (-169)))) (-289 |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."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2669) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3359) (|devaluate| |#2|)))))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-1079))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2578) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3256) (|devaluate| |#2|)))))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-1079))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845))))) (-290) ((|constructor| (NIL "ErrorFunctions implements error functions callable from the system interpreter. Typically,{} these functions would be called in user functions. The simple forms of the functions take one argument which is either a string (an error message) or a list of strings which all together make up a message. The list can contain formatting codes (see below). The more sophisticated versions takes two arguments where the first argument is the name of the function from which the error was invoked and the second argument is either a string or a list of strings,{} as above. When you use the one argument version in an interpreter function,{} the system will automatically insert the name of the function as the new first argument. Thus in the user interpreter function \\indented{2}{\\spad{f x == if x < 0 then error \"negative argument\" else x}} the call to error will actually be of the form \\indented{2}{\\spad{error(\"f\",{}\"negative argument\")}} because the interpreter will have created a new first argument. \\blankline Formatting codes: error messages may contain the following formatting codes (they should either start or end a string or else have blanks around them): \\indented{3}{\\spad{\\%l}\\space{6}start a new line} \\indented{3}{\\spad{\\%b}\\space{6}start printing in a bold font (where available)} \\indented{3}{\\spad{\\%d}\\space{6}stop\\space{2}printing in a bold font (where available)} \\indented{3}{\\spad{ \\%ceon}\\space{2}start centering message lines} \\indented{3}{\\spad{\\%ceoff}\\space{2}stop\\space{2}centering message lines} \\indented{3}{\\spad{\\%rjon}\\space{3}start displaying lines \"ragged left\"} \\indented{3}{\\spad{\\%rjoff}\\space{2}stop\\space{2}displaying lines \"ragged left\"} \\indented{3}{\\spad{\\%i}\\space{6}indent\\space{3}following lines 3 additional spaces} \\indented{3}{\\spad{\\%u}\\space{6}unindent following lines 3 additional spaces} \\indented{3}{\\spad{\\%xN}\\space{5}insert \\spad{N} blanks (eg,{} \\spad{\\%x10} inserts 10 blanks)} \\blankline")) (|error| (((|Exit|) (|String|) (|List| (|String|))) "\\spad{error(nam,{}lmsg)} displays error messages \\spad{lmsg} preceded by a message containing the name \\spad{nam} of the function in which the error is contained.") (((|Exit|) (|String|) (|String|)) "\\spad{error(nam,{}msg)} displays error message \\spad{msg} preceded by a message containing the name \\spad{nam} of the function in which the error is contained.") (((|Exit|) (|List| (|String|))) "\\spad{error(lmsg)} displays error message \\spad{lmsg} and terminates.") (((|Exit|) (|String|)) "\\spad{error(msg)} displays error message \\spad{msg} and terminates."))) NIL NIL -(-291 -3219 S) +(-291 -3105 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 -(-292 E -3219) +(-292 E -3105) ((|constructor| (NIL "This package allows a mapping \\spad{E} \\spad{->} \\spad{F} to be lifted to a kernel over \\spad{E}; This lifting can fail if the operator of the kernel cannot be applied in \\spad{F}; Do not use this package with \\spad{E} = \\spad{F},{} since this may drop some properties of the operators.")) (|map| ((|#2| (|Mapping| |#2| |#1|) (|Kernel| |#1|)) "\\spad{map(f,{} k)} returns \\spad{g = op(f(a1),{}...,{}f(an))} where \\spad{k = op(a1,{}...,{}an)}."))) NIL NIL @@ -1144,7 +1144,7 @@ NIL ((|constructor| (NIL "This category provides \\spadfun{eval} operations. A domain may belong to this category if it is possible to make ``evaluation\\spad{''} substitutions.")) (|eval| (($ $ (|List| (|Equation| |#1|))) "\\spad{eval(f,{} [x1 = v1,{}...,{}xn = vn])} replaces \\spad{xi} by \\spad{vi} in \\spad{f}.") (($ $ (|Equation| |#1|)) "\\spad{eval(f,{}x = v)} replaces \\spad{x} by \\spad{v} in \\spad{f}."))) NIL NIL -(-304 -3219) +(-304 -3105) ((|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 @@ -1159,7 +1159,7 @@ NIL (-307 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))}."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-891))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-142))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-144))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-1004))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-806))) (-4028 (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-806))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-833)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-1130))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-228))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -507) (QUOTE (-1155)) (LIST (QUOTE -1224) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -303) (LIST (QUOTE -1224) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -280) (LIST (QUOTE -1224) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)) (LIST (QUOTE -1224) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-301))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-538))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-833))) (-12 (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-891))) (|HasCategory| $ (QUOTE (-142)))) (-4028 (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-142))) (-12 (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-891))) (|HasCategory| $ (QUOTE (-142)))))) +((|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-891))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-142))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-144))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-1004))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-806))) (-3988 (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-806))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-833)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-1130))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-228))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -507) (QUOTE (-1155)) (LIST (QUOTE -1224) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -303) (LIST (QUOTE -1224) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (LIST (QUOTE -280) (LIST (QUOTE -1224) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)) (LIST (QUOTE -1224) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-301))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-538))) (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-833))) (-12 (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-891))) (|HasCategory| $ (QUOTE (-142)))) (-3988 (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-142))) (-12 (|HasCategory| (-1224 |#1| |#2| |#3| |#4|) (QUOTE (-891))) (|HasCategory| $ (QUOTE (-142)))))) (-308 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 @@ -1170,9 +1170,9 @@ NIL NIL (-310 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."))) -((-4366 -4028 (-3791 (|has| |#1| (-1031)) (|has| |#1| (-626 (-553)))) (-12 (|has| |#1| (-545)) (-4028 (-3791 (|has| |#1| (-1031)) (|has| |#1| (-626 (-553)))) (|has| |#1| (-1031)) (|has| |#1| (-466)))) (|has| |#1| (-1031)) (|has| |#1| (-466))) (-4364 |has| |#1| (-169)) (-4363 |has| |#1| (-169)) ((-4371 "*") |has| |#1| (-545)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-545)) (-4361 |has| |#1| (-545))) -((-4028 (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| |#1| (QUOTE (-545))) (-4028 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-1031)))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (-4028 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-1091)))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-1031)))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-1031)))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-1031)))) (-12 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545)))) (-4028 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-545)))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553))))) (-4028 (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-1091)))) (-4028 (|HasCategory| |#1| (QUOTE (-21))) (-12 (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))))) (-4028 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-1091)))) (-4028 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))))) (-4028 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-1031)))) (-4028 (-12 (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1091))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| $ (QUOTE (-1031))) (|HasCategory| $ (LIST (QUOTE -1020) (QUOTE (-553))))) -(-311 R -3219) +((-4366 -3988 (-3726 (|has| |#1| (-1031)) (|has| |#1| (-626 (-553)))) (-12 (|has| |#1| (-545)) (-3988 (-3726 (|has| |#1| (-1031)) (|has| |#1| (-626 (-553)))) (|has| |#1| (-1031)) (|has| |#1| (-466)))) (|has| |#1| (-1031)) (|has| |#1| (-466))) (-4364 |has| |#1| (-169)) (-4363 |has| |#1| (-169)) ((-4371 "*") |has| |#1| (-545)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-545)) (-4361 |has| |#1| (-545))) +((-3988 (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| |#1| (QUOTE (-545))) (-3988 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-1031)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (-3988 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-1091)))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-1031)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-1031)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-1031)))) (-12 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545)))) (-3988 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553))))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-1091)))) (-3988 (|HasCategory| |#1| (QUOTE (-21))) (-12 (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))))) (-3988 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-1091)))) (-3988 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))))) (-3988 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-1031)))) (-3988 (-12 (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1091))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| $ (QUOTE (-1031))) (|HasCategory| $ (LIST (QUOTE -1020) (QUOTE (-553))))) +(-311 R -3105) ((|constructor| (NIL "Taylor series solutions of explicit ODE\\spad{'s}.")) (|seriesSolve| (((|Any|) |#2| (|BasicOperator|) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve(eq,{} y,{} x = a,{} [b0,{}...,{}bn])} is equivalent to \\spad{seriesSolve(eq = 0,{} y,{} x = a,{} [b0,{}...,{}b(n-1)])}.") (((|Any|) |#2| (|BasicOperator|) (|Equation| |#2|) (|Equation| |#2|)) "\\spad{seriesSolve(eq,{} y,{} x = a,{} y a = b)} is equivalent to \\spad{seriesSolve(eq=0,{} y,{} x=a,{} y a = b)}.") (((|Any|) |#2| (|BasicOperator|) (|Equation| |#2|) |#2|) "\\spad{seriesSolve(eq,{} y,{} x = a,{} b)} is equivalent to \\spad{seriesSolve(eq = 0,{} y,{} x = a,{} y a = b)}.") (((|Any|) (|Equation| |#2|) (|BasicOperator|) (|Equation| |#2|) |#2|) "\\spad{seriesSolve(eq,{}y,{} x=a,{} b)} is equivalent to \\spad{seriesSolve(eq,{} y,{} x=a,{} y a = b)}.") (((|Any|) (|List| |#2|) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| (|Equation| |#2|))) "\\spad{seriesSolve([eq1,{}...,{}eqn],{} [y1,{}...,{}yn],{} x = a,{}[y1 a = b1,{}...,{} yn a = bn])} is equivalent to \\spad{seriesSolve([eq1=0,{}...,{}eqn=0],{} [y1,{}...,{}yn],{} x = a,{} [y1 a = b1,{}...,{} yn a = bn])}.") (((|Any|) (|List| |#2|) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve([eq1,{}...,{}eqn],{} [y1,{}...,{}yn],{} x=a,{} [b1,{}...,{}bn])} is equivalent to \\spad{seriesSolve([eq1=0,{}...,{}eqn=0],{} [y1,{}...,{}yn],{} x=a,{} [b1,{}...,{}bn])}.") (((|Any|) (|List| (|Equation| |#2|)) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve([eq1,{}...,{}eqn],{} [y1,{}...,{}yn],{} x=a,{} [b1,{}...,{}bn])} is equivalent to \\spad{seriesSolve([eq1,{}...,{}eqn],{} [y1,{}...,{}yn],{} x = a,{} [y1 a = b1,{}...,{} yn a = bn])}.") (((|Any|) (|List| (|Equation| |#2|)) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| (|Equation| |#2|))) "\\spad{seriesSolve([eq1,{}...,{}eqn],{}[y1,{}...,{}yn],{}x = a,{}[y1 a = b1,{}...,{}yn a = bn])} returns a taylor series solution of \\spad{[eq1,{}...,{}eqn]} around \\spad{x = a} with initial conditions \\spad{\\spad{yi}(a) = \\spad{bi}}. Note: eqi must be of the form \\spad{\\spad{fi}(x,{} y1 x,{} y2 x,{}...,{} yn x) y1'(x) + \\spad{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 @@ -1183,7 +1183,7 @@ NIL (-313 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."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|)))) (|HasCategory| (-401 (-553)) (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-357))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasSignature| |#1| (LIST (QUOTE -3212) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (-4028 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -1619) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3611) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|)))) (|HasCategory| (-401 (-553)) (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-357))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasSignature| |#1| (LIST (QUOTE -3110) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (-3988 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3406) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3506) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|))))))) (-314 M) ((|constructor| (NIL "computes various functions on factored arguments.")) (|log| (((|List| (|Record| (|:| |coef| (|NonNegativeInteger|)) (|:| |logand| |#1|))) (|Factored| |#1|)) "\\spad{log(f)} returns \\spad{[(a1,{}b1),{}...,{}(am,{}bm)]} such that the logarithm of \\spad{f} is equal to \\spad{a1*log(b1) + ... + am*log(bm)}.")) (|nthRoot| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#1|) (|:| |radicand| (|List| |#1|))) (|Factored| |#1|) (|NonNegativeInteger|)) "\\spad{nthRoot(f,{} n)} returns \\spad{(p,{} r,{} [r1,{}...,{}rm])} such that the \\spad{n}th-root of \\spad{f} is equal to \\spad{r * \\spad{p}th-root(r1 * ... * rm)},{} where \\spad{r1},{}...,{}\\spad{rm} are distinct factors of \\spad{f},{} each of which has an exponent smaller than \\spad{p} in \\spad{f}."))) NIL @@ -1215,17 +1215,17 @@ NIL (-321 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."))) ((-4370 . T) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-4028 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) -(-322 S -3219) +((-3988 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) +(-322 S -3105) ((|constructor| (NIL "FiniteAlgebraicExtensionField {\\em F} is the category of fields which are finite algebraic extensions of the field {\\em F}. If {\\em F} is finite then any finite algebraic extension of {\\em F} is finite,{} too. Let {\\em K} be a finite algebraic extension of the finite field {\\em F}. The exponentiation of elements of {\\em K} defines a \\spad{Z}-module structure on the multiplicative group of {\\em K}. The additive group of {\\em K} becomes a module over the ring of polynomials over {\\em F} via the operation \\spadfun{linearAssociatedExp}(a:K,{}f:SparseUnivariatePolynomial \\spad{F}) which is linear over {\\em F},{} \\spadignore{i.e.} for elements {\\em a} from {\\em K},{} {\\em c,{}d} from {\\em F} and {\\em f,{}g} univariate polynomials over {\\em F} we have \\spadfun{linearAssociatedExp}(a,{}cf+dg) equals {\\em c} times \\spadfun{linearAssociatedExp}(a,{}\\spad{f}) plus {\\em d} times \\spadfun{linearAssociatedExp}(a,{}\\spad{g}). Therefore \\spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\\em F[X]}: \\spadfun{linearAssociatedExp}(a,{}monomial(1,{}\\spad{k})\\spad{\\$}SUP(\\spad{F})) is defined to be \\spadfun{Frobenius}(a,{}\\spad{k}) which is {\\em a**(q**k)} where {\\em q=size()\\$F}. The operations order and discreteLog associated with the multiplicative exponentiation have additive analogues associated to the operation \\spadfun{linearAssociatedExp}. These are the functions \\spadfun{linearAssociatedOrder} and \\spadfun{linearAssociatedLog},{} respectively.")) (|linearAssociatedLog| (((|Union| (|SparseUnivariatePolynomial| |#2|) "failed") $ $) "\\spad{linearAssociatedLog(b,{}a)} returns a polynomial {\\em g},{} such that the \\spadfun{linearAssociatedExp}(\\spad{b},{}\\spad{g}) equals {\\em a}. If there is no such polynomial {\\em g},{} then \\spadfun{linearAssociatedLog} fails.") (((|SparseUnivariatePolynomial| |#2|) $) "\\spad{linearAssociatedLog(a)} returns a polynomial {\\em g},{} such that \\spadfun{linearAssociatedExp}(normalElement(),{}\\spad{g}) equals {\\em a}.")) (|linearAssociatedOrder| (((|SparseUnivariatePolynomial| |#2|) $) "\\spad{linearAssociatedOrder(a)} retruns the monic polynomial {\\em g} of least degree,{} such that \\spadfun{linearAssociatedExp}(a,{}\\spad{g}) is 0.")) (|linearAssociatedExp| (($ $ (|SparseUnivariatePolynomial| |#2|)) "\\spad{linearAssociatedExp(a,{}f)} is linear over {\\em F},{} \\spadignore{i.e.} for elements {\\em a} from {\\em \\$},{} {\\em c,{}d} form {\\em F} and {\\em f,{}g} univariate polynomials over {\\em F} we have \\spadfun{linearAssociatedExp}(a,{}cf+dg) equals {\\em c} times \\spadfun{linearAssociatedExp}(a,{}\\spad{f}) plus {\\em d} times \\spadfun{linearAssociatedExp}(a,{}\\spad{g}). Therefore \\spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\\em F[X]}: \\spadfun{linearAssociatedExp}(a,{}monomial(1,{}\\spad{k})\\spad{\\$}SUP(\\spad{F})) is defined to be \\spadfun{Frobenius}(a,{}\\spad{k}) which is {\\em a**(q**k)},{} where {\\em q=size()\\$F}.")) (|generator| (($) "\\spad{generator()} returns a root of the defining polynomial. This element generates the field as an algebra over the ground field.")) (|normal?| (((|Boolean|) $) "\\spad{normal?(a)} tests whether the element \\spad{a} is normal over the ground field \\spad{F},{} \\spadignore{i.e.} \\spad{a**(q**i),{} 0 <= i <= extensionDegree()-1} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. Implementation according to Lidl/Niederreiter: Theorem 2.39.")) (|normalElement| (($) "\\spad{normalElement()} returns a element,{} normal over the ground field \\spad{F},{} \\spadignore{i.e.} \\spad{a**(q**i),{} 0 <= i < extensionDegree()} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. At the first call,{} the element is computed by \\spadfunFrom{createNormalElement}{FiniteAlgebraicExtensionField} then cached in a global variable. On subsequent calls,{} the element is retrieved by referencing the global variable.")) (|createNormalElement| (($) "\\spad{createNormalElement()} computes a normal element over the ground field \\spad{F},{} that is,{} \\spad{a**(q**i),{} 0 <= i < extensionDegree()} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. Reference: Such an element exists Lidl/Niederreiter: Theorem 2.35.")) (|trace| (($ $ (|PositiveInteger|)) "\\spad{trace(a,{}d)} computes the trace of \\spad{a} with respect to the field of extension degree \\spad{d} over the ground field of size \\spad{q}. Error: if \\spad{d} does not divide the extension degree of \\spad{a}. Note: \\spad{trace(a,{}d) = reduce(+,{}[a**(q**(d*i)) for i in 0..n/d])}.") ((|#2| $) "\\spad{trace(a)} computes the trace of \\spad{a} with respect to the field considered as an algebra with 1 over the ground field \\spad{F}.")) (|norm| (($ $ (|PositiveInteger|)) "\\spad{norm(a,{}d)} computes the norm of \\spad{a} with respect to the field of extension degree \\spad{d} over the ground field of size. Error: if \\spad{d} does not divide the extension degree of \\spad{a}. Note: norm(a,{}\\spad{d}) = reduce(*,{}[a**(\\spad{q**}(d*i)) for \\spad{i} in 0..\\spad{n/d}])") ((|#2| $) "\\spad{norm(a)} computes the norm of \\spad{a} with respect to the field considered as an algebra with 1 over the ground field \\spad{F}.")) (|degree| (((|PositiveInteger|) $) "\\spad{degree(a)} returns the degree of the minimal polynomial of an element \\spad{a} over the ground field \\spad{F}.")) (|extensionDegree| (((|PositiveInteger|)) "\\spad{extensionDegree()} returns the degree of field extension.")) (|definingPolynomial| (((|SparseUnivariatePolynomial| |#2|)) "\\spad{definingPolynomial()} returns the polynomial used to define the field extension.")) (|minimalPolynomial| (((|SparseUnivariatePolynomial| $) $ (|PositiveInteger|)) "\\spad{minimalPolynomial(x,{}n)} computes the minimal polynomial of \\spad{x} over the field of extension degree \\spad{n} over the ground field \\spad{F}.") (((|SparseUnivariatePolynomial| |#2|) $) "\\spad{minimalPolynomial(a)} returns the minimal polynomial of an element \\spad{a} over the ground field \\spad{F}.")) (|represents| (($ (|Vector| |#2|)) "\\spad{represents([a1,{}..,{}an])} returns \\spad{a1*v1 + ... + an*vn},{} where \\spad{v1},{}...,{}\\spad{vn} are the elements of the fixed basis.")) (|coordinates| (((|Matrix| |#2|) (|Vector| $)) "\\spad{coordinates([v1,{}...,{}vm])} returns the coordinates of the \\spad{vi}\\spad{'s} with to the fixed basis. The coordinates of \\spad{vi} are contained in the \\spad{i}th row of the matrix returned by this function.") (((|Vector| |#2|) $) "\\spad{coordinates(a)} returns the coordinates of \\spad{a} with respect to the fixed \\spad{F}-vectorspace basis.")) (|basis| (((|Vector| $) (|PositiveInteger|)) "\\spad{basis(n)} returns a fixed basis of a subfield of \\spad{\\$} as \\spad{F}-vectorspace.") (((|Vector| $)) "\\spad{basis()} returns a fixed basis of \\spad{\\$} as \\spad{F}-vectorspace."))) NIL ((|HasCategory| |#2| (QUOTE (-362)))) -(-323 -3219) +(-323 -3105) ((|constructor| (NIL "FiniteAlgebraicExtensionField {\\em F} is the category of fields which are finite algebraic extensions of the field {\\em F}. If {\\em F} is finite then any finite algebraic extension of {\\em F} is finite,{} too. Let {\\em K} be a finite algebraic extension of the finite field {\\em F}. The exponentiation of elements of {\\em K} defines a \\spad{Z}-module structure on the multiplicative group of {\\em K}. The additive group of {\\em K} becomes a module over the ring of polynomials over {\\em F} via the operation \\spadfun{linearAssociatedExp}(a:K,{}f:SparseUnivariatePolynomial \\spad{F}) which is linear over {\\em F},{} \\spadignore{i.e.} for elements {\\em a} from {\\em K},{} {\\em c,{}d} from {\\em F} and {\\em f,{}g} univariate polynomials over {\\em F} we have \\spadfun{linearAssociatedExp}(a,{}cf+dg) equals {\\em c} times \\spadfun{linearAssociatedExp}(a,{}\\spad{f}) plus {\\em d} times \\spadfun{linearAssociatedExp}(a,{}\\spad{g}). Therefore \\spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\\em F[X]}: \\spadfun{linearAssociatedExp}(a,{}monomial(1,{}\\spad{k})\\spad{\\$}SUP(\\spad{F})) is defined to be \\spadfun{Frobenius}(a,{}\\spad{k}) which is {\\em a**(q**k)} where {\\em q=size()\\$F}. The operations order and discreteLog associated with the multiplicative exponentiation have additive analogues associated to the operation \\spadfun{linearAssociatedExp}. These are the functions \\spadfun{linearAssociatedOrder} and \\spadfun{linearAssociatedLog},{} respectively.")) (|linearAssociatedLog| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") $ $) "\\spad{linearAssociatedLog(b,{}a)} returns a polynomial {\\em g},{} such that the \\spadfun{linearAssociatedExp}(\\spad{b},{}\\spad{g}) equals {\\em a}. If there is no such polynomial {\\em g},{} then \\spadfun{linearAssociatedLog} fails.") (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{linearAssociatedLog(a)} returns a polynomial {\\em g},{} such that \\spadfun{linearAssociatedExp}(normalElement(),{}\\spad{g}) equals {\\em a}.")) (|linearAssociatedOrder| (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{linearAssociatedOrder(a)} retruns the monic polynomial {\\em g} of least degree,{} such that \\spadfun{linearAssociatedExp}(a,{}\\spad{g}) is 0.")) (|linearAssociatedExp| (($ $ (|SparseUnivariatePolynomial| |#1|)) "\\spad{linearAssociatedExp(a,{}f)} is linear over {\\em F},{} \\spadignore{i.e.} for elements {\\em a} from {\\em \\$},{} {\\em c,{}d} form {\\em F} and {\\em f,{}g} univariate polynomials over {\\em F} we have \\spadfun{linearAssociatedExp}(a,{}cf+dg) equals {\\em c} times \\spadfun{linearAssociatedExp}(a,{}\\spad{f}) plus {\\em d} times \\spadfun{linearAssociatedExp}(a,{}\\spad{g}). Therefore \\spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\\em F[X]}: \\spadfun{linearAssociatedExp}(a,{}monomial(1,{}\\spad{k})\\spad{\\$}SUP(\\spad{F})) is defined to be \\spadfun{Frobenius}(a,{}\\spad{k}) which is {\\em a**(q**k)},{} where {\\em q=size()\\$F}.")) (|generator| (($) "\\spad{generator()} returns a root of the defining polynomial. This element generates the field as an algebra over the ground field.")) (|normal?| (((|Boolean|) $) "\\spad{normal?(a)} tests whether the element \\spad{a} is normal over the ground field \\spad{F},{} \\spadignore{i.e.} \\spad{a**(q**i),{} 0 <= i <= extensionDegree()-1} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. Implementation according to Lidl/Niederreiter: Theorem 2.39.")) (|normalElement| (($) "\\spad{normalElement()} returns a element,{} normal over the ground field \\spad{F},{} \\spadignore{i.e.} \\spad{a**(q**i),{} 0 <= i < extensionDegree()} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. At the first call,{} the element is computed by \\spadfunFrom{createNormalElement}{FiniteAlgebraicExtensionField} then cached in a global variable. On subsequent calls,{} the element is retrieved by referencing the global variable.")) (|createNormalElement| (($) "\\spad{createNormalElement()} computes a normal element over the ground field \\spad{F},{} that is,{} \\spad{a**(q**i),{} 0 <= i < extensionDegree()} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. Reference: Such an element exists Lidl/Niederreiter: Theorem 2.35.")) (|trace| (($ $ (|PositiveInteger|)) "\\spad{trace(a,{}d)} computes the trace of \\spad{a} with respect to the field of extension degree \\spad{d} over the ground field of size \\spad{q}. Error: if \\spad{d} does not divide the extension degree of \\spad{a}. Note: \\spad{trace(a,{}d) = reduce(+,{}[a**(q**(d*i)) for i in 0..n/d])}.") ((|#1| $) "\\spad{trace(a)} computes the trace of \\spad{a} with respect to the field considered as an algebra with 1 over the ground field \\spad{F}.")) (|norm| (($ $ (|PositiveInteger|)) "\\spad{norm(a,{}d)} computes the norm of \\spad{a} with respect to the field of extension degree \\spad{d} over the ground field of size. Error: if \\spad{d} does not divide the extension degree of \\spad{a}. Note: norm(a,{}\\spad{d}) = reduce(*,{}[a**(\\spad{q**}(d*i)) for \\spad{i} in 0..\\spad{n/d}])") ((|#1| $) "\\spad{norm(a)} computes the norm of \\spad{a} with respect to the field considered as an algebra with 1 over the ground field \\spad{F}.")) (|degree| (((|PositiveInteger|) $) "\\spad{degree(a)} returns the degree of the minimal polynomial of an element \\spad{a} over the ground field \\spad{F}.")) (|extensionDegree| (((|PositiveInteger|)) "\\spad{extensionDegree()} returns the degree of field extension.")) (|definingPolynomial| (((|SparseUnivariatePolynomial| |#1|)) "\\spad{definingPolynomial()} returns the polynomial used to define the field extension.")) (|minimalPolynomial| (((|SparseUnivariatePolynomial| $) $ (|PositiveInteger|)) "\\spad{minimalPolynomial(x,{}n)} computes the minimal polynomial of \\spad{x} over the field of extension degree \\spad{n} over the ground field \\spad{F}.") (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{minimalPolynomial(a)} returns the minimal polynomial of an element \\spad{a} over the ground field \\spad{F}.")) (|represents| (($ (|Vector| |#1|)) "\\spad{represents([a1,{}..,{}an])} returns \\spad{a1*v1 + ... + an*vn},{} where \\spad{v1},{}...,{}\\spad{vn} are the elements of the fixed basis.")) (|coordinates| (((|Matrix| |#1|) (|Vector| $)) "\\spad{coordinates([v1,{}...,{}vm])} returns the coordinates of the \\spad{vi}\\spad{'s} with to the fixed basis. The coordinates of \\spad{vi} are contained in the \\spad{i}th row of the matrix returned by this function.") (((|Vector| |#1|) $) "\\spad{coordinates(a)} returns the coordinates of \\spad{a} with respect to the fixed \\spad{F}-vectorspace basis.")) (|basis| (((|Vector| $) (|PositiveInteger|)) "\\spad{basis(n)} returns a fixed basis of a subfield of \\spad{\\$} as \\spad{F}-vectorspace.") (((|Vector| $)) "\\spad{basis()} returns a fixed basis of \\spad{\\$} as \\spad{F}-vectorspace."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-324) -((|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.")) (|coerce| (((|OutputForm|) $) "\\spad{coerce(f)} returns an object of type OutputForm."))) +((|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."))) NIL NIL (-325 E) @@ -1240,15 +1240,15 @@ NIL ((|constructor| (NIL "\\indented{1}{Lift a map to finite divisors.} Author: Manuel Bronstein Date Created: 1988 Date Last Updated: 19 May 1993")) (|map| (((|FiniteDivisor| |#5| |#6| |#7| |#8|) (|Mapping| |#5| |#1|) (|FiniteDivisor| |#1| |#2| |#3| |#4|)) "\\spad{map(f,{}d)} \\undocumented{}"))) NIL NIL -(-328 S -3219 UP UPUP R) +(-328 S -3105 UP UPUP R) ((|constructor| (NIL "This category describes finite rational divisors on a curve,{} that is finite formal sums SUM(\\spad{n} * \\spad{P}) where the \\spad{n}\\spad{'s} are integers and the \\spad{P}\\spad{'s} are finite rational points on the curve.")) (|generator| (((|Union| |#5| "failed") $) "\\spad{generator(d)} returns \\spad{f} if \\spad{(f) = d},{} \"failed\" if \\spad{d} is not principal.")) (|principal?| (((|Boolean|) $) "\\spad{principal?(D)} tests if the argument is the divisor of a function.")) (|reduce| (($ $) "\\spad{reduce(D)} converts \\spad{D} to some reduced form (the reduced forms can be differents in different implementations).")) (|decompose| (((|Record| (|:| |id| (|FractionalIdeal| |#3| (|Fraction| |#3|) |#4| |#5|)) (|:| |principalPart| |#5|)) $) "\\spad{decompose(d)} returns \\spad{[id,{} f]} where \\spad{d = (id) + div(f)}.")) (|divisor| (($ |#5| |#3| |#3| |#3| |#2|) "\\spad{divisor(h,{} d,{} d',{} g,{} r)} returns the sum of all the finite points where \\spad{h/d} has residue \\spad{r}. \\spad{h} must be integral. \\spad{d} must be squarefree. \\spad{d'} is some derivative of \\spad{d} (not necessarily dd/dx). \\spad{g = gcd(d,{}discriminant)} contains the ramified zeros of \\spad{d}") (($ |#2| |#2| (|Integer|)) "\\spad{divisor(a,{} b,{} n)} makes the divisor \\spad{nP} where \\spad{P:} \\spad{(x = a,{} y = b)}. \\spad{P} is allowed to be singular if \\spad{n} is a multiple of the rank.") (($ |#2| |#2|) "\\spad{divisor(a,{} b)} makes the divisor \\spad{P:} \\spad{(x = a,{} y = b)}. Error: if \\spad{P} is singular.") (($ |#5|) "\\spad{divisor(g)} returns the divisor of the function \\spad{g}.") (($ (|FractionalIdeal| |#3| (|Fraction| |#3|) |#4| |#5|)) "\\spad{divisor(I)} makes a divisor \\spad{D} from an ideal \\spad{I}.")) (|ideal| (((|FractionalIdeal| |#3| (|Fraction| |#3|) |#4| |#5|) $) "\\spad{ideal(D)} returns the ideal corresponding to a divisor \\spad{D}."))) NIL NIL -(-329 -3219 UP UPUP R) +(-329 -3105 UP UPUP R) ((|constructor| (NIL "This category describes finite rational divisors on a curve,{} that is finite formal sums SUM(\\spad{n} * \\spad{P}) where the \\spad{n}\\spad{'s} are integers and the \\spad{P}\\spad{'s} are finite rational points on the curve.")) (|generator| (((|Union| |#4| "failed") $) "\\spad{generator(d)} returns \\spad{f} if \\spad{(f) = d},{} \"failed\" if \\spad{d} is not principal.")) (|principal?| (((|Boolean|) $) "\\spad{principal?(D)} tests if the argument is the divisor of a function.")) (|reduce| (($ $) "\\spad{reduce(D)} converts \\spad{D} to some reduced form (the reduced forms can be differents in different implementations).")) (|decompose| (((|Record| (|:| |id| (|FractionalIdeal| |#2| (|Fraction| |#2|) |#3| |#4|)) (|:| |principalPart| |#4|)) $) "\\spad{decompose(d)} returns \\spad{[id,{} f]} where \\spad{d = (id) + div(f)}.")) (|divisor| (($ |#4| |#2| |#2| |#2| |#1|) "\\spad{divisor(h,{} d,{} d',{} g,{} r)} returns the sum of all the finite points where \\spad{h/d} has residue \\spad{r}. \\spad{h} must be integral. \\spad{d} must be squarefree. \\spad{d'} is some derivative of \\spad{d} (not necessarily dd/dx). \\spad{g = gcd(d,{}discriminant)} contains the ramified zeros of \\spad{d}") (($ |#1| |#1| (|Integer|)) "\\spad{divisor(a,{} b,{} n)} makes the divisor \\spad{nP} where \\spad{P:} \\spad{(x = a,{} y = b)}. \\spad{P} is allowed to be singular if \\spad{n} is a multiple of the rank.") (($ |#1| |#1|) "\\spad{divisor(a,{} b)} makes the divisor \\spad{P:} \\spad{(x = a,{} y = b)}. Error: if \\spad{P} is singular.") (($ |#4|) "\\spad{divisor(g)} returns the divisor of the function \\spad{g}.") (($ (|FractionalIdeal| |#2| (|Fraction| |#2|) |#3| |#4|)) "\\spad{divisor(I)} makes a divisor \\spad{D} from an ideal \\spad{I}.")) (|ideal| (((|FractionalIdeal| |#2| (|Fraction| |#2|) |#3| |#4|) $) "\\spad{ideal(D)} returns the ideal corresponding to a divisor \\spad{D}."))) NIL NIL -(-330 -3219 UP UPUP R) +(-330 -3105 UP UPUP R) ((|constructor| (NIL "This domains implements finite rational divisors on a curve,{} that is finite formal sums SUM(\\spad{n} * \\spad{P}) where the \\spad{n}\\spad{'s} are integers and the \\spad{P}\\spad{'s} are finite rational points on the curve.")) (|lSpaceBasis| (((|Vector| |#4|) $) "\\spad{lSpaceBasis(d)} returns a basis for \\spad{L(d) = {f | (f) >= -d}} as a module over \\spad{K[x]}.")) (|finiteBasis| (((|Vector| |#4|) $) "\\spad{finiteBasis(d)} returns a basis for \\spad{d} as a module over {\\em K[x]}."))) NIL NIL @@ -1268,26 +1268,26 @@ NIL ((|constructor| (NIL "Lifts a map from rings to function fields over them.")) (|map| ((|#8| (|Mapping| |#5| |#1|) |#4|) "\\spad{map(f,{} p)} lifts \\spad{f} to \\spad{F1} and applies it to \\spad{p}."))) NIL NIL -(-335 S -3219 UP UPUP) +(-335 S -3105 UP UPUP) ((|constructor| (NIL "This category is a model for the function field of a plane algebraic curve.")) (|rationalPoints| (((|List| (|List| |#2|))) "\\spad{rationalPoints()} returns the list of all the affine rational points.")) (|nonSingularModel| (((|List| (|Polynomial| |#2|)) (|Symbol|)) "\\spad{nonSingularModel(u)} returns the equations in u1,{}...,{}un of an affine non-singular model for the curve.")) (|algSplitSimple| (((|Record| (|:| |num| $) (|:| |den| |#3|) (|:| |derivden| |#3|) (|:| |gd| |#3|)) $ (|Mapping| |#3| |#3|)) "\\spad{algSplitSimple(f,{} D)} returns \\spad{[h,{}d,{}d',{}g]} such that \\spad{f=h/d},{} \\spad{h} is integral at all the normal places \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} \\spad{d' = Dd},{} \\spad{g = gcd(d,{} discriminant())} and \\spad{D} is the derivation to use. \\spad{f} must have at most simple finite poles.")) (|hyperelliptic| (((|Union| |#3| "failed")) "\\spad{hyperelliptic()} returns \\spad{p(x)} if the curve is the hyperelliptic defined by \\spad{y**2 = p(x)},{} \"failed\" otherwise.")) (|elliptic| (((|Union| |#3| "failed")) "\\spad{elliptic()} returns \\spad{p(x)} if the curve is the elliptic defined by \\spad{y**2 = p(x)},{} \"failed\" otherwise.")) (|elt| ((|#2| $ |#2| |#2|) "\\spad{elt(f,{}a,{}b)} or \\spad{f}(a,{} \\spad{b}) returns the value of \\spad{f} at the point \\spad{(x = a,{} y = b)} if it is not singular.")) (|primitivePart| (($ $) "\\spad{primitivePart(f)} removes the content of the denominator and the common content of the numerator of \\spad{f}.")) (|differentiate| (($ $ (|Mapping| |#3| |#3|)) "\\spad{differentiate(x,{} d)} extends the derivation \\spad{d} from UP to \\$ and applies it to \\spad{x}.")) (|integralDerivationMatrix| (((|Record| (|:| |num| (|Matrix| |#3|)) (|:| |den| |#3|)) (|Mapping| |#3| |#3|)) "\\spad{integralDerivationMatrix(d)} extends the derivation \\spad{d} from UP to \\$ and returns (\\spad{M},{} \\spad{Q}) such that the i^th row of \\spad{M} divided by \\spad{Q} form the coordinates of \\spad{d(\\spad{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 (-362))) (|HasCategory| |#2| (QUOTE (-357)))) -(-336 -3219 UP UPUP) +(-336 -3105 UP UPUP) ((|constructor| (NIL "This category is a model for the function field of a plane algebraic curve.")) (|rationalPoints| (((|List| (|List| |#1|))) "\\spad{rationalPoints()} returns the list of all the affine rational points.")) (|nonSingularModel| (((|List| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{nonSingularModel(u)} returns the equations in u1,{}...,{}un of an affine non-singular model for the curve.")) (|algSplitSimple| (((|Record| (|:| |num| $) (|:| |den| |#2|) (|:| |derivden| |#2|) (|:| |gd| |#2|)) $ (|Mapping| |#2| |#2|)) "\\spad{algSplitSimple(f,{} D)} returns \\spad{[h,{}d,{}d',{}g]} such that \\spad{f=h/d},{} \\spad{h} is integral at all the normal places \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} \\spad{d' = Dd},{} \\spad{g = gcd(d,{} discriminant())} and \\spad{D} is the derivation to use. \\spad{f} must have at most simple finite poles.")) (|hyperelliptic| (((|Union| |#2| "failed")) "\\spad{hyperelliptic()} returns \\spad{p(x)} if the curve is the hyperelliptic defined by \\spad{y**2 = p(x)},{} \"failed\" otherwise.")) (|elliptic| (((|Union| |#2| "failed")) "\\spad{elliptic()} returns \\spad{p(x)} if the curve is the elliptic defined by \\spad{y**2 = p(x)},{} \"failed\" otherwise.")) (|elt| ((|#1| $ |#1| |#1|) "\\spad{elt(f,{}a,{}b)} or \\spad{f}(a,{} \\spad{b}) returns the value of \\spad{f} at the point \\spad{(x = a,{} y = b)} if it is not singular.")) (|primitivePart| (($ $) "\\spad{primitivePart(f)} removes the content of the denominator and the common content of the numerator of \\spad{f}.")) (|differentiate| (($ $ (|Mapping| |#2| |#2|)) "\\spad{differentiate(x,{} d)} extends the derivation \\spad{d} from UP to \\$ and applies it to \\spad{x}.")) (|integralDerivationMatrix| (((|Record| (|:| |num| (|Matrix| |#2|)) (|:| |den| |#2|)) (|Mapping| |#2| |#2|)) "\\spad{integralDerivationMatrix(d)} extends the derivation \\spad{d} from UP to \\$ and returns (\\spad{M},{} \\spad{Q}) such that the i^th row of \\spad{M} divided by \\spad{Q} form the coordinates of \\spad{d(\\spad{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."))) ((-4362 |has| (-401 |#2|) (-357)) (-4367 |has| (-401 |#2|) (-357)) (-4361 |has| (-401 |#2|) (-357)) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-337 |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."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((-4028 (|HasCategory| (-892 |#1|) (QUOTE (-142))) (|HasCategory| (-892 |#1|) (QUOTE (-362)))) (|HasCategory| (-892 |#1|) (QUOTE (-144))) (|HasCategory| (-892 |#1|) (QUOTE (-362))) (|HasCategory| (-892 |#1|) (QUOTE (-142)))) +((-3988 (|HasCategory| (-892 |#1|) (QUOTE (-142))) (|HasCategory| (-892 |#1|) (QUOTE (-362)))) (|HasCategory| (-892 |#1|) (QUOTE (-144))) (|HasCategory| (-892 |#1|) (QUOTE (-362))) (|HasCategory| (-892 |#1|) (QUOTE (-142)))) (-338 GF |defpol|) ((|constructor| (NIL "FiniteFieldCyclicGroupExtensionByPolynomial(\\spad{GF},{}defpol) implements a finite extension field of the ground field {\\em GF}. Its elements are represented by powers of a primitive element,{} \\spadignore{i.e.} a generator of the multiplicative (cyclic) group. As primitive element we choose the root of the extension polynomial {\\em defpol},{} which MUST be primitive (user responsibility). Zech logarithms are stored in a table of size half of the field size,{} and use \\spadtype{SingleInteger} for representing field elements,{} hence,{} there are restrictions on the size of the field.")) (|getZechTable| (((|PrimitiveArray| (|SingleInteger|))) "\\spad{getZechTable()} returns the zech logarithm table of the field it is used to perform additions in the field quickly."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((-4028 (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-142)))) +((-3988 (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-142)))) (-339 GF |extdeg|) ((|constructor| (NIL "FiniteFieldCyclicGroupExtension(\\spad{GF},{}\\spad{n}) implements a extension of degree \\spad{n} over the ground field {\\em GF}. Its elements are represented by powers of a primitive element,{} \\spadignore{i.e.} a generator of the multiplicative (cyclic) group. As primitive element we choose the root of the extension polynomial,{} which is created by {\\em createPrimitivePoly} from \\spadtype{FiniteFieldPolynomialPackage}. Zech logarithms are stored in a table of size half of the field size,{} and use \\spadtype{SingleInteger} for representing field elements,{} hence,{} there are restrictions on the size of the field.")) (|getZechTable| (((|PrimitiveArray| (|SingleInteger|))) "\\spad{getZechTable()} returns the zech logarithm table of the field. This table is used to perform additions in the field quickly."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((-4028 (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-142)))) +((-3988 (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-142)))) (-340 GF) ((|constructor| (NIL "FiniteFieldFunctions(\\spad{GF}) is a package with functions concerning finite extension fields of the finite ground field {\\em GF},{} \\spadignore{e.g.} Zech logarithms.")) (|createLowComplexityNormalBasis| (((|Union| (|SparseUnivariatePolynomial| |#1|) (|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|)))))) (|PositiveInteger|)) "\\spad{createLowComplexityNormalBasis(n)} tries to find a a low complexity normal basis of degree {\\em n} over {\\em GF} and returns its multiplication matrix If no low complexity basis is found it calls \\axiomFunFrom{createNormalPoly}{FiniteFieldPolynomialPackage}(\\spad{n}) to produce a normal polynomial of degree {\\em n} over {\\em GF}")) (|createLowComplexityTable| (((|Union| (|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|))))) "failed") (|PositiveInteger|)) "\\spad{createLowComplexityTable(n)} tries to find a low complexity normal basis of degree {\\em n} over {\\em GF} and returns its multiplication matrix Fails,{} if it does not find a low complexity basis")) (|sizeMultiplication| (((|NonNegativeInteger|) (|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|)))))) "\\spad{sizeMultiplication(m)} returns the number of entries of the multiplication table {\\em m}.")) (|createMultiplicationMatrix| (((|Matrix| |#1|) (|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|)))))) "\\spad{createMultiplicationMatrix(m)} forms the multiplication table {\\em m} into a matrix over the ground field.")) (|createMultiplicationTable| (((|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|))))) (|SparseUnivariatePolynomial| |#1|)) "\\spad{createMultiplicationTable(f)} generates a multiplication table for the normal basis of the field extension determined by {\\em f}. This is needed to perform multiplications between elements represented as coordinate vectors to this basis. See \\spadtype{FFNBP},{} \\spadtype{FFNBX}.")) (|createZechTable| (((|PrimitiveArray| (|SingleInteger|)) (|SparseUnivariatePolynomial| |#1|)) "\\spad{createZechTable(f)} generates a Zech logarithm table for the cyclic group representation of a extension of the ground field by the primitive polynomial {\\em f(x)},{} \\spadignore{i.e.} \\spad{Z(i)},{} defined by {\\em x**Z(i) = 1+x**i} is stored at index \\spad{i}. This is needed in particular to perform addition of field elements in finite fields represented in this way. See \\spadtype{FFCGP},{} \\spadtype{FFCGX}."))) NIL @@ -1304,31 +1304,31 @@ NIL ((|constructor| (NIL "FiniteFieldCategory is the category of finite fields")) (|representationType| (((|Union| "prime" "polynomial" "normal" "cyclic")) "\\spad{representationType()} returns the type of the representation,{} one of: \\spad{prime},{} \\spad{polynomial},{} \\spad{normal},{} or \\spad{cyclic}.")) (|order| (((|PositiveInteger|) $) "\\spad{order(b)} computes the order of an element \\spad{b} in the multiplicative group of the field. Error: if \\spad{b} equals 0.")) (|discreteLog| (((|NonNegativeInteger|) $) "\\spad{discreteLog(a)} computes the discrete logarithm of \\spad{a} with respect to \\spad{primitiveElement()} of the field.")) (|primitive?| (((|Boolean|) $) "\\spad{primitive?(b)} tests whether the element \\spad{b} is a generator of the (cyclic) multiplicative group of the field,{} \\spadignore{i.e.} is a primitive element. Implementation Note: see \\spad{ch}.IX.1.3,{} th.2 in \\spad{D}. Lipson.")) (|primitiveElement| (($) "\\spad{primitiveElement()} returns a primitive element stored in a global variable in the domain. At first call,{} the primitive element is computed by calling \\spadfun{createPrimitiveElement}.")) (|createPrimitiveElement| (($) "\\spad{createPrimitiveElement()} computes a generator of the (cyclic) multiplicative group of the field.")) (|tableForDiscreteLogarithm| (((|Table| (|PositiveInteger|) (|NonNegativeInteger|)) (|Integer|)) "\\spad{tableForDiscreteLogarithm(a,{}n)} returns a table of the discrete logarithms of \\spad{a**0} up to \\spad{a**(n-1)} which,{} called with key \\spad{lookup(a**i)} returns \\spad{i} for \\spad{i} in \\spad{0..n-1}. Error: if not called for prime divisors of order of \\indented{7}{multiplicative group.}")) (|factorsOfCyclicGroupSize| (((|List| (|Record| (|:| |factor| (|Integer|)) (|:| |exponent| (|Integer|))))) "\\spad{factorsOfCyclicGroupSize()} returns the factorization of size()\\spad{-1}")) (|conditionP| (((|Union| (|Vector| $) "failed") (|Matrix| $)) "\\spad{conditionP(mat)},{} given a matrix representing a homogeneous system of equations,{} returns a vector whose characteristic'th powers is a non-trivial solution,{} or \"failed\" if no such vector exists.")) (|charthRoot| (($ $) "\\spad{charthRoot(a)} takes the characteristic'th root of {\\em a}. Note: such a root is alway defined in finite fields."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL -(-344 R UP -3219) +(-344 R UP -3105) ((|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{\\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{\\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{\\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{\\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{\\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{\\spad{wi} = sum(bij * vj,{} j = 1..n)}.")) (|squareFree| (((|Factored| $) $) "\\spad{squareFree(x)} returns a square-free factorisation of \\spad{x}"))) NIL NIL (-345 |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."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((-4028 (|HasCategory| (-892 |#1|) (QUOTE (-142))) (|HasCategory| (-892 |#1|) (QUOTE (-362)))) (|HasCategory| (-892 |#1|) (QUOTE (-144))) (|HasCategory| (-892 |#1|) (QUOTE (-362))) (|HasCategory| (-892 |#1|) (QUOTE (-142)))) +((-3988 (|HasCategory| (-892 |#1|) (QUOTE (-142))) (|HasCategory| (-892 |#1|) (QUOTE (-362)))) (|HasCategory| (-892 |#1|) (QUOTE (-144))) (|HasCategory| (-892 |#1|) (QUOTE (-362))) (|HasCategory| (-892 |#1|) (QUOTE (-142)))) (-346 GF |uni|) ((|constructor| (NIL "FiniteFieldNormalBasisExtensionByPolynomial(\\spad{GF},{}uni) implements a finite extension of the ground field {\\em GF}. The elements are represented by coordinate vectors with respect to. a normal basis,{} \\spadignore{i.e.} a basis consisting of the conjugates (\\spad{q}-powers) of an element,{} in this case called normal element,{} where \\spad{q} is the size of {\\em GF}. The normal element is chosen as a root of the extension polynomial,{} which MUST be normal over {\\em GF} (user responsibility)")) (|sizeMultiplication| (((|NonNegativeInteger|)) "\\spad{sizeMultiplication()} returns the number of entries in the multiplication table of the field. Note: the time of multiplication of field elements depends on this size.")) (|getMultiplicationMatrix| (((|Matrix| |#1|)) "\\spad{getMultiplicationMatrix()} returns the multiplication table in form of a matrix.")) (|getMultiplicationTable| (((|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|)))))) "\\spad{getMultiplicationTable()} returns the multiplication table for the normal basis of the field. This table is used to perform multiplications between field elements."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((-4028 (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-142)))) +((-3988 (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-142)))) (-347 GF |extdeg|) ((|constructor| (NIL "FiniteFieldNormalBasisExtensionByPolynomial(\\spad{GF},{}\\spad{n}) implements a finite extension field of degree \\spad{n} over the ground field {\\em GF}. The elements are represented by coordinate vectors with respect to a normal basis,{} \\spadignore{i.e.} a basis consisting of the conjugates (\\spad{q}-powers) of an element,{} in this case called normal element. This is chosen as a root of the extension polynomial,{} created by {\\em createNormalPoly} from \\spadtype{FiniteFieldPolynomialPackage}")) (|sizeMultiplication| (((|NonNegativeInteger|)) "\\spad{sizeMultiplication()} returns the number of entries in the multiplication table of the field. Note: the time of multiplication of field elements depends on this size.")) (|getMultiplicationMatrix| (((|Matrix| |#1|)) "\\spad{getMultiplicationMatrix()} returns the multiplication table in form of a matrix.")) (|getMultiplicationTable| (((|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|)))))) "\\spad{getMultiplicationTable()} returns the multiplication table for the normal basis of the field. This table is used to perform multiplications between field elements."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((-4028 (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-142)))) +((-3988 (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-142)))) (-348 |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}."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((-4028 (|HasCategory| (-892 |#1|) (QUOTE (-142))) (|HasCategory| (-892 |#1|) (QUOTE (-362)))) (|HasCategory| (-892 |#1|) (QUOTE (-144))) (|HasCategory| (-892 |#1|) (QUOTE (-362))) (|HasCategory| (-892 |#1|) (QUOTE (-142)))) +((-3988 (|HasCategory| (-892 |#1|) (QUOTE (-142))) (|HasCategory| (-892 |#1|) (QUOTE (-362)))) (|HasCategory| (-892 |#1|) (QUOTE (-144))) (|HasCategory| (-892 |#1|) (QUOTE (-362))) (|HasCategory| (-892 |#1|) (QUOTE (-142)))) (-349 GF |defpol|) ((|constructor| (NIL "FiniteFieldExtensionByPolynomial(\\spad{GF},{} defpol) implements the extension of the finite field {\\em GF} generated by the extension polynomial {\\em defpol} which MUST be irreducible. Note: the user has the responsibility to ensure that {\\em defpol} is irreducible."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((-4028 (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-142)))) -(-350 -3219 GF) +((-3988 (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-142)))) +(-350 -3105 GF) ((|constructor| (NIL "FiniteFieldPolynomialPackage2(\\spad{F},{}\\spad{GF}) exports some functions concerning finite fields,{} which depend on a finite field {\\em GF} and an algebraic extension \\spad{F} of {\\em GF},{} \\spadignore{e.g.} a zero of a polynomial over {\\em GF} in \\spad{F}.")) (|rootOfIrreduciblePoly| ((|#1| (|SparseUnivariatePolynomial| |#2|)) "\\spad{rootOfIrreduciblePoly(f)} computes one root of the monic,{} irreducible polynomial \\spad{f},{} which degree must divide the extension degree of {\\em F} over {\\em GF},{} \\spadignore{i.e.} \\spad{f} splits into linear factors over {\\em F}.")) (|Frobenius| ((|#1| |#1|) "\\spad{Frobenius(x)} \\undocumented{}")) (|basis| (((|Vector| |#1|) (|PositiveInteger|)) "\\spad{basis(n)} \\undocumented{}")) (|lookup| (((|PositiveInteger|) |#1|) "\\spad{lookup(x)} \\undocumented{}")) (|coerce| ((|#1| |#2|) "\\spad{coerce(x)} \\undocumented{}"))) NIL NIL @@ -1336,14 +1336,14 @@ NIL ((|constructor| (NIL "This package provides a number of functions for generating,{} counting and testing irreducible,{} normal,{} primitive,{} random polynomials over finite fields.")) (|reducedQPowers| (((|PrimitiveArray| (|SparseUnivariatePolynomial| |#1|)) (|SparseUnivariatePolynomial| |#1|)) "\\spad{reducedQPowers(f)} generates \\spad{[x,{}x**q,{}x**(q**2),{}...,{}x**(q**(n-1))]} reduced modulo \\spad{f} where \\spad{q = size()\\$GF} and \\spad{n = degree f}.")) (|leastAffineMultiple| (((|SparseUnivariatePolynomial| |#1|) (|SparseUnivariatePolynomial| |#1|)) "\\spad{leastAffineMultiple(f)} computes the least affine polynomial which is divisible by the polynomial \\spad{f} over the finite field {\\em GF},{} \\spadignore{i.e.} a polynomial whose exponents are 0 or a power of \\spad{q},{} the size of {\\em GF}.")) (|random| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|) (|PositiveInteger|)) "\\spad{random(m,{}n)}\\$FFPOLY(\\spad{GF}) generates a random monic polynomial of degree \\spad{d} over the finite field {\\em GF},{} \\spad{d} between \\spad{m} and \\spad{n}.") (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{random(n)}\\$FFPOLY(\\spad{GF}) generates a random monic polynomial of degree \\spad{n} over the finite field {\\em GF}.")) (|nextPrimitiveNormalPoly| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") (|SparseUnivariatePolynomial| |#1|)) "\\spad{nextPrimitiveNormalPoly(f)} yields the next primitive normal polynomial over a finite field {\\em GF} of the same degree as \\spad{f} in the following order,{} or \"failed\" if there are no greater ones. Error: if \\spad{f} has degree 0. Note: the input polynomial \\spad{f} is made monic. Also,{} \\spad{f < g} if the {\\em lookup} of the constant term of \\spad{f} is less than this number for \\spad{g} or,{} in case these numbers are equal,{} if the {\\em lookup} of the coefficient of the term of degree {\\em n-1} of \\spad{f} is less than this number for \\spad{g}. If these numbers are equals,{} \\spad{f < g} if the number of monomials of \\spad{f} is less than that for \\spad{g},{} or if the lists of exponents for \\spad{f} are lexicographically less than those for \\spad{g}. If these lists are also equal,{} the lists of coefficients are coefficients according to the lexicographic ordering induced by the ordering of the elements of {\\em GF} given by {\\em lookup}. This operation is equivalent to nextNormalPrimitivePoly(\\spad{f}).")) (|nextNormalPrimitivePoly| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") (|SparseUnivariatePolynomial| |#1|)) "\\spad{nextNormalPrimitivePoly(f)} yields the next normal primitive polynomial over a finite field {\\em GF} of the same degree as \\spad{f} in the following order,{} or \"failed\" if there are no greater ones. Error: if \\spad{f} has degree 0. Note: the input polynomial \\spad{f} is made monic. Also,{} \\spad{f < g} if the {\\em lookup} of the constant term of \\spad{f} is less than this number for \\spad{g} or if {\\em lookup} of the coefficient of the term of degree {\\em n-1} of \\spad{f} is less than this number for \\spad{g}. Otherwise,{} \\spad{f < g} if the number of monomials of \\spad{f} is less than that for \\spad{g} or if the lists of exponents for \\spad{f} are lexicographically less than those for \\spad{g}. If these lists are also equal,{} the lists of coefficients are compared according to the lexicographic ordering induced by the ordering of the elements of {\\em GF} given by {\\em lookup}. This operation is equivalent to nextPrimitiveNormalPoly(\\spad{f}).")) (|nextNormalPoly| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") (|SparseUnivariatePolynomial| |#1|)) "\\spad{nextNormalPoly(f)} yields the next normal polynomial over a finite field {\\em GF} of the same degree as \\spad{f} in the following order,{} or \"failed\" if there are no greater ones. Error: if \\spad{f} has degree 0. Note: the input polynomial \\spad{f} is made monic. Also,{} \\spad{f < g} if the {\\em lookup} of the coefficient of the term of degree {\\em n-1} of \\spad{f} is less than that for \\spad{g}. In case these numbers are equal,{} \\spad{f < g} if if the number of monomials of \\spad{f} is less that for \\spad{g} or if the list of exponents of \\spad{f} are lexicographically less than the corresponding list for \\spad{g}. If these lists are also equal,{} the lists of coefficients are compared according to the lexicographic ordering induced by the ordering of the elements of {\\em GF} given by {\\em lookup}.")) (|nextPrimitivePoly| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") (|SparseUnivariatePolynomial| |#1|)) "\\spad{nextPrimitivePoly(f)} yields the next primitive polynomial over a finite field {\\em GF} of the same degree as \\spad{f} in the following order,{} or \"failed\" if there are no greater ones. Error: if \\spad{f} has degree 0. Note: the input polynomial \\spad{f} is made monic. Also,{} \\spad{f < g} if the {\\em lookup} of the constant term of \\spad{f} is less than this number for \\spad{g}. If these values are equal,{} then \\spad{f < g} if if the number of monomials of \\spad{f} is less than that for \\spad{g} or if the lists of exponents of \\spad{f} are lexicographically less than the corresponding list for \\spad{g}. If these lists are also equal,{} the lists of coefficients are compared according to the lexicographic ordering induced by the ordering of the elements of {\\em GF} given by {\\em lookup}.")) (|nextIrreduciblePoly| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") (|SparseUnivariatePolynomial| |#1|)) "\\spad{nextIrreduciblePoly(f)} yields the next monic irreducible polynomial over a finite field {\\em GF} of the same degree as \\spad{f} in the following order,{} or \"failed\" if there are no greater ones. Error: if \\spad{f} has degree 0. Note: the input polynomial \\spad{f} is made monic. Also,{} \\spad{f < g} if the number of monomials of \\spad{f} is less than this number for \\spad{g}. If \\spad{f} and \\spad{g} have the same number of monomials,{} the lists of exponents are compared lexicographically. If these lists are also equal,{} the lists of coefficients are compared according to the lexicographic ordering induced by the ordering of the elements of {\\em GF} given by {\\em lookup}.")) (|createPrimitiveNormalPoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createPrimitiveNormalPoly(n)}\\$FFPOLY(\\spad{GF}) generates a normal and primitive polynomial of degree \\spad{n} over the field {\\em GF}. polynomial of degree \\spad{n} over the field {\\em GF}.")) (|createNormalPrimitivePoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createNormalPrimitivePoly(n)}\\$FFPOLY(\\spad{GF}) generates a normal and primitive polynomial of degree \\spad{n} over the field {\\em GF}. Note: this function is equivalent to createPrimitiveNormalPoly(\\spad{n})")) (|createNormalPoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createNormalPoly(n)}\\$FFPOLY(\\spad{GF}) generates a normal polynomial of degree \\spad{n} over the finite field {\\em GF}.")) (|createPrimitivePoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createPrimitivePoly(n)}\\$FFPOLY(\\spad{GF}) generates a primitive polynomial of degree \\spad{n} over the finite field {\\em GF}.")) (|createIrreduciblePoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createIrreduciblePoly(n)}\\$FFPOLY(\\spad{GF}) generates a monic irreducible univariate polynomial of degree \\spad{n} over the finite field {\\em GF}.")) (|numberOfNormalPoly| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{numberOfNormalPoly(n)}\\$FFPOLY(\\spad{GF}) yields the number of normal polynomials of degree \\spad{n} over the finite field {\\em GF}.")) (|numberOfPrimitivePoly| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{numberOfPrimitivePoly(n)}\\$FFPOLY(\\spad{GF}) yields the number of primitive polynomials of degree \\spad{n} over the finite field {\\em GF}.")) (|numberOfIrreduciblePoly| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{numberOfIrreduciblePoly(n)}\\$FFPOLY(\\spad{GF}) yields the number of monic irreducible univariate polynomials of degree \\spad{n} over the finite field {\\em GF}.")) (|normal?| (((|Boolean|) (|SparseUnivariatePolynomial| |#1|)) "\\spad{normal?(f)} tests whether the polynomial \\spad{f} over a finite field is normal,{} \\spadignore{i.e.} its roots are linearly independent over the field.")) (|primitive?| (((|Boolean|) (|SparseUnivariatePolynomial| |#1|)) "\\spad{primitive?(f)} tests whether the polynomial \\spad{f} over a finite field is primitive,{} \\spadignore{i.e.} all its roots are primitive."))) NIL NIL -(-352 -3219 FP FPP) +(-352 -3105 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 \\spad{fi} = sum ai/fi} or returns \"failed\" if no such list of \\spad{ai}\\spad{'s} exists."))) NIL NIL (-353 GF |n|) ((|constructor| (NIL "FiniteFieldExtensionByPolynomial(\\spad{GF},{} \\spad{n}) implements an extension of the finite field {\\em GF} of degree \\spad{n} generated by the extension polynomial constructed by \\spadfunFrom{createIrreduciblePoly}{FiniteFieldPolynomialPackage} from \\spadtype{FiniteFieldPolynomialPackage}."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((-4028 (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-142)))) +((-3988 (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-142)))) (-354 R |ls|) ((|constructor| (NIL "This is just an interface between several packages and domains. The goal is to compute lexicographical Groebner bases of sets of polynomial with type \\spadtype{Polynomial R} by the {\\em FGLM} algorithm if this is possible (\\spadignore{i.e.} if the input system generates a zero-dimensional ideal).")) (|groebner| (((|List| (|Polynomial| |#1|)) (|List| (|Polynomial| |#1|))) "\\axiom{groebner(\\spad{lq1})} returns the lexicographical Groebner basis of \\axiom{\\spad{lq1}}. If \\axiom{\\spad{lq1}} generates a zero-dimensional ideal then the {\\em FGLM} strategy is used,{} otherwise the {\\em Sugar} strategy is used.")) (|fglmIfCan| (((|Union| (|List| (|Polynomial| |#1|)) "failed") (|List| (|Polynomial| |#1|))) "\\axiom{fglmIfCan(\\spad{lq1})} returns the lexicographical Groebner basis of \\axiom{\\spad{lq1}} by using the {\\em FGLM} strategy,{} if \\axiom{zeroDimensional?(\\spad{lq1})} holds.")) (|zeroDimensional?| (((|Boolean|) (|List| (|Polynomial| |#1|))) "\\axiom{zeroDimensional?(\\spad{lq1})} returns \\spad{true} iff \\axiom{\\spad{lq1}} generates a zero-dimensional ideal \\spad{w}.\\spad{r}.\\spad{t}. the variables of \\axiom{\\spad{ls}}."))) NIL @@ -1398,7 +1398,7 @@ NIL ((|HasAttribute| |#1| (QUOTE -4370)) (|HasCategory| |#2| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-1079)))) (-367 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{>=} \\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{<=},{}\\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{<=},{}\\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]}."))) -((-4369 . T) (-4284 . T)) +((-4369 . T)) NIL (-368 |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.\\spad{fr})")) (|eval| (($ $ (|List| |#1|) (|List| $)) "\\axiom{eval(\\spad{p},{} [\\spad{x1},{}...,{}\\spad{xn}],{} [\\spad{v1},{}...,{}\\spad{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."))) @@ -1421,8 +1421,8 @@ NIL NIL NIL (-373) -((|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{\\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}.")) (|convert| (($ (|DoubleFloat|)) "\\spad{convert(x)} converts a \\spadtype{DoubleFloat} \\spad{x} to a \\spadtype{Float}.")) (|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}."))) -((-4352 . T) (-4360 . T) (-4312 . T) (-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) +((|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{\\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}."))) +((-4352 . T) (-4360 . T) (-4327 . T) (-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-374 |Par|) ((|constructor| (NIL "\\indented{3}{This is a package for the approximation of real solutions for} systems of polynomial equations over the rational numbers. The results are expressed as either rational numbers or floats depending on the type of the precision parameter which can be either a rational number or a floating point number.")) (|realRoots| (((|List| |#1|) (|Fraction| (|Polynomial| (|Integer|))) |#1|) "\\spad{realRoots(rf,{} eps)} finds the real zeros of a univariate rational function with precision given by eps.") (((|List| (|List| |#1|)) (|List| (|Fraction| (|Polynomial| (|Integer|)))) (|List| (|Symbol|)) |#1|) "\\spad{realRoots(lp,{}lv,{}eps)} computes the list of the real solutions of the list \\spad{lp} of rational functions with rational coefficients with respect to the variables in \\spad{lv},{} with precision \\spad{eps}. Each solution is expressed as a list of numbers in order corresponding to the variables in \\spad{lv}.")) (|solve| (((|List| (|Equation| (|Polynomial| |#1|))) (|Equation| (|Fraction| (|Polynomial| (|Integer|)))) |#1|) "\\spad{solve(eq,{}eps)} finds all of the real solutions of the univariate equation \\spad{eq} of rational functions with respect to the unique variables appearing in \\spad{eq},{} with precision \\spad{eps}.") (((|List| (|Equation| (|Polynomial| |#1|))) (|Fraction| (|Polynomial| (|Integer|))) |#1|) "\\spad{solve(p,{}eps)} finds all of the real solutions of the univariate rational function \\spad{p} with rational coefficients with respect to the unique variable appearing in \\spad{p},{} with precision \\spad{eps}.") (((|List| (|List| (|Equation| (|Polynomial| |#1|)))) (|List| (|Equation| (|Fraction| (|Polynomial| (|Integer|))))) |#1|) "\\spad{solve(leq,{}eps)} finds all of the real solutions of the system \\spad{leq} of equationas of rational functions with respect to all the variables appearing in \\spad{lp},{} with precision \\spad{eps}.") (((|List| (|List| (|Equation| (|Polynomial| |#1|)))) (|List| (|Fraction| (|Polynomial| (|Integer|)))) |#1|) "\\spad{solve(lp,{}eps)} finds all of the real solutions of the system \\spad{lp} of rational functions over the rational numbers with respect to all the variables appearing in \\spad{lp},{} with precision \\spad{eps}."))) @@ -1438,11 +1438,11 @@ NIL NIL (-377) ((|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}."))) -((-4284 . T)) +NIL NIL (-378) ((|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.}"))) -((-4284 . T)) +NIL NIL (-379 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."))) @@ -1461,7 +1461,7 @@ NIL NIL NIL (-383) -((|constructor| (NIL "This category provides an interface to names in the file system.")) (|new| (($ (|String|) (|String|) (|String|)) "\\spad{new(d,{}pref,{}e)} constructs the name of a new writable file with \\spad{d} as its directory,{} \\spad{pref} as a prefix of its name and \\spad{e} as its extension. When \\spad{d} or \\spad{t} is the empty string,{} a default is used. An error occurs if a new file cannot be written in the given directory.")) (|writable?| (((|Boolean|) $) "\\spad{writable?(f)} tests if the named file be opened for writing. The named file need not already exist.")) (|readable?| (((|Boolean|) $) "\\spad{readable?(f)} tests if the named file exist and can it be opened for reading.")) (|exists?| (((|Boolean|) $) "\\spad{exists?(f)} tests if the file exists in the file system.")) (|extension| (((|String|) $) "\\spad{extension(f)} returns the type part of the file name.")) (|name| (((|String|) $) "\\spad{name(f)} returns the name part of the file name.")) (|directory| (((|String|) $) "\\spad{directory(f)} returns the directory part of the file name.")) (|filename| (($ (|String|) (|String|) (|String|)) "\\spad{filename(d,{}n,{}e)} creates a file name with \\spad{d} as its directory,{} \\spad{n} as its name and \\spad{e} as its extension. This is a portable way to create file names. When \\spad{d} or \\spad{t} is the empty string,{} a default is used.")) (|coerce| (((|String|) $) "\\spad{coerce(fn)} produces a string for a file name according to operating system-dependent conventions.") (($ (|String|)) "\\spad{coerce(s)} converts a string to a file name according to operating system-dependent conventions."))) +((|constructor| (NIL "This category provides an interface to names in the file system.")) (|new| (($ (|String|) (|String|) (|String|)) "\\spad{new(d,{}pref,{}e)} constructs the name of a new writable file with \\spad{d} as its directory,{} \\spad{pref} as a prefix of its name and \\spad{e} as its extension. When \\spad{d} or \\spad{t} is the empty string,{} a default is used. An error occurs if a new file cannot be written in the given directory.")) (|writable?| (((|Boolean|) $) "\\spad{writable?(f)} tests if the named file be opened for writing. The named file need not already exist.")) (|readable?| (((|Boolean|) $) "\\spad{readable?(f)} tests if the named file exist and can it be opened for reading.")) (|exists?| (((|Boolean|) $) "\\spad{exists?(f)} tests if the file exists in the file system.")) (|extension| (((|String|) $) "\\spad{extension(f)} returns the type part of the file name.")) (|name| (((|String|) $) "\\spad{name(f)} returns the name part of the file name.")) (|directory| (((|String|) $) "\\spad{directory(f)} returns the directory part of the file name.")) (|filename| (($ (|String|) (|String|) (|String|)) "\\spad{filename(d,{}n,{}e)} creates a file name with \\spad{d} as its directory,{} \\spad{n} as its name and \\spad{e} as its extension. This is a portable way to create file names. When \\spad{d} or \\spad{t} is the empty string,{} a default is used."))) NIL NIL (-384 |n| |class| R) @@ -1472,7 +1472,7 @@ NIL ((|constructor| (NIL "Code to manipulate Fortran Output Stack")) (|topFortranOutputStack| (((|String|)) "\\spad{topFortranOutputStack()} returns the top element of the Fortran output stack")) (|pushFortranOutputStack| (((|Void|) (|String|)) "\\spad{pushFortranOutputStack(f)} pushes \\spad{f} onto the Fortran output stack") (((|Void|) (|FileName|)) "\\spad{pushFortranOutputStack(f)} pushes \\spad{f} onto the Fortran output stack")) (|popFortranOutputStack| (((|Void|)) "\\spad{popFortranOutputStack()} pops the Fortran output stack")) (|showFortranOutputStack| (((|Stack| (|String|))) "\\spad{showFortranOutputStack()} returns the Fortran output stack")) (|clearFortranOutputStack| (((|Stack| (|String|))) "\\spad{clearFortranOutputStack()} clears the Fortran output stack"))) NIL NIL -(-386 -3219 UP UPUP R) +(-386 -3105 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 @@ -1481,32 +1481,32 @@ NIL NIL NIL (-388) -((|constructor| (NIL "\\spadtype{ScriptFormulaFormat} provides a coercion from \\spadtype{OutputForm} to IBM SCRIPT/VS Mathematical Formula Format. The basic SCRIPT formula format object consists of three parts: a prologue,{} a formula part and an epilogue. The functions \\spadfun{prologue},{} \\spadfun{formula} and \\spadfun{epilogue} extract these parts,{} respectively. The central parts of the expression go into the formula 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 \":df.\" and \":edf.\" so that the formula section will be printed in display math mode.")) (|setPrologue!| (((|List| (|String|)) $ (|List| (|String|))) "\\spad{setPrologue!(t,{}strings)} sets the prologue section of a formatted object \\spad{t} to \\spad{strings}.")) (|setFormula!| (((|List| (|String|)) $ (|List| (|String|))) "\\spad{setFormula!(t,{}strings)} sets the formula section of a formatted object \\spad{t} to \\spad{strings}.")) (|setEpilogue!| (((|List| (|String|)) $ (|List| (|String|))) "\\spad{setEpilogue!(t,{}strings)} sets the epilogue section of a formatted object \\spad{t} to \\spad{strings}.")) (|prologue| (((|List| (|String|)) $) "\\spad{prologue(t)} extracts the prologue section of a formatted object \\spad{t}.")) (|new| (($) "\\spad{new()} create a new,{} empty object. Use \\spadfun{setPrologue!},{} \\spadfun{setFormula!} and \\spadfun{setEpilogue!} to set the various components of this object.")) (|formula| (((|List| (|String|)) $) "\\spad{formula(t)} extracts the formula section of a formatted object \\spad{t}.")) (|epilogue| (((|List| (|String|)) $) "\\spad{epilogue(t)} extracts the epilogue section of a formatted object \\spad{t}.")) (|display| (((|Void|) $) "\\spad{display(t)} outputs the 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 formatted code \\spad{t} so that each line has length less than or equal to \\spadvar{\\spad{width}}.")) (|convert| (($ (|OutputForm|) (|Integer|)) "\\spad{convert(o,{}step)} changes \\spad{o} in standard output format to SCRIPT formula 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.")) (|coerce| (($ (|OutputForm|)) "\\spad{coerce(o)} changes \\spad{o} in the standard output format to SCRIPT formula format."))) +((|constructor| (NIL "\\spadtype{ScriptFormulaFormat} provides a coercion from \\spadtype{OutputForm} to IBM SCRIPT/VS Mathematical Formula Format. The basic SCRIPT formula format object consists of three parts: a prologue,{} a formula part and an epilogue. The functions \\spadfun{prologue},{} \\spadfun{formula} and \\spadfun{epilogue} extract these parts,{} respectively. The central parts of the expression go into the formula 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 \":df.\" and \":edf.\" so that the formula section will be printed in display math mode.")) (|setPrologue!| (((|List| (|String|)) $ (|List| (|String|))) "\\spad{setPrologue!(t,{}strings)} sets the prologue section of a formatted object \\spad{t} to \\spad{strings}.")) (|setFormula!| (((|List| (|String|)) $ (|List| (|String|))) "\\spad{setFormula!(t,{}strings)} sets the formula section of a formatted object \\spad{t} to \\spad{strings}.")) (|setEpilogue!| (((|List| (|String|)) $ (|List| (|String|))) "\\spad{setEpilogue!(t,{}strings)} sets the epilogue section of a formatted object \\spad{t} to \\spad{strings}.")) (|prologue| (((|List| (|String|)) $) "\\spad{prologue(t)} extracts the prologue section of a formatted object \\spad{t}.")) (|new| (($) "\\spad{new()} create a new,{} empty object. Use \\spadfun{setPrologue!},{} \\spadfun{setFormula!} and \\spadfun{setEpilogue!} to set the various components of this object.")) (|formula| (((|List| (|String|)) $) "\\spad{formula(t)} extracts the formula section of a formatted object \\spad{t}.")) (|epilogue| (((|List| (|String|)) $) "\\spad{epilogue(t)} extracts the epilogue section of a formatted object \\spad{t}.")) (|display| (((|Void|) $) "\\spad{display(t)} outputs the 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 formatted code \\spad{t} so that each line has length less than or equal to \\spadvar{\\spad{width}}.")) (|convert| (($ (|OutputForm|) (|Integer|)) "\\spad{convert(o,{}step)} changes \\spad{o} in standard output format to SCRIPT formula 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 (-389) ((|constructor| (NIL "\\axiomType{FortranProgramCategory} provides various models of FORTRAN subprograms. These can be transformed into actual FORTRAN code.")) (|outputAsFortran| (((|Void|) $) "\\axiom{outputAsFortran(\\spad{u})} translates \\axiom{\\spad{u}} into a legal FORTRAN subprogram."))) -((-4284 . T)) +NIL NIL (-390) ((|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.}"))) -((-4284 . T)) +NIL NIL (-391) ((|constructor| (NIL "provides an interface to the boot code for calling Fortran")) (|setLegalFortranSourceExtensions| (((|List| (|String|)) (|List| (|String|))) "\\spad{setLegalFortranSourceExtensions(l)} \\undocumented{}")) (|outputAsFortran| (((|Void|) (|FileName|)) "\\spad{outputAsFortran(fn)} \\undocumented{}")) (|linkToFortran| (((|SExpression|) (|Symbol|) (|List| (|Symbol|)) (|TheSymbolTable|) (|List| (|Symbol|))) "\\spad{linkToFortran(s,{}l,{}t,{}lv)} \\undocumented{}") (((|SExpression|) (|Symbol|) (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|)))) (|List| (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|))))) (|List| (|Symbol|)) (|Symbol|)) "\\spad{linkToFortran(s,{}l,{}ll,{}lv,{}t)} \\undocumented{}") (((|SExpression|) (|Symbol|) (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|)))) (|List| (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|))))) (|List| (|Symbol|))) "\\spad{linkToFortran(s,{}l,{}ll,{}lv)} \\undocumented{}"))) NIL NIL -(-392 -4292 |returnType| -3674 |symbols|) +(-392 -4298 |returnType| -4112 |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 -(-393 -3219 UP) +(-393 -3105 UP) ((|constructor| (NIL "\\indented{1}{Full partial fraction expansion of rational functions} Author: Manuel Bronstein Date Created: 9 December 1992 Date Last Updated: 6 October 1993 References: \\spad{M}.Bronstein & \\spad{B}.Salvy,{} \\indented{12}{Full Partial Fraction Decomposition of Rational Functions,{}} \\indented{12}{in Proceedings of ISSAC'93,{} Kiev,{} ACM Press.}")) (D (($ $ (|NonNegativeInteger|)) "\\spad{D(f,{} n)} returns the \\spad{n}-th derivative of \\spad{f}.") (($ $) "\\spad{D(f)} returns the derivative of \\spad{f}.")) (|differentiate| (($ $ (|NonNegativeInteger|)) "\\spad{differentiate(f,{} n)} returns the \\spad{n}-th derivative of \\spad{f}.") (($ $) "\\spad{differentiate(f)} returns the derivative of \\spad{f}.")) (|construct| (($ (|List| (|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |center| |#2|) (|:| |num| |#2|)))) "\\spad{construct(l)} is the inverse of fracPart.")) (|fracPart| (((|List| (|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |center| |#2|) (|:| |num| |#2|))) $) "\\spad{fracPart(f)} returns the list of summands of the fractional part of \\spad{f}.")) (|polyPart| ((|#2| $) "\\spad{polyPart(f)} returns the polynomial part of \\spad{f}.")) (|fullPartialFraction| (($ (|Fraction| |#2|)) "\\spad{fullPartialFraction(f)} returns \\spad{[p,{} [[j,{} Dj,{} Hj]...]]} such that \\spad{f = p(x) + \\sum_{[j,{}Dj,{}Hj] in l} \\sum_{Dj(a)=0} Hj(a)/(x - a)\\^j}.")) (+ (($ |#2| $) "\\spad{p + x} returns the sum of \\spad{p} and \\spad{x}"))) NIL NIL (-394 R) ((|constructor| (NIL "A set \\spad{S} is PatternMatchable over \\spad{R} if \\spad{S} can lift the pattern-matching functions of \\spad{S} over the integers and float to itself (necessary for matching in towers)."))) -((-4284 . T)) +NIL NIL (-395 S) ((|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."))) @@ -1522,7 +1522,7 @@ NIL ((|HasAttribute| |#1| (QUOTE -4352)) (|HasAttribute| |#1| (QUOTE -4360))) (-398) ((|constructor| (NIL "This category is intended as a model for floating point systems. A floating point system is a model for the real numbers. In fact,{} it is an approximation in the sense that not all real numbers are exactly representable by floating point numbers. A floating point system is characterized by the following: \\blankline \\indented{2}{1: \\spadfunFrom{base}{FloatingPointSystem} of the \\spadfunFrom{exponent}{FloatingPointSystem}.} \\indented{9}{(actual implemenations are usually binary or decimal)} \\indented{2}{2: \\spadfunFrom{precision}{FloatingPointSystem} of the \\spadfunFrom{mantissa}{FloatingPointSystem} (arbitrary or fixed)} \\indented{2}{3: rounding error for operations} \\blankline Because a Float is an approximation to the real numbers,{} even though it is defined to be a join of a Field and OrderedRing,{} some of the attributes do not hold. In particular associative(\\spad{\"+\"}) does not hold. Algorithms defined over a field need special considerations when the field is a floating point system.")) (|max| (($) "\\spad{max()} returns the maximum floating point number.")) (|min| (($) "\\spad{min()} returns the minimum floating point number.")) (|decreasePrecision| (((|PositiveInteger|) (|Integer|)) "\\spad{decreasePrecision(n)} decreases the current \\spadfunFrom{precision}{FloatingPointSystem} precision by \\spad{n} decimal digits.")) (|increasePrecision| (((|PositiveInteger|) (|Integer|)) "\\spad{increasePrecision(n)} increases the current \\spadfunFrom{precision}{FloatingPointSystem} by \\spad{n} decimal digits.")) (|precision| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{precision(n)} set the precision in the base to \\spad{n} decimal digits.") (((|PositiveInteger|)) "\\spad{precision()} returns the precision in digits base.")) (|digits| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{digits(d)} set the \\spadfunFrom{precision}{FloatingPointSystem} to \\spad{d} digits.") (((|PositiveInteger|)) "\\spad{digits()} returns ceiling\\spad{'s} precision in decimal digits.")) (|bits| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{bits(n)} set the \\spadfunFrom{precision}{FloatingPointSystem} to \\spad{n} bits.") (((|PositiveInteger|)) "\\spad{bits()} returns ceiling\\spad{'s} precision in bits.")) (|mantissa| (((|Integer|) $) "\\spad{mantissa(x)} returns the mantissa part of \\spad{x}.")) (|exponent| (((|Integer|) $) "\\spad{exponent(x)} returns the \\spadfunFrom{exponent}{FloatingPointSystem} part of \\spad{x}.")) (|base| (((|PositiveInteger|)) "\\spad{base()} returns the base of the \\spadfunFrom{exponent}{FloatingPointSystem}.")) (|order| (((|Integer|) $) "\\spad{order x} is the order of magnitude of \\spad{x}. Note: \\spad{base ** order x <= |x| < base ** (1 + order x)}.")) (|float| (($ (|Integer|) (|Integer|) (|PositiveInteger|)) "\\spad{float(a,{}e,{}b)} returns \\spad{a * b ** e}.") (($ (|Integer|) (|Integer|)) "\\spad{float(a,{}e)} returns \\spad{a * base() ** e}.")) (|approximate| ((|attribute|) "\\spad{approximate} means \"is an approximation to the real numbers\"."))) -((-4312 . T) (-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) +((-4327 . T) (-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-399 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."))) @@ -1535,7 +1535,7 @@ NIL (-401 S) ((|constructor| (NIL "Fraction takes an IntegralDomain \\spad{S} and produces the domain of Fractions with numerators and denominators from \\spad{S}. If \\spad{S} is also a GcdDomain,{} then \\spad{gcd}\\spad{'s} between numerator and denominator will be cancelled during all operations.")) (|canonical| ((|attribute|) "\\spad{canonical} means that equal elements are in fact identical."))) ((-4356 -12 (|has| |#1| (-6 -4367)) (|has| |#1| (-445)) (|has| |#1| (-6 -4356))) (-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (QUOTE (-891))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-814)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-1004))) (|HasCategory| |#1| (QUOTE (-806))) (-4028 (|HasCategory| |#1| (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-833)))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-814)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-1130))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-814)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-814))))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (-12 (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-814))))) (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -280) (|devaluate| |#1|) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-814)))) (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-538))) (-12 (|HasAttribute| |#1| (QUOTE -4367)) (|HasAttribute| |#1| (QUOTE -4356)) (|HasCategory| |#1| (QUOTE (-445)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) +((|HasCategory| |#1| (QUOTE (-891))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-814)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-1004))) (|HasCategory| |#1| (QUOTE (-806))) (-3988 (|HasCategory| |#1| (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-833)))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-814)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-1130))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373)))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-814)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-814))))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (-12 (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-814))))) (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -280) (|devaluate| |#1|) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-814)))) (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-538))) (-12 (|HasAttribute| |#1| (QUOTE -4367)) (|HasAttribute| |#1| (QUOTE -4356)) (|HasCategory| |#1| (QUOTE (-445)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) (-402 S R UP) ((|constructor| (NIL "A \\spadtype{FramedAlgebra} is a \\spadtype{FiniteRankAlgebra} together with a fixed \\spad{R}-module basis.")) (|regularRepresentation| (((|Matrix| |#2|) $) "\\spad{regularRepresentation(a)} returns the matrix of the linear map defined by left multiplication by \\spad{a} with respect to the fixed basis.")) (|discriminant| ((|#2|) "\\spad{discriminant()} = determinant(traceMatrix()).")) (|traceMatrix| (((|Matrix| |#2|)) "\\spad{traceMatrix()} is the \\spad{n}-by-\\spad{n} matrix ( \\spad{Tr(\\spad{vi} * vj)} ),{} where \\spad{v1},{} ...,{} \\spad{vn} are the elements of the fixed basis.")) (|convert| (($ (|Vector| |#2|)) "\\spad{convert([a1,{}..,{}an])} returns \\spad{a1*v1 + ... + an*vn},{} where \\spad{v1},{} ...,{} \\spad{vn} are the elements of the fixed basis.") (((|Vector| |#2|) $) "\\spad{convert(a)} returns the coordinates of \\spad{a} with respect to the fixed \\spad{R}-module basis.")) (|represents| (($ (|Vector| |#2|)) "\\spad{represents([a1,{}..,{}an])} returns \\spad{a1*v1 + ... + an*vn},{} where \\spad{v1},{} ...,{} \\spad{vn} are the elements of the fixed basis.")) (|coordinates| (((|Matrix| |#2|) (|Vector| $)) "\\spad{coordinates([v1,{}...,{}vm])} returns the coordinates of the \\spad{vi}\\spad{'s} with to the fixed basis. The coordinates of \\spad{vi} are contained in the \\spad{i}th row of the matrix returned by this function.") (((|Vector| |#2|) $) "\\spad{coordinates(a)} returns the coordinates of \\spad{a} with respect to the fixed \\spad{R}-module basis.")) (|basis| (((|Vector| $)) "\\spad{basis()} returns the fixed \\spad{R}-module basis."))) NIL @@ -1556,11 +1556,11 @@ NIL ((|constructor| (NIL "\\indented{1}{Lifting of morphisms to fractional ideals.} Author: Manuel Bronstein Date Created: 1 Feb 1989 Date Last Updated: 27 Feb 1990 Keywords: ideal,{} algebra,{} module.")) (|map| (((|FractionalIdeal| |#5| |#6| |#7| |#8|) (|Mapping| |#5| |#1|) (|FractionalIdeal| |#1| |#2| |#3| |#4|)) "\\spad{map(f,{}i)} \\undocumented{}"))) NIL NIL -(-407 R -3219 UP A) +(-407 R -3105 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)}."))) ((-4366 . T)) NIL -(-408 R -3219 UP A |ibasis|) +(-408 R -3105 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 -1020) (|devaluate| |#2|)))) @@ -1579,7 +1579,7 @@ NIL (-412 R) ((|constructor| (NIL "\\spadtype{Factored} creates a domain whose objects are kept in factored form as long as possible. Thus certain operations like multiplication and \\spad{gcd} are relatively easy to do. Others,{} like addition require somewhat more work,{} and unless the argument domain provides a factor function,{} the result may not be completely factored. Each object consists of a unit and a list of factors,{} where a factor has a member of \\spad{R} (the \"base\"),{} and exponent and a flag indicating what is known about the base. A flag may be one of \"nil\",{} \"sqfr\",{} \"irred\" or \"prime\",{} which respectively mean that nothing is known about the base,{} it is square-free,{} it is irreducible,{} or it is prime. The current restriction to integral domains allows simplification to be performed without worrying about multiplication order.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(u)} returns a rational number if \\spad{u} really is one,{} and \"failed\" otherwise.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(u)} assumes spadvar{\\spad{u}} is actually a rational number and does the conversion to rational number (see \\spadtype{Fraction Integer}).")) (|rational?| (((|Boolean|) $) "\\spad{rational?(u)} tests if \\spadvar{\\spad{u}} is actually a rational number (see \\spadtype{Fraction Integer}).")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(fn,{}u)} maps the function \\userfun{\\spad{fn}} across the factors of \\spadvar{\\spad{u}} and creates a new factored object. Note: this clears the information flags (sets them to \"nil\") because the effect of \\userfun{\\spad{fn}} is clearly not known in general.")) (|unitNormalize| (($ $) "\\spad{unitNormalize(u)} normalizes the unit part of the factorization. For example,{} when working with factored integers,{} this operation will ensure that the bases are all positive integers.")) (|unit| ((|#1| $) "\\spad{unit(u)} extracts the unit part of the factorization.")) (|flagFactor| (($ |#1| (|Integer|) (|Union| "nil" "sqfr" "irred" "prime")) "\\spad{flagFactor(base,{}exponent,{}flag)} creates a factored object with a single factor whose \\spad{base} is asserted to be properly described by the information \\spad{flag}.")) (|sqfrFactor| (($ |#1| (|Integer|)) "\\spad{sqfrFactor(base,{}exponent)} creates a factored object with a single factor whose \\spad{base} is asserted to be square-free (flag = \"sqfr\").")) (|primeFactor| (($ |#1| (|Integer|)) "\\spad{primeFactor(base,{}exponent)} creates a factored object with a single factor whose \\spad{base} is asserted to be prime (flag = \"prime\").")) (|numberOfFactors| (((|NonNegativeInteger|) $) "\\spad{numberOfFactors(u)} returns the number of factors in \\spadvar{\\spad{u}}.")) (|nthFlag| (((|Union| "nil" "sqfr" "irred" "prime") $ (|Integer|)) "\\spad{nthFlag(u,{}n)} returns the information flag of the \\spad{n}th factor of \\spadvar{\\spad{u}}. If \\spadvar{\\spad{n}} is not a valid index for a factor (for example,{} less than 1 or too big),{} \"nil\" is returned.")) (|nthFactor| ((|#1| $ (|Integer|)) "\\spad{nthFactor(u,{}n)} returns the base of the \\spad{n}th factor of \\spadvar{\\spad{u}}. If \\spadvar{\\spad{n}} is not a valid index for a factor (for example,{} less than 1 or too big),{} 1 is returned. If \\spadvar{\\spad{u}} consists only of a unit,{} the unit is returned.")) (|nthExponent| (((|Integer|) $ (|Integer|)) "\\spad{nthExponent(u,{}n)} returns the exponent of the \\spad{n}th factor of \\spadvar{\\spad{u}}. If \\spadvar{\\spad{n}} is not a valid index for a factor (for example,{} less than 1 or too big),{} 0 is returned.")) (|irreducibleFactor| (($ |#1| (|Integer|)) "\\spad{irreducibleFactor(base,{}exponent)} creates a factored object with a single factor whose \\spad{base} is asserted to be irreducible (flag = \"irred\").")) (|factors| (((|List| (|Record| (|:| |factor| |#1|) (|:| |exponent| (|Integer|)))) $) "\\spad{factors(u)} returns a list of the factors in a form suitable for iteration. That is,{} it returns a list where each element is a record containing a base and exponent. The original object is the product of all the factors and the unit (which can be extracted by \\axiom{unit(\\spad{u})}).")) (|nilFactor| (($ |#1| (|Integer|)) "\\spad{nilFactor(base,{}exponent)} creates a factored object with a single factor with no information about the kind of \\spad{base} (flag = \"nil\").")) (|factorList| (((|List| (|Record| (|:| |flg| (|Union| "nil" "sqfr" "irred" "prime")) (|:| |fctr| |#1|) (|:| |xpnt| (|Integer|)))) $) "\\spad{factorList(u)} returns the list of factors with flags (for use by factoring code).")) (|makeFR| (($ |#1| (|List| (|Record| (|:| |flg| (|Union| "nil" "sqfr" "irred" "prime")) (|:| |fctr| |#1|) (|:| |xpnt| (|Integer|))))) "\\spad{makeFR(unit,{}listOfFactors)} creates a factored object (for use by factoring code).")) (|exponent| (((|Integer|) $) "\\spad{exponent(u)} returns the exponent of the first factor of \\spadvar{\\spad{u}},{} or 0 if the factored form consists solely of a unit.")) (|expand| ((|#1| $) "\\spad{expand(f)} multiplies the unit and factors together,{} yielding an \"unfactored\" object. Note: this is purposely not called \\spadfun{coerce} which would cause the interpreter to do this automatically."))) ((-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -303) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -280) (QUOTE $) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-1196))) (-4028 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-1196)))) (|HasCategory| |#1| (QUOTE (-1004))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -280) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-445)))) +((|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -303) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -280) (QUOTE $) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-1196))) (-3988 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-1196)))) (|HasCategory| |#1| (QUOTE (-1004))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -280) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-445)))) (-413 R) ((|constructor| (NIL "\\spadtype{FactoredFunctionUtilities} implements some utility functions for manipulating factored objects.")) (|mergeFactors| (((|Factored| |#1|) (|Factored| |#1|) (|Factored| |#1|)) "\\spad{mergeFactors(u,{}v)} is used when the factorizations of \\spadvar{\\spad{u}} and \\spadvar{\\spad{v}} are known to be disjoint,{} \\spadignore{e.g.} resulting from a content/primitive part split. Essentially,{} it creates a new factored object by multiplying the units together and appending the lists of factors.")) (|refine| (((|Factored| |#1|) (|Factored| |#1|) (|Mapping| (|Factored| |#1|) |#1|)) "\\spad{refine(u,{}fn)} is used to apply the function \\userfun{\\spad{fn}} to each factor of \\spadvar{\\spad{u}} and then build a new factored object from the results. For example,{} if \\spadvar{\\spad{u}} were created by calling \\spad{nilFactor(10,{}2)} then \\spad{refine(u,{}factor)} would create a factored object equal to that created by \\spad{factor(100)} or \\spad{primeFactor(2,{}2) * primeFactor(5,{}2)}."))) NIL @@ -1593,7 +1593,7 @@ NIL NIL NIL (-416 R FE |Expon| UPS TRAN |x|) -((|constructor| (NIL "This package converts expressions in some function space to power series in a variable \\spad{x} with coefficients in that function space. The function \\spadfun{exprToUPS} converts expressions to power series whose coefficients do not contain the variable \\spad{x}. The function \\spadfun{exprToGenUPS} converts functional expressions to power series whose coefficients may involve functions of \\spad{log(x)}.")) (|localAbs| ((|#2| |#2|) "\\spad{localAbs(fcn)} = \\spad{abs(fcn)} or \\spad{sqrt(fcn**2)} depending on whether or not FE has a function \\spad{abs}. This should be a local function,{} but the compiler won\\spad{'t} allow it.")) (|exprToGenUPS| (((|Union| (|:| |%series| |#4|) (|:| |%problem| (|Record| (|:| |func| (|String|)) (|:| |prob| (|String|))))) |#2| (|Boolean|) (|String|)) "\\spad{exprToGenUPS(fcn,{}posCheck?,{}atanFlag)} converts the expression \\spad{fcn} to a generalized power series. If \\spad{posCheck?} is \\spad{true},{} log\\spad{'s} of negative numbers are not allowed nor are \\spad{n}th roots of negative numbers with \\spad{n} even. If \\spad{posCheck?} is \\spad{false},{} these are allowed. \\spad{atanFlag} determines how the case \\spad{atan(f(x))},{} where \\spad{f(x)} has a pole,{} will be treated. The possible values of \\spad{atanFlag} are \\spad{\"complex\"},{} \\spad{\"real: two sides\"},{} \\spad{\"real: left side\"},{} \\spad{\"real: right side\"},{} and \\spad{\"just do it\"}. If \\spad{atanFlag} is \\spad{\"complex\"},{} then no series expansion will be computed because,{} viewed as a function of a complex variable,{} \\spad{atan(f(x))} has an essential singularity. Otherwise,{} the sign of the leading coefficient of the series expansion of \\spad{f(x)} determines the constant coefficient in the series expansion of \\spad{atan(f(x))}. If this sign cannot be determined,{} a series expansion is computed only when \\spad{atanFlag} is \\spad{\"just do it\"}. When the leading term in the series expansion of \\spad{f(x)} is of odd degree (or is a rational degree with odd numerator),{} then the constant coefficient in the series expansion of \\spad{atan(f(x))} for values to the left differs from that for values to the right. If \\spad{atanFlag} is \\spad{\"real: two sides\"},{} no series expansion will be computed. If \\spad{atanFlag} is \\spad{\"real: left side\"} the constant coefficient for values to the left will be used and if \\spad{atanFlag} \\spad{\"real: right side\"} the constant coefficient for values to the right will be used. If there is a problem in converting the function to a power series,{} we return a record containing the name of the function that caused the problem and a brief description of the problem. When expanding the expression into a series it is assumed that the series is centered at 0. For a series centered at a,{} the user should perform the substitution \\spad{x -> x + a} before calling this function.")) (|exprToUPS| (((|Union| (|:| |%series| |#4|) (|:| |%problem| (|Record| (|:| |func| (|String|)) (|:| |prob| (|String|))))) |#2| (|Boolean|) (|String|)) "\\spad{exprToUPS(fcn,{}posCheck?,{}atanFlag)} converts the expression \\spad{fcn} to a power series. If \\spad{posCheck?} is \\spad{true},{} log\\spad{'s} of negative numbers are not allowed nor are \\spad{n}th roots of negative numbers with \\spad{n} even. If \\spad{posCheck?} is \\spad{false},{} these are allowed. \\spad{atanFlag} determines how the case \\spad{atan(f(x))},{} where \\spad{f(x)} has a pole,{} will be treated. The possible values of \\spad{atanFlag} are \\spad{\"complex\"},{} \\spad{\"real: two sides\"},{} \\spad{\"real: left side\"},{} \\spad{\"real: right side\"},{} and \\spad{\"just do it\"}. If \\spad{atanFlag} is \\spad{\"complex\"},{} then no series expansion will be computed because,{} viewed as a function of a complex variable,{} \\spad{atan(f(x))} has an essential singularity. Otherwise,{} the sign of the leading coefficient of the series expansion of \\spad{f(x)} determines the constant coefficient in the series expansion of \\spad{atan(f(x))}. If this sign cannot be determined,{} a series expansion is computed only when \\spad{atanFlag} is \\spad{\"just do it\"}. When the leading term in the series expansion of \\spad{f(x)} is of odd degree (or is a rational degree with odd numerator),{} then the constant coefficient in the series expansion of \\spad{atan(f(x))} for values to the left differs from that for values to the right. If \\spad{atanFlag} is \\spad{\"real: two sides\"},{} no series expansion will be computed. If \\spad{atanFlag} is \\spad{\"real: left side\"} the constant coefficient for values to the left will be used and if \\spad{atanFlag} \\spad{\"real: right side\"} the constant coefficient for values to the right will be used. If there is a problem in converting the function to a power series,{} a record containing the name of the function that caused the problem and a brief description of the problem is returned. When expanding the expression into a series it is assumed that the series is centered at 0. For a series centered at a,{} the user should perform the substitution \\spad{x -> x + a} before calling this function.")) (|integrate| (($ $) "\\spad{integrate(x)} returns the integral of \\spad{x} since we need to be able to integrate a power series")) (|differentiate| (($ $) "\\spad{differentiate(x)} returns the derivative of \\spad{x} since we need to be able to differentiate a power series")) (|coerce| (($ |#3|) "\\spad{coerce(e)} converts an 'exponent' \\spad{e} to an 'expression'"))) +((|constructor| (NIL "This package converts expressions in some function space to power series in a variable \\spad{x} with coefficients in that function space. The function \\spadfun{exprToUPS} converts expressions to power series whose coefficients do not contain the variable \\spad{x}. The function \\spadfun{exprToGenUPS} converts functional expressions to power series whose coefficients may involve functions of \\spad{log(x)}.")) (|localAbs| ((|#2| |#2|) "\\spad{localAbs(fcn)} = \\spad{abs(fcn)} or \\spad{sqrt(fcn**2)} depending on whether or not FE has a function \\spad{abs}. This should be a local function,{} but the compiler won\\spad{'t} allow it.")) (|exprToGenUPS| (((|Union| (|:| |%series| |#4|) (|:| |%problem| (|Record| (|:| |func| (|String|)) (|:| |prob| (|String|))))) |#2| (|Boolean|) (|String|)) "\\spad{exprToGenUPS(fcn,{}posCheck?,{}atanFlag)} converts the expression \\spad{fcn} to a generalized power series. If \\spad{posCheck?} is \\spad{true},{} log\\spad{'s} of negative numbers are not allowed nor are \\spad{n}th roots of negative numbers with \\spad{n} even. If \\spad{posCheck?} is \\spad{false},{} these are allowed. \\spad{atanFlag} determines how the case \\spad{atan(f(x))},{} where \\spad{f(x)} has a pole,{} will be treated. The possible values of \\spad{atanFlag} are \\spad{\"complex\"},{} \\spad{\"real: two sides\"},{} \\spad{\"real: left side\"},{} \\spad{\"real: right side\"},{} and \\spad{\"just do it\"}. If \\spad{atanFlag} is \\spad{\"complex\"},{} then no series expansion will be computed because,{} viewed as a function of a complex variable,{} \\spad{atan(f(x))} has an essential singularity. Otherwise,{} the sign of the leading coefficient of the series expansion of \\spad{f(x)} determines the constant coefficient in the series expansion of \\spad{atan(f(x))}. If this sign cannot be determined,{} a series expansion is computed only when \\spad{atanFlag} is \\spad{\"just do it\"}. When the leading term in the series expansion of \\spad{f(x)} is of odd degree (or is a rational degree with odd numerator),{} then the constant coefficient in the series expansion of \\spad{atan(f(x))} for values to the left differs from that for values to the right. If \\spad{atanFlag} is \\spad{\"real: two sides\"},{} no series expansion will be computed. If \\spad{atanFlag} is \\spad{\"real: left side\"} the constant coefficient for values to the left will be used and if \\spad{atanFlag} \\spad{\"real: right side\"} the constant coefficient for values to the right will be used. If there is a problem in converting the function to a power series,{} we return a record containing the name of the function that caused the problem and a brief description of the problem. When expanding the expression into a series it is assumed that the series is centered at 0. For a series centered at a,{} the user should perform the substitution \\spad{x -> x + a} before calling this function.")) (|exprToUPS| (((|Union| (|:| |%series| |#4|) (|:| |%problem| (|Record| (|:| |func| (|String|)) (|:| |prob| (|String|))))) |#2| (|Boolean|) (|String|)) "\\spad{exprToUPS(fcn,{}posCheck?,{}atanFlag)} converts the expression \\spad{fcn} to a power series. If \\spad{posCheck?} is \\spad{true},{} log\\spad{'s} of negative numbers are not allowed nor are \\spad{n}th roots of negative numbers with \\spad{n} even. If \\spad{posCheck?} is \\spad{false},{} these are allowed. \\spad{atanFlag} determines how the case \\spad{atan(f(x))},{} where \\spad{f(x)} has a pole,{} will be treated. The possible values of \\spad{atanFlag} are \\spad{\"complex\"},{} \\spad{\"real: two sides\"},{} \\spad{\"real: left side\"},{} \\spad{\"real: right side\"},{} and \\spad{\"just do it\"}. If \\spad{atanFlag} is \\spad{\"complex\"},{} then no series expansion will be computed because,{} viewed as a function of a complex variable,{} \\spad{atan(f(x))} has an essential singularity. Otherwise,{} the sign of the leading coefficient of the series expansion of \\spad{f(x)} determines the constant coefficient in the series expansion of \\spad{atan(f(x))}. If this sign cannot be determined,{} a series expansion is computed only when \\spad{atanFlag} is \\spad{\"just do it\"}. When the leading term in the series expansion of \\spad{f(x)} is of odd degree (or is a rational degree with odd numerator),{} then the constant coefficient in the series expansion of \\spad{atan(f(x))} for values to the left differs from that for values to the right. If \\spad{atanFlag} is \\spad{\"real: two sides\"},{} no series expansion will be computed. If \\spad{atanFlag} is \\spad{\"real: left side\"} the constant coefficient for values to the left will be used and if \\spad{atanFlag} \\spad{\"real: right side\"} the constant coefficient for values to the right will be used. If there is a problem in converting the function to a power series,{} a record containing the name of the function that caused the problem and a brief description of the problem is returned. When expanding the expression into a series it is assumed that the series is centered at 0. For a series centered at a,{} the user should perform the substitution \\spad{x -> x + a} before calling this function.")) (|integrate| (($ $) "\\spad{integrate(x)} returns the integral of \\spad{x} since we need to be able to integrate a power series")) (|differentiate| (($ $) "\\spad{differentiate(x)} returns the derivative of \\spad{x} since we need to be able to differentiate a power series"))) NIL NIL (-417 S A R B) @@ -1606,9 +1606,9 @@ NIL ((|HasCategory| |#2| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-362)))) (-419 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}."))) -((-4369 . T) (-4359 . T) (-4370 . T) (-4284 . T)) +((-4369 . T) (-4359 . T) (-4370 . T)) NIL -(-420 R -3219) +(-420 R -3105) ((|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 @@ -1616,7 +1616,7 @@ NIL ((|constructor| (NIL "\\indented{1}{Author: James Davenport} Date Created: 17 April 1992 Date Last Updated: Basic Functions: Related Constructors: Also See: AMS Classifications: Keywords: References: Description:")) (|makeCos| (($ |#2| |#1|) "\\spad{makeCos(e,{}r)} makes a sin expression with given argument and coefficient")) (|makeSin| (($ |#2| |#1|) "\\spad{makeSin(e,{}r)} makes a sin expression with given argument and coefficient")) (|coerce| (($ (|FourierComponent| |#2|)) "\\spad{coerce(c)} converts sin/cos terms into Fourier Series") (($ |#1|) "\\spad{coerce(r)} converts coefficients into Fourier Series"))) ((-4356 -12 (|has| |#1| (-6 -4356)) (|has| |#2| (-6 -4356))) (-4363 . T) (-4364 . T) (-4366 . T)) ((-12 (|HasAttribute| |#1| (QUOTE -4356)) (|HasAttribute| |#2| (QUOTE -4356)))) -(-422 R -3219) +(-422 R -3105) ((|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 @@ -1626,17 +1626,17 @@ NIL ((|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-1091))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (-424 R) ((|constructor| (NIL "A space of formal functions with arguments in an arbitrary ordered set.")) (|univariate| (((|Fraction| (|SparseUnivariatePolynomial| $)) $ (|Kernel| $)) "\\spad{univariate(f,{} k)} returns \\spad{f} viewed as a univariate fraction in \\spad{k}.")) (/ (($ (|SparseMultivariatePolynomial| |#1| (|Kernel| $)) (|SparseMultivariatePolynomial| |#1| (|Kernel| $))) "\\spad{p1/p2} returns the quotient of \\spad{p1} and \\spad{p2} as an element of \\%.")) (|denominator| (($ $) "\\spad{denominator(f)} returns the denominator of \\spad{f} converted to \\%.")) (|denom| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{denom(f)} returns the denominator of \\spad{f} viewed as a polynomial in the kernels over \\spad{R}.")) (|convert| (($ (|Factored| $)) "\\spad{convert(f1\\^e1 ... fm\\^em)} returns \\spad{(f1)\\^e1 ... (fm)\\^em} as an element of \\%,{} using formal kernels created using a \\spadfunFrom{paren}{ExpressionSpace}.")) (|isPower| (((|Union| (|Record| (|:| |val| $) (|:| |exponent| (|Integer|))) "failed") $) "\\spad{isPower(p)} returns \\spad{[x,{} n]} if \\spad{p = x**n} and \\spad{n <> 0}.")) (|numerator| (($ $) "\\spad{numerator(f)} returns the numerator of \\spad{f} converted to \\%.")) (|numer| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{numer(f)} returns the numerator of \\spad{f} viewed as a polynomial in the kernels over \\spad{R} if \\spad{R} is an integral domain. If not,{} then numer(\\spad{f}) = \\spad{f} viewed as a polynomial in the kernels over \\spad{R}.")) (|coerce| (($ (|Fraction| (|Polynomial| (|Fraction| |#1|)))) "\\spad{coerce(f)} returns \\spad{f} as an element of \\%.") (($ (|Polynomial| (|Fraction| |#1|))) "\\spad{coerce(p)} returns \\spad{p} as an element of \\%.") (($ (|Fraction| |#1|)) "\\spad{coerce(q)} returns \\spad{q} as an element of \\%.") (($ (|SparseMultivariatePolynomial| |#1| (|Kernel| $))) "\\spad{coerce(p)} returns \\spad{p} as an element of \\%.")) (|isMult| (((|Union| (|Record| (|:| |coef| (|Integer|)) (|:| |var| (|Kernel| $))) "failed") $) "\\spad{isMult(p)} returns \\spad{[n,{} x]} if \\spad{p = n * x} and \\spad{n <> 0}.")) (|isPlus| (((|Union| (|List| $) "failed") $) "\\spad{isPlus(p)} returns \\spad{[m1,{}...,{}mn]} if \\spad{p = m1 +...+ mn} and \\spad{n > 1}.")) (|isExpt| (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $ (|Symbol|)) "\\spad{isExpt(p,{}f)} returns \\spad{[x,{} n]} if \\spad{p = x**n} and \\spad{n <> 0} and \\spad{x = f(a)}.") (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $ (|BasicOperator|)) "\\spad{isExpt(p,{}op)} returns \\spad{[x,{} n]} if \\spad{p = x**n} and \\spad{n <> 0} and \\spad{x = op(a)}.") (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $) "\\spad{isExpt(p)} returns \\spad{[x,{} n]} if \\spad{p = x**n} and \\spad{n <> 0}.")) (|isTimes| (((|Union| (|List| $) "failed") $) "\\spad{isTimes(p)} returns \\spad{[a1,{}...,{}an]} if \\spad{p = a1*...*an} and \\spad{n > 1}.")) (** (($ $ (|NonNegativeInteger|)) "\\spad{x**n} returns \\spad{x} * \\spad{x} * \\spad{x} * ... * \\spad{x} (\\spad{n} times).")) (|eval| (($ $ (|Symbol|) (|NonNegativeInteger|) (|Mapping| $ $)) "\\spad{eval(x,{} s,{} n,{} f)} replaces every \\spad{s(a)**n} in \\spad{x} by \\spad{f(a)} for any \\spad{a}.") (($ $ (|Symbol|) (|NonNegativeInteger|) (|Mapping| $ (|List| $))) "\\spad{eval(x,{} s,{} n,{} f)} replaces every \\spad{s(a1,{}...,{}am)**n} in \\spad{x} by \\spad{f(a1,{}...,{}am)} for any a1,{}...,{}am.") (($ $ (|List| (|Symbol|)) (|List| (|NonNegativeInteger|)) (|List| (|Mapping| $ (|List| $)))) "\\spad{eval(x,{} [s1,{}...,{}sm],{} [n1,{}...,{}nm],{} [f1,{}...,{}fm])} replaces every \\spad{\\spad{si}(a1,{}...,{}an)**ni} in \\spad{x} by \\spad{\\spad{fi}(a1,{}...,{}an)} for any a1,{}...,{}am.") (($ $ (|List| (|Symbol|)) (|List| (|NonNegativeInteger|)) (|List| (|Mapping| $ $))) "\\spad{eval(x,{} [s1,{}...,{}sm],{} [n1,{}...,{}nm],{} [f1,{}...,{}fm])} replaces every \\spad{\\spad{si}(a)**ni} in \\spad{x} by \\spad{\\spad{fi}(a)} for any \\spad{a}.") (($ $ (|List| (|BasicOperator|)) (|List| $) (|Symbol|)) "\\spad{eval(x,{} [s1,{}...,{}sm],{} [f1,{}...,{}fm],{} y)} replaces every \\spad{\\spad{si}(a)} in \\spad{x} by \\spad{\\spad{fi}(y)} with \\spad{y} replaced by \\spad{a} for any \\spad{a}.") (($ $ (|BasicOperator|) $ (|Symbol|)) "\\spad{eval(x,{} s,{} f,{} y)} replaces every \\spad{s(a)} in \\spad{x} by \\spad{f(y)} with \\spad{y} replaced by \\spad{a} for any \\spad{a}.") (($ $) "\\spad{eval(f)} unquotes all the quoted operators in \\spad{f}.") (($ $ (|List| (|Symbol|))) "\\spad{eval(f,{} [foo1,{}...,{}foon])} unquotes all the \\spad{fooi}\\spad{'s} in \\spad{f}.") (($ $ (|Symbol|)) "\\spad{eval(f,{} foo)} unquotes all the foo\\spad{'s} in \\spad{f}.")) (|applyQuote| (($ (|Symbol|) (|List| $)) "\\spad{applyQuote(foo,{} [x1,{}...,{}xn])} returns \\spad{'foo(x1,{}...,{}xn)}.") (($ (|Symbol|) $ $ $ $) "\\spad{applyQuote(foo,{} x,{} y,{} z,{} t)} returns \\spad{'foo(x,{}y,{}z,{}t)}.") (($ (|Symbol|) $ $ $) "\\spad{applyQuote(foo,{} x,{} y,{} z)} returns \\spad{'foo(x,{}y,{}z)}.") (($ (|Symbol|) $ $) "\\spad{applyQuote(foo,{} x,{} y)} returns \\spad{'foo(x,{}y)}.") (($ (|Symbol|) $) "\\spad{applyQuote(foo,{} x)} returns \\spad{'foo(x)}.")) (|variables| (((|List| (|Symbol|)) $) "\\spad{variables(f)} returns the list of all the variables of \\spad{f}.")) (|ground| ((|#1| $) "\\spad{ground(f)} returns \\spad{f} as an element of \\spad{R}. An error occurs if \\spad{f} is not an element of \\spad{R}.")) (|ground?| (((|Boolean|) $) "\\spad{ground?(f)} tests if \\spad{f} is an element of \\spad{R}."))) -((-4366 -4028 (|has| |#1| (-1031)) (|has| |#1| (-466))) (-4364 |has| |#1| (-169)) (-4363 |has| |#1| (-169)) ((-4371 "*") |has| |#1| (-545)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-545)) (-4361 |has| |#1| (-545)) (-4284 . T)) +((-4366 -3988 (|has| |#1| (-1031)) (|has| |#1| (-466))) (-4364 |has| |#1| (-169)) (-4363 |has| |#1| (-169)) ((-4371 "*") |has| |#1| (-545)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-545)) (-4361 |has| |#1| (-545))) NIL -(-425 R -3219) +(-425 R -3105) ((|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 -(-426 R -3219) +(-426 R -3105) ((|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{\\spad{ai} = \\spad{qi}(a)},{} and \\spad{q(a) = 0}. The minimal polynomial for a2 may involve \\spad{a1},{} but the minimal polynomial for \\spad{a1} may not involve a2; This operations uses \\spadfun{resultant}.") (((|Record| (|:| |primelt| |#2|) (|:| |poly| (|List| (|SparseUnivariatePolynomial| |#2|))) (|:| |prim| (|SparseUnivariatePolynomial| |#2|))) (|List| |#2|)) "\\spad{primitiveElement([a1,{}...,{}an])} returns \\spad{[a,{} [q1,{}...,{}qn],{} q]} such that then \\spad{k(a1,{}...,{}an) = k(a)},{} \\spad{\\spad{ai} = \\spad{qi}(a)},{} and \\spad{q(a) = 0}. This operation uses the technique of \\spadglossSee{groebner bases}{Groebner basis}."))) NIL ((|HasCategory| |#2| (QUOTE (-27)))) -(-427 R -3219) +(-427 R -3105) ((|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 @@ -1644,7 +1644,7 @@ NIL ((|constructor| (NIL "Creates and manipulates objects which correspond to the basic FORTRAN data types: REAL,{} INTEGER,{} COMPLEX,{} LOGICAL and CHARACTER")) (= (((|Boolean|) $ $) "\\spad{x=y} tests for equality")) (|logical?| (((|Boolean|) $) "\\spad{logical?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type LOGICAL.")) (|character?| (((|Boolean|) $) "\\spad{character?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type CHARACTER.")) (|doubleComplex?| (((|Boolean|) $) "\\spad{doubleComplex?(t)} tests whether \\spad{t} is equivalent to the (non-standard) FORTRAN type DOUBLE COMPLEX.")) (|complex?| (((|Boolean|) $) "\\spad{complex?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type COMPLEX.")) (|integer?| (((|Boolean|) $) "\\spad{integer?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type INTEGER.")) (|double?| (((|Boolean|) $) "\\spad{double?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type DOUBLE PRECISION")) (|real?| (((|Boolean|) $) "\\spad{real?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type REAL.")) (|coerce| (((|SExpression|) $) "\\spad{coerce(x)} returns the \\spad{s}-expression associated with \\spad{x}") (((|Symbol|) $) "\\spad{coerce(x)} returns the symbol associated with \\spad{x}") (($ (|Symbol|)) "\\spad{coerce(s)} transforms the symbol \\spad{s} into an element of FortranScalarType provided \\spad{s} is one of real,{} complex,{}double precision,{} logical,{} integer,{} character,{} REAL,{} COMPLEX,{} LOGICAL,{} INTEGER,{} CHARACTER,{} DOUBLE PRECISION") (($ (|String|)) "\\spad{coerce(s)} transforms the string \\spad{s} into an element of FortranScalarType provided \\spad{s} is one of \"real\",{} \"double precision\",{} \"complex\",{} \"logical\",{} \"integer\",{} \"character\",{} \"REAL\",{} \"COMPLEX\",{} \"LOGICAL\",{} \"INTEGER\",{} \"CHARACTER\",{} \"DOUBLE PRECISION\""))) NIL NIL -(-429 R -3219 UP) +(-429 R -3105 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 -1020) (QUOTE (-48))))) @@ -1653,7 +1653,7 @@ NIL NIL NIL (-431) -((|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| "void")) (|List| (|Polynomial| (|Integer|))) (|Boolean|)) "\\spad{construct(type,{}dims)} creates an element of FortranType") (($ (|Union| (|:| |fst| (|FortranScalarType|)) (|:| |void| "void")) (|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| "void")) $) "\\spad{scalarTypeOf(t)} returns the FORTRAN data type of \\spad{t}")) (|coerce| (($ (|FortranScalarType|)) "\\spad{coerce(t)} creates an element from a scalar type") (((|OutputForm|) $) "\\spad{coerce(x)} provides a printable form for \\spad{x}"))) +((|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| "void")) (|List| (|Polynomial| (|Integer|))) (|Boolean|)) "\\spad{construct(type,{}dims)} creates an element of FortranType") (($ (|Union| (|:| |fst| (|FortranScalarType|)) (|:| |void| "void")) (|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| "void")) $) "\\spad{scalarTypeOf(t)} returns the FORTRAN data type of \\spad{t}")) (|coerce| (($ (|FortranScalarType|)) "\\spad{coerce(t)} creates an element from a scalar type"))) NIL NIL (-432 |f|) @@ -1662,17 +1662,17 @@ NIL NIL (-433) ((|constructor| (NIL "\\axiomType{FortranVectorCategory} provides support for producing Functions and Subroutines when the input to these is an AXIOM object of type \\axiomType{Vector} 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.}") (($ (|Vector| (|MachineFloat|))) "\\spad{coerce(v)} produces an ASP which returns the value of \\spad{v}."))) -((-4284 . T)) +NIL NIL (-434) ((|constructor| (NIL "\\axiomType{FortranVectorFunctionCategory} is the catagory of arguments to NAG Library routines which return the values of vectors of functions.")) (|retractIfCan| (((|Union| $ "failed") (|Vector| (|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") (|Vector| (|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") (|Vector| (|Polynomial| (|Integer|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Vector| (|Polynomial| (|Float|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Vector| (|Expression| (|Integer|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Vector| (|Expression| (|Float|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|retract| (($ (|Vector| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Vector| (|Fraction| (|Polynomial| (|Float|))))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Vector| (|Polynomial| (|Integer|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Vector| (|Polynomial| (|Float|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Vector| (|Expression| (|Integer|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Vector| (|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.}"))) -((-4284 . T)) +NIL NIL (-435 UP) ((|constructor| (NIL "\\spadtype{GaloisGroupFactorizer} provides functions to factor resolvents.")) (|btwFact| (((|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|)))))) |#1| (|Boolean|) (|Set| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{btwFact(p,{}sqf,{}pd,{}r)} returns the factorization of \\spad{p},{} the result is a Record such that \\spad{contp=}content \\spad{p},{} \\spad{factors=}List of irreducible factors of \\spad{p} with exponent. If \\spad{sqf=true} the polynomial is assumed to be square free (\\spadignore{i.e.} without repeated factors). \\spad{pd} is the \\spadtype{Set} of possible degrees. \\spad{r} is a lower bound for the number of factors of \\spad{p}. Please do not use this function in your code because its design may change.")) (|henselFact| (((|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|)))))) |#1| (|Boolean|)) "\\spad{henselFact(p,{}sqf)} returns the factorization of \\spad{p},{} the result is a Record such that \\spad{contp=}content \\spad{p},{} \\spad{factors=}List of irreducible factors of \\spad{p} with exponent. If \\spad{sqf=true} the polynomial is assumed to be square free (\\spadignore{i.e.} without repeated factors).")) (|factorOfDegree| (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|) (|Boolean|)) "\\spad{factorOfDegree(d,{}p,{}listOfDegrees,{}r,{}sqf)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees},{} and that \\spad{p} has at least \\spad{r} factors. If \\spad{sqf=true} the polynomial is assumed to be square free (\\spadignore{i.e.} without repeated factors).") (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{factorOfDegree(d,{}p,{}listOfDegrees,{}r)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees},{} and that \\spad{p} has at least \\spad{r} factors.") (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|List| (|NonNegativeInteger|))) "\\spad{factorOfDegree(d,{}p,{}listOfDegrees)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees}.") (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|NonNegativeInteger|)) "\\spad{factorOfDegree(d,{}p,{}r)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has at least \\spad{r} factors.") (((|Union| |#1| "failed") (|PositiveInteger|) |#1|) "\\spad{factorOfDegree(d,{}p)} returns a factor of \\spad{p} of degree \\spad{d}.")) (|factorSquareFree| (((|Factored| |#1|) |#1| (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{factorSquareFree(p,{}d,{}r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{d} divides the degree of all factors of \\spad{p} and that \\spad{p} has at least \\spad{r} factors. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{factorSquareFree(p,{}listOfDegrees,{}r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees} and that \\spad{p} has at least \\spad{r} factors. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|))) "\\spad{factorSquareFree(p,{}listOfDegrees)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees}. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1| (|NonNegativeInteger|)) "\\spad{factorSquareFree(p,{}r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has at least \\spad{r} factors. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1|) "\\spad{factorSquareFree(p)} returns the factorization of \\spad{p} which is supposed not having any repeated factor (this is not checked).")) (|factor| (((|Factored| |#1|) |#1| (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{factor(p,{}d,{}r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{d} divides the degree of all factors of \\spad{p} and that \\spad{p} has at least \\spad{r} factors.") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{factor(p,{}listOfDegrees,{}r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees} and that \\spad{p} has at least \\spad{r} factors.") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|))) "\\spad{factor(p,{}listOfDegrees)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees}.") (((|Factored| |#1|) |#1| (|NonNegativeInteger|)) "\\spad{factor(p,{}r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has at least \\spad{r} factors.") (((|Factored| |#1|) |#1|) "\\spad{factor(p)} returns the factorization of \\spad{p} over the integers.")) (|tryFunctionalDecomposition| (((|Boolean|) (|Boolean|)) "\\spad{tryFunctionalDecomposition(b)} chooses whether factorizers have to look for functional decomposition of polynomials (\\spad{true}) or not (\\spad{false}). Returns the previous value.")) (|tryFunctionalDecomposition?| (((|Boolean|)) "\\spad{tryFunctionalDecomposition?()} returns \\spad{true} if factorizers try functional decomposition of polynomials before factoring them.")) (|eisensteinIrreducible?| (((|Boolean|) |#1|) "\\spad{eisensteinIrreducible?(p)} returns \\spad{true} if \\spad{p} can be shown to be irreducible by Eisenstein\\spad{'s} criterion,{} \\spad{false} is inconclusive.")) (|useEisensteinCriterion| (((|Boolean|) (|Boolean|)) "\\spad{useEisensteinCriterion(b)} chooses whether factorizers check Eisenstein\\spad{'s} criterion before factoring: \\spad{true} for using it,{} \\spad{false} else. Returns the previous value.")) (|useEisensteinCriterion?| (((|Boolean|)) "\\spad{useEisensteinCriterion?()} returns \\spad{true} if factorizers check Eisenstein\\spad{'s} criterion before factoring.")) (|useSingleFactorBound| (((|Boolean|) (|Boolean|)) "\\spad{useSingleFactorBound(b)} chooses the algorithm to be used by the factorizers: \\spad{true} for algorithm with single factor bound,{} \\spad{false} for algorithm with overall bound. Returns the previous value.")) (|useSingleFactorBound?| (((|Boolean|)) "\\spad{useSingleFactorBound?()} returns \\spad{true} if algorithm with single factor bound is used for factorization,{} \\spad{false} for algorithm with overall bound.")) (|modularFactor| (((|Record| (|:| |prime| (|Integer|)) (|:| |factors| (|List| |#1|))) |#1|) "\\spad{modularFactor(f)} chooses a \"good\" prime and returns the factorization of \\spad{f} modulo this prime in a form that may be used by \\spadfunFrom{completeHensel}{GeneralHenselPackage}. If prime is zero it means that \\spad{f} has been proved to be irreducible over the integers or that \\spad{f} is a unit (\\spadignore{i.e.} 1 or \\spad{-1}). \\spad{f} shall be primitive (\\spadignore{i.e.} content(\\spad{p})\\spad{=1}) and square free (\\spadignore{i.e.} without repeated factors).")) (|numberOfFactors| (((|NonNegativeInteger|) (|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|))))) "\\spad{numberOfFactors(ddfactorization)} returns the number of factors of the polynomial \\spad{f} modulo \\spad{p} where \\spad{ddfactorization} is the distinct degree factorization of \\spad{f} computed by \\spadfunFrom{ddFact}{ModularDistinctDegreeFactorizer} for some prime \\spad{p}.")) (|stopMusserTrials| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{stopMusserTrials(n)} sets to \\spad{n} the bound on the number of factors for which \\spadfun{modularFactor} stops to look for an other prime. You will have to remember that the step of recombining the extraneous factors may take up to \\spad{2**n} trials. Returns the previous value.") (((|PositiveInteger|)) "\\spad{stopMusserTrials()} returns the bound on the number of factors for which \\spadfun{modularFactor} stops to look for an other prime. You will have to remember that the step of recombining the extraneous factors may take up to \\spad{2**stopMusserTrials()} trials.")) (|musserTrials| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{musserTrials(n)} sets to \\spad{n} the number of primes to be tried in \\spadfun{modularFactor} and returns the previous value.") (((|PositiveInteger|)) "\\spad{musserTrials()} returns the number of primes that are tried in \\spadfun{modularFactor}.")) (|degreePartition| (((|Multiset| (|NonNegativeInteger|)) (|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|))))) "\\spad{degreePartition(ddfactorization)} returns the degree partition of the polynomial \\spad{f} modulo \\spad{p} where \\spad{ddfactorization} is the distinct degree factorization of \\spad{f} computed by \\spadfunFrom{ddFact}{ModularDistinctDegreeFactorizer} for some prime \\spad{p}.")) (|makeFR| (((|Factored| |#1|) (|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|))))))) "\\spad{makeFR(flist)} turns the final factorization of henselFact into a \\spadtype{Factored} object."))) NIL NIL -(-436 R UP -3219) +(-436 R UP -3105) ((|constructor| (NIL "\\spadtype{GaloisGroupFactorizationUtilities} provides functions that will be used by the factorizer.")) (|length| ((|#3| |#2|) "\\spad{length(p)} returns the sum of the absolute values of the coefficients of the polynomial \\spad{p}.")) (|height| ((|#3| |#2|) "\\spad{height(p)} returns the maximal absolute value of the coefficients of the polynomial \\spad{p}.")) (|infinityNorm| ((|#3| |#2|) "\\spad{infinityNorm(f)} returns the maximal absolute value of the coefficients of the polynomial \\spad{f}.")) (|quadraticNorm| ((|#3| |#2|) "\\spad{quadraticNorm(f)} returns the \\spad{l2} norm of the polynomial \\spad{f}.")) (|norm| ((|#3| |#2| (|PositiveInteger|)) "\\spad{norm(f,{}p)} returns the \\spad{lp} norm of the polynomial \\spad{f}.")) (|singleFactorBound| (((|Integer|) |#2|) "\\spad{singleFactorBound(p,{}r)} returns a bound on the infinite norm of the factor of \\spad{p} with smallest Bombieri\\spad{'s} norm. \\spad{p} shall be of degree higher or equal to 2.") (((|Integer|) |#2| (|NonNegativeInteger|)) "\\spad{singleFactorBound(p,{}r)} returns a bound on the infinite norm of the factor of \\spad{p} with smallest Bombieri\\spad{'s} norm. \\spad{r} is a lower bound for the number of factors of \\spad{p}. \\spad{p} shall be of degree higher or equal to 2.")) (|rootBound| (((|Integer|) |#2|) "\\spad{rootBound(p)} returns a bound on the largest norm of the complex roots of \\spad{p}.")) (|bombieriNorm| ((|#3| |#2| (|PositiveInteger|)) "\\spad{bombieriNorm(p,{}n)} returns the \\spad{n}th Bombieri\\spad{'s} norm of \\spad{p}.") ((|#3| |#2|) "\\spad{bombieriNorm(p)} returns quadratic Bombieri\\spad{'s} norm of \\spad{p}.")) (|beauzamyBound| (((|Integer|) |#2|) "\\spad{beauzamyBound(p)} returns a bound on the larger coefficient of any factor of \\spad{p}."))) NIL NIL @@ -1719,7 +1719,7 @@ NIL (-447 |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"))) (((-4371 "*") |has| |#2| (-169)) (-4362 |has| |#2| (-545)) (-4367 |has| |#2| (-6 -4367)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#2| (QUOTE (-891))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-169))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-545)))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#2| (QUOTE (-833))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasAttribute| |#2| (QUOTE -4367)) (|HasCategory| |#2| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-142))))) +((|HasCategory| |#2| (QUOTE (-891))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-169))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-545)))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#2| (QUOTE (-833))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357))) (|HasAttribute| |#2| (QUOTE -4367)) (|HasCategory| |#2| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-142))))) (-448 R BP) ((|constructor| (NIL "\\indented{1}{Author : \\spad{P}.Gianni.} January 1990 The equation \\spad{Af+Bg=h} and its generalization to \\spad{n} polynomials is solved for solutions over the \\spad{R},{} euclidean domain. A table containing the solutions of \\spad{Af+Bg=x**k} is used. The operations are performed modulus a prime which are in principle big enough,{} but the solutions are tested and,{} in case of failure,{} a hensel lifting process is used to get to the right solutions. It will be used in the factorization of multivariate polynomials over finite field,{} with \\spad{R=F[x]}.")) (|testModulus| (((|Boolean|) |#1| (|List| |#2|)) "\\spad{testModulus(p,{}lp)} returns \\spad{true} if the the prime \\spad{p} is valid for the list of polynomials \\spad{lp},{} \\spadignore{i.e.} preserves the degree and they remain relatively prime.")) (|solveid| (((|Union| (|List| |#2|) "failed") |#2| |#1| (|Vector| (|List| |#2|))) "\\spad{solveid(h,{}table)} computes the coefficients of the extended euclidean algorithm for a list of polynomials whose tablePow is \\spad{table} and with right side \\spad{h}.")) (|tablePow| (((|Union| (|Vector| (|List| |#2|)) "failed") (|NonNegativeInteger|) |#1| (|List| |#2|)) "\\spad{tablePow(maxdeg,{}prime,{}lpol)} constructs the table with the coefficients of the Extended Euclidean Algorithm for \\spad{lpol}. Here the right side is \\spad{x**k},{} for \\spad{k} less or equal to \\spad{maxdeg}. The operation returns \"failed\" when the elements are not coprime modulo \\spad{prime}.")) (|compBound| (((|NonNegativeInteger|) |#2| (|List| |#2|)) "\\spad{compBound(p,{}lp)} computes a bound for the coefficients of the solution polynomials. Given a polynomial right hand side \\spad{p},{} and a list \\spad{lp} of left hand side polynomials. Exported because it depends on the valuation.")) (|reduction| ((|#2| |#2| |#1|) "\\spad{reduction(p,{}prime)} reduces the polynomial \\spad{p} modulo \\spad{prime} of \\spad{R}. Note: this function is exported only because it\\spad{'s} conditional."))) NIL @@ -1784,7 +1784,7 @@ NIL ((|constructor| (NIL "GradedModule(\\spad{R},{}\\spad{E}) denotes ``E-graded \\spad{R}-module\\spad{''},{} \\spadignore{i.e.} collection of \\spad{R}-modules indexed by an abelian monoid \\spad{E}. An element \\spad{g} of \\spad{G[s]} for some specific \\spad{s} in \\spad{E} is said to be an element of \\spad{G} with {\\em degree} \\spad{s}. Sums are defined in each module \\spad{G[s]} so two elements of \\spad{G} have a sum if they have the same degree. \\blankline Morphisms can be defined and composed by degree to give the mathematical category of graded modules.")) (+ (($ $ $) "\\spad{g+h} is the sum of \\spad{g} and \\spad{h} in the module of elements of the same degree as \\spad{g} and \\spad{h}. Error: if \\spad{g} and \\spad{h} have different degrees.")) (- (($ $ $) "\\spad{g-h} is the difference of \\spad{g} and \\spad{h} in the module of elements of the same degree as \\spad{g} and \\spad{h}. Error: if \\spad{g} and \\spad{h} have different degrees.") (($ $) "\\spad{-g} is the additive inverse of \\spad{g} in the module of elements of the same grade as \\spad{g}.")) (* (($ $ |#1|) "\\spad{g*r} is right module multiplication.") (($ |#1| $) "\\spad{r*g} is left module multiplication.")) ((|Zero|) (($) "0 denotes the zero of degree 0.")) (|degree| ((|#2| $) "\\spad{degree(g)} names the degree of \\spad{g}. The set of all elements of a given degree form an \\spad{R}-module."))) NIL NIL -(-464 |lv| -3219 R) +(-464 |lv| -3105 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 @@ -1799,11 +1799,11 @@ NIL (-467 |Coef| |var| |cen|) ((|constructor| (NIL "This is a category of univariate Puiseux series constructed from univariate Laurent series. A Puiseux series is represented by a pair \\spad{[r,{}f(x)]},{} where \\spad{r} is a positive rational number and \\spad{f(x)} is a Laurent series. This pair represents the Puiseux series \\spad{f(x\\^r)}.")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|coerce| (($ (|UnivariatePuiseuxSeries| |#1| |#2| |#3|)) "\\spad{coerce(f)} converts a Puiseux series to a general power series.") (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Puiseux series."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|)))) (|HasCategory| (-401 (-553)) (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-357))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasSignature| |#1| (LIST (QUOTE -3212) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (-4028 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -1619) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3611) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|)))) (|HasCategory| (-401 (-553)) (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-357))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasSignature| |#1| (LIST (QUOTE -3110) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (-3988 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3406) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3506) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|))))))) (-468 |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."))) ((-4370 . T)) -((-12 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2669) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3359) (|devaluate| |#2|)))))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-833))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2578) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3256) (|devaluate| |#2|)))))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-833))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079)))) (-469 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)}"))) ((-4370 . T) (-4369 . T)) @@ -1819,7 +1819,7 @@ NIL (-472 |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."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2669) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3359) (|devaluate| |#2|)))))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-1079))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2578) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3256) (|devaluate| |#2|)))))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-1079))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845))))) (-473) ((|constructor| (NIL "\\indented{1}{Author : Larry Lambe} Date Created : August 1988 Date Last Updated : March 9 1990 Related Constructors: OrderedSetInts,{} Commutator,{} FreeNilpotentLie AMS Classification: Primary 17B05,{} 17B30; Secondary 17A50 Keywords: free Lie algebra,{} Hall basis,{} basic commutators Description : Generate a basis for the free Lie algebra on \\spad{n} generators over a ring \\spad{R} with identity up to basic commutators of length \\spad{c} using the algorithm of \\spad{P}. Hall as given in Serre\\spad{'s} book Lie Groups \\spad{--} Lie Algebras")) (|generate| (((|Vector| (|List| (|Integer|))) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{generate(numberOfGens,{} maximalWeight)} generates a vector of elements of the form [left,{}weight,{}right] which represents a \\spad{P}. Hall basis element for the free lie algebra on \\spad{numberOfGens} generators. We only generate those basis elements of weight less than or equal to maximalWeight")) (|inHallBasis?| (((|Boolean|) (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{inHallBasis?(numberOfGens,{} leftCandidate,{} rightCandidate,{} left)} tests to see if a new element should be added to the \\spad{P}. Hall basis being constructed. The list \\spad{[leftCandidate,{}wt,{}rightCandidate]} is included in the basis if in the unique factorization of \\spad{rightCandidate},{} we have left factor leftOfRight,{} and leftOfRight \\spad{<=} \\spad{leftCandidate}")) (|lfunc| (((|Integer|) (|Integer|) (|Integer|)) "\\spad{lfunc(d,{}n)} computes the rank of the \\spad{n}th factor in the lower central series of the free \\spad{d}-generated free Lie algebra; This rank is \\spad{d} if \\spad{n} = 1 and binom(\\spad{d},{}2) if \\spad{n} = 2"))) NIL @@ -1827,11 +1827,11 @@ NIL (-474 |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"))) (((-4371 "*") |has| |#2| (-169)) (-4362 |has| |#2| (-545)) (-4367 |has| |#2| (-6 -4367)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#2| (QUOTE (-891))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-169))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-545)))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#2| (QUOTE (-833))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasAttribute| |#2| (QUOTE -4367)) (|HasCategory| |#2| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-142))))) -(-475 -2073 S) +((|HasCategory| |#2| (QUOTE (-891))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-169))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-545)))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#2| (QUOTE (-833))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357))) (|HasAttribute| |#2| (QUOTE -4367)) (|HasCategory| |#2| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-142))))) +(-475 -2026 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}."))) ((-4363 |has| |#2| (-1031)) (-4364 |has| |#2| (-1031)) (-4366 |has| |#2| (-6 -4366)) ((-4371 "*") |has| |#2| (-169)) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))))) (-4028 (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079)))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (QUOTE (-357))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-357)))) (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (QUOTE (-779))) (-4028 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-831)))) (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-169))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-1031)))) (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (QUOTE (-1079)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-129)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-169)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-228)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-362)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-712)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-779)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-831)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079))))) (-4028 (-12 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| (-553) (QUOTE (-833))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-4028 (|HasCategory| |#2| (QUOTE (-1031))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079)))) (|HasAttribute| |#2| (QUOTE -4366)) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-25))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))))) (-3988 (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079)))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (QUOTE (-357))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-357)))) (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (QUOTE (-779))) (-3988 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-831)))) (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-169))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-1031)))) (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (QUOTE (-1079)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-129)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-169)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-228)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-362)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-712)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-779)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-831)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079))))) (-3988 (-12 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1031))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-3988 (-12 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| (-553) (QUOTE (-833))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-3988 (|HasCategory| |#2| (QUOTE (-1031))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079)))) (|HasAttribute| |#2| (QUOTE -4366)) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))))) (-476) ((|constructor| (NIL "This domain represents the header of a definition.")) (|parameters| (((|List| (|Identifier|)) $) "\\spad{parameters(h)} gives the parameters specified in the definition header \\spad{`h'}.")) (|name| (((|Identifier|) $) "\\spad{name(h)} returns the name of the operation defined defined.")) (|headAst| (($ (|Identifier|) (|List| (|Identifier|))) "\\spad{headAst(f,{}[x1,{}..,{}xn])} constructs a function definition header."))) NIL @@ -1839,8 +1839,8 @@ NIL (-477 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}."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) -(-478 -3219 UP UPUP R) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +(-478 -3105 UP UPUP R) ((|constructor| (NIL "This domains implements finite rational divisors on an hyperelliptic curve,{} that is finite formal sums SUM(\\spad{n} * \\spad{P}) where the \\spad{n}\\spad{'s} are integers and the \\spad{P}\\spad{'s} are finite rational points on the curve. The equation of the curve must be \\spad{y^2} = \\spad{f}(\\spad{x}) and \\spad{f} must have odd degree."))) NIL NIL @@ -1849,16 +1849,16 @@ NIL NIL NIL (-480) -((|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.")) (|coerce| (((|RadixExpansion| 16) $) "\\spad{coerce(h)} converts a hexadecimal expansion to a radix expansion with base 16.") (((|Fraction| (|Integer|)) $) "\\spad{coerce(h)} converts a hexadecimal expansion to a rational number."))) +((|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."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| (-553) (QUOTE (-891))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| (-553) (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-144))) (|HasCategory| (-553) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-553) (QUOTE (-1004))) (|HasCategory| (-553) (QUOTE (-806))) (-4028 (|HasCategory| (-553) (QUOTE (-806))) (|HasCategory| (-553) (QUOTE (-833)))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-1130))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-553) (QUOTE (-228))) (|HasCategory| (-553) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-553) (LIST (QUOTE -507) (QUOTE (-1155)) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -303) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -280) (QUOTE (-553)) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-301))) (|HasCategory| (-553) (QUOTE (-538))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-553) (LIST (QUOTE -626) (QUOTE (-553)))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (|HasCategory| (-553) (QUOTE (-142))))) +((|HasCategory| (-553) (QUOTE (-891))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| (-553) (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-144))) (|HasCategory| (-553) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-553) (QUOTE (-1004))) (|HasCategory| (-553) (QUOTE (-806))) (-3988 (|HasCategory| (-553) (QUOTE (-806))) (|HasCategory| (-553) (QUOTE (-833)))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-1130))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-553) (QUOTE (-228))) (|HasCategory| (-553) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-553) (LIST (QUOTE -507) (QUOTE (-1155)) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -303) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -280) (QUOTE (-553)) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-301))) (|HasCategory| (-553) (QUOTE (-538))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-553) (LIST (QUOTE -626) (QUOTE (-553)))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (|HasCategory| (-553) (QUOTE (-142))))) (-481 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 -4369)) (|HasAttribute| |#1| (QUOTE -4370)) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (-482 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}]}."))) -((-4284 . T)) +NIL NIL (-483 S) ((|constructor| (NIL "A is homotopic to \\spad{B} iff any element of domain \\spad{B} can be automically converted into an element of domain \\spad{B},{} and nay element of domain \\spad{B} can be automatically converted into an A."))) @@ -1876,7 +1876,7 @@ NIL ((|constructor| (NIL "Category for the hyperbolic trigonometric functions.")) (|tanh| (($ $) "\\spad{tanh(x)} returns the hyperbolic tangent of \\spad{x}.")) (|sinh| (($ $) "\\spad{sinh(x)} returns the hyperbolic sine of \\spad{x}.")) (|sech| (($ $) "\\spad{sech(x)} returns the hyperbolic secant of \\spad{x}.")) (|csch| (($ $) "\\spad{csch(x)} returns the hyperbolic cosecant of \\spad{x}.")) (|coth| (($ $) "\\spad{coth(x)} returns the hyperbolic cotangent of \\spad{x}.")) (|cosh| (($ $) "\\spad{cosh(x)} returns the hyperbolic cosine of \\spad{x}."))) NIL NIL -(-487 -3219 UP |AlExt| |AlPol|) +(-487 -3105 UP |AlExt| |AlPol|) ((|constructor| (NIL "Factorization of univariate polynomials with coefficients in an algebraic extension of a field over which we can factor UP\\spad{'s}.")) (|factor| (((|Factored| |#4|) |#4| (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{factor(p,{} f)} returns a prime factorisation of \\spad{p}; \\spad{f} is a factorisation map for elements of UP."))) NIL NIL @@ -1887,16 +1887,16 @@ NIL (-489 S |mn|) ((|constructor| (NIL "\\indented{1}{Author Micheal Monagan Aug/87} This is the basic one dimensional array data type."))) ((-4370 . T) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-4028 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-490 R |mnRow| |mnCol|) ((|constructor| (NIL "\\indented{1}{An IndexedTwoDimensionalArray is a 2-dimensional array where} the minimal row and column indices are parameters of the type. Rows and columns are returned as IndexedOneDimensionalArray\\spad{'s} with minimal indices matching those of the IndexedTwoDimensionalArray. The index of the 'first' row may be obtained by calling the function 'minRowIndex'. The index of the 'first' column may be obtained by calling the function 'minColIndex'. The index of the first element of a 'Row' is the same as the index of the first column in an array and vice versa."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-491 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 -(-492 R UP -3219) +(-492 R UP -3105) ((|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{\\spad{mi}} is represented as follows: \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,{}w2,{}...,{}wn} and \\spad{\\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{\\spad{mi}} is given by \\spad{\\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{\\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{\\spad{wi} = sum(bij * vj,{} j = 1..n)}.")) (|idealiserMatrix| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{idealiserMatrix(m1,{} m2)} returns the matrix representing the linear conditions on the Ring associatied with an ideal defined by \\spad{m1} and \\spad{m2}.")) (|idealiser| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) |#1|) "\\spad{idealiser(m1,{}m2,{}d)} computes the order of an ideal defined by \\spad{m1} and \\spad{m2} where \\spad{d} is the known part of the denominator") (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{idealiser(m1,{}m2)} computes the order of an ideal defined by \\spad{m1} and \\spad{m2}")) (|leastPower| (((|NonNegativeInteger|) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{leastPower(p,{}n)} returns \\spad{e},{} where \\spad{e} is the smallest integer such that \\spad{p **e >= n}")) (|divideIfCan!| ((|#1| (|Matrix| |#1|) (|Matrix| |#1|) |#1| (|Integer|)) "\\spad{divideIfCan!(matrix,{}matrixOut,{}prime,{}n)} attempts to divide the entries of \\spad{matrix} by \\spad{prime} and store the result in \\spad{matrixOut}. If it is successful,{} 1 is returned and if not,{} \\spad{prime} is returned. Here both \\spad{matrix} and \\spad{matrixOut} are \\spad{n}-by-\\spad{n} upper triangular matrices.")) (|matrixGcd| ((|#1| (|Matrix| |#1|) |#1| (|NonNegativeInteger|)) "\\spad{matrixGcd(mat,{}sing,{}n)} is \\spad{gcd(sing,{}g)} where \\spad{g} is the \\spad{gcd} of the entries of the \\spad{n}-by-\\spad{n} upper-triangular matrix \\spad{mat}.")) (|diagonalProduct| ((|#1| (|Matrix| |#1|)) "\\spad{diagonalProduct(m)} returns the product of the elements on the diagonal of the matrix \\spad{m}")) (|squareFree| (((|Factored| $) $) "\\spad{squareFree(x)} returns a square-free factorisation of \\spad{x}"))) NIL NIL @@ -1916,7 +1916,7 @@ NIL ((|constructor| (NIL "InnerCommonDenominator provides functions to compute the common denominator of a finite linear aggregate of elements of the quotient field of an integral domain.")) (|splitDenominator| (((|Record| (|:| |num| |#3|) (|:| |den| |#1|)) |#4|) "\\spad{splitDenominator([q1,{}...,{}qn])} returns \\spad{[[p1,{}...,{}pn],{} d]} such that \\spad{\\spad{qi} = pi/d} and \\spad{d} is a common denominator for the \\spad{qi}\\spad{'s}.")) (|clearDenominator| ((|#3| |#4|) "\\spad{clearDenominator([q1,{}...,{}qn])} returns \\spad{[p1,{}...,{}pn]} such that \\spad{\\spad{qi} = pi/d} where \\spad{d} is a common denominator for the \\spad{qi}\\spad{'s}.")) (|commonDenominator| ((|#1| |#4|) "\\spad{commonDenominator([q1,{}...,{}qn])} returns a common denominator \\spad{d} for \\spad{q1},{}...,{}\\spad{qn}."))) NIL NIL -(-497 -3219 |Expon| |VarSet| |DPoly|) +(-497 -3105 |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 -601) (QUOTE (-1155))))) @@ -1967,7 +1967,7 @@ NIL (-509 S |mn|) ((|constructor| (NIL "\\indented{1}{Author: Michael Monagan July/87,{} modified \\spad{SMW} June/91} A FlexibleArray is the notion of an array intended to allow for growth at the end only. Hence the following efficient operations \\indented{2}{\\spad{append(x,{}a)} meaning append item \\spad{x} at the end of the array \\spad{a}} \\indented{2}{\\spad{delete(a,{}n)} meaning delete the last item from the array \\spad{a}} Flexible arrays support the other operations inherited from \\spadtype{ExtensibleLinearAggregate}. However,{} these are not efficient. Flexible arrays combine the \\spad{O(1)} access time property of arrays with growing and shrinking at the end in \\spad{O(1)} (average) time. This is done by using an ordinary array which may have zero or more empty slots at the end. When the array becomes full it is copied into a new larger (50\\% larger) array. Conversely,{} when the array becomes less than 1/2 full,{} it is copied into a smaller array. Flexible arrays provide for an efficient implementation of many data structures in particular heaps,{} stacks and sets.")) (|shrinkable| (((|Boolean|) (|Boolean|)) "\\spad{shrinkable(b)} sets the shrinkable attribute of flexible arrays to \\spad{b} and returns the previous value")) (|physicalLength!| (($ $ (|Integer|)) "\\spad{physicalLength!(x,{}n)} changes the physical length of \\spad{x} to be \\spad{n} and returns the new array.")) (|physicalLength| (((|NonNegativeInteger|) $) "\\spad{physicalLength(x)} returns the number of elements \\spad{x} can accomodate before growing")) (|flexibleArray| (($ (|List| |#1|)) "\\spad{flexibleArray(l)} creates a flexible array from the list of elements \\spad{l}"))) ((-4370 . T) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-4028 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-510) ((|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 @@ -1975,15 +1975,15 @@ NIL (-511 |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}."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((-4028 (|HasCategory| (-570 |#1|) (QUOTE (-142))) (|HasCategory| (-570 |#1|) (QUOTE (-362)))) (|HasCategory| (-570 |#1|) (QUOTE (-144))) (|HasCategory| (-570 |#1|) (QUOTE (-362))) (|HasCategory| (-570 |#1|) (QUOTE (-142)))) +((-3988 (|HasCategory| (-570 |#1|) (QUOTE (-142))) (|HasCategory| (-570 |#1|) (QUOTE (-362)))) (|HasCategory| (-570 |#1|) (QUOTE (-144))) (|HasCategory| (-570 |#1|) (QUOTE (-362))) (|HasCategory| (-570 |#1|) (QUOTE (-142)))) (-512 R |mnRow| |mnCol| |Row| |Col|) ((|constructor| (NIL "\\indented{1}{This is an internal type which provides an implementation of} 2-dimensional arrays as PrimitiveArray\\spad{'s} of PrimitiveArray\\spad{'s}."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-513 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."))) ((-4370 . T) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-4028 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-514 R |Row| |Col| M) ((|constructor| (NIL "\\spadtype{InnerMatrixLinearAlgebraFunctions} is an internal package which provides standard linear algebra functions on domains in \\spad{MatrixCategory}")) (|inverse| (((|Union| |#4| "failed") |#4|) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m}. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|generalizedInverse| ((|#4| |#4|) "\\spad{generalizedInverse(m)} returns the generalized (Moore--Penrose) inverse of the matrix \\spad{m},{} \\spadignore{i.e.} the matrix \\spad{h} such that m*h*m=h,{} h*m*h=m,{} \\spad{m*h} and \\spad{h*m} are both symmetric matrices.")) (|determinant| ((|#1| |#4|) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}. an error message is returned if the matrix is not square.")) (|nullSpace| (((|List| |#3|) |#4|) "\\spad{nullSpace(m)} returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) |#4|) "\\spad{nullity(m)} returns the mullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) |#4|) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|rowEchelon| ((|#4| |#4|) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}."))) NIL @@ -1995,7 +1995,7 @@ NIL (-516 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."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-545))) (|HasAttribute| |#1| (QUOTE (-4371 "*"))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-545))) (|HasAttribute| |#1| (QUOTE (-4371 "*"))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-517) ((|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 @@ -2028,7 +2028,7 @@ NIL ((|constructor| (NIL "\\indented{2}{IndexedExponents of an ordered set of variables gives a representation} for the degree of polynomials in commuting variables. It gives an ordered pairing of non negative integer exponents with variables"))) NIL NIL -(-525 K -3219 |Par|) +(-525 K -3105 |Par|) ((|constructor| (NIL "This package is the inner package to be used by NumericRealEigenPackage and NumericComplexEigenPackage for the computation of numeric eigenvalues and eigenvectors.")) (|innerEigenvectors| (((|List| (|Record| (|:| |outval| |#2|) (|:| |outmult| (|Integer|)) (|:| |outvect| (|List| (|Matrix| |#2|))))) (|Matrix| |#1|) |#3| (|Mapping| (|Factored| (|SparseUnivariatePolynomial| |#1|)) (|SparseUnivariatePolynomial| |#1|))) "\\spad{innerEigenvectors(m,{}eps,{}factor)} computes explicitly the eigenvalues and the correspondent eigenvectors of the matrix \\spad{m}. The parameter \\spad{eps} determines the type of the output,{} \\spad{factor} is the univariate factorizer to \\spad{br} used to reduce the characteristic polynomial into irreducible factors.")) (|solve1| (((|List| |#2|) (|SparseUnivariatePolynomial| |#1|) |#3|) "\\spad{solve1(pol,{} eps)} finds the roots of the univariate polynomial polynomial \\spad{pol} to precision eps. If \\spad{K} is \\spad{Fraction Integer} then only the real roots are returned,{} if \\spad{K} is \\spad{Complex Fraction Integer} then all roots are found.")) (|charpol| (((|SparseUnivariatePolynomial| |#1|) (|Matrix| |#1|)) "\\spad{charpol(m)} computes the characteristic polynomial of a matrix \\spad{m} with entries in \\spad{K}. This function returns a polynomial over \\spad{K},{} while the general one (that is in EiegenPackage) returns Fraction \\spad{P} \\spad{K}"))) NIL NIL @@ -2052,7 +2052,7 @@ NIL ((|constructor| (NIL "This package computes infinite products of univariate Taylor series over an integral domain of characteristic 0.")) (|generalInfiniteProduct| ((|#2| |#2| (|Integer|) (|Integer|)) "\\spad{generalInfiniteProduct(f(x),{}a,{}d)} computes \\spad{product(n=a,{}a+d,{}a+2*d,{}...,{}f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1.")) (|oddInfiniteProduct| ((|#2| |#2|) "\\spad{oddInfiniteProduct(f(x))} computes \\spad{product(n=1,{}3,{}5...,{}f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1.")) (|evenInfiniteProduct| ((|#2| |#2|) "\\spad{evenInfiniteProduct(f(x))} computes \\spad{product(n=2,{}4,{}6...,{}f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1.")) (|infiniteProduct| ((|#2| |#2|) "\\spad{infiniteProduct(f(x))} computes \\spad{product(n=1,{}2,{}3...,{}f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1."))) NIL NIL -(-531 K -3219 |Par|) +(-531 K -3105 |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 @@ -2087,12 +2087,12 @@ NIL (-539 |Key| |Entry| |addDom|) ((|constructor| (NIL "This domain is used to provide a conditional \"add\" domain for the implementation of \\spadtype{Table}."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2669) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3359) (|devaluate| |#2|)))))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-1079))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845))))) -(-540 R -3219) +((-12 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2578) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3256) (|devaluate| |#2|)))))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-1079))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845))))) +(-540 R -3105) ((|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 -(-541 R0 -3219 UP UPUP R) +(-541 R0 -3105 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 @@ -2102,7 +2102,7 @@ NIL NIL (-543 R) ((|constructor| (NIL "\\indented{1}{+ Author: Mike Dewar} + Date Created: November 1996 + Date Last Updated: + Basic Functions: + Related Constructors: + Also See: + AMS Classifications: + Keywords: + References: + Description: + This category implements of interval arithmetic and transcendental + functions over intervals.")) (|contains?| (((|Boolean|) $ |#1|) "\\spad{contains?(i,{}f)} returns \\spad{true} if \\axiom{\\spad{f}} is contained within the interval \\axiom{\\spad{i}},{} \\spad{false} otherwise.")) (|negative?| (((|Boolean|) $) "\\spad{negative?(u)} returns \\axiom{\\spad{true}} if every element of \\spad{u} is negative,{} \\axiom{\\spad{false}} otherwise.")) (|positive?| (((|Boolean|) $) "\\spad{positive?(u)} returns \\axiom{\\spad{true}} if every element of \\spad{u} is positive,{} \\axiom{\\spad{false}} otherwise.")) (|width| ((|#1| $) "\\spad{width(u)} returns \\axiom{sup(\\spad{u}) - inf(\\spad{u})}.")) (|sup| ((|#1| $) "\\spad{sup(u)} returns the supremum of \\axiom{\\spad{u}}.")) (|inf| ((|#1| $) "\\spad{inf(u)} returns the infinum of \\axiom{\\spad{u}}.")) (|qinterval| (($ |#1| |#1|) "\\spad{qinterval(inf,{}sup)} creates a new interval \\axiom{[\\spad{inf},{}\\spad{sup}]},{} without checking the ordering on the elements.")) (|interval| (($ (|Fraction| (|Integer|))) "\\spad{interval(f)} creates a new interval around \\spad{f}.") (($ |#1|) "\\spad{interval(f)} creates a new interval around \\spad{f}.") (($ |#1| |#1|) "\\spad{interval(inf,{}sup)} creates a new interval,{} either \\axiom{[\\spad{inf},{}\\spad{sup}]} if \\axiom{\\spad{inf} \\spad{<=} \\spad{sup}} or \\axiom{[\\spad{sup},{}in]} otherwise."))) -((-4312 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) +((-4327 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-544 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."))) @@ -2112,7 +2112,7 @@ NIL ((|constructor| (NIL "The category of commutative integral domains,{} \\spadignore{i.e.} commutative rings with no zero divisors. \\blankline Conditional attributes: \\indented{2}{canonicalUnitNormal\\tab{20}the canonical field is the same for all associates} \\indented{2}{canonicalsClosed\\tab{20}the product of two canonicals is itself canonical}")) (|unit?| (((|Boolean|) $) "\\spad{unit?(x)} tests whether \\spad{x} is a unit,{} \\spadignore{i.e.} is invertible.")) (|associates?| (((|Boolean|) $ $) "\\spad{associates?(x,{}y)} tests whether \\spad{x} and \\spad{y} are associates,{} \\spadignore{i.e.} differ by a unit factor.")) (|unitCanonical| (($ $) "\\spad{unitCanonical(x)} returns \\spad{unitNormal(x).canonical}.")) (|unitNormal| (((|Record| (|:| |unit| $) (|:| |canonical| $) (|:| |associate| $)) $) "\\spad{unitNormal(x)} tries to choose a canonical element from the associate class of \\spad{x}. The attribute canonicalUnitNormal,{} if asserted,{} means that the \"canonical\" element is the same across all associates of \\spad{x} if \\spad{unitNormal(x) = [u,{}c,{}a]} then \\spad{u*c = x},{} \\spad{a*u = 1}.")) (|exquo| (((|Union| $ "failed") $ $) "\\spad{exquo(a,{}b)} either returns an element \\spad{c} such that \\spad{c*b=a} or \"failed\" if no such element can be found."))) ((-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL -(-546 R -3219) +(-546 R -3105) ((|constructor| (NIL "This package provides functions for integration,{} limited integration,{} extended integration and the risch differential equation for elemntary functions.")) (|lfextlimint| (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| (|Symbol|) (|Kernel| |#2|) (|List| (|Kernel| |#2|))) "\\spad{lfextlimint(f,{}x,{}k,{}[k1,{}...,{}kn])} returns functions \\spad{[h,{} c]} such that \\spad{dh/dx = f - c dk/dx}. Value \\spad{h} is looked for in a field containing \\spad{f} and \\spad{k1},{}...,{}\\spad{kn} (the \\spad{ki}\\spad{'s} must be logs).")) (|lfintegrate| (((|IntegrationResult| |#2|) |#2| (|Symbol|)) "\\spad{lfintegrate(f,{} x)} = \\spad{g} such that \\spad{dg/dx = f}.")) (|lfinfieldint| (((|Union| |#2| "failed") |#2| (|Symbol|)) "\\spad{lfinfieldint(f,{} x)} returns a function \\spad{g} such that \\spad{dg/dx = f} if \\spad{g} exists,{} \"failed\" otherwise.")) (|lflimitedint| (((|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|Symbol|) (|List| |#2|)) "\\spad{lflimitedint(f,{}x,{}[g1,{}...,{}gn])} returns functions \\spad{[h,{}[[\\spad{ci},{} \\spad{gi}]]]} such that the \\spad{gi}\\spad{'s} are among \\spad{[g1,{}...,{}gn]},{} and \\spad{d(h+sum(\\spad{ci} log(\\spad{gi})))/dx = f},{} if possible,{} \"failed\" otherwise.")) (|lfextendedint| (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| (|Symbol|) |#2|) "\\spad{lfextendedint(f,{} x,{} g)} returns functions \\spad{[h,{} c]} such that \\spad{dh/dx = f - cg},{} if (\\spad{h},{} \\spad{c}) exist,{} \"failed\" otherwise."))) NIL NIL @@ -2124,7 +2124,7 @@ NIL ((|constructor| (NIL "\\blankline")) (|entry| (((|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| "Continuous at the end points") (|:| |lowerSingular| "There is a singularity at the lower end point") (|:| |upperSingular| "There is a singularity at the upper end point") (|:| |bothSingular| "There are singularities at both end points") (|:| |notEvaluated| "End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| "Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| "The range is finite") (|:| |lowerInfinite| "The bottom of range is infinite") (|:| |upperInfinite| "The top of range is infinite") (|:| |bothInfinite| "Both top and bottom points are infinite") (|:| |notEvaluated| "Range not yet evaluated")))) (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{entry(n)} \\undocumented{}")) (|entries| (((|List| (|Record| (|:| |key| (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |entry| (|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| "Continuous at the end points") (|:| |lowerSingular| "There is a singularity at the lower end point") (|:| |upperSingular| "There is a singularity at the upper end point") (|:| |bothSingular| "There are singularities at both end points") (|:| |notEvaluated| "End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| "Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| "The range is finite") (|:| |lowerInfinite| "The bottom of range is infinite") (|:| |upperInfinite| "The top of range is infinite") (|:| |bothInfinite| "Both top and bottom points are infinite") (|:| |notEvaluated| "Range not yet evaluated"))))))) $) "\\spad{entries(x)} \\undocumented{}")) (|showAttributes| (((|Union| (|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| "Continuous at the end points") (|:| |lowerSingular| "There is a singularity at the lower end point") (|:| |upperSingular| "There is a singularity at the upper end point") (|:| |bothSingular| "There are singularities at both end points") (|:| |notEvaluated| "End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| "Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| "The range is finite") (|:| |lowerInfinite| "The bottom of range is infinite") (|:| |upperInfinite| "The top of range is infinite") (|:| |bothInfinite| "Both top and bottom points are infinite") (|:| |notEvaluated| "Range not yet evaluated")))) "failed") (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{showAttributes(x)} \\undocumented{}")) (|insert!| (($ (|Record| (|:| |key| (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |entry| (|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| "Continuous at the end points") (|:| |lowerSingular| "There is a singularity at the lower end point") (|:| |upperSingular| "There is a singularity at the upper end point") (|:| |bothSingular| "There are singularities at both end points") (|:| |notEvaluated| "End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| "Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| "The range is finite") (|:| |lowerInfinite| "The bottom of range is infinite") (|:| |upperInfinite| "The top of range is infinite") (|:| |bothInfinite| "Both top and bottom points are infinite") (|:| |notEvaluated| "Range not yet evaluated"))))))) "\\spad{insert!(r)} inserts an entry \\spad{r} into theIFTable")) (|fTable| (($ (|List| (|Record| (|:| |key| (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |entry| (|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| "Continuous at the end points") (|:| |lowerSingular| "There is a singularity at the lower end point") (|:| |upperSingular| "There is a singularity at the upper end point") (|:| |bothSingular| "There are singularities at both end points") (|:| |notEvaluated| "End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| "Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| "The range is finite") (|:| |lowerInfinite| "The bottom of range is infinite") (|:| |upperInfinite| "The top of range is infinite") (|:| |bothInfinite| "Both top and bottom points are infinite") (|:| |notEvaluated| "Range not yet evaluated")))))))) "\\spad{fTable(l)} creates a functions table from the elements of \\spad{l}.")) (|keys| (((|List| (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) $) "\\spad{keys(f)} returns the list of keys of \\spad{f}")) (|clearTheFTable| (((|Void|)) "\\spad{clearTheFTable()} clears the current table of functions.")) (|showTheFTable| (($) "\\spad{showTheFTable()} returns the current table of functions."))) NIL NIL -(-549 R -3219 L) +(-549 R -3105 L) ((|constructor| (NIL "This internal package rationalises integrands on curves of the form: \\indented{2}{\\spad{y\\^2 = a x\\^2 + b x + c}} \\indented{2}{\\spad{y\\^2 = (a x + b) / (c x + d)}} \\indented{2}{\\spad{f(x,{} y) = 0} where \\spad{f} has degree 1 in \\spad{x}} The rationalization is done for integration,{} limited integration,{} extended integration and the risch differential equation.")) (|palgLODE0| (((|Record| (|:| |particular| (|Union| |#2| "failed")) (|:| |basis| (|List| |#2|))) |#3| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Kernel| |#2|) |#2| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) "\\spad{palgLODE0(op,{}g,{}x,{}y,{}z,{}t,{}c)} returns the solution of \\spad{op f = g} Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{f(x,{}y)dx = c f(t,{}y) dy}; \\spad{c} and \\spad{t} are rational functions of \\spad{y}.") (((|Record| (|:| |particular| (|Union| |#2| "failed")) (|:| |basis| (|List| |#2|))) |#3| |#2| (|Kernel| |#2|) (|Kernel| |#2|) |#2| (|SparseUnivariatePolynomial| |#2|)) "\\spad{palgLODE0(op,{} g,{} x,{} y,{} d,{} p)} returns the solution of \\spad{op f = g}. Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{d(x)\\^2y(x)\\^2 = P(x)}.")) (|lift| (((|SparseUnivariatePolynomial| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) (|SparseUnivariatePolynomial| |#2|) (|Kernel| |#2|)) "\\spad{lift(u,{}k)} \\undocumented")) (|multivariate| ((|#2| (|SparseUnivariatePolynomial| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) (|Kernel| |#2|) |#2|) "\\spad{multivariate(u,{}k,{}f)} \\undocumented")) (|univariate| (((|SparseUnivariatePolynomial| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|SparseUnivariatePolynomial| |#2|)) "\\spad{univariate(f,{}k,{}k,{}p)} \\undocumented")) (|palgRDE0| (((|Union| |#2| "failed") |#2| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Mapping| (|Union| |#2| "failed") |#2| |#2| (|Symbol|)) (|Kernel| |#2|) |#2| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) "\\spad{palgRDE0(f,{} g,{} x,{} y,{} foo,{} t,{} c)} returns a function \\spad{z(x,{}y)} such that \\spad{dz/dx + n * df/dx z(x,{}y) = g(x,{}y)} if such a \\spad{z} exists,{} and \"failed\" otherwise. Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{f(x,{}y)dx = c f(t,{}y) dy}; \\spad{c} and \\spad{t} are rational functions of \\spad{y}. Argument \\spad{foo},{} called by \\spad{foo(a,{} b,{} x)},{} is a function that solves \\spad{du/dx + n * da/dx u(x) = u(x)} for an unknown \\spad{u(x)} not involving \\spad{y}.") (((|Union| |#2| "failed") |#2| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Mapping| (|Union| |#2| "failed") |#2| |#2| (|Symbol|)) |#2| (|SparseUnivariatePolynomial| |#2|)) "\\spad{palgRDE0(f,{} g,{} x,{} y,{} foo,{} d,{} p)} returns a function \\spad{z(x,{}y)} such that \\spad{dz/dx + n * df/dx z(x,{}y) = g(x,{}y)} if such a \\spad{z} exists,{} and \"failed\" otherwise. Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{d(x)\\^2y(x)\\^2 = P(x)}. Argument \\spad{foo},{} called by \\spad{foo(a,{} b,{} x)},{} is a function that solves \\spad{du/dx + n * da/dx u(x) = u(x)} for an unknown \\spad{u(x)} not involving \\spad{y}.")) (|palglimint0| (((|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|List| |#2|) (|Kernel| |#2|) |#2| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) "\\spad{palglimint0(f,{} x,{} y,{} [u1,{}...,{}un],{} z,{} t,{} c)} returns functions \\spad{[h,{}[[\\spad{ci},{} \\spad{ui}]]]} such that the \\spad{ui}\\spad{'s} are among \\spad{[u1,{}...,{}un]} and \\spad{d(h + sum(\\spad{ci} log(\\spad{ui})))/dx = f(x,{}y)} if such functions exist,{} and \"failed\" otherwise. Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{f(x,{}y)dx = c f(t,{}y) dy}; \\spad{c} and \\spad{t} are rational functions of \\spad{y}.") (((|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|List| |#2|) |#2| (|SparseUnivariatePolynomial| |#2|)) "\\spad{palglimint0(f,{} x,{} y,{} [u1,{}...,{}un],{} d,{} p)} returns functions \\spad{[h,{}[[\\spad{ci},{} \\spad{ui}]]]} such that the \\spad{ui}\\spad{'s} are among \\spad{[u1,{}...,{}un]} and \\spad{d(h + sum(\\spad{ci} log(\\spad{ui})))/dx = f(x,{}y)} if such functions exist,{} and \"failed\" otherwise. Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{d(x)\\^2y(x)\\^2 = P(x)}.")) (|palgextint0| (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) |#2| (|Kernel| |#2|) |#2| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) "\\spad{palgextint0(f,{} x,{} y,{} g,{} z,{} t,{} c)} returns functions \\spad{[h,{} d]} such that \\spad{dh/dx = f(x,{}y) - d g},{} where \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{f(x,{}y)dx = c f(t,{}y) dy},{} and \\spad{c} and \\spad{t} are rational functions of \\spad{y}. Argument \\spad{z} is a dummy variable not appearing in \\spad{f(x,{}y)}. The operation returns \"failed\" if no such functions exist.") (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) |#2| |#2| (|SparseUnivariatePolynomial| |#2|)) "\\spad{palgextint0(f,{} x,{} y,{} g,{} d,{} p)} returns functions \\spad{[h,{} c]} such that \\spad{dh/dx = f(x,{}y) - c g},{} where \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{d(x)\\^2 y(x)\\^2 = P(x)},{} or \"failed\" if no such functions exist.")) (|palgint0| (((|IntegrationResult| |#2|) |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Kernel| |#2|) |#2| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) "\\spad{palgint0(f,{} x,{} y,{} z,{} t,{} c)} returns the integral of \\spad{f(x,{}y)dx} where \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{f(x,{}y)dx = c f(t,{}y) dy}; \\spad{c} and \\spad{t} are rational functions of \\spad{y}. Argument \\spad{z} is a dummy variable not appearing in \\spad{f(x,{}y)}.") (((|IntegrationResult| |#2|) |#2| (|Kernel| |#2|) (|Kernel| |#2|) |#2| (|SparseUnivariatePolynomial| |#2|)) "\\spad{palgint0(f,{} x,{} y,{} d,{} p)} returns the integral of \\spad{f(x,{}y)dx} where \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{d(x)\\^2 y(x)\\^2 = P(x)}."))) NIL ((|HasCategory| |#3| (LIST (QUOTE -641) (|devaluate| |#2|)))) @@ -2132,11 +2132,11 @@ NIL ((|constructor| (NIL "This package provides various number theoretic functions on the integers.")) (|sumOfKthPowerDivisors| (((|Integer|) (|Integer|) (|NonNegativeInteger|)) "\\spad{sumOfKthPowerDivisors(n,{}k)} returns the sum of the \\spad{k}th powers of the integers between 1 and \\spad{n} (inclusive) which divide \\spad{n}. the sum of the \\spad{k}th powers of the divisors of \\spad{n} is often denoted by \\spad{sigma_k(n)}.")) (|sumOfDivisors| (((|Integer|) (|Integer|)) "\\spad{sumOfDivisors(n)} returns the sum of the integers between 1 and \\spad{n} (inclusive) which divide \\spad{n}. The sum of the divisors of \\spad{n} is often denoted by \\spad{sigma(n)}.")) (|numberOfDivisors| (((|Integer|) (|Integer|)) "\\spad{numberOfDivisors(n)} returns the number of integers between 1 and \\spad{n} (inclusive) which divide \\spad{n}. The number of divisors of \\spad{n} is often denoted by \\spad{tau(n)}.")) (|moebiusMu| (((|Integer|) (|Integer|)) "\\spad{moebiusMu(n)} returns the Moebius function \\spad{mu(n)}. \\spad{mu(n)} is either \\spad{-1},{}0 or 1 as follows: \\spad{mu(n) = 0} if \\spad{n} is divisible by a square > 1,{} \\spad{mu(n) = (-1)^k} if \\spad{n} is square-free and has \\spad{k} distinct prime divisors.")) (|legendre| (((|Integer|) (|Integer|) (|Integer|)) "\\spad{legendre(a,{}p)} returns the Legendre symbol \\spad{L(a/p)}. \\spad{L(a/p) = (-1)**((p-1)/2) mod p} (\\spad{p} prime),{} which is 0 if \\spad{a} is 0,{} 1 if \\spad{a} is a quadratic residue \\spad{mod p} and \\spad{-1} otherwise. Note: because the primality test is expensive,{} if it is known that \\spad{p} is prime then use \\spad{jacobi(a,{}p)}.")) (|jacobi| (((|Integer|) (|Integer|) (|Integer|)) "\\spad{jacobi(a,{}b)} returns the Jacobi symbol \\spad{J(a/b)}. When \\spad{b} is odd,{} \\spad{J(a/b) = product(L(a/p) for p in factor b )}. Note: by convention,{} 0 is returned if \\spad{gcd(a,{}b) ~= 1}. Iterative \\spad{O(log(b)^2)} version coded by Michael Monagan June 1987.")) (|harmonic| (((|Fraction| (|Integer|)) (|Integer|)) "\\spad{harmonic(n)} returns the \\spad{n}th harmonic number. This is \\spad{H[n] = sum(1/k,{}k=1..n)}.")) (|fibonacci| (((|Integer|) (|Integer|)) "\\spad{fibonacci(n)} returns the \\spad{n}th Fibonacci number. the Fibonacci numbers \\spad{F[n]} are defined by \\spad{F[0] = F[1] = 1} and \\spad{F[n] = F[n-1] + F[n-2]}. The algorithm has running time \\spad{O(log(n)^3)}. Reference: Knuth,{} The Art of Computer Programming Vol 2,{} Semi-Numerical Algorithms.")) (|eulerPhi| (((|Integer|) (|Integer|)) "\\spad{eulerPhi(n)} returns the number of integers between 1 and \\spad{n} (including 1) which are relatively prime to \\spad{n}. This is the Euler phi function \\spad{\\phi(n)} is also called the totient function.")) (|euler| (((|Integer|) (|Integer|)) "\\spad{euler(n)} returns the \\spad{n}th Euler number. This is \\spad{2^n E(n,{}1/2)},{} where \\spad{E(n,{}x)} is the \\spad{n}th Euler polynomial.")) (|divisors| (((|List| (|Integer|)) (|Integer|)) "\\spad{divisors(n)} returns a list of the divisors of \\spad{n}.")) (|chineseRemainder| (((|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{chineseRemainder(x1,{}m1,{}x2,{}m2)} returns \\spad{w},{} where \\spad{w} is such that \\spad{w = x1 mod m1} and \\spad{w = x2 mod m2}. Note: \\spad{m1} and \\spad{m2} must be relatively prime.")) (|bernoulli| (((|Fraction| (|Integer|)) (|Integer|)) "\\spad{bernoulli(n)} returns the \\spad{n}th Bernoulli number. this is \\spad{B(n,{}0)},{} where \\spad{B(n,{}x)} is the \\spad{n}th Bernoulli polynomial."))) NIL NIL -(-551 -3219 UP UPUP R) +(-551 -3105 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 -(-552 -3219 UP) +(-552 -3105 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 @@ -2148,15 +2148,15 @@ NIL ((|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|))) (|:| |extra| (|Result|))) (|NumericalIntegrationProblem|) (|RoutinesTable|)) "\\spad{measure(prob,{}R)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical integration problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} listed in \\axiom{\\spad{R}} of \\axiom{category} \\axiomType{NumericalIntegrationCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information.") (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|))) (|:| |extra| (|Result|))) (|NumericalIntegrationProblem|)) "\\spad{measure(prob)} is a top level ANNA function for identifying the most appropriate numerical routine for solving the numerical integration problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} of \\axiom{category} \\axiomType{NumericalIntegrationCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information.")) (|integrate| (((|Union| (|Result|) "failed") (|Expression| (|Float|)) (|SegmentBinding| (|OrderedCompletion| (|Float|))) (|Symbol|)) "\\spad{integrate(exp,{} x = a..b,{} numerical)} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range,{} {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.\\newline \\blankline Default values for the absolute and relative error are used. \\blankline It is an error if the last argument is not {\\spad{\\tt} numerical}.") (((|Union| (|Result|) "failed") (|Expression| (|Float|)) (|SegmentBinding| (|OrderedCompletion| (|Float|))) (|String|)) "\\spad{integrate(exp,{} x = a..b,{} \"numerical\")} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range,{} {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.\\newline \\blankline Default values for the absolute and relative error are used. \\blankline It is an error of the last argument is not {\\spad{\\tt} \"numerical\"}.") (((|Result|) (|Expression| (|Float|)) (|List| (|Segment| (|OrderedCompletion| (|Float|)))) (|Float|) (|Float|) (|RoutinesTable|)) "\\spad{integrate(exp,{} [a..b,{}c..d,{}...],{} epsabs,{} epsrel,{} routines)} is a top level ANNA function to integrate a multivariate expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given set of ranges to the required absolute and relative accuracy,{} using the routines available in the RoutinesTable provided. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.") (((|Result|) (|Expression| (|Float|)) (|List| (|Segment| (|OrderedCompletion| (|Float|)))) (|Float|) (|Float|)) "\\spad{integrate(exp,{} [a..b,{}c..d,{}...],{} epsabs,{} epsrel)} is a top level ANNA function to integrate a multivariate expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given set of ranges to the required absolute and relative accuracy. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.") (((|Result|) (|Expression| (|Float|)) (|List| (|Segment| (|OrderedCompletion| (|Float|)))) (|Float|)) "\\spad{integrate(exp,{} [a..b,{}c..d,{}...],{} epsrel)} is a top level ANNA function to integrate a multivariate expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given set of ranges to the required relative accuracy. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}. \\blankline If epsrel = 0,{} a default absolute accuracy is used.") (((|Result|) (|Expression| (|Float|)) (|List| (|Segment| (|OrderedCompletion| (|Float|))))) "\\spad{integrate(exp,{} [a..b,{}c..d,{}...])} is a top level ANNA function to integrate a multivariate expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given set of ranges. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}. \\blankline Default values for the absolute and relative error are used.") (((|Result|) (|Expression| (|Float|)) (|Segment| (|OrderedCompletion| (|Float|)))) "\\spad{integrate(exp,{} a..b)} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}. \\blankline Default values for the absolute and relative error are used.") (((|Result|) (|Expression| (|Float|)) (|Segment| (|OrderedCompletion| (|Float|))) (|Float|)) "\\spad{integrate(exp,{} a..b,{} epsrel)} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}} to the required relative accuracy. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}. \\blankline If epsrel = 0,{} a default absolute accuracy is used.") (((|Result|) (|Expression| (|Float|)) (|Segment| (|OrderedCompletion| (|Float|))) (|Float|) (|Float|)) "\\spad{integrate(exp,{} a..b,{} epsabs,{} epsrel)} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}} to the required absolute and relative accuracy. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.") (((|Result|) (|NumericalIntegrationProblem|)) "\\spad{integrate(IntegrationProblem)} is a top level ANNA function to integrate an expression over a given range or ranges to the required absolute and relative accuracy. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.") (((|Result|) (|Expression| (|Float|)) (|Segment| (|OrderedCompletion| (|Float|))) (|Float|) (|Float|) (|RoutinesTable|)) "\\spad{integrate(exp,{} a..b,{} epsrel,{} routines)} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}} to the required absolute and relative accuracy using the routines available in the RoutinesTable provided. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}."))) NIL NIL -(-555 R -3219 L) +(-555 R -3105 L) ((|constructor| (NIL "This package provides functions for integration,{} limited integration,{} extended integration and the risch differential equation for pure algebraic integrands.")) (|palgLODE| (((|Record| (|:| |particular| (|Union| |#2| "failed")) (|:| |basis| (|List| |#2|))) |#3| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Symbol|)) "\\spad{palgLODE(op,{} g,{} kx,{} y,{} x)} returns the solution of \\spad{op f = g}. \\spad{y} is an algebraic function of \\spad{x}.")) (|palgRDE| (((|Union| |#2| "failed") |#2| |#2| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Mapping| (|Union| |#2| "failed") |#2| |#2| (|Symbol|))) "\\spad{palgRDE(nfp,{} f,{} g,{} x,{} y,{} foo)} returns a function \\spad{z(x,{}y)} such that \\spad{dz/dx + n * df/dx z(x,{}y) = g(x,{}y)} if such a \\spad{z} exists,{} \"failed\" otherwise; \\spad{y} is an algebraic function of \\spad{x}; \\spad{foo(a,{} b,{} x)} is a function that solves \\spad{du/dx + n * da/dx u(x) = u(x)} for an unknown \\spad{u(x)} not involving \\spad{y}. \\spad{nfp} is \\spad{n * df/dx}.")) (|palglimint| (((|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|List| |#2|)) "\\spad{palglimint(f,{} x,{} y,{} [u1,{}...,{}un])} returns functions \\spad{[h,{}[[\\spad{ci},{} \\spad{ui}]]]} such that the \\spad{ui}\\spad{'s} are among \\spad{[u1,{}...,{}un]} and \\spad{d(h + sum(\\spad{ci} log(\\spad{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 -641) (|devaluate| |#2|)))) -(-556 R -3219) +(-556 R -3105) ((|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 -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-1118)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-616))))) -(-557 -3219 UP) +(-557 -3105 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,{}[[\\spad{ci},{} \\spad{gi}]]]} such that the \\spad{gi}\\spad{'s} are among \\spad{[g1,{}...,{}gn]},{} \\spad{ci' = 0},{} and \\spad{(h+sum(\\spad{ci} log(\\spad{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 @@ -2164,27 +2164,27 @@ NIL ((|constructor| (NIL "Provides integer testing and retraction functions. Date Created: March 1990 Date Last Updated: 9 April 1991")) (|integerIfCan| (((|Union| (|Integer|) "failed") |#1|) "\\spad{integerIfCan(x)} returns \\spad{x} as an integer,{} \"failed\" if \\spad{x} is not an integer.")) (|integer?| (((|Boolean|) |#1|) "\\spad{integer?(x)} is \\spad{true} if \\spad{x} is an integer,{} \\spad{false} otherwise.")) (|integer| (((|Integer|) |#1|) "\\spad{integer(x)} returns \\spad{x} as an integer; error if \\spad{x} is not an integer."))) NIL NIL -(-559 -3219) +(-559 -3105) ((|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,{} [[\\spad{ci},{}\\spad{gi}]]]} such that the \\spad{gi}\\spad{'s} are among \\spad{[g1,{}...,{}gn]},{} \\spad{dci/dx = 0},{} and \\spad{d(h + sum(\\spad{ci} log(\\spad{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 (-560 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."))) -((-4312 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) +((-4327 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-561) ((|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 \\spad{fi} = sum ai/fi} or returns \"failed\" if no such list of \\spad{ai}\\spad{'s} exists."))) NIL NIL -(-562 R -3219) +(-562 R -3105) ((|constructor| (NIL "\\indented{1}{Tools for the integrator} Author: Manuel Bronstein Date Created: 25 April 1990 Date Last Updated: 9 June 1993 Keywords: elementary,{} function,{} integration.")) (|intPatternMatch| (((|IntegrationResult| |#2|) |#2| (|Symbol|) (|Mapping| (|IntegrationResult| |#2|) |#2| (|Symbol|)) (|Mapping| (|Union| (|Record| (|:| |special| |#2|) (|:| |integrand| |#2|)) "failed") |#2| (|Symbol|))) "\\spad{intPatternMatch(f,{} x,{} int,{} pmint)} tries to integrate \\spad{f} first by using the integration function \\spad{int},{} and then by using the pattern match intetgration function \\spad{pmint} on any remaining unintegrable part.")) (|mkPrim| ((|#2| |#2| (|Symbol|)) "\\spad{mkPrim(f,{} x)} makes the logs in \\spad{f} which are linear in \\spad{x} primitive with respect to \\spad{x}.")) (|removeConstantTerm| ((|#2| |#2| (|Symbol|)) "\\spad{removeConstantTerm(f,{} x)} returns \\spad{f} minus any additive constant with respect to \\spad{x}.")) (|vark| (((|List| (|Kernel| |#2|)) (|List| |#2|) (|Symbol|)) "\\spad{vark([f1,{}...,{}fn],{}x)} returns the set-theoretic union of \\spad{(varselect(f1,{}x),{}...,{}varselect(fn,{}x))}.")) (|union| (((|List| (|Kernel| |#2|)) (|List| (|Kernel| |#2|)) (|List| (|Kernel| |#2|))) "\\spad{union(l1,{} l2)} returns set-theoretic union of \\spad{l1} and \\spad{l2}.")) (|ksec| (((|Kernel| |#2|) (|Kernel| |#2|) (|List| (|Kernel| |#2|)) (|Symbol|)) "\\spad{ksec(k,{} [k1,{}...,{}kn],{} x)} returns the second top-level \\spad{ki} after \\spad{k} involving \\spad{x}.")) (|kmax| (((|Kernel| |#2|) (|List| (|Kernel| |#2|))) "\\spad{kmax([k1,{}...,{}kn])} returns the top-level \\spad{ki} for integration.")) (|varselect| (((|List| (|Kernel| |#2|)) (|List| (|Kernel| |#2|)) (|Symbol|)) "\\spad{varselect([k1,{}...,{}kn],{} x)} returns the \\spad{ki} which involve \\spad{x}."))) NIL ((-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-278))) (|HasCategory| |#2| (QUOTE (-616))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-1155))))) (-12 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-278)))) (|HasCategory| |#1| (QUOTE (-545)))) -(-563 -3219 UP) +(-563 -3105 UP) ((|constructor| (NIL "This package provides functions for the transcendental case of the Risch algorithm.")) (|monomialIntPoly| (((|Record| (|:| |answer| |#2|) (|:| |polypart| |#2|)) |#2| (|Mapping| |#2| |#2|)) "\\spad{monomialIntPoly(p,{} ')} returns [\\spad{q},{} \\spad{r}] such that \\spad{p = q' + r} and \\spad{degree(r) < degree(t')}. Error if \\spad{degree(t') < 2}.")) (|monomialIntegrate| (((|Record| (|:| |ir| (|IntegrationResult| (|Fraction| |#2|))) (|:| |specpart| (|Fraction| |#2|)) (|:| |polypart| |#2|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|)) "\\spad{monomialIntegrate(f,{} ')} returns \\spad{[ir,{} s,{} p]} such that \\spad{f = ir' + s + p} and all the squarefree factors of the denominator of \\spad{s} are special \\spad{w}.\\spad{r}.\\spad{t} the derivation '.")) (|expintfldpoly| (((|Union| (|LaurentPolynomial| |#1| |#2|) "failed") (|LaurentPolynomial| |#1| |#2|) (|Mapping| (|Record| (|:| |ans| |#1|) (|:| |right| |#1|) (|:| |sol?| (|Boolean|))) (|Integer|) |#1|)) "\\spad{expintfldpoly(p,{} foo)} returns \\spad{q} such that \\spad{p' = q} or \"failed\" if no such \\spad{q} exists. Argument foo is a Risch differential equation function on \\spad{F}.")) (|primintfldpoly| (((|Union| |#2| "failed") |#2| (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|) |#1|) "\\spad{primintfldpoly(p,{} ',{} t')} returns \\spad{q} such that \\spad{p' = q} or \"failed\" if no such \\spad{q} exists. Argument \\spad{t'} is the derivative of the primitive generating the extension.")) (|primlimintfrac| (((|Union| (|Record| (|:| |mainpart| (|Fraction| |#2|)) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| (|Fraction| |#2|)) (|:| |logand| (|Fraction| |#2|)))))) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|List| (|Fraction| |#2|))) "\\spad{primlimintfrac(f,{} ',{} [u1,{}...,{}un])} returns \\spad{[v,{} [c1,{}...,{}cn]]} such that \\spad{ci' = 0} and \\spad{f = v' + +/[\\spad{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(+,{}[\\spad{ci} * ui'/ui])},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}. Returns \"failed\" if no such \\spad{v},{} \\spad{ci},{} a exist. Argument \\spad{foo} is a Risch differential equation function on \\spad{F}.")) (|primlimitedint| (((|Union| (|Record| (|:| |answer| (|Record| (|:| |mainpart| (|Fraction| |#2|)) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| (|Fraction| |#2|)) (|:| |logand| (|Fraction| |#2|))))))) (|:| |a0| |#1|)) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|) (|List| (|Fraction| |#2|))) "\\spad{primlimitedint(f,{} ',{} foo,{} [u1,{}...,{}un])} returns \\spad{[v,{} [c1,{}...,{}cn],{} a]} such that \\spad{ci' = 0},{} \\spad{f = v' + a + reduce(+,{}[\\spad{ci} * ui'/ui])},{} and \\spad{a = 0} or \\spad{a} has no integral in UP. Returns \"failed\" if no such \\spad{v},{} \\spad{ci},{} a exist. Argument \\spad{foo} is an extended integration function on \\spad{F}.")) (|expextendedint| (((|Union| (|Record| (|:| |answer| (|Fraction| |#2|)) (|:| |a0| |#1|)) (|Record| (|:| |ratpart| (|Fraction| |#2|)) (|:| |coeff| (|Fraction| |#2|))) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Record| (|:| |ans| |#1|) (|:| |right| |#1|) (|:| |sol?| (|Boolean|))) (|Integer|) |#1|) (|Fraction| |#2|)) "\\spad{expextendedint(f,{} ',{} foo,{} g)} returns either \\spad{[v,{} c]} such that \\spad{f = v' + c g} and \\spad{c' = 0},{} or \\spad{[v,{} a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}. Returns \"failed\" if neither case can hold. Argument \\spad{foo} is a Risch differential equation function on \\spad{F}.")) (|primextendedint| (((|Union| (|Record| (|:| |answer| (|Fraction| |#2|)) (|:| |a0| |#1|)) (|Record| (|:| |ratpart| (|Fraction| |#2|)) (|:| |coeff| (|Fraction| |#2|))) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|) (|Fraction| |#2|)) "\\spad{primextendedint(f,{} ',{} foo,{} g)} returns either \\spad{[v,{} c]} such that \\spad{f = v' + c g} and \\spad{c' = 0},{} or \\spad{[v,{} a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in UP. Returns \"failed\" if neither case can hold. Argument \\spad{foo} is an extended integration function on \\spad{F}.")) (|tanintegrate| (((|Record| (|:| |answer| (|IntegrationResult| (|Fraction| |#2|))) (|:| |a0| |#1|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|List| |#1|) "failed") (|Integer|) |#1| |#1|)) "\\spad{tanintegrate(f,{} ',{} foo)} returns \\spad{[g,{} a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}; Argument foo is a Risch differential system solver on \\spad{F}.")) (|expintegrate| (((|Record| (|:| |answer| (|IntegrationResult| (|Fraction| |#2|))) (|:| |a0| |#1|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Record| (|:| |ans| |#1|) (|:| |right| |#1|) (|:| |sol?| (|Boolean|))) (|Integer|) |#1|)) "\\spad{expintegrate(f,{} ',{} foo)} returns \\spad{[g,{} a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}; Argument foo is a Risch differential equation solver on \\spad{F}.")) (|primintegrate| (((|Record| (|:| |answer| (|IntegrationResult| (|Fraction| |#2|))) (|:| |a0| |#1|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|)) "\\spad{primintegrate(f,{} ',{} foo)} returns \\spad{[g,{} a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in UP. Argument foo is an extended integration function on \\spad{F}."))) NIL NIL -(-564 R -3219) +(-564 R -3105) ((|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 @@ -2216,15 +2216,15 @@ NIL ((|constructor| (NIL "A package to print strings without line-feed nor carriage-return.")) (|iprint| (((|Void|) (|String|)) "\\axiom{iprint(\\spad{s})} prints \\axiom{\\spad{s}} at the current position of the cursor."))) NIL NIL -(-572 R -3219) +(-572 R -3105) ((|constructor| (NIL "This package allows a sum of logs over the roots of a polynomial to be expressed as explicit logarithms and arc tangents,{} provided that the indexing polynomial can be factored into quadratics.")) (|complexExpand| ((|#2| (|IntegrationResult| |#2|)) "\\spad{complexExpand(i)} returns the expanded complex function corresponding to \\spad{i}.")) (|expand| (((|List| |#2|) (|IntegrationResult| |#2|)) "\\spad{expand(i)} returns the list of possible real functions corresponding to \\spad{i}.")) (|split| (((|IntegrationResult| |#2|) (|IntegrationResult| |#2|)) "\\spad{split(u(x) + sum_{P(a)=0} Q(a,{}x))} returns \\spad{u(x) + sum_{P1(a)=0} Q(a,{}x) + ... + sum_{Pn(a)=0} Q(a,{}x)} where \\spad{P1},{}...,{}\\spad{Pn} are the factors of \\spad{P}."))) NIL NIL -(-573 E -3219) +(-573 E -3105) ((|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 -(-574 -3219) +(-574 -3105) ((|constructor| (NIL "If a function \\spad{f} has an elementary integral \\spad{g},{} then \\spad{g} can be written in the form \\spad{g = h + c1 log(u1) + c2 log(u2) + ... + cn log(un)} where \\spad{h},{} which is in the same field than \\spad{f},{} is called the rational part of the integral,{} and \\spad{c1 log(u1) + ... cn log(un)} is called the logarithmic part of the integral. This domain manipulates integrals represented in that form,{} by keeping both parts separately. The logs are not explicitly computed.")) (|differentiate| ((|#1| $ (|Symbol|)) "\\spad{differentiate(ir,{}x)} differentiates \\spad{ir} with respect to \\spad{x}") ((|#1| $ (|Mapping| |#1| |#1|)) "\\spad{differentiate(ir,{}D)} differentiates \\spad{ir} with respect to the derivation \\spad{D}.")) (|integral| (($ |#1| (|Symbol|)) "\\spad{integral(f,{}x)} returns the formal integral of \\spad{f} with respect to \\spad{x}") (($ |#1| |#1|) "\\spad{integral(f,{}x)} returns the formal integral of \\spad{f} with respect to \\spad{x}")) (|elem?| (((|Boolean|) $) "\\spad{elem?(ir)} tests if an integration result is elementary over \\spad{F?}")) (|notelem| (((|List| (|Record| (|:| |integrand| |#1|) (|:| |intvar| |#1|))) $) "\\spad{notelem(ir)} returns the non-elementary part of an integration result")) (|logpart| (((|List| (|Record| (|:| |scalar| (|Fraction| (|Integer|))) (|:| |coeff| (|SparseUnivariatePolynomial| |#1|)) (|:| |logand| (|SparseUnivariatePolynomial| |#1|)))) $) "\\spad{logpart(ir)} returns the logarithmic part of an integration result")) (|ratpart| ((|#1| $) "\\spad{ratpart(ir)} returns the rational part of an integration result")) (|mkAnswer| (($ |#1| (|List| (|Record| (|:| |scalar| (|Fraction| (|Integer|))) (|:| |coeff| (|SparseUnivariatePolynomial| |#1|)) (|:| |logand| (|SparseUnivariatePolynomial| |#1|)))) (|List| (|Record| (|:| |integrand| |#1|) (|:| |intvar| |#1|)))) "\\spad{mkAnswer(r,{}l,{}ne)} creates an integration result from a rational part \\spad{r},{} a logarithmic part \\spad{l},{} and a non-elementary part \\spad{ne}."))) ((-4364 . T) (-4363 . T)) ((|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-1155))))) @@ -2255,7 +2255,7 @@ NIL (-581 |mn|) ((|constructor| (NIL "This domain implements low-level strings")) (|hash| (((|Integer|) $) "\\spad{hash(x)} provides a hashing function for strings"))) ((-4370 . T) (-4369 . T)) -((-4028 (-12 (|HasCategory| (-141) (QUOTE (-833))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141))))) (-12 (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141)))))) (-4028 (|HasCategory| (-141) (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141)))))) (|HasCategory| (-141) (LIST (QUOTE -601) (QUOTE (-529)))) (-4028 (|HasCategory| (-141) (QUOTE (-833))) (|HasCategory| (-141) (QUOTE (-1079)))) (|HasCategory| (-141) (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-141) (QUOTE (-1079))) (-12 (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141))))) (|HasCategory| (-141) (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| (-141) (QUOTE (-833))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141))))) (-12 (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141)))))) (-3988 (|HasCategory| (-141) (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141)))))) (|HasCategory| (-141) (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| (-141) (QUOTE (-833))) (|HasCategory| (-141) (QUOTE (-1079)))) (|HasCategory| (-141) (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141)))))) (-582 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 @@ -2263,7 +2263,7 @@ NIL (-583 |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}."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|)))) (|HasCategory| (-553) (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-357))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3212) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553)))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|)))) (|HasCategory| (-553) (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-357))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3110) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553)))))) (-584 |Coef|) ((|constructor| (NIL "Internal package for dense Taylor series. This is an internal Taylor series type in which Taylor series are represented by a \\spadtype{Stream} of \\spadtype{Ring} elements. For univariate series,{} the \\spad{Stream} elements are the Taylor coefficients. For multivariate series,{} the \\spad{n}th Stream element is a form of degree \\spad{n} in the power series variables.")) (* (($ $ (|Integer|)) "\\spad{x*i} returns the product of integer \\spad{i} and the series \\spad{x}.") (($ $ |#1|) "\\spad{x*c} returns the product of \\spad{c} and the series \\spad{x}.") (($ |#1| $) "\\spad{c*x} returns the product of \\spad{c} and the series \\spad{x}.")) (|order| (((|NonNegativeInteger|) $ (|NonNegativeInteger|)) "\\spad{order(x,{}n)} returns the minimum of \\spad{n} and the order of \\spad{x}.") (((|NonNegativeInteger|) $) "\\spad{order(x)} returns the order of a power series \\spad{x},{} \\indented{1}{\\spadignore{i.e.} the degree of the first non-zero term of the series.}")) (|pole?| (((|Boolean|) $) "\\spad{pole?(x)} tests if the series \\spad{x} has a pole. \\indented{1}{Note: this is \\spad{false} when \\spad{x} is a Taylor series.}")) (|series| (($ (|Stream| |#1|)) "\\spad{series(s)} creates a power series from a stream of \\indented{1}{ring elements.} \\indented{1}{For univariate series types,{} the stream \\spad{s} should be a stream} \\indented{1}{of Taylor coefficients. For multivariate series types,{} the} \\indented{1}{stream \\spad{s} should be a stream of forms the \\spad{n}th element} \\indented{1}{of which is a} \\indented{1}{form of degree \\spad{n} in the power series variables.}")) (|coefficients| (((|Stream| |#1|) $) "\\spad{coefficients(x)} returns a stream of ring elements. \\indented{1}{When \\spad{x} is a univariate series,{} this is a stream of Taylor} \\indented{1}{coefficients. When \\spad{x} is a multivariate series,{} the} \\indented{1}{\\spad{n}th element of the stream is a form of} \\indented{1}{degree \\spad{n} in the power series variables.}"))) ((-4364 |has| |#1| (-545)) (-4363 |has| |#1| (-545)) ((-4371 "*") |has| |#1| (-545)) (-4362 |has| |#1| (-545)) (-4366 . T)) @@ -2276,7 +2276,7 @@ NIL ((|constructor| (NIL "Functions defined on streams with entries in two sets.")) (|map| (((|Stream| |#3|) (|Mapping| |#3| |#1| |#2|) (|InfiniteTuple| |#1|) (|Stream| |#2|)) "\\spad{map(f,{}a,{}b)} \\undocumented") (((|Stream| |#3|) (|Mapping| |#3| |#1| |#2|) (|Stream| |#1|) (|InfiniteTuple| |#2|)) "\\spad{map(f,{}a,{}b)} \\undocumented") (((|InfiniteTuple| |#3|) (|Mapping| |#3| |#1| |#2|) (|InfiniteTuple| |#1|) (|InfiniteTuple| |#2|)) "\\spad{map(f,{}a,{}b)} \\undocumented"))) NIL NIL -(-587 R -3219 FG) +(-587 R -3105 FG) ((|constructor| (NIL "This package provides transformations from trigonometric functions to exponentials and logarithms,{} and back. \\spad{F} and \\spad{FG} should be the same type of function space.")) (|trigs2explogs| ((|#3| |#3| (|List| (|Kernel| |#3|)) (|List| (|Symbol|))) "\\spad{trigs2explogs(f,{} [k1,{}...,{}kn],{} [x1,{}...,{}xm])} rewrites all the trigonometric functions appearing in \\spad{f} and involving one of the \\spad{\\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{\\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 @@ -2287,17 +2287,17 @@ NIL (-589 R |mn|) ((|constructor| (NIL "\\indented{2}{This type represents vector like objects with varying lengths} and a user-specified initial index."))) ((-4370 . T) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-4028 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#1| (QUOTE (-1031))) (-12 (|HasCategory| |#1| (QUOTE (-984))) (|HasCategory| |#1| (QUOTE (-1031)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#1| (QUOTE (-1031))) (-12 (|HasCategory| |#1| (QUOTE (-984))) (|HasCategory| |#1| (QUOTE (-1031)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-590 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 -4370)) (|HasCategory| |#2| (QUOTE (-833))) (|HasAttribute| |#1| (QUOTE -4369)) (|HasCategory| |#3| (QUOTE (-1079)))) (-591 |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."))) -((-4284 . T)) +NIL NIL (-592) -((|constructor| (NIL "\\indented{1}{This domain defines the datatype for the Java} Virtual Machine byte codes.")) (|coerce| (($ (|Byte|)) "\\spad{coerce(x)} the numerical byte value into a \\spad{JVM} bytecode."))) +((|constructor| (NIL "\\indented{1}{This domain defines the datatype for the Java} Virtual Machine byte codes."))) NIL NIL (-593) @@ -2306,19 +2306,19 @@ NIL NIL (-594 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)."))) -((-4366 -4028 (-3791 (|has| |#2| (-361 |#1|)) (|has| |#1| (-545))) (-12 (|has| |#2| (-411 |#1|)) (|has| |#1| (-545)))) (-4364 . T) (-4363 . T)) -((-4028 (|HasCategory| |#2| (LIST (QUOTE -361) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|)))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#2| (LIST (QUOTE -361) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|))))) (|HasCategory| |#2| (LIST (QUOTE -361) (|devaluate| |#1|)))) +((-4366 -3988 (-3726 (|has| |#2| (-361 |#1|)) (|has| |#1| (-545))) (-12 (|has| |#2| (-411 |#1|)) (|has| |#1| (-545)))) (-4364 . T) (-4363 . T)) +((-3988 (|HasCategory| |#2| (LIST (QUOTE -361) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|)))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#2| (LIST (QUOTE -361) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|))))) (|HasCategory| |#2| (LIST (QUOTE -361) (|devaluate| |#1|)))) (-595 |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."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 |#1|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 |#1|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2669) (QUOTE (-1137))) (LIST (QUOTE |:|) (QUOTE -3359) (|devaluate| |#1|)))))) (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 |#1|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| (-1137) (QUOTE (-833))) (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 |#1|)) (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 |#1|)) (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 |#1|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 |#1|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2578) (QUOTE (-1137))) (LIST (QUOTE |:|) (QUOTE -3256) (|devaluate| |#1|)))))) (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 |#1|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| (-1137) (QUOTE (-833))) (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 |#1|)) (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 |#1|)) (LIST (QUOTE -600) (QUOTE (-845))))) (-596 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 (-597 |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}."))) -((-4370 . T) (-4284 . T)) +((-4370 . T)) NIL (-598 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"))) @@ -2336,12 +2336,12 @@ NIL ((|constructor| (NIL "A is convertible to \\spad{B} means any element of A can be converted into an element of \\spad{B},{} but not automatically by the interpreter.")) (|convert| ((|#1| $) "\\spad{convert(a)} transforms a into an element of \\spad{S}."))) NIL NIL -(-602 -3219 UP) +(-602 -3105 UP) ((|constructor| (NIL "\\spadtype{Kovacic} provides a modified Kovacic\\spad{'s} algorithm for solving explicitely irreducible 2nd order linear ordinary differential equations.")) (|kovacic| (((|Union| (|SparseUnivariatePolynomial| (|Fraction| |#2|)) "failed") (|Fraction| |#2|) (|Fraction| |#2|) (|Fraction| |#2|) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{kovacic(a_0,{}a_1,{}a_2,{}ezfactor)} returns either \"failed\" or \\spad{P}(\\spad{u}) such that \\spad{\\$e^{\\int(-a_1/2a_2)} e^{\\int u}\\$} is a solution of \\indented{5}{\\spad{\\$a_2 y'' + a_1 y' + a0 y = 0\\$}} whenever \\spad{u} is a solution of \\spad{P u = 0}. The equation must be already irreducible over the rational functions. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.") (((|Union| (|SparseUnivariatePolynomial| (|Fraction| |#2|)) "failed") (|Fraction| |#2|) (|Fraction| |#2|) (|Fraction| |#2|)) "\\spad{kovacic(a_0,{}a_1,{}a_2)} returns either \"failed\" or \\spad{P}(\\spad{u}) such that \\spad{\\$e^{\\int(-a_1/2a_2)} e^{\\int u}\\$} is a solution of \\indented{5}{\\spad{a_2 y'' + a_1 y' + a0 y = 0}} whenever \\spad{u} is a solution of \\spad{P u = 0}. The equation must be already irreducible over the rational functions."))) NIL NIL (-603 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 \\spad{B}. In symbols \\indented{3}{A has CoercibleFrom \\spad{B}\\space{3}\\spad{<=>}\\space{2}\\spad{B} has CoercibleTo A}")) (|coerce| (($ |#1|) "\\spad{coerce(s)} transforms \\spad{`s'} into an element of `\\%'."))) +((|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 \\spad{`s'} into an element of `\\%'."))) NIL NIL (-604) @@ -2349,7 +2349,7 @@ NIL NIL NIL (-605 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 \\spad{B}. In symbols \\indented{3}{A has ConvertibleFrom \\spad{B}\\space{3}\\spad{<=>}\\space{2}\\spad{B} has ConvertibleTo A}")) (|convert| (($ |#1|) "\\spad{convert(s)} transforms \\spad{`s'} into an element of `\\%'."))) +((|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 \\spad{`s'} into an element of `\\%'."))) NIL NIL (-606 S R) @@ -2364,7 +2364,7 @@ NIL ((|constructor| (NIL "LocalAlgebra produces the localization of an algebra,{} \\spadignore{i.e.} fractions whose numerators come from some \\spad{R} algebra.")) (|denom| ((|#3| $) "\\spad{denom x} returns the denominator of \\spad{x}.")) (|numer| ((|#1| $) "\\spad{numer x} returns the numerator of \\spad{x}.")) (/ (($ |#1| |#3|) "\\spad{a / d} divides the element \\spad{a} by \\spad{d}.") (($ $ |#3|) "\\spad{x / d} divides the element \\spad{x} by \\spad{d}."))) ((-4363 . T) (-4364 . T) (-4366 . T)) ((|HasCategory| |#1| (QUOTE (-831)))) -(-609 R -3219) +(-609 R -3105) ((|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 @@ -2396,18 +2396,18 @@ NIL ((|constructor| (NIL "Category for the transcendental Liouvillian functions.")) (|erf| (($ $) "\\spad{erf(x)} returns the error function of \\spad{x},{} \\spadignore{i.e.} \\spad{2 / sqrt(\\%\\spad{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{\\spad{li}(x)} returns the logarithmic integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{dx / log(x)}.")) (|Ci| (($ $) "\\spad{\\spad{Ci}(x)} returns the cosine integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{cos(x) / x dx}.")) (|Si| (($ $) "\\spad{\\spad{Si}(x)} returns the sine integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{sin(x) / x dx}.")) (|Ei| (($ $) "\\spad{\\spad{Ei}(x)} returns the exponential integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{exp(x)/x dx}."))) NIL NIL -(-617 R -3219) +(-617 R -3105) ((|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{\\spad{li}(f)} denotes the logarithmic integral")) (|Ci| ((|#2| |#2|) "\\spad{\\spad{Ci}(f)} denotes the cosine integral")) (|Si| ((|#2| |#2|) "\\spad{\\spad{Si}(f)} denotes the sine integral")) (|Ei| ((|#2| |#2|) "\\spad{\\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 -(-618 |lv| -3219) +(-618 |lv| -3105) ((|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 (-619) ((|constructor| (NIL "This domain provides a simple way to save values in files.")) (|setelt| (((|Any|) $ (|Symbol|) (|Any|)) "\\spad{lib.k := v} saves the value \\spad{v} in the library \\spad{lib}. It can later be extracted using the key \\spad{k}.")) (|elt| (((|Any|) $ (|Symbol|)) "\\spad{elt(lib,{}k)} or \\spad{lib}.\\spad{k} extracts the value corresponding to the key \\spad{k} from the library \\spad{lib}.")) (|pack!| (($ $) "\\spad{pack!(f)} reorganizes the file \\spad{f} on disk to recover unused space.")) (|library| (($ (|FileName|)) "\\spad{library(ln)} creates a new library file."))) ((-4370 . T)) -((-12 (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 (-52))) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 (-52))) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2669) (QUOTE (-1137))) (LIST (QUOTE |:|) (QUOTE -3359) (QUOTE (-52))))))) (-4028 (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 (-52))) (QUOTE (-1079))) (|HasCategory| (-52) (QUOTE (-1079)))) (-4028 (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 (-52))) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 (-52))) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-52) (QUOTE (-1079))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 (-52))) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| (-52) (QUOTE (-1079))) (|HasCategory| (-52) (LIST (QUOTE -303) (QUOTE (-52))))) (|HasCategory| (-1137) (QUOTE (-833))) (-4028 (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 (-52))) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-52) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 (-52))) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 (-52))) (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 (-52))) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 (-52))) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2578) (QUOTE (-1137))) (LIST (QUOTE |:|) (QUOTE -3256) (QUOTE (-52))))))) (-3988 (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 (-52))) (QUOTE (-1079))) (|HasCategory| (-52) (QUOTE (-1079)))) (-3988 (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 (-52))) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 (-52))) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-52) (QUOTE (-1079))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 (-52))) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| (-52) (QUOTE (-1079))) (|HasCategory| (-52) (LIST (QUOTE -303) (QUOTE (-52))))) (|HasCategory| (-1137) (QUOTE (-833))) (-3988 (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 (-52))) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-52) (QUOTE (-1079))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 (-52))) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 (-52))) (QUOTE (-1079)))) (-620 S R) ((|constructor| (NIL "\\axiom{JacobiIdentity} means that \\axiom{[\\spad{x},{}[\\spad{y},{}\\spad{z}]]+[\\spad{y},{}[\\spad{z},{}\\spad{x}]]+[\\spad{z},{}[\\spad{x},{}\\spad{y}]] = 0} holds.")) (/ (($ $ |#2|) "\\axiom{\\spad{x/r}} returns the division of \\axiom{\\spad{x}} by \\axiom{\\spad{r}}.")) (|construct| (($ $ $) "\\axiom{construct(\\spad{x},{}\\spad{y})} returns the Lie bracket of \\axiom{\\spad{x}} and \\axiom{\\spad{y}}."))) NIL @@ -2418,8 +2418,8 @@ NIL NIL (-622 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)."))) -((-4366 -4028 (-3791 (|has| |#2| (-361 |#1|)) (|has| |#1| (-545))) (-12 (|has| |#2| (-411 |#1|)) (|has| |#1| (-545)))) (-4364 . T) (-4363 . T)) -((-4028 (|HasCategory| |#2| (LIST (QUOTE -361) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|)))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#2| (LIST (QUOTE -361) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|))))) (|HasCategory| |#2| (LIST (QUOTE -361) (|devaluate| |#1|)))) +((-4366 -3988 (-3726 (|has| |#2| (-361 |#1|)) (|has| |#1| (-545))) (-12 (|has| |#2| (-411 |#1|)) (|has| |#1| (-545)))) (-4364 . T) (-4363 . T)) +((-3988 (|HasCategory| |#2| (LIST (QUOTE -361) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|)))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#2| (LIST (QUOTE -361) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#2| (LIST (QUOTE -411) (|devaluate| |#1|))))) (|HasCategory| |#2| (LIST (QUOTE -361) (|devaluate| |#1|)))) (-623 R FE) ((|constructor| (NIL "PowerSeriesLimitPackage implements limits of expressions in one or more variables as one of the variables approaches a limiting value. Included are two-sided limits,{} left- and right- hand limits,{} and limits at plus or minus infinity.")) (|complexLimit| (((|Union| (|OnePointCompletion| |#2|) "failed") |#2| (|Equation| (|OnePointCompletion| |#2|))) "\\spad{complexLimit(f(x),{}x = a)} computes the complex limit \\spad{lim(x -> a,{}f(x))}.")) (|limit| (((|Union| (|OrderedCompletion| |#2|) "failed") |#2| (|Equation| |#2|) (|String|)) "\\spad{limit(f(x),{}x=a,{}\"left\")} computes the left hand real limit \\spad{lim(x -> a-,{}f(x))}; \\spad{limit(f(x),{}x=a,{}\"right\")} computes the right hand real limit \\spad{lim(x -> a+,{}f(x))}.") (((|Union| (|OrderedCompletion| |#2|) (|Record| (|:| |leftHandLimit| (|Union| (|OrderedCompletion| |#2|) "failed")) (|:| |rightHandLimit| (|Union| (|OrderedCompletion| |#2|) "failed"))) "failed") |#2| (|Equation| (|OrderedCompletion| |#2|))) "\\spad{limit(f(x),{}x = a)} computes the real limit \\spad{lim(x -> a,{}f(x))}."))) NIL @@ -2431,7 +2431,7 @@ NIL (-625 S R) ((|constructor| (NIL "Test for linear dependence.")) (|solveLinear| (((|Union| (|Vector| (|Fraction| |#1|)) "failed") (|Vector| |#2|) |#2|) "\\spad{solveLinear([v1,{}...,{}vn],{} u)} returns \\spad{[c1,{}...,{}cn]} such that \\spad{c1*v1 + ... + cn*vn = u},{} \"failed\" if no such \\spad{ci}\\spad{'s} exist in the quotient field of \\spad{S}.") (((|Union| (|Vector| |#1|) "failed") (|Vector| |#2|) |#2|) "\\spad{solveLinear([v1,{}...,{}vn],{} u)} returns \\spad{[c1,{}...,{}cn]} such that \\spad{c1*v1 + ... + cn*vn = u},{} \"failed\" if no such \\spad{ci}\\spad{'s} exist in \\spad{S}.")) (|linearDependence| (((|Union| (|Vector| |#1|) "failed") (|Vector| |#2|)) "\\spad{linearDependence([v1,{}...,{}vn])} returns \\spad{[c1,{}...,{}cn]} if \\spad{c1*v1 + ... + cn*vn = 0} and not all the \\spad{ci}\\spad{'s} are 0,{} \"failed\" if the \\spad{vi}\\spad{'s} are linearly independent over \\spad{S}.")) (|linearlyDependent?| (((|Boolean|) (|Vector| |#2|)) "\\spad{linearlyDependent?([v1,{}...,{}vn])} returns \\spad{true} if the \\spad{vi}\\spad{'s} are linearly dependent over \\spad{S},{} \\spad{false} otherwise."))) NIL -((-4106 (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-357)))) +((-2826 (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-357)))) (-626 R) ((|constructor| (NIL "An extension ring with an explicit linear dependence test.")) (|reducedSystem| (((|Record| (|:| |mat| (|Matrix| |#1|)) (|:| |vec| (|Vector| |#1|))) (|Matrix| $) (|Vector| $)) "\\spad{reducedSystem(A,{} v)} returns a matrix \\spad{B} and a vector \\spad{w} such that \\spad{A x = v} and \\spad{B x = w} have the same solutions in \\spad{R}.") (((|Matrix| |#1|) (|Matrix| $)) "\\spad{reducedSystem(A)} returns a matrix \\spad{B} such that \\spad{A x = 0} and \\spad{B x = 0} have the same solutions in \\spad{R}."))) ((-4366 . T)) @@ -2451,7 +2451,7 @@ NIL (-630 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()} returns the empty list."))) ((-4370 . T) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-4028 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-814))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-814))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-631 T$) ((|constructor| (NIL "This domain represents AST for Spad literals."))) NIL @@ -2459,7 +2459,7 @@ NIL (-632 S) ((|substitute| (($ |#1| |#1| $) "\\spad{substitute(x,{}y,{}d)} replace \\spad{x}\\spad{'s} with \\spad{y}\\spad{'s} in dictionary \\spad{d}.")) (|duplicates?| (((|Boolean|) $) "\\spad{duplicates?(d)} tests if dictionary \\spad{d} has duplicate entries."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-633 R) ((|constructor| (NIL "The category of left modules over an \\spad{rng} (ring not necessarily with unit). This is an abelian group which supports left multiplation by elements of the \\spad{rng}. \\blankline")) (* (($ |#1| $) "\\spad{r*x} returns the left multiplication of the module element \\spad{x} by the ring element \\spad{r}."))) NIL @@ -2474,9 +2474,9 @@ NIL ((|HasAttribute| |#1| (QUOTE -4370))) (-636 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{:=} \\spad{x}}) destructively replaces each element in the segment \\axiom{\\spad{u}(\\spad{i}..\\spad{j})} by \\spad{x}. The value \\spad{x} is returned. Note: \\spad{u} is destructively change so that \\axiom{\\spad{u}.\\spad{k} \\spad{:=} \\spad{x} for \\spad{k} in \\spad{i}..\\spad{j}}; its length remains unchanged.")) (|insert| (($ $ $ (|Integer|)) "\\spad{insert(v,{}u,{}k)} returns a copy of \\spad{u} having \\spad{v} inserted beginning at the \\axiom{\\spad{i}}th element. Note: \\axiom{insert(\\spad{v},{}\\spad{u},{}\\spad{k}) = concat( \\spad{u}(0..\\spad{k}-1),{} \\spad{v},{} \\spad{u}(\\spad{k}..) )}.") (($ |#1| $ (|Integer|)) "\\spad{insert(x,{}u,{}i)} returns a copy of \\spad{u} having \\spad{x} as its \\axiom{\\spad{i}}th element. Note: \\axiom{insert(\\spad{x},{}a,{}\\spad{k}) = concat(concat(a(0..\\spad{k}-1),{}\\spad{x}),{}a(\\spad{k}..))}.")) (|delete| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{delete(u,{}i..j)} returns a copy of \\spad{u} with the \\axiom{\\spad{i}}th through \\axiom{\\spad{j}}th element deleted. Note: \\axiom{delete(a,{}\\spad{i}..\\spad{j}) = concat(a(0..\\spad{i}-1),{}a(\\spad{j+1}..))}.") (($ $ (|Integer|)) "\\spad{delete(u,{}i)} returns a copy of \\spad{u} with the \\axiom{\\spad{i}}th element deleted. Note: for lists,{} \\axiom{delete(a,{}\\spad{i}) \\spad{==} concat(a(0..\\spad{i} - 1),{}a(\\spad{i} + 1,{}..))}.")) (|elt| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{elt(u,{}i..j)} (also written: \\axiom{a(\\spad{i}..\\spad{j})}) returns the aggregate of elements \\axiom{\\spad{u}} for \\spad{k} from \\spad{i} to \\spad{j} in that order. Note: in general,{} \\axiom{a.\\spad{s} = [a.\\spad{k} for \\spad{i} in \\spad{s}]}.")) (|map| (($ (|Mapping| |#1| |#1| |#1|) $ $) "\\spad{map(f,{}u,{}v)} returns a new collection \\spad{w} with elements \\axiom{\\spad{z} = \\spad{f}(\\spad{x},{}\\spad{y})} for corresponding elements \\spad{x} and \\spad{y} from \\spad{u} and \\spad{v}. Note: for linear aggregates,{} \\axiom{\\spad{w}.\\spad{i} = \\spad{f}(\\spad{u}.\\spad{i},{}\\spad{v}.\\spad{i})}.")) (|concat| (($ (|List| $)) "\\spad{concat(u)},{} where \\spad{u} is a lists of aggregates \\axiom{[a,{}\\spad{b},{}...,{}\\spad{c}]},{} returns a single aggregate consisting of the elements of \\axiom{a} followed by those of \\spad{b} followed ... by the elements of \\spad{c}. Note: \\axiom{concat(a,{}\\spad{b},{}...,{}\\spad{c}) = concat(a,{}concat(\\spad{b},{}...,{}\\spad{c}))}.") (($ $ $) "\\spad{concat(u,{}v)} returns an aggregate consisting of the elements of \\spad{u} followed by the elements of \\spad{v}. Note: if \\axiom{\\spad{w} = concat(\\spad{u},{}\\spad{v})} then \\axiom{\\spad{w}.\\spad{i} = \\spad{u}.\\spad{i} for \\spad{i} in indices \\spad{u}} and \\axiom{\\spad{w}.(\\spad{j} + maxIndex \\spad{u}) = \\spad{v}.\\spad{j} for \\spad{j} in indices \\spad{v}}.") (($ |#1| $) "\\spad{concat(x,{}u)} returns aggregate \\spad{u} with additional element at the front. Note: for lists: \\axiom{concat(\\spad{x},{}\\spad{u}) \\spad{==} concat([\\spad{x}],{}\\spad{u})}.") (($ $ |#1|) "\\spad{concat(u,{}x)} returns aggregate \\spad{u} with additional element \\spad{x} at the end. Note: for lists,{} \\axiom{concat(\\spad{u},{}\\spad{x}) \\spad{==} concat(\\spad{u},{}[\\spad{x}])}")) (|new| (($ (|NonNegativeInteger|) |#1|) "\\spad{new(n,{}x)} returns \\axiom{fill!(new \\spad{n},{}\\spad{x})}."))) -((-4284 . T)) NIL -(-637 R -3219 L) +NIL +(-637 R -3105 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 @@ -2496,11 +2496,11 @@ NIL ((|constructor| (NIL "\\spad{LinearOrdinaryDifferentialOperatorCategory} is the category of differential operators with coefficients in a ring A with a given derivation. Multiplication of operators corresponds to functional composition: \\indented{4}{\\spad{(L1 * L2).(f) = L1 L2 f}}")) (|directSum| (($ $ $) "\\spad{directSum(a,{}b)} computes an operator \\spad{c} of minimal order such that the nullspace of \\spad{c} is generated by all the sums of a solution of \\spad{a} by a solution of \\spad{b}.")) (|symmetricSquare| (($ $) "\\spad{symmetricSquare(a)} computes \\spad{symmetricProduct(a,{}a)} using a more efficient method.")) (|symmetricPower| (($ $ (|NonNegativeInteger|)) "\\spad{symmetricPower(a,{}n)} computes an operator \\spad{c} of minimal order such that the nullspace of \\spad{c} is generated by all the products of \\spad{n} solutions of \\spad{a}.")) (|symmetricProduct| (($ $ $) "\\spad{symmetricProduct(a,{}b)} computes an operator \\spad{c} of minimal order such that the nullspace of \\spad{c} is generated by all the products of a solution of \\spad{a} by a solution of \\spad{b}.")) (|adjoint| (($ $) "\\spad{adjoint(a)} returns the adjoint operator of a.")) (D (($) "\\spad{D()} provides the operator corresponding to a derivation in the ring \\spad{A}."))) ((-4363 . T) (-4364 . T) (-4366 . T)) NIL -(-642 -3219 UP) +(-642 -3105 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)))) -(-643 A -4311) +(-643 A -1725) ((|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}}"))) ((-4363 . T) (-4364 . T) (-4366 . T)) ((|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-357)))) @@ -2534,13 +2534,13 @@ NIL NIL (-651 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}."))) -((-4370 . T) (-4369 . T) (-4284 . T)) +((-4370 . T) (-4369 . T)) NIL -(-652 -3219) +(-652 -3105) ((|constructor| (NIL "This package solves linear system in the matrix form \\spad{AX = B}. It is essentially a particular instantiation of the package \\spadtype{LinearSystemMatrixPackage} for Matrix and Vector. This package\\spad{'s} existence makes it easier to use \\spadfun{solve} in the AXIOM interpreter.")) (|rank| (((|NonNegativeInteger|) (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{rank(A,{}B)} computes the rank of the complete matrix \\spad{(A|B)} of the linear system \\spad{AX = B}.")) (|hasSolution?| (((|Boolean|) (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{hasSolution?(A,{}B)} tests if the linear system \\spad{AX = B} has a solution.")) (|particularSolution| (((|Union| (|Vector| |#1|) "failed") (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{particularSolution(A,{}B)} finds a particular solution of the linear system \\spad{AX = B}.")) (|solve| (((|List| (|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|))))) (|List| (|List| |#1|)) (|List| (|Vector| |#1|))) "\\spad{solve(A,{}LB)} finds a particular soln of the systems \\spad{AX = B} and a basis of the associated homogeneous systems \\spad{AX = 0} where \\spad{B} varies in the list of column vectors \\spad{LB}.") (((|List| (|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|))))) (|Matrix| |#1|) (|List| (|Vector| |#1|))) "\\spad{solve(A,{}LB)} finds a particular soln of the systems \\spad{AX = B} and a basis of the associated homogeneous systems \\spad{AX = 0} where \\spad{B} varies in the list of column vectors \\spad{LB}.") (((|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|)))) (|List| (|List| |#1|)) (|Vector| |#1|)) "\\spad{solve(A,{}B)} finds a particular solution of the system \\spad{AX = B} and a basis of the associated homogeneous system \\spad{AX = 0}.") (((|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|)))) (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{solve(A,{}B)} finds a particular solution of the system \\spad{AX = B} and a basis of the associated homogeneous system \\spad{AX = 0}."))) NIL NIL -(-653 -3219 |Row| |Col| M) +(-653 -3105 |Row| |Col| M) ((|constructor| (NIL "This package solves linear system in the matrix form \\spad{AX = B}.")) (|rank| (((|NonNegativeInteger|) |#4| |#3|) "\\spad{rank(A,{}B)} computes the rank of the complete matrix \\spad{(A|B)} of the linear system \\spad{AX = B}.")) (|hasSolution?| (((|Boolean|) |#4| |#3|) "\\spad{hasSolution?(A,{}B)} tests if the linear system \\spad{AX = B} has a solution.")) (|particularSolution| (((|Union| |#3| "failed") |#4| |#3|) "\\spad{particularSolution(A,{}B)} finds a particular solution of the linear system \\spad{AX = B}.")) (|solve| (((|List| (|Record| (|:| |particular| (|Union| |#3| "failed")) (|:| |basis| (|List| |#3|)))) |#4| (|List| |#3|)) "\\spad{solve(A,{}LB)} finds a particular soln of the systems \\spad{AX = B} and a basis of the associated homogeneous systems \\spad{AX = 0} where \\spad{B} varies in the list of column vectors \\spad{LB}.") (((|Record| (|:| |particular| (|Union| |#3| "failed")) (|:| |basis| (|List| |#3|))) |#4| |#3|) "\\spad{solve(A,{}B)} finds a particular solution of the system \\spad{AX = B} and a basis of the associated homogeneous system \\spad{AX = 0}."))) NIL NIL @@ -2551,7 +2551,7 @@ NIL (-655 |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."))) ((-4366 . T) (-4369 . T) (-4363 . T) (-4364 . T)) -((|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-228))) (|HasAttribute| |#2| (QUOTE (-4371 "*"))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (-4028 (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))))) (|HasCategory| |#2| (QUOTE (-301))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-545))) (-4028 (|HasAttribute| |#2| (QUOTE (-4371 "*"))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-228)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-169)))) +((|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-228))) (|HasAttribute| |#2| (QUOTE (-4371 "*"))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))))) (|HasCategory| |#2| (QUOTE (-301))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-545))) (-3988 (|HasAttribute| |#2| (QUOTE (-4371 "*"))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-228)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-169)))) (-656) ((|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 @@ -2566,12 +2566,12 @@ NIL NIL (-659 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 \\spad{'n'} explicit entries or so that all entries of 'st' will be computed if 'st' is finite with length \\spad{<=} \\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)]}."))) -((-4284 . T)) +NIL NIL (-660 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 -((-4028 (-12 (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (QUOTE (-1031))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (QUOTE (-1031))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-661) ((|constructor| (NIL "This domain represents the syntax of a macro definition.")) (|body| (((|SpadAst|) $) "\\spad{body(m)} returns the right hand side of the definition \\spad{`m'}.")) (|head| (((|HeadAst|) $) "\\spad{head(m)} returns the head of the macro definition \\spad{`m'}. This is a list of identifiers starting with the name of the macro followed by the name of the parameters,{} if any."))) NIL @@ -2618,7 +2618,7 @@ NIL ((|HasAttribute| |#2| (QUOTE (-4371 "*"))) (|HasCategory| |#2| (QUOTE (-301))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-545)))) (-672 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{\\spad{ri} := nrows \\spad{mi}},{} \\spad{\\spad{ci} := ncols \\spad{mi}},{} then \\spad{m} is an (\\spad{r1+}..\\spad{+rk}) by (\\spad{c1+}..\\spad{+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}\\spad{'s} on the diagonal and zeroes elsewhere.")) (|matrix| (($ (|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"))) -((-4369 . T) (-4370 . T) (-4284 . T)) +((-4369 . T) (-4370 . T)) NIL (-673 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 \\spad{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} \\spad{~=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} \\spad{~=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."))) @@ -2627,7 +2627,7 @@ NIL (-674 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."))) ((-4369 . T) (-4370 . T)) -((-4028 (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-545))) (|HasAttribute| |#1| (QUOTE (-4371 "*"))) (|HasCategory| |#1| (QUOTE (-357))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-545))) (|HasAttribute| |#1| (QUOTE (-4371 "*"))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-675 R) ((|constructor| (NIL "This package provides standard arithmetic operations on matrices. The functions in this package store the results of computations in existing matrices,{} rather than creating new matrices. This package works only for matrices of type Matrix and uses the internal representation of this type.")) (** (((|Matrix| |#1|) (|Matrix| |#1|) (|NonNegativeInteger|)) "\\spad{x ** n} computes the \\spad{n}-th power of a square matrix. The power \\spad{n} is assumed greater than 1.")) (|power!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|NonNegativeInteger|)) "\\spad{power!(a,{}b,{}c,{}m,{}n)} computes \\spad{m} \\spad{**} \\spad{n} and stores the result in \\spad{a}. The matrices \\spad{b} and \\spad{c} are used to store intermediate results. Error: if \\spad{a},{} \\spad{b},{} \\spad{c},{} and \\spad{m} are not square and of the same dimensions.")) (|times!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{times!(c,{}a,{}b)} computes the matrix product \\spad{a * b} and stores the result in the matrix \\spad{c}. Error: if \\spad{a},{} \\spad{b},{} and \\spad{c} do not have compatible dimensions.")) (|rightScalarTimes!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) |#1|) "\\spad{rightScalarTimes!(c,{}a,{}r)} computes the scalar product \\spad{a * r} and stores the result in the matrix \\spad{c}. Error: if \\spad{a} and \\spad{c} do not have the same dimensions.")) (|leftScalarTimes!| (((|Matrix| |#1|) (|Matrix| |#1|) |#1| (|Matrix| |#1|)) "\\spad{leftScalarTimes!(c,{}r,{}a)} computes the scalar product \\spad{r * a} and stores the result in the matrix \\spad{c}. Error: if \\spad{a} and \\spad{c} do not have the same dimensions.")) (|minus!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{!minus!(c,{}a,{}b)} computes the matrix difference \\spad{a - b} and stores the result in the matrix \\spad{c}. Error: if \\spad{a},{} \\spad{b},{} and \\spad{c} do not have the same dimensions.") (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{minus!(c,{}a)} computes \\spad{-a} and stores the result in the matrix \\spad{c}. Error: if a and \\spad{c} do not have the same dimensions.")) (|plus!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{plus!(c,{}a,{}b)} computes the matrix sum \\spad{a + b} and stores the result in the matrix \\spad{c}. Error: if \\spad{a},{} \\spad{b},{} and \\spad{c} do not have the same dimensions.")) (|copy!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{copy!(c,{}a)} copies the matrix \\spad{a} into the matrix \\spad{c}. Error: if \\spad{a} and \\spad{c} do not have the same dimensions."))) NIL @@ -2636,7 +2636,7 @@ NIL ((|constructor| (NIL "This domain implements the notion of optional vallue,{} where a computation may fail to produce expected value.")) (|nothing| (($) "represents failure.")) (|autoCoerce| ((|#1| $) "same as above but implicitly called by the compiler.")) (|coerce| ((|#1| $) "x::T tries to extract the value of \\spad{T} from the computation \\spad{x}. Produces a runtime error when the computation fails.") (($ |#1|) "x::T injects the value \\spad{x} into \\%.")) (|case| (((|Boolean|) $ (|[\|\|]| |nothing|)) "\\spad{x case nothing} evaluates \\spad{true} 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}."))) NIL NIL -(-677 S -3219 FLAF FLAS) +(-677 S -3105 FLAF FLAS) ((|constructor| (NIL "\\indented{1}{\\spadtype{MultiVariableCalculusFunctions} Package provides several} \\indented{1}{functions for multivariable calculus.} These include gradient,{} hessian and jacobian,{} divergence and laplacian. Various forms for banded and sparse storage of matrices are included.")) (|bandedJacobian| (((|Matrix| |#2|) |#3| |#4| (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{bandedJacobian(vf,{}xlist,{}kl,{}ku)} computes the jacobian,{} the matrix of first partial derivatives,{} of the vector field \\spad{vf},{} \\spad{vf} a vector function of the variables listed in \\spad{xlist},{} \\spad{kl} is the number of nonzero subdiagonals,{} \\spad{ku} is the number of nonzero superdiagonals,{} kl+ku+1 being actual bandwidth. Stores the nonzero band in a matrix,{} dimensions kl+ku+1 by \\#xlist. The upper triangle is in the top \\spad{ku} rows,{} the diagonal is in row ku+1,{} the lower triangle in the last \\spad{kl} rows. Entries in a column in the band store correspond to entries in same column of full store. (The notation conforms to LAPACK/NAG-\\spad{F07} conventions.)")) (|jacobian| (((|Matrix| |#2|) |#3| |#4|) "\\spad{jacobian(vf,{}xlist)} computes the jacobian,{} the matrix of first partial derivatives,{} of the vector field \\spad{vf},{} \\spad{vf} a vector function of the variables listed in \\spad{xlist}.")) (|bandedHessian| (((|Matrix| |#2|) |#2| |#4| (|NonNegativeInteger|)) "\\spad{bandedHessian(v,{}xlist,{}k)} computes the hessian,{} the matrix of second partial derivatives,{} of the scalar field \\spad{v},{} \\spad{v} a function of the variables listed in \\spad{xlist},{} \\spad{k} is the semi-bandwidth,{} the number of nonzero subdiagonals,{} 2*k+1 being actual bandwidth. Stores the nonzero band in lower triangle in a matrix,{} dimensions \\spad{k+1} by \\#xlist,{} whose rows are the vectors formed by diagonal,{} subdiagonal,{} etc. of the real,{} full-matrix,{} hessian. (The notation conforms to LAPACK/NAG-\\spad{F07} conventions.)")) (|hessian| (((|Matrix| |#2|) |#2| |#4|) "\\spad{hessian(v,{}xlist)} computes the hessian,{} the matrix of second partial derivatives,{} of the scalar field \\spad{v},{} \\spad{v} a function of the variables listed in \\spad{xlist}.")) (|laplacian| ((|#2| |#2| |#4|) "\\spad{laplacian(v,{}xlist)} computes the laplacian of the scalar field \\spad{v},{} \\spad{v} a function of the variables listed in \\spad{xlist}.")) (|divergence| ((|#2| |#3| |#4|) "\\spad{divergence(vf,{}xlist)} computes the divergence of the vector field \\spad{vf},{} \\spad{vf} a vector function of the variables listed in \\spad{xlist}.")) (|gradient| (((|Vector| |#2|) |#2| |#4|) "\\spad{gradient(v,{}xlist)} computes the gradient,{} the vector of first partial derivatives,{} of the scalar field \\spad{v},{} \\spad{v} a function of the variables listed in \\spad{xlist}."))) NIL NIL @@ -2647,10 +2647,10 @@ NIL (-679) ((|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"))) ((-4362 . T) (-4367 |has| (-684) (-357)) (-4361 |has| (-684) (-357)) (-4368 |has| (-684) (-6 -4368)) (-4365 |has| (-684) (-6 -4365)) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| (-684) (QUOTE (-144))) (|HasCategory| (-684) (QUOTE (-142))) (|HasCategory| (-684) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-684) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| (-684) (QUOTE (-362))) (|HasCategory| (-684) (QUOTE (-357))) (|HasCategory| (-684) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-684) (QUOTE (-228))) (-4028 (|HasCategory| (-684) (QUOTE (-357))) (|HasCategory| (-684) (QUOTE (-343)))) (|HasCategory| (-684) (QUOTE (-343))) (|HasCategory| (-684) (LIST (QUOTE -280) (QUOTE (-684)) (QUOTE (-684)))) (|HasCategory| (-684) (LIST (QUOTE -303) (QUOTE (-684)))) (|HasCategory| (-684) (LIST (QUOTE -507) (QUOTE (-1155)) (QUOTE (-684)))) (|HasCategory| (-684) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-684) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-684) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-684) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (-4028 (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-357))) (|HasCategory| (-684) (QUOTE (-343)))) (|HasCategory| (-684) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-684) (QUOTE (-1004))) (|HasCategory| (-684) (QUOTE (-1177))) (-12 (|HasCategory| (-684) (QUOTE (-984))) (|HasCategory| (-684) (QUOTE (-1177)))) (-4028 (-12 (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891)))) (|HasCategory| (-684) (QUOTE (-357))) (-12 (|HasCategory| (-684) (QUOTE (-343))) (|HasCategory| (-684) (QUOTE (-891))))) (-4028 (-12 (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891)))) (-12 (|HasCategory| (-684) (QUOTE (-357))) (|HasCategory| (-684) (QUOTE (-891)))) (-12 (|HasCategory| (-684) (QUOTE (-343))) (|HasCategory| (-684) (QUOTE (-891))))) (|HasCategory| (-684) (QUOTE (-538))) (-12 (|HasCategory| (-684) (QUOTE (-1040))) (|HasCategory| (-684) (QUOTE (-1177)))) (|HasCategory| (-684) (QUOTE (-1040))) (-4028 (|HasCategory| (-684) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-684) (QUOTE (-357)))) (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891))) (-4028 (-12 (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891)))) (|HasCategory| (-684) (QUOTE (-357)))) (-4028 (-12 (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891)))) (|HasCategory| (-684) (QUOTE (-545)))) (-12 (|HasCategory| (-684) (QUOTE (-228))) (|HasCategory| (-684) (QUOTE (-357)))) (-12 (|HasCategory| (-684) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-684) (QUOTE (-357)))) (|HasCategory| (-684) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-684) (QUOTE (-833))) (|HasCategory| (-684) (QUOTE (-545))) (|HasAttribute| (-684) (QUOTE -4368)) (|HasAttribute| (-684) (QUOTE -4365)) (-12 (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891)))) (|HasCategory| (-684) (QUOTE (-142)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891)))) (|HasCategory| (-684) (QUOTE (-343))))) +((|HasCategory| (-684) (QUOTE (-144))) (|HasCategory| (-684) (QUOTE (-142))) (|HasCategory| (-684) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-684) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| (-684) (QUOTE (-362))) (|HasCategory| (-684) (QUOTE (-357))) (-3988 (|HasCategory| (-684) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-684) (QUOTE (-357)))) (|HasCategory| (-684) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-684) (QUOTE (-228))) (-3988 (|HasCategory| (-684) (QUOTE (-357))) (|HasCategory| (-684) (QUOTE (-343)))) (|HasCategory| (-684) (QUOTE (-343))) (|HasCategory| (-684) (LIST (QUOTE -280) (QUOTE (-684)) (QUOTE (-684)))) (|HasCategory| (-684) (LIST (QUOTE -303) (QUOTE (-684)))) (|HasCategory| (-684) (LIST (QUOTE -507) (QUOTE (-1155)) (QUOTE (-684)))) (|HasCategory| (-684) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-684) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-684) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-684) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (-3988 (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-357))) (|HasCategory| (-684) (QUOTE (-343)))) (|HasCategory| (-684) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-684) (QUOTE (-1004))) (|HasCategory| (-684) (QUOTE (-1177))) (-12 (|HasCategory| (-684) (QUOTE (-984))) (|HasCategory| (-684) (QUOTE (-1177)))) (-3988 (-12 (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891)))) (|HasCategory| (-684) (QUOTE (-357))) (-12 (|HasCategory| (-684) (QUOTE (-343))) (|HasCategory| (-684) (QUOTE (-891))))) (-3988 (-12 (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891)))) (-12 (|HasCategory| (-684) (QUOTE (-357))) (|HasCategory| (-684) (QUOTE (-891)))) (-12 (|HasCategory| (-684) (QUOTE (-343))) (|HasCategory| (-684) (QUOTE (-891))))) (|HasCategory| (-684) (QUOTE (-538))) (-12 (|HasCategory| (-684) (QUOTE (-1040))) (|HasCategory| (-684) (QUOTE (-1177)))) (|HasCategory| (-684) (QUOTE (-1040))) (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891))) (-3988 (-12 (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891)))) (|HasCategory| (-684) (QUOTE (-357)))) (-3988 (-12 (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891)))) (|HasCategory| (-684) (QUOTE (-545)))) (-12 (|HasCategory| (-684) (QUOTE (-228))) (|HasCategory| (-684) (QUOTE (-357)))) (-12 (|HasCategory| (-684) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-684) (QUOTE (-357)))) (|HasCategory| (-684) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-684) (QUOTE (-833))) (|HasCategory| (-684) (QUOTE (-545))) (|HasAttribute| (-684) (QUOTE -4368)) (|HasAttribute| (-684) (QUOTE -4365)) (-12 (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891)))) (|HasCategory| (-684) (QUOTE (-142)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-684) (QUOTE (-301))) (|HasCategory| (-684) (QUOTE (-891)))) (|HasCategory| (-684) (QUOTE (-343))))) (-680 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}."))) -((-4370 . T) (-4284 . T)) +((-4370 . T)) NIL (-681 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 \\spad{gcd} of the univariate polynomials \\spad{f1} and \\spad{f2} modulo the integer prime \\spad{p}."))) @@ -2660,13 +2660,13 @@ NIL ((|constructor| (NIL "\\indented{1}{<description of package>} Author: Jim Wen Date Created: \\spad{??} Date Last Updated: October 1991 by Jon Steinbach Keywords: Examples: References:")) (|ptFunc| (((|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) "\\spad{ptFunc(a,{}b,{}c,{}d)} is an internal function exported in order to compile packages.")) (|meshPar1Var| (((|ThreeSpace| (|DoubleFloat|)) (|Expression| (|Integer|)) (|Expression| (|Integer|)) (|Expression| (|Integer|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar1Var(s,{}t,{}u,{}f,{}s1,{}l)} \\undocumented")) (|meshFun2Var| (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Union| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "undefined") (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshFun2Var(f,{}g,{}s1,{}s2,{}l)} \\undocumented")) (|meshPar2Var| (((|ThreeSpace| (|DoubleFloat|)) (|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(sp,{}f,{}s1,{}s2,{}l)} \\undocumented") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(f,{}s1,{}s2,{}l)} \\undocumented") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Union| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "undefined") (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(f,{}g,{}h,{}j,{}s1,{}s2,{}l)} \\undocumented"))) NIL NIL -(-683 OV E -3219 PG) +(-683 OV E -3105 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 (-684) ((|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}"))) -((-4312 . T) (-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) +((-4327 . T) (-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-685 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."))) @@ -2681,7 +2681,7 @@ NIL NIL NIL (-688 S) -((|constructor| (NIL "MakeCachableSet(\\spad{S}) returns a cachable set which is equal to \\spad{S} as a set.")) (|coerce| (($ |#1|) "\\spad{coerce(s)} returns \\spad{s} viewed as an element of \\%."))) +((|constructor| (NIL "MakeCachableSet(\\spad{S}) returns a cachable set which is equal to \\spad{S} as a set."))) NIL NIL (-689 S) @@ -2696,7 +2696,7 @@ NIL ((|constructor| (NIL "MakeRecord is used internally by the interpreter to create record types which are used for doing parallel iterations on streams.")) (|makeRecord| (((|Record| (|:| |part1| |#1|) (|:| |part2| |#2|)) |#1| |#2|) "\\spad{makeRecord(a,{}b)} creates a record object with type Record(part1:S,{} part2:R),{} where part1 is \\spad{a} and part2 is \\spad{b}."))) NIL NIL -(-692 S -1766 I) +(-692 S -1780 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 @@ -2716,23 +2716,23 @@ NIL ((|constructor| (NIL "\\spadtype{MathMLFormat} provides a coercion from \\spadtype{OutputForm} to MathML format.")) (|display| (((|Void|) (|String|)) "prints the string returned by coerce,{} adding <math ...> tags.")) (|exprex| (((|String|) (|OutputForm|)) "coverts \\spadtype{OutputForm} to \\spadtype{String} with the structure preserved with braces. Actually this is not quite accurate. The function \\spadfun{precondition} is first applied to the \\spadtype{OutputForm} expression before \\spadfun{exprex}. The raw \\spadtype{OutputForm} and the nature of the \\spadfun{precondition} function is still obscure to me at the time of this writing (2007-02-14).")) (|coerceL| (((|String|) (|OutputForm|)) "coerceS(\\spad{o}) changes \\spad{o} in the standard output format to MathML format and displays result as one long string.")) (|coerceS| (((|String|) (|OutputForm|)) "\\spad{coerceS(o)} changes \\spad{o} in the standard output format to MathML format and displays formatted result.")) (|coerce| (((|String|) (|OutputForm|)) "coerceS(\\spad{o}) changes \\spad{o} in the standard output format to MathML format."))) NIL NIL -(-697 R |Mod| -3233 -3858 |exactQuo|) +(-697 R |Mod| -3668 -3160 |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"))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-698 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")) (|coerce| (($ |#2|) "\\spad{coerce(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"))) +((|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"))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4365 |has| |#1| (-357)) (-4367 |has| |#1| (-6 -4367)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#1| (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-1130))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-343))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (QUOTE (-228))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) +((|HasCategory| |#1| (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-1130))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (QUOTE (-228))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) (-699 IS E |ff|) -((|constructor| (NIL "This package \\undocumented")) (|construct| (($ |#1| |#2|) "\\spad{construct(i,{}e)} \\undocumented")) (|coerce| (((|Record| (|:| |index| |#1|) (|:| |exponent| |#2|)) $) "\\spad{coerce(x)} \\undocumented") (($ (|Record| (|:| |index| |#1|) (|:| |exponent| |#2|))) "\\spad{coerce(x)} \\undocumented")) (|index| ((|#1| $) "\\spad{index(x)} \\undocumented")) (|exponent| ((|#2| $) "\\spad{exponent(x)} \\undocumented"))) +((|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 (-700 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 op2. \\spad{op1} must be a basic operator") (($ $) "\\spad{adjoint(op)} returns the adjoint of the operator \\spad{op}."))) ((-4364 |has| |#1| (-169)) (-4363 |has| |#1| (-169)) (-4366 . T)) ((|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144)))) -(-701 R |Mod| -3233 -3858 |exactQuo|) +(-701 R |Mod| -3668 -3160 |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"))) ((-4366 . T)) NIL @@ -2744,7 +2744,7 @@ NIL ((|constructor| (NIL "The category of modules over a commutative ring. \\blankline"))) ((-4364 . T) (-4363 . T)) NIL -(-704 -3219) +(-704 -3105) ((|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]]}."))) ((-4366 . T)) NIL @@ -2780,7 +2780,7 @@ NIL ((|constructor| (NIL "The class of multiplicative monoids,{} \\spadignore{i.e.} semigroups with a multiplicative identity element. \\blankline")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(x)} tries to compute the multiplicative inverse for \\spad{x} or \"failed\" if it cannot find the inverse (see unitsKnown).")) (** (($ $ (|NonNegativeInteger|)) "\\spad{x**n} returns the repeated product of \\spad{x} \\spad{n} times,{} \\spadignore{i.e.} exponentiation.")) (|one?| (((|Boolean|) $) "\\spad{one?(x)} tests if \\spad{x} is equal to 1.")) (|sample| (($) "\\spad{sample yields} a value of type \\%")) ((|One|) (($) "1 is the multiplicative identity."))) NIL NIL -(-713 -3219 UP) +(-713 -3105 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 @@ -2799,7 +2799,7 @@ NIL (-717 |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."))) (((-4371 "*") |has| |#2| (-169)) (-4362 |has| |#2| (-545)) (-4367 |has| |#2| (-6 -4367)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#2| (QUOTE (-891))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-169))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-545)))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#2| (QUOTE (-833))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasAttribute| |#2| (QUOTE -4367)) (|HasCategory| |#2| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-142))))) +((|HasCategory| |#2| (QUOTE (-891))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-169))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-545)))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-847 |#1|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#2| (QUOTE (-833))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357))) (|HasAttribute| |#2| (QUOTE -4367)) (|HasCategory| |#2| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-142))))) (-718 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 @@ -2818,7 +2818,7 @@ NIL ((-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#2| (QUOTE (-833)))) (-722 S) ((|constructor| (NIL "A multi-set aggregate is a set which keeps track of the multiplicity of its elements."))) -((-4359 . T) (-4370 . T) (-4284 . T)) +((-4359 . T) (-4370 . T)) NIL (-723 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}."))) @@ -2932,11 +2932,11 @@ NIL ((|constructor| (NIL "This package computes explicitly eigenvalues and eigenvectors of matrices with entries over the complex rational numbers. The results are expressed either as complex floating numbers or as complex rational numbers depending on the type of the precision parameter.")) (|complexEigenvectors| (((|List| (|Record| (|:| |outval| (|Complex| |#1|)) (|:| |outmult| (|Integer|)) (|:| |outvect| (|List| (|Matrix| (|Complex| |#1|)))))) (|Matrix| (|Complex| (|Fraction| (|Integer|)))) |#1|) "\\spad{complexEigenvectors(m,{}eps)} returns a list of records each one containing a complex eigenvalue,{} its algebraic multiplicity,{} and a list of associated eigenvectors. All these results are computed to precision \\spad{eps} and are expressed as complex floats or complex rational numbers depending on the type of \\spad{eps} (float or rational).")) (|complexEigenvalues| (((|List| (|Complex| |#1|)) (|Matrix| (|Complex| (|Fraction| (|Integer|)))) |#1|) "\\spad{complexEigenvalues(m,{}eps)} computes the eigenvalues of the matrix \\spad{m} to precision \\spad{eps}. The eigenvalues are expressed as complex floats or complex rational numbers depending on the type of \\spad{eps} (float or rational).")) (|characteristicPolynomial| (((|Polynomial| (|Complex| (|Fraction| (|Integer|)))) (|Matrix| (|Complex| (|Fraction| (|Integer|)))) (|Symbol|)) "\\spad{characteristicPolynomial(m,{}x)} returns the characteristic polynomial of the matrix \\spad{m} expressed as polynomial over Complex Rationals with variable \\spad{x}.") (((|Polynomial| (|Complex| (|Fraction| (|Integer|)))) (|Matrix| (|Complex| (|Fraction| (|Integer|))))) "\\spad{characteristicPolynomial(m)} returns the characteristic polynomial of the matrix \\spad{m} expressed as polynomial over complex rationals with a new symbol as variable."))) NIL NIL -(-751 -3219) +(-751 -3105) ((|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 -(-752 P -3219) +(-752 P -3105) ((|constructor| (NIL "This package provides a division and related operations for \\spadtype{MonogenicLinearOperator}\\spad{s} over a \\spadtype{Field}. Since the multiplication is in general non-commutative,{} these operations all have left- and right-hand versions. This package provides the operations based on left-division.")) (|leftLcm| ((|#1| |#1| |#1|) "\\spad{leftLcm(a,{}b)} computes the value \\spad{m} of lowest degree such that \\spad{m = a*aa = b*bb} for some values \\spad{aa} and \\spad{bb}. The value \\spad{m} is computed using left-division.")) (|leftGcd| ((|#1| |#1| |#1|) "\\spad{leftGcd(a,{}b)} computes the value \\spad{g} of highest degree such that \\indented{3}{\\spad{a = aa*g}} \\indented{3}{\\spad{b = bb*g}} for some values \\spad{aa} and \\spad{bb}. The value \\spad{g} is computed using left-division.")) (|leftExactQuotient| (((|Union| |#1| "failed") |#1| |#1|) "\\spad{leftExactQuotient(a,{}b)} computes the value \\spad{q},{} if it exists,{} \\indented{1}{such that \\spad{a = b*q}.}")) (|leftRemainder| ((|#1| |#1| |#1|) "\\spad{leftRemainder(a,{}b)} computes the pair \\spad{[q,{}r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. The value \\spad{r} is returned.")) (|leftQuotient| ((|#1| |#1| |#1|) "\\spad{leftQuotient(a,{}b)} computes the pair \\spad{[q,{}r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. The value \\spad{q} is returned.")) (|leftDivide| (((|Record| (|:| |quotient| |#1|) (|:| |remainder| |#1|)) |#1| |#1|) "\\spad{leftDivide(a,{}b)} returns the pair \\spad{[q,{}r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. This process is called ``left division\\spad{''}."))) NIL NIL @@ -2944,12 +2944,12 @@ NIL NIL NIL NIL -(-754 UP -3219) +(-754 UP -3105) ((|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{\\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{\\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{\\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{\\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{\\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{\\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 (-755) -((|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| (((|OutputForm|) $) "\\spad{coerce(x)} \\undocumented{}") (($ (|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{}"))) +((|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 (-756 R) @@ -2960,7 +2960,7 @@ NIL ((|constructor| (NIL "\\spadtype{NonNegativeInteger} provides functions for non \\indented{2}{negative integers.}")) (|commutative| ((|attribute| "*") "\\spad{commutative(\"*\")} means multiplication is commutative : \\spad{x*y = y*x}.")) (|random| (($ $) "\\spad{random(n)} returns a random integer from 0 to \\spad{n-1}.")) (|shift| (($ $ (|Integer|)) "\\spad{shift(a,{}i)} shift \\spad{a} by \\spad{i} bits.")) (|exquo| (((|Union| $ "failed") $ $) "\\spad{exquo(a,{}b)} returns the quotient of \\spad{a} and \\spad{b},{} or \"failed\" if \\spad{b} is zero or \\spad{a} rem \\spad{b} is zero.")) (|divide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{divide(a,{}b)} returns a record containing both remainder and quotient.")) (|gcd| (($ $ $) "\\spad{gcd(a,{}b)} computes the greatest common divisor of two non negative integers \\spad{a} and \\spad{b}.")) (|rem| (($ $ $) "\\spad{a rem b} returns the remainder of \\spad{a} and \\spad{b}.")) (|quo| (($ $ $) "\\spad{a quo b} returns the quotient of \\spad{a} and \\spad{b},{} forgetting the remainder."))) (((-4371 "*") . T)) NIL -(-758 R -3219) +(-758 R -3105) ((|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 @@ -2980,7 +2980,7 @@ NIL ((|constructor| (NIL "A package for computing normalized assocites of univariate polynomials with coefficients in a tower of simple extensions of a field.\\newline References : \\indented{1}{[1] \\spad{D}. LAZARD \"A new method for solving algebraic systems of} \\indented{5}{positive dimension\" Discr. App. Math. 33:147-160,{}1991} \\indented{1}{[2] \\spad{M}. MORENO MAZA and \\spad{R}. RIOBOO \"Computations of \\spad{gcd} over} \\indented{5}{algebraic towers of simple extensions\" In proceedings of AAECC11} \\indented{5}{Paris,{} 1995.} \\indented{1}{[3] \\spad{M}. MORENO MAZA \"Calculs de pgcd au-dessus des tours} \\indented{5}{d'extensions simples et resolution des systemes d'equations} \\indented{5}{algebriques\" These,{} Universite \\spad{P}.etM. Curie,{} Paris,{} 1997.}")) (|normInvertible?| (((|List| (|Record| (|:| |val| (|Boolean|)) (|:| |tower| |#5|))) |#4| |#5|) "\\axiom{normInvertible?(\\spad{p},{}\\spad{ts})} is an internal subroutine,{} exported only for developement.")) (|outputArgs| (((|Void|) (|String|) (|String|) |#4| |#5|) "\\axiom{outputArgs(\\spad{s1},{}\\spad{s2},{}\\spad{p},{}\\spad{ts})} is an internal subroutine,{} exported only for developement.")) (|normalize| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#5|) "\\axiom{normalize(\\spad{p},{}\\spad{ts})} normalizes \\axiom{\\spad{p}} \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts}.")) (|normalizedAssociate| ((|#4| |#4| |#5|) "\\axiom{normalizedAssociate(\\spad{p},{}\\spad{ts})} returns a normalized polynomial \\axiom{\\spad{n}} \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts} such that \\axiom{\\spad{n}} and \\axiom{\\spad{p}} are associates \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts} and assuming that \\axiom{\\spad{p}} is invertible \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts}.")) (|recip| (((|Record| (|:| |num| |#4|) (|:| |den| |#4|)) |#4| |#5|) "\\axiom{recip(\\spad{p},{}\\spad{ts})} returns the inverse of \\axiom{\\spad{p}} \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts} assuming that \\axiom{\\spad{p}} is invertible \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts}."))) NIL NIL -(-763 -3219 |ExtF| |SUEx| |ExtP| |n|) +(-763 -3105 |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 @@ -2995,7 +2995,7 @@ NIL (-766 R |VarSet|) ((|constructor| (NIL "A post-facto extension for \\axiomType{\\spad{SMP}} in order to speed up operations related to pseudo-division and \\spad{gcd}. This domain is based on the \\axiomType{NSUP} constructor which is itself a post-facto extension of the \\axiomType{SUP} constructor."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-6 -4367)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#1| (QUOTE (-891))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155))))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155))))) (-4028 (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155)))) (-4106 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155)))))) (-4028 (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155)))) (-4106 (|HasCategory| |#1| (QUOTE (-538)))) (-4106 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155)))) (-4106 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-553))))) (-4106 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155)))) (-4106 (|HasCategory| |#1| (LIST (QUOTE -974) (QUOTE (-553))))))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) +((|HasCategory| |#1| (QUOTE (-891))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155))))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155))))) (-3988 (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155)))) (-2826 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155)))))) (-3988 (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155)))) (-2826 (|HasCategory| |#1| (QUOTE (-538)))) (-2826 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155)))) (-2826 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-553))))) (-2826 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-1155)))) (-2826 (|HasCategory| |#1| (LIST (QUOTE -974) (QUOTE (-553))))))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) (-767 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 @@ -3003,14 +3003,14 @@ NIL (-768 R) ((|constructor| (NIL "A post-facto extension for \\axiomType{SUP} in order to speed up operations related to pseudo-division and \\spad{gcd} for both \\axiomType{SUP} and,{} consequently,{} \\axiomType{NSMP}.")) (|halfExtendedResultant2| (((|Record| (|:| |resultant| |#1|) (|:| |coef2| $)) $ $) "\\axiom{halfExtendedResultant2(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca]} such that \\axiom{extendedResultant(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca,{} \\spad{cb}]}")) (|halfExtendedResultant1| (((|Record| (|:| |resultant| |#1|) (|:| |coef1| $)) $ $) "\\axiom{halfExtendedResultant1(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca]} such that \\axiom{extendedResultant(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca,{} \\spad{cb}]}")) (|extendedResultant| (((|Record| (|:| |resultant| |#1|) (|:| |coef1| $) (|:| |coef2| $)) $ $) "\\axiom{extendedResultant(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca,{}\\spad{cb}]} such that \\axiom{\\spad{r}} is the resultant of \\axiom{a} and \\axiom{\\spad{b}} and \\axiom{\\spad{r} = ca * a + \\spad{cb} * \\spad{b}}")) (|halfExtendedSubResultantGcd2| (((|Record| (|:| |gcd| $) (|:| |coef2| $)) $ $) "\\axiom{halfExtendedSubResultantGcd2(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}\\spad{cb}]} such that \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{} \\spad{cb}]}")) (|halfExtendedSubResultantGcd1| (((|Record| (|:| |gcd| $) (|:| |coef1| $)) $ $) "\\axiom{halfExtendedSubResultantGcd1(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca]} such that \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{} \\spad{cb}]}")) (|extendedSubResultantGcd| (((|Record| (|:| |gcd| $) (|:| |coef1| $) (|:| |coef2| $)) $ $) "\\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{} \\spad{cb}]} such that \\axiom{\\spad{g}} is a \\spad{gcd} of \\axiom{a} and \\axiom{\\spad{b}} in \\axiom{\\spad{R^}(\\spad{-1}) \\spad{P}} and \\axiom{\\spad{g} = ca * a + \\spad{cb} * \\spad{b}}")) (|lastSubResultant| (($ $ $) "\\axiom{lastSubResultant(a,{}\\spad{b})} returns \\axiom{resultant(a,{}\\spad{b})} if \\axiom{a} and \\axiom{\\spad{b}} has no non-trivial \\spad{gcd} in \\axiom{\\spad{R^}(\\spad{-1}) \\spad{P}} otherwise the non-zero sub-resultant with smallest index.")) (|subResultantsChain| (((|List| $) $ $) "\\axiom{subResultantsChain(a,{}\\spad{b})} returns the list of the non-zero sub-resultants of \\axiom{a} and \\axiom{\\spad{b}} sorted by increasing degree.")) (|lazyPseudoQuotient| (($ $ $) "\\axiom{lazyPseudoQuotient(a,{}\\spad{b})} returns \\axiom{\\spad{q}} if \\axiom{lazyPseudoDivide(a,{}\\spad{b})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]}")) (|lazyPseudoDivide| (((|Record| (|:| |coef| |#1|) (|:| |gap| (|NonNegativeInteger|)) (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\axiom{lazyPseudoDivide(a,{}\\spad{b})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]} such that \\axiom{\\spad{c^n} * a = \\spad{q*b} \\spad{+r}} and \\axiom{lazyResidueClass(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}\\spad{c},{}\\spad{n}]} where \\axiom{\\spad{n} + \\spad{g} = max(0,{} degree(\\spad{b}) - degree(a) + 1)}.")) (|lazyPseudoRemainder| (($ $ $) "\\axiom{lazyPseudoRemainder(a,{}\\spad{b})} returns \\axiom{\\spad{r}} if \\axiom{lazyResidueClass(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}\\spad{c},{}\\spad{n}]}. This lazy pseudo-remainder is computed by means of the \\axiomOpFrom{fmecg}{NewSparseUnivariatePolynomial} operation.")) (|lazyResidueClass| (((|Record| (|:| |polnum| $) (|:| |polden| |#1|) (|:| |power| (|NonNegativeInteger|))) $ $) "\\axiom{lazyResidueClass(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}\\spad{c},{}\\spad{n}]} such that \\axiom{\\spad{r}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{b}} and \\axiom{\\spad{b}} divides \\axiom{\\spad{c^n} * a - \\spad{r}} where \\axiom{\\spad{c}} is \\axiom{leadingCoefficient(\\spad{b})} and \\axiom{\\spad{n}} is as small as possible with the previous properties.")) (|monicModulo| (($ $ $) "\\axiom{monicModulo(a,{}\\spad{b})} returns \\axiom{\\spad{r}} such that \\axiom{\\spad{r}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{b}} and \\axiom{\\spad{b}} divides \\axiom{a \\spad{-r}} where \\axiom{\\spad{b}} is monic.")) (|fmecg| (($ $ (|NonNegativeInteger|) |#1| $) "\\axiom{fmecg(\\spad{p1},{}\\spad{e},{}\\spad{r},{}\\spad{p2})} returns \\axiom{\\spad{p1} - \\spad{r} * X**e * \\spad{p2}} where \\axiom{\\spad{X}} is \\axiom{monomial(1,{}1)}"))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4365 |has| |#1| (-357)) (-4367 |has| |#1| (-6 -4367)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#1| (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-1130))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (QUOTE (-228))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) +((|HasCategory| |#1| (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-1130))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-228))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) (-769 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 -401) (QUOTE (-553)))))) (-770 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 \\spad{gcd} over} \\indented{5}{algebraic towers of simple extensions\" In proceedings of 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.}"))) -((-4370 . T) (-4369 . T) (-4284 . T)) +((-4370 . T) (-4369 . T)) NIL (-771 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}."))) @@ -3064,23 +3064,23 @@ NIL ((|constructor| (NIL "OctonionCategory gives the categorial frame for the octonions,{} and eight-dimensional non-associative algebra,{} doubling the the quaternions in the same way as doubling the Complex numbers to get the quaternions.")) (|inv| (($ $) "\\spad{inv(o)} returns the inverse of \\spad{o} if it exists.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(o)} returns the real part if all seven imaginary parts are 0,{} and \"failed\" otherwise.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(o)} returns the real part if all seven imaginary parts are 0. Error: if \\spad{o} is not rational.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(o)} tests if \\spad{o} is rational,{} \\spadignore{i.e.} that all seven imaginary parts are 0.")) (|abs| ((|#1| $) "\\spad{abs(o)} computes the absolute value of an octonion,{} equal to the square root of the \\spadfunFrom{norm}{Octonion}.")) (|octon| (($ |#1| |#1| |#1| |#1| |#1| |#1| |#1| |#1|) "\\spad{octon(re,{}\\spad{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}."))) ((-4363 . T) (-4364 . T) (-4366 . T)) NIL -(-784 -4028 R OS S) +(-784 -3988 R OS S) ((|constructor| (NIL "OctonionCategoryFunctions2 implements functions between two octonion domains defined over different rings. The function map is used to coerce between octonion types.")) (|map| ((|#3| (|Mapping| |#4| |#2|) |#1|) "\\spad{map(f,{}u)} maps \\spad{f} onto the component parts of the octonion \\spad{u}."))) NIL NIL (-785 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}."))) ((-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -280) (|devaluate| |#1|) (|devaluate| |#1|))) (-4028 (|HasCategory| (-981 |#1|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (-4028 (|HasCategory| (-981 |#1|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-1040))) (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| (-981 |#1|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-981 |#1|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) +((|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -280) (|devaluate| |#1|) (|devaluate| |#1|))) (-3988 (|HasCategory| (-981 |#1|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (-3988 (|HasCategory| (-981 |#1|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-1040))) (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| (-981 |#1|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-981 |#1|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) (-786) ((|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 -(-787 R -3219 L) +(-787 R -3105 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{\\spad{yi}}\\spad{'s} form a basis for the solutions of \\spad{op y = 0}."))) NIL NIL -(-788 R -3219) +(-788 R -3105) ((|constructor| (NIL "\\spad{ElementaryFunctionODESolver} provides the top-level functions for finding closed form solutions of ordinary differential equations and initial value problems.")) (|solve| (((|Union| |#2| "failed") |#2| (|BasicOperator|) (|Equation| |#2|) (|List| |#2|)) "\\spad{solve(eq,{} y,{} x = a,{} [y0,{}...,{}ym])} returns either the solution of the initial value problem \\spad{eq,{} y(a) = y0,{} y'(a) = y1,{}...} or \"failed\" if the solution cannot be found; error if the equation is not one linear ordinary or of the form \\spad{dy/dx = f(x,{}y)}.") (((|Union| |#2| "failed") (|Equation| |#2|) (|BasicOperator|) (|Equation| |#2|) (|List| |#2|)) "\\spad{solve(eq,{} y,{} x = a,{} [y0,{}...,{}ym])} returns either the solution of the initial value problem \\spad{eq,{} y(a) = y0,{} y'(a) = y1,{}...} or \"failed\" if the solution cannot be found; error if the equation is not one linear ordinary or of the form \\spad{dy/dx = f(x,{}y)}.") (((|Union| (|Record| (|:| |particular| |#2|) (|:| |basis| (|List| |#2|))) |#2| "failed") |#2| (|BasicOperator|) (|Symbol|)) "\\spad{solve(eq,{} y,{} x)} returns either a solution of the ordinary differential equation \\spad{eq} or \"failed\" if no non-trivial solution can be found; If the equation is linear ordinary,{} a solution is of the form \\spad{[h,{} [b1,{}...,{}bm]]} where \\spad{h} is a particular solution and and \\spad{[b1,{}...bm]} are linearly independent solutions of the associated homogenuous equation \\spad{f(x,{}y) = 0}; A full basis for the solutions of the homogenuous equation is not always returned,{} only the solutions which were found; If the equation is of the form {dy/dx = \\spad{f}(\\spad{x},{}\\spad{y})},{} a solution is of the form \\spad{h(x,{}y)} where \\spad{h(x,{}y) = c} is a first integral of the equation for any constant \\spad{c}.") (((|Union| (|Record| (|:| |particular| |#2|) (|:| |basis| (|List| |#2|))) |#2| "failed") (|Equation| |#2|) (|BasicOperator|) (|Symbol|)) "\\spad{solve(eq,{} y,{} x)} returns either a solution of the ordinary differential equation \\spad{eq} or \"failed\" if no non-trivial solution can be found; If the equation is linear ordinary,{} a solution is of the form \\spad{[h,{} [b1,{}...,{}bm]]} where \\spad{h} is a particular solution and \\spad{[b1,{}...bm]} are linearly independent solutions of the associated homogenuous equation \\spad{f(x,{}y) = 0}; A full basis for the solutions of the homogenuous equation is not always returned,{} only the solutions which were found; If the equation is of the form {dy/dx = \\spad{f}(\\spad{x},{}\\spad{y})},{} a solution is of the form \\spad{h(x,{}y)} where \\spad{h(x,{}y) = c} is a first integral of the equation for any constant \\spad{c}; error if the equation is not one of those 2 forms.") (((|Union| (|Record| (|:| |particular| (|Vector| |#2|)) (|:| |basis| (|List| (|Vector| |#2|)))) "failed") (|List| |#2|) (|List| (|BasicOperator|)) (|Symbol|)) "\\spad{solve([eq_1,{}...,{}eq_n],{} [y_1,{}...,{}y_n],{} x)} returns either \"failed\" or,{} if the equations form a fist order linear system,{} a solution of the form \\spad{[y_p,{} [b_1,{}...,{}b_n]]} where \\spad{h_p} is a particular solution and \\spad{[b_1,{}...b_m]} are linearly independent solutions of the associated homogenuous system. error if the equations do not form a first order linear system") (((|Union| (|Record| (|:| |particular| (|Vector| |#2|)) (|:| |basis| (|List| (|Vector| |#2|)))) "failed") (|List| (|Equation| |#2|)) (|List| (|BasicOperator|)) (|Symbol|)) "\\spad{solve([eq_1,{}...,{}eq_n],{} [y_1,{}...,{}y_n],{} x)} returns either \"failed\" or,{} if the equations form a fist order linear system,{} a solution of the form \\spad{[y_p,{} [b_1,{}...,{}b_n]]} where \\spad{h_p} is a particular solution and \\spad{[b_1,{}...b_m]} are linearly independent solutions of the associated homogenuous system. error if the equations do not form a first order linear system") (((|Union| (|List| (|Vector| |#2|)) "failed") (|Matrix| |#2|) (|Symbol|)) "\\spad{solve(m,{} x)} returns a basis for the solutions of \\spad{D y = m y}. \\spad{x} is the dependent variable.") (((|Union| (|Record| (|:| |particular| (|Vector| |#2|)) (|:| |basis| (|List| (|Vector| |#2|)))) "failed") (|Matrix| |#2|) (|Vector| |#2|) (|Symbol|)) "\\spad{solve(m,{} v,{} x)} returns \\spad{[v_p,{} [v_1,{}...,{}v_m]]} such that the solutions of the system \\spad{D y = m y + v} are \\spad{v_p + c_1 v_1 + ... + c_m v_m} where the \\spad{c_i's} are constants,{} and the \\spad{v_i's} form a basis for the solutions of \\spad{D y = m y}. \\spad{x} is the dependent variable."))) NIL NIL @@ -3088,7 +3088,7 @@ NIL ((|constructor| (NIL "\\axiom{ODEIntensityFunctionsTable()} provides a dynamic table and a set of functions to store details found out about sets of ODE\\spad{'s}.")) (|showIntensityFunctions| (((|Union| (|Record| (|:| |stiffness| (|Float|)) (|:| |stability| (|Float|)) (|:| |expense| (|Float|)) (|:| |accuracy| (|Float|)) (|:| |intermediateResults| (|Float|))) "failed") (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{showIntensityFunctions(k)} returns the entries in the table of intensity functions \\spad{k}.")) (|insert!| (($ (|Record| (|:| |key| (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |entry| (|Record| (|:| |stiffness| (|Float|)) (|:| |stability| (|Float|)) (|:| |expense| (|Float|)) (|:| |accuracy| (|Float|)) (|:| |intermediateResults| (|Float|)))))) "\\spad{insert!(r)} inserts an entry \\spad{r} into theIFTable")) (|iFTable| (($ (|List| (|Record| (|:| |key| (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |entry| (|Record| (|:| |stiffness| (|Float|)) (|:| |stability| (|Float|)) (|:| |expense| (|Float|)) (|:| |accuracy| (|Float|)) (|:| |intermediateResults| (|Float|))))))) "\\spad{iFTable(l)} creates an intensity-functions table from the elements of \\spad{l}.")) (|keys| (((|List| (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) $) "\\spad{keys(tab)} returns the list of keys of \\spad{f}")) (|clearTheIFTable| (((|Void|)) "\\spad{clearTheIFTable()} clears the current table of intensity functions.")) (|showTheIFTable| (($) "\\spad{showTheIFTable()} returns the current table of intensity functions."))) NIL NIL -(-790 R -3219) +(-790 R -3105) ((|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 @@ -3096,52 +3096,52 @@ NIL ((|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|)))) (|NumericalODEProblem|) (|RoutinesTable|)) "\\spad{measure(prob,{}R)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical ODE problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} listed in \\axiom{\\spad{R}} of \\axiom{category} \\axiomType{OrdinaryDifferentialEquationsSolverCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information. It predicts the likely most effective NAG numerical Library routine to solve the input set of ODEs by checking various attributes of the system of ODEs and calculating a measure of compatibility of each routine to these attributes.") (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|)))) (|NumericalODEProblem|)) "\\spad{measure(prob)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical ODE problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} of \\axiom{category} \\axiomType{OrdinaryDifferentialEquationsSolverCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information. It predicts the likely most effective NAG numerical Library routine to solve the input set of ODEs by checking various attributes of the system of ODEs and calculating a measure of compatibility of each routine to these attributes.")) (|solve| (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|)) (|Expression| (|Float|)) (|List| (|Float|)) (|Float|) (|Float|)) "\\spad{solve(f,{}xStart,{}xEnd,{}yInitial,{}G,{}intVals,{}epsabs,{}epsrel)} is a top level ANNA function to solve numerically a system of ordinary differential equations,{} \\axiom{\\spad{f}},{} \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}] from \\axiom{\\spad{xStart}} to \\axiom{\\spad{xEnd}} with the initial values for \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (\\axiom{\\spad{yInitial}}) to an absolute error requirement \\axiom{\\spad{epsabs}} and relative error \\axiom{\\spad{epsrel}}. The values of \\spad{Y}[1]..\\spad{Y}[\\spad{n}] will be output for the values of \\spad{X} in \\axiom{\\spad{intVals}}. The calculation will stop if the function \\spad{G}(\\spad{X},{}\\spad{Y}[1],{}..,{}\\spad{Y}[\\spad{n}]) evaluates to zero before \\spad{X} = \\spad{xEnd}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|)) (|Expression| (|Float|)) (|List| (|Float|)) (|Float|)) "\\spad{solve(f,{}xStart,{}xEnd,{}yInitial,{}G,{}intVals,{}tol)} is a top level ANNA function to solve numerically a system of ordinary differential equations,{} \\axiom{\\spad{f}},{} \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}] from \\axiom{\\spad{xStart}} to \\axiom{\\spad{xEnd}} with the initial values for \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (\\axiom{\\spad{yInitial}}) to a tolerance \\axiom{\\spad{tol}}. The values of \\spad{Y}[1]..\\spad{Y}[\\spad{n}] will be output for the values of \\spad{X} in \\axiom{\\spad{intVals}}. The calculation will stop if the function \\spad{G}(\\spad{X},{}\\spad{Y}[1],{}..,{}\\spad{Y}[\\spad{n}]) evaluates to zero before \\spad{X} = \\spad{xEnd}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|)) (|List| (|Float|)) (|Float|)) "\\spad{solve(f,{}xStart,{}xEnd,{}yInitial,{}intVals,{}tol)} is a top level ANNA function to solve numerically a system of ordinary differential equations,{} \\axiom{\\spad{f}},{} \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}] from \\axiom{\\spad{xStart}} to \\axiom{\\spad{xEnd}} with the initial values for \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (\\axiom{\\spad{yInitial}}) to a tolerance \\axiom{\\spad{tol}}. The values of \\spad{Y}[1]..\\spad{Y}[\\spad{n}] will be output for the values of \\spad{X} in \\axiom{\\spad{intVals}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|)) (|Expression| (|Float|)) (|Float|)) "\\spad{solve(f,{}xStart,{}xEnd,{}yInitial,{}G,{}tol)} is a top level ANNA function to solve numerically a system of ordinary differential equations,{} \\axiom{\\spad{f}},{} \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}] from \\axiom{\\spad{xStart}} to \\axiom{\\spad{xEnd}} with the initial values for \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (\\axiom{\\spad{yInitial}}) to a tolerance \\axiom{\\spad{tol}}. The calculation will stop if the function \\spad{G}(\\spad{X},{}\\spad{Y}[1],{}..,{}\\spad{Y}[\\spad{n}]) evaluates to zero before \\spad{X} = \\spad{xEnd}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|)) (|Float|)) "\\spad{solve(f,{}xStart,{}xEnd,{}yInitial,{}tol)} is a top level ANNA function to solve numerically a system of ordinary differential equations,{} \\axiom{\\spad{f}},{} \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}] from \\axiom{\\spad{xStart}} to \\axiom{\\spad{xEnd}} with the initial values for \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (\\axiom{\\spad{yInitial}}) to a tolerance \\axiom{\\spad{tol}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|))) "\\spad{solve(f,{}xStart,{}xEnd,{}yInitial)} is a top level ANNA function to solve numerically a system of ordinary differential equations \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}],{} together with a starting value for \\spad{X} and \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (called the initial conditions) and a final value of \\spad{X}. A default value is used for the accuracy requirement. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|NumericalODEProblem|) (|RoutinesTable|)) "\\spad{solve(odeProblem,{}R)} is a top level ANNA function to solve numerically a system of ordinary differential equations \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}],{} together with starting values for \\spad{X} and \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (called the initial conditions),{} a final value of \\spad{X},{} an accuracy requirement and any intermediate points at which the result is required. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|NumericalODEProblem|)) "\\spad{solve(odeProblem)} is a top level ANNA function to solve numerically a system of ordinary differential equations \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}],{} together with starting values for \\spad{X} and \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (called the initial conditions),{} a final value of \\spad{X},{} an accuracy requirement and any intermediate points at which the result is required. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine."))) NIL NIL -(-792 -3219 UP UPUP R) +(-792 -3105 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 -(-793 -3219 UP L LQ) +(-793 -3105 UP L LQ) ((|constructor| (NIL "\\spad{PrimitiveRatDE} provides functions for in-field solutions of linear \\indented{1}{ordinary differential equations,{} in the transcendental case.} \\indented{1}{The derivation to use is given by the parameter \\spad{L}.}")) (|splitDenominator| (((|Record| (|:| |eq| |#3|) (|:| |rh| (|List| (|Fraction| |#2|)))) |#4| (|List| (|Fraction| |#2|))) "\\spad{splitDenominator(op,{} [g1,{}...,{}gm])} returns \\spad{op0,{} [h1,{}...,{}hm]} such that the equations \\spad{op y = c1 g1 + ... + cm gm} and \\spad{op0 y = c1 h1 + ... + cm hm} have the same solutions.")) (|indicialEquation| ((|#2| |#4| |#1|) "\\spad{indicialEquation(op,{} a)} returns the indicial equation of \\spad{op} at \\spad{a}.") ((|#2| |#3| |#1|) "\\spad{indicialEquation(op,{} a)} returns the indicial equation of \\spad{op} at \\spad{a}.")) (|indicialEquations| (((|List| (|Record| (|:| |center| |#2|) (|:| |equation| |#2|))) |#4| |#2|) "\\spad{indicialEquations(op,{} p)} returns \\spad{[[d1,{}e1],{}...,{}[dq,{}eq]]} where the \\spad{d_i}\\spad{'s} are the affine singularities of \\spad{op} above the roots of \\spad{p},{} and the \\spad{e_i}\\spad{'s} are the indicial equations at each \\spad{d_i}.") (((|List| (|Record| (|:| |center| |#2|) (|:| |equation| |#2|))) |#4|) "\\spad{indicialEquations op} returns \\spad{[[d1,{}e1],{}...,{}[dq,{}eq]]} where the \\spad{d_i}\\spad{'s} are the affine singularities of \\spad{op},{} and the \\spad{e_i}\\spad{'s} are the indicial equations at each \\spad{d_i}.") (((|List| (|Record| (|:| |center| |#2|) (|:| |equation| |#2|))) |#3| |#2|) "\\spad{indicialEquations(op,{} p)} returns \\spad{[[d1,{}e1],{}...,{}[dq,{}eq]]} where the \\spad{d_i}\\spad{'s} are the affine singularities of \\spad{op} above the roots of \\spad{p},{} and the \\spad{e_i}\\spad{'s} are the indicial equations at each \\spad{d_i}.") (((|List| (|Record| (|:| |center| |#2|) (|:| |equation| |#2|))) |#3|) "\\spad{indicialEquations op} returns \\spad{[[d1,{}e1],{}...,{}[dq,{}eq]]} where the \\spad{d_i}\\spad{'s} are the affine singularities of \\spad{op},{} and the \\spad{e_i}\\spad{'s} are the indicial equations at each \\spad{d_i}.")) (|denomLODE| ((|#2| |#3| (|List| (|Fraction| |#2|))) "\\spad{denomLODE(op,{} [g1,{}...,{}gm])} returns a polynomial \\spad{d} such that any rational solution of \\spad{op y = c1 g1 + ... + cm gm} is of the form \\spad{p/d} for some polynomial \\spad{p}.") (((|Union| |#2| "failed") |#3| (|Fraction| |#2|)) "\\spad{denomLODE(op,{} g)} returns a polynomial \\spad{d} such that any rational solution of \\spad{op y = g} is of the form \\spad{p/d} for some polynomial \\spad{p},{} and \"failed\",{} if the equation has no rational solution."))) NIL NIL (-794) -((|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| (((|OutputForm|) $) "\\spad{coerce(x)} \\undocumented{}") (($ (|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{}"))) +((|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 -(-795 -3219 UP L LQ) +(-795 -3105 UP L LQ) ((|constructor| (NIL "In-field solution of Riccati equations,{} primitive case.")) (|changeVar| ((|#3| |#3| (|Fraction| |#2|)) "\\spad{changeVar(+/[\\spad{ai} D^i],{} a)} returns the operator \\spad{+/[\\spad{ai} (D+a)\\spad{^i}]}.") ((|#3| |#3| |#2|) "\\spad{changeVar(+/[\\spad{ai} D^i],{} a)} returns the operator \\spad{+/[\\spad{ai} (D+a)\\spad{^i}]}.")) (|singRicDE| (((|List| (|Record| (|:| |frac| (|Fraction| |#2|)) (|:| |eq| |#3|))) |#3| (|Mapping| (|List| |#2|) |#2| (|SparseUnivariatePolynomial| |#2|)) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{singRicDE(op,{} zeros,{} ezfactor)} returns \\spad{[[f1,{} L1],{} [f2,{} L2],{} ... ,{} [fk,{} Lk]]} such that the singular part of any rational solution of the associated Riccati equation of \\spad{op y=0} must be one of the \\spad{fi}\\spad{'s} (up to the constant coefficient),{} in which case the equation for \\spad{z=y e^{-int p}} is \\spad{\\spad{Li} z=0}. \\spad{zeros(C(x),{}H(x,{}y))} returns all the \\spad{P_i(x)}\\spad{'s} such that \\spad{H(x,{}P_i(x)) = 0 modulo C(x)}. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.")) (|polyRicDE| (((|List| (|Record| (|:| |poly| |#2|) (|:| |eq| |#3|))) |#3| (|Mapping| (|List| |#1|) |#2|)) "\\spad{polyRicDE(op,{} zeros)} returns \\spad{[[p1,{} L1],{} [p2,{} L2],{} ... ,{} [pk,{} Lk]]} such that the polynomial part of any rational solution of the associated Riccati equation of \\spad{op y=0} must be one of the \\spad{pi}\\spad{'s} (up to the constant coefficient),{} in which case the equation for \\spad{z=y e^{-int p}} is \\spad{\\spad{Li} z =0}. \\spad{zeros} is a zero finder in \\spad{UP}.")) (|constantCoefficientRicDE| (((|List| (|Record| (|:| |constant| |#1|) (|:| |eq| |#3|))) |#3| (|Mapping| (|List| |#1|) |#2|)) "\\spad{constantCoefficientRicDE(op,{} ric)} returns \\spad{[[a1,{} L1],{} [a2,{} L2],{} ... ,{} [ak,{} Lk]]} such that any rational solution with no polynomial part of the associated Riccati equation of \\spad{op y = 0} must be one of the \\spad{ai}\\spad{'s} in which case the equation for \\spad{z = y e^{-int \\spad{ai}}} is \\spad{\\spad{Li} z = 0}. \\spad{ric} is a Riccati equation solver over \\spad{F},{} whose input is the associated linear equation.")) (|leadingCoefficientRicDE| (((|List| (|Record| (|:| |deg| (|NonNegativeInteger|)) (|:| |eq| |#2|))) |#3|) "\\spad{leadingCoefficientRicDE(op)} returns \\spad{[[m1,{} p1],{} [m2,{} p2],{} ... ,{} [mk,{} pk]]} such that the polynomial part of any rational solution of the associated Riccati equation of \\spad{op y = 0} must have degree \\spad{mj} for some \\spad{j},{} and its leading coefficient is then a zero of \\spad{pj}. In addition,{}\\spad{m1>m2> ... >mk}.")) (|denomRicDE| ((|#2| |#3|) "\\spad{denomRicDE(op)} returns a polynomial \\spad{d} such that any rational solution of the associated Riccati equation of \\spad{op y = 0} is of the form \\spad{p/d + q'/q + r} for some polynomials \\spad{p} and \\spad{q} and a reduced \\spad{r}. Also,{} \\spad{deg(p) < deg(d)} and {\\spad{gcd}(\\spad{d},{}\\spad{q}) = 1}."))) NIL NIL -(-796 -3219 UP) +(-796 -3105 UP) ((|constructor| (NIL "\\spad{RationalLODE} provides functions for in-field solutions of linear \\indented{1}{ordinary differential equations,{} in the rational case.}")) (|indicialEquationAtInfinity| ((|#2| (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|))) "\\spad{indicialEquationAtInfinity op} returns the indicial equation of \\spad{op} at infinity.") ((|#2| (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) "\\spad{indicialEquationAtInfinity op} returns the indicial equation of \\spad{op} at infinity.")) (|ratDsolve| (((|Record| (|:| |basis| (|List| (|Fraction| |#2|))) (|:| |mat| (|Matrix| |#1|))) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|List| (|Fraction| |#2|))) "\\spad{ratDsolve(op,{} [g1,{}...,{}gm])} returns \\spad{[[h1,{}...,{}hq],{} M]} such that any rational solution of \\spad{op y = c1 g1 + ... + cm gm} is of the form \\spad{d1 h1 + ... + dq hq} where \\spad{M [d1,{}...,{}dq,{}c1,{}...,{}cm] = 0}.") (((|Record| (|:| |particular| (|Union| (|Fraction| |#2|) "failed")) (|:| |basis| (|List| (|Fraction| |#2|)))) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|Fraction| |#2|)) "\\spad{ratDsolve(op,{} g)} returns \\spad{[\"failed\",{} []]} if the equation \\spad{op y = g} has no rational solution. Otherwise,{} it returns \\spad{[f,{} [y1,{}...,{}ym]]} where \\spad{f} is a particular rational solution and the \\spad{yi}\\spad{'s} form a basis for the rational solutions of the homogeneous equation.") (((|Record| (|:| |basis| (|List| (|Fraction| |#2|))) (|:| |mat| (|Matrix| |#1|))) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|)) (|List| (|Fraction| |#2|))) "\\spad{ratDsolve(op,{} [g1,{}...,{}gm])} returns \\spad{[[h1,{}...,{}hq],{} M]} such that any rational solution of \\spad{op y = c1 g1 + ... + cm gm} is of the form \\spad{d1 h1 + ... + dq hq} where \\spad{M [d1,{}...,{}dq,{}c1,{}...,{}cm] = 0}.") (((|Record| (|:| |particular| (|Union| (|Fraction| |#2|) "failed")) (|:| |basis| (|List| (|Fraction| |#2|)))) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|)) (|Fraction| |#2|)) "\\spad{ratDsolve(op,{} g)} returns \\spad{[\"failed\",{} []]} if the equation \\spad{op y = g} has no rational solution. Otherwise,{} it returns \\spad{[f,{} [y1,{}...,{}ym]]} where \\spad{f} is a particular rational solution and the \\spad{yi}\\spad{'s} form a basis for the rational solutions of the homogeneous equation."))) NIL NIL -(-797 -3219 L UP A LO) +(-797 -3105 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 -(-798 -3219 UP) +(-798 -3105 UP) ((|constructor| (NIL "In-field solution of Riccati equations,{} rational case.")) (|polyRicDE| (((|List| (|Record| (|:| |poly| |#2|) (|:| |eq| (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|))))) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|Mapping| (|List| |#1|) |#2|)) "\\spad{polyRicDE(op,{} zeros)} returns \\spad{[[p1,{} L1],{} [p2,{} L2],{} ... ,{} [pk,{}Lk]]} such that the polynomial part of any rational solution of the associated Riccati equation of \\spad{op y = 0} must be one of the \\spad{pi}\\spad{'s} (up to the constant coefficient),{} in which case the equation for \\spad{z = y e^{-int p}} is \\spad{\\spad{Li} z = 0}. \\spad{zeros} is a zero finder in \\spad{UP}.")) (|singRicDE| (((|List| (|Record| (|:| |frac| (|Fraction| |#2|)) (|:| |eq| (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|))))) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{singRicDE(op,{} ezfactor)} returns \\spad{[[f1,{}L1],{} [f2,{}L2],{}...,{} [fk,{}Lk]]} such that the singular \\spad{++} part of any rational solution of the associated Riccati equation of \\spad{op y = 0} must be one of the \\spad{fi}\\spad{'s} (up to the constant coefficient),{} in which case the equation for \\spad{z = y e^{-int \\spad{ai}}} is \\spad{\\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)))) -(-799 -3219 LO) +(-799 -3105 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 -(-800 -3219 LODO) +(-800 -3105 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(\\spad{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(\\spad{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 -(-801 -2073 S |f|) +(-801 -2026 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}."))) ((-4363 |has| |#2| (-1031)) (-4364 |has| |#2| (-1031)) (-4366 |has| |#2| (-6 -4366)) ((-4371 "*") |has| |#2| (-169)) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))))) (-4028 (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079)))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (QUOTE (-357))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-357)))) (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (QUOTE (-779))) (-4028 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-831)))) (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-169))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-1031)))) (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (QUOTE (-1079)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-129)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-169)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-228)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-362)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-712)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-779)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-831)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079))))) (-4028 (-12 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| (-553) (QUOTE (-833))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-4028 (|HasCategory| |#2| (QUOTE (-1031))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079)))) (|HasAttribute| |#2| (QUOTE -4366)) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-25))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))))) (-3988 (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079)))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (QUOTE (-357))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-357)))) (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (QUOTE (-779))) (-3988 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-831)))) (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-169))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-1031)))) (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (QUOTE (-1079)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1031)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-129)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-169)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-228)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-362)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-712)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-779)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-831)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079))))) (-3988 (-12 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1031))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-3988 (-12 (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-779))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-831))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| (-553) (QUOTE (-833))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (QUOTE (-1031)))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155))))) (-3988 (|HasCategory| |#2| (QUOTE (-1031))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-1079)))) (|HasAttribute| |#2| (QUOTE -4366)) (|HasCategory| |#2| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))))) (-802 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"))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-6 -4367)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#1| (QUOTE (-891))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-804 (-1155)) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-804 (-1155)) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-804 (-1155)) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-804 (-1155)) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-804 (-1155)) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) +((|HasCategory| |#1| (QUOTE (-891))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-804 (-1155)) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-804 (-1155)) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-804 (-1155)) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-804 (-1155)) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-804 (-1155)) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) (-803 |Kernels| R |var|) -((|constructor| (NIL "This constructor produces an ordinary differential ring from a partial differential ring by specifying a variable.")) (|coerce| ((|#2| $) "\\spad{coerce(p)} views \\spad{p} as a valie in the partial differential ring.") (($ |#2|) "\\spad{coerce(r)} views \\spad{r} as a value in the ordinary differential ring."))) +((|constructor| (NIL "This constructor produces an ordinary differential ring from a partial differential ring by specifying a variable."))) (((-4371 "*") |has| |#2| (-357)) (-4362 |has| |#2| (-357)) (-4367 |has| |#2| (-357)) (-4361 |has| |#2| (-357)) (-4366 . T) (-4364 . T) (-4363 . T)) ((|HasCategory| |#2| (QUOTE (-357)))) (-804 S) @@ -3194,7 +3194,7 @@ NIL NIL (-816 S) ((|constructor| (NIL "to become an in order iterator")) (|min| ((|#1| $) "\\spad{min(u)} returns the smallest entry in the multiset aggregate \\spad{u}."))) -((-4369 . T) (-4359 . T) (-4370 . T) (-4284 . T)) +((-4369 . T) (-4359 . T) (-4370 . T)) NIL (-817) ((|constructor| (NIL "\\spadtype{OpenMathServerPackage} provides the necessary operations to run AXIOM as an OpenMath server,{} reading/writing objects to/from a port. Please note the facilities available here are very basic. The idea is that a user calls \\spadignore{e.g.} \\axiom{Omserve(4000,{}60)} and then another process sends OpenMath objects to port 4000 and reads the result.")) (|OMserve| (((|Void|) (|SingleInteger|) (|SingleInteger|)) "\\spad{OMserve(portnum,{}timeout)} puts AXIOM into server mode on port number \\axiom{\\spad{portnum}}. The parameter \\axiom{\\spad{timeout}} specifies the \\spad{timeout} period for the connection.")) (|OMsend| (((|Void|) (|OpenMathConnection|) (|Any|)) "\\spad{OMsend(c,{}u)} attempts to output \\axiom{\\spad{u}} on \\aciom{\\spad{c}} in OpenMath.")) (|OMreceive| (((|Any|) (|OpenMathConnection|)) "\\spad{OMreceive(c)} reads an OpenMath object from connection \\axiom{\\spad{c}} and returns the appropriate AXIOM object."))) @@ -3207,7 +3207,7 @@ NIL (-819 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."))) ((-4366 |has| |#1| (-831))) -((|HasCategory| |#1| (QUOTE (-831))) (-4028 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-831)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-538))) (-4028 (|HasCategory| |#1| (QUOTE (-831))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-21)))) +((|HasCategory| |#1| (QUOTE (-831))) (-3988 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-831)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (-3988 (|HasCategory| |#1| (QUOTE (-831))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-21)))) (-820 R) ((|constructor| (NIL "Algebra of ADDITIVE operators over a ring."))) ((-4364 |has| |#1| (-169)) (-4363 |has| |#1| (-169)) (-4366 . T)) @@ -3225,7 +3225,7 @@ NIL NIL NIL (-824) -((|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| (((|OutputForm|) $) "\\spad{coerce(x)} \\undocumented{}") (($ (|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{}"))) +((|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 (-825 R S) @@ -3235,12 +3235,12 @@ NIL (-826 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."))) ((-4366 |has| |#1| (-831))) -((|HasCategory| |#1| (QUOTE (-831))) (-4028 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-831)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-538))) (-4028 (|HasCategory| |#1| (QUOTE (-831))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-21)))) +((|HasCategory| |#1| (QUOTE (-831))) (-3988 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-831)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (-3988 (|HasCategory| |#1| (QUOTE (-831))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-21)))) (-827) ((|constructor| (NIL "Ordered finite sets."))) NIL NIL -(-828 -2073 S) +(-828 -2026 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 @@ -3276,12 +3276,12 @@ NIL ((|constructor| (NIL "\\spad{UnivariateSkewPolynomialCategoryOps} provides products and \\indented{1}{divisions of univariate skew polynomials.}")) (|rightDivide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2| (|Automorphism| |#1|)) "\\spad{rightDivide(a,{} b,{} sigma)} returns the pair \\spad{[q,{}r]} such that \\spad{a = q*b + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. This process is called ``right division\\spad{''}. \\spad{\\sigma} is the morphism to use.")) (|leftDivide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2| (|Automorphism| |#1|)) "\\spad{leftDivide(a,{} b,{} sigma)} returns the pair \\spad{[q,{}r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. This process is called ``left division\\spad{''}. \\spad{\\sigma} is the morphism to use.")) (|monicRightDivide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2| (|Automorphism| |#1|)) "\\spad{monicRightDivide(a,{} b,{} sigma)} returns the pair \\spad{[q,{}r]} such that \\spad{a = q*b + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. \\spad{b} must be monic. This process is called ``right division\\spad{''}. \\spad{\\sigma} is the morphism to use.")) (|monicLeftDivide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2| (|Automorphism| |#1|)) "\\spad{monicLeftDivide(a,{} b,{} sigma)} returns the pair \\spad{[q,{}r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. \\spad{b} must be monic. This process is called ``left division\\spad{''}. \\spad{\\sigma} is the morphism to use.")) (|apply| ((|#1| |#2| |#1| |#1| (|Automorphism| |#1|) (|Mapping| |#1| |#1|)) "\\spad{apply(p,{} c,{} m,{} sigma,{} delta)} returns \\spad{p(m)} where the action is given by \\spad{x m = c sigma(m) + delta(m)}.")) (|times| ((|#2| |#2| |#2| (|Automorphism| |#1|) (|Mapping| |#1| |#1|)) "\\spad{times(p,{} q,{} sigma,{} delta)} returns \\spad{p * q}. \\spad{\\sigma} and \\spad{\\delta} are the maps to use."))) NIL ((|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) -(-837 R |sigma| -2695) +(-837 R |sigma| -2245) ((|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."))) ((-4363 . T) (-4364 . T) (-4366 . T)) ((|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-357)))) -(-838 |x| R |sigma| -2695) -((|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}.")) (|coerce| (($ (|Variable| |#1|)) "\\spad{coerce(x)} returns \\spad{x} as a skew-polynomial."))) +(-838 |x| R |sigma| -2245) +((|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}."))) ((-4363 . T) (-4364 . T) (-4366 . T)) ((|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-357)))) (-839 R) @@ -3321,7 +3321,7 @@ NIL NIL NIL (-848 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: \\spad{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)")) (|coerce| (($ (|Polynomial| |#1|)) "\\spad{coerce(p)} coerces a Polynomial(\\spad{R}) into Weighted form,{} applying weights and ignoring terms") (((|Polynomial| |#1|) $) "\\spad{coerce(p)} converts back into a Polynomial(\\spad{R}),{} ignoring weights"))) +((|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: \\spad{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)"))) ((-4364 |has| |#1| (-169)) (-4363 |has| |#1| (-169)) (-4366 . T)) ((|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357)))) (-849 R PS UP) @@ -3343,15 +3343,15 @@ NIL (-853 |p|) ((|constructor| (NIL "Stream-based implementation of \\spad{Qp:} numbers are represented as sum(\\spad{i} = \\spad{k}..,{} a[\\spad{i}] * p^i) where the a[\\spad{i}] lie in 0,{}1,{}...,{}(\\spad{p} - 1)."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| (-852 |#1|) (QUOTE (-891))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| (-852 |#1|) (QUOTE (-142))) (|HasCategory| (-852 |#1|) (QUOTE (-144))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-852 |#1|) (QUOTE (-1004))) (|HasCategory| (-852 |#1|) (QUOTE (-806))) (-4028 (|HasCategory| (-852 |#1|) (QUOTE (-806))) (|HasCategory| (-852 |#1|) (QUOTE (-833)))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-852 |#1|) (QUOTE (-1130))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| (-852 |#1|) (QUOTE (-228))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -507) (QUOTE (-1155)) (LIST (QUOTE -852) (|devaluate| |#1|)))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -303) (LIST (QUOTE -852) (|devaluate| |#1|)))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -280) (LIST (QUOTE -852) (|devaluate| |#1|)) (LIST (QUOTE -852) (|devaluate| |#1|)))) (|HasCategory| (-852 |#1|) (QUOTE (-301))) (|HasCategory| (-852 |#1|) (QUOTE (-538))) (|HasCategory| (-852 |#1|) (QUOTE (-833))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-852 |#1|) (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-852 |#1|) (QUOTE (-891)))) (|HasCategory| (-852 |#1|) (QUOTE (-142))))) +((|HasCategory| (-852 |#1|) (QUOTE (-891))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| (-852 |#1|) (QUOTE (-142))) (|HasCategory| (-852 |#1|) (QUOTE (-144))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-852 |#1|) (QUOTE (-1004))) (|HasCategory| (-852 |#1|) (QUOTE (-806))) (-3988 (|HasCategory| (-852 |#1|) (QUOTE (-806))) (|HasCategory| (-852 |#1|) (QUOTE (-833)))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-852 |#1|) (QUOTE (-1130))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| (-852 |#1|) (QUOTE (-228))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -507) (QUOTE (-1155)) (LIST (QUOTE -852) (|devaluate| |#1|)))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -303) (LIST (QUOTE -852) (|devaluate| |#1|)))) (|HasCategory| (-852 |#1|) (LIST (QUOTE -280) (LIST (QUOTE -852) (|devaluate| |#1|)) (LIST (QUOTE -852) (|devaluate| |#1|)))) (|HasCategory| (-852 |#1|) (QUOTE (-301))) (|HasCategory| (-852 |#1|) (QUOTE (-538))) (|HasCategory| (-852 |#1|) (QUOTE (-833))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-852 |#1|) (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-852 |#1|) (QUOTE (-891)))) (|HasCategory| (-852 |#1|) (QUOTE (-142))))) (-854 |p| PADIC) ((|constructor| (NIL "This is the category of stream-based representations of \\spad{Qp}.")) (|removeZeroes| (($ (|Integer|) $) "\\spad{removeZeroes(n,{}x)} removes up to \\spad{n} leading zeroes from the \\spad{p}-adic rational \\spad{x}.") (($ $) "\\spad{removeZeroes(x)} removes leading zeroes from the representation of the \\spad{p}-adic rational \\spad{x}. A \\spad{p}-adic rational is represented by (1) an exponent and (2) a \\spad{p}-adic integer which may have leading zero digits. When the \\spad{p}-adic integer has a leading zero digit,{} a 'leading zero' is removed from the \\spad{p}-adic rational as follows: the number is rewritten by increasing the exponent by 1 and dividing the \\spad{p}-adic integer by \\spad{p}. Note: \\spad{removeZeroes(f)} removes all leading zeroes from \\spad{f}.")) (|continuedFraction| (((|ContinuedFraction| (|Fraction| (|Integer|))) $) "\\spad{continuedFraction(x)} converts the \\spad{p}-adic rational number \\spad{x} to a continued fraction.")) (|approximate| (((|Fraction| (|Integer|)) $ (|Integer|)) "\\spad{approximate(x,{}n)} returns a rational number \\spad{y} such that \\spad{y = x (mod p^n)}."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#2| (QUOTE (-891))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (QUOTE (-1004))) (|HasCategory| |#2| (QUOTE (-806))) (-4028 (|HasCategory| |#2| (QUOTE (-806))) (|HasCategory| |#2| (QUOTE (-833)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-1130))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -280) (|devaluate| |#2|) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-301))) (|HasCategory| |#2| (QUOTE (-538))) (|HasCategory| |#2| (QUOTE (-833))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-142))))) +((|HasCategory| |#2| (QUOTE (-891))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (QUOTE (-1004))) (|HasCategory| |#2| (QUOTE (-806))) (-3988 (|HasCategory| |#2| (QUOTE (-806))) (|HasCategory| |#2| (QUOTE (-833)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-1130))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -280) (|devaluate| |#2|) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-301))) (|HasCategory| |#2| (QUOTE (-538))) (|HasCategory| |#2| (QUOTE (-833))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-142))))) (-855 S T$) ((|constructor| (NIL "\\indented{1}{This domain provides a very simple representation} of the notion of `pair of objects'. It does not try to achieve all possible imaginable things.")) (|second| ((|#2| $) "\\spad{second(p)} extracts the second components of \\spad{`p'}.")) (|first| ((|#1| $) "\\spad{first(p)} extracts the first component of \\spad{`p'}.")) (|construct| (($ |#1| |#2|) "\\spad{construct(s,{}t)} is same as pair(\\spad{s},{}\\spad{t}),{} with syntactic sugar.")) (|pair| (($ |#1| |#2|) "\\spad{pair(s,{}t)} returns a pair object composed of \\spad{`s'} and \\spad{`t'}."))) NIL -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))))) (-856) ((|constructor| (NIL "This domain describes four groups of color shades (palettes).")) (|coerce| (($ (|Color|)) "\\spad{coerce(c)} sets the average shade for the palette to that of the indicated color \\spad{c}.")) (|shade| (((|Integer|) $) "\\spad{shade(p)} returns the shade index of the indicated palette \\spad{p}.")) (|hue| (((|Color|) $) "\\spad{hue(p)} returns the hue field of the indicated palette \\spad{p}.")) (|light| (($ (|Color|)) "\\spad{light(c)} sets the shade of a hue,{} \\spad{c},{} to it\\spad{'s} highest value.")) (|pastel| (($ (|Color|)) "\\spad{pastel(c)} sets the shade of a hue,{} \\spad{c},{} above bright,{} but below light.")) (|bright| (($ (|Color|)) "\\spad{bright(c)} sets the shade of a hue,{} \\spad{c},{} above dim,{} but below pastel.")) (|dim| (($ (|Color|)) "\\spad{dim(c)} sets the shade of a hue,{} \\spad{c},{} above dark,{} but below bright.")) (|dark| (($ (|Color|)) "\\spad{dark(c)} sets the shade of the indicated hue of \\spad{c} to it\\spad{'s} lowest value."))) NIL @@ -3407,7 +3407,7 @@ NIL (-869 |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 (-4106 (|HasCategory| |#2| (QUOTE (-1031)))) (-4106 (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-1155)))))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (-4106 (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-1155)))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-1155))))) +((-12 (-2826 (|HasCategory| |#2| (QUOTE (-1031)))) (-2826 (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-1155)))))) (-12 (|HasCategory| |#2| (QUOTE (-1031))) (-2826 (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-1155)))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-1155))))) (-870 R A B) ((|constructor| (NIL "Lifts maps to pattern matching results.")) (|map| (((|PatternMatchResult| |#1| |#3|) (|Mapping| |#3| |#2|) (|PatternMatchResult| |#1| |#2|)) "\\spad{map(f,{} [(v1,{}a1),{}...,{}(vn,{}an)])} returns the matching result [(\\spad{v1},{}\\spad{f}(a1)),{}...,{}(\\spad{vn},{}\\spad{f}(an))]."))) NIL @@ -3416,7 +3416,7 @@ NIL ((|constructor| (NIL "A PatternMatchResult is an object internally returned by the pattern matcher; It is either a failed match,{} or a list of matches of the form (var,{} expr) meaning that the variable var matches the expression expr.")) (|satisfy?| (((|Union| (|Boolean|) "failed") $ (|Pattern| |#1|)) "\\spad{satisfy?(r,{} p)} returns \\spad{true} if the matches satisfy the top-level predicate of \\spad{p},{} \\spad{false} if they don\\spad{'t},{} and \"failed\" if not enough variables of \\spad{p} are matched in \\spad{r} to decide.")) (|construct| (($ (|List| (|Record| (|:| |key| (|Symbol|)) (|:| |entry| |#2|)))) "\\spad{construct([v1,{}e1],{}...,{}[vn,{}en])} returns the match result containing the matches (\\spad{v1},{}e1),{}...,{}(\\spad{vn},{}en).")) (|destruct| (((|List| (|Record| (|:| |key| (|Symbol|)) (|:| |entry| |#2|))) $) "\\spad{destruct(r)} returns the list of matches (var,{} expr) in \\spad{r}. Error: if \\spad{r} is a failed match.")) (|addMatchRestricted| (($ (|Pattern| |#1|) |#2| $ |#2|) "\\spad{addMatchRestricted(var,{} expr,{} r,{} val)} adds the match (\\spad{var},{} \\spad{expr}) in \\spad{r},{} provided that \\spad{expr} satisfies the predicates attached to \\spad{var},{} that \\spad{var} is not matched to another expression already,{} and that either \\spad{var} is an optional pattern variable or that \\spad{expr} is not equal to val (usually an identity).")) (|insertMatch| (($ (|Pattern| |#1|) |#2| $) "\\spad{insertMatch(var,{} expr,{} r)} adds the match (\\spad{var},{} \\spad{expr}) in \\spad{r},{} without checking predicates or previous matches for \\spad{var}.")) (|addMatch| (($ (|Pattern| |#1|) |#2| $) "\\spad{addMatch(var,{} expr,{} r)} adds the match (\\spad{var},{} \\spad{expr}) in \\spad{r},{} provided that \\spad{expr} satisfies the predicates attached to \\spad{var},{} and that \\spad{var} is not matched to another expression already.")) (|getMatch| (((|Union| |#2| "failed") (|Pattern| |#1|) $) "\\spad{getMatch(var,{} r)} returns the expression that \\spad{var} matches in the result \\spad{r},{} and \"failed\" if \\spad{var} is not matched in \\spad{r}.")) (|union| (($ $ $) "\\spad{union(a,{} b)} makes the set-union of two match results.")) (|new| (($) "\\spad{new()} returns a new empty match result.")) (|failed| (($) "\\spad{failed()} returns a failed match.")) (|failed?| (((|Boolean|) $) "\\spad{failed?(r)} tests if \\spad{r} is a failed match."))) NIL NIL -(-872 R -1766) +(-872 R -1780) ((|constructor| (NIL "Tools for patterns.")) (|badValues| (((|List| |#2|) (|Pattern| |#1|)) "\\spad{badValues(p)} returns the list of \"bad values\" for \\spad{p}; \\spad{p} is not allowed to match any of its \"bad values\".")) (|addBadValue| (((|Pattern| |#1|) (|Pattern| |#1|) |#2|) "\\spad{addBadValue(p,{} v)} adds \\spad{v} to the list of \"bad values\" for \\spad{p}; \\spad{p} is not allowed to match any of its \"bad values\".")) (|satisfy?| (((|Boolean|) (|List| |#2|) (|Pattern| |#1|)) "\\spad{satisfy?([v1,{}...,{}vn],{} p)} returns \\spad{f(v1,{}...,{}vn)} where \\spad{f} is the top-level predicate attached to \\spad{p}.") (((|Boolean|) |#2| (|Pattern| |#1|)) "\\spad{satisfy?(v,{} p)} returns \\spad{f}(\\spad{v}) where \\spad{f} is the predicate attached to \\spad{p}.")) (|predicate| (((|Mapping| (|Boolean|) |#2|) (|Pattern| |#1|)) "\\spad{predicate(p)} returns the predicate attached to \\spad{p},{} the constant function \\spad{true} if \\spad{p} has no predicates attached to it.")) (|suchThat| (((|Pattern| |#1|) (|Pattern| |#1|) (|List| (|Symbol|)) (|Mapping| (|Boolean|) (|List| |#2|))) "\\spad{suchThat(p,{} [a1,{}...,{}an],{} f)} returns a copy of \\spad{p} with the top-level predicate set to \\spad{f(a1,{}...,{}an)}.") (((|Pattern| |#1|) (|Pattern| |#1|) (|List| (|Mapping| (|Boolean|) |#2|))) "\\spad{suchThat(p,{} [f1,{}...,{}fn])} makes a copy of \\spad{p} and adds the predicate \\spad{f1} and ... and \\spad{fn} to the copy,{} which is returned.") (((|Pattern| |#1|) (|Pattern| |#1|) (|Mapping| (|Boolean|) |#2|)) "\\spad{suchThat(p,{} f)} makes a copy of \\spad{p} and adds the predicate \\spad{f} to the copy,{} which is returned."))) NIL NIL @@ -3440,7 +3440,7 @@ NIL ((|PDESolve| (((|Result|) (|Record| (|:| |pde| (|List| (|Expression| (|DoubleFloat|)))) (|:| |constraints| (|List| (|Record| (|:| |start| (|DoubleFloat|)) (|:| |finish| (|DoubleFloat|)) (|:| |grid| (|NonNegativeInteger|)) (|:| |boundaryType| (|Integer|)) (|:| |dStart| (|Matrix| (|DoubleFloat|))) (|:| |dFinish| (|Matrix| (|DoubleFloat|)))))) (|:| |f| (|List| (|List| (|Expression| (|DoubleFloat|))))) (|:| |st| (|String|)) (|:| |tol| (|DoubleFloat|)))) "\\spad{PDESolve(args)} performs the integration of the function given the strategy or method returned by \\axiomFun{measure}.")) (|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |explanations| (|String|))) (|RoutinesTable|) (|Record| (|:| |pde| (|List| (|Expression| (|DoubleFloat|)))) (|:| |constraints| (|List| (|Record| (|:| |start| (|DoubleFloat|)) (|:| |finish| (|DoubleFloat|)) (|:| |grid| (|NonNegativeInteger|)) (|:| |boundaryType| (|Integer|)) (|:| |dStart| (|Matrix| (|DoubleFloat|))) (|:| |dFinish| (|Matrix| (|DoubleFloat|)))))) (|:| |f| (|List| (|List| (|Expression| (|DoubleFloat|))))) (|:| |st| (|String|)) (|:| |tol| (|DoubleFloat|)))) "\\spad{measure(R,{}args)} calculates an estimate of the ability of a particular method to solve a problem. \\blankline This method may be either a specific NAG routine or a strategy (such as transforming the function from one which is difficult to one which is easier to solve). \\blankline It will call whichever agents are needed to perform analysis on the problem in order to calculate the measure. There is a parameter,{} labelled \\axiom{sofar},{} which would contain the best compatibility found so far."))) NIL NIL -(-878 UP -3219) +(-878 UP -3105) ((|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 @@ -3449,7 +3449,7 @@ NIL NIL NIL (-880) -((|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| (((|OutputForm|) $) "\\spad{coerce(x)} \\undocumented{}") (($ (|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{}"))) +((|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 (-881 A S) @@ -3461,9 +3461,9 @@ NIL ((-4366 . T)) NIL (-883 S) -((|constructor| (NIL "\\indented{1}{A PendantTree(\\spad{S})is either a leaf? and is an \\spad{S} or has} a left and a right both PendantTree(\\spad{S})\\spad{'s}")) (|coerce| (((|Tree| |#1|) $) "\\spad{coerce(x)} \\undocumented")) (|ptree| (($ $ $) "\\spad{ptree(x,{}y)} \\undocumented") (($ |#1|) "\\spad{ptree(s)} is a leaf? pendant tree"))) +((|constructor| (NIL "\\indented{1}{A PendantTree(\\spad{S})is either a leaf? and is an \\spad{S} or has} a left and a right both PendantTree(\\spad{S})\\spad{'s}")) (|ptree| (($ $ $) "\\spad{ptree(x,{}y)} \\undocumented") (($ |#1|) "\\spad{ptree(s)} is a leaf? pendant tree"))) NIL -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-884 |n| R) ((|constructor| (NIL "Permanent implements the functions {\\em permanent},{} the permanent for square matrices.")) (|permanent| ((|#2| (|SquareMatrix| |#1| |#2|)) "\\spad{permanent(x)} computes the permanent of a square matrix \\spad{x}. The {\\em permanent} is equivalent to the \\spadfun{determinant} except that coefficients have no change of sign. This function is much more difficult to compute than the {\\em determinant}. The formula used is by \\spad{H}.\\spad{J}. Ryser,{} improved by [Nijenhuis and Wilf,{} \\spad{Ch}. 19]. Note: permanent(\\spad{x}) choose one of three algorithms,{} depending on the underlying ring \\spad{R} and on \\spad{n},{} the number of rows (and columns) of \\spad{x:}\\begin{items} \\item 1. if 2 has an inverse in \\spad{R} we can use the algorithm of \\indented{3}{[Nijenhuis and Wilf,{} \\spad{ch}.19,{}\\spad{p}.158]; if 2 has no inverse,{}} \\indented{3}{some modifications are necessary:} \\item 2. if {\\em n > 6} and \\spad{R} is an integral domain with characteristic \\indented{3}{different from 2 (the algorithm works if and only 2 is not a} \\indented{3}{zero-divisor of \\spad{R} and {\\em characteristic()\\$R ~= 2},{}} \\indented{3}{but how to check that for any given \\spad{R} ?),{}} \\indented{3}{the local function {\\em permanent2} is called;} \\item 3. else,{} the local function {\\em permanent3} is called \\indented{3}{(works for all commutative rings \\spad{R}).} \\end{items}"))) NIL @@ -3479,7 +3479,7 @@ NIL (-887 S) ((|constructor| (NIL "Permutation(\\spad{S}) implements the group of all bijections \\indented{2}{on a set \\spad{S},{} which move only a finite number of points.} \\indented{2}{A permutation is considered as a map from \\spad{S} into \\spad{S}. In particular} \\indented{2}{multiplication is defined as composition of maps:} \\indented{2}{{\\em pi1 * pi2 = pi1 o pi2}.} \\indented{2}{The internal representation of permuatations are two lists} \\indented{2}{of equal length representing preimages and images.}")) (|coerceImages| (($ (|List| |#1|)) "\\spad{coerceImages(ls)} coerces the list {\\em ls} to a permutation whose image is given by {\\em ls} and the preimage is fixed to be {\\em [1,{}...,{}n]}. Note: {coerceImages(\\spad{ls})=coercePreimagesImages([1,{}...,{}\\spad{n}],{}\\spad{ls})}. We assume that both preimage and image do not contain repetitions.")) (|fixedPoints| (((|Set| |#1|) $) "\\spad{fixedPoints(p)} returns the points fixed by the permutation \\spad{p}.")) (|sort| (((|List| $) (|List| $)) "\\spad{sort(lp)} sorts a list of permutations {\\em lp} according to cycle structure first according to length of cycles,{} second,{} if \\spad{S} has \\spadtype{Finite} or \\spad{S} has \\spadtype{OrderedSet} according to lexicographical order of entries in cycles of equal length.")) (|odd?| (((|Boolean|) $) "\\spad{odd?(p)} returns \\spad{true} if and only if \\spad{p} is an odd permutation \\spadignore{i.e.} {\\em sign(p)} is {\\em -1}.")) (|even?| (((|Boolean|) $) "\\spad{even?(p)} returns \\spad{true} if and only if \\spad{p} is an even permutation,{} \\spadignore{i.e.} {\\em sign(p)} is 1.")) (|sign| (((|Integer|) $) "\\spad{sign(p)} returns the signum of the permutation \\spad{p},{} \\spad{+1} or \\spad{-1}.")) (|numberOfCycles| (((|NonNegativeInteger|) $) "\\spad{numberOfCycles(p)} returns the number of non-trivial cycles of the permutation \\spad{p}.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(p)} returns the order of a permutation \\spad{p} as a group element.")) (|cyclePartition| (((|Partition|) $) "\\spad{cyclePartition(p)} returns the cycle structure of a permutation \\spad{p} including cycles of length 1 only if \\spad{S} is finite.")) (|movedPoints| (((|Set| |#1|) $) "\\spad{movedPoints(p)} returns the set of points moved by the permutation \\spad{p}.")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(p)} retuns the number of points moved by the permutation \\spad{p}.")) (|coerceListOfPairs| (($ (|List| (|List| |#1|))) "\\spad{coerceListOfPairs(lls)} coerces a list of pairs {\\em lls} to a permutation. Error: if not consistent,{} \\spadignore{i.e.} the set of the first elements coincides with the set of second elements. coerce(\\spad{p}) generates output of the permutation \\spad{p} with domain OutputForm.")) (|coerce| (($ (|List| |#1|)) "\\spad{coerce(ls)} coerces a cycle {\\em ls},{} \\spadignore{i.e.} a list with not repetitions to a permutation,{} which maps {\\em ls.i} to {\\em ls.i+1},{} indices modulo the length of the list. Error: if repetitions occur.") (($ (|List| (|List| |#1|))) "\\spad{coerce(lls)} coerces a list of cycles {\\em lls} to a permutation,{} each cycle being a list with no repetitions,{} is coerced to the permutation,{} which maps {\\em ls.i} to {\\em ls.i+1},{} indices modulo the length of the list,{} then these permutations are mutiplied. Error: if repetitions occur in one cycle.")) (|coercePreimagesImages| (($ (|List| (|List| |#1|))) "\\spad{coercePreimagesImages(lls)} coerces the representation {\\em lls} of a permutation as a list of preimages and images to a permutation. We assume that both preimage and image do not contain repetitions.")) (|listRepresentation| (((|Record| (|:| |preimage| (|List| |#1|)) (|:| |image| (|List| |#1|))) $) "\\spad{listRepresentation(p)} produces a representation {\\em rep} of the permutation \\spad{p} as a list of preimages and images,{} \\spad{i}.\\spad{e} \\spad{p} maps {\\em (rep.preimage).k} to {\\em (rep.image).k} for all indices \\spad{k}. Elements of \\spad{S} not in {\\em (rep.preimage).k} are fixed points,{} and these are the only fixed points of the permutation."))) ((-4366 . T)) -((-4028 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-833)))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-833)))) +((-3988 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-833)))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-833)))) (-888 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 \\spad{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 @@ -3500,7 +3500,7 @@ NIL ((|constructor| (NIL "PrimeField(\\spad{p}) implements the field with \\spad{p} elements if \\spad{p} is a prime number. Error: if \\spad{p} is not prime. Note: this domain does not check that argument is a prime."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) ((|HasCategory| $ (QUOTE (-144))) (|HasCategory| $ (QUOTE (-142))) (|HasCategory| $ (QUOTE (-362)))) -(-893 R0 -3219 UP UPUP R) +(-893 R0 -3105 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 @@ -3528,7 +3528,7 @@ NIL ((|constructor| (NIL "PermutationGroupExamples provides permutation groups for some classes of groups: symmetric,{} alternating,{} dihedral,{} cyclic,{} direct products of cyclic,{} which are in fact the finite abelian groups of symmetric groups called Young subgroups. Furthermore,{} Rubik\\spad{'s} group as permutation group of 48 integers and a list of sporadic simple groups derived from the atlas of finite groups.")) (|youngGroup| (((|PermutationGroup| (|Integer|)) (|Partition|)) "\\spad{youngGroup(lambda)} constructs the direct product of the symmetric groups given by the parts of the partition {\\em lambda}.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{youngGroup([n1,{}...,{}nk])} constructs the direct product of the symmetric groups {\\em Sn1},{}...,{}{\\em Snk}.")) (|rubiksGroup| (((|PermutationGroup| (|Integer|))) "\\spad{rubiksGroup constructs} the permutation group representing Rubic\\spad{'s} Cube acting on integers {\\em 10*i+j} for {\\em 1 <= i <= 6},{} {\\em 1 <= j <= 8}. The faces of Rubik\\spad{'s} Cube are labelled in the obvious way Front,{} Right,{} Up,{} Down,{} Left,{} Back and numbered from 1 to 6 in this given ordering,{} the pieces on each face (except the unmoveable center piece) are clockwise numbered from 1 to 8 starting with the piece in the upper left corner. The moves of the cube are represented as permutations on these pieces,{} represented as a two digit integer {\\em ij} where \\spad{i} is the numer of theface (1 to 6) and \\spad{j} is the number of the piece on this face. The remaining ambiguities are resolved by looking at the 6 generators,{} which represent a 90 degree turns of the faces,{} or from the following pictorial description. Permutation group representing Rubic\\spad{'s} Cube acting on integers 10*i+j for 1 \\spad{<=} \\spad{i} \\spad{<=} 6,{} 1 \\spad{<=} \\spad{j} \\spad{<=8}. \\blankline\\begin{verbatim}Rubik's Cube: +-----+ +-- B where: marks Side # : / U /|/ / / | F(ront) <-> 1 L --> +-----+ R| R(ight) <-> 2 | | + U(p) <-> 3 | F | / D(own) <-> 4 | |/ L(eft) <-> 5 +-----+ B(ack) <-> 6 ^ | DThe Cube's surface: The pieces on each side +---+ (except the unmoveable center |567| piece) are clockwise numbered |4U8| from 1 to 8 starting with the |321| piece in the upper left +---+---+---+ corner (see figure on the |781|123|345| left). The moves of the cube |6L2|8F4|2R6| are represented as |543|765|187| permutations on these pieces. +---+---+---+ Each of the pieces is |123| represented as a two digit |8D4| integer ij where i is the |765| # of the side ( 1 to 6 for +---+ F to B (see table above )) |567| and j is the # of the piece. |4B8| |321| +---+\\end{verbatim}")) (|janko2| (((|PermutationGroup| (|Integer|))) "\\spad{janko2 constructs} the janko group acting on the integers 1,{}...,{}100.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{janko2(\\spad{li})} constructs the janko group acting on the 100 integers given in the list {\\em \\spad{li}}. Note: duplicates in the list will be removed. Error: if {\\em \\spad{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(\\spad{li})} constructs the mathieu group acting on the 24 integers given in the list {\\em \\spad{li}}. Note: duplicates in the list will be removed. Error: if {\\em \\spad{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(\\spad{li})} constructs the mathieu group acting on the 23 integers given in the list {\\em \\spad{li}}. Note: duplicates in the list will be removed. Error: if {\\em \\spad{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(\\spad{li})} constructs the mathieu group acting on the 22 integers given in the list {\\em \\spad{li}}. Note: duplicates in the list will be removed. Error: if {\\em \\spad{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(\\spad{li})} constructs the mathieu group acting on the 12 integers given in the list {\\em \\spad{li}}. Note: duplicates in the list will be removed Error: if {\\em \\spad{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(\\spad{li})} constructs the mathieu group acting on the 11 integers given in the list {\\em \\spad{li}}. Note: duplicates in the list will be removed. error,{} if {\\em \\spad{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 \\spad{ni}}.")) (|alternatingGroup| (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{alternatingGroup(\\spad{li})} constructs the alternating group acting on the integers in the list {\\em \\spad{li}},{} generators are in general the {\\em n-2}-cycle {\\em (\\spad{li}.3,{}...,{}\\spad{li}.n)} and the 3-cycle {\\em (\\spad{li}.1,{}\\spad{li}.2,{}\\spad{li}.3)},{} if \\spad{n} is odd and product of the 2-cycle {\\em (\\spad{li}.1,{}\\spad{li}.2)} with {\\em n-2}-cycle {\\em (\\spad{li}.3,{}...,{}\\spad{li}.n)} and the 3-cycle {\\em (\\spad{li}.1,{}\\spad{li}.2,{}\\spad{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(\\spad{li})} constructs the symmetric group acting on the integers in the list {\\em \\spad{li}},{} generators are the cycle given by {\\em \\spad{li}} and the 2-cycle {\\em (\\spad{li}.1,{}\\spad{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 -(-900 -3219) +(-900 -3105) ((|constructor| (NIL "Groebner functions for \\spad{P} \\spad{F} \\indented{2}{This package is an interface package to the groebner basis} package which allows you to compute groebner bases for polynomials in either lexicographic ordering or total degree ordering refined by reverse lex. The input is the ordinary polynomial type which is internally converted to a type with the required ordering. The resulting grobner basis is converted back to ordinary polynomials. The ordering among the variables is controlled by an explicit list of variables which is passed as a second argument. The coefficient domain is allowed to be any \\spad{gcd} domain,{} but the groebner basis is computed as if the polynomials were over a field.")) (|totalGroebner| (((|List| (|Polynomial| |#1|)) (|List| (|Polynomial| |#1|)) (|List| (|Symbol|))) "\\spad{totalGroebner(lp,{}lv)} computes Groebner basis for the list of polynomials \\spad{lp} with the terms ordered first by total degree and then refined by reverse lexicographic ordering. The variables are ordered by their position in the list \\spad{lv}.")) (|lexGroebner| (((|List| (|Polynomial| |#1|)) (|List| (|Polynomial| |#1|)) (|List| (|Symbol|))) "\\spad{lexGroebner(lp,{}lv)} computes Groebner basis for the list of polynomials \\spad{lp} in lexicographic order. The variables are ordered by their position in the list \\spad{lv}."))) NIL NIL @@ -3544,11 +3544,11 @@ NIL ((|constructor| (NIL "\\spadtype{PositiveInteger} provides functions for \\indented{2}{positive integers.}")) (|commutative| ((|attribute| "*") "\\spad{commutative(\"*\")} means multiplication is commutative : x*y = \\spad{y*x}")) (|gcd| (($ $ $) "\\spad{gcd(a,{}b)} computes the greatest common divisor of two positive integers \\spad{a} and \\spad{b}."))) (((-4371 "*") . T)) NIL -(-904 -3219 P) +(-904 -3105 P) ((|constructor| (NIL "This package exports interpolation algorithms")) (|LagrangeInterpolation| ((|#2| (|List| |#1|) (|List| |#1|)) "\\spad{LagrangeInterpolation(l1,{}l2)} \\undocumented"))) NIL NIL -(-905 |xx| -3219) +(-905 |xx| -3105) ((|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 @@ -3572,7 +3572,7 @@ NIL ((|constructor| (NIL "This package exports plotting tools")) (|calcRanges| (((|List| (|Segment| (|DoubleFloat|))) (|List| (|List| (|Point| (|DoubleFloat|))))) "\\spad{calcRanges(l)} \\undocumented"))) NIL NIL -(-911 R -3219) +(-911 R -3105) ((|constructor| (NIL "Attaching assertions to symbols for pattern matching; Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990")) (|multiple| ((|#2| |#2|) "\\spad{multiple(x)} tells the pattern matcher that \\spad{x} should preferably match a multi-term quantity in a sum or product. For matching on lists,{} multiple(\\spad{x}) tells the pattern matcher that \\spad{x} should match a list instead of an element of a list. Error: if \\spad{x} is not a symbol.")) (|optional| ((|#2| |#2|) "\\spad{optional(x)} tells the pattern matcher that \\spad{x} can match an identity (0 in a sum,{} 1 in a product or exponentiation). Error: if \\spad{x} is not a symbol.")) (|constant| ((|#2| |#2|) "\\spad{constant(x)} tells the pattern matcher that \\spad{x} should match only the symbol \\spad{'x} and no other quantity. Error: if \\spad{x} is not a symbol.")) (|assert| ((|#2| |#2| (|String|)) "\\spad{assert(x,{} s)} makes the assertion \\spad{s} about \\spad{x}. Error: if \\spad{x} is not a symbol."))) NIL NIL @@ -3584,7 +3584,7 @@ NIL ((|constructor| (NIL "This packages provides tools for matching recursively in type towers.")) (|patternMatch| (((|PatternMatchResult| |#1| |#3|) |#2| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#3|)) "\\spad{patternMatch(expr,{} pat,{} res)} matches the pattern \\spad{pat} to the expression \\spad{expr}; res contains the variables of \\spad{pat} which are already matched and their matches. Note: this function handles type towers by changing the predicates and calling the matching function provided by \\spad{A}.")) (|fixPredicate| (((|Mapping| (|Boolean|) |#2|) (|Mapping| (|Boolean|) |#3|)) "\\spad{fixPredicate(f)} returns \\spad{g} defined by \\spad{g}(a) = \\spad{f}(a::B)."))) NIL NIL -(-914 S R -3219) +(-914 S R -3105) ((|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 @@ -3604,11 +3604,11 @@ NIL ((|constructor| (NIL "This package provides pattern matching functions on polynomials.")) (|patternMatch| (((|PatternMatchResult| |#1| |#5|) |#5| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|)) "\\spad{patternMatch(p,{} pat,{} res)} matches the pattern \\spad{pat} to the polynomial \\spad{p}; res contains the variables of \\spad{pat} which are already matched and their matches.") (((|PatternMatchResult| |#1| |#5|) |#5| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|) (|Mapping| (|PatternMatchResult| |#1| |#5|) |#3| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|))) "\\spad{patternMatch(p,{} pat,{} res,{} vmatch)} matches the pattern \\spad{pat} to the polynomial \\spad{p}. \\spad{res} contains the variables of \\spad{pat} which are already matched and their matches; vmatch is the matching function to use on the variables."))) NIL ((|HasCategory| |#3| (LIST (QUOTE -868) (|devaluate| |#1|)))) -(-919 R -3219 -1766) +(-919 R -3105 -1780) ((|constructor| (NIL "Attaching predicates to symbols for pattern matching. Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990")) (|suchThat| ((|#2| |#2| (|List| (|Mapping| (|Boolean|) |#3|))) "\\spad{suchThat(x,{} [f1,{} f2,{} ...,{} fn])} attaches the predicate \\spad{f1} and \\spad{f2} and ... and \\spad{fn} to \\spad{x}. Error: if \\spad{x} is not a symbol.") ((|#2| |#2| (|Mapping| (|Boolean|) |#3|)) "\\spad{suchThat(x,{} foo)} attaches the predicate foo to \\spad{x}; error if \\spad{x} is not a symbol."))) NIL NIL -(-920 -1766) +(-920 -1780) ((|constructor| (NIL "Attaching predicates to symbols for pattern matching. Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990")) (|suchThat| (((|Expression| (|Integer|)) (|Symbol|) (|List| (|Mapping| (|Boolean|) |#1|))) "\\spad{suchThat(x,{} [f1,{} f2,{} ...,{} fn])} attaches the predicate \\spad{f1} and \\spad{f2} and ... and \\spad{fn} to \\spad{x}.") (((|Expression| (|Integer|)) (|Symbol|) (|Mapping| (|Boolean|) |#1|)) "\\spad{suchThat(x,{} foo)} attaches the predicate foo to \\spad{x}."))) NIL NIL @@ -3631,7 +3631,7 @@ NIL (-925 R) ((|constructor| (NIL "This domain implements points in coordinate space"))) ((-4370 . T) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-4028 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#1| (QUOTE (-1031))) (-12 (|HasCategory| |#1| (QUOTE (-984))) (|HasCategory| |#1| (QUOTE (-1031)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#1| (QUOTE (-1031))) (-12 (|HasCategory| |#1| (QUOTE (-984))) (|HasCategory| |#1| (QUOTE (-1031)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-926 |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 @@ -3656,7 +3656,7 @@ NIL ((|constructor| (NIL "The category for general multi-variate polynomials over a ring \\spad{R},{} in variables from VarSet,{} with exponents from the \\spadtype{OrderedAbelianMonoidSup}.")) (|canonicalUnitNormal| ((|attribute|) "we can choose a unique representative for each associate class. This normalization is chosen to be normalization of leading coefficient (by default).")) (|squareFreePart| (($ $) "\\spad{squareFreePart(p)} returns product of all the irreducible factors of polynomial \\spad{p} each taken with multiplicity one.")) (|squareFree| (((|Factored| $) $) "\\spad{squareFree(p)} returns the square free factorization of the polynomial \\spad{p}.")) (|primitivePart| (($ $ |#3|) "\\spad{primitivePart(p,{}v)} returns the unitCanonical associate of the polynomial \\spad{p} with its content with respect to the variable \\spad{v} divided out.") (($ $) "\\spad{primitivePart(p)} returns the unitCanonical associate of the polynomial \\spad{p} with its content divided out.")) (|content| (($ $ |#3|) "\\spad{content(p,{}v)} is the \\spad{gcd} of the coefficients of the polynomial \\spad{p} when \\spad{p} is viewed as a univariate polynomial with respect to the variable \\spad{v}. Thus,{} for polynomial 7*x**2*y + 14*x*y**2,{} the \\spad{gcd} of the coefficients with respect to \\spad{x} is 7*y.")) (|discriminant| (($ $ |#3|) "\\spad{discriminant(p,{}v)} returns the disriminant of the polynomial \\spad{p} with respect to the variable \\spad{v}.")) (|resultant| (($ $ $ |#3|) "\\spad{resultant(p,{}q,{}v)} returns the resultant of the polynomials \\spad{p} and \\spad{q} with respect to the variable \\spad{v}.")) (|primitiveMonomials| (((|List| $) $) "\\spad{primitiveMonomials(p)} gives the list of monomials of the polynomial \\spad{p} with their coefficients removed. Note: \\spad{primitiveMonomials(sum(a_(i) X^(i))) = [X^(1),{}...,{}X^(n)]}.")) (|variables| (((|List| |#3|) $) "\\spad{variables(p)} returns the list of those variables actually appearing in the polynomial \\spad{p}.")) (|totalDegree| (((|NonNegativeInteger|) $ (|List| |#3|)) "\\spad{totalDegree(p,{} lv)} returns the maximum sum (over all monomials of polynomial \\spad{p}) of the variables in the list \\spad{lv}.") (((|NonNegativeInteger|) $) "\\spad{totalDegree(p)} returns the largest sum over all monomials of all exponents of a monomial.")) (|isExpt| (((|Union| (|Record| (|:| |var| |#3|) (|:| |exponent| (|NonNegativeInteger|))) "failed") $) "\\spad{isExpt(p)} returns \\spad{[x,{} n]} if polynomial \\spad{p} has the form \\spad{x**n} and \\spad{n > 0}.")) (|isTimes| (((|Union| (|List| $) "failed") $) "\\spad{isTimes(p)} returns \\spad{[a1,{}...,{}an]} if polynomial \\spad{p = a1 ... an} and \\spad{n >= 2},{} and,{} for each \\spad{i},{} \\spad{ai} is either a nontrivial constant in \\spad{R} or else of the form \\spad{x**e},{} where \\spad{e > 0} is an integer and \\spad{x} in a member of VarSet.")) (|isPlus| (((|Union| (|List| $) "failed") $) "\\spad{isPlus(p)} returns \\spad{[m1,{}...,{}mn]} if polynomial \\spad{p = m1 + ... + mn} and \\spad{n >= 2} and each \\spad{mi} is a nonzero monomial.")) (|multivariate| (($ (|SparseUnivariatePolynomial| $) |#3|) "\\spad{multivariate(sup,{}v)} converts an anonymous univariable polynomial \\spad{sup} to a polynomial in the variable \\spad{v}.") (($ (|SparseUnivariatePolynomial| |#1|) |#3|) "\\spad{multivariate(sup,{}v)} converts an anonymous univariable polynomial \\spad{sup} to a polynomial in the variable \\spad{v}.")) (|monomial| (($ $ (|List| |#3|) (|List| (|NonNegativeInteger|))) "\\spad{monomial(a,{}[v1..vn],{}[e1..en])} returns \\spad{a*prod(vi**ei)}.") (($ $ |#3| (|NonNegativeInteger|)) "\\spad{monomial(a,{}x,{}n)} creates the monomial \\spad{a*x**n} where \\spad{a} is a polynomial,{} \\spad{x} is a variable and \\spad{n} is a nonnegative integer.")) (|monicDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $ |#3|) "\\spad{monicDivide(a,{}b,{}v)} divides the polynomial a by the polynomial \\spad{b},{} with each viewed as a univariate polynomial in \\spad{v} returning both the quotient and remainder. Error: if \\spad{b} is not monic with respect to \\spad{v}.")) (|minimumDegree| (((|List| (|NonNegativeInteger|)) $ (|List| |#3|)) "\\spad{minimumDegree(p,{} lv)} gives the list of minimum degrees of the polynomial \\spad{p} with respect to each of the variables in the list \\spad{lv}") (((|NonNegativeInteger|) $ |#3|) "\\spad{minimumDegree(p,{}v)} gives the minimum degree of polynomial \\spad{p} with respect to \\spad{v},{} \\spadignore{i.e.} viewed a univariate polynomial in \\spad{v}")) (|mainVariable| (((|Union| |#3| "failed") $) "\\spad{mainVariable(p)} returns the biggest variable which actually occurs in the polynomial \\spad{p},{} or \"failed\" if no variables are present. fails precisely if polynomial satisfies ground?")) (|univariate| (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{univariate(p)} converts the multivariate polynomial \\spad{p},{} which should actually involve only one variable,{} into a univariate polynomial in that variable,{} whose coefficients are in the ground ring. Error: if polynomial is genuinely multivariate") (((|SparseUnivariatePolynomial| $) $ |#3|) "\\spad{univariate(p,{}v)} converts the multivariate polynomial \\spad{p} into a univariate polynomial in \\spad{v},{} whose coefficients are still multivariate polynomials (in all the other variables).")) (|monomials| (((|List| $) $) "\\spad{monomials(p)} returns the list of non-zero monomials of polynomial \\spad{p},{} \\spadignore{i.e.} \\spad{monomials(sum(a_(i) X^(i))) = [a_(1) X^(1),{}...,{}a_(n) X^(n)]}.")) (|coefficient| (($ $ (|List| |#3|) (|List| (|NonNegativeInteger|))) "\\spad{coefficient(p,{} lv,{} ln)} views the polynomial \\spad{p} as a polynomial in the variables of \\spad{lv} and returns the coefficient of the term \\spad{lv**ln},{} \\spadignore{i.e.} \\spad{prod(lv_i ** ln_i)}.") (($ $ |#3| (|NonNegativeInteger|)) "\\spad{coefficient(p,{}v,{}n)} views the polynomial \\spad{p} as a univariate polynomial in \\spad{v} and returns the coefficient of the \\spad{v**n} term.")) (|degree| (((|List| (|NonNegativeInteger|)) $ (|List| |#3|)) "\\spad{degree(p,{}lv)} gives the list of degrees of polynomial \\spad{p} with respect to each of the variables in the list \\spad{lv}.") (((|NonNegativeInteger|) $ |#3|) "\\spad{degree(p,{}v)} gives the degree of polynomial \\spad{p} with respect to the variable \\spad{v}."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-6 -4367)) (-4364 . T) (-4363 . T) (-4366 . T)) NIL -(-932 E V R P -3219) +(-932 E V R P -3105) ((|constructor| (NIL "This package transforms multivariate polynomials or fractions into univariate polynomials or fractions,{} and back.")) (|isPower| (((|Union| (|Record| (|:| |val| |#5|) (|:| |exponent| (|Integer|))) "failed") |#5|) "\\spad{isPower(p)} returns \\spad{[x,{} n]} if \\spad{p = x**n} and \\spad{n <> 0},{} \"failed\" otherwise.")) (|isExpt| (((|Union| (|Record| (|:| |var| |#2|) (|:| |exponent| (|Integer|))) "failed") |#5|) "\\spad{isExpt(p)} returns \\spad{[x,{} n]} if \\spad{p = x**n} and \\spad{n <> 0},{} \"failed\" otherwise.")) (|isTimes| (((|Union| (|List| |#5|) "failed") |#5|) "\\spad{isTimes(p)} returns \\spad{[a1,{}...,{}an]} if \\spad{p = a1 ... an} and \\spad{n > 1},{} \"failed\" otherwise.")) (|isPlus| (((|Union| (|List| |#5|) "failed") |#5|) "\\spad{isPlus(p)} returns [\\spad{m1},{}...,{}\\spad{mn}] if \\spad{p = m1 + ... + mn} and \\spad{n > 1},{} \"failed\" otherwise.")) (|multivariate| ((|#5| (|Fraction| (|SparseUnivariatePolynomial| |#5|)) |#2|) "\\spad{multivariate(f,{} v)} applies both the numerator and denominator of \\spad{f} to \\spad{v}.")) (|univariate| (((|SparseUnivariatePolynomial| |#5|) |#5| |#2| (|SparseUnivariatePolynomial| |#5|)) "\\spad{univariate(f,{} x,{} p)} returns \\spad{f} viewed as a univariate polynomial in \\spad{x},{} using the side-condition \\spad{p(x) = 0}.") (((|Fraction| (|SparseUnivariatePolynomial| |#5|)) |#5| |#2|) "\\spad{univariate(f,{} v)} returns \\spad{f} viewed as a univariate rational function in \\spad{v}.")) (|mainVariable| (((|Union| |#2| "failed") |#5|) "\\spad{mainVariable(f)} returns the highest variable appearing in the numerator or the denominator of \\spad{f},{} \"failed\" if \\spad{f} has no variables.")) (|variables| (((|List| |#2|) |#5|) "\\spad{variables(f)} returns the list of variables appearing in the numerator or the denominator of \\spad{f}."))) NIL NIL @@ -3667,9 +3667,9 @@ NIL (-934 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}."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-6 -4367)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#1| (QUOTE (-891))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-1155) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-1155) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-1155) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-1155) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-1155) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) -(-935 E V R P -3219) -((|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)}.")) (|coerce| (($ |#4|) "\\spad{coerce(p)} \\undocumented")) (|denom| ((|#4| $) "\\spad{denom(x)} \\undocumented")) (|numer| ((|#4| $) "\\spad{numer(x)} \\undocumented"))) +((|HasCategory| |#1| (QUOTE (-891))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-1155) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-1155) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-1155) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-1155) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-1155) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) +(-935 E V R P -3105) +((|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 (-445)))) (-936) @@ -3691,12 +3691,12 @@ NIL (-940 S) ((|constructor| (NIL "\\indented{1}{This provides a fast array type with no bound checking on elt\\spad{'s}.} Minimum index is 0 in this type,{} cannot be changed"))) ((-4370 . T) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-4028 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-941) ((|constructor| (NIL "Category for the functions defined by integrals.")) (|integral| (($ $ (|SegmentBinding| $)) "\\spad{integral(f,{} x = a..b)} returns the formal definite integral of \\spad{f} \\spad{dx} for \\spad{x} between \\spad{a} and \\spad{b}.") (($ $ (|Symbol|)) "\\spad{integral(f,{} x)} returns the formal integral of \\spad{f} \\spad{dx}."))) NIL NIL -(-942 -3219) +(-942 -3105) ((|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{\\spad{ai} = \\spad{qi}(a)},{} and \\spad{q(a) = 0}. The \\spad{pi}\\spad{'s} are the defining polynomials for the \\spad{ai}\\spad{'s}. This operation uses the technique of \\spadglossSee{groebner bases}{Groebner basis}.") (((|Record| (|:| |coef| (|List| (|Integer|))) (|:| |poly| (|List| (|SparseUnivariatePolynomial| |#1|))) (|:| |prim| (|SparseUnivariatePolynomial| |#1|))) (|List| (|Polynomial| |#1|)) (|List| (|Symbol|))) "\\spad{primitiveElement([p1,{}...,{}pn],{} [a1,{}...,{}an])} returns \\spad{[[c1,{}...,{}cn],{} [q1,{}...,{}qn],{} q]} such that then \\spad{k(a1,{}...,{}an) = k(a)},{} where \\spad{a = a1 c1 + ... + an cn},{} \\spad{\\spad{ai} = \\spad{qi}(a)},{} and \\spad{q(a) = 0}. The \\spad{pi}\\spad{'s} are the defining polynomials for the \\spad{ai}\\spad{'s}. This operation uses the technique of \\spadglossSee{groebner bases}{Groebner basis}.") (((|Record| (|:| |coef1| (|Integer|)) (|:| |coef2| (|Integer|)) (|:| |prim| (|SparseUnivariatePolynomial| |#1|))) (|Polynomial| |#1|) (|Symbol|) (|Polynomial| |#1|) (|Symbol|)) "\\spad{primitiveElement(p1,{} a1,{} p2,{} a2)} returns \\spad{[c1,{} c2,{} q]} such that \\spad{k(a1,{} a2) = k(a)} where \\spad{a = c1 a1 + c2 a2,{} and q(a) = 0}. The \\spad{pi}\\spad{'s} are the defining polynomials for the \\spad{ai}\\spad{'s}. The \\spad{p2} may involve \\spad{a1},{} but \\spad{p1} must not involve a2. This operation uses \\spadfun{resultant}."))) NIL NIL @@ -3711,11 +3711,11 @@ NIL (-945 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}"))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-6 -4367)) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-129)))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasAttribute| |#1| (QUOTE -4367))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-129)))) (|HasAttribute| |#1| (QUOTE -4367))) (-946 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"))) ((-4366 -12 (|has| |#2| (-466)) (|has| |#1| (-466)))) -((-4028 (-12 (|HasCategory| |#1| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-779)))) (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-833))))) (-12 (|HasCategory| |#1| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-779)))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-129)))) (-12 (|HasCategory| |#1| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-779))))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-129)))) (-12 (|HasCategory| |#1| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-779))))) (-12 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-466)))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-466)))) (-12 (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-712))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-362)))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-129)))) (-12 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-466)))) (-12 (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-712)))) (-12 (|HasCategory| |#1| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-779))))) (-12 (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-712)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-129)))) (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-833))))) +((-3988 (-12 (|HasCategory| |#1| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-779)))) (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-833))))) (-12 (|HasCategory| |#1| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-779)))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-129)))) (-12 (|HasCategory| |#1| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-779))))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-129)))) (-12 (|HasCategory| |#1| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-779))))) (-12 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-466)))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-466)))) (-12 (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-712))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-362)))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-129)))) (-12 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-466)))) (-12 (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-712)))) (-12 (|HasCategory| |#1| (QUOTE (-779))) (|HasCategory| |#2| (QUOTE (-779))))) (-12 (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-712)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-129))) (|HasCategory| |#2| (QUOTE (-129)))) (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-833))))) (-947) ((|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| (($ (|Symbol|) (|SExpression|)) "\\spad{property(n,{}val)} constructs a property with name \\spad{`n'} and value `val'.")) (|value| (((|SExpression|) $) "\\spad{value(p)} returns value of property \\spad{p}")) (|name| (((|Symbol|) $) "\\spad{name(p)} returns the name of property \\spad{p}"))) NIL @@ -3730,7 +3730,7 @@ NIL NIL (-950 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}."))) -((-4369 . T) (-4370 . T) (-4284 . T)) +((-4369 . T) (-4370 . T)) NIL (-951 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{semiSubResultantGcdEuclidean1}{PseudoRemainderSequence},{} \\axiomOpFrom{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.\\spad{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{nextsousResultant2(\\spad{P},{} \\spad{Q},{} \\spad{Z},{} \\spad{s})} returns the subresultant \\axiom{\\spad{S_}{\\spad{e}-1}} where \\axiom{\\spad{P} ~ \\spad{S_d},{} \\spad{Q} = \\spad{S_}{\\spad{d}-1},{} \\spad{Z} = S_e,{} \\spad{s} = \\spad{lc}(\\spad{S_d})}")) (|Lazard2| ((|#2| |#2| |#1| |#1| (|NonNegativeInteger|)) "\\axiom{Lazard2(\\spad{F},{} \\spad{x},{} \\spad{y},{} \\spad{n})} computes \\axiom{(x/y)\\spad{**}(\\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{\\spad{gcd}(\\spad{P},{} \\spad{Q})} returns the \\spad{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} + coef2 * \\spad{D}(\\spad{P}) = discriminant(\\spad{P})}. Warning: \\axiom{degree(\\spad{P}) \\spad{>=} degree(\\spad{Q})}.")) (|discriminantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |discriminant| |#1|)) |#2|) "\\axiom{discriminantEuclidean(\\spad{P})} carries out the equality \\axiom{coef1 * \\spad{P} + 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{semiSubResultantGcdEuclidean1(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{coef1*P + ? \\spad{Q} = \\spad{+/-} 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{semiSubResultantGcdEuclidean2(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{...\\spad{P} + coef2*Q = \\spad{+/-} 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}) \\spad{>=} 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 = \\spad{+/-} 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 \\spad{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}) \\spad{>=} 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}) \\spad{>=} 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}) \\spad{>=} 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{semiResultantEuclidean1(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{coef1.\\spad{P} + ? \\spad{Q} = resultant(\\spad{P},{}\\spad{Q})}.")) (|semiResultantEuclidean2| (((|Record| (|:| |coef2| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{semiResultantEuclidean2(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{...\\spad{P} + coef2*Q = resultant(\\spad{P},{}\\spad{Q})}. Warning: \\axiom{degree(\\spad{P}) \\spad{>=} 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}}"))) @@ -3741,7 +3741,7 @@ NIL NIL NIL (-953) -((|constructor| (NIL "\\indented{1}{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}.")) (|coerce| (((|List| (|Integer|)) $) "\\spad{coerce(p)} coerces a partition into a list of integers")) (|conjugate| (($ $) "\\spad{conjugate(p)} returns the conjugate partition of a partition \\spad{p}")) (|pdct| (((|Integer|) $) "\\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| (|List| (|Integer|))) (|List| (|Integer|))) "\\spad{powers(\\spad{li})} returns a list of 2-element lists. For each 2-element list,{} the first element is an entry of \\spad{li} and the second element is the multiplicity with which the first element occurs in \\spad{li}. There is a 2-element list for each value occurring in \\spad{l}.")) (|partition| (($ (|List| (|Integer|))) "\\spad{partition(\\spad{li})} converts a list of integers \\spad{li} to a partition"))) +((|constructor| (NIL "\\indented{1}{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| (((|Integer|) $) "\\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| (|List| (|Integer|))) (|List| (|Integer|))) "\\spad{powers(\\spad{li})} returns a list of 2-element lists. For each 2-element list,{} the first element is an entry of \\spad{li} and the second element is the multiplicity with which the first element occurs in \\spad{li}. There is a 2-element list for each value occurring in \\spad{l}.")) (|partition| (($ (|List| (|Integer|))) "\\spad{partition(\\spad{li})} converts a list of integers \\spad{li} to a partition"))) NIL NIL (-954 S |Coef| |Expon| |Var|) @@ -3762,7 +3762,7 @@ NIL ((|HasCategory| |#2| (QUOTE (-545)))) (-958 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?(\\spad{ps})} returns \\spad{true} iff \\axiom{\\spad{ps}} is a triangular set,{} \\spadignore{i.e.} two distinct polynomials have distinct main variables and no constant lies in \\axiom{\\spad{ps}}.")) (|rewriteIdealWithRemainder| (((|List| |#4|) (|List| |#4|) $) "\\axiom{rewriteIdealWithRemainder(\\spad{lp},{}\\spad{cs})} returns \\axiom{\\spad{lr}} such that every polynomial in \\axiom{\\spad{lr}} is fully reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{cs}} and \\axiom{(\\spad{lp},{}\\spad{cs})} and \\axiom{(\\spad{lr},{}\\spad{cs})} generate the same ideal in \\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}}.")) (|rewriteIdealWithHeadRemainder| (((|List| |#4|) (|List| |#4|) $) "\\axiom{rewriteIdealWithHeadRemainder(\\spad{lp},{}\\spad{cs})} returns \\axiom{\\spad{lr}} such that the leading monomial of every polynomial in \\axiom{\\spad{lr}} is reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{cs}} and \\axiom{(\\spad{lp},{}\\spad{cs})} and \\axiom{(\\spad{lr},{}\\spad{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,{}\\spad{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{\\spad{ps}},{} \\axiom{r*a - \\spad{c*b}} lies in the ideal generated by \\axiom{\\spad{ps}}. Furthermore,{} if \\axiom{\\spad{R}} is a \\spad{gcd}-domain,{} \\axiom{\\spad{b}} is primitive.")) (|headRemainder| (((|Record| (|:| |num| |#4|) (|:| |den| |#1|)) |#4| $) "\\axiom{headRemainder(a,{}\\spad{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{\\spad{ps}} and \\axiom{r*a - \\spad{b}} lies in the ideal generated by \\axiom{\\spad{ps}}.")) (|roughUnitIdeal?| (((|Boolean|) $) "\\axiom{roughUnitIdeal?(\\spad{ps})} returns \\spad{true} iff \\axiom{\\spad{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?(\\spad{ps})} returns \\spad{true} iff for every pair \\axiom{{\\spad{p},{}\\spad{q}}} of polynomials in \\axiom{\\spad{ps}} their leading monomials are relatively prime.")) (|trivialIdeal?| (((|Boolean|) $) "\\axiom{trivialIdeal?(\\spad{ps})} returns \\spad{true} iff \\axiom{\\spad{ps}} does not contain non-zero elements.")) (|sort| (((|Record| (|:| |under| $) (|:| |floor| $) (|:| |upper| $)) $ |#3|) "\\axiom{sort(\\spad{v},{}\\spad{ps})} returns \\axiom{us,{}\\spad{vs},{}\\spad{ws}} such that \\axiom{us} is \\axiom{collectUnder(\\spad{ps},{}\\spad{v})},{} \\axiom{\\spad{vs}} is \\axiom{collect(\\spad{ps},{}\\spad{v})} and \\axiom{\\spad{ws}} is \\axiom{collectUpper(\\spad{ps},{}\\spad{v})}.")) (|collectUpper| (($ $ |#3|) "\\axiom{collectUpper(\\spad{ps},{}\\spad{v})} returns the set consisting of the polynomials of \\axiom{\\spad{ps}} with main variable greater than \\axiom{\\spad{v}}.")) (|collect| (($ $ |#3|) "\\axiom{collect(\\spad{ps},{}\\spad{v})} returns the set consisting of the polynomials of \\axiom{\\spad{ps}} with \\axiom{\\spad{v}} as main variable.")) (|collectUnder| (($ $ |#3|) "\\axiom{collectUnder(\\spad{ps},{}\\spad{v})} returns the set consisting of the polynomials of \\axiom{\\spad{ps}} with main variable less than \\axiom{\\spad{v}}.")) (|mainVariable?| (((|Boolean|) |#3| $) "\\axiom{mainVariable?(\\spad{v},{}\\spad{ps})} returns \\spad{true} iff \\axiom{\\spad{v}} is the main variable of some polynomial in \\axiom{\\spad{ps}}.")) (|mainVariables| (((|List| |#3|) $) "\\axiom{mainVariables(\\spad{ps})} returns the decreasingly sorted list of the variables which are main variables of some polynomial in \\axiom{\\spad{ps}}.")) (|variables| (((|List| |#3|) $) "\\axiom{variables(\\spad{ps})} returns the decreasingly sorted list of the variables which are variables of some polynomial in \\axiom{\\spad{ps}}.")) (|mvar| ((|#3| $) "\\axiom{mvar(\\spad{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(\\spad{lp})} returns an element of the domain whose elements are the members of \\axiom{\\spad{lp}} if such an element exists,{} otherwise an error is produced.")) (|retractIfCan| (((|Union| $ "failed") (|List| |#4|)) "\\axiom{retractIfCan(\\spad{lp})} returns an element of the domain whose elements are the members of \\axiom{\\spad{lp}} if such an element exists,{} otherwise \\axiom{\"failed\"} is returned."))) -((-4369 . T) (-4284 . T)) +((-4369 . T)) NIL (-959 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(\\spad{lp},{}\\spad{lq})} returns the same as \\axiom{irreducibleFactors(concat(\\spad{lp},{}\\spad{lq}))} assuming that \\axiom{irreducibleFactors(\\spad{lp})} returns \\axiom{\\spad{lp}} up to replacing some polynomial \\axiom{\\spad{pj}} in \\axiom{\\spad{lp}} by some polynomial \\axiom{\\spad{qj}} associated to \\axiom{\\spad{pj}}.")) (|lazyIrreducibleFactors| (((|List| |#4|) (|List| |#4|)) "\\axiom{lazyIrreducibleFactors(\\spad{lp})} returns \\axiom{\\spad{lf}} such that if \\axiom{\\spad{lp} = [\\spad{p1},{}...,{}\\spad{pn}]} and \\axiom{\\spad{lf} = [\\spad{f1},{}...,{}\\spad{fm}]} then \\axiom{p1*p2*...*pn=0} means \\axiom{f1*f2*...*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 \\spad{gcd} techniques over \\axiom{\\spad{R}}.")) (|irreducibleFactors| (((|List| |#4|) (|List| |#4|)) "\\axiom{irreducibleFactors(\\spad{lp})} returns \\axiom{\\spad{lf}} such that if \\axiom{\\spad{lp} = [\\spad{p1},{}...,{}\\spad{pn}]} and \\axiom{\\spad{lf} = [\\spad{f1},{}...,{}\\spad{fm}]} then \\axiom{p1*p2*...*pn=0} means \\axiom{f1*f2*...*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(\\spad{lp},{}\\spad{lf})} returns \\axiom{newlp} where \\axiom{newlp} is obtained from \\axiom{\\spad{lp}} by removing in every polynomial \\axiom{\\spad{p}} of \\axiom{\\spad{lp}} any non trivial factor of any polynomial \\axiom{\\spad{f}} in \\axiom{\\spad{lf}}. Moreover,{} squares over \\axiom{\\spad{R}} are first removed in every polynomial \\axiom{\\spad{lp}}.")) (|removeRedundantFactorsInContents| (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRedundantFactorsInContents(\\spad{lp},{}\\spad{lf})} returns \\axiom{newlp} where \\axiom{newlp} is obtained from \\axiom{\\spad{lp}} by removing in the content of every polynomial of \\axiom{\\spad{lp}} any non trivial factor of any polynomial \\axiom{\\spad{f}} in \\axiom{\\spad{lf}}. Moreover,{} squares over \\axiom{\\spad{R}} are first removed in the content of every polynomial of \\axiom{\\spad{lp}}.")) (|removeRoughlyRedundantFactorsInContents| (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRoughlyRedundantFactorsInContents(\\spad{lp},{}\\spad{lf})} returns \\axiom{newlp}where \\axiom{newlp} is obtained from \\axiom{\\spad{lp}} by removing in the content of every polynomial of \\axiom{\\spad{lp}} any occurence of a polynomial \\axiom{\\spad{f}} in \\axiom{\\spad{lf}}. Moreover,{} squares over \\axiom{\\spad{R}} are first removed in the content of every polynomial of \\axiom{\\spad{lp}}.")) (|univariatePolynomialsGcds| (((|List| |#4|) (|List| |#4|) (|Boolean|)) "\\axiom{univariatePolynomialsGcds(\\spad{lp},{}opt)} returns the same as \\axiom{univariatePolynomialsGcds(\\spad{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(\\spad{lp})} returns \\axiom{\\spad{lg}} where \\axiom{\\spad{lg}} is a list of the gcds of every pair in \\axiom{\\spad{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(\\spad{lp},{}redOp?,{}redOp)} returns \\axiom{\\spad{lq}} where \\axiom{\\spad{lq}} and \\axiom{\\spad{lp}} generate the same ideal in \\axiom{\\spad{R^}(\\spad{-1}) \\spad{P}} and \\axiom{\\spad{lq}} has rank not higher than the one of \\axiom{\\spad{lp}}. Moreover,{} \\axiom{\\spad{lq}} is computed by reducing \\axiom{\\spad{lp}} \\spad{w}.\\spad{r}.\\spad{t}. some basic set of the ideal generated by the quasi-monic polynomials in \\axiom{\\spad{lp}}.")) (|rewriteSetByReducingWithParticularGenerators| (((|List| |#4|) (|List| |#4|) (|Mapping| (|Boolean|) |#4|) (|Mapping| (|Boolean|) |#4| |#4|) (|Mapping| |#4| |#4| |#4|)) "\\axiom{rewriteSetByReducingWithParticularGenerators(\\spad{lp},{}pred?,{}redOp?,{}redOp)} returns \\axiom{\\spad{lq}} where \\axiom{\\spad{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(\\spad{lp})} returns \\axiom{\\spad{lq}} such that \\axiom{\\spad{lp}} and and \\axiom{\\spad{lq}} generate the same ideal and no rough basic sets reduce (in the sense of Groebner bases) the other polynomials in \\axiom{\\spad{lq}}.")) (|roughBasicSet| (((|Union| (|Record| (|:| |bas| (|GeneralTriangularSet| |#1| |#2| |#3| |#4|)) (|:| |top| (|List| |#4|))) "failed") (|List| |#4|)) "\\axiom{roughBasicSet(\\spad{lp})} returns the smallest (with Ritt-Wu ordering) triangular set contained in \\axiom{\\spad{lp}}.")) (|interReduce| (((|List| |#4|) (|List| |#4|)) "\\axiom{interReduce(\\spad{lp})} returns \\axiom{\\spad{lq}} such that \\axiom{\\spad{lp}} and \\axiom{\\spad{lq}} generate the same ideal and no polynomial in \\axiom{\\spad{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},{}\\spad{lf})} returns the same as removeRoughlyRedundantFactorsInPols([\\spad{p}],{}\\spad{lf},{}\\spad{true})")) (|removeRoughlyRedundantFactorsInPols| (((|List| |#4|) (|List| |#4|) (|List| |#4|) (|Boolean|)) "\\axiom{removeRoughlyRedundantFactorsInPols(\\spad{lp},{}\\spad{lf},{}opt)} returns the same as \\axiom{removeRoughlyRedundantFactorsInPols(\\spad{lp},{}\\spad{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(\\spad{lp},{}\\spad{lf})} returns \\axiom{newlp}where \\axiom{newlp} is obtained from \\axiom{\\spad{lp}} by removing in every polynomial \\axiom{\\spad{p}} of \\axiom{\\spad{lp}} any occurence of a polynomial \\axiom{\\spad{f}} in \\axiom{\\spad{lf}}. This may involve a lot of exact-quotients computations.")) (|bivariatePolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| |#4|)) "\\axiom{bivariatePolynomials(\\spad{lp})} returns \\axiom{\\spad{bps},{}nbps} where \\axiom{\\spad{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(\\spad{lp})} returns \\axiom{\\spad{lps},{}nlps} where \\axiom{\\spad{lps}} is a list of the linear polynomials in \\spad{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(\\spad{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(\\spad{lp})} returns \\axiom{qmps,{}nqmps} where \\axiom{qmps} is a list of the quasi-monic polynomials in \\axiom{\\spad{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?,{}\\spad{ps})} returns \\axiom{\\spad{gps},{}\\spad{bps}} where \\axiom{\\spad{gps}} is a list of the polynomial \\axiom{\\spad{p}} in \\axiom{\\spad{ps}} such that \\axiom{pred?(\\spad{p})} holds for every \\axiom{pred?} in \\axiom{lpred?} and \\axiom{\\spad{bps}} are the other ones.")) (|selectOrPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| (|Mapping| (|Boolean|) |#4|)) (|List| |#4|)) "\\axiom{selectOrPolynomials(lpred?,{}\\spad{ps})} returns \\axiom{\\spad{gps},{}\\spad{bps}} where \\axiom{\\spad{gps}} is a list of the polynomial \\axiom{\\spad{p}} in \\axiom{\\spad{ps}} such that \\axiom{pred?(\\spad{p})} holds for some \\axiom{pred?} in \\axiom{lpred?} and \\axiom{\\spad{bps}} are the other ones.")) (|selectPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|Mapping| (|Boolean|) |#4|) (|List| |#4|)) "\\axiom{selectPolynomials(pred?,{}\\spad{ps})} returns \\axiom{\\spad{gps},{}\\spad{bps}} where \\axiom{\\spad{gps}} is a list of the polynomial \\axiom{\\spad{p}} in \\axiom{\\spad{ps}} such that \\axiom{pred?(\\spad{p})} holds and \\axiom{\\spad{bps}} are the other ones.")) (|probablyZeroDim?| (((|Boolean|) (|List| |#4|)) "\\axiom{probablyZeroDim?(\\spad{lp})} returns \\spad{true} iff the number of polynomials in \\axiom{\\spad{lp}} is not smaller than the number of variables occurring in these polynomials.")) (|possiblyNewVariety?| (((|Boolean|) (|List| |#4|) (|List| (|List| |#4|))) "\\axiom{possiblyNewVariety?(newlp,{}\\spad{llp})} returns \\spad{true} iff for every \\axiom{\\spad{lp}} in \\axiom{\\spad{llp}} certainlySubVariety?(newlp,{}\\spad{lp}) does not hold.")) (|certainlySubVariety?| (((|Boolean|) (|List| |#4|) (|List| |#4|)) "\\axiom{certainlySubVariety?(newlp,{}\\spad{lp})} returns \\spad{true} iff for every \\axiom{\\spad{p}} in \\axiom{\\spad{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 \\spad{gcd}-domain,{} then \\axiom{\\spad{p}} and \\axiom{\\spad{q}} are assumed to be square free.")) (|removeSquaresIfCan| (((|List| |#4|) (|List| |#4|)) "\\axiom{removeSquaresIfCan(\\spad{lp})} returns \\axiom{removeDuplicates [squareFreePart(\\spad{p})\\$\\spad{P} for \\spad{p} in \\spad{lp}]} if \\axiom{\\spad{R}} is \\spad{gcd}-domain else returns \\axiom{\\spad{lp}}.")) (|removeRedundantFactors| (((|List| |#4|) (|List| |#4|) (|List| |#4|) (|Mapping| (|List| |#4|) (|List| |#4|))) "\\axiom{removeRedundantFactors(\\spad{lp},{}\\spad{lq},{}remOp)} returns the same as \\axiom{concat(remOp(removeRoughlyRedundantFactorsInPols(\\spad{lp},{}\\spad{lq})),{}\\spad{lq})} assuming that \\axiom{remOp(\\spad{lq})} returns \\axiom{\\spad{lq}} up to similarity.") (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRedundantFactors(\\spad{lp},{}\\spad{lq})} returns the same as \\axiom{removeRedundantFactors(concat(\\spad{lp},{}\\spad{lq}))} assuming that \\axiom{removeRedundantFactors(\\spad{lp})} returns \\axiom{\\spad{lp}} up to replacing some polynomial \\axiom{\\spad{pj}} in \\axiom{\\spad{lp}} by some polynomial \\axiom{\\spad{qj}} associated to \\axiom{\\spad{pj}}.") (((|List| |#4|) (|List| |#4|) |#4|) "\\axiom{removeRedundantFactors(\\spad{lp},{}\\spad{q})} returns the same as \\axiom{removeRedundantFactors(cons(\\spad{q},{}\\spad{lp}))} assuming that \\axiom{removeRedundantFactors(\\spad{lp})} returns \\axiom{\\spad{lp}} up to replacing some polynomial \\axiom{\\spad{pj}} in \\axiom{\\spad{lp}} by some some polynomial \\axiom{\\spad{qj}} associated to \\axiom{\\spad{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(\\spad{lp})} returns \\axiom{\\spad{lq}} such that if \\axiom{\\spad{lp} = [\\spad{p1},{}...,{}\\spad{pn}]} and \\axiom{\\spad{lq} = [\\spad{q1},{}...,{}\\spad{qm}]} then the product \\axiom{p1*p2*...\\spad{*pn}} vanishes iff the product \\axiom{q1*q2*...\\spad{*qm}} vanishes,{} and the product of degrees of the \\axiom{\\spad{qi}} is not greater than the one of the \\axiom{\\spad{pj}},{} and no polynomial in \\axiom{\\spad{lq}} divides another polynomial in \\axiom{\\spad{lq}}. In particular,{} polynomials lying in the base ring \\axiom{\\spad{R}} are removed. Moreover,{} \\axiom{\\spad{lq}} is sorted \\spad{w}.\\spad{r}.\\spad{t} \\axiom{infRittWu?}. Furthermore,{} if \\spad{R} is \\spad{gcd}-domain,{} the polynomials in \\axiom{\\spad{lq}} are pairwise without common non trivial factor."))) @@ -3777,8 +3777,8 @@ NIL NIL NIL (-962 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")) (|convert| (($ (|List| |#1|)) "\\spad{convert(l)} takes a list of elements,{} \\spad{l},{} from the domain Ring and returns the form of point category.")) (|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}."))) -((-4370 . T) (-4369 . T) (-4284 . T)) +((|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}."))) +((-4370 . T) (-4369 . T)) NIL (-963 R1 R2) ((|constructor| (NIL "This package \\undocumented")) (|map| (((|Point| |#2|) (|Mapping| |#2| |#1|) (|Point| |#1|)) "\\spad{map(f,{}p)} \\undocumented"))) @@ -3796,7 +3796,7 @@ NIL ((|constructor| (NIL "This package \\undocumented{}")) (|map| ((|#4| (|Mapping| |#4| (|Polynomial| |#1|)) |#4|) "\\spad{map(f,{}p)} \\undocumented{}")) (|pushup| ((|#4| |#4| (|List| |#3|)) "\\spad{pushup(p,{}lv)} \\undocumented{}") ((|#4| |#4| |#3|) "\\spad{pushup(p,{}v)} \\undocumented{}")) (|pushdown| ((|#4| |#4| (|List| |#3|)) "\\spad{pushdown(p,{}lv)} \\undocumented{}") ((|#4| |#4| |#3|) "\\spad{pushdown(p,{}v)} \\undocumented{}")) (|variable| (((|Union| $ "failed") (|Symbol|)) "\\spad{variable(s)} makes an element from symbol \\spad{s} or fails")) (|convert| (((|Symbol|) $) "\\spad{convert(x)} converts \\spad{x} to a symbol"))) NIL NIL -(-967 K R UP -3219) +(-967 K R UP -3105) ((|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{\\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{\\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{\\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{\\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{\\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{\\spad{wi} = sum(bij * vj,{} j = 1..n)}."))) NIL NIL @@ -3826,7 +3826,7 @@ NIL ((|HasCategory| |#2| (QUOTE (-891))) (|HasCategory| |#2| (QUOTE (-538))) (|HasCategory| |#2| (QUOTE (-301))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (QUOTE (-1004))) (|HasCategory| |#2| (QUOTE (-806))) (|HasCategory| |#2| (QUOTE (-833))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-1130)))) (-974 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}."))) -((-4284 . T) (-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) +((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-975 |n| K) ((|constructor| (NIL "This domain provides modest support for quadratic forms.")) (|elt| ((|#2| $ (|DirectProduct| |#1| |#2|)) "\\spad{elt(qf,{}v)} evaluates the quadratic form \\spad{qf} on the vector \\spad{v},{} producing a scalar.")) (|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}."))) @@ -3838,7 +3838,7 @@ NIL NIL (-977 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}) = \\spad{#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."))) -((-4369 . T) (-4370 . T) (-4284 . T)) +((-4369 . T) (-4370 . T)) NIL (-978 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}."))) @@ -3855,11 +3855,11 @@ NIL (-981 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.}"))) ((-4362 |has| |#1| (-284)) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-357))) (-4028 (|HasCategory| |#1| (QUOTE (-284))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-284))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -280) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-1040))) (|HasCategory| |#1| (QUOTE (-538))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357))))) +((|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-357))) (-3988 (|HasCategory| |#1| (QUOTE (-284))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-284))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -280) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-1040))) (|HasCategory| |#1| (QUOTE (-538)))) (-982 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}."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-983 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 @@ -3868,14 +3868,14 @@ NIL ((|constructor| (NIL "The \\spad{RadicalCategory} is a model for the rational numbers.")) (** (($ $ (|Fraction| (|Integer|))) "\\spad{x ** y} is the rational exponentiation of \\spad{x} by the power \\spad{y}.")) (|nthRoot| (($ $ (|Integer|)) "\\spad{nthRoot(x,{}n)} returns the \\spad{n}th root of \\spad{x}.")) (|sqrt| (($ $) "\\spad{sqrt(x)} returns the square root of \\spad{x}."))) NIL NIL -(-985 -3219 UP UPUP |radicnd| |n|) +(-985 -3105 UP UPUP |radicnd| |n|) ((|constructor| (NIL "Function field defined by y**n = \\spad{f}(\\spad{x})."))) ((-4362 |has| (-401 |#2|) (-357)) (-4367 |has| (-401 |#2|) (-357)) (-4361 |has| (-401 |#2|) (-357)) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| (-401 |#2|) (QUOTE (-142))) (|HasCategory| (-401 |#2|) (QUOTE (-144))) (|HasCategory| (-401 |#2|) (QUOTE (-343))) (-4028 (|HasCategory| (-401 |#2|) (QUOTE (-357))) (|HasCategory| (-401 |#2|) (QUOTE (-343)))) (|HasCategory| (-401 |#2|) (QUOTE (-357))) (|HasCategory| (-401 |#2|) (QUOTE (-362))) (-4028 (-12 (|HasCategory| (-401 |#2|) (QUOTE (-228))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (|HasCategory| (-401 |#2|) (QUOTE (-343)))) (-4028 (-12 (|HasCategory| (-401 |#2|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (-12 (|HasCategory| (-401 |#2|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-401 |#2|) (QUOTE (-343))))) (|HasCategory| (-401 |#2|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| (-401 |#2|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-401 |#2|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-362))) (-4028 (|HasCategory| (-401 |#2|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (-12 (|HasCategory| (-401 |#2|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (-12 (|HasCategory| (-401 |#2|) (QUOTE (-228))) (|HasCategory| (-401 |#2|) (QUOTE (-357))))) +((|HasCategory| (-401 |#2|) (QUOTE (-142))) (|HasCategory| (-401 |#2|) (QUOTE (-144))) (|HasCategory| (-401 |#2|) (QUOTE (-343))) (-3988 (|HasCategory| (-401 |#2|) (QUOTE (-357))) (|HasCategory| (-401 |#2|) (QUOTE (-343)))) (|HasCategory| (-401 |#2|) (QUOTE (-357))) (|HasCategory| (-401 |#2|) (QUOTE (-362))) (-3988 (-12 (|HasCategory| (-401 |#2|) (QUOTE (-228))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (|HasCategory| (-401 |#2|) (QUOTE (-343)))) (-3988 (-12 (|HasCategory| (-401 |#2|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (-12 (|HasCategory| (-401 |#2|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-401 |#2|) (QUOTE (-343))))) (|HasCategory| (-401 |#2|) (LIST (QUOTE -626) (QUOTE (-553)))) (-3988 (|HasCategory| (-401 |#2|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (|HasCategory| (-401 |#2|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-401 |#2|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-362))) (-12 (|HasCategory| (-401 |#2|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-401 |#2|) (QUOTE (-357)))) (-12 (|HasCategory| (-401 |#2|) (QUOTE (-228))) (|HasCategory| (-401 |#2|) (QUOTE (-357))))) (-986 |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.")) (|coerce| (((|Fraction| (|Integer|)) $) "\\spad{coerce(rx)} converts a radix expansion to a rational number."))) +((|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."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| (-553) (QUOTE (-891))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| (-553) (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-144))) (|HasCategory| (-553) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-553) (QUOTE (-1004))) (|HasCategory| (-553) (QUOTE (-806))) (-4028 (|HasCategory| (-553) (QUOTE (-806))) (|HasCategory| (-553) (QUOTE (-833)))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-1130))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-553) (QUOTE (-228))) (|HasCategory| (-553) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-553) (LIST (QUOTE -507) (QUOTE (-1155)) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -303) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -280) (QUOTE (-553)) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-301))) (|HasCategory| (-553) (QUOTE (-538))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-553) (LIST (QUOTE -626) (QUOTE (-553)))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (|HasCategory| (-553) (QUOTE (-142))))) +((|HasCategory| (-553) (QUOTE (-891))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| (-553) (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-144))) (|HasCategory| (-553) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-553) (QUOTE (-1004))) (|HasCategory| (-553) (QUOTE (-806))) (-3988 (|HasCategory| (-553) (QUOTE (-806))) (|HasCategory| (-553) (QUOTE (-833)))) (|HasCategory| (-553) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-1130))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| (-553) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| (-553) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| (-553) (QUOTE (-228))) (|HasCategory| (-553) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| (-553) (LIST (QUOTE -507) (QUOTE (-1155)) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -303) (QUOTE (-553)))) (|HasCategory| (-553) (LIST (QUOTE -280) (QUOTE (-553)) (QUOTE (-553)))) (|HasCategory| (-553) (QUOTE (-301))) (|HasCategory| (-553) (QUOTE (-538))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-553) (LIST (QUOTE -626) (QUOTE (-553)))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-553) (QUOTE (-891)))) (|HasCategory| (-553) (QUOTE (-142))))) (-987) ((|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 @@ -3898,7 +3898,7 @@ NIL ((|HasAttribute| |#1| (QUOTE -4370)) (|HasCategory| |#2| (QUOTE (-1079)))) (-992 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{:=} \\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}."))) -((-4284 . T)) +NIL NIL (-993 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} \\spad{**} (1/2)}") (($ (|Fraction| (|Integer|))) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} \\spad{**} (1/2)}") (($ $) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} \\spad{**} (1/2)}") (($ $ (|PositiveInteger|)) "\\axiom{sqrt(\\spad{x},{}\\spad{n})} is \\axiom{\\spad{x} \\spad{**} (1/n)}")) (|allRootsOf| (((|List| $) (|Polynomial| (|Integer|))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|Polynomial| (|Fraction| (|Integer|)))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|Polynomial| $)) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|SparseUnivariatePolynomial| (|Integer|))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|SparseUnivariatePolynomial| (|Fraction| (|Integer|)))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|SparseUnivariatePolynomial| $)) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely")) (|rootOf| (((|Union| $ "failed") (|SparseUnivariatePolynomial| $) (|PositiveInteger|)) "\\axiom{rootOf(pol,{}\\spad{n})} creates the \\spad{n}th root for the order of \\axiom{pol} and gives it unique name") (((|Union| $ "failed") (|SparseUnivariatePolynomial| $) (|PositiveInteger|) (|OutputForm|)) "\\axiom{rootOf(pol,{}\\spad{n},{}name)} creates the \\spad{n}th root for the order of \\axiom{pol} and names it \\axiom{name}")) (|mainValue| (((|Union| (|SparseUnivariatePolynomial| $) "failed") $) "\\axiom{mainValue(\\spad{x})} is the expression of \\axiom{\\spad{x}} in terms of \\axiom{SparseUnivariatePolynomial(\\$)}")) (|mainDefiningPolynomial| (((|Union| (|SparseUnivariatePolynomial| $) "failed") $) "\\axiom{mainDefiningPolynomial(\\spad{x})} is the defining polynomial for the main algebraic quantity of \\axiom{\\spad{x}}")) (|mainForm| (((|Union| (|OutputForm|) "failed") $) "\\axiom{mainForm(\\spad{x})} is the main algebraic quantity name of \\axiom{\\spad{x}}"))) @@ -3908,19 +3908,19 @@ NIL ((|constructor| (NIL "\\axiomType{RealClosedField} provides common acces functions for all real closed fields.")) (|approximate| (((|Fraction| (|Integer|)) $ $) "\\axiom{approximate(\\spad{n},{}\\spad{p})} gives an approximation of \\axiom{\\spad{n}} that has precision \\axiom{\\spad{p}}")) (|rename| (($ $ (|OutputForm|)) "\\axiom{rename(\\spad{x},{}name)} gives a new number that prints as name")) (|rename!| (($ $ (|OutputForm|)) "\\axiom{rename!(\\spad{x},{}name)} changes the way \\axiom{\\spad{x}} is printed")) (|sqrt| (($ (|Integer|)) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} \\spad{**} (1/2)}") (($ (|Fraction| (|Integer|))) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} \\spad{**} (1/2)}") (($ $) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} \\spad{**} (1/2)}") (($ $ (|PositiveInteger|)) "\\axiom{sqrt(\\spad{x},{}\\spad{n})} is \\axiom{\\spad{x} \\spad{**} (1/n)}")) (|allRootsOf| (((|List| $) (|Polynomial| (|Integer|))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|Polynomial| (|Fraction| (|Integer|)))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|Polynomial| $)) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|SparseUnivariatePolynomial| (|Integer|))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|SparseUnivariatePolynomial| (|Fraction| (|Integer|)))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|SparseUnivariatePolynomial| $)) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely")) (|rootOf| (((|Union| $ "failed") (|SparseUnivariatePolynomial| $) (|PositiveInteger|)) "\\axiom{rootOf(pol,{}\\spad{n})} creates the \\spad{n}th root for the order of \\axiom{pol} and gives it unique name") (((|Union| $ "failed") (|SparseUnivariatePolynomial| $) (|PositiveInteger|) (|OutputForm|)) "\\axiom{rootOf(pol,{}\\spad{n},{}name)} creates the \\spad{n}th root for the order of \\axiom{pol} and names it \\axiom{name}")) (|mainValue| (((|Union| (|SparseUnivariatePolynomial| $) "failed") $) "\\axiom{mainValue(\\spad{x})} is the expression of \\axiom{\\spad{x}} in terms of \\axiom{SparseUnivariatePolynomial(\\$)}")) (|mainDefiningPolynomial| (((|Union| (|SparseUnivariatePolynomial| $) "failed") $) "\\axiom{mainDefiningPolynomial(\\spad{x})} is the defining polynomial for the main algebraic quantity of \\axiom{\\spad{x}}")) (|mainForm| (((|Union| (|OutputForm|) "failed") $) "\\axiom{mainForm(\\spad{x})} is the main algebraic quantity name of \\axiom{\\spad{x}}"))) ((-4362 . T) (-4367 . T) (-4361 . T) (-4364 . T) (-4363 . T) ((-4371 "*") . T) (-4366 . T)) NIL -(-995 R -3219) +(-995 R -3105) ((|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 -(-996 R -3219) +(-996 R -3105) ((|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 -(-997 -3219 UP) +(-997 -3105 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 -(-998 -3219 UP) +(-998 -3105 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 @@ -3955,8 +3955,8 @@ NIL (-1006 |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"))) ((-4362 . T) (-4367 . T) (-4361 . T) (-4364 . T) (-4363 . T) ((-4371 "*") . T) (-4366 . T)) -((-4028 (|HasCategory| (-401 (-553)) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-401 (-553)) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-401 (-553)) (LIST (QUOTE -1020) (QUOTE (-553))))) -(-1007 -3219 L) +((-3988 (|HasCategory| (-401 (-553)) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-401 (-553)) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-401 (-553)) (LIST (QUOTE -1020) (QUOTE (-553))))) +(-1007 -3105 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{\\spad{fi}} must satisfy \\spad{op \\spad{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 @@ -3992,14 +3992,14 @@ NIL ((|constructor| (NIL "This package provides coercions for the special types \\spadtype{Exit} and \\spadtype{Void}.")) (|coerce| ((|#1| (|Exit|)) "\\spad{coerce(e)} is never really evaluated. This coercion is used for formal type correctness when a function will not return directly to its caller.") (((|Void|) |#1|) "\\spad{coerce(s)} throws all information about \\spad{s} away. This coercion allows values of any type to appear in contexts where they will not be used. For example,{} it allows the resolution of different types in the \\spad{then} and \\spad{else} branches when an \\spad{if} is in a context where the resulting value is not used."))) NIL NIL -(-1016 -3219 |Expon| |VarSet| |FPol| |LFPol|) +(-1016 -3105 |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"))) (((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-1017) ((|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.}"))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2669) (QUOTE (-1155))) (LIST (QUOTE |:|) (QUOTE -3359) (QUOTE (-52))))))) (-4028 (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (QUOTE (-1079))) (|HasCategory| (-52) (QUOTE (-1079)))) (-4028 (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-52) (QUOTE (-1079))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| (-52) (QUOTE (-1079))) (|HasCategory| (-52) (LIST (QUOTE -303) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (QUOTE (-1079))) (|HasCategory| (-1155) (QUOTE (-833))) (|HasCategory| (-52) (QUOTE (-1079))) (-4028 (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2578) (QUOTE (-1155))) (LIST (QUOTE |:|) (QUOTE -3256) (QUOTE (-52))))))) (-3988 (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (QUOTE (-1079))) (|HasCategory| (-52) (QUOTE (-1079)))) (-3988 (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-52) (QUOTE (-1079))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| (-52) (QUOTE (-1079))) (|HasCategory| (-52) (LIST (QUOTE -303) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (QUOTE (-1079))) (|HasCategory| (-1155) (QUOTE (-833))) (|HasCategory| (-52) (QUOTE (-1079))) (-3988 (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (LIST (QUOTE -600) (QUOTE (-845))))) (-1018) ((|constructor| (NIL "This domain represents `return' expressions.")) (|expression| (((|SpadAst|) $) "\\spad{expression(e)} returns the expression returned by `e'."))) NIL @@ -4049,14 +4049,14 @@ NIL NIL NIL (-1030 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\"}.")) (|coerce| (($ (|Integer|)) "\\spad{coerce(i)} converts the integer \\spad{i} to a member of the given domain.")) (|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."))) +((|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 (-1031) -((|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\"}.")) (|coerce| (($ (|Integer|)) "\\spad{coerce(i)} converts the integer \\spad{i} to a member of the given domain.")) (|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."))) +((|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."))) ((-4366 . T)) NIL -(-1032 |xx| -3219) +(-1032 |xx| -3105) ((|constructor| (NIL "This package exports rational interpolation algorithms"))) NIL NIL @@ -4066,12 +4066,12 @@ NIL ((|HasCategory| |#4| (QUOTE (-301))) (|HasCategory| |#4| (QUOTE (-357))) (|HasCategory| |#4| (QUOTE (-545))) (|HasCategory| |#4| (QUOTE (-169)))) (-1034 |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"))) -((-4369 . T) (-4284 . T) (-4364 . T) (-4363 . T)) +((-4369 . T) (-4364 . T) (-4363 . T)) NIL (-1035 |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.")) (|coerce| (((|Matrix| |#3|) $) "\\spad{coerce(m)} converts a matrix of type \\spadtype{RectangularMatrix} to a matrix of type \\spad{Matrix}.")) (|rectangularMatrix| (($ (|Matrix| |#3|)) "\\spad{rectangularMatrix(m)} converts a matrix of type \\spadtype{Matrix} to a matrix of type \\spad{RectangularMatrix}."))) +((|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}."))) ((-4369 . T) (-4364 . T) (-4363 . T)) -((-4028 (-12 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|))))) (|HasCategory| |#3| (LIST (QUOTE -601) (QUOTE (-529)))) (-4028 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-357)))) (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (QUOTE (-301))) (|HasCategory| |#3| (QUOTE (-545))) (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|))))) +((-3988 (-12 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|))))) (|HasCategory| |#3| (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-357)))) (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (QUOTE (-301))) (|HasCategory| |#3| (QUOTE (-545))) (|HasCategory| |#3| (QUOTE (-169))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (|HasCategory| |#3| (LIST (QUOTE -600) (QUOTE (-845))))) (-1036 |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 @@ -4097,13 +4097,13 @@ NIL NIL NIL (-1042) -((|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}.")) (|convert| (($ (|Symbol|)) "\\spad{convert(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."))) +((|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."))) ((-4357 . T) (-4361 . T) (-4356 . T) (-4367 . T) (-4368 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-1043) ((|constructor| (NIL "\\axiomType{RoutinesTable} implements a database and associated tuning mechanisms for a set of known NAG routines")) (|recoverAfterFail| (((|Union| (|String|) "failed") $ (|String|) (|Integer|)) "\\spad{recoverAfterFail(routs,{}routineName,{}ifailValue)} acts on the instructions given by the ifail list")) (|showTheRoutinesTable| (($) "\\spad{showTheRoutinesTable()} returns the current table of NAG routines.")) (|deleteRoutine!| (($ $ (|Symbol|)) "\\spad{deleteRoutine!(R,{}s)} destructively deletes the given routine from the current database of NAG routines")) (|getExplanations| (((|List| (|String|)) $ (|String|)) "\\spad{getExplanations(R,{}s)} gets the explanations of the output parameters for the given NAG routine.")) (|getMeasure| (((|Float|) $ (|Symbol|)) "\\spad{getMeasure(R,{}s)} gets the current value of the maximum measure for the given NAG routine.")) (|changeMeasure| (($ $ (|Symbol|) (|Float|)) "\\spad{changeMeasure(R,{}s,{}newValue)} changes the maximum value for a measure of the given NAG routine.")) (|changeThreshhold| (($ $ (|Symbol|) (|Float|)) "\\spad{changeThreshhold(R,{}s,{}newValue)} changes the value below which,{} given a NAG routine generating a higher measure,{} the routines will make no attempt to generate a measure.")) (|selectMultiDimensionalRoutines| (($ $) "\\spad{selectMultiDimensionalRoutines(R)} chooses only those routines from the database which are designed for use with multi-dimensional expressions")) (|selectNonFiniteRoutines| (($ $) "\\spad{selectNonFiniteRoutines(R)} chooses only those routines from the database which are designed for use with non-finite expressions.")) (|selectSumOfSquaresRoutines| (($ $) "\\spad{selectSumOfSquaresRoutines(R)} chooses only those routines from the database which are designed for use with sums of squares")) (|selectFiniteRoutines| (($ $) "\\spad{selectFiniteRoutines(R)} chooses only those routines from the database which are designed for use with finite expressions")) (|selectODEIVPRoutines| (($ $) "\\spad{selectODEIVPRoutines(R)} chooses only those routines from the database which are for the solution of ODE\\spad{'s}")) (|selectPDERoutines| (($ $) "\\spad{selectPDERoutines(R)} chooses only those routines from the database which are for the solution of PDE\\spad{'s}")) (|selectOptimizationRoutines| (($ $) "\\spad{selectOptimizationRoutines(R)} chooses only those routines from the database which are for integration")) (|selectIntegrationRoutines| (($ $) "\\spad{selectIntegrationRoutines(R)} chooses only those routines from the database which are for integration")) (|routines| (($) "\\spad{routines()} initialises a database of known NAG routines")) (|concat| (($ $ $) "\\spad{concat(x,{}y)} merges two tables \\spad{x} and \\spad{y}"))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2669) (QUOTE (-1155))) (LIST (QUOTE |:|) (QUOTE -3359) (QUOTE (-52))))))) (-4028 (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (QUOTE (-1079))) (|HasCategory| (-52) (QUOTE (-1079)))) (-4028 (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-52) (QUOTE (-1079))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| (-52) (QUOTE (-1079))) (|HasCategory| (-52) (LIST (QUOTE -303) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (QUOTE (-1079))) (|HasCategory| (-1155) (QUOTE (-833))) (|HasCategory| (-52) (QUOTE (-1079))) (-4028 (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2669 (-1155)) (|:| -3359 (-52))) (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2578) (QUOTE (-1155))) (LIST (QUOTE |:|) (QUOTE -3256) (QUOTE (-52))))))) (-3988 (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (QUOTE (-1079))) (|HasCategory| (-52) (QUOTE (-1079)))) (-3988 (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-52) (QUOTE (-1079))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| (-52) (QUOTE (-1079))) (|HasCategory| (-52) (LIST (QUOTE -303) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (QUOTE (-1079))) (|HasCategory| (-1155) (QUOTE (-833))) (|HasCategory| (-52) (QUOTE (-1079))) (-3988 (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-52) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2578 (-1155)) (|:| -3256 (-52))) (LIST (QUOTE -600) (QUOTE (-845))))) (-1044 S R E V) ((|constructor| (NIL "A category for general multi-variate polynomials with coefficients in a ring,{} variables in an ordered set,{} and exponents from an ordered abelian monoid,{} with a \\axiomOp{sup} operation. When not constant,{} such a polynomial is viewed as a univariate polynomial in its main variable \\spad{w}. \\spad{r}. \\spad{t}. to the total ordering on the elements in the ordered set,{} so that some operations usually defined for univariate polynomials make sense here.")) (|mainSquareFreePart| (($ $) "\\axiom{mainSquareFreePart(\\spad{p})} returns the square free part of \\axiom{\\spad{p}} viewed as a univariate polynomial in its main variable and with coefficients in the polynomial ring generated by its other variables over \\axiom{\\spad{R}}.")) (|mainPrimitivePart| (($ $) "\\axiom{mainPrimitivePart(\\spad{p})} returns the primitive part of \\axiom{\\spad{p}} viewed as a univariate polynomial in its main variable and with coefficients in the polynomial ring generated by its other variables over \\axiom{\\spad{R}}.")) (|mainContent| (($ $) "\\axiom{mainContent(\\spad{p})} returns the content of \\axiom{\\spad{p}} viewed as a univariate polynomial in its main variable and with coefficients in the polynomial ring generated by its other variables over \\axiom{\\spad{R}}.")) (|primitivePart!| (($ $) "\\axiom{primitivePart!(\\spad{p})} replaces \\axiom{\\spad{p}} by its primitive part.")) (|gcd| ((|#2| |#2| $) "\\axiom{\\spad{gcd}(\\spad{r},{}\\spad{p})} returns the \\spad{gcd} of \\axiom{\\spad{r}} and the content of \\axiom{\\spad{p}}.")) (|nextsubResultant2| (($ $ $ $ $) "\\axiom{nextsubResultant2(\\spad{p},{}\\spad{q},{}\\spad{z},{}\\spad{s})} is the multivariate version of the operation \\axiomOpFrom{next_sousResultant2}{PseudoRemainderSequence} from the \\axiomType{PseudoRemainderSequence} constructor.")) (|LazardQuotient2| (($ $ $ $ (|NonNegativeInteger|)) "\\axiom{LazardQuotient2(\\spad{p},{}a,{}\\spad{b},{}\\spad{n})} returns \\axiom{(a**(\\spad{n}-1) * \\spad{p}) exquo \\spad{b**}(\\spad{n}-1)} assuming that this quotient does not fail.")) (|LazardQuotient| (($ $ $ (|NonNegativeInteger|)) "\\axiom{LazardQuotient(a,{}\\spad{b},{}\\spad{n})} returns \\axiom{a**n exquo \\spad{b**}(\\spad{n}-1)} assuming that this quotient does not fail.")) (|lastSubResultant| (($ $ $) "\\axiom{lastSubResultant(a,{}\\spad{b})} returns the last non-zero subresultant of \\axiom{a} and \\axiom{\\spad{b}} where \\axiom{a} and \\axiom{\\spad{b}} are assumed to have the same main variable \\axiom{\\spad{v}} and are viewed as univariate polynomials in \\axiom{\\spad{v}}.")) (|subResultantChain| (((|List| $) $ $) "\\axiom{subResultantChain(a,{}\\spad{b})},{} where \\axiom{a} and \\axiom{\\spad{b}} are not contant polynomials with the same main variable,{} returns the subresultant chain of \\axiom{a} and \\axiom{\\spad{b}}.")) (|resultant| (($ $ $) "\\axiom{resultant(a,{}\\spad{b})} computes the resultant of \\axiom{a} and \\axiom{\\spad{b}} where \\axiom{a} and \\axiom{\\spad{b}} are assumed to have the same main variable \\axiom{\\spad{v}} and are viewed as univariate polynomials in \\axiom{\\spad{v}}.")) (|halfExtendedSubResultantGcd2| (((|Record| (|:| |gcd| $) (|:| |coef2| $)) $ $) "\\axiom{halfExtendedSubResultantGcd2(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}\\spad{cb}]} if \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{}\\spad{cb}]} otherwise produces an error.")) (|halfExtendedSubResultantGcd1| (((|Record| (|:| |gcd| $) (|:| |coef1| $)) $ $) "\\axiom{halfExtendedSubResultantGcd1(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca]} if \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{}\\spad{cb}]} otherwise produces an error.")) (|extendedSubResultantGcd| (((|Record| (|:| |gcd| $) (|:| |coef1| $) (|:| |coef2| $)) $ $) "\\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[ca,{}\\spad{cb},{}\\spad{r}]} such that \\axiom{\\spad{r}} is \\axiom{subResultantGcd(a,{}\\spad{b})} and we have \\axiom{ca * a + \\spad{cb} * \\spad{cb} = \\spad{r}} .")) (|subResultantGcd| (($ $ $) "\\axiom{subResultantGcd(a,{}\\spad{b})} computes a \\spad{gcd} of \\axiom{a} and \\axiom{\\spad{b}} where \\axiom{a} and \\axiom{\\spad{b}} are assumed to have the same main variable \\axiom{\\spad{v}} and are viewed as univariate polynomials in \\axiom{\\spad{v}} with coefficients in the fraction field of the polynomial ring generated by their other variables over \\axiom{\\spad{R}}.")) (|exactQuotient!| (($ $ $) "\\axiom{exactQuotient!(a,{}\\spad{b})} replaces \\axiom{a} by \\axiom{exactQuotient(a,{}\\spad{b})}") (($ $ |#2|) "\\axiom{exactQuotient!(\\spad{p},{}\\spad{r})} replaces \\axiom{\\spad{p}} by \\axiom{exactQuotient(\\spad{p},{}\\spad{r})}.")) (|exactQuotient| (($ $ $) "\\axiom{exactQuotient(a,{}\\spad{b})} computes the exact quotient of \\axiom{a} by \\axiom{\\spad{b}},{} which is assumed to be a divisor of \\axiom{a}. No error is returned if this exact quotient fails!") (($ $ |#2|) "\\axiom{exactQuotient(\\spad{p},{}\\spad{r})} computes the exact quotient of \\axiom{\\spad{p}} by \\axiom{\\spad{r}},{} which is assumed to be a divisor of \\axiom{\\spad{p}}. No error is returned if this exact quotient fails!")) (|primPartElseUnitCanonical!| (($ $) "\\axiom{primPartElseUnitCanonical!(\\spad{p})} replaces \\axiom{\\spad{p}} by \\axiom{primPartElseUnitCanonical(\\spad{p})}.")) (|primPartElseUnitCanonical| (($ $) "\\axiom{primPartElseUnitCanonical(\\spad{p})} returns \\axiom{primitivePart(\\spad{p})} if \\axiom{\\spad{R}} is a \\spad{gcd}-domain,{} otherwise \\axiom{unitCanonical(\\spad{p})}.")) (|convert| (($ (|Polynomial| |#2|)) "\\axiom{convert(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}},{} otherwise an error is produced.") (($ (|Polynomial| (|Integer|))) "\\axiom{convert(\\spad{p})} returns the same as \\axiom{retract(\\spad{p})}.") (($ (|Polynomial| (|Integer|))) "\\axiom{convert(\\spad{p})} returns the same as \\axiom{retract(\\spad{p})}") (($ (|Polynomial| (|Fraction| (|Integer|)))) "\\axiom{convert(\\spad{p})} returns the same as \\axiom{retract(\\spad{p})}.")) (|retract| (($ (|Polynomial| |#2|)) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.") (($ (|Polynomial| |#2|)) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.") (($ (|Polynomial| (|Integer|))) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.") (($ (|Polynomial| |#2|)) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.") (($ (|Polynomial| (|Integer|))) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.") (($ (|Polynomial| (|Fraction| (|Integer|)))) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.")) (|retractIfCan| (((|Union| $ "failed") (|Polynomial| |#2|)) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.") (((|Union| $ "failed") (|Polynomial| |#2|)) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.") (((|Union| $ "failed") (|Polynomial| (|Integer|))) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.") (((|Union| $ "failed") (|Polynomial| |#2|)) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.") (((|Union| $ "failed") (|Polynomial| (|Integer|))) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.") (((|Union| $ "failed") (|Polynomial| (|Fraction| (|Integer|)))) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.")) (|initiallyReduce| (($ $ $) "\\axiom{initiallyReduce(a,{}\\spad{b})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{initiallyReduced?(\\spad{r},{}\\spad{b})} holds and there exists an integer \\axiom{\\spad{e}} such that \\axiom{init(\\spad{b})^e a - \\spad{r}} is zero modulo \\axiom{\\spad{b}}.")) (|headReduce| (($ $ $) "\\axiom{headReduce(a,{}\\spad{b})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{headReduced?(\\spad{r},{}\\spad{b})} holds and there exists an integer \\axiom{\\spad{e}} such that \\axiom{init(\\spad{b})^e a - \\spad{r}} is zero modulo \\axiom{\\spad{b}}.")) (|lazyResidueClass| (((|Record| (|:| |polnum| $) (|:| |polden| $) (|:| |power| (|NonNegativeInteger|))) $ $) "\\axiom{lazyResidueClass(a,{}\\spad{b})} returns \\axiom{[\\spad{p},{}\\spad{q},{}\\spad{n}]} where \\axiom{\\spad{p} / q**n} represents the residue class of \\axiom{a} modulo \\axiom{\\spad{b}} and \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{b}} and \\axiom{\\spad{q}} is \\axiom{init(\\spad{b})}.")) (|monicModulo| (($ $ $) "\\axiom{monicModulo(a,{}\\spad{b})} computes \\axiom{a mod \\spad{b}},{} if \\axiom{\\spad{b}} is monic as univariate polynomial in its main variable.")) (|pseudoDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\axiom{pseudoDivide(a,{}\\spad{b})} computes \\axiom{[pquo(a,{}\\spad{b}),{}prem(a,{}\\spad{b})]},{} both polynomials viewed as univariate polynomials in the main variable of \\axiom{\\spad{b}},{} if \\axiom{\\spad{b}} is not a constant polynomial.")) (|lazyPseudoDivide| (((|Record| (|:| |coef| $) (|:| |gap| (|NonNegativeInteger|)) (|:| |quotient| $) (|:| |remainder| $)) $ $ |#4|) "\\axiom{lazyPseudoDivide(a,{}\\spad{b},{}\\spad{v})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]} such that \\axiom{\\spad{r} = lazyPrem(a,{}\\spad{b},{}\\spad{v})},{} \\axiom{(c**g)\\spad{*r} = prem(a,{}\\spad{b},{}\\spad{v})} and \\axiom{\\spad{q}} is the pseudo-quotient computed in this lazy pseudo-division.") (((|Record| (|:| |coef| $) (|:| |gap| (|NonNegativeInteger|)) (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\axiom{lazyPseudoDivide(a,{}\\spad{b})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]} such that \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{r}] = lazyPremWithDefault(a,{}\\spad{b})} and \\axiom{\\spad{q}} is the pseudo-quotient computed in this lazy pseudo-division.")) (|lazyPremWithDefault| (((|Record| (|:| |coef| $) (|:| |gap| (|NonNegativeInteger|)) (|:| |remainder| $)) $ $ |#4|) "\\axiom{lazyPremWithDefault(a,{}\\spad{b},{}\\spad{v})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{r}]} such that \\axiom{\\spad{r} = lazyPrem(a,{}\\spad{b},{}\\spad{v})} and \\axiom{(c**g)\\spad{*r} = prem(a,{}\\spad{b},{}\\spad{v})}.") (((|Record| (|:| |coef| $) (|:| |gap| (|NonNegativeInteger|)) (|:| |remainder| $)) $ $) "\\axiom{lazyPremWithDefault(a,{}\\spad{b})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{r}]} such that \\axiom{\\spad{r} = lazyPrem(a,{}\\spad{b})} and \\axiom{(c**g)\\spad{*r} = prem(a,{}\\spad{b})}.")) (|lazyPquo| (($ $ $ |#4|) "\\axiom{lazyPquo(a,{}\\spad{b},{}\\spad{v})} returns the polynomial \\axiom{\\spad{q}} such that \\axiom{lazyPseudoDivide(a,{}\\spad{b},{}\\spad{v})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]}.") (($ $ $) "\\axiom{lazyPquo(a,{}\\spad{b})} returns the polynomial \\axiom{\\spad{q}} such that \\axiom{lazyPseudoDivide(a,{}\\spad{b})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]}.")) (|lazyPrem| (($ $ $ |#4|) "\\axiom{lazyPrem(a,{}\\spad{b},{}\\spad{v})} returns the polynomial \\axiom{\\spad{r}} reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{b}} viewed as univariate polynomials in the variable \\axiom{\\spad{v}} such that \\axiom{\\spad{b}} divides \\axiom{init(\\spad{b})^e a - \\spad{r}} where \\axiom{\\spad{e}} is the number of steps of this pseudo-division.") (($ $ $) "\\axiom{lazyPrem(a,{}\\spad{b})} returns the polynomial \\axiom{\\spad{r}} reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{b}} and such that \\axiom{\\spad{b}} divides \\axiom{init(\\spad{b})^e a - \\spad{r}} where \\axiom{\\spad{e}} is the number of steps of this pseudo-division.")) (|pquo| (($ $ $ |#4|) "\\axiom{pquo(a,{}\\spad{b},{}\\spad{v})} computes the pseudo-quotient of \\axiom{a} by \\axiom{\\spad{b}},{} both viewed as univariate polynomials in \\axiom{\\spad{v}}.") (($ $ $) "\\axiom{pquo(a,{}\\spad{b})} computes the pseudo-quotient of \\axiom{a} by \\axiom{\\spad{b}},{} both viewed as univariate polynomials in the main variable of \\axiom{\\spad{b}}.")) (|prem| (($ $ $ |#4|) "\\axiom{prem(a,{}\\spad{b},{}\\spad{v})} computes the pseudo-remainder of \\axiom{a} by \\axiom{\\spad{b}},{} both viewed as univariate polynomials in \\axiom{\\spad{v}}.") (($ $ $) "\\axiom{prem(a,{}\\spad{b})} computes the pseudo-remainder of \\axiom{a} by \\axiom{\\spad{b}},{} both viewed as univariate polynomials in the main variable of \\axiom{\\spad{b}}.")) (|normalized?| (((|Boolean|) $ (|List| $)) "\\axiom{normalized?(\\spad{q},{}\\spad{lp})} returns \\spad{true} iff \\axiom{normalized?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{\\spad{lp}}.") (((|Boolean|) $ $) "\\axiom{normalized?(a,{}\\spad{b})} returns \\spad{true} iff \\axiom{a} and its iterated initials have degree zero \\spad{w}.\\spad{r}.\\spad{t}. the main variable of \\axiom{\\spad{b}}")) (|initiallyReduced?| (((|Boolean|) $ (|List| $)) "\\axiom{initiallyReduced?(\\spad{q},{}\\spad{lp})} returns \\spad{true} iff \\axiom{initiallyReduced?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{\\spad{lp}}.") (((|Boolean|) $ $) "\\axiom{initiallyReduced?(a,{}\\spad{b})} returns \\spad{false} iff there exists an iterated initial of \\axiom{a} which is not reduced \\spad{w}.\\spad{r}.\\spad{t} \\axiom{\\spad{b}}.")) (|headReduced?| (((|Boolean|) $ (|List| $)) "\\axiom{headReduced?(\\spad{q},{}\\spad{lp})} returns \\spad{true} iff \\axiom{headReduced?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{\\spad{lp}}.") (((|Boolean|) $ $) "\\axiom{headReduced?(a,{}\\spad{b})} returns \\spad{true} iff \\axiom{degree(head(a),{}mvar(\\spad{b})) < mdeg(\\spad{b})}.")) (|reduced?| (((|Boolean|) $ (|List| $)) "\\axiom{reduced?(\\spad{q},{}\\spad{lp})} returns \\spad{true} iff \\axiom{reduced?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{\\spad{lp}}.") (((|Boolean|) $ $) "\\axiom{reduced?(a,{}\\spad{b})} returns \\spad{true} iff \\axiom{degree(a,{}mvar(\\spad{b})) < mdeg(\\spad{b})}.")) (|supRittWu?| (((|Boolean|) $ $) "\\axiom{supRittWu?(a,{}\\spad{b})} returns \\spad{true} if \\axiom{a} is greater than \\axiom{\\spad{b}} \\spad{w}.\\spad{r}.\\spad{t}. the Ritt and Wu Wen Tsun ordering using the refinement of Lazard.")) (|infRittWu?| (((|Boolean|) $ $) "\\axiom{infRittWu?(a,{}\\spad{b})} returns \\spad{true} if \\axiom{a} is less than \\axiom{\\spad{b}} \\spad{w}.\\spad{r}.\\spad{t}. the Ritt and Wu Wen Tsun ordering using the refinement of Lazard.")) (|RittWuCompare| (((|Union| (|Boolean|) "failed") $ $) "\\axiom{RittWuCompare(a,{}\\spad{b})} returns \\axiom{\"failed\"} if \\axiom{a} and \\axiom{\\spad{b}} have same rank \\spad{w}.\\spad{r}.\\spad{t}. Ritt and Wu Wen Tsun ordering using the refinement of Lazard,{} otherwise returns \\axiom{infRittWu?(a,{}\\spad{b})}.")) (|mainMonomials| (((|List| $) $) "\\axiom{mainMonomials(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns [1],{} otherwise returns the list of the monomials of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|mainCoefficients| (((|List| $) $) "\\axiom{mainCoefficients(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns [\\spad{p}],{} otherwise returns the list of the coefficients of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|leastMonomial| (($ $) "\\axiom{leastMonomial(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns \\axiom{1},{} otherwise,{} the monomial of \\axiom{\\spad{p}} with lowest degree,{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|mainMonomial| (($ $) "\\axiom{mainMonomial(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns \\axiom{1},{} otherwise,{} \\axiom{mvar(\\spad{p})} raised to the power \\axiom{mdeg(\\spad{p})}.")) (|quasiMonic?| (((|Boolean|) $) "\\axiom{quasiMonic?(\\spad{p})} returns \\spad{false} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns \\spad{true} iff the initial of \\axiom{\\spad{p}} lies in the base ring \\axiom{\\spad{R}}.")) (|monic?| (((|Boolean|) $) "\\axiom{monic?(\\spad{p})} returns \\spad{false} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns \\spad{true} iff \\axiom{\\spad{p}} is monic as a univariate polynomial in its main variable.")) (|reductum| (($ $ |#4|) "\\axiom{reductum(\\spad{p},{}\\spad{v})} returns the reductum of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in \\axiom{\\spad{v}}.")) (|leadingCoefficient| (($ $ |#4|) "\\axiom{leadingCoefficient(\\spad{p},{}\\spad{v})} returns the leading coefficient of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as A univariate polynomial in \\axiom{\\spad{v}}.")) (|deepestInitial| (($ $) "\\axiom{deepestInitial(\\spad{p})} returns an error if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns the last term of \\axiom{iteratedInitials(\\spad{p})}.")) (|iteratedInitials| (((|List| $) $) "\\axiom{iteratedInitials(\\spad{p})} returns \\axiom{[]} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns the list of the iterated initials of \\axiom{\\spad{p}}.")) (|deepestTail| (($ $) "\\axiom{deepestTail(\\spad{p})} returns \\axiom{0} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns tail(\\spad{p}),{} if \\axiom{tail(\\spad{p})} belongs to \\axiom{\\spad{R}} or \\axiom{mvar(tail(\\spad{p})) < mvar(\\spad{p})},{} otherwise returns \\axiom{deepestTail(tail(\\spad{p}))}.")) (|tail| (($ $) "\\axiom{tail(\\spad{p})} returns its reductum,{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|head| (($ $) "\\axiom{head(\\spad{p})} returns \\axiom{\\spad{p}} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns its leading term (monomial in the AXIOM sense),{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|init| (($ $) "\\axiom{init(\\spad{p})} returns an error if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns its leading coefficient,{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|mdeg| (((|NonNegativeInteger|) $) "\\axiom{mdeg(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{0},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns \\axiom{0},{} otherwise,{} returns the degree of \\axiom{\\spad{p}} in its main variable.")) (|mvar| ((|#4| $) "\\axiom{mvar(\\spad{p})} returns an error if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns its main variable \\spad{w}. \\spad{r}. \\spad{t}. to the total ordering on the elements in \\axiom{\\spad{V}}."))) NIL @@ -4134,7 +4134,7 @@ NIL NIL (-1051 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,{}...,{}\\spad{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,{}...,{}\\spad{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(\\spad{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}{\\spad{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 \\spad{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 \\spad{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 \\spad{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}."))) -((-4370 . T) (-4369 . T) (-4284 . T)) +((-4370 . T) (-4369 . T)) NIL (-1052 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 \\spad{gcd} over} \\indented{5}{algebraic towers of simple extensions\" In proceedings of 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},{}\\spad{ts})} has the same specifications as \\axiomOpFrom{squareFreePart}{RegularTriangularSetCategory}.")) (|toseInvertibleSet| (((|List| |#5|) |#4| |#5|) "\\axiom{toseInvertibleSet(\\spad{p1},{}\\spad{p2},{}\\spad{ts})} has the same specifications as \\axiomOpFrom{invertibleSet}{RegularTriangularSetCategory}.")) (|toseInvertible?| (((|List| (|Record| (|:| |val| (|Boolean|)) (|:| |tower| |#5|))) |#4| |#5|) "\\axiom{toseInvertible?(\\spad{p1},{}\\spad{p2},{}\\spad{ts})} has the same specifications as \\axiomOpFrom{invertible?}{RegularTriangularSetCategory}.") (((|Boolean|) |#4| |#5|) "\\axiom{toseInvertible?(\\spad{p1},{}\\spad{p2},{}\\spad{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},{}\\spad{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},{}\\spad{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},{}\\spad{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},{}\\spad{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."))) @@ -4148,11 +4148,11 @@ NIL ((|constructor| (NIL "This domain implements named rules")) (|name| (((|Symbol|) $) "\\spad{name(x)} returns the symbol"))) NIL NIL -(-1055 |Base| R -3219) +(-1055 |Base| R -3105) ((|constructor| (NIL "\\indented{1}{Rules for the pattern matcher} Author: Manuel Bronstein Date Created: 24 Oct 1988 Date Last Updated: 26 October 1993 Keywords: pattern,{} matching,{} rule.")) (|quotedOperators| (((|List| (|Symbol|)) $) "\\spad{quotedOperators(r)} returns the list of operators on the right hand side of \\spad{r} that are considered quoted,{} that is they are not evaluated during any rewrite,{} but just applied formally to their arguments.")) (|elt| ((|#3| $ |#3| (|PositiveInteger|)) "\\spad{elt(r,{}f,{}n)} or \\spad{r}(\\spad{f},{} \\spad{n}) applies the rule \\spad{r} to \\spad{f} at most \\spad{n} times.")) (|rhs| ((|#3| $) "\\spad{rhs(r)} returns the right hand side of the rule \\spad{r}.")) (|lhs| ((|#3| $) "\\spad{lhs(r)} returns the left hand side of the rule \\spad{r}.")) (|pattern| (((|Pattern| |#1|) $) "\\spad{pattern(r)} returns the pattern corresponding to the left hand side of the rule \\spad{r}.")) (|suchThat| (($ $ (|List| (|Symbol|)) (|Mapping| (|Boolean|) (|List| |#3|))) "\\spad{suchThat(r,{} [a1,{}...,{}an],{} f)} returns the rewrite rule \\spad{r} with the predicate \\spad{f(a1,{}...,{}an)} attached to it.")) (|rule| (($ |#3| |#3| (|List| (|Symbol|))) "\\spad{rule(f,{} g,{} [f1,{}...,{}fn])} creates the rewrite rule \\spad{f == eval(eval(g,{} g is f),{} [f1,{}...,{}fn])},{} that is a rule with left-hand side \\spad{f} and right-hand side \\spad{g}; The symbols \\spad{f1},{}...,{}\\spad{fn} are the operators that are considered quoted,{} that is they are not evaluated during any rewrite,{} but just applied formally to their arguments.") (($ |#3| |#3|) "\\spad{rule(f,{} g)} creates the rewrite rule: \\spad{f == eval(g,{} g is f)},{} with left-hand side \\spad{f} and right-hand side \\spad{g}."))) NIL NIL -(-1056 |Base| R -3219) +(-1056 |Base| R -3105) ((|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 @@ -4167,7 +4167,7 @@ NIL (-1059 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."))) ((-4362 |has| |#1| (-357)) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-343))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-343)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-362))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-343)))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155))))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (QUOTE (-357))))) +((|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-343))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-343)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-362))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-343)))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#1| (QUOTE (-343))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (QUOTE (-357))))) (-1060 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 @@ -4195,7 +4195,7 @@ NIL (-1066 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"))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-6 -4367)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#1| (QUOTE (-891))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-1067 (-1155)) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-1067 (-1155)) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-1067 (-1155)) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-1067 (-1155)) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-1067 (-1155)) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) +((|HasCategory| |#1| (QUOTE (-891))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-1067 (-1155)) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-1067 (-1155)) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-1067 (-1155)) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-1067 (-1155)) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-1067 (-1155)) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-228))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) (-1067 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 @@ -4217,8 +4217,8 @@ NIL NIL ((|HasCategory| |#1| (QUOTE (-1079)))) (-1072 S) -((|constructor| (NIL "This category provides operations on ranges,{} or {\\em segments} as they are called.")) (|convert| (($ |#1|) "\\spad{convert(i)} creates the segment \\spad{i..i}.")) (|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{\\spad{hi}(s)} returns the second endpoint of \\spad{s}. Note: \\spad{\\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."))) -((-4284 . T)) +((|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{\\spad{hi}(s)} returns the second endpoint of \\spad{s}. Note: \\spad{\\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 (-1073 S) ((|constructor| (NIL "This type is used to specify a range of values from type \\spad{S}."))) @@ -4226,7 +4226,7 @@ NIL ((|HasCategory| |#1| (QUOTE (-831))) (|HasCategory| |#1| (QUOTE (-1079)))) (-1074 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]}."))) -((-4284 . T)) +NIL NIL (-1075) ((|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'."))) @@ -4238,7 +4238,7 @@ NIL NIL (-1077 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}."))) -((-4359 . T) (-4284 . T)) +((-4359 . T)) NIL (-1078 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}."))) @@ -4255,9 +4255,9 @@ NIL (-1081 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)}}"))) ((-4369 . T) (-4359 . T) (-4370 . T)) -((-4028 (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-833))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-1082 |Str| |Sym| |Int| |Flt| |Expr|) -((|constructor| (NIL "This category allows the manipulation of Lisp values while keeping the grunge fairly localized.")) (|elt| (($ $ (|List| (|Integer|))) "\\spad{elt((a1,{}...,{}an),{} [i1,{}...,{}im])} returns \\spad{(a_i1,{}...,{}a_im)}.") (($ $ (|Integer|)) "\\spad{elt((a1,{}...,{}an),{} i)} returns \\spad{\\spad{ai}}.")) (|#| (((|Integer|) $) "\\spad{\\#((a1,{}...,{}an))} returns \\spad{n}.")) (|cdr| (($ $) "\\spad{cdr((a1,{}...,{}an))} returns \\spad{(a2,{}...,{}an)}.")) (|car| (($ $) "\\spad{car((a1,{}...,{}an))} returns a1.")) (|convert| (($ |#5|) "\\spad{convert(x)} returns the Lisp atom \\spad{x}.") (($ |#4|) "\\spad{convert(x)} returns the Lisp atom \\spad{x}.") (($ |#3|) "\\spad{convert(x)} returns the Lisp atom \\spad{x}.") (($ |#2|) "\\spad{convert(x)} returns the Lisp atom \\spad{x}.") (($ |#1|) "\\spad{convert(x)} returns the Lisp atom \\spad{x}.") (($ (|List| $)) "\\spad{convert([a1,{}...,{}an])} returns the \\spad{S}-expression \\spad{(a1,{}...,{}an)}.")) (|expr| ((|#5| $) "\\spad{expr(s)} returns \\spad{s} as an element of Expr; Error: if \\spad{s} is not an atom that also belongs to Expr.")) (|float| ((|#4| $) "\\spad{float(s)} returns \\spad{s} as an element of \\spad{Flt}; Error: if \\spad{s} is not an atom that also belongs to \\spad{Flt}.")) (|integer| ((|#3| $) "\\spad{integer(s)} returns \\spad{s} as an element of Int. Error: if \\spad{s} is not an atom that also belongs to Int.")) (|symbol| ((|#2| $) "\\spad{symbol(s)} returns \\spad{s} as an element of \\spad{Sym}. Error: if \\spad{s} is not an atom that also belongs to \\spad{Sym}.")) (|string| ((|#1| $) "\\spad{string(s)} returns \\spad{s} as an element of \\spad{Str}. Error: if \\spad{s} is not an atom that also belongs to \\spad{Str}.")) (|destruct| (((|List| $) $) "\\spad{destruct((a1,{}...,{}an))} returns the list [a1,{}...,{}an].")) (|float?| (((|Boolean|) $) "\\spad{float?(s)} is \\spad{true} if \\spad{s} is an atom and belong to \\spad{Flt}.")) (|integer?| (((|Boolean|) $) "\\spad{integer?(s)} is \\spad{true} if \\spad{s} is an atom and belong to Int.")) (|symbol?| (((|Boolean|) $) "\\spad{symbol?(s)} is \\spad{true} if \\spad{s} is an atom and belong to \\spad{Sym}.")) (|string?| (((|Boolean|) $) "\\spad{string?(s)} is \\spad{true} if \\spad{s} is an atom and belong to \\spad{Str}.")) (|list?| (((|Boolean|) $) "\\spad{list?(s)} is \\spad{true} if \\spad{s} is a Lisp list,{} possibly ().")) (|pair?| (((|Boolean|) $) "\\spad{pair?(s)} is \\spad{true} if \\spad{s} has is a non-null Lisp list.")) (|atom?| (((|Boolean|) $) "\\spad{atom?(s)} is \\spad{true} if \\spad{s} is a Lisp atom.")) (|null?| (((|Boolean|) $) "\\spad{null?(s)} is \\spad{true} if \\spad{s} is the \\spad{S}-expression ().")) (|eq| (((|Boolean|) $ $) "\\spad{eq(s,{} t)} is \\spad{true} if EQ(\\spad{s},{}\\spad{t}) is \\spad{true} in Lisp."))) +((|constructor| (NIL "This category allows the manipulation of Lisp values while keeping the grunge fairly localized.")) (|elt| (($ $ (|List| (|Integer|))) "\\spad{elt((a1,{}...,{}an),{} [i1,{}...,{}im])} returns \\spad{(a_i1,{}...,{}a_im)}.") (($ $ (|Integer|)) "\\spad{elt((a1,{}...,{}an),{} i)} returns \\spad{\\spad{ai}}.")) (|#| (((|Integer|) $) "\\spad{\\#((a1,{}...,{}an))} returns \\spad{n}.")) (|cdr| (($ $) "\\spad{cdr((a1,{}...,{}an))} returns \\spad{(a2,{}...,{}an)}.")) (|car| (($ $) "\\spad{car((a1,{}...,{}an))} returns a1.")) (|expr| ((|#5| $) "\\spad{expr(s)} returns \\spad{s} as an element of Expr; Error: if \\spad{s} is not an atom that also belongs to Expr.")) (|float| ((|#4| $) "\\spad{float(s)} returns \\spad{s} as an element of \\spad{Flt}; Error: if \\spad{s} is not an atom that also belongs to \\spad{Flt}.")) (|integer| ((|#3| $) "\\spad{integer(s)} returns \\spad{s} as an element of Int. Error: if \\spad{s} is not an atom that also belongs to Int.")) (|symbol| ((|#2| $) "\\spad{symbol(s)} returns \\spad{s} as an element of \\spad{Sym}. Error: if \\spad{s} is not an atom that also belongs to \\spad{Sym}.")) (|string| ((|#1| $) "\\spad{string(s)} returns \\spad{s} as an element of \\spad{Str}. Error: if \\spad{s} is not an atom that also belongs to \\spad{Str}.")) (|destruct| (((|List| $) $) "\\spad{destruct((a1,{}...,{}an))} returns the list [a1,{}...,{}an].")) (|float?| (((|Boolean|) $) "\\spad{float?(s)} is \\spad{true} if \\spad{s} is an atom and belong to \\spad{Flt}.")) (|integer?| (((|Boolean|) $) "\\spad{integer?(s)} is \\spad{true} if \\spad{s} is an atom and belong to Int.")) (|symbol?| (((|Boolean|) $) "\\spad{symbol?(s)} is \\spad{true} if \\spad{s} is an atom and belong to \\spad{Sym}.")) (|string?| (((|Boolean|) $) "\\spad{string?(s)} is \\spad{true} if \\spad{s} is an atom and belong to \\spad{Str}.")) (|list?| (((|Boolean|) $) "\\spad{list?(s)} is \\spad{true} if \\spad{s} is a Lisp list,{} possibly ().")) (|pair?| (((|Boolean|) $) "\\spad{pair?(s)} is \\spad{true} if \\spad{s} has is a non-null Lisp list.")) (|atom?| (((|Boolean|) $) "\\spad{atom?(s)} is \\spad{true} if \\spad{s} is a Lisp atom.")) (|null?| (((|Boolean|) $) "\\spad{null?(s)} is \\spad{true} if \\spad{s} is the \\spad{S}-expression ().")) (|eq| (((|Boolean|) $ $) "\\spad{eq(s,{} t)} is \\spad{true} if EQ(\\spad{s},{}\\spad{t}) is \\spad{true} in Lisp."))) NIL NIL (-1083) @@ -4282,7 +4282,7 @@ NIL NIL (-1088 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 \\spad{gcd} of any polynomial \\spad{p} in \\spad{ts} and \\spad{differentiate(p,{}mvar(p))} \\spad{w}.\\spad{r}.\\spad{t}. \\axiomOpFrom{collectUnder}{TriangularSetCategory}(\\spad{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.}"))) -((-4370 . T) (-4369 . T) (-4284 . T)) +((-4370 . T) (-4369 . T)) NIL (-1089) ((|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| (|Integer|)) (|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| (|Integer|)) (|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| (|Integer|))) "\\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 \\spad{pi}} in the corresponding double coset. Note: the resulting permutation {\\em \\spad{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,{}\\spad{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 \\spad{pi}} of such a double coset,{} coleman(\\spad{alpha},{}\\spad{beta},{}\\spad{pi}) generates the Coleman-matrix corresponding to {\\em alpha,{} beta,{} \\spad{pi}}. Note: The permutation {\\em \\spad{pi}} of {\\em {1,{}2,{}...,{}n}} has to be given in list form. Note: the inverse of this map is {\\em inverseColeman} (if {\\em \\spad{pi}} is the lexicographical smallest permutation in the coset). For details see James/Kerber."))) @@ -4299,7 +4299,7 @@ NIL (-1092 |dimtot| |dim1| S) ((|constructor| (NIL "\\indented{2}{This type represents the finite direct or cartesian product of an} underlying ordered component type. The vectors are ordered as if they were split into two blocks. The dim1 parameter specifies the length of the first block. The ordering is lexicographic between the blocks but acts like \\spadtype{HomogeneousDirectProduct} within each block. This type is a suitable third argument for \\spadtype{GeneralDistributedMultivariatePolynomial}."))) ((-4363 |has| |#3| (-1031)) (-4364 |has| |#3| (-1031)) (-4366 |has| |#3| (-6 -4366)) ((-4371 "*") |has| |#3| (-169)) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))))) (-4028 (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1079)))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1031)))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#3| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#3| (QUOTE (-357))) (-4028 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (QUOTE (-1031)))) (-4028 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-357)))) (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (QUOTE (-779))) (-4028 (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (QUOTE (-831)))) (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (QUOTE (-169))) (-4028 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-1031)))) (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (-4028 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (QUOTE (-1079)))) (-4028 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (QUOTE (-1031)))) (-4028 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (QUOTE (-1031)))) (-4028 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (QUOTE (-1031)))) (-4028 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1031)))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-25)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-129)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-169)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-228)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-357)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-362)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-712)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-779)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-831)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1031)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1079))))) (-4028 (-12 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| (-553) (QUOTE (-833))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1031)))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155))))) (-4028 (|HasCategory| |#3| (QUOTE (-1031))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1079)))) (|HasAttribute| |#3| (QUOTE -4366)) (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (QUOTE (-25))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (|HasCategory| |#3| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))))) (-3988 (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1079)))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1031)))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#3| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#3| (QUOTE (-357))) (-3988 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (QUOTE (-1031)))) (-3988 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-357)))) (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (QUOTE (-779))) (-3988 (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (QUOTE (-831)))) (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (QUOTE (-169))) (-3988 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-1031)))) (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (-3988 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (QUOTE (-1079)))) (-3988 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (QUOTE (-1031)))) (-3988 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (QUOTE (-1031)))) (-3988 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (QUOTE (-1031)))) (-3988 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1031)))) (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-25)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-129)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-169)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-228)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-357)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-362)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-712)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-779)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-831)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1031)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1079))))) (-3988 (-12 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1031))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-3988 (-12 (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-169))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-357))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-712))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-779))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-831))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553)))))) (|HasCategory| (-553) (QUOTE (-833))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (QUOTE (-228))) (|HasCategory| |#3| (QUOTE (-1031)))) (-12 (|HasCategory| |#3| (QUOTE (-1031))) (|HasCategory| |#3| (LIST (QUOTE -882) (QUOTE (-1155))))) (-3988 (|HasCategory| |#3| (QUOTE (-1031))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553)))))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#3| (QUOTE (-1079)))) (|HasAttribute| |#3| (QUOTE -4366)) (|HasCategory| |#3| (QUOTE (-129))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#3| (QUOTE (-1079))) (|HasCategory| |#3| (LIST (QUOTE -303) (|devaluate| |#3|))))) (-1093 R |x|) ((|constructor| (NIL "This package produces functions for counting etc. real roots of univariate polynomials in \\spad{x} over \\spad{R},{} which must be an OrderedIntegralDomain")) (|countRealRootsMultiple| (((|Integer|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{countRealRootsMultiple(p)} says how many real roots \\spad{p} has,{} counted with multiplicity")) (|SturmHabichtMultiple| (((|Integer|) (|UnivariatePolynomial| |#2| |#1|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{SturmHabichtMultiple(p1,{}p2)} computes \\spad{c_}{+}\\spad{-c_}{-} where \\spad{c_}{+} is the number of real roots of \\spad{p1} with p2>0 and \\spad{c_}{-} is the number of real roots of \\spad{p1} with p2<0. If p2=1 what you get is the number of real roots of \\spad{p1}.")) (|countRealRoots| (((|Integer|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{countRealRoots(p)} says how many real roots \\spad{p} has")) (|SturmHabicht| (((|Integer|) (|UnivariatePolynomial| |#2| |#1|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{SturmHabicht(p1,{}p2)} computes \\spad{c_}{+}\\spad{-c_}{-} where \\spad{c_}{+} is the number of real roots of \\spad{p1} with p2>0 and \\spad{c_}{-} is the number of real roots of \\spad{p1} with p2<0. If p2=1 what you get is the number of real roots of \\spad{p1}.")) (|SturmHabichtCoefficients| (((|List| |#1|) (|UnivariatePolynomial| |#2| |#1|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{SturmHabichtCoefficients(p1,{}p2)} computes the principal Sturm-Habicht coefficients of \\spad{p1} and \\spad{p2}")) (|SturmHabichtSequence| (((|List| (|UnivariatePolynomial| |#2| |#1|)) (|UnivariatePolynomial| |#2| |#1|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{SturmHabichtSequence(p1,{}p2)} computes the Sturm-Habicht sequence of \\spad{p1} and \\spad{p2}")) (|subresultantSequence| (((|List| (|UnivariatePolynomial| |#2| |#1|)) (|UnivariatePolynomial| |#2| |#1|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{subresultantSequence(p1,{}p2)} computes the (standard) subresultant sequence of \\spad{p1} and \\spad{p2}"))) NIL @@ -4308,7 +4308,7 @@ NIL ((|constructor| (NIL "This domain represents a signature AST. A signature AST \\indented{2}{is a description of an exported operation,{} \\spadignore{e.g.} its name,{} result} \\indented{2}{type,{} and the list of its argument types.}")) (|signature| (((|Signature|) $) "\\spad{signature(s)} returns AST of the declared signature for \\spad{`s'}.")) (|name| (((|Identifier|) $) "\\spad{name(s)} returns the name of the signature \\spad{`s'}.")) (|signatureAst| (($ (|Identifier|) (|Signature|)) "\\spad{signatureAst(n,{}s,{}t)} builds the signature AST \\spad{n:} \\spad{s} \\spad{->} \\spad{t}"))) NIL NIL -(-1095 R -3219) +(-1095 R -3105) ((|constructor| (NIL "This package provides functions to determine the sign of an elementary function around a point or infinity.")) (|sign| (((|Union| (|Integer|) "failed") |#2| (|Symbol|) |#2| (|String|)) "\\spad{sign(f,{} x,{} a,{} s)} returns the sign of \\spad{f} as \\spad{x} nears \\spad{a} from below if \\spad{s} is \"left\",{} or above if \\spad{s} is \"right\".") (((|Union| (|Integer|) "failed") |#2| (|Symbol|) (|OrderedCompletion| |#2|)) "\\spad{sign(f,{} x,{} a)} returns the sign of \\spad{f} as \\spad{x} nears \\spad{a},{} from both sides if \\spad{a} is finite.") (((|Union| (|Integer|) "failed") |#2|) "\\spad{sign(f)} returns the sign of \\spad{f} if it is constant everywhere."))) NIL NIL @@ -4330,7 +4330,7 @@ NIL NIL (-1100 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}) = \\spad{#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}."))) -((-4369 . T) (-4370 . T) (-4284 . T)) +((-4369 . T) (-4370 . T)) NIL (-1101 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}\\spad{'s} on the diagonal and zeroes elsewhere."))) @@ -4338,7 +4338,7 @@ NIL ((|HasCategory| |#3| (QUOTE (-357))) (|HasAttribute| |#3| (QUOTE (-4371 "*"))) (|HasCategory| |#3| (QUOTE (-169)))) (-1102 |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}\\spad{'s} on the diagonal and zeroes elsewhere."))) -((-4284 . T) (-4369 . T) (-4363 . T) (-4364 . T) (-4366 . T)) +((-4369 . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-1103 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}."))) @@ -4347,16 +4347,16 @@ NIL (-1104 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."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-6 -4367)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#1| (QUOTE (-891))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) +((|HasCategory| |#1| (QUOTE (-891))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) (-1105 |Coef| |Var| SMP) ((|constructor| (NIL "This domain provides multivariate Taylor series with variables from an arbitrary ordered set. A Taylor series is represented by a stream of polynomials from the polynomial domain \\spad{SMP}. The \\spad{n}th element of the stream is a form of degree \\spad{n}. SMTS is an internal domain.")) (|fintegrate| (($ (|Mapping| $) |#2| |#1|) "\\spad{fintegrate(f,{}v,{}c)} is the integral of \\spad{f()} with respect \\indented{1}{to \\spad{v} and having \\spad{c} as the constant of integration.} \\indented{1}{The evaluation of \\spad{f()} is delayed.}")) (|integrate| (($ $ |#2| |#1|) "\\spad{integrate(s,{}v,{}c)} is the integral of \\spad{s} with respect \\indented{1}{to \\spad{v} and having \\spad{c} as the constant of integration.}")) (|csubst| (((|Mapping| (|Stream| |#3|) |#3|) (|List| |#2|) (|List| (|Stream| |#3|))) "\\spad{csubst(a,{}b)} is for internal use only")) (* (($ |#3| $) "\\spad{smp*ts} multiplies a TaylorSeries by a monomial \\spad{SMP}.")) (|coerce| (($ |#3|) "\\spad{coerce(poly)} regroups the terms by total degree and forms a series.") (($ |#2|) "\\spad{coerce(var)} converts a variable to a Taylor series")) (|coefficient| ((|#3| $ (|NonNegativeInteger|)) "\\spad{coefficient(s,{} n)} gives the terms of total degree \\spad{n}."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-357)))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-357)))) (-1106 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}"))) -((-4370 . T) (-4369 . T) (-4284 . T)) +((-4370 . T) (-4369 . T)) NIL -(-1107 UP -3219) +(-1107 UP -3105) ((|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 @@ -4394,7 +4394,7 @@ NIL NIL (-1116) ((|constructor| (NIL "This category describes the exported \\indented{2}{signatures of the SpadAst domain.}")) (|autoCoerce| (((|Integer|) $) "\\spad{autoCoerce(s)} returns the Integer view of \\spad{`s'}. Left at the discretion of the compiler.") (((|String|) $) "\\spad{autoCoerce(s)} returns the String view of \\spad{`s'}. Left at the discretion of the compiler.") (((|Identifier|) $) "\\spad{autoCoerce(s)} returns the Identifier view of \\spad{`s'}. Left at the discretion of the compiler.") (((|IsAst|) $) "\\spad{autoCoerce(s)} returns the IsAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|HasAst|) $) "\\spad{autoCoerce(s)} returns the HasAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|CaseAst|) $) "\\spad{autoCoerce(s)} returns the CaseAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|ColonAst|) $) "\\spad{autoCoerce(s)} returns the ColoonAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|SuchThatAst|) $) "\\spad{autoCoerce(s)} returns the SuchThatAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|LetAst|) $) "\\spad{autoCoerce(s)} returns the LetAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|SequenceAst|) $) "\\spad{autoCoerce(s)} returns the SequenceAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|SegmentAst|) $) "\\spad{autoCoerce(s)} returns the SegmentAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|RestrictAst|) $) "\\spad{autoCoerce(s)} returns the RestrictAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|PretendAst|) $) "\\spad{autoCoerce(s)} returns the PretendAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|CoerceAst|) $) "\\spad{autoCoerce(s)} returns the CoerceAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|ReturnAst|) $) "\\spad{autoCoerce(s)} returns the ReturnAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|ExitAst|) $) "\\spad{autoCoerce(s)} returns the ExitAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|ConstructAst|) $) "\\spad{autoCoerce(s)} returns the ConstructAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|CollectAst|) $) "\\spad{autoCoerce(s)} returns the CollectAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|InAst|) $) "\\spad{autoCoerce(s)} returns the InAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|WhileAst|) $) "\\spad{autoCoerce(s)} returns the WhileAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|RepeatAst|) $) "\\spad{autoCoerce(s)} returns the RepeatAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|IfAst|) $) "\\spad{autoCoerce(s)} returns the IfAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|MappingAst|) $) "\\spad{autoCoerce(s)} returns the MappingAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|AttributeAst|) $) "\\spad{autoCoerce(s)} returns the AttributeAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|SignatureAst|) $) "\\spad{autoCoerce(s)} returns the SignatureAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|CapsuleAst|) $) "\\spad{autoCoerce(s)} returns the CapsuleAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|CategoryAst|) $) "\\spad{autoCoerce(s)} returns the CategoryAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|WhereAst|) $) "\\spad{autoCoerce(s)} returns the WhereAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|MacroAst|) $) "\\spad{autoCoerce(s)} returns the MacroAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|DefinitionAst|) $) "\\spad{autoCoerce(s)} returns the DefinitionAst view of \\spad{`s'}. Left at the discretion of the compiler.") (((|ImportAst|) $) "\\spad{autoCoerce(s)} returns the ImportAst view of \\spad{`s'}. Left at the discretion of the compiler.")) (|case| (((|Boolean|) $ (|[\|\|]| (|Integer|))) "\\spad{s case Integer} holds if \\spad{`s'} represents an integer literal.") (((|Boolean|) $ (|[\|\|]| (|String|))) "\\spad{s case String} holds if \\spad{`s'} represents a string literal.") (((|Boolean|) $ (|[\|\|]| (|Identifier|))) "\\spad{s case Identifier} holds if \\spad{`s'} represents an identifier.") (((|Boolean|) $ (|[\|\|]| (|IsAst|))) "\\spad{s case IsAst} holds if \\spad{`s'} represents an is-expression.") (((|Boolean|) $ (|[\|\|]| (|HasAst|))) "\\spad{s case HasAst} holds if \\spad{`s'} represents a has-expression.") (((|Boolean|) $ (|[\|\|]| (|CaseAst|))) "\\spad{s case CaseAst} holds if \\spad{`s'} represents a case-expression.") (((|Boolean|) $ (|[\|\|]| (|ColonAst|))) "\\spad{s case ColonAst} holds if \\spad{`s'} represents a colon-expression.") (((|Boolean|) $ (|[\|\|]| (|SuchThatAst|))) "\\spad{s case SuchThatAst} holds if \\spad{`s'} represents a qualified-expression.") (((|Boolean|) $ (|[\|\|]| (|LetAst|))) "\\spad{s case LetAst} holds if \\spad{`s'} represents an assignment-expression.") (((|Boolean|) $ (|[\|\|]| (|SequenceAst|))) "\\spad{s case SequenceAst} holds if \\spad{`s'} represents a sequence-of-statements.") (((|Boolean|) $ (|[\|\|]| (|SegmentAst|))) "\\spad{s case SegmentAst} holds if \\spad{`s'} represents a segment-expression.") (((|Boolean|) $ (|[\|\|]| (|RestrictAst|))) "\\spad{s case RestrictAst} holds if \\spad{`s'} represents a restrict-expression.") (((|Boolean|) $ (|[\|\|]| (|PretendAst|))) "\\spad{s case PretendAst} holds if \\spad{`s'} represents a pretend-expression.") (((|Boolean|) $ (|[\|\|]| (|CoerceAst|))) "\\spad{s case ReturnAst} holds if \\spad{`s'} represents a coerce-expression.") (((|Boolean|) $ (|[\|\|]| (|ReturnAst|))) "\\spad{s case ReturnAst} holds if \\spad{`s'} represents a return-statement.") (((|Boolean|) $ (|[\|\|]| (|ExitAst|))) "\\spad{s case ExitAst} holds if \\spad{`s'} represents an exit-expression.") (((|Boolean|) $ (|[\|\|]| (|ConstructAst|))) "\\spad{s case ConstructAst} holds if \\spad{`s'} represents a list-expression.") (((|Boolean|) $ (|[\|\|]| (|CollectAst|))) "\\spad{s case CollectAst} holds if \\spad{`s'} represents a list-comprehension.") (((|Boolean|) $ (|[\|\|]| (|InAst|))) "\\spad{s case InAst} holds if \\spad{`s'} represents a in-iterator") (((|Boolean|) $ (|[\|\|]| (|WhileAst|))) "\\spad{s case WhileAst} holds if \\spad{`s'} represents a while-iterator") (((|Boolean|) $ (|[\|\|]| (|RepeatAst|))) "\\spad{s case RepeatAst} holds if \\spad{`s'} represents an repeat-loop.") (((|Boolean|) $ (|[\|\|]| (|IfAst|))) "\\spad{s case IfAst} holds if \\spad{`s'} represents an if-statement.") (((|Boolean|) $ (|[\|\|]| (|MappingAst|))) "\\spad{s case MappingAst} holds if \\spad{`s'} represents a mapping type.") (((|Boolean|) $ (|[\|\|]| (|AttributeAst|))) "\\spad{s case AttributeAst} holds if \\spad{`s'} represents an attribute.") (((|Boolean|) $ (|[\|\|]| (|SignatureAst|))) "\\spad{s case SignatureAst} holds if \\spad{`s'} represents a signature export.") (((|Boolean|) $ (|[\|\|]| (|CapsuleAst|))) "\\spad{s case CapsuleAst} holds if \\spad{`s'} represents a domain capsule.") (((|Boolean|) $ (|[\|\|]| (|CategoryAst|))) "\\spad{s case CategoryAst} holds if \\spad{`s'} represents an unnamed category.") (((|Boolean|) $ (|[\|\|]| (|WhereAst|))) "\\spad{s case WhereAst} holds if \\spad{`s'} represents an expression with local definitions.") (((|Boolean|) $ (|[\|\|]| (|MacroAst|))) "\\spad{s case MacroAst} holds if \\spad{`s'} represents a macro definition.") (((|Boolean|) $ (|[\|\|]| (|DefinitionAst|))) "\\spad{s case DefinitionAst} holds if \\spad{`s'} represents a definition.") (((|Boolean|) $ (|[\|\|]| (|ImportAst|))) "\\spad{s case ImportAst} holds if \\spad{`s'} represents an `import' statement."))) -((-4284 . T)) +NIL NIL (-1117) ((|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}."))) @@ -4411,18 +4411,18 @@ NIL (-1120 V C) ((|constructor| (NIL "This domain exports a modest implementation of splitting trees. Spliiting trees are needed when the evaluation of some quantity under some hypothesis requires to split the hypothesis into sub-cases. For instance by adding some new hypothesis on one hand and its negation on another hand. The computations are terminated is a splitting tree \\axiom{a} when \\axiom{status(value(a))} is \\axiom{\\spad{true}}. Thus,{} if for the splitting tree \\axiom{a} the flag \\axiom{status(value(a))} is \\axiom{\\spad{true}},{} then \\axiom{status(value(\\spad{d}))} is \\axiom{\\spad{true}} for any subtree \\axiom{\\spad{d}} of \\axiom{a}. This property of splitting trees is called the termination condition. If no vertex in a splitting tree \\axiom{a} is equal to another,{} \\axiom{a} is said to satisfy the no-duplicates condition. The splitting tree \\axiom{a} will satisfy this condition if nodes are added to \\axiom{a} by mean of \\axiom{splitNodeOf!} and if \\axiom{construct} is only used to create the root of \\axiom{a} with no children.")) (|splitNodeOf!| (($ $ $ (|List| (|SplittingNode| |#1| |#2|)) (|Mapping| (|Boolean|) |#2| |#2|)) "\\axiom{splitNodeOf!(\\spad{l},{}a,{}\\spad{ls},{}sub?)} returns \\axiom{a} where the children list of \\axiom{\\spad{l}} has been set to \\axiom{[[\\spad{s}]\\$\\% for \\spad{s} in \\spad{ls} | not subNodeOf?(\\spad{s},{}a,{}sub?)]}. Thus,{} if \\axiom{\\spad{l}} is not a node of \\axiom{a},{} this latter splitting tree is unchanged.") (($ $ $ (|List| (|SplittingNode| |#1| |#2|))) "\\axiom{splitNodeOf!(\\spad{l},{}a,{}\\spad{ls})} returns \\axiom{a} where the children list of \\axiom{\\spad{l}} has been set to \\axiom{[[\\spad{s}]\\$\\% for \\spad{s} in \\spad{ls} | not nodeOf?(\\spad{s},{}a)]}. Thus,{} if \\axiom{\\spad{l}} is not a node of \\axiom{a},{} this latter splitting tree is unchanged.")) (|remove!| (($ (|SplittingNode| |#1| |#2|) $) "\\axiom{remove!(\\spad{s},{}a)} replaces a by remove(\\spad{s},{}a)")) (|remove| (($ (|SplittingNode| |#1| |#2|) $) "\\axiom{remove(\\spad{s},{}a)} returns the splitting tree obtained from a by removing every sub-tree \\axiom{\\spad{b}} such that \\axiom{value(\\spad{b})} and \\axiom{\\spad{s}} have the same value,{} condition and status.")) (|subNodeOf?| (((|Boolean|) (|SplittingNode| |#1| |#2|) $ (|Mapping| (|Boolean|) |#2| |#2|)) "\\axiom{subNodeOf?(\\spad{s},{}a,{}sub?)} returns \\spad{true} iff for some node \\axiom{\\spad{n}} in \\axiom{a} we have \\axiom{\\spad{s} = \\spad{n}} or \\axiom{status(\\spad{n})} and \\axiom{subNode?(\\spad{s},{}\\spad{n},{}sub?)}.")) (|nodeOf?| (((|Boolean|) (|SplittingNode| |#1| |#2|) $) "\\axiom{nodeOf?(\\spad{s},{}a)} returns \\spad{true} iff some node of \\axiom{a} is equal to \\axiom{\\spad{s}}")) (|result| (((|List| (|Record| (|:| |val| |#1|) (|:| |tower| |#2|))) $) "\\axiom{result(a)} where \\axiom{\\spad{ls}} is the leaves list of \\axiom{a} returns \\axiom{[[value(\\spad{s}),{}condition(\\spad{s})]\\$\\spad{VT} for \\spad{s} in \\spad{ls}]} if the computations are terminated in \\axiom{a} else an error is produced.")) (|conditions| (((|List| |#2|) $) "\\axiom{conditions(a)} returns the list of the conditions of the leaves of a")) (|construct| (($ |#1| |#2| |#1| (|List| |#2|)) "\\axiom{construct(\\spad{v1},{}\\spad{t},{}\\spad{v2},{}\\spad{lt})} creates a splitting tree with value (\\spadignore{i.e.} root vertex) given by \\axiom{[\\spad{v},{}\\spad{t}]\\$\\spad{S}} and with children list given by \\axiom{[[[\\spad{v},{}\\spad{t}]\\$\\spad{S}]\\$\\% for \\spad{s} in \\spad{ls}]}.") (($ |#1| |#2| (|List| (|SplittingNode| |#1| |#2|))) "\\axiom{construct(\\spad{v},{}\\spad{t},{}\\spad{ls})} creates a splitting tree with value (\\spadignore{i.e.} root vertex) given by \\axiom{[\\spad{v},{}\\spad{t}]\\$\\spad{S}} and with children list given by \\axiom{[[\\spad{s}]\\$\\% for \\spad{s} in \\spad{ls}]}.") (($ |#1| |#2| (|List| $)) "\\axiom{construct(\\spad{v},{}\\spad{t},{}la)} creates a splitting tree with value (\\spadignore{i.e.} root vertex) given by \\axiom{[\\spad{v},{}\\spad{t}]\\$\\spad{S}} and with \\axiom{la} as children list.") (($ (|SplittingNode| |#1| |#2|)) "\\axiom{construct(\\spad{s})} creates a splitting tree with value (\\spadignore{i.e.} root vertex) given by \\axiom{\\spad{s}} and no children. Thus,{} if the status of \\axiom{\\spad{s}} is \\spad{false},{} \\axiom{[\\spad{s}]} represents the starting point of the evaluation \\axiom{value(\\spad{s})} under the hypothesis \\axiom{condition(\\spad{s})}.")) (|updateStatus!| (($ $) "\\axiom{updateStatus!(a)} returns a where the status of the vertices are updated to satisfy the \"termination condition\".")) (|extractSplittingLeaf| (((|Union| $ "failed") $) "\\axiom{extractSplittingLeaf(a)} returns the left most leaf (as a tree) whose status is \\spad{false} if any,{} else \"failed\" is returned."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| (-1119 |#1| |#2|) (LIST (QUOTE -303) (LIST (QUOTE -1119) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1119 |#1| |#2|) (QUOTE (-1079)))) (|HasCategory| (-1119 |#1| |#2|) (QUOTE (-1079))) (-4028 (|HasCategory| (-1119 |#1| |#2|) (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| (-1119 |#1| |#2|) (LIST (QUOTE -303) (LIST (QUOTE -1119) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1119 |#1| |#2|) (QUOTE (-1079))))) (|HasCategory| (-1119 |#1| |#2|) (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| (-1119 |#1| |#2|) (LIST (QUOTE -303) (LIST (QUOTE -1119) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1119 |#1| |#2|) (QUOTE (-1079)))) (|HasCategory| (-1119 |#1| |#2|) (QUOTE (-1079))) (-3988 (|HasCategory| (-1119 |#1| |#2|) (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| (-1119 |#1| |#2|) (LIST (QUOTE -303) (LIST (QUOTE -1119) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1119 |#1| |#2|) (QUOTE (-1079))))) (|HasCategory| (-1119 |#1| |#2|) (LIST (QUOTE -600) (QUOTE (-845))))) (-1121 |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}."))) ((-4366 . T) (-4358 |has| |#2| (-6 (-4371 "*"))) (-4369 . T) (-4363 . T) (-4364 . T)) -((|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-228))) (|HasAttribute| |#2| (QUOTE (-4371 "*"))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (-4028 (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (QUOTE (-301))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-357))) (-4028 (|HasAttribute| |#2| (QUOTE (-4371 "*"))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-228)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-169)))) +((|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-228))) (|HasAttribute| |#2| (QUOTE (-4371 "*"))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (-12 (|HasCategory| |#2| (QUOTE (-228))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (QUOTE (-301))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-357))) (-3988 (|HasAttribute| |#2| (QUOTE (-4371 "*"))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-228)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-169)))) (-1122 S) ((|constructor| (NIL "A string aggregate is a category for strings,{} that is,{} one dimensional arrays of characters.")) (|elt| (($ $ $) "\\spad{elt(s,{}t)} returns the concatenation of \\spad{s} and \\spad{t}. It is provided to allow juxtaposition of strings to work as concatenation. For example,{} \\axiom{\"smoo\" \"shed\"} returns \\axiom{\"smooshed\"}.")) (|rightTrim| (($ $ (|CharacterClass|)) "\\spad{rightTrim(s,{}cc)} returns \\spad{s} with all trailing occurences of characters in \\spad{cc} deleted. For example,{} \\axiom{rightTrim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"(abc\"}.") (($ $ (|Character|)) "\\spad{rightTrim(s,{}c)} returns \\spad{s} with all trailing occurrences of \\spad{c} deleted. For example,{} \\axiom{rightTrim(\" abc \",{} char \" \")} returns \\axiom{\" abc\"}.")) (|leftTrim| (($ $ (|CharacterClass|)) "\\spad{leftTrim(s,{}cc)} returns \\spad{s} with all leading characters in \\spad{cc} deleted. For example,{} \\axiom{leftTrim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"abc)\"}.") (($ $ (|Character|)) "\\spad{leftTrim(s,{}c)} returns \\spad{s} with all leading characters \\spad{c} deleted. For example,{} \\axiom{leftTrim(\" abc \",{} char \" \")} returns \\axiom{\"abc \"}.")) (|trim| (($ $ (|CharacterClass|)) "\\spad{trim(s,{}cc)} returns \\spad{s} with all characters in \\spad{cc} deleted from right and left ends. For example,{} \\axiom{trim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"abc\"}.") (($ $ (|Character|)) "\\spad{trim(s,{}c)} returns \\spad{s} with all characters \\spad{c} deleted from right and left ends. For example,{} \\axiom{trim(\" abc \",{} char \" \")} returns \\axiom{\"abc\"}.")) (|split| (((|List| $) $ (|CharacterClass|)) "\\spad{split(s,{}cc)} returns a list of substrings delimited by characters in \\spad{cc}.") (((|List| $) $ (|Character|)) "\\spad{split(s,{}c)} returns a list of substrings delimited by character \\spad{c}.")) (|coerce| (($ (|Character|)) "\\spad{coerce(c)} returns \\spad{c} as a string \\spad{s} with the character \\spad{c}.")) (|position| (((|Integer|) (|CharacterClass|) $ (|Integer|)) "\\spad{position(cc,{}t,{}i)} returns the position \\axiom{\\spad{j} \\spad{>=} \\spad{i}} in \\spad{t} of the first character belonging to \\spad{cc}.") (((|Integer|) $ $ (|Integer|)) "\\spad{position(s,{}t,{}i)} returns the position \\spad{j} of the substring \\spad{s} in string \\spad{t},{} where \\axiom{\\spad{j} \\spad{>=} \\spad{i}} is required.")) (|replace| (($ $ (|UniversalSegment| (|Integer|)) $) "\\spad{replace(s,{}i..j,{}t)} replaces the substring \\axiom{\\spad{s}(\\spad{i}..\\spad{j})} of \\spad{s} by string \\spad{t}.")) (|match?| (((|Boolean|) $ $ (|Character|)) "\\spad{match?(s,{}t,{}c)} tests if \\spad{s} matches \\spad{t} except perhaps for multiple and consecutive occurrences of character \\spad{c}. Typically \\spad{c} is the blank character.")) (|match| (((|NonNegativeInteger|) $ $ (|Character|)) "\\spad{match(p,{}s,{}wc)} tests if pattern \\axiom{\\spad{p}} matches subject \\axiom{\\spad{s}} where \\axiom{\\spad{wc}} is a wild card character. If no match occurs,{} the index \\axiom{0} is returned; otheriwse,{} the value returned is the first index of the first character in the subject matching the subject (excluding that matched by an initial wild-card). For example,{} \\axiom{match(\"*to*\",{}\"yorktown\",{}\\spad{\"*\"})} returns \\axiom{5} indicating a successful match starting at index \\axiom{5} of \\axiom{\"yorktown\"}.")) (|substring?| (((|Boolean|) $ $ (|Integer|)) "\\spad{substring?(s,{}t,{}i)} tests if \\spad{s} is a substring of \\spad{t} beginning at index \\spad{i}. Note: \\axiom{substring?(\\spad{s},{}\\spad{t},{}0) = prefix?(\\spad{s},{}\\spad{t})}.")) (|suffix?| (((|Boolean|) $ $) "\\spad{suffix?(s,{}t)} tests if the string \\spad{s} is the final substring of \\spad{t}. Note: \\axiom{suffix?(\\spad{s},{}\\spad{t}) \\spad{==} reduce(and,{}[\\spad{s}.\\spad{i} = \\spad{t}.(\\spad{n} - \\spad{m} + \\spad{i}) for \\spad{i} in 0..maxIndex \\spad{s}])} where \\spad{m} and \\spad{n} denote the maxIndex of \\spad{s} and \\spad{t} respectively.")) (|prefix?| (((|Boolean|) $ $) "\\spad{prefix?(s,{}t)} tests if the string \\spad{s} is the initial substring of \\spad{t}. Note: \\axiom{prefix?(\\spad{s},{}\\spad{t}) \\spad{==} reduce(and,{}[\\spad{s}.\\spad{i} = \\spad{t}.\\spad{i} for \\spad{i} in 0..maxIndex \\spad{s}])}.")) (|upperCase!| (($ $) "\\spad{upperCase!(s)} destructively replaces the alphabetic characters in \\spad{s} by upper case characters.")) (|upperCase| (($ $) "\\spad{upperCase(s)} returns the string with all characters in upper case.")) (|lowerCase!| (($ $) "\\spad{lowerCase!(s)} destructively replaces the alphabetic characters in \\spad{s} by lower case.")) (|lowerCase| (($ $) "\\spad{lowerCase(s)} returns the string with all characters in lower case."))) NIL NIL (-1123) ((|constructor| (NIL "A string aggregate is a category for strings,{} that is,{} one dimensional arrays of characters.")) (|elt| (($ $ $) "\\spad{elt(s,{}t)} returns the concatenation of \\spad{s} and \\spad{t}. It is provided to allow juxtaposition of strings to work as concatenation. For example,{} \\axiom{\"smoo\" \"shed\"} returns \\axiom{\"smooshed\"}.")) (|rightTrim| (($ $ (|CharacterClass|)) "\\spad{rightTrim(s,{}cc)} returns \\spad{s} with all trailing occurences of characters in \\spad{cc} deleted. For example,{} \\axiom{rightTrim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"(abc\"}.") (($ $ (|Character|)) "\\spad{rightTrim(s,{}c)} returns \\spad{s} with all trailing occurrences of \\spad{c} deleted. For example,{} \\axiom{rightTrim(\" abc \",{} char \" \")} returns \\axiom{\" abc\"}.")) (|leftTrim| (($ $ (|CharacterClass|)) "\\spad{leftTrim(s,{}cc)} returns \\spad{s} with all leading characters in \\spad{cc} deleted. For example,{} \\axiom{leftTrim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"abc)\"}.") (($ $ (|Character|)) "\\spad{leftTrim(s,{}c)} returns \\spad{s} with all leading characters \\spad{c} deleted. For example,{} \\axiom{leftTrim(\" abc \",{} char \" \")} returns \\axiom{\"abc \"}.")) (|trim| (($ $ (|CharacterClass|)) "\\spad{trim(s,{}cc)} returns \\spad{s} with all characters in \\spad{cc} deleted from right and left ends. For example,{} \\axiom{trim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"abc\"}.") (($ $ (|Character|)) "\\spad{trim(s,{}c)} returns \\spad{s} with all characters \\spad{c} deleted from right and left ends. For example,{} \\axiom{trim(\" abc \",{} char \" \")} returns \\axiom{\"abc\"}.")) (|split| (((|List| $) $ (|CharacterClass|)) "\\spad{split(s,{}cc)} returns a list of substrings delimited by characters in \\spad{cc}.") (((|List| $) $ (|Character|)) "\\spad{split(s,{}c)} returns a list of substrings delimited by character \\spad{c}.")) (|coerce| (($ (|Character|)) "\\spad{coerce(c)} returns \\spad{c} as a string \\spad{s} with the character \\spad{c}.")) (|position| (((|Integer|) (|CharacterClass|) $ (|Integer|)) "\\spad{position(cc,{}t,{}i)} returns the position \\axiom{\\spad{j} \\spad{>=} \\spad{i}} in \\spad{t} of the first character belonging to \\spad{cc}.") (((|Integer|) $ $ (|Integer|)) "\\spad{position(s,{}t,{}i)} returns the position \\spad{j} of the substring \\spad{s} in string \\spad{t},{} where \\axiom{\\spad{j} \\spad{>=} \\spad{i}} is required.")) (|replace| (($ $ (|UniversalSegment| (|Integer|)) $) "\\spad{replace(s,{}i..j,{}t)} replaces the substring \\axiom{\\spad{s}(\\spad{i}..\\spad{j})} of \\spad{s} by string \\spad{t}.")) (|match?| (((|Boolean|) $ $ (|Character|)) "\\spad{match?(s,{}t,{}c)} tests if \\spad{s} matches \\spad{t} except perhaps for multiple and consecutive occurrences of character \\spad{c}. Typically \\spad{c} is the blank character.")) (|match| (((|NonNegativeInteger|) $ $ (|Character|)) "\\spad{match(p,{}s,{}wc)} tests if pattern \\axiom{\\spad{p}} matches subject \\axiom{\\spad{s}} where \\axiom{\\spad{wc}} is a wild card character. If no match occurs,{} the index \\axiom{0} is returned; otheriwse,{} the value returned is the first index of the first character in the subject matching the subject (excluding that matched by an initial wild-card). For example,{} \\axiom{match(\"*to*\",{}\"yorktown\",{}\\spad{\"*\"})} returns \\axiom{5} indicating a successful match starting at index \\axiom{5} of \\axiom{\"yorktown\"}.")) (|substring?| (((|Boolean|) $ $ (|Integer|)) "\\spad{substring?(s,{}t,{}i)} tests if \\spad{s} is a substring of \\spad{t} beginning at index \\spad{i}. Note: \\axiom{substring?(\\spad{s},{}\\spad{t},{}0) = prefix?(\\spad{s},{}\\spad{t})}.")) (|suffix?| (((|Boolean|) $ $) "\\spad{suffix?(s,{}t)} tests if the string \\spad{s} is the final substring of \\spad{t}. Note: \\axiom{suffix?(\\spad{s},{}\\spad{t}) \\spad{==} reduce(and,{}[\\spad{s}.\\spad{i} = \\spad{t}.(\\spad{n} - \\spad{m} + \\spad{i}) for \\spad{i} in 0..maxIndex \\spad{s}])} where \\spad{m} and \\spad{n} denote the maxIndex of \\spad{s} and \\spad{t} respectively.")) (|prefix?| (((|Boolean|) $ $) "\\spad{prefix?(s,{}t)} tests if the string \\spad{s} is the initial substring of \\spad{t}. Note: \\axiom{prefix?(\\spad{s},{}\\spad{t}) \\spad{==} reduce(and,{}[\\spad{s}.\\spad{i} = \\spad{t}.\\spad{i} for \\spad{i} in 0..maxIndex \\spad{s}])}.")) (|upperCase!| (($ $) "\\spad{upperCase!(s)} destructively replaces the alphabetic characters in \\spad{s} by upper case characters.")) (|upperCase| (($ $) "\\spad{upperCase(s)} returns the string with all characters in upper case.")) (|lowerCase!| (($ $) "\\spad{lowerCase!(s)} destructively replaces the alphabetic characters in \\spad{s} by lower case.")) (|lowerCase| (($ $) "\\spad{lowerCase(s)} returns the string with all characters in lower case."))) -((-4370 . T) (-4369 . T) (-4284 . T)) +((-4370 . T) (-4369 . T)) NIL (-1124 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\\spad{'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{\\spad{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.}"))) @@ -4435,19 +4435,19 @@ NIL (-1126 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}."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-1127 A S) ((|constructor| (NIL "A stream aggregate is a linear aggregate which possibly has an infinite number of elements. A basic domain constructor which builds stream aggregates is \\spadtype{Stream}. From streams,{} a number of infinite structures such power series can be built. A stream aggregate may also be infinite since it may be cyclic. For example,{} see \\spadtype{DecimalExpansion}.")) (|possiblyInfinite?| (((|Boolean|) $) "\\spad{possiblyInfinite?(s)} tests if the stream \\spad{s} could possibly have an infinite number of elements. Note: for many datatypes,{} \\axiom{possiblyInfinite?(\\spad{s}) = not explictlyFinite?(\\spad{s})}.")) (|explicitlyFinite?| (((|Boolean|) $) "\\spad{explicitlyFinite?(s)} tests if the stream has a finite number of elements,{} and \\spad{false} otherwise. Note: for many datatypes,{} \\axiom{explicitlyFinite?(\\spad{s}) = not possiblyInfinite?(\\spad{s})}."))) NIL NIL (-1128 S) ((|constructor| (NIL "A stream aggregate is a linear aggregate which possibly has an infinite number of elements. A basic domain constructor which builds stream aggregates is \\spadtype{Stream}. From streams,{} a number of infinite structures such power series can be built. A stream aggregate may also be infinite since it may be cyclic. For example,{} see \\spadtype{DecimalExpansion}.")) (|possiblyInfinite?| (((|Boolean|) $) "\\spad{possiblyInfinite?(s)} tests if the stream \\spad{s} could possibly have an infinite number of elements. Note: for many datatypes,{} \\axiom{possiblyInfinite?(\\spad{s}) = not explictlyFinite?(\\spad{s})}.")) (|explicitlyFinite?| (((|Boolean|) $) "\\spad{explicitlyFinite?(s)} tests if the stream has a finite number of elements,{} and \\spad{false} otherwise. Note: for many datatypes,{} \\axiom{explicitlyFinite?(\\spad{s}) = not possiblyInfinite?(\\spad{s})}."))) -((-4284 . T)) +NIL NIL (-1129 |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."))) ((-4370 . T)) -((-12 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2669) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3359) (|devaluate| |#2|)))))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-833))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2578) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3256) (|devaluate| |#2|)))))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-833))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079)))) (-1130) ((|constructor| (NIL "A class of objects which can be 'stepped through'. Repeated applications of \\spadfun{nextItem} is guaranteed never to return duplicate items and only return \"failed\" after exhausting all elements of the domain. This assumes that the sequence starts with \\spad{init()}. For infinite domains,{} repeated application of \\spadfun{nextItem} is not required to reach all possible domain elements starting from any initial element. \\blankline Conditional attributes: \\indented{2}{infinite\\tab{15}repeated \\spad{nextItem}\\spad{'s} are never \"failed\".}")) (|nextItem| (((|Union| $ "failed") $) "\\spad{nextItem(x)} returns the next item,{} or \"failed\" if domain is exhausted.")) (|init| (($) "\\spad{init()} chooses an initial object for stepping."))) NIL @@ -4469,21 +4469,21 @@ NIL NIL NIL (-1135 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}.")) (|coerce| (($ (|List| |#1|)) "\\spad{coerce(l)} converts a list \\spad{l} to a stream.")) (|shallowlyMutable| ((|attribute|) "one may destructively alter a stream by assigning new values to its entries."))) +((|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."))) ((-4370 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-1136) ((|constructor| (NIL "A category for string-like objects")) (|string| (($ (|Integer|)) "\\spad{string(i)} returns the decimal representation of \\spad{i} in a string"))) -((-4370 . T) (-4369 . T) (-4284 . T)) +((-4370 . T) (-4369 . T)) NIL (-1137) NIL ((-4370 . T) (-4369 . T)) -((-4028 (-12 (|HasCategory| (-141) (QUOTE (-833))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141))))) (-12 (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141)))))) (|HasCategory| (-141) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-141) (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-141) (QUOTE (-1079))) (-12 (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141))))) (|HasCategory| (-141) (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| (-141) (QUOTE (-833))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141))))) (-12 (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141)))))) (|HasCategory| (-141) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| (-141) (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| (-141) (QUOTE (-1079))) (|HasCategory| (-141) (LIST (QUOTE -303) (QUOTE (-141)))))) (-1138 |Entry|) ((|constructor| (NIL "This domain provides tables where the keys are strings. A specialized hash function for strings is used."))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 |#1|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 |#1|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2669) (QUOTE (-1137))) (LIST (QUOTE |:|) (QUOTE -3359) (|devaluate| |#1|)))))) (-4028 (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 |#1|)) (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-1079)))) (-4028 (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 |#1|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 |#1|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 |#1|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 |#1|)) (QUOTE (-1079))) (|HasCategory| (-1137) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 |#1|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2669 (-1137)) (|:| -3359 |#1|)) (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 |#1|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 |#1|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2578) (QUOTE (-1137))) (LIST (QUOTE |:|) (QUOTE -3256) (|devaluate| |#1|)))))) (-3988 (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 |#1|)) (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-1079)))) (-3988 (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 |#1|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 |#1|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 |#1|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 |#1|)) (QUOTE (-1079))) (|HasCategory| (-1137) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 |#1|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2578 (-1137)) (|:| -3256 |#1|)) (LIST (QUOTE -600) (QUOTE (-845))))) (-1139 A) ((|constructor| (NIL "StreamTaylorSeriesOperations implements Taylor series arithmetic,{} where a Taylor series is represented by a stream of its coefficients.")) (|power| (((|Stream| |#1|) |#1| (|Stream| |#1|)) "\\spad{power(a,{}f)} returns the power series \\spad{f} raised to the power \\spad{a}.")) (|lazyGintegrate| (((|Stream| |#1|) (|Mapping| |#1| (|Integer|)) |#1| (|Mapping| (|Stream| |#1|))) "\\spad{lazyGintegrate(f,{}r,{}g)} is used for fixed point computations.")) (|mapdiv| (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{mapdiv([a0,{}a1,{}..],{}[b0,{}b1,{}..])} returns \\spad{[a0/b0,{}a1/b1,{}..]}.")) (|powern| (((|Stream| |#1|) (|Fraction| (|Integer|)) (|Stream| |#1|)) "\\spad{powern(r,{}f)} raises power series \\spad{f} to the power \\spad{r}.")) (|nlde| (((|Stream| |#1|) (|Stream| (|Stream| |#1|))) "\\spad{nlde(u)} solves a first order non-linear differential equation described by \\spad{u} of the form \\spad{[[b<0,{}0>,{}b<0,{}1>,{}...],{}[b<1,{}0>,{}b<1,{}1>,{}.],{}...]}. the differential equation has the form \\spad{y' = sum(i=0 to infinity,{}j=0 to infinity,{}b<i,{}j>*(x**i)*(y**j))}.")) (|lazyIntegrate| (((|Stream| |#1|) |#1| (|Mapping| (|Stream| |#1|))) "\\spad{lazyIntegrate(r,{}f)} is a local function used for fixed point computations.")) (|integrate| (((|Stream| |#1|) |#1| (|Stream| |#1|)) "\\spad{integrate(r,{}a)} returns the integral of the power series \\spad{a} with respect to the power series variableintegration where \\spad{r} denotes the constant of integration. Thus \\spad{integrate(a,{}[a0,{}a1,{}a2,{}...]) = [a,{}a0,{}a1/2,{}a2/3,{}...]}.")) (|invmultisect| (((|Stream| |#1|) (|Integer|) (|Integer|) (|Stream| |#1|)) "\\spad{invmultisect(a,{}b,{}st)} substitutes \\spad{x**((a+b)*n)} for \\spad{x**n} and multiplies by \\spad{x**b}.")) (|multisect| (((|Stream| |#1|) (|Integer|) (|Integer|) (|Stream| |#1|)) "\\spad{multisect(a,{}b,{}st)} selects the coefficients of \\spad{x**((a+b)*n+a)},{} and changes them to \\spad{x**n}.")) (|generalLambert| (((|Stream| |#1|) (|Stream| |#1|) (|Integer|) (|Integer|)) "\\spad{generalLambert(f(x),{}a,{}d)} returns \\spad{f(x**a) + f(x**(a + d)) + f(x**(a + 2 d)) + ...}. \\spad{f(x)} should have zero constant coefficient and \\spad{a} and \\spad{d} should be positive.")) (|evenlambert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{evenlambert(st)} computes \\spad{f(x**2) + f(x**4) + f(x**6) + ...} if \\spad{st} is a stream representing \\spad{f(x)}. This function is used for computing infinite products. If \\spad{f(x)} is a power series with constant coefficient 1,{} then \\spad{prod(f(x**(2*n)),{}n=1..infinity) = exp(evenlambert(log(f(x))))}.")) (|oddlambert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{oddlambert(st)} computes \\spad{f(x) + f(x**3) + f(x**5) + ...} if \\spad{st} is a stream representing \\spad{f(x)}. This function is used for computing infinite products. If \\spad{f}(\\spad{x}) is a power series with constant coefficient 1 then \\spad{prod(f(x**(2*n-1)),{}n=1..infinity) = exp(oddlambert(log(f(x))))}.")) (|lambert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{lambert(st)} computes \\spad{f(x) + f(x**2) + f(x**3) + ...} if \\spad{st} is a stream representing \\spad{f(x)}. This function is used for computing infinite products. If \\spad{f(x)} is a power series with constant coefficient 1 then \\spad{prod(f(x**n),{}n = 1..infinity) = exp(lambert(log(f(x))))}.")) (|addiag| (((|Stream| |#1|) (|Stream| (|Stream| |#1|))) "\\spad{addiag(x)} performs diagonal addition of a stream of streams. if \\spad{x} = \\spad{[[a<0,{}0>,{}a<0,{}1>,{}..],{}[a<1,{}0>,{}a<1,{}1>,{}..],{}[a<2,{}0>,{}a<2,{}1>,{}..],{}..]} and \\spad{addiag(x) = [b<0,{}b<1>,{}...],{} then b<k> = sum(i+j=k,{}a<i,{}j>)}.")) (|revert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{revert(a)} computes the inverse of a power series \\spad{a} with respect to composition. the series should have constant coefficient 0 and first order coefficient 1.")) (|lagrange| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{lagrange(g)} produces the power series for \\spad{f} where \\spad{f} is implicitly defined as \\spad{f(z) = z*g(f(z))}.")) (|compose| (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{compose(a,{}b)} composes the power series \\spad{a} with the power series \\spad{b}.")) (|eval| (((|Stream| |#1|) (|Stream| |#1|) |#1|) "\\spad{eval(a,{}r)} returns a stream of partial sums of the power series \\spad{a} evaluated at the power series variable equal to \\spad{r}.")) (|coerce| (((|Stream| |#1|) |#1|) "\\spad{coerce(r)} converts a ring element \\spad{r} to a stream with one element.")) (|gderiv| (((|Stream| |#1|) (|Mapping| |#1| (|Integer|)) (|Stream| |#1|)) "\\spad{gderiv(f,{}[a0,{}a1,{}a2,{}..])} returns \\spad{[f(0)*a0,{}f(1)*a1,{}f(2)*a2,{}..]}.")) (|deriv| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{deriv(a)} returns the derivative of the power series with respect to the power series variable. Thus \\spad{deriv([a0,{}a1,{}a2,{}...])} returns \\spad{[a1,{}2 a2,{}3 a3,{}...]}.")) (|mapmult| (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{mapmult([a0,{}a1,{}..],{}[b0,{}b1,{}..])} returns \\spad{[a0*b0,{}a1*b1,{}..]}.")) (|int| (((|Stream| |#1|) |#1|) "\\spad{int(r)} returns [\\spad{r},{}\\spad{r+1},{}\\spad{r+2},{}...],{} where \\spad{r} is a ring element.")) (|oddintegers| (((|Stream| (|Integer|)) (|Integer|)) "\\spad{oddintegers(n)} returns \\spad{[n,{}n+2,{}n+4,{}...]}.")) (|integers| (((|Stream| (|Integer|)) (|Integer|)) "\\spad{integers(n)} returns \\spad{[n,{}n+1,{}n+2,{}...]}.")) (|monom| (((|Stream| |#1|) |#1| (|Integer|)) "\\spad{monom(deg,{}coef)} is a monomial of degree \\spad{deg} with coefficient \\spad{coef}.")) (|recip| (((|Union| (|Stream| |#1|) "failed") (|Stream| |#1|)) "\\spad{recip(a)} returns the power series reciprocal of \\spad{a},{} or \"failed\" if not possible.")) (/ (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{a / b} returns the power series quotient of \\spad{a} by \\spad{b}. An error message is returned if \\spad{b} is not invertible. This function is used in fixed point computations.")) (|exquo| (((|Union| (|Stream| |#1|) "failed") (|Stream| |#1|) (|Stream| |#1|)) "\\spad{exquo(a,{}b)} returns the power series quotient of \\spad{a} by \\spad{b},{} if the quotient exists,{} and \"failed\" otherwise")) (* (((|Stream| |#1|) (|Stream| |#1|) |#1|) "\\spad{a * r} returns the power series scalar multiplication of \\spad{a} by \\spad{r:} \\spad{[a0,{}a1,{}...] * r = [a0 * r,{}a1 * r,{}...]}") (((|Stream| |#1|) |#1| (|Stream| |#1|)) "\\spad{r * a} returns the power series scalar multiplication of \\spad{r} by \\spad{a}: \\spad{r * [a0,{}a1,{}...] = [r * a0,{}r * a1,{}...]}") (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{a * b} returns the power series (Cauchy) product of \\spad{a} and \\spad{b:} \\spad{[a0,{}a1,{}...] * [b0,{}b1,{}...] = [c0,{}c1,{}...]} where \\spad{ck = sum(i + j = k,{}\\spad{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 @@ -4514,9 +4514,9 @@ NIL NIL (-1146 |Coef| |var| |cen|) ((|constructor| (NIL "Sparse Laurent series in one variable \\indented{2}{\\spadtype{SparseUnivariateLaurentSeries} is a domain representing Laurent} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{SparseUnivariateLaurentSeries(Integer,{}x,{}3)} represents Laurent} \\indented{2}{series in \\spad{(x - 3)} with integer coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Laurent series."))) -(((-4371 "*") -4028 (-3791 (|has| |#1| (-357)) (|has| (-1153 |#1| |#2| |#3|) (-806))) (|has| |#1| (-169)) (-3791 (|has| |#1| (-357)) (|has| (-1153 |#1| |#2| |#3|) (-891)))) (-4362 -4028 (-3791 (|has| |#1| (-357)) (|has| (-1153 |#1| |#2| |#3|) (-806))) (|has| |#1| (-545)) (-3791 (|has| |#1| (-357)) (|has| (-1153 |#1| |#2| |#3|) (-891)))) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4363 . T) (-4364 . T) (-4366 . T)) -((-4028 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-1004))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-1130))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -280) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -303) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -507) (QUOTE (-1155)) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-4028 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-142)))) (-4028 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-144)))) (-4028 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|)))))) (-4028 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-228))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|))))) (|HasCategory| (-553) (QUOTE (-1091))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-357))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-1004))) (|HasCategory| |#1| (QUOTE (-357)))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-4028 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-357))))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-1130))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -280) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -303) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -507) (QUOTE (-1155)) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3212) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553))))) (-4028 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -1619) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3611) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-142))) (-4028 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-545)))) (-4028 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-4028 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-169)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-142))))) -(-1147 R -3219) +(((-4371 "*") -3988 (-3726 (|has| |#1| (-357)) (|has| (-1153 |#1| |#2| |#3|) (-806))) (|has| |#1| (-169)) (-3726 (|has| |#1| (-357)) (|has| (-1153 |#1| |#2| |#3|) (-891)))) (-4362 -3988 (-3726 (|has| |#1| (-357)) (|has| (-1153 |#1| |#2| |#3|) (-806))) (|has| |#1| (-545)) (-3726 (|has| |#1| (-357)) (|has| (-1153 |#1| |#2| |#3|) (-891)))) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4363 . T) (-4364 . T) (-4366 . T)) +((-3988 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-1004))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-1130))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -280) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -303) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -507) (QUOTE (-1155)) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-3988 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-142)))) (-3988 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-144)))) (-3988 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|)))))) (-3988 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-228))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|))))) (|HasCategory| (-553) (QUOTE (-1091))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-357))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-1004))) (|HasCategory| |#1| (QUOTE (-357)))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-3988 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-357))))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-1130))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -280) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -303) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -507) (QUOTE (-1155)) (LIST (QUOTE -1153) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3110) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553))))) (-3988 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3406) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3506) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-142))) (-3988 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-545)))) (-3988 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-3988 (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-169)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1153 |#1| |#2| |#3|) (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-142))))) +(-1147 R -3105) ((|constructor| (NIL "computes sums of top-level expressions.")) (|sum| ((|#2| |#2| (|SegmentBinding| |#2|)) "\\spad{sum(f(n),{} n = a..b)} returns \\spad{f}(a) + \\spad{f}(a+1) + ... + \\spad{f}(\\spad{b}).") ((|#2| |#2| (|Symbol|)) "\\spad{sum(a(n),{} n)} returns A(\\spad{n}) such that A(\\spad{n+1}) - A(\\spad{n}) = a(\\spad{n})."))) NIL NIL @@ -4535,21 +4535,21 @@ NIL (-1151 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."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4365 |has| |#1| (-357)) (-4367 |has| |#1| (-6 -4367)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#1| (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-1130))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (QUOTE (-228))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) +((|HasCategory| |#1| (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-1130))) (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-228))) (|HasAttribute| |#1| (QUOTE -4367)) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))))) (-1152 |Coef| |var| |cen|) -((|constructor| (NIL "Sparse Puiseux series in one variable \\indented{2}{\\spadtype{SparseUnivariatePuiseuxSeries} is a domain representing Puiseux} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{SparseUnivariatePuiseuxSeries(Integer,{}x,{}3)} represents Puiseux} \\indented{2}{series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Puiseux series."))) +((|constructor| (NIL "Sparse Puiseux series in one variable \\indented{2}{\\spadtype{SparseUnivariatePuiseuxSeries} is a domain representing Puiseux} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{SparseUnivariatePuiseuxSeries(Integer,{}x,{}3)} represents Puiseux} \\indented{2}{series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|)))) (|HasCategory| (-401 (-553)) (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-357))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasSignature| |#1| (LIST (QUOTE -3212) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (-4028 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -1619) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3611) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|)))) (|HasCategory| (-401 (-553)) (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-357))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasSignature| |#1| (LIST (QUOTE -3110) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (-3988 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3406) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3506) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|))))))) (-1153 |Coef| |var| |cen|) ((|constructor| (NIL "Sparse Taylor series in one variable \\indented{2}{\\spadtype{SparseUnivariateTaylorSeries} is a domain representing Taylor} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spadtype{SparseUnivariateTaylorSeries}(Integer,{}\\spad{x},{}3) represents Taylor} \\indented{2}{series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x),{}x)} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} computes the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|univariatePolynomial| (((|UnivariatePolynomial| |#2| |#1|) $ (|NonNegativeInteger|)) "\\spad{univariatePolynomial(f,{}k)} returns a univariate polynomial \\indented{1}{consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.}")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a \\indented{1}{Taylor series.}") (($ (|UnivariatePolynomial| |#2| |#1|)) "\\spad{coerce(p)} converts a univariate polynomial \\spad{p} in the variable \\spad{var} to a univariate Taylor series in \\spad{var}."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-757)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-757)) (|devaluate| |#1|)))) (|HasCategory| (-757) (QUOTE (-1091))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-757))))) (|HasSignature| |#1| (LIST (QUOTE -3212) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-757))))) (|HasCategory| |#1| (QUOTE (-357))) (-4028 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -1619) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3611) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-757)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-757)) (|devaluate| |#1|)))) (|HasCategory| (-757) (QUOTE (-1091))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-757))))) (|HasSignature| |#1| (LIST (QUOTE -3110) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-757))))) (|HasCategory| |#1| (QUOTE (-357))) (-3988 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3406) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3506) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|))))))) (-1154) ((|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 (-1155) -((|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}([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.")) (|coerce| (($ (|String|)) "\\spad{coerce(s)} converts the string \\spad{s} to a symbol.")) (|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 \\%."))) +((|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}([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 (-1156 R) @@ -4559,7 +4559,7 @@ NIL (-1157 R) ((|constructor| (NIL "This domain implements symmetric polynomial"))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-6 -4367)) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| (-953) (QUOTE (-129))) (|HasCategory| |#1| (QUOTE (-545)))) (-4028 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasAttribute| |#1| (QUOTE -4367))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-445))) (-12 (|HasCategory| (-953) (QUOTE (-129))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasAttribute| |#1| (QUOTE -4367))) (-1158) ((|constructor| (NIL "Creates and manipulates one global symbol table for FORTRAN code generation,{} containing details of types,{} dimensions,{} and argument lists.")) (|symbolTableOf| (((|SymbolTable|) (|Symbol|) $) "\\spad{symbolTableOf(f,{}tab)} returns the symbol table of \\spad{f}")) (|argumentListOf| (((|List| (|Symbol|)) (|Symbol|) $) "\\spad{argumentListOf(f,{}tab)} returns the argument list of \\spad{f}")) (|returnTypeOf| (((|Union| (|:| |fst| (|FortranScalarType|)) (|:| |void| "void")) (|Symbol|) $) "\\spad{returnTypeOf(f,{}tab)} returns the type of the object returned by \\spad{f}")) (|empty| (($) "\\spad{empty()} creates a new,{} empty symbol table.")) (|printTypes| (((|Void|) (|Symbol|)) "\\spad{printTypes(tab)} produces FORTRAN type declarations from \\spad{tab},{} on the current FORTRAN output stream")) (|printHeader| (((|Void|)) "\\spad{printHeader()} produces the FORTRAN header for the current subprogram in the global symbol table on the current FORTRAN output stream.") (((|Void|) (|Symbol|)) "\\spad{printHeader(f)} produces the FORTRAN header for subprogram \\spad{f} in the global symbol table on the current FORTRAN output stream.") (((|Void|) (|Symbol|) $) "\\spad{printHeader(f,{}tab)} produces the FORTRAN header for subprogram \\spad{f} in symbol table \\spad{tab} on the current FORTRAN output stream.")) (|returnType!| (((|Void|) (|Union| (|:| |fst| (|FortranScalarType|)) (|:| |void| "void"))) "\\spad{returnType!(t)} declares that the return type of he current subprogram in the global symbol table is \\spad{t}.") (((|Void|) (|Symbol|) (|Union| (|:| |fst| (|FortranScalarType|)) (|:| |void| "void"))) "\\spad{returnType!(f,{}t)} declares that the return type of subprogram \\spad{f} in the global symbol table is \\spad{t}.") (((|Void|) (|Symbol|) (|Union| (|:| |fst| (|FortranScalarType|)) (|:| |void| "void")) $) "\\spad{returnType!(f,{}t,{}tab)} declares that the return type of subprogram \\spad{f} in symbol table \\spad{tab} is \\spad{t}.")) (|argumentList!| (((|Void|) (|List| (|Symbol|))) "\\spad{argumentList!(l)} declares that the argument list for the current subprogram in the global symbol table is \\spad{l}.") (((|Void|) (|Symbol|) (|List| (|Symbol|))) "\\spad{argumentList!(f,{}l)} declares that the argument list for subprogram \\spad{f} in the global symbol table is \\spad{l}.") (((|Void|) (|Symbol|) (|List| (|Symbol|)) $) "\\spad{argumentList!(f,{}l,{}tab)} declares that the argument list for subprogram \\spad{f} in symbol table \\spad{tab} is \\spad{l}.")) (|endSubProgram| (((|Symbol|)) "\\spad{endSubProgram()} asserts that we are no longer processing the current subprogram.")) (|currentSubProgram| (((|Symbol|)) "\\spad{currentSubProgram()} returns the name of the current subprogram being processed")) (|newSubProgram| (((|Void|) (|Symbol|)) "\\spad{newSubProgram(f)} asserts that from now on type declarations are part of subprogram \\spad{f}.")) (|declare!| (((|FortranType|) (|Symbol|) (|FortranType|) (|Symbol|)) "\\spad{declare!(u,{}t,{}asp)} declares the parameter \\spad{u} to have type \\spad{t} in \\spad{asp}.") (((|FortranType|) (|Symbol|) (|FortranType|)) "\\spad{declare!(u,{}t)} declares the parameter \\spad{u} to have type \\spad{t} in the current level of the symbol table.") (((|FortranType|) (|List| (|Symbol|)) (|FortranType|) (|Symbol|) $) "\\spad{declare!(u,{}t,{}asp,{}tab)} declares the parameters \\spad{u} of subprogram \\spad{asp} to have type \\spad{t} in symbol table \\spad{tab}.") (((|FortranType|) (|Symbol|) (|FortranType|) (|Symbol|) $) "\\spad{declare!(u,{}t,{}asp,{}tab)} declares the parameter \\spad{u} of subprogram \\spad{asp} to have type \\spad{t} in symbol table \\spad{tab}.")) (|clearTheSymbolTable| (((|Void|) (|Symbol|)) "\\spad{clearTheSymbolTable(x)} removes the symbol \\spad{x} from the table") (((|Void|)) "\\spad{clearTheSymbolTable()} clears the current symbol table.")) (|showTheSymbolTable| (($) "\\spad{showTheSymbolTable()} returns the current symbol table."))) NIL @@ -4591,7 +4591,7 @@ NIL (-1165 |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}"))) ((-4369 . T) (-4370 . T)) -((-12 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2669) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3359) (|devaluate| |#2|)))))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-1079))) (-4028 (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2669 |#1|) (|:| -3359 |#2|)) (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -303) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2578) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3256) (|devaluate| |#2|)))))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| |#2| (QUOTE (-1079)))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -601) (QUOTE (-529)))) (-12 (|HasCategory| |#2| (QUOTE (-1079))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#2| (QUOTE (-1079))) (-3988 (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#2| (LIST (QUOTE -600) (QUOTE (-845)))) (|HasCategory| (-2 (|:| -2578 |#1|) (|:| -3256 |#2|)) (LIST (QUOTE -600) (QUOTE (-845))))) (-1166 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{\\spad{ai} = tan(\\spad{ui})} then \\spad{f(a1,{}...,{}an) = tan(u1 + ... + un)}."))) NIL @@ -4602,7 +4602,7 @@ NIL NIL (-1168 |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{:=} \\spad{e}}) is equivalent to \\axiom{(insert([\\spad{k},{}\\spad{e}],{}\\spad{t}); \\spad{e})}."))) -((-4370 . T) (-4284 . T)) +((-4370 . T)) NIL (-1169 |Key| |Entry|) ((|constructor| (NIL "\\axiom{TabulatedComputationPackage(Key ,{}Entry)} provides some modest support for dealing with operations with type \\axiom{Key \\spad{->} 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."))) @@ -4617,7 +4617,7 @@ NIL NIL NIL (-1172) -((|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 \\spad{``}\\verb+\\spad{\\[}+\\spad{''} and \\spad{``}\\verb+\\spad{\\]}+\\spad{''},{} 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.")) (|coerce| (($ (|OutputForm|)) "\\spad{coerce(o)} changes \\spad{o} in the standard output format to TeX format."))) +((|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 \\spad{``}\\verb+\\spad{\\[}+\\spad{''} and \\spad{``}\\verb+\\spad{\\]}+\\spad{''},{} 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 (-1173) @@ -4643,7 +4643,7 @@ NIL (-1178 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}."))) ((-4370 . T) (-4369 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1079))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (-1179 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 @@ -4652,7 +4652,7 @@ NIL ((|constructor| (NIL "Category for the trigonometric functions.")) (|tan| (($ $) "\\spad{tan(x)} returns the tangent of \\spad{x}.")) (|sin| (($ $) "\\spad{sin(x)} returns the sine of \\spad{x}.")) (|sec| (($ $) "\\spad{sec(x)} returns the secant of \\spad{x}.")) (|csc| (($ $) "\\spad{csc(x)} returns the cosecant of \\spad{x}.")) (|cot| (($ $) "\\spad{cot(x)} returns the cotangent of \\spad{x}.")) (|cos| (($ $) "\\spad{cos(x)} returns the cosine of \\spad{x}."))) NIL NIL -(-1181 R -3219) +(-1181 R -3105) ((|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 @@ -4660,7 +4660,7 @@ NIL ((|constructor| (NIL "This package provides functions that compute \"fraction-free\" inverses of upper and lower triangular matrices over a integral domain. By \"fraction-free inverses\" we mean the following: given a matrix \\spad{B} with entries in \\spad{R} and an element \\spad{d} of \\spad{R} such that \\spad{d} * inv(\\spad{B}) also has entries in \\spad{R},{} we return \\spad{d} * inv(\\spad{B}). Thus,{} it is not necessary to pass to the quotient field in any of our computations.")) (|LowTriBddDenomInv| ((|#4| |#4| |#1|) "\\spad{LowTriBddDenomInv(B,{}d)} returns \\spad{M},{} where \\spad{B} is a non-singular lower triangular matrix and \\spad{d} is an element of \\spad{R} such that \\spad{M = d * inv(B)} has entries in \\spad{R}.")) (|UpTriBddDenomInv| ((|#4| |#4| |#1|) "\\spad{UpTriBddDenomInv(B,{}d)} returns \\spad{M},{} where \\spad{B} is a non-singular upper triangular matrix and \\spad{d} is an element of \\spad{R} such that \\spad{M = d * inv(B)} has entries in \\spad{R}."))) NIL NIL -(-1183 R -3219) +(-1183 R -3105) ((|constructor| (NIL "TranscendentalManipulations provides functions to simplify and expand expressions involving transcendental operators.")) (|expandTrigProducts| ((|#2| |#2|) "\\spad{expandTrigProducts(e)} replaces \\axiom{sin(\\spad{x})*sin(\\spad{y})} by \\spad{(cos(x-y)-cos(x+y))/2},{} \\axiom{cos(\\spad{x})*cos(\\spad{y})} by \\spad{(cos(x-y)+cos(x+y))/2},{} and \\axiom{sin(\\spad{x})*cos(\\spad{y})} by \\spad{(sin(x-y)+sin(x+y))/2}. Note that this operation uses the pattern matcher and so is relatively expensive. To avoid getting into an infinite loop the transformations are applied at most ten times.")) (|removeSinhSq| ((|#2| |#2|) "\\spad{removeSinhSq(f)} converts every \\spad{sinh(u)**2} appearing in \\spad{f} into \\spad{1 - cosh(x)**2},{} and also reduces higher powers of \\spad{sinh(u)} with that formula.")) (|removeCoshSq| ((|#2| |#2|) "\\spad{removeCoshSq(f)} converts every \\spad{cosh(u)**2} appearing in \\spad{f} into \\spad{1 - sinh(x)**2},{} and also reduces higher powers of \\spad{cosh(u)} with that formula.")) (|removeSinSq| ((|#2| |#2|) "\\spad{removeSinSq(f)} converts every \\spad{sin(u)**2} appearing in \\spad{f} into \\spad{1 - cos(x)**2},{} and also reduces higher powers of \\spad{sin(u)} with that formula.")) (|removeCosSq| ((|#2| |#2|) "\\spad{removeCosSq(f)} converts every \\spad{cos(u)**2} appearing in \\spad{f} into \\spad{1 - sin(x)**2},{} and also reduces higher powers of \\spad{cos(u)} with that formula.")) (|coth2tanh| ((|#2| |#2|) "\\spad{coth2tanh(f)} converts every \\spad{coth(u)} appearing in \\spad{f} into \\spad{1/tanh(u)}.")) (|cot2tan| ((|#2| |#2|) "\\spad{cot2tan(f)} converts every \\spad{cot(u)} appearing in \\spad{f} into \\spad{1/tan(u)}.")) (|tanh2coth| ((|#2| |#2|) "\\spad{tanh2coth(f)} converts every \\spad{tanh(u)} appearing in \\spad{f} into \\spad{1/coth(u)}.")) (|tan2cot| ((|#2| |#2|) "\\spad{tan2cot(f)} converts every \\spad{tan(u)} appearing in \\spad{f} into \\spad{1/cot(u)}.")) (|tanh2trigh| ((|#2| |#2|) "\\spad{tanh2trigh(f)} converts every \\spad{tanh(u)} appearing in \\spad{f} into \\spad{sinh(u)/cosh(u)}.")) (|tan2trig| ((|#2| |#2|) "\\spad{tan2trig(f)} converts every \\spad{tan(u)} appearing in \\spad{f} into \\spad{sin(u)/cos(u)}.")) (|sinh2csch| ((|#2| |#2|) "\\spad{sinh2csch(f)} converts every \\spad{sinh(u)} appearing in \\spad{f} into \\spad{1/csch(u)}.")) (|sin2csc| ((|#2| |#2|) "\\spad{sin2csc(f)} converts every \\spad{sin(u)} appearing in \\spad{f} into \\spad{1/csc(u)}.")) (|sech2cosh| ((|#2| |#2|) "\\spad{sech2cosh(f)} converts every \\spad{sech(u)} appearing in \\spad{f} into \\spad{1/cosh(u)}.")) (|sec2cos| ((|#2| |#2|) "\\spad{sec2cos(f)} converts every \\spad{sec(u)} appearing in \\spad{f} into \\spad{1/cos(u)}.")) (|csch2sinh| ((|#2| |#2|) "\\spad{csch2sinh(f)} converts every \\spad{csch(u)} appearing in \\spad{f} into \\spad{1/sinh(u)}.")) (|csc2sin| ((|#2| |#2|) "\\spad{csc2sin(f)} converts every \\spad{csc(u)} appearing in \\spad{f} into \\spad{1/sin(u)}.")) (|coth2trigh| ((|#2| |#2|) "\\spad{coth2trigh(f)} converts every \\spad{coth(u)} appearing in \\spad{f} into \\spad{cosh(u)/sinh(u)}.")) (|cot2trig| ((|#2| |#2|) "\\spad{cot2trig(f)} converts every \\spad{cot(u)} appearing in \\spad{f} into \\spad{cos(u)/sin(u)}.")) (|cosh2sech| ((|#2| |#2|) "\\spad{cosh2sech(f)} converts every \\spad{cosh(u)} appearing in \\spad{f} into \\spad{1/sech(u)}.")) (|cos2sec| ((|#2| |#2|) "\\spad{cos2sec(f)} converts every \\spad{cos(u)} appearing in \\spad{f} into \\spad{1/sec(u)}.")) (|expandLog| ((|#2| |#2|) "\\spad{expandLog(f)} converts every \\spad{log(a/b)} appearing in \\spad{f} into \\spad{log(a) - log(b)},{} and every \\spad{log(a*b)} into \\spad{log(a) + log(b)}..")) (|expandPower| ((|#2| |#2|) "\\spad{expandPower(f)} converts every power \\spad{(a/b)**c} appearing in \\spad{f} into \\spad{a**c * b**(-c)}.")) (|simplifyLog| ((|#2| |#2|) "\\spad{simplifyLog(f)} converts every \\spad{log(a) - log(b)} appearing in \\spad{f} into \\spad{log(a/b)},{} every \\spad{log(a) + log(b)} into \\spad{log(a*b)} and every \\spad{n*log(a)} into \\spad{log(a^n)}.")) (|simplifyExp| ((|#2| |#2|) "\\spad{simplifyExp(f)} converts every product \\spad{exp(a)*exp(b)} appearing in \\spad{f} into \\spad{exp(a+b)}.")) (|htrigs| ((|#2| |#2|) "\\spad{htrigs(f)} converts all the exponentials in \\spad{f} into hyperbolic sines and cosines.")) (|simplify| ((|#2| |#2|) "\\spad{simplify(f)} performs the following simplifications on \\spad{f:}\\begin{items} \\item 1. rewrites trigs and hyperbolic trigs in terms of \\spad{sin} ,{}\\spad{cos},{} \\spad{sinh},{} \\spad{cosh}. \\item 2. rewrites \\spad{sin**2} and \\spad{sinh**2} in terms of \\spad{cos} and \\spad{cosh},{} \\item 3. rewrites \\spad{exp(a)*exp(b)} as \\spad{exp(a+b)}. \\item 4. rewrites \\spad{(a**(1/n))**m * (a**(1/s))**t} as a single power of a single radical of \\spad{a}. \\end{items}")) (|expand| ((|#2| |#2|) "\\spad{expand(f)} performs the following expansions on \\spad{f:}\\begin{items} \\item 1. logs of products are expanded into sums of logs,{} \\item 2. trigonometric and hyperbolic trigonometric functions of sums are expanded into sums of products of trigonometric and hyperbolic trigonometric functions. \\item 3. formal powers of the form \\spad{(a/b)**c} are expanded into \\spad{a**c * b**(-c)}. \\end{items}"))) NIL ((-12 (|HasCategory| |#1| (LIST (QUOTE -601) (LIST (QUOTE -874) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -868) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -868) (|devaluate| |#1|))))) @@ -4670,12 +4670,12 @@ NIL ((|HasCategory| |#4| (QUOTE (-362)))) (-1185 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} < ... < \\spad{Xn}}. A set \\axiom{\\spad{S}} of polynomials in \\axiom{\\spad{R}[\\spad{X1},{}\\spad{X2},{}...,{}\\spad{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(\\spad{ts})} returns \\axiom{size()\\spad{\\$}\\spad{V}} minus \\axiom{\\spad{\\#}\\spad{ts}}.")) (|extend| (($ $ |#4|) "\\axiom{extend(\\spad{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{\\spad{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(\\spad{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{\\spad{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(\\spad{ts},{}\\spad{v})} returns the polynomial of \\axiom{\\spad{ts}} with \\axiom{\\spad{v}} as main variable,{} if any.")) (|algebraic?| (((|Boolean|) |#3| $) "\\axiom{algebraic?(\\spad{v},{}\\spad{ts})} returns \\spad{true} iff \\axiom{\\spad{v}} is the main variable of some polynomial in \\axiom{\\spad{ts}}.")) (|algebraicVariables| (((|List| |#3|) $) "\\axiom{algebraicVariables(\\spad{ts})} returns the decreasingly sorted list of the main variables of the polynomials of \\axiom{\\spad{ts}}.")) (|rest| (((|Union| $ "failed") $) "\\axiom{rest(\\spad{ts})} returns the polynomials of \\axiom{\\spad{ts}} with smaller main variable than \\axiom{mvar(\\spad{ts})} if \\axiom{\\spad{ts}} is not empty,{} otherwise returns \"failed\"")) (|last| (((|Union| |#4| "failed") $) "\\axiom{last(\\spad{ts})} returns the polynomial of \\axiom{\\spad{ts}} with smallest main variable if \\axiom{\\spad{ts}} is not empty,{} otherwise returns \\axiom{\"failed\"}.")) (|first| (((|Union| |#4| "failed") $) "\\axiom{first(\\spad{ts})} returns the polynomial of \\axiom{\\spad{ts}} with greatest main variable if \\axiom{\\spad{ts}} is not empty,{} otherwise returns \\axiom{\"failed\"}.")) (|zeroSetSplitIntoTriangularSystems| (((|List| (|Record| (|:| |close| $) (|:| |open| (|List| |#4|)))) (|List| |#4|)) "\\axiom{zeroSetSplitIntoTriangularSystems(\\spad{lp})} returns a list of triangular systems \\axiom{[[\\spad{ts1},{}\\spad{qs1}],{}...,{}[\\spad{tsn},{}\\spad{qsn}]]} such that the zero set of \\axiom{\\spad{lp}} is the union of the closures of the \\axiom{W_i} where \\axiom{W_i} consists of the zeros of \\axiom{\\spad{ts}} which do not cancel any polynomial in \\axiom{qsi}.")) (|zeroSetSplit| (((|List| $) (|List| |#4|)) "\\axiom{zeroSetSplit(\\spad{lp})} returns a list \\axiom{\\spad{lts}} of triangular sets such that the zero set of \\axiom{\\spad{lp}} is the union of the closures of the regular zero sets of the members of \\axiom{\\spad{lts}}.")) (|reduceByQuasiMonic| ((|#4| |#4| $) "\\axiom{reduceByQuasiMonic(\\spad{p},{}\\spad{ts})} returns the same as \\axiom{remainder(\\spad{p},{}collectQuasiMonic(\\spad{ts})).polnum}.")) (|collectQuasiMonic| (($ $) "\\axiom{collectQuasiMonic(\\spad{ts})} returns the subset of \\axiom{\\spad{ts}} consisting of the polynomials with initial in \\axiom{\\spad{R}}.")) (|removeZero| ((|#4| |#4| $) "\\axiom{removeZero(\\spad{p},{}\\spad{ts})} returns \\axiom{0} if \\axiom{\\spad{p}} reduces to \\axiom{0} by pseudo-division \\spad{w}.\\spad{r}.\\spad{t} \\axiom{\\spad{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},{}\\spad{ts})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{initiallyReduced?(\\spad{r},{}\\spad{ts})} holds and there exists some product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}.")) (|headReduce| ((|#4| |#4| $) "\\axiom{headReduce(\\spad{p},{}\\spad{ts})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{headReduce?(\\spad{r},{}\\spad{ts})} holds and there exists some product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}.")) (|stronglyReduce| ((|#4| |#4| $) "\\axiom{stronglyReduce(\\spad{p},{}\\spad{ts})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{stronglyReduced?(\\spad{r},{}\\spad{ts})} holds and there exists some product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}.")) (|rewriteSetWithReduction| (((|List| |#4|) (|List| |#4|) $ (|Mapping| |#4| |#4| |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\axiom{rewriteSetWithReduction(\\spad{lp},{}\\spad{ts},{}redOp,{}redOp?)} returns a list \\axiom{\\spad{lq}} of polynomials such that \\axiom{[reduce(\\spad{p},{}\\spad{ts},{}redOp,{}redOp?) for \\spad{p} in \\spad{lp}]} and \\axiom{\\spad{lp}} have the same zeros inside the regular zero set of \\axiom{\\spad{ts}}. Moreover,{} for every polynomial \\axiom{\\spad{q}} in \\axiom{\\spad{lq}} and every polynomial \\axiom{\\spad{t}} in \\axiom{\\spad{ts}} \\axiom{redOp?(\\spad{q},{}\\spad{t})} holds and there exists a polynomial \\axiom{\\spad{p}} in the ideal generated by \\axiom{\\spad{lp}} and a product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{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 = \\spad{f*q} + redOp(\\spad{p},{}\\spad{q})}.")) (|reduce| ((|#4| |#4| $ (|Mapping| |#4| |#4| |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\axiom{reduce(\\spad{p},{}\\spad{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{\\spad{ts}} and there exists some product \\axiom{\\spad{h}} of the initials of the members of \\axiom{\\spad{ts}} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{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 = \\spad{f*q} + redOp(\\spad{p},{}\\spad{q})}.")) (|autoReduced?| (((|Boolean|) $ (|Mapping| (|Boolean|) |#4| (|List| |#4|))) "\\axiom{autoReduced?(\\spad{ts},{}redOp?)} returns \\spad{true} iff every element of \\axiom{\\spad{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},{}\\spad{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{\\spad{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},{}\\spad{ts})} returns \\spad{true} iff the head of \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{ts}}.")) (|stronglyReduced?| (((|Boolean|) $) "\\axiom{stronglyReduced?(\\spad{ts})} returns \\spad{true} iff 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{stronglyReduced?(\\spad{p},{}\\spad{ts})} returns \\spad{true} iff \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{ts}}.")) (|reduced?| (((|Boolean|) |#4| $ (|Mapping| (|Boolean|) |#4| |#4|)) "\\axiom{reduced?(\\spad{p},{}\\spad{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{\\spad{ts}} \\axiom{redOp?(\\spad{p},{}\\spad{t})} holds.")) (|normalized?| (((|Boolean|) $) "\\axiom{normalized?(\\spad{ts})} returns \\spad{true} iff for every axiom{\\spad{p}} in axiom{\\spad{ts}} we have \\axiom{normalized?(\\spad{p},{}us)} where \\axiom{us} is \\axiom{collectUnder(\\spad{ts},{}mvar(\\spad{p}))}.") (((|Boolean|) |#4| $) "\\axiom{normalized?(\\spad{p},{}\\spad{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{\\spad{ts}}")) (|quasiComponent| (((|Record| (|:| |close| (|List| |#4|)) (|:| |open| (|List| |#4|))) $) "\\axiom{quasiComponent(\\spad{ts})} returns \\axiom{[\\spad{lp},{}\\spad{lq}]} where \\axiom{\\spad{lp}} is the list of the members of \\axiom{\\spad{ts}} and \\axiom{\\spad{lq}}is \\axiom{initials(\\spad{ts})}.")) (|degree| (((|NonNegativeInteger|) $) "\\axiom{degree(\\spad{ts})} returns the product of main degrees of the members of \\axiom{\\spad{ts}}.")) (|initials| (((|List| |#4|) $) "\\axiom{initials(\\spad{ts})} returns the list of the non-constant initials of the members of \\axiom{\\spad{ts}}.")) (|basicSet| (((|Union| (|Record| (|:| |bas| $) (|:| |top| (|List| |#4|))) "failed") (|List| |#4|) (|Mapping| (|Boolean|) |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\axiom{basicSet(\\spad{ps},{}pred?,{}redOp?)} returns the same as \\axiom{basicSet(\\spad{qs},{}redOp?)} where \\axiom{\\spad{qs}} consists of the polynomials of \\axiom{\\spad{ps}} satisfying property \\axiom{pred?}.") (((|Union| (|Record| (|:| |bas| $) (|:| |top| (|List| |#4|))) "failed") (|List| |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\axiom{basicSet(\\spad{ps},{}redOp?)} returns \\axiom{[\\spad{bs},{}\\spad{ts}]} where \\axiom{concat(\\spad{bs},{}\\spad{ts})} is \\axiom{\\spad{ps}} and \\axiom{\\spad{bs}} is a basic set in Wu Wen Tsun sense of \\axiom{\\spad{ps}} \\spad{w}.\\spad{r}.\\spad{t} the reduction-test \\axiom{redOp?},{} if no non-zero constant polynomial lie in \\axiom{\\spad{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."))) -((-4370 . T) (-4369 . T) (-4284 . T)) +((-4370 . T) (-4369 . T)) NIL (-1186 |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}."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-357)))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-142))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-357)))) (-1187 |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 @@ -4685,10 +4685,10 @@ NIL NIL NIL (-1189 S) -((|constructor| (NIL "\\indented{1}{This domain is used to interface with the interpreter\\spad{'s} notion} of comma-delimited sequences of values.")) (|length| (((|NonNegativeInteger|) $) "\\spad{length(x)} returns the number of elements in tuple \\spad{x}")) (|select| ((|#1| $ (|NonNegativeInteger|)) "\\spad{select(x,{}n)} returns the \\spad{n}-th element of tuple \\spad{x}. tuples are 0-based")) (|coerce| (($ (|PrimitiveArray| |#1|)) "\\spad{coerce(a)} makes a tuple from primitive array a"))) +((|constructor| (NIL "\\indented{1}{This domain is used to interface with the interpreter\\spad{'s} notion} of comma-delimited sequences of values.")) (|length| (((|NonNegativeInteger|) $) "\\spad{length(x)} returns the number of elements in tuple \\spad{x}")) (|select| ((|#1| $ (|NonNegativeInteger|)) "\\spad{select(x,{}n)} returns the \\spad{n}-th element of tuple \\spad{x}. tuples are 0-based"))) NIL ((|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) -(-1190 -3219) +(-1190 -3105) ((|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 @@ -4698,7 +4698,7 @@ NIL NIL (-1192) ((|constructor| (NIL "The fundamental Type."))) -((-4284 . T)) +NIL NIL (-1193 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 \\spad{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 \\spad{by:} \\indented{3}{(1)\\space{2}\\spad{b1 < b2 < ... < bm < a1 < a2 < ... < an}.} \\indented{3}{(2)\\space{2}\\spad{bj < c < \\spad{ai}}\\space{2}for \\spad{c} not among the \\spad{ai}\\spad{'s} and \\spad{bj}\\spad{'s}.} \\indented{3}{(3)\\space{2}undefined on \\spad{(c,{}d)} if neither is among the \\spad{ai}\\spad{'s},{}\\spad{bj}\\spad{'s}.}") (((|Void|) (|List| |#1|)) "\\spad{setOrder([a1,{}...,{}an])} defines a partial ordering on \\spad{S} given \\spad{by:} \\indented{3}{(1)\\space{2}\\spad{a1 < a2 < ... < an}.} \\indented{3}{(2)\\space{2}\\spad{b < \\spad{ai}\\space{3}for i = 1..n} and \\spad{b} not among the \\spad{ai}\\spad{'s}.} \\indented{3}{(3)\\space{2}undefined on \\spad{(b,{} c)} if neither is among the \\spad{ai}\\spad{'s}.}"))) @@ -4725,21 +4725,21 @@ NIL (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-1199 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.")) (|coerce| (($ |#3|) "\\spad{coerce(f(x))} converts the Taylor series \\spad{f(x)} to a Laurent series.")) (|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)}."))) +((|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 (-357)))) (-1200 |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.")) (|coerce| (($ |#2|) "\\spad{coerce(f(x))} converts the Taylor series \\spad{f(x)} to a Laurent series.")) (|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)}."))) -(((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4284 |has| |#1| (-357)) (-4363 . T) (-4364 . T) (-4366 . T)) +((|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)}."))) +(((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-1201 |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)}."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4363 . T) (-4364 . T) (-4366 . T)) -((-4028 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -280) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-806)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-833)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-891)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1004)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1130)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-1155)))))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-4028 (|HasCategory| |#1| (QUOTE (-142))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-142))))) (-4028 (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-144))))) (-4028 (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-228)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|))))) (|HasCategory| (-553) (QUOTE (-1091))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-357))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-891)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-1155))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1004)))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-806)))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-806)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-833))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1130)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -280) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3212) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553))))) (-4028 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -1619) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3611) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-833)))) (|HasCategory| |#2| (QUOTE (-891))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-538)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-301)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-142)))))) +((-3988 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -280) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-806)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-833)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-891)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1004)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1130)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-1155)))))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-3988 (|HasCategory| |#1| (QUOTE (-142))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-142))))) (-3988 (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-144))))) (-3988 (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-228)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|))))) (|HasCategory| (-553) (QUOTE (-1091))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-357))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-891)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-1155))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1004)))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-806)))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-806)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-833))))) (-3988 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -280) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-806)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-833)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-891)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1004)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1130)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-1155)))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1130)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -280) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -303) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -507) (QUOTE (-1155)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3110) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553))))) (-3988 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3406) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3506) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-833)))) (|HasCategory| |#2| (QUOTE (-891))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-538)))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-301)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#1| (QUOTE (-142))) (-12 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-142)))))) (-1202 |Coef| |var| |cen|) ((|constructor| (NIL "Dense Laurent series in one variable \\indented{2}{\\spadtype{UnivariateLaurentSeries} is a domain representing Laurent} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{UnivariateLaurentSeries(Integer,{}x,{}3)} represents Laurent series in} \\indented{2}{\\spad{(x - 3)} with integer coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Laurent series."))) -(((-4371 "*") -4028 (-3791 (|has| |#1| (-357)) (|has| (-1230 |#1| |#2| |#3|) (-806))) (|has| |#1| (-169)) (-3791 (|has| |#1| (-357)) (|has| (-1230 |#1| |#2| |#3|) (-891)))) (-4362 -4028 (-3791 (|has| |#1| (-357)) (|has| (-1230 |#1| |#2| |#3|) (-806))) (|has| |#1| (-545)) (-3791 (|has| |#1| (-357)) (|has| (-1230 |#1| |#2| |#3|) (-891)))) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4363 . T) (-4364 . T) (-4366 . T)) -((-4028 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-1004))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-1130))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -280) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -303) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -507) (QUOTE (-1155)) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-4028 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-142)))) (-4028 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-144)))) (-4028 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|)))))) (-4028 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-228))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|))))) (|HasCategory| (-553) (QUOTE (-1091))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-357))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-1004))) (|HasCategory| |#1| (QUOTE (-357)))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-4028 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-357))))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-1130))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -280) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -303) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -507) (QUOTE (-1155)) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3212) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553))))) (-4028 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -1619) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3611) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-142))) (-4028 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-545)))) (-4028 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-4028 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-169)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-142))))) +(((-4371 "*") -3988 (-3726 (|has| |#1| (-357)) (|has| (-1230 |#1| |#2| |#3|) (-806))) (|has| |#1| (-169)) (-3726 (|has| |#1| (-357)) (|has| (-1230 |#1| |#2| |#3|) (-891)))) (-4362 -3988 (-3726 (|has| |#1| (-357)) (|has| (-1230 |#1| |#2| |#3|) (-806))) (|has| |#1| (-545)) (-3726 (|has| |#1| (-357)) (|has| (-1230 |#1| |#2| |#3|) (-891)))) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4363 . T) (-4364 . T) (-4366 . T)) +((-3988 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-1004))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-1130))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -280) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -303) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -507) (QUOTE (-1155)) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (-3988 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-142)))) (-3988 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-144)))) (-3988 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|)))))) (-3988 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-228))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-553)) (|devaluate| |#1|))))) (|HasCategory| (-553) (QUOTE (-1091))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-357))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-1155)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-1004))) (|HasCategory| |#1| (QUOTE (-357)))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-3988 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-357))))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-1130))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -280) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -303) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -507) (QUOTE (-1155)) (LIST (QUOTE -1230) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3110) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-553))))) (-3988 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3406) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3506) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-538))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-301))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-142))) (-3988 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-545)))) (-3988 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-3988 (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-806))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-169)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-891))) (|HasCategory| |#1| (QUOTE (-357)))) (-12 (|HasCategory| (-1230 |#1| |#2| |#3|) (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-357)))) (|HasCategory| |#1| (QUOTE (-142))))) (-1203 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 @@ -4773,9 +4773,9 @@ NIL NIL NIL (-1211 |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}")) (|coerce| (($ (|Variable| |#1|)) "\\spad{coerce(x)} converts the variable \\spad{x} to a univariate polynomial."))) +((|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}"))) (((-4371 "*") |has| |#2| (-169)) (-4362 |has| |#2| (-545)) (-4365 |has| |#2| (-357)) (-4367 |has| |#2| (-6 -4367)) (-4364 . T) (-4363 . T) (-4366 . T)) -((|HasCategory| |#2| (QUOTE (-891))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-169))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-545)))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#2| (QUOTE (-833))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (-4028 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1130))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (-4028 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#2| (QUOTE (-228))) (|HasAttribute| |#2| (QUOTE -4367)) (|HasCategory| |#2| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (-4028 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-142))))) +((|HasCategory| |#2| (QUOTE (-891))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-169))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-545)))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-373)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-373))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -868) (QUOTE (-553)))) (|HasCategory| |#2| (LIST (QUOTE -868) (QUOTE (-553))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-373)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -601) (LIST (QUOTE -874) (QUOTE (-553)))))) (-12 (|HasCategory| (-1061) (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#2| (LIST (QUOTE -601) (QUOTE (-529))))) (|HasCategory| |#2| (QUOTE (-833))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (QUOTE (-553)))) (-3988 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| |#2| (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (-3988 (|HasCategory| |#2| (QUOTE (-169))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-545))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-445))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-357))) (|HasCategory| |#2| (QUOTE (-1130))) (|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasCategory| |#2| (QUOTE (-228))) (|HasAttribute| |#2| (QUOTE -4367)) (|HasCategory| |#2| (QUOTE (-445))) (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (-3988 (-12 (|HasCategory| $ (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-891)))) (|HasCategory| |#2| (QUOTE (-142))))) (-1212 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 @@ -4791,7 +4791,7 @@ NIL (-1215 S |Coef| |Expon|) ((|constructor| (NIL "\\spadtype{UnivariatePowerSeriesCategory} is the most general univariate power series category with exponents in an ordered abelian monoid. Note: this category exports a substitution function if it is possible to multiply exponents. Note: this category exports a derivative operation if it is possible to multiply coefficients by exponents.")) (|eval| (((|Stream| |#2|) $ |#2|) "\\spad{eval(f,{}a)} evaluates a power series at a value in the ground ring by returning a stream of partial sums.")) (|extend| (($ $ |#3|) "\\spad{extend(f,{}n)} causes all terms of \\spad{f} of degree \\spad{<=} \\spad{n} to be computed.")) (|approximate| ((|#2| $ |#3|) "\\spad{approximate(f)} returns a truncated power series with the series variable viewed as an element of the coefficient domain.")) (|truncate| (($ $ |#3| |#3|) "\\spad{truncate(f,{}k1,{}k2)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{d} with \\spad{k1 <= d <= k2}.") (($ $ |#3|) "\\spad{truncate(f,{}k)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.")) (|order| ((|#3| $ |#3|) "\\spad{order(f,{}n) = min(m,{}n)},{} where \\spad{m} is the degree of the lowest order non-zero term in \\spad{f}.") ((|#3| $) "\\spad{order(f)} is the degree of the lowest order non-zero term in \\spad{f}. This will result in an infinite loop if \\spad{f} has no non-zero terms.")) (|multiplyExponents| (($ $ (|PositiveInteger|)) "\\spad{multiplyExponents(f,{}n)} multiplies all exponents of the power series \\spad{f} by the positive integer \\spad{n}.")) (|center| ((|#2| $) "\\spad{center(f)} returns the point about which the series \\spad{f} is expanded.")) (|variable| (((|Symbol|) $) "\\spad{variable(f)} returns the (unique) power series variable of the power series \\spad{f}.")) (|elt| ((|#2| $ |#3|) "\\spad{elt(f(x),{}r)} returns the coefficient of the term of degree \\spad{r} in \\spad{f(x)}. This is the same as the function \\spadfun{coefficient}.")) (|terms| (((|Stream| (|Record| (|:| |k| |#3|) (|:| |c| |#2|))) $) "\\spad{terms(f(x))} returns a stream of non-zero terms,{} where a a term is an exponent-coefficient pair. The terms in the stream are ordered by increasing order of exponents."))) NIL -((|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#2| (LIST (QUOTE *) (LIST (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1091))) (|HasSignature| |#2| (LIST (QUOTE **) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (LIST (QUOTE -3212) (LIST (|devaluate| |#2|) (QUOTE (-1155)))))) +((|HasCategory| |#2| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#2| (LIST (QUOTE *) (LIST (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1091))) (|HasSignature| |#2| (LIST (QUOTE **) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (LIST (QUOTE -3110) (LIST (|devaluate| |#2|) (QUOTE (-1155)))))) (-1216 |Coef| |Expon|) ((|constructor| (NIL "\\spadtype{UnivariatePowerSeriesCategory} is the most general univariate power series category with exponents in an ordered abelian monoid. Note: this category exports a substitution function if it is possible to multiply exponents. Note: this category exports a derivative operation if it is possible to multiply coefficients by exponents.")) (|eval| (((|Stream| |#1|) $ |#1|) "\\spad{eval(f,{}a)} evaluates a power series at a value in the ground ring by returning a stream of partial sums.")) (|extend| (($ $ |#2|) "\\spad{extend(f,{}n)} causes all terms of \\spad{f} of degree \\spad{<=} \\spad{n} to be computed.")) (|approximate| ((|#1| $ |#2|) "\\spad{approximate(f)} returns a truncated power series with the series variable viewed as an element of the coefficient domain.")) (|truncate| (($ $ |#2| |#2|) "\\spad{truncate(f,{}k1,{}k2)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{d} with \\spad{k1 <= d <= k2}.") (($ $ |#2|) "\\spad{truncate(f,{}k)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.")) (|order| ((|#2| $ |#2|) "\\spad{order(f,{}n) = min(m,{}n)},{} where \\spad{m} is the degree of the lowest order non-zero term in \\spad{f}.") ((|#2| $) "\\spad{order(f)} is the degree of the lowest order non-zero term in \\spad{f}. This will result in an infinite loop if \\spad{f} has no non-zero terms.")) (|multiplyExponents| (($ $ (|PositiveInteger|)) "\\spad{multiplyExponents(f,{}n)} multiplies all exponents of the power series \\spad{f} by the positive integer \\spad{n}.")) (|center| ((|#1| $) "\\spad{center(f)} returns the point about which the series \\spad{f} is expanded.")) (|variable| (((|Symbol|) $) "\\spad{variable(f)} returns the (unique) power series variable of the power series \\spad{f}.")) (|elt| ((|#1| $ |#2|) "\\spad{elt(f(x),{}r)} returns the coefficient of the term of degree \\spad{r} in \\spad{f(x)}. This is the same as the function \\spadfun{coefficient}.")) (|terms| (((|Stream| (|Record| (|:| |k| |#2|) (|:| |c| |#1|))) $) "\\spad{terms(f(x))} returns a stream of non-zero terms,{} where a a term is an exponent-coefficient pair. The terms in the stream are ordered by increasing order of exponents."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4363 . T) (-4364 . T) (-4366 . T)) @@ -4809,32 +4809,32 @@ NIL (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-1220 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.")) (|coerce| (($ |#3|) "\\spad{coerce(f(x))} converts the Laurent series \\spad{f(x)} to a Puiseux series.")) (|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)}."))) +((|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 (-1221 |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.")) (|coerce| (($ |#2|) "\\spad{coerce(f(x))} converts the Laurent series \\spad{f(x)} to a Puiseux series.")) (|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)}."))) +((|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)}."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4363 . T) (-4364 . T) (-4366 . T)) NIL (-1222 |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)}."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|)))) (|HasCategory| (-401 (-553)) (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-357))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasSignature| |#1| (LIST (QUOTE -3212) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (-4028 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -1619) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3611) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) +((|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|)))) (|HasCategory| (-401 (-553)) (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-357))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasSignature| |#1| (LIST (QUOTE -3110) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (-3988 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3406) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3506) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-1223 |Coef| |var| |cen|) -((|constructor| (NIL "Dense Puiseux series in one variable \\indented{2}{\\spadtype{UnivariatePuiseuxSeries} is a domain representing Puiseux} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{UnivariatePuiseuxSeries(Integer,{}x,{}3)} represents Puiseux series in} \\indented{2}{\\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Puiseux series."))) +((|constructor| (NIL "Dense Puiseux series in one variable \\indented{2}{\\spadtype{UnivariatePuiseuxSeries} is a domain representing Puiseux} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{UnivariatePuiseuxSeries(Integer,{}x,{}3)} represents Puiseux series in} \\indented{2}{\\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4367 |has| |#1| (-357)) (-4361 |has| |#1| (-357)) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|)))) (|HasCategory| (-401 (-553)) (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-357))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-4028 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasSignature| |#1| (LIST (QUOTE -3212) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (-4028 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -1619) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3611) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#1| (QUOTE (-169))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553))) (|devaluate| |#1|)))) (|HasCategory| (-401 (-553)) (QUOTE (-1091))) (|HasCategory| |#1| (QUOTE (-357))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-3988 (|HasCategory| |#1| (QUOTE (-357))) (|HasCategory| |#1| (QUOTE (-545)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasSignature| |#1| (LIST (QUOTE -3110) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -401) (QUOTE (-553)))))) (-3988 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3406) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3506) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|))))))) (-1224 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))}."))) (((-4371 "*") |has| (-1223 |#2| |#3| |#4|) (-169)) (-4362 |has| (-1223 |#2| |#3| |#4|) (-545)) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| (-1223 |#2| |#3| |#4|) (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-1223 |#2| |#3| |#4|) (QUOTE (-142))) (|HasCategory| (-1223 |#2| |#3| |#4|) (QUOTE (-144))) (|HasCategory| (-1223 |#2| |#3| |#4|) (QUOTE (-169))) (|HasCategory| (-1223 |#2| |#3| |#4|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-1223 |#2| |#3| |#4|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-1223 |#2| |#3| |#4|) (QUOTE (-357))) (|HasCategory| (-1223 |#2| |#3| |#4|) (QUOTE (-445))) (-4028 (|HasCategory| (-1223 |#2| |#3| |#4|) (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-1223 |#2| |#3| |#4|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| (-1223 |#2| |#3| |#4|) (QUOTE (-545)))) +((|HasCategory| (-1223 |#2| |#3| |#4|) (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-1223 |#2| |#3| |#4|) (QUOTE (-142))) (|HasCategory| (-1223 |#2| |#3| |#4|) (QUOTE (-144))) (|HasCategory| (-1223 |#2| |#3| |#4|) (QUOTE (-169))) (-3988 (|HasCategory| (-1223 |#2| |#3| |#4|) (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-1223 |#2| |#3| |#4|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553)))))) (|HasCategory| (-1223 |#2| |#3| |#4|) (LIST (QUOTE -1020) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| (-1223 |#2| |#3| |#4|) (LIST (QUOTE -1020) (QUOTE (-553)))) (|HasCategory| (-1223 |#2| |#3| |#4|) (QUOTE (-357))) (|HasCategory| (-1223 |#2| |#3| |#4|) (QUOTE (-445))) (|HasCategory| (-1223 |#2| |#3| |#4|) (QUOTE (-545)))) (-1225 A S) ((|constructor| (NIL "A unary-recursive aggregate is a one where nodes may have either 0 or 1 children. This aggregate models,{} though not precisely,{} a linked list possibly with a single cycle. A node with one children models a non-empty list,{} with the \\spadfun{value} of the list designating the head,{} or \\spadfun{first},{} of the list,{} and the child designating the tail,{} or \\spadfun{rest},{} of the list. A node with no child then designates the empty list. Since these aggregates are recursive aggregates,{} they may be cyclic.")) (|split!| (($ $ (|Integer|)) "\\spad{split!(u,{}n)} splits \\spad{u} into two aggregates: \\axiom{\\spad{v} = rest(\\spad{u},{}\\spad{n})} and \\axiom{\\spad{w} = first(\\spad{u},{}\\spad{n})},{} returning \\axiom{\\spad{v}}. Note: afterwards \\axiom{rest(\\spad{u},{}\\spad{n})} returns \\axiom{empty()}.")) (|setlast!| ((|#2| $ |#2|) "\\spad{setlast!(u,{}x)} destructively changes the last element of \\spad{u} to \\spad{x}.")) (|setrest!| (($ $ $) "\\spad{setrest!(u,{}v)} destructively changes the rest of \\spad{u} to \\spad{v}.")) (|setelt| ((|#2| $ "last" |#2|) "\\spad{setelt(u,{}\"last\",{}x)} (also written: \\axiom{\\spad{u}.last \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setlast!(\\spad{u},{}\\spad{v})}.") (($ $ "rest" $) "\\spad{setelt(u,{}\"rest\",{}v)} (also written: \\axiom{\\spad{u}.rest \\spad{:=} \\spad{v}}) is equivalent to \\axiom{setrest!(\\spad{u},{}\\spad{v})}.") ((|#2| $ "first" |#2|) "\\spad{setelt(u,{}\"first\",{}x)} (also written: \\axiom{\\spad{u}.first \\spad{:=} \\spad{x}}) is equivalent to \\axiom{setfirst!(\\spad{u},{}\\spad{x})}.")) (|setfirst!| ((|#2| $ |#2|) "\\spad{setfirst!(u,{}x)} destructively changes the first element of a to \\spad{x}.")) (|cycleSplit!| (($ $) "\\spad{cycleSplit!(u)} splits the aggregate by dropping off the cycle. The value returned is the cycle entry,{} or nil if none exists. For example,{} if \\axiom{\\spad{w} = concat(\\spad{u},{}\\spad{v})} is the cyclic list where \\spad{v} is the head of the cycle,{} \\axiom{cycleSplit!(\\spad{w})} will drop \\spad{v} off \\spad{w} thus destructively changing \\spad{w} to \\spad{u},{} and returning \\spad{v}.")) (|concat!| (($ $ |#2|) "\\spad{concat!(u,{}x)} destructively adds element \\spad{x} to the end of \\spad{u}. Note: \\axiom{concat!(a,{}\\spad{x}) = setlast!(a,{}[\\spad{x}])}.") (($ $ $) "\\spad{concat!(u,{}v)} destructively concatenates \\spad{v} to the end of \\spad{u}. Note: \\axiom{concat!(\\spad{u},{}\\spad{v}) = setlast_!(\\spad{u},{}\\spad{v})}.")) (|cycleTail| (($ $) "\\spad{cycleTail(u)} returns the last node in the cycle,{} or empty if none exists.")) (|cycleLength| (((|NonNegativeInteger|) $) "\\spad{cycleLength(u)} returns the length of a top-level cycle contained in aggregate \\spad{u},{} or 0 is \\spad{u} has no such cycle.")) (|cycleEntry| (($ $) "\\spad{cycleEntry(u)} returns the head of a top-level cycle contained in aggregate \\spad{u},{} or \\axiom{empty()} if none exists.")) (|third| ((|#2| $) "\\spad{third(u)} returns the third element of \\spad{u}. Note: \\axiom{third(\\spad{u}) = first(rest(rest(\\spad{u})))}.")) (|second| ((|#2| $) "\\spad{second(u)} returns the second element of \\spad{u}. Note: \\axiom{second(\\spad{u}) = first(rest(\\spad{u}))}.")) (|tail| (($ $) "\\spad{tail(u)} returns the last node of \\spad{u}. Note: if \\spad{u} is \\axiom{shallowlyMutable},{} \\axiom{setrest(tail(\\spad{u}),{}\\spad{v}) = concat(\\spad{u},{}\\spad{v})}.")) (|last| (($ $ (|NonNegativeInteger|)) "\\spad{last(u,{}n)} returns a copy of the last \\spad{n} (\\axiom{\\spad{n} \\spad{>=} 0}) nodes of \\spad{u}. Note: \\axiom{last(\\spad{u},{}\\spad{n})} is a list of \\spad{n} elements.") ((|#2| $) "\\spad{last(u)} resturn the last element of \\spad{u}. Note: for lists,{} \\axiom{last(\\spad{u}) = \\spad{u} . (maxIndex \\spad{u}) = \\spad{u} . (\\# \\spad{u} - 1)}.")) (|rest| (($ $ (|NonNegativeInteger|)) "\\spad{rest(u,{}n)} returns the \\axiom{\\spad{n}}th (\\spad{n} \\spad{>=} 0) node of \\spad{u}. Note: \\axiom{rest(\\spad{u},{}0) = \\spad{u}}.") (($ $) "\\spad{rest(u)} returns an aggregate consisting of all but the first element of \\spad{u} (equivalently,{} the next node of \\spad{u}).")) (|elt| ((|#2| $ "last") "\\spad{elt(u,{}\"last\")} (also written: \\axiom{\\spad{u} . last}) is equivalent to last \\spad{u}.") (($ $ "rest") "\\spad{elt(\\%,{}\"rest\")} (also written: \\axiom{\\spad{u}.rest}) is equivalent to \\axiom{rest \\spad{u}}.") ((|#2| $ "first") "\\spad{elt(u,{}\"first\")} (also written: \\axiom{\\spad{u} . first}) is equivalent to first \\spad{u}.")) (|first| (($ $ (|NonNegativeInteger|)) "\\spad{first(u,{}n)} returns a copy of the first \\spad{n} (\\axiom{\\spad{n} \\spad{>=} 0}) elements of \\spad{u}.") ((|#2| $) "\\spad{first(u)} returns the first element of \\spad{u} (equivalently,{} the value at the current node).")) (|concat| (($ |#2| $) "\\spad{concat(x,{}u)} returns aggregate consisting of \\spad{x} followed by the elements of \\spad{u}. Note: if \\axiom{\\spad{v} = concat(\\spad{x},{}\\spad{u})} then \\axiom{\\spad{x} = first \\spad{v}} and \\axiom{\\spad{u} = rest \\spad{v}}.") (($ $ $) "\\spad{concat(u,{}v)} returns an aggregate \\spad{w} consisting of the elements of \\spad{u} followed by the elements of \\spad{v}. Note: \\axiom{\\spad{v} = rest(\\spad{w},{}\\#a)}."))) NIL ((|HasAttribute| |#1| (QUOTE -4370))) (-1226 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{:=} \\spad{b}}) is equivalent to \\axiom{setlast!(\\spad{u},{}\\spad{v})}.") (($ $ "rest" $) "\\spad{setelt(u,{}\"rest\",{}v)} (also written: \\axiom{\\spad{u}.rest \\spad{:=} \\spad{v}}) is equivalent to \\axiom{setrest!(\\spad{u},{}\\spad{v})}.") ((|#1| $ "first" |#1|) "\\spad{setelt(u,{}\"first\",{}x)} (also written: \\axiom{\\spad{u}.first \\spad{:=} \\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} \\spad{>=} 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} \\spad{>=} 0) node of \\spad{u}. Note: \\axiom{rest(\\spad{u},{}0) = \\spad{u}}.") (($ $) "\\spad{rest(u)} returns an aggregate consisting of all but the first element of \\spad{u} (equivalently,{} the next node of \\spad{u}).")) (|elt| ((|#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} \\spad{>=} 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)}."))) -((-4284 . T)) +NIL NIL (-1227 |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)}.}"))) @@ -4843,7 +4843,7 @@ NIL (-1228 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 (-553)))) (|HasCategory| |#2| (QUOTE (-941))) (|HasCategory| |#2| (QUOTE (-1177))) (|HasSignature| |#2| (LIST (QUOTE -3611) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -1619) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1155))))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357)))) +((|HasCategory| |#2| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#2| (QUOTE (-941))) (|HasCategory| |#2| (QUOTE (-1177))) (|HasSignature| |#2| (LIST (QUOTE -3506) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -3406) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1155))))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#2| (QUOTE (-357)))) (-1229 |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."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4363 . T) (-4364 . T) (-4366 . T)) @@ -4851,18 +4851,18 @@ NIL (-1230 |Coef| |var| |cen|) ((|constructor| (NIL "Dense Taylor series in one variable \\spadtype{UnivariateTaylorSeries} is a domain representing Taylor series in one variable with coefficients in an arbitrary ring. The parameters of the type specify the coefficient ring,{} the power series variable,{} and the center of the power series expansion. For example,{} \\spadtype{UnivariateTaylorSeries}(Integer,{}\\spad{x},{}3) represents Taylor series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x),{}x)} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|invmultisect| (($ (|Integer|) (|Integer|) $) "\\spad{invmultisect(a,{}b,{}f(x))} substitutes \\spad{x^((a+b)*n)} \\indented{1}{for \\spad{x^n} and multiples by \\spad{x^b}.}")) (|multisect| (($ (|Integer|) (|Integer|) $) "\\spad{multisect(a,{}b,{}f(x))} selects the coefficients of \\indented{1}{\\spad{x^((a+b)*n+a)},{} and changes this monomial to \\spad{x^n}.}")) (|revert| (($ $) "\\spad{revert(f(x))} returns a Taylor series \\spad{g(x)} such that \\spad{f(g(x)) = g(f(x)) = x}. Series \\spad{f(x)} should have constant coefficient 0 and 1st order coefficient 1.")) (|generalLambert| (($ $ (|Integer|) (|Integer|)) "\\spad{generalLambert(f(x),{}a,{}d)} returns \\spad{f(x^a) + f(x^(a + d)) + \\indented{1}{f(x^(a + 2 d)) + ... }. \\spad{f(x)} should have zero constant} \\indented{1}{coefficient and \\spad{a} and \\spad{d} should be positive.}")) (|evenlambert| (($ $) "\\spad{evenlambert(f(x))} returns \\spad{f(x^2) + f(x^4) + f(x^6) + ...}. \\indented{1}{\\spad{f(x)} should have a zero constant coefficient.} \\indented{1}{This function is used for computing infinite products.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n=1..infinity,{}f(x^(2*n))) = exp(log(evenlambert(f(x))))}.}")) (|oddlambert| (($ $) "\\spad{oddlambert(f(x))} returns \\spad{f(x) + f(x^3) + f(x^5) + ...}. \\indented{1}{\\spad{f(x)} should have a zero constant coefficient.} \\indented{1}{This function is used for computing infinite products.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n=1..infinity,{}f(x^(2*n-1)))=exp(log(oddlambert(f(x))))}.}")) (|lambert| (($ $) "\\spad{lambert(f(x))} returns \\spad{f(x) + f(x^2) + f(x^3) + ...}. \\indented{1}{This function is used for computing infinite products.} \\indented{1}{\\spad{f(x)} should have zero constant coefficient.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n = 1..infinity,{}f(x^n)) = exp(log(lambert(f(x))))}.}")) (|lagrange| (($ $) "\\spad{lagrange(g(x))} produces the Taylor series for \\spad{f(x)} \\indented{1}{where \\spad{f(x)} is implicitly defined as \\spad{f(x) = x*g(f(x))}.}")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} computes the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|univariatePolynomial| (((|UnivariatePolynomial| |#2| |#1|) $ (|NonNegativeInteger|)) "\\spad{univariatePolynomial(f,{}k)} returns a univariate polynomial \\indented{1}{consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.}")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a \\indented{1}{Taylor series.}") (($ (|UnivariatePolynomial| |#2| |#1|)) "\\spad{coerce(p)} converts a univariate polynomial \\spad{p} in the variable \\spad{var} to a univariate Taylor series in \\spad{var}."))) (((-4371 "*") |has| |#1| (-169)) (-4362 |has| |#1| (-545)) (-4363 . T) (-4364 . T) (-4366 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (-4028 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-757)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-757)) (|devaluate| |#1|)))) (|HasCategory| (-757) (QUOTE (-1091))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-757))))) (|HasSignature| |#1| (LIST (QUOTE -3212) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-757))))) (|HasCategory| |#1| (QUOTE (-357))) (-4028 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -1619) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3611) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasCategory| |#1| (QUOTE (-545))) (-3988 (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-545)))) (|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-142))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (LIST (QUOTE -882) (QUOTE (-1155)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-757)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-757)) (|devaluate| |#1|)))) (|HasCategory| (-757) (QUOTE (-1091))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-757))))) (|HasSignature| |#1| (LIST (QUOTE -3110) (LIST (|devaluate| |#1|) (QUOTE (-1155)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-757))))) (|HasCategory| |#1| (QUOTE (-357))) (-3988 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-553)))) (|HasCategory| |#1| (QUOTE (-941))) (|HasCategory| |#1| (QUOTE (-1177))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -401) (QUOTE (-553))))) (|HasSignature| |#1| (LIST (QUOTE -3406) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1155))))) (|HasSignature| |#1| (LIST (QUOTE -3506) (LIST (LIST (QUOTE -630) (QUOTE (-1155))) (|devaluate| |#1|))))))) (-1231 |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 -(-1232 -3219 UP L UTS) +(-1232 -3105 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 (-545)))) (-1233) ((|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."))) -((-4284 . T)) +NIL NIL (-1234 |sym|) ((|constructor| (NIL "This domain implements variables")) (|variable| (((|Symbol|)) "\\spad{variable()} returns the symbol")) (|coerce| (((|Symbol|) $) "\\spad{coerce(x)} returns the symbol"))) @@ -4874,7 +4874,7 @@ NIL ((|HasCategory| |#2| (QUOTE (-984))) (|HasCategory| |#2| (QUOTE (-1031))) (|HasCategory| |#2| (QUOTE (-712))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25)))) (-1236 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})\\spad{*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."))) -((-4370 . T) (-4369 . T) (-4284 . T)) +((-4370 . T) (-4369 . T)) NIL (-1237 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}."))) @@ -4883,7 +4883,7 @@ NIL (-1238 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."))) ((-4370 . T) (-4369 . T)) -((-4028 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-4028 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-4028 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#1| (QUOTE (-1031))) (-12 (|HasCategory| |#1| (QUOTE (-984))) (|HasCategory| |#1| (QUOTE (-1031)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) +((-3988 (-12 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-3988 (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845))))) (|HasCategory| |#1| (LIST (QUOTE -601) (QUOTE (-529)))) (-3988 (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079)))) (|HasCategory| |#1| (QUOTE (-833))) (|HasCategory| (-553) (QUOTE (-833))) (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-712))) (|HasCategory| |#1| (QUOTE (-1031))) (-12 (|HasCategory| |#1| (QUOTE (-984))) (|HasCategory| |#1| (QUOTE (-1031)))) (|HasCategory| |#1| (LIST (QUOTE -600) (QUOTE (-845)))) (-12 (|HasCategory| |#1| (QUOTE (-1079))) (|HasCategory| |#1| (LIST (QUOTE -303) (|devaluate| |#1|))))) (-1239) ((|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,{}\\spad{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{\\spad{gi}} of domain \\spadtype{GraphImage}. The contents of viewport,{} \\spad{v},{} will contain \\spad{\\spad{gi}} when the function \\spadfun{makeViewport2D} is called to create the an updated viewport \\spad{v}.")) (|title| (((|Void|) $ (|String|)) "\\spad{title(v,{}s)} changes the title which is shown in the two-dimensional viewport window,{} \\spad{v} of domain \\spadtype{TwoDimensionalViewport}.")) (|graphs| (((|Vector| (|Union| (|GraphImage|) "undefined")) $) "\\spad{graphs(v)} returns a vector,{} or list,{} which is a union of all the graphs,{} of the domain \\spadtype{GraphImage},{} which are allocated for the two-dimensional viewport,{} \\spad{v},{} of domain \\spadtype{TwoDimensionalViewport}. Those graphs which have no data are labeled \"undefined\",{} otherwise their contents are shown.")) (|graphStates| (((|Vector| (|Record| (|:| |scaleX| (|DoubleFloat|)) (|:| |scaleY| (|DoubleFloat|)) (|:| |deltaX| (|DoubleFloat|)) (|:| |deltaY| (|DoubleFloat|)) (|:| |points| (|Integer|)) (|:| |connect| (|Integer|)) (|:| |spline| (|Integer|)) (|:| |axes| (|Integer|)) (|:| |axesColor| (|Palette|)) (|:| |units| (|Integer|)) (|:| |unitsColor| (|Palette|)) (|:| |showing| (|Integer|)))) $) "\\spad{graphStates(v)} returns and shows a listing of a record containing the current state of the characteristics of each of the ten graph records in the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport}.")) (|graphState| (((|Void|) $ (|PositiveInteger|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Palette|) (|Integer|) (|Palette|) (|Integer|)) "\\spad{graphState(v,{}num,{}sX,{}sY,{}dX,{}dY,{}pts,{}lns,{}box,{}axes,{}axesC,{}un,{}unC,{}cP)} sets the state of the characteristics for the graph indicated by \\spad{num} in the given two-dimensional viewport \\spad{v},{} of domain \\spadtype{TwoDimensionalViewport},{} to the values given as parameters. The scaling of the graph in the \\spad{x} and \\spad{y} component directions is set to be \\spad{sX} and \\spad{sY}; the window translation in the \\spad{x} and \\spad{y} component directions is set to be \\spad{dX} and \\spad{dY}; The graph points,{} lines,{} bounding \\spad{box},{} \\spad{axes},{} or units will be shown in the viewport if their given parameters \\spad{pts},{} \\spad{lns},{} \\spad{box},{} \\spad{axes} or \\spad{un} are set to be \\spad{1},{} but will not be shown if they are set to \\spad{0}. The color of the \\spad{axes} and the color of the units are indicated by the palette colors \\spad{axesC} and \\spad{unC} respectively. To display the control panel when the viewport window is displayed,{} set \\spad{cP} to \\spad{1},{} otherwise set it to \\spad{0}.")) (|options| (($ $ (|List| (|DrawOption|))) "\\spad{options(v,{}lopt)} takes the given two-dimensional viewport,{} \\spad{v},{} of the domain \\spadtype{TwoDimensionalViewport} and returns \\spad{v} with it\\spad{'s} draw options modified to be those which are indicated in the given list,{} \\spad{lopt} of domain \\spadtype{DrawOption}.") (((|List| (|DrawOption|)) $) "\\spad{options(v)} takes the given two-dimensional viewport,{} \\spad{v},{} of the domain \\spadtype{TwoDimensionalViewport} and returns a list containing the draw options from the domain \\spadtype{DrawOption} for \\spad{v}.")) (|makeViewport2D| (($ (|GraphImage|) (|List| (|DrawOption|))) "\\spad{makeViewport2D(\\spad{gi},{}lopt)} creates and displays a viewport window of the domain \\spadtype{TwoDimensionalViewport} whose graph field is assigned to be the given graph,{} \\spad{\\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 @@ -4901,7 +4901,7 @@ NIL NIL NIL (-1243) -((|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.")) (|coerce| (((|OutputForm|) $) "\\spad{coerce(v)} coerces void object to outputForm.")) (|void| (($) "\\spad{void()} produces a void object."))) +((|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 (-1244 A S) @@ -4916,7 +4916,7 @@ NIL ((|constructor| (NIL "This package implements the Weierstrass preparation theorem \\spad{f} or multivariate power series. weierstrass(\\spad{v},{}\\spad{p}) where \\spad{v} is a variable,{} and \\spad{p} is a TaylorSeries(\\spad{R}) in which the terms of lowest degree \\spad{s} must include c*v**s where \\spad{c} is a constant,{}\\spad{s>0},{} is a list of TaylorSeries coefficients A[\\spad{i}] of the equivalent polynomial A = A[0] + A[1]\\spad{*v} + A[2]*v**2 + ... + A[\\spad{s}-1]*v**(\\spad{s}-1) + v**s such that p=A*B ,{} \\spad{B} being a TaylorSeries of minimum degree 0")) (|qqq| (((|Mapping| (|Stream| (|TaylorSeries| |#1|)) (|Stream| (|TaylorSeries| |#1|))) (|NonNegativeInteger|) (|TaylorSeries| |#1|) (|Stream| (|TaylorSeries| |#1|))) "\\spad{qqq(n,{}s,{}st)} is used internally.")) (|weierstrass| (((|List| (|TaylorSeries| |#1|)) (|Symbol|) (|TaylorSeries| |#1|)) "\\spad{weierstrass(v,{}ts)} where \\spad{v} is a variable and \\spad{ts} is \\indented{1}{a TaylorSeries,{} impements the Weierstrass Preparation} \\indented{1}{Theorem. The result is a list of TaylorSeries that} \\indented{1}{are the coefficients of the equivalent series.}")) (|clikeUniv| (((|Mapping| (|SparseUnivariatePolynomial| (|Polynomial| |#1|)) (|Polynomial| |#1|)) (|Symbol|)) "\\spad{clikeUniv(v)} is used internally.")) (|sts2stst| (((|Stream| (|Stream| (|Polynomial| |#1|))) (|Symbol|) (|Stream| (|Polynomial| |#1|))) "\\spad{sts2stst(v,{}s)} is used internally.")) (|cfirst| (((|Mapping| (|Stream| (|Polynomial| |#1|)) (|Stream| (|Polynomial| |#1|))) (|NonNegativeInteger|)) "\\spad{cfirst n} is used internally.")) (|crest| (((|Mapping| (|Stream| (|Polynomial| |#1|)) (|Stream| (|Polynomial| |#1|))) (|NonNegativeInteger|)) "\\spad{crest n} is used internally."))) NIL NIL -(-1247 K R UP -3219) +(-1247 K R UP -3105) ((|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{\\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{\\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{\\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{\\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{\\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{\\spad{wi} = sum(bij * vj,{} j = 1..n)}."))) NIL NIL @@ -4929,7 +4929,7 @@ NIL NIL NIL (-1250 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: \\spad{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)")) (|coerce| (($ |#4|) "\\spad{coerce(p)} coerces \\spad{p} into Weighted form,{} applying weights and ignoring terms") ((|#4| $) "convert back into a \\spad{\"P\"},{} ignoring weights"))) +((|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: \\spad{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)"))) ((-4364 |has| |#1| (-169)) (-4363 |has| |#1| (-169)) (-4366 . T)) ((|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357)))) (-1251 R E V P) @@ -4937,7 +4937,7 @@ NIL ((-4370 . T) (-4369 . T)) ((-12 (|HasCategory| |#4| (QUOTE (-1079))) (|HasCategory| |#4| (LIST (QUOTE -303) (|devaluate| |#4|)))) (|HasCategory| |#4| (LIST (QUOTE -601) (QUOTE (-529)))) (|HasCategory| |#4| (QUOTE (-1079))) (|HasCategory| |#1| (QUOTE (-545))) (|HasCategory| |#3| (QUOTE (-362))) (|HasCategory| |#4| (LIST (QUOTE -600) (QUOTE (-845))))) (-1252 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.\\spad{fr})")) (|coerce| (($ |#1|) "\\spad{coerce(r)} equals \\spad{r*1}."))) +((|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.\\spad{fr})"))) ((-4363 . T) (-4364 . T) (-4366 . T)) NIL (-1253 |vl| R) @@ -4952,11 +4952,11 @@ NIL ((|constructor| (NIL "This category specifies opeations for polynomials and formal series with non-commutative variables.")) (|varList| (((|List| |#1|) $) "\\spad{varList(x)} returns the list of variables which appear in \\spad{x}.")) (|map| (($ (|Mapping| |#2| |#2|) $) "\\spad{map(fn,{}x)} returns \\spad{Sum(fn(r_i) w_i)} if \\spad{x} writes \\spad{Sum(r_i w_i)}.")) (|sh| (($ $ (|NonNegativeInteger|)) "\\spad{sh(x,{}n)} returns the shuffle power of \\spad{x} to the \\spad{n}.") (($ $ $) "\\spad{sh(x,{}y)} returns the shuffle-product of \\spad{x} by \\spad{y}. This multiplication is associative and commutative.")) (|quasiRegular| (($ $) "\\spad{quasiRegular(x)} return \\spad{x} minus its constant term.")) (|quasiRegular?| (((|Boolean|) $) "\\spad{quasiRegular?(x)} return \\spad{true} if \\spad{constant(x)} is zero.")) (|constant| ((|#2| $) "\\spad{constant(x)} returns the constant term of \\spad{x}.")) (|constant?| (((|Boolean|) $) "\\spad{constant?(x)} returns \\spad{true} if \\spad{x} is constant.")) (|coerce| (($ |#1|) "\\spad{coerce(v)} returns \\spad{v}.")) (|mirror| (($ $) "\\spad{mirror(x)} returns \\spad{Sum(r_i mirror(w_i))} if \\spad{x} writes \\spad{Sum(r_i w_i)}.")) (|monomial?| (((|Boolean|) $) "\\spad{monomial?(x)} returns \\spad{true} if \\spad{x} is a monomial")) (|monom| (($ (|OrderedFreeMonoid| |#1|) |#2|) "\\spad{monom(w,{}r)} returns the product of the word \\spad{w} by the coefficient \\spad{r}.")) (|rquo| (($ $ $) "\\spad{rquo(x,{}y)} returns the right simplification of \\spad{x} by \\spad{y}.") (($ $ (|OrderedFreeMonoid| |#1|)) "\\spad{rquo(x,{}w)} returns the right simplification of \\spad{x} by \\spad{w}.") (($ $ |#1|) "\\spad{rquo(x,{}v)} returns the right simplification of \\spad{x} by the variable \\spad{v}.")) (|lquo| (($ $ $) "\\spad{lquo(x,{}y)} returns the left simplification of \\spad{x} by \\spad{y}.") (($ $ (|OrderedFreeMonoid| |#1|)) "\\spad{lquo(x,{}w)} returns the left simplification of \\spad{x} by the word \\spad{w}.") (($ $ |#1|) "\\spad{lquo(x,{}v)} returns the left simplification of \\spad{x} by the variable \\spad{v}.")) (|coef| ((|#2| $ $) "\\spad{coef(x,{}y)} returns scalar product of \\spad{x} by \\spad{y},{} the set of words being regarded as an orthogonal basis.") ((|#2| $ (|OrderedFreeMonoid| |#1|)) "\\spad{coef(x,{}w)} returns the coefficient of the word \\spad{w} in \\spad{x}.")) (|mindegTerm| (((|Record| (|:| |k| (|OrderedFreeMonoid| |#1|)) (|:| |c| |#2|)) $) "\\spad{mindegTerm(x)} returns the term whose word is \\spad{mindeg(x)}.")) (|mindeg| (((|OrderedFreeMonoid| |#1|) $) "\\spad{mindeg(x)} returns the little word which appears in \\spad{x}. Error if \\spad{x=0}.")) (* (($ $ |#2|) "\\spad{x * r} returns the product of \\spad{x} by \\spad{r}. Usefull if \\spad{R} is a non-commutative Ring.") (($ |#1| $) "\\spad{v * x} returns the product of a variable \\spad{x} by \\spad{x}."))) ((-4362 |has| |#2| (-6 -4362)) (-4364 . T) (-4363 . T) (-4366 . T)) NIL -(-1256 S -3219) +(-1256 S -3105) ((|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 (-362))) (|HasCategory| |#2| (QUOTE (-142))) (|HasCategory| |#2| (QUOTE (-144)))) -(-1257 -3219) +(-1257 -3105) ((|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}."))) ((-4361 . T) (-4367 . T) (-4362 . T) ((-4371 "*") . T) (-4363 . T) (-4364 . T) (-4366 . T)) NIL @@ -4973,7 +4973,7 @@ NIL ((-4362 |has| |#1| (-6 -4362)) (-4364 . T) (-4363 . T) (-4366 . T)) ((|HasCategory| |#1| (QUOTE (-169))) (|HasAttribute| |#1| (QUOTE -4362))) (-1261 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.")) (|coerce| (($ |#2|) "\\spad{coerce(e)} returns \\spad{1*e}")) (|#| (((|NonNegativeInteger|) $) "\\spad{\\# p} returns the number of terms in \\spad{p}.")) (* (($ $ |#1|) "\\spad{p*r} returns the product of \\spad{p} by \\spad{r}."))) +((|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}."))) ((-4366 . T) (-4367 |has| |#1| (-6 -4367)) (-4362 |has| |#1| (-6 -4362)) (-4364 . T) (-4363 . T)) ((|HasCategory| |#1| (QUOTE (-169))) (|HasCategory| |#1| (QUOTE (-357))) (|HasAttribute| |#1| (QUOTE -4366)) (|HasAttribute| |#1| (QUOTE -4367)) (|HasAttribute| |#1| (QUOTE -4362))) (-1262 |VarSet| R) @@ -5012,4 +5012,4 @@ NIL NIL NIL NIL -((-3 NIL 2272486 2272491 2272496 2272501) (-2 NIL 2272466 2272471 2272476 2272481) (-1 NIL 2272446 2272451 2272456 2272461) (0 NIL 2272426 2272431 2272436 2272441) (-1266 "ZMOD.spad" 2272235 2272248 2272364 2272421) (-1265 "ZLINDEP.spad" 2271279 2271290 2272225 2272230) (-1264 "ZDSOLVE.spad" 2261128 2261150 2271269 2271274) (-1263 "YSTREAM.spad" 2260621 2260632 2261118 2261123) (-1262 "XRPOLY.spad" 2259841 2259861 2260477 2260546) (-1261 "XPR.spad" 2257570 2257583 2259559 2259658) (-1260 "XPOLY.spad" 2257125 2257136 2257426 2257495) (-1259 "XPOLYC.spad" 2256442 2256458 2257051 2257120) (-1258 "XPBWPOLY.spad" 2254879 2254899 2256222 2256291) (-1257 "XF.spad" 2253340 2253355 2254781 2254874) (-1256 "XF.spad" 2251781 2251798 2253224 2253229) (-1255 "XFALG.spad" 2248805 2248821 2251707 2251776) (-1254 "XEXPPKG.spad" 2248056 2248082 2248795 2248800) (-1253 "XDPOLY.spad" 2247670 2247686 2247912 2247981) (-1252 "XALG.spad" 2247268 2247279 2247626 2247665) (-1251 "WUTSET.spad" 2243107 2243124 2246914 2246941) (-1250 "WP.spad" 2242121 2242165 2242965 2243032) (-1249 "WHILEAST.spad" 2241919 2241928 2242111 2242116) (-1248 "WHEREAST.spad" 2241590 2241599 2241909 2241914) (-1247 "WFFINTBS.spad" 2239153 2239175 2241580 2241585) (-1246 "WEIER.spad" 2237367 2237378 2239143 2239148) (-1245 "VSPACE.spad" 2237040 2237051 2237335 2237362) (-1244 "VSPACE.spad" 2236733 2236746 2237030 2237035) (-1243 "VOID.spad" 2236323 2236332 2236723 2236728) (-1242 "VIEW.spad" 2233945 2233954 2236313 2236318) (-1241 "VIEWDEF.spad" 2229142 2229151 2233935 2233940) (-1240 "VIEW3D.spad" 2212977 2212986 2229132 2229137) (-1239 "VIEW2D.spad" 2200714 2200723 2212967 2212972) (-1238 "VECTOR.spad" 2199389 2199400 2199640 2199667) (-1237 "VECTOR2.spad" 2198016 2198029 2199379 2199384) (-1236 "VECTCAT.spad" 2195904 2195915 2197972 2198011) (-1235 "VECTCAT.spad" 2193612 2193625 2195682 2195687) (-1234 "VARIABLE.spad" 2193392 2193407 2193602 2193607) (-1233 "UTYPE.spad" 2193026 2193035 2193372 2193387) (-1232 "UTSODETL.spad" 2192319 2192343 2192982 2192987) (-1231 "UTSODE.spad" 2190507 2190527 2192309 2192314) (-1230 "UTS.spad" 2185296 2185324 2188974 2189071) (-1229 "UTSCAT.spad" 2182747 2182763 2185194 2185291) (-1228 "UTSCAT.spad" 2179842 2179860 2182291 2182296) (-1227 "UTS2.spad" 2179435 2179470 2179832 2179837) (-1226 "URAGG.spad" 2174057 2174068 2179415 2179430) (-1225 "URAGG.spad" 2168653 2168666 2174013 2174018) (-1224 "UPXSSING.spad" 2166296 2166322 2167734 2167867) (-1223 "UPXS.spad" 2163323 2163351 2164428 2164577) (-1222 "UPXSCONS.spad" 2161080 2161100 2161455 2161604) (-1221 "UPXSCCA.spad" 2159538 2159558 2160926 2161075) (-1220 "UPXSCCA.spad" 2158138 2158160 2159528 2159533) (-1219 "UPXSCAT.spad" 2156719 2156735 2157984 2158133) (-1218 "UPXS2.spad" 2156260 2156313 2156709 2156714) (-1217 "UPSQFREE.spad" 2154672 2154686 2156250 2156255) (-1216 "UPSCAT.spad" 2152265 2152289 2154570 2154667) (-1215 "UPSCAT.spad" 2149564 2149590 2151871 2151876) (-1214 "UPOLYC.spad" 2144542 2144553 2149406 2149559) (-1213 "UPOLYC.spad" 2139412 2139425 2144278 2144283) (-1212 "UPOLYC2.spad" 2138881 2138900 2139402 2139407) (-1211 "UP.spad" 2135923 2135938 2136431 2136584) (-1210 "UPMP.spad" 2134813 2134826 2135913 2135918) (-1209 "UPDIVP.spad" 2134376 2134390 2134803 2134808) (-1208 "UPDECOMP.spad" 2132613 2132627 2134366 2134371) (-1207 "UPCDEN.spad" 2131820 2131836 2132603 2132608) (-1206 "UP2.spad" 2131182 2131203 2131810 2131815) (-1205 "UNISEG.spad" 2130535 2130546 2131101 2131106) (-1204 "UNISEG2.spad" 2130028 2130041 2130491 2130496) (-1203 "UNIFACT.spad" 2129129 2129141 2130018 2130023) (-1202 "ULS.spad" 2119681 2119709 2120774 2121203) (-1201 "ULSCONS.spad" 2113718 2113738 2114090 2114239) (-1200 "ULSCCAT.spad" 2111315 2111335 2113538 2113713) (-1199 "ULSCCAT.spad" 2109046 2109068 2111271 2111276) (-1198 "ULSCAT.spad" 2107262 2107278 2108892 2109041) (-1197 "ULS2.spad" 2106774 2106827 2107252 2107257) (-1196 "UFD.spad" 2105839 2105848 2106700 2106769) (-1195 "UFD.spad" 2104966 2104977 2105829 2105834) (-1194 "UDVO.spad" 2103813 2103822 2104956 2104961) (-1193 "UDPO.spad" 2101240 2101251 2103769 2103774) (-1192 "TYPE.spad" 2101162 2101171 2101220 2101235) (-1191 "TYPEAST.spad" 2101081 2101090 2101152 2101157) (-1190 "TWOFACT.spad" 2099731 2099746 2101071 2101076) (-1189 "TUPLE.spad" 2099117 2099128 2099630 2099635) (-1188 "TUBETOOL.spad" 2095954 2095963 2099107 2099112) (-1187 "TUBE.spad" 2094595 2094612 2095944 2095949) (-1186 "TS.spad" 2093184 2093200 2094160 2094257) (-1185 "TSETCAT.spad" 2080299 2080316 2093140 2093179) (-1184 "TSETCAT.spad" 2067412 2067431 2080255 2080260) (-1183 "TRMANIP.spad" 2061778 2061795 2067118 2067123) (-1182 "TRIMAT.spad" 2060737 2060762 2061768 2061773) (-1181 "TRIGMNIP.spad" 2059254 2059271 2060727 2060732) (-1180 "TRIGCAT.spad" 2058766 2058775 2059244 2059249) (-1179 "TRIGCAT.spad" 2058276 2058287 2058756 2058761) (-1178 "TREE.spad" 2056847 2056858 2057883 2057910) (-1177 "TRANFUN.spad" 2056678 2056687 2056837 2056842) (-1176 "TRANFUN.spad" 2056507 2056518 2056668 2056673) (-1175 "TOPSP.spad" 2056181 2056190 2056497 2056502) (-1174 "TOOLSIGN.spad" 2055844 2055855 2056171 2056176) (-1173 "TEXTFILE.spad" 2054401 2054410 2055834 2055839) (-1172 "TEX.spad" 2051418 2051427 2054391 2054396) (-1171 "TEX1.spad" 2050974 2050985 2051408 2051413) (-1170 "TEMUTL.spad" 2050529 2050538 2050964 2050969) (-1169 "TBCMPPK.spad" 2048622 2048645 2050519 2050524) (-1168 "TBAGG.spad" 2047646 2047669 2048590 2048617) (-1167 "TBAGG.spad" 2046690 2046715 2047636 2047641) (-1166 "TANEXP.spad" 2046066 2046077 2046680 2046685) (-1165 "TABLE.spad" 2044477 2044500 2044747 2044774) (-1164 "TABLEAU.spad" 2043958 2043969 2044467 2044472) (-1163 "TABLBUMP.spad" 2040741 2040752 2043948 2043953) (-1162 "SYSTEM.spad" 2040015 2040024 2040731 2040736) (-1161 "SYSSOLP.spad" 2037488 2037499 2040005 2040010) (-1160 "SYNTAX.spad" 2033758 2033767 2037478 2037483) (-1159 "SYMTAB.spad" 2031814 2031823 2033748 2033753) (-1158 "SYMS.spad" 2027799 2027808 2031804 2031809) (-1157 "SYMPOLY.spad" 2026806 2026817 2026888 2027015) (-1156 "SYMFUNC.spad" 2026281 2026292 2026796 2026801) (-1155 "SYMBOL.spad" 2023617 2023626 2026271 2026276) (-1154 "SWITCH.spad" 2020374 2020383 2023607 2023612) (-1153 "SUTS.spad" 2017273 2017301 2018841 2018938) (-1152 "SUPXS.spad" 2014287 2014315 2015405 2015554) (-1151 "SUP.spad" 2011056 2011067 2011837 2011990) (-1150 "SUPFRACF.spad" 2010161 2010179 2011046 2011051) (-1149 "SUP2.spad" 2009551 2009564 2010151 2010156) (-1148 "SUMRF.spad" 2008517 2008528 2009541 2009546) (-1147 "SUMFS.spad" 2008150 2008167 2008507 2008512) (-1146 "SULS.spad" 1998689 1998717 1999795 2000224) (-1145 "SUCHTAST.spad" 1998458 1998467 1998679 1998684) (-1144 "SUCH.spad" 1998138 1998153 1998448 1998453) (-1143 "SUBSPACE.spad" 1990145 1990160 1998128 1998133) (-1142 "SUBRESP.spad" 1989305 1989319 1990101 1990106) (-1141 "STTF.spad" 1985404 1985420 1989295 1989300) (-1140 "STTFNC.spad" 1981872 1981888 1985394 1985399) (-1139 "STTAYLOR.spad" 1974270 1974281 1981753 1981758) (-1138 "STRTBL.spad" 1972775 1972792 1972924 1972951) (-1137 "STRING.spad" 1972184 1972193 1972198 1972225) (-1136 "STRICAT.spad" 1971960 1971969 1972140 1972179) (-1135 "STREAM.spad" 1968728 1968739 1971485 1971500) (-1134 "STREAM3.spad" 1968273 1968288 1968718 1968723) (-1133 "STREAM2.spad" 1967341 1967354 1968263 1968268) (-1132 "STREAM1.spad" 1967045 1967056 1967331 1967336) (-1131 "STINPROD.spad" 1965951 1965967 1967035 1967040) (-1130 "STEP.spad" 1965152 1965161 1965941 1965946) (-1129 "STBL.spad" 1963678 1963706 1963845 1963860) (-1128 "STAGG.spad" 1962743 1962754 1963658 1963673) (-1127 "STAGG.spad" 1961816 1961829 1962733 1962738) (-1126 "STACK.spad" 1961167 1961178 1961423 1961450) (-1125 "SREGSET.spad" 1958871 1958888 1960813 1960840) (-1124 "SRDCMPK.spad" 1957416 1957436 1958861 1958866) (-1123 "SRAGG.spad" 1952501 1952510 1957372 1957411) (-1122 "SRAGG.spad" 1947618 1947629 1952491 1952496) (-1121 "SQMATRIX.spad" 1945234 1945252 1946150 1946237) (-1120 "SPLTREE.spad" 1939786 1939799 1944670 1944697) (-1119 "SPLNODE.spad" 1936374 1936387 1939776 1939781) (-1118 "SPFCAT.spad" 1935151 1935160 1936364 1936369) (-1117 "SPECOUT.spad" 1933701 1933710 1935141 1935146) (-1116 "SPADXPT.spad" 1925830 1925839 1933681 1933696) (-1115 "spad-parser.spad" 1925295 1925304 1925820 1925825) (-1114 "SPADAST.spad" 1924996 1925005 1925285 1925290) (-1113 "SPACEC.spad" 1909009 1909020 1924986 1924991) (-1112 "SPACE3.spad" 1908785 1908796 1908999 1909004) (-1111 "SORTPAK.spad" 1908330 1908343 1908741 1908746) (-1110 "SOLVETRA.spad" 1906087 1906098 1908320 1908325) (-1109 "SOLVESER.spad" 1904607 1904618 1906077 1906082) (-1108 "SOLVERAD.spad" 1900617 1900628 1904597 1904602) (-1107 "SOLVEFOR.spad" 1899037 1899055 1900607 1900612) (-1106 "SNTSCAT.spad" 1898625 1898642 1898993 1899032) (-1105 "SMTS.spad" 1896885 1896911 1898190 1898287) (-1104 "SMP.spad" 1894324 1894344 1894714 1894841) (-1103 "SMITH.spad" 1893167 1893192 1894314 1894319) (-1102 "SMATCAT.spad" 1891265 1891295 1893099 1893162) (-1101 "SMATCAT.spad" 1889307 1889339 1891143 1891148) (-1100 "SKAGG.spad" 1888256 1888267 1889263 1889302) (-1099 "SINT.spad" 1886564 1886573 1888122 1888251) (-1098 "SIMPAN.spad" 1886292 1886301 1886554 1886559) (-1097 "SIG.spad" 1885620 1885629 1886282 1886287) (-1096 "SIGNRF.spad" 1884728 1884739 1885610 1885615) (-1095 "SIGNEF.spad" 1883997 1884014 1884718 1884723) (-1094 "SIGAST.spad" 1883378 1883387 1883987 1883992) (-1093 "SHP.spad" 1881296 1881311 1883334 1883339) (-1092 "SHDP.spad" 1872281 1872308 1872790 1872921) (-1091 "SGROUP.spad" 1871889 1871898 1872271 1872276) (-1090 "SGROUP.spad" 1871495 1871506 1871879 1871884) (-1089 "SGCF.spad" 1864376 1864385 1871485 1871490) (-1088 "SFRTCAT.spad" 1863292 1863309 1864332 1864371) (-1087 "SFRGCD.spad" 1862355 1862375 1863282 1863287) (-1086 "SFQCMPK.spad" 1856992 1857012 1862345 1862350) (-1085 "SFORT.spad" 1856427 1856441 1856982 1856987) (-1084 "SEXOF.spad" 1856270 1856310 1856417 1856422) (-1083 "SEX.spad" 1856162 1856171 1856260 1856265) (-1082 "SEXCAT.spad" 1853266 1853306 1856152 1856157) (-1081 "SET.spad" 1851566 1851577 1852687 1852726) (-1080 "SETMN.spad" 1850000 1850017 1851556 1851561) (-1079 "SETCAT.spad" 1849485 1849494 1849990 1849995) (-1078 "SETCAT.spad" 1848968 1848979 1849475 1849480) (-1077 "SETAGG.spad" 1845477 1845488 1848936 1848963) (-1076 "SETAGG.spad" 1842006 1842019 1845467 1845472) (-1075 "SEQAST.spad" 1841709 1841718 1841996 1842001) (-1074 "SEGXCAT.spad" 1840821 1840834 1841689 1841704) (-1073 "SEG.spad" 1840634 1840645 1840740 1840745) (-1072 "SEGCAT.spad" 1839453 1839464 1840614 1840629) (-1071 "SEGBIND.spad" 1838525 1838536 1839408 1839413) (-1070 "SEGBIND2.spad" 1838221 1838234 1838515 1838520) (-1069 "SEGAST.spad" 1837935 1837944 1838211 1838216) (-1068 "SEG2.spad" 1837360 1837373 1837891 1837896) (-1067 "SDVAR.spad" 1836636 1836647 1837350 1837355) (-1066 "SDPOL.spad" 1834026 1834037 1834317 1834444) (-1065 "SCPKG.spad" 1832105 1832116 1834016 1834021) (-1064 "SCOPE.spad" 1831250 1831259 1832095 1832100) (-1063 "SCACHE.spad" 1829932 1829943 1831240 1831245) (-1062 "SASTCAT.spad" 1829841 1829850 1829922 1829927) (-1061 "SAOS.spad" 1829713 1829722 1829831 1829836) (-1060 "SAERFFC.spad" 1829426 1829446 1829703 1829708) (-1059 "SAE.spad" 1827601 1827617 1828212 1828347) (-1058 "SAEFACT.spad" 1827302 1827322 1827591 1827596) (-1057 "RURPK.spad" 1824943 1824959 1827292 1827297) (-1056 "RULESET.spad" 1824384 1824408 1824933 1824938) (-1055 "RULE.spad" 1822588 1822612 1824374 1824379) (-1054 "RULECOLD.spad" 1822440 1822453 1822578 1822583) (-1053 "RSTRCAST.spad" 1822157 1822166 1822430 1822435) (-1052 "RSETGCD.spad" 1818535 1818555 1822147 1822152) (-1051 "RSETCAT.spad" 1808307 1808324 1818491 1818530) (-1050 "RSETCAT.spad" 1798111 1798130 1808297 1808302) (-1049 "RSDCMPK.spad" 1796563 1796583 1798101 1798106) (-1048 "RRCC.spad" 1794947 1794977 1796553 1796558) (-1047 "RRCC.spad" 1793329 1793361 1794937 1794942) (-1046 "RPTAST.spad" 1793031 1793040 1793319 1793324) (-1045 "RPOLCAT.spad" 1772391 1772406 1792899 1793026) (-1044 "RPOLCAT.spad" 1751465 1751482 1771975 1771980) (-1043 "ROUTINE.spad" 1747328 1747337 1750112 1750139) (-1042 "ROMAN.spad" 1746560 1746569 1747194 1747323) (-1041 "ROIRC.spad" 1745640 1745672 1746550 1746555) (-1040 "RNS.spad" 1744543 1744552 1745542 1745635) (-1039 "RNS.spad" 1743532 1743543 1744533 1744538) (-1038 "RNG.spad" 1743267 1743276 1743522 1743527) (-1037 "RMODULE.spad" 1742905 1742916 1743257 1743262) (-1036 "RMCAT2.spad" 1742313 1742370 1742895 1742900) (-1035 "RMATRIX.spad" 1740992 1741011 1741480 1741519) (-1034 "RMATCAT.spad" 1736513 1736544 1740936 1740987) (-1033 "RMATCAT.spad" 1731936 1731969 1736361 1736366) (-1032 "RINTERP.spad" 1731824 1731844 1731926 1731931) (-1031 "RING.spad" 1731181 1731190 1731804 1731819) (-1030 "RING.spad" 1730546 1730557 1731171 1731176) (-1029 "RIDIST.spad" 1729930 1729939 1730536 1730541) (-1028 "RGCHAIN.spad" 1728509 1728525 1729415 1729442) (-1027 "RGBCSPC.spad" 1728290 1728302 1728499 1728504) (-1026 "RGBCMDL.spad" 1727820 1727832 1728280 1728285) (-1025 "RF.spad" 1725434 1725445 1727810 1727815) (-1024 "RFFACTOR.spad" 1724896 1724907 1725424 1725429) (-1023 "RFFACT.spad" 1724631 1724643 1724886 1724891) (-1022 "RFDIST.spad" 1723619 1723628 1724621 1724626) (-1021 "RETSOL.spad" 1723036 1723049 1723609 1723614) (-1020 "RETRACT.spad" 1722464 1722475 1723026 1723031) (-1019 "RETRACT.spad" 1721890 1721903 1722454 1722459) (-1018 "RETAST.spad" 1721702 1721711 1721880 1721885) (-1017 "RESULT.spad" 1719762 1719771 1720349 1720376) (-1016 "RESRING.spad" 1719109 1719156 1719700 1719757) (-1015 "RESLATC.spad" 1718433 1718444 1719099 1719104) (-1014 "REPSQ.spad" 1718162 1718173 1718423 1718428) (-1013 "REP.spad" 1715714 1715723 1718152 1718157) (-1012 "REPDB.spad" 1715419 1715430 1715704 1715709) (-1011 "REP2.spad" 1704991 1705002 1715261 1715266) (-1010 "REP1.spad" 1698981 1698992 1704941 1704946) (-1009 "REGSET.spad" 1696778 1696795 1698627 1698654) (-1008 "REF.spad" 1696107 1696118 1696733 1696738) (-1007 "REDORDER.spad" 1695283 1695300 1696097 1696102) (-1006 "RECLOS.spad" 1694066 1694086 1694770 1694863) (-1005 "REALSOLV.spad" 1693198 1693207 1694056 1694061) (-1004 "REAL.spad" 1693070 1693079 1693188 1693193) (-1003 "REAL0Q.spad" 1690352 1690367 1693060 1693065) (-1002 "REAL0.spad" 1687180 1687195 1690342 1690347) (-1001 "RDUCEAST.spad" 1686901 1686910 1687170 1687175) (-1000 "RDIV.spad" 1686552 1686577 1686891 1686896) (-999 "RDIST.spad" 1686116 1686126 1686542 1686547) (-998 "RDETRS.spad" 1684913 1684930 1686106 1686111) (-997 "RDETR.spad" 1683021 1683038 1684903 1684908) (-996 "RDEEFS.spad" 1682095 1682111 1683011 1683016) (-995 "RDEEF.spad" 1681092 1681108 1682085 1682090) (-994 "RCFIELD.spad" 1678279 1678287 1680994 1681087) (-993 "RCFIELD.spad" 1675552 1675562 1678269 1678274) (-992 "RCAGG.spad" 1673455 1673465 1675532 1675547) (-991 "RCAGG.spad" 1671295 1671307 1673374 1673379) (-990 "RATRET.spad" 1670656 1670666 1671285 1671290) (-989 "RATFACT.spad" 1670349 1670360 1670646 1670651) (-988 "RANDSRC.spad" 1669669 1669677 1670339 1670344) (-987 "RADUTIL.spad" 1669424 1669432 1669659 1669664) (-986 "RADIX.spad" 1666214 1666227 1667891 1667984) (-985 "RADFF.spad" 1664628 1664664 1664746 1664902) (-984 "RADCAT.spad" 1664222 1664230 1664618 1664623) (-983 "RADCAT.spad" 1663814 1663824 1664212 1664217) (-982 "QUEUE.spad" 1663157 1663167 1663421 1663448) (-981 "QUAT.spad" 1661739 1661749 1662081 1662146) (-980 "QUATCT2.spad" 1661358 1661376 1661729 1661734) (-979 "QUATCAT.spad" 1659523 1659533 1661288 1661353) (-978 "QUATCAT.spad" 1657439 1657451 1659206 1659211) (-977 "QUAGG.spad" 1656253 1656263 1657395 1657434) (-976 "QQUTAST.spad" 1656022 1656030 1656243 1656248) (-975 "QFORM.spad" 1655485 1655499 1656012 1656017) (-974 "QFCAT.spad" 1654176 1654186 1655375 1655480) (-973 "QFCAT.spad" 1652470 1652482 1653671 1653676) (-972 "QFCAT2.spad" 1652161 1652177 1652460 1652465) (-971 "QEQUAT.spad" 1651718 1651726 1652151 1652156) (-970 "QCMPACK.spad" 1646465 1646484 1651708 1651713) (-969 "QALGSET.spad" 1642540 1642572 1646379 1646384) (-968 "QALGSET2.spad" 1640536 1640554 1642530 1642535) (-967 "PWFFINTB.spad" 1637846 1637867 1640526 1640531) (-966 "PUSHVAR.spad" 1637175 1637194 1637836 1637841) (-965 "PTRANFN.spad" 1633301 1633311 1637165 1637170) (-964 "PTPACK.spad" 1630389 1630399 1633291 1633296) (-963 "PTFUNC2.spad" 1630210 1630224 1630379 1630384) (-962 "PTCAT.spad" 1629292 1629302 1630166 1630205) (-961 "PSQFR.spad" 1628599 1628623 1629282 1629287) (-960 "PSEUDLIN.spad" 1627457 1627467 1628589 1628594) (-959 "PSETPK.spad" 1612890 1612906 1627335 1627340) (-958 "PSETCAT.spad" 1606798 1606821 1612858 1612885) (-957 "PSETCAT.spad" 1600692 1600717 1606754 1606759) (-956 "PSCURVE.spad" 1599675 1599683 1600682 1600687) (-955 "PSCAT.spad" 1598442 1598471 1599573 1599670) (-954 "PSCAT.spad" 1597299 1597330 1598432 1598437) (-953 "PRTITION.spad" 1596142 1596150 1597289 1597294) (-952 "PRTDAST.spad" 1595861 1595869 1596132 1596137) (-951 "PRS.spad" 1585423 1585440 1595817 1595822) (-950 "PRQAGG.spad" 1584842 1584852 1585379 1585418) (-949 "PROPLOG.spad" 1584245 1584253 1584832 1584837) (-948 "PROPFRML.spad" 1582163 1582174 1584235 1584240) (-947 "PROPERTY.spad" 1581657 1581665 1582153 1582158) (-946 "PRODUCT.spad" 1579337 1579349 1579623 1579678) (-945 "PR.spad" 1577723 1577735 1578428 1578555) (-944 "PRINT.spad" 1577475 1577483 1577713 1577718) (-943 "PRIMES.spad" 1575726 1575736 1577465 1577470) (-942 "PRIMELT.spad" 1573707 1573721 1575716 1575721) (-941 "PRIMCAT.spad" 1573330 1573338 1573697 1573702) (-940 "PRIMARR.spad" 1572335 1572345 1572513 1572540) (-939 "PRIMARR2.spad" 1571058 1571070 1572325 1572330) (-938 "PREASSOC.spad" 1570430 1570442 1571048 1571053) (-937 "PPCURVE.spad" 1569567 1569575 1570420 1570425) (-936 "PORTNUM.spad" 1569342 1569350 1569557 1569562) (-935 "POLYROOT.spad" 1568114 1568136 1569298 1569303) (-934 "POLY.spad" 1565411 1565421 1565928 1566055) (-933 "POLYLIFT.spad" 1564672 1564695 1565401 1565406) (-932 "POLYCATQ.spad" 1562774 1562796 1564662 1564667) (-931 "POLYCAT.spad" 1556180 1556201 1562642 1562769) (-930 "POLYCAT.spad" 1548888 1548911 1555352 1555357) (-929 "POLY2UP.spad" 1548336 1548350 1548878 1548883) (-928 "POLY2.spad" 1547931 1547943 1548326 1548331) (-927 "POLUTIL.spad" 1546872 1546901 1547887 1547892) (-926 "POLTOPOL.spad" 1545620 1545635 1546862 1546867) (-925 "POINT.spad" 1544459 1544469 1544546 1544573) (-924 "PNTHEORY.spad" 1541125 1541133 1544449 1544454) (-923 "PMTOOLS.spad" 1539882 1539896 1541115 1541120) (-922 "PMSYM.spad" 1539427 1539437 1539872 1539877) (-921 "PMQFCAT.spad" 1539014 1539028 1539417 1539422) (-920 "PMPRED.spad" 1538483 1538497 1539004 1539009) (-919 "PMPREDFS.spad" 1537927 1537949 1538473 1538478) (-918 "PMPLCAT.spad" 1536997 1537015 1537859 1537864) (-917 "PMLSAGG.spad" 1536578 1536592 1536987 1536992) (-916 "PMKERNEL.spad" 1536145 1536157 1536568 1536573) (-915 "PMINS.spad" 1535721 1535731 1536135 1536140) (-914 "PMFS.spad" 1535294 1535312 1535711 1535716) (-913 "PMDOWN.spad" 1534580 1534594 1535284 1535289) (-912 "PMASS.spad" 1533592 1533600 1534570 1534575) (-911 "PMASSFS.spad" 1532561 1532577 1533582 1533587) (-910 "PLOTTOOL.spad" 1532341 1532349 1532551 1532556) (-909 "PLOT.spad" 1527172 1527180 1532331 1532336) (-908 "PLOT3D.spad" 1523592 1523600 1527162 1527167) (-907 "PLOT1.spad" 1522733 1522743 1523582 1523587) (-906 "PLEQN.spad" 1509949 1509976 1522723 1522728) (-905 "PINTERP.spad" 1509565 1509584 1509939 1509944) (-904 "PINTERPA.spad" 1509347 1509363 1509555 1509560) (-903 "PI.spad" 1508954 1508962 1509321 1509342) (-902 "PID.spad" 1507910 1507918 1508880 1508949) (-901 "PICOERCE.spad" 1507567 1507577 1507900 1507905) (-900 "PGROEB.spad" 1506164 1506178 1507557 1507562) (-899 "PGE.spad" 1497417 1497425 1506154 1506159) (-898 "PGCD.spad" 1496299 1496316 1497407 1497412) (-897 "PFRPAC.spad" 1495442 1495452 1496289 1496294) (-896 "PFR.spad" 1492099 1492109 1495344 1495437) (-895 "PFOTOOLS.spad" 1491357 1491373 1492089 1492094) (-894 "PFOQ.spad" 1490727 1490745 1491347 1491352) (-893 "PFO.spad" 1490146 1490173 1490717 1490722) (-892 "PF.spad" 1489720 1489732 1489951 1490044) (-891 "PFECAT.spad" 1487386 1487394 1489646 1489715) (-890 "PFECAT.spad" 1485080 1485090 1487342 1487347) (-889 "PFBRU.spad" 1482950 1482962 1485070 1485075) (-888 "PFBR.spad" 1480488 1480511 1482940 1482945) (-887 "PERM.spad" 1476169 1476179 1480318 1480333) (-886 "PERMGRP.spad" 1470905 1470915 1476159 1476164) (-885 "PERMCAT.spad" 1469457 1469467 1470885 1470900) (-884 "PERMAN.spad" 1467989 1468003 1469447 1469452) (-883 "PENDTREE.spad" 1467262 1467272 1467618 1467623) (-882 "PDRING.spad" 1465753 1465763 1467242 1467257) (-881 "PDRING.spad" 1464252 1464264 1465743 1465748) (-880 "PDEPROB.spad" 1463209 1463217 1464242 1464247) (-879 "PDEPACK.spad" 1457211 1457219 1463199 1463204) (-878 "PDECOMP.spad" 1456673 1456690 1457201 1457206) (-877 "PDECAT.spad" 1455027 1455035 1456663 1456668) (-876 "PCOMP.spad" 1454878 1454891 1455017 1455022) (-875 "PBWLB.spad" 1453460 1453477 1454868 1454873) (-874 "PATTERN.spad" 1447891 1447901 1453450 1453455) (-873 "PATTERN2.spad" 1447627 1447639 1447881 1447886) (-872 "PATTERN1.spad" 1445929 1445945 1447617 1447622) (-871 "PATRES.spad" 1443476 1443488 1445919 1445924) (-870 "PATRES2.spad" 1443138 1443152 1443466 1443471) (-869 "PATMATCH.spad" 1441295 1441326 1442846 1442851) (-868 "PATMAB.spad" 1440720 1440730 1441285 1441290) (-867 "PATLRES.spad" 1439804 1439818 1440710 1440715) (-866 "PATAB.spad" 1439568 1439578 1439794 1439799) (-865 "PARTPERM.spad" 1436930 1436938 1439558 1439563) (-864 "PARSURF.spad" 1436358 1436386 1436920 1436925) (-863 "PARSU2.spad" 1436153 1436169 1436348 1436353) (-862 "script-parser.spad" 1435673 1435681 1436143 1436148) (-861 "PARSCURV.spad" 1435101 1435129 1435663 1435668) (-860 "PARSC2.spad" 1434890 1434906 1435091 1435096) (-859 "PARPCURV.spad" 1434348 1434376 1434880 1434885) (-858 "PARPC2.spad" 1434137 1434153 1434338 1434343) (-857 "PAN2EXPR.spad" 1433549 1433557 1434127 1434132) (-856 "PALETTE.spad" 1432519 1432527 1433539 1433544) (-855 "PAIR.spad" 1431502 1431515 1432107 1432112) (-854 "PADICRC.spad" 1428832 1428850 1430007 1430100) (-853 "PADICRAT.spad" 1426847 1426859 1427068 1427161) (-852 "PADIC.spad" 1426542 1426554 1426773 1426842) (-851 "PADICCT.spad" 1425083 1425095 1426468 1426537) (-850 "PADEPAC.spad" 1423762 1423781 1425073 1425078) (-849 "PADE.spad" 1422502 1422518 1423752 1423757) (-848 "OWP.spad" 1421486 1421516 1422360 1422427) (-847 "OVAR.spad" 1421267 1421290 1421476 1421481) (-846 "OUT.spad" 1420351 1420359 1421257 1421262) (-845 "OUTFORM.spad" 1409647 1409655 1420341 1420346) (-844 "OUTBFILE.spad" 1409065 1409073 1409637 1409642) (-843 "OUTBCON.spad" 1408343 1408351 1409055 1409060) (-842 "OUTBCON.spad" 1407619 1407629 1408333 1408338) (-841 "OSI.spad" 1407094 1407102 1407609 1407614) (-840 "OSGROUP.spad" 1407012 1407020 1407084 1407089) (-839 "ORTHPOL.spad" 1405473 1405483 1406929 1406934) (-838 "OREUP.spad" 1404831 1404859 1405153 1405192) (-837 "ORESUP.spad" 1404130 1404154 1404511 1404550) (-836 "OREPCTO.spad" 1401949 1401961 1404050 1404055) (-835 "OREPCAT.spad" 1396006 1396016 1401905 1401944) (-834 "OREPCAT.spad" 1389953 1389965 1395854 1395859) (-833 "ORDSET.spad" 1389119 1389127 1389943 1389948) (-832 "ORDSET.spad" 1388283 1388293 1389109 1389114) (-831 "ORDRING.spad" 1387673 1387681 1388263 1388278) (-830 "ORDRING.spad" 1387071 1387081 1387663 1387668) (-829 "ORDMON.spad" 1386926 1386934 1387061 1387066) (-828 "ORDFUNS.spad" 1386052 1386068 1386916 1386921) (-827 "ORDFIN.spad" 1385986 1385994 1386042 1386047) (-826 "ORDCOMP.spad" 1384451 1384461 1385533 1385562) (-825 "ORDCOMP2.spad" 1383736 1383748 1384441 1384446) (-824 "OPTPROB.spad" 1382316 1382324 1383726 1383731) (-823 "OPTPACK.spad" 1374701 1374709 1382306 1382311) (-822 "OPTCAT.spad" 1372376 1372384 1374691 1374696) (-821 "OPQUERY.spad" 1371925 1371933 1372366 1372371) (-820 "OP.spad" 1371667 1371677 1371747 1371814) (-819 "ONECOMP.spad" 1370412 1370422 1371214 1371243) (-818 "ONECOMP2.spad" 1369830 1369842 1370402 1370407) (-817 "OMSERVER.spad" 1368832 1368840 1369820 1369825) (-816 "OMSAGG.spad" 1368608 1368618 1368776 1368827) (-815 "OMPKG.spad" 1367220 1367228 1368598 1368603) (-814 "OM.spad" 1366185 1366193 1367210 1367215) (-813 "OMLO.spad" 1365610 1365622 1366071 1366110) (-812 "OMEXPR.spad" 1365444 1365454 1365600 1365605) (-811 "OMERR.spad" 1364987 1364995 1365434 1365439) (-810 "OMERRK.spad" 1364021 1364029 1364977 1364982) (-809 "OMENC.spad" 1363365 1363373 1364011 1364016) (-808 "OMDEV.spad" 1357654 1357662 1363355 1363360) (-807 "OMCONN.spad" 1357063 1357071 1357644 1357649) (-806 "OINTDOM.spad" 1356826 1356834 1356989 1357058) (-805 "OFMONOID.spad" 1353013 1353023 1356816 1356821) (-804 "ODVAR.spad" 1352274 1352284 1353003 1353008) (-803 "ODR.spad" 1351722 1351748 1352086 1352235) (-802 "ODPOL.spad" 1349068 1349078 1349408 1349535) (-801 "ODP.spad" 1340189 1340209 1340562 1340693) (-800 "ODETOOLS.spad" 1338772 1338791 1340179 1340184) (-799 "ODESYS.spad" 1336422 1336439 1338762 1338767) (-798 "ODERTRIC.spad" 1332363 1332380 1336379 1336384) (-797 "ODERED.spad" 1331750 1331774 1332353 1332358) (-796 "ODERAT.spad" 1329301 1329318 1331740 1331745) (-795 "ODEPRRIC.spad" 1326192 1326214 1329291 1329296) (-794 "ODEPROB.spad" 1325391 1325399 1326182 1326187) (-793 "ODEPRIM.spad" 1322665 1322687 1325381 1325386) (-792 "ODEPAL.spad" 1322041 1322065 1322655 1322660) (-791 "ODEPACK.spad" 1308643 1308651 1322031 1322036) (-790 "ODEINT.spad" 1308074 1308090 1308633 1308638) (-789 "ODEIFTBL.spad" 1305469 1305477 1308064 1308069) (-788 "ODEEF.spad" 1300836 1300852 1305459 1305464) (-787 "ODECONST.spad" 1300355 1300373 1300826 1300831) (-786 "ODECAT.spad" 1298951 1298959 1300345 1300350) (-785 "OCT.spad" 1297089 1297099 1297805 1297844) (-784 "OCTCT2.spad" 1296733 1296754 1297079 1297084) (-783 "OC.spad" 1294507 1294517 1296689 1296728) (-782 "OC.spad" 1292006 1292018 1294190 1294195) (-781 "OCAMON.spad" 1291854 1291862 1291996 1292001) (-780 "OASGP.spad" 1291669 1291677 1291844 1291849) (-779 "OAMONS.spad" 1291189 1291197 1291659 1291664) (-778 "OAMON.spad" 1291050 1291058 1291179 1291184) (-777 "OAGROUP.spad" 1290912 1290920 1291040 1291045) (-776 "NUMTUBE.spad" 1290499 1290515 1290902 1290907) (-775 "NUMQUAD.spad" 1278361 1278369 1290489 1290494) (-774 "NUMODE.spad" 1269497 1269505 1278351 1278356) (-773 "NUMINT.spad" 1267055 1267063 1269487 1269492) (-772 "NUMFMT.spad" 1265895 1265903 1267045 1267050) (-771 "NUMERIC.spad" 1257967 1257977 1265700 1265705) (-770 "NTSCAT.spad" 1256457 1256473 1257923 1257962) (-769 "NTPOLFN.spad" 1256002 1256012 1256374 1256379) (-768 "NSUP.spad" 1249012 1249022 1253552 1253705) (-767 "NSUP2.spad" 1248404 1248416 1249002 1249007) (-766 "NSMP.spad" 1244599 1244618 1244907 1245034) (-765 "NREP.spad" 1242971 1242985 1244589 1244594) (-764 "NPCOEF.spad" 1242217 1242237 1242961 1242966) (-763 "NORMRETR.spad" 1241815 1241854 1242207 1242212) (-762 "NORMPK.spad" 1239717 1239736 1241805 1241810) (-761 "NORMMA.spad" 1239405 1239431 1239707 1239712) (-760 "NONE.spad" 1239146 1239154 1239395 1239400) (-759 "NONE1.spad" 1238822 1238832 1239136 1239141) (-758 "NODE1.spad" 1238291 1238307 1238812 1238817) (-757 "NNI.spad" 1237178 1237186 1238265 1238286) (-756 "NLINSOL.spad" 1235800 1235810 1237168 1237173) (-755 "NIPROB.spad" 1234283 1234291 1235790 1235795) (-754 "NFINTBAS.spad" 1231743 1231760 1234273 1234278) (-753 "NETCLT.spad" 1231717 1231728 1231733 1231738) (-752 "NCODIV.spad" 1229915 1229931 1231707 1231712) (-751 "NCNTFRAC.spad" 1229557 1229571 1229905 1229910) (-750 "NCEP.spad" 1227717 1227731 1229547 1229552) (-749 "NASRING.spad" 1227313 1227321 1227707 1227712) (-748 "NASRING.spad" 1226907 1226917 1227303 1227308) (-747 "NARNG.spad" 1226251 1226259 1226897 1226902) (-746 "NARNG.spad" 1225593 1225603 1226241 1226246) (-745 "NAGSP.spad" 1224666 1224674 1225583 1225588) (-744 "NAGS.spad" 1214191 1214199 1224656 1224661) (-743 "NAGF07.spad" 1212584 1212592 1214181 1214186) (-742 "NAGF04.spad" 1206816 1206824 1212574 1212579) (-741 "NAGF02.spad" 1200625 1200633 1206806 1206811) (-740 "NAGF01.spad" 1196228 1196236 1200615 1200620) (-739 "NAGE04.spad" 1189688 1189696 1196218 1196223) (-738 "NAGE02.spad" 1180030 1180038 1189678 1189683) (-737 "NAGE01.spad" 1175914 1175922 1180020 1180025) (-736 "NAGD03.spad" 1173834 1173842 1175904 1175909) (-735 "NAGD02.spad" 1166365 1166373 1173824 1173829) (-734 "NAGD01.spad" 1160478 1160486 1166355 1166360) (-733 "NAGC06.spad" 1156265 1156273 1160468 1160473) (-732 "NAGC05.spad" 1154734 1154742 1156255 1156260) (-731 "NAGC02.spad" 1153989 1153997 1154724 1154729) (-730 "NAALG.spad" 1153524 1153534 1153957 1153984) (-729 "NAALG.spad" 1153079 1153091 1153514 1153519) (-728 "MULTSQFR.spad" 1150037 1150054 1153069 1153074) (-727 "MULTFACT.spad" 1149420 1149437 1150027 1150032) (-726 "MTSCAT.spad" 1147454 1147475 1149318 1149415) (-725 "MTHING.spad" 1147111 1147121 1147444 1147449) (-724 "MSYSCMD.spad" 1146545 1146553 1147101 1147106) (-723 "MSET.spad" 1144487 1144497 1146251 1146290) (-722 "MSETAGG.spad" 1144320 1144330 1144443 1144482) (-721 "MRING.spad" 1141291 1141303 1144028 1144095) (-720 "MRF2.spad" 1140859 1140873 1141281 1141286) (-719 "MRATFAC.spad" 1140405 1140422 1140849 1140854) (-718 "MPRFF.spad" 1138435 1138454 1140395 1140400) (-717 "MPOLY.spad" 1135870 1135885 1136229 1136356) (-716 "MPCPF.spad" 1135134 1135153 1135860 1135865) (-715 "MPC3.spad" 1134949 1134989 1135124 1135129) (-714 "MPC2.spad" 1134591 1134624 1134939 1134944) (-713 "MONOTOOL.spad" 1132926 1132943 1134581 1134586) (-712 "MONOID.spad" 1132245 1132253 1132916 1132921) (-711 "MONOID.spad" 1131562 1131572 1132235 1132240) (-710 "MONOGEN.spad" 1130308 1130321 1131422 1131557) (-709 "MONOGEN.spad" 1129076 1129091 1130192 1130197) (-708 "MONADWU.spad" 1127090 1127098 1129066 1129071) (-707 "MONADWU.spad" 1125102 1125112 1127080 1127085) (-706 "MONAD.spad" 1124246 1124254 1125092 1125097) (-705 "MONAD.spad" 1123388 1123398 1124236 1124241) (-704 "MOEBIUS.spad" 1122074 1122088 1123368 1123383) (-703 "MODULE.spad" 1121944 1121954 1122042 1122069) (-702 "MODULE.spad" 1121834 1121846 1121934 1121939) (-701 "MODRING.spad" 1121165 1121204 1121814 1121829) (-700 "MODOP.spad" 1119824 1119836 1120987 1121054) (-699 "MODMONOM.spad" 1119356 1119374 1119814 1119819) (-698 "MODMON.spad" 1116058 1116074 1116834 1116987) (-697 "MODFIELD.spad" 1115416 1115455 1115960 1116053) (-696 "MMLFORM.spad" 1114276 1114284 1115406 1115411) (-695 "MMAP.spad" 1114016 1114050 1114266 1114271) (-694 "MLO.spad" 1112443 1112453 1113972 1114011) (-693 "MLIFT.spad" 1111015 1111032 1112433 1112438) (-692 "MKUCFUNC.spad" 1110548 1110566 1111005 1111010) (-691 "MKRECORD.spad" 1110150 1110163 1110538 1110543) (-690 "MKFUNC.spad" 1109531 1109541 1110140 1110145) (-689 "MKFLCFN.spad" 1108487 1108497 1109521 1109526) (-688 "MKCHSET.spad" 1108263 1108273 1108477 1108482) (-687 "MKBCFUNC.spad" 1107748 1107766 1108253 1108258) (-686 "MINT.spad" 1107187 1107195 1107650 1107743) (-685 "MHROWRED.spad" 1105688 1105698 1107177 1107182) (-684 "MFLOAT.spad" 1104204 1104212 1105578 1105683) (-683 "MFINFACT.spad" 1103604 1103626 1104194 1104199) (-682 "MESH.spad" 1101336 1101344 1103594 1103599) (-681 "MDDFACT.spad" 1099529 1099539 1101326 1101331) (-680 "MDAGG.spad" 1098804 1098814 1099497 1099524) (-679 "MCMPLX.spad" 1094790 1094798 1095404 1095593) (-678 "MCDEN.spad" 1093998 1094010 1094780 1094785) (-677 "MCALCFN.spad" 1091100 1091126 1093988 1093993) (-676 "MAYBE.spad" 1090349 1090360 1091090 1091095) (-675 "MATSTOR.spad" 1087625 1087635 1090339 1090344) (-674 "MATRIX.spad" 1086329 1086339 1086813 1086840) (-673 "MATLIN.spad" 1083655 1083679 1086213 1086218) (-672 "MATCAT.spad" 1075228 1075250 1083611 1083650) (-671 "MATCAT.spad" 1066685 1066709 1075070 1075075) (-670 "MATCAT2.spad" 1065953 1066001 1066675 1066680) (-669 "MAPPKG3.spad" 1064852 1064866 1065943 1065948) (-668 "MAPPKG2.spad" 1064186 1064198 1064842 1064847) (-667 "MAPPKG1.spad" 1063004 1063014 1064176 1064181) (-666 "MAPPAST.spad" 1062317 1062325 1062994 1062999) (-665 "MAPHACK3.spad" 1062125 1062139 1062307 1062312) (-664 "MAPHACK2.spad" 1061890 1061902 1062115 1062120) (-663 "MAPHACK1.spad" 1061520 1061530 1061880 1061885) (-662 "MAGMA.spad" 1059310 1059327 1061510 1061515) (-661 "MACROAST.spad" 1058889 1058897 1059300 1059305) (-660 "M3D.spad" 1056585 1056595 1058267 1058272) (-659 "LZSTAGG.spad" 1053803 1053813 1056565 1056580) (-658 "LZSTAGG.spad" 1051029 1051041 1053793 1053798) (-657 "LWORD.spad" 1047734 1047751 1051019 1051024) (-656 "LSTAST.spad" 1047518 1047526 1047724 1047729) (-655 "LSQM.spad" 1045744 1045758 1046142 1046193) (-654 "LSPP.spad" 1045277 1045294 1045734 1045739) (-653 "LSMP.spad" 1044117 1044145 1045267 1045272) (-652 "LSMP1.spad" 1041921 1041935 1044107 1044112) (-651 "LSAGG.spad" 1041578 1041588 1041877 1041916) (-650 "LSAGG.spad" 1041267 1041279 1041568 1041573) (-649 "LPOLY.spad" 1040221 1040240 1041123 1041192) (-648 "LPEFRAC.spad" 1039478 1039488 1040211 1040216) (-647 "LO.spad" 1038879 1038893 1039412 1039439) (-646 "LOGIC.spad" 1038481 1038489 1038869 1038874) (-645 "LOGIC.spad" 1038081 1038091 1038471 1038476) (-644 "LODOOPS.spad" 1036999 1037011 1038071 1038076) (-643 "LODO.spad" 1036383 1036399 1036679 1036718) (-642 "LODOF.spad" 1035427 1035444 1036340 1036345) (-641 "LODOCAT.spad" 1034085 1034095 1035383 1035422) (-640 "LODOCAT.spad" 1032741 1032753 1034041 1034046) (-639 "LODO2.spad" 1032014 1032026 1032421 1032460) (-638 "LODO1.spad" 1031414 1031424 1031694 1031733) (-637 "LODEEF.spad" 1030186 1030204 1031404 1031409) (-636 "LNAGG.spad" 1025978 1025988 1030166 1030181) (-635 "LNAGG.spad" 1021744 1021756 1025934 1025939) (-634 "LMOPS.spad" 1018480 1018497 1021734 1021739) (-633 "LMODULE.spad" 1018122 1018132 1018470 1018475) (-632 "LMDICT.spad" 1017405 1017415 1017673 1017700) (-631 "LITERAL.spad" 1017311 1017322 1017395 1017400) (-630 "LIST.spad" 1015029 1015039 1016458 1016485) (-629 "LIST3.spad" 1014320 1014334 1015019 1015024) (-628 "LIST2.spad" 1012960 1012972 1014310 1014315) (-627 "LIST2MAP.spad" 1009837 1009849 1012950 1012955) (-626 "LINEXP.spad" 1009269 1009279 1009817 1009832) (-625 "LINDEP.spad" 1008046 1008058 1009181 1009186) (-624 "LIMITRF.spad" 1005960 1005970 1008036 1008041) (-623 "LIMITPS.spad" 1004843 1004856 1005950 1005955) (-622 "LIE.spad" 1002857 1002869 1004133 1004278) (-621 "LIECAT.spad" 1002333 1002343 1002783 1002852) (-620 "LIECAT.spad" 1001837 1001849 1002289 1002294) (-619 "LIB.spad" 999885 999893 1000496 1000511) (-618 "LGROBP.spad" 997238 997257 999875 999880) (-617 "LF.spad" 996157 996173 997228 997233) (-616 "LFCAT.spad" 995176 995184 996147 996152) (-615 "LEXTRIPK.spad" 990679 990694 995166 995171) (-614 "LEXP.spad" 988682 988709 990659 990674) (-613 "LETAST.spad" 988381 988389 988672 988677) (-612 "LEADCDET.spad" 986765 986782 988371 988376) (-611 "LAZM3PK.spad" 985469 985491 986755 986760) (-610 "LAUPOL.spad" 984158 984171 985062 985131) (-609 "LAPLACE.spad" 983731 983747 984148 984153) (-608 "LA.spad" 983171 983185 983653 983692) (-607 "LALG.spad" 982947 982957 983151 983166) (-606 "LALG.spad" 982731 982743 982937 982942) (-605 "KVTFROM.spad" 982340 982350 982721 982726) (-604 "KTVLOGIC.spad" 981763 981771 982330 982335) (-603 "KRCFROM.spad" 981379 981389 981753 981758) (-602 "KOVACIC.spad" 980092 980109 981369 981374) (-601 "KONVERT.spad" 979814 979824 980082 980087) (-600 "KOERCE.spad" 979551 979561 979804 979809) (-599 "KERNEL.spad" 978086 978096 979335 979340) (-598 "KERNEL2.spad" 977789 977801 978076 978081) (-597 "KDAGG.spad" 976880 976902 977757 977784) (-596 "KDAGG.spad" 975991 976015 976870 976875) (-595 "KAFILE.spad" 974954 974970 975189 975216) (-594 "JORDAN.spad" 972781 972793 974244 974389) (-593 "JOINAST.spad" 972475 972483 972771 972776) (-592 "JAVACODE.spad" 972241 972249 972465 972470) (-591 "IXAGG.spad" 970354 970378 972221 972236) (-590 "IXAGG.spad" 968332 968358 970201 970206) (-589 "IVECTOR.spad" 967103 967118 967258 967285) (-588 "ITUPLE.spad" 966248 966258 967093 967098) (-587 "ITRIGMNP.spad" 965059 965078 966238 966243) (-586 "ITFUN3.spad" 964553 964567 965049 965054) (-585 "ITFUN2.spad" 964283 964295 964543 964548) (-584 "ITAYLOR.spad" 962075 962090 964119 964244) (-583 "ISUPS.spad" 954486 954501 961049 961146) (-582 "ISUMP.spad" 953983 953999 954476 954481) (-581 "ISTRING.spad" 952986 952999 953152 953179) (-580 "ISAST.spad" 952705 952713 952976 952981) (-579 "IRURPK.spad" 951418 951437 952695 952700) (-578 "IRSN.spad" 949378 949386 951408 951413) (-577 "IRRF2F.spad" 947853 947863 949334 949339) (-576 "IRREDFFX.spad" 947454 947465 947843 947848) (-575 "IROOT.spad" 945785 945795 947444 947449) (-574 "IR.spad" 943574 943588 945640 945667) (-573 "IR2.spad" 942594 942610 943564 943569) (-572 "IR2F.spad" 941794 941810 942584 942589) (-571 "IPRNTPK.spad" 941554 941562 941784 941789) (-570 "IPF.spad" 941119 941131 941359 941452) (-569 "IPADIC.spad" 940880 940906 941045 941114) (-568 "IP4ADDR.spad" 940428 940436 940870 940875) (-567 "IOMODE.spad" 940049 940057 940418 940423) (-566 "IOBFILE.spad" 939410 939418 940039 940044) (-565 "IOBCON.spad" 939275 939283 939400 939405) (-564 "INVLAPLA.spad" 938920 938936 939265 939270) (-563 "INTTR.spad" 932166 932183 938910 938915) (-562 "INTTOOLS.spad" 929877 929893 931740 931745) (-561 "INTSLPE.spad" 929183 929191 929867 929872) (-560 "INTRVL.spad" 928749 928759 929097 929178) (-559 "INTRF.spad" 927113 927127 928739 928744) (-558 "INTRET.spad" 926545 926555 927103 927108) (-557 "INTRAT.spad" 925220 925237 926535 926540) (-556 "INTPM.spad" 923583 923599 924863 924868) (-555 "INTPAF.spad" 921351 921369 923515 923520) (-554 "INTPACK.spad" 911661 911669 921341 921346) (-553 "INT.spad" 911022 911030 911515 911656) (-552 "INTHERTR.spad" 910288 910305 911012 911017) (-551 "INTHERAL.spad" 909954 909978 910278 910283) (-550 "INTHEORY.spad" 906367 906375 909944 909949) (-549 "INTG0.spad" 899830 899848 906299 906304) (-548 "INTFTBL.spad" 893859 893867 899820 899825) (-547 "INTFACT.spad" 892918 892928 893849 893854) (-546 "INTEF.spad" 891233 891249 892908 892913) (-545 "INTDOM.spad" 889848 889856 891159 891228) (-544 "INTDOM.spad" 888525 888535 889838 889843) (-543 "INTCAT.spad" 886778 886788 888439 888520) (-542 "INTBIT.spad" 886281 886289 886768 886773) (-541 "INTALG.spad" 885463 885490 886271 886276) (-540 "INTAF.spad" 884955 884971 885453 885458) (-539 "INTABL.spad" 883473 883504 883636 883663) (-538 "INS.spad" 880940 880948 883375 883468) (-537 "INS.spad" 878493 878503 880930 880935) (-536 "INPSIGN.spad" 877927 877940 878483 878488) (-535 "INPRODPF.spad" 876993 877012 877917 877922) (-534 "INPRODFF.spad" 876051 876075 876983 876988) (-533 "INNMFACT.spad" 875022 875039 876041 876046) (-532 "INMODGCD.spad" 874506 874536 875012 875017) (-531 "INFSP.spad" 872791 872813 874496 874501) (-530 "INFPROD0.spad" 871841 871860 872781 872786) (-529 "INFORM.spad" 869002 869010 871831 871836) (-528 "INFORM1.spad" 868627 868637 868992 868997) (-527 "INFINITY.spad" 868179 868187 868617 868622) (-526 "INETCLTS.spad" 868156 868164 868169 868174) (-525 "INEP.spad" 866688 866710 868146 868151) (-524 "INDE.spad" 866417 866434 866678 866683) (-523 "INCRMAPS.spad" 865838 865848 866407 866412) (-522 "INBFILE.spad" 864910 864918 865828 865833) (-521 "INBFF.spad" 860680 860691 864900 864905) (-520 "INBCON.spad" 859979 859987 860670 860675) (-519 "INBCON.spad" 859276 859286 859969 859974) (-518 "INAST.spad" 858941 858949 859266 859271) (-517 "IMPTAST.spad" 858649 858657 858931 858936) (-516 "IMATRIX.spad" 857594 857620 858106 858133) (-515 "IMATQF.spad" 856688 856732 857550 857555) (-514 "IMATLIN.spad" 855293 855317 856644 856649) (-513 "ILIST.spad" 853949 853964 854476 854503) (-512 "IIARRAY2.spad" 853337 853375 853556 853583) (-511 "IFF.spad" 852747 852763 853018 853111) (-510 "IFAST.spad" 852361 852369 852737 852742) (-509 "IFARRAY.spad" 849848 849863 851544 851571) (-508 "IFAMON.spad" 849710 849727 849804 849809) (-507 "IEVALAB.spad" 849099 849111 849700 849705) (-506 "IEVALAB.spad" 848486 848500 849089 849094) (-505 "IDPO.spad" 848284 848296 848476 848481) (-504 "IDPOAMS.spad" 848040 848052 848274 848279) (-503 "IDPOAM.spad" 847760 847772 848030 848035) (-502 "IDPC.spad" 846694 846706 847750 847755) (-501 "IDPAM.spad" 846439 846451 846684 846689) (-500 "IDPAG.spad" 846186 846198 846429 846434) (-499 "IDENT.spad" 846103 846111 846176 846181) (-498 "IDECOMP.spad" 843340 843358 846093 846098) (-497 "IDEAL.spad" 838263 838302 843275 843280) (-496 "ICDEN.spad" 837414 837430 838253 838258) (-495 "ICARD.spad" 836603 836611 837404 837409) (-494 "IBPTOOLS.spad" 835196 835213 836593 836598) (-493 "IBITS.spad" 834395 834408 834832 834859) (-492 "IBATOOL.spad" 831270 831289 834385 834390) (-491 "IBACHIN.spad" 829757 829772 831260 831265) (-490 "IARRAY2.spad" 828745 828771 829364 829391) (-489 "IARRAY1.spad" 827790 827805 827928 827955) (-488 "IAN.spad" 826003 826011 827606 827699) (-487 "IALGFACT.spad" 825604 825637 825993 825998) (-486 "HYPCAT.spad" 825028 825036 825594 825599) (-485 "HYPCAT.spad" 824450 824460 825018 825023) (-484 "HOSTNAME.spad" 824258 824266 824440 824445) (-483 "HOMOTOP.spad" 824001 824011 824248 824253) (-482 "HOAGG.spad" 821259 821269 823981 823996) (-481 "HOAGG.spad" 818302 818314 821026 821031) (-480 "HEXADEC.spad" 816171 816179 816769 816862) (-479 "HEUGCD.spad" 815186 815197 816161 816166) (-478 "HELLFDIV.spad" 814776 814800 815176 815181) (-477 "HEAP.spad" 814168 814178 814383 814410) (-476 "HEADAST.spad" 813699 813707 814158 814163) (-475 "HDP.spad" 804816 804832 805193 805324) (-474 "HDMP.spad" 801992 802007 802610 802737) (-473 "HB.spad" 800229 800237 801982 801987) (-472 "HASHTBL.spad" 798699 798730 798910 798937) (-471 "HASAST.spad" 798415 798423 798689 798694) (-470 "HACKPI.spad" 797898 797906 798317 798410) (-469 "GTSET.spad" 796837 796853 797544 797571) (-468 "GSTBL.spad" 795356 795391 795530 795545) (-467 "GSERIES.spad" 792523 792550 793488 793637) (-466 "GROUP.spad" 791792 791800 792503 792518) (-465 "GROUP.spad" 791069 791079 791782 791787) (-464 "GROEBSOL.spad" 789557 789578 791059 791064) (-463 "GRMOD.spad" 788128 788140 789547 789552) (-462 "GRMOD.spad" 786697 786711 788118 788123) (-461 "GRIMAGE.spad" 779302 779310 786687 786692) (-460 "GRDEF.spad" 777681 777689 779292 779297) (-459 "GRAY.spad" 776140 776148 777671 777676) (-458 "GRALG.spad" 775187 775199 776130 776135) (-457 "GRALG.spad" 774232 774246 775177 775182) (-456 "GPOLSET.spad" 773686 773709 773914 773941) (-455 "GOSPER.spad" 772951 772969 773676 773681) (-454 "GMODPOL.spad" 772089 772116 772919 772946) (-453 "GHENSEL.spad" 771158 771172 772079 772084) (-452 "GENUPS.spad" 767259 767272 771148 771153) (-451 "GENUFACT.spad" 766836 766846 767249 767254) (-450 "GENPGCD.spad" 766420 766437 766826 766831) (-449 "GENMFACT.spad" 765872 765891 766410 766415) (-448 "GENEEZ.spad" 763811 763824 765862 765867) (-447 "GDMP.spad" 760829 760846 761605 761732) (-446 "GCNAALG.spad" 754724 754751 760623 760690) (-445 "GCDDOM.spad" 753896 753904 754650 754719) (-444 "GCDDOM.spad" 753130 753140 753886 753891) (-443 "GB.spad" 750648 750686 753086 753091) (-442 "GBINTERN.spad" 746668 746706 750638 750643) (-441 "GBF.spad" 742425 742463 746658 746663) (-440 "GBEUCLID.spad" 740299 740337 742415 742420) (-439 "GAUSSFAC.spad" 739596 739604 740289 740294) (-438 "GALUTIL.spad" 737918 737928 739552 739557) (-437 "GALPOLYU.spad" 736364 736377 737908 737913) (-436 "GALFACTU.spad" 734529 734548 736354 736359) (-435 "GALFACT.spad" 724662 724673 734519 734524) (-434 "FVFUN.spad" 721675 721683 724642 724657) (-433 "FVC.spad" 720717 720725 721655 721670) (-432 "FUNCTION.spad" 720566 720578 720707 720712) (-431 "FT.spad" 718778 718786 720556 720561) (-430 "FTEM.spad" 717941 717949 718768 718773) (-429 "FSUPFACT.spad" 716841 716860 717877 717882) (-428 "FST.spad" 714927 714935 716831 716836) (-427 "FSRED.spad" 714405 714421 714917 714922) (-426 "FSPRMELT.spad" 713229 713245 714362 714367) (-425 "FSPECF.spad" 711306 711322 713219 713224) (-424 "FS.spad" 705356 705366 711069 711301) (-423 "FS.spad" 699196 699208 704911 704916) (-422 "FSINT.spad" 698854 698870 699186 699191) (-421 "FSERIES.spad" 698041 698053 698674 698773) (-420 "FSCINT.spad" 697354 697370 698031 698036) (-419 "FSAGG.spad" 696459 696469 697298 697349) (-418 "FSAGG.spad" 695538 695550 696379 696384) (-417 "FSAGG2.spad" 694237 694253 695528 695533) (-416 "FS2UPS.spad" 688626 688660 694227 694232) (-415 "FS2.spad" 688271 688287 688616 688621) (-414 "FS2EXPXP.spad" 687394 687417 688261 688266) (-413 "FRUTIL.spad" 686336 686346 687384 687389) (-412 "FR.spad" 680030 680040 685360 685429) (-411 "FRNAALG.spad" 675117 675127 679972 680025) (-410 "FRNAALG.spad" 670216 670228 675073 675078) (-409 "FRNAAF2.spad" 669670 669688 670206 670211) (-408 "FRMOD.spad" 669064 669094 669601 669606) (-407 "FRIDEAL.spad" 668259 668280 669044 669059) (-406 "FRIDEAL2.spad" 667861 667893 668249 668254) (-405 "FRETRCT.spad" 667372 667382 667851 667856) (-404 "FRETRCT.spad" 666749 666761 667230 667235) (-403 "FRAMALG.spad" 665077 665090 666705 666744) (-402 "FRAMALG.spad" 663437 663452 665067 665072) (-401 "FRAC.spad" 660536 660546 660939 661112) (-400 "FRAC2.spad" 660139 660151 660526 660531) (-399 "FR2.spad" 659473 659485 660129 660134) (-398 "FPS.spad" 656282 656290 659363 659468) (-397 "FPS.spad" 653119 653129 656202 656207) (-396 "FPC.spad" 652161 652169 653021 653114) (-395 "FPC.spad" 651289 651299 652151 652156) (-394 "FPATMAB.spad" 651041 651051 651269 651284) (-393 "FPARFRAC.spad" 649514 649531 651031 651036) (-392 "FORTRAN.spad" 648020 648063 649504 649509) (-391 "FORT.spad" 646949 646957 648010 648015) (-390 "FORTFN.spad" 644109 644117 646929 646944) (-389 "FORTCAT.spad" 643783 643791 644089 644104) (-388 "FORMULA.spad" 641121 641129 643773 643778) (-387 "FORMULA1.spad" 640600 640610 641111 641116) (-386 "FORDER.spad" 640291 640315 640590 640595) (-385 "FOP.spad" 639492 639500 640281 640286) (-384 "FNLA.spad" 638916 638938 639460 639487) (-383 "FNCAT.spad" 637244 637252 638906 638911) (-382 "FNAME.spad" 637136 637144 637234 637239) (-381 "FMTC.spad" 636934 636942 637062 637131) (-380 "FMONOID.spad" 633989 633999 636890 636895) (-379 "FM.spad" 633684 633696 633923 633950) (-378 "FMFUN.spad" 630704 630712 633664 633679) (-377 "FMC.spad" 629746 629754 630684 630699) (-376 "FMCAT.spad" 627400 627418 629714 629741) (-375 "FM1.spad" 626757 626769 627334 627361) (-374 "FLOATRP.spad" 624478 624492 626747 626752) (-373 "FLOAT.spad" 617642 617650 624344 624473) (-372 "FLOATCP.spad" 615059 615073 617632 617637) (-371 "FLINEXP.spad" 614771 614781 615039 615054) (-370 "FLINEXP.spad" 614437 614449 614707 614712) (-369 "FLASORT.spad" 613757 613769 614427 614432) (-368 "FLALG.spad" 611403 611422 613683 613752) (-367 "FLAGG.spad" 608409 608419 611371 611398) (-366 "FLAGG.spad" 605328 605340 608292 608297) (-365 "FLAGG2.spad" 604009 604025 605318 605323) (-364 "FINRALG.spad" 602038 602051 603965 604004) (-363 "FINRALG.spad" 599993 600008 601922 601927) (-362 "FINITE.spad" 599145 599153 599983 599988) (-361 "FINAALG.spad" 588126 588136 599087 599140) (-360 "FINAALG.spad" 577119 577131 588082 588087) (-359 "FILE.spad" 576702 576712 577109 577114) (-358 "FILECAT.spad" 575220 575237 576692 576697) (-357 "FIELD.spad" 574626 574634 575122 575215) (-356 "FIELD.spad" 574118 574128 574616 574621) (-355 "FGROUP.spad" 572727 572737 574098 574113) (-354 "FGLMICPK.spad" 571514 571529 572717 572722) (-353 "FFX.spad" 570889 570904 571230 571323) (-352 "FFSLPE.spad" 570378 570399 570879 570884) (-351 "FFPOLY.spad" 561630 561641 570368 570373) (-350 "FFPOLY2.spad" 560690 560707 561620 561625) (-349 "FFP.spad" 560087 560107 560406 560499) (-348 "FF.spad" 559535 559551 559768 559861) (-347 "FFNBX.spad" 558047 558067 559251 559344) (-346 "FFNBP.spad" 556560 556577 557763 557856) (-345 "FFNB.spad" 555025 555046 556241 556334) (-344 "FFINTBAS.spad" 552439 552458 555015 555020) (-343 "FFIELDC.spad" 550014 550022 552341 552434) (-342 "FFIELDC.spad" 547675 547685 550004 550009) (-341 "FFHOM.spad" 546423 546440 547665 547670) (-340 "FFF.spad" 543858 543869 546413 546418) (-339 "FFCGX.spad" 542705 542725 543574 543667) (-338 "FFCGP.spad" 541594 541614 542421 542514) (-337 "FFCG.spad" 540386 540407 541275 541368) (-336 "FFCAT.spad" 533413 533435 540225 540381) (-335 "FFCAT.spad" 526519 526543 533333 533338) (-334 "FFCAT2.spad" 526264 526304 526509 526514) (-333 "FEXPR.spad" 517973 518019 526020 526059) (-332 "FEVALAB.spad" 517679 517689 517963 517968) (-331 "FEVALAB.spad" 517170 517182 517456 517461) (-330 "FDIV.spad" 516612 516636 517160 517165) (-329 "FDIVCAT.spad" 514654 514678 516602 516607) (-328 "FDIVCAT.spad" 512694 512720 514644 514649) (-327 "FDIV2.spad" 512348 512388 512684 512689) (-326 "FCPAK1.spad" 510901 510909 512338 512343) (-325 "FCOMP.spad" 510280 510290 510891 510896) (-324 "FC.spad" 500105 500113 510270 510275) (-323 "FAXF.spad" 493040 493054 500007 500100) (-322 "FAXF.spad" 486027 486043 492996 493001) (-321 "FARRAY.spad" 484173 484183 485210 485237) (-320 "FAMR.spad" 482293 482305 484071 484168) (-319 "FAMR.spad" 480397 480411 482177 482182) (-318 "FAMONOID.spad" 480047 480057 480351 480356) (-317 "FAMONC.spad" 478269 478281 480037 480042) (-316 "FAGROUP.spad" 477875 477885 478165 478192) (-315 "FACUTIL.spad" 476071 476088 477865 477870) (-314 "FACTFUNC.spad" 475247 475257 476061 476066) (-313 "EXPUPXS.spad" 472080 472103 473379 473528) (-312 "EXPRTUBE.spad" 469308 469316 472070 472075) (-311 "EXPRODE.spad" 466180 466196 469298 469303) (-310 "EXPR.spad" 461455 461465 462169 462576) (-309 "EXPR2UPS.spad" 457547 457560 461445 461450) (-308 "EXPR2.spad" 457250 457262 457537 457542) (-307 "EXPEXPAN.spad" 454188 454213 454822 454915) (-306 "EXIT.spad" 453859 453867 454178 454183) (-305 "EXITAST.spad" 453595 453603 453849 453854) (-304 "EVALCYC.spad" 453053 453067 453585 453590) (-303 "EVALAB.spad" 452617 452627 453043 453048) (-302 "EVALAB.spad" 452179 452191 452607 452612) (-301 "EUCDOM.spad" 449721 449729 452105 452174) (-300 "EUCDOM.spad" 447325 447335 449711 449716) (-299 "ESTOOLS.spad" 439165 439173 447315 447320) (-298 "ESTOOLS2.spad" 438766 438780 439155 439160) (-297 "ESTOOLS1.spad" 438451 438462 438756 438761) (-296 "ES.spad" 430998 431006 438441 438446) (-295 "ES.spad" 423451 423461 430896 430901) (-294 "ESCONT.spad" 420224 420232 423441 423446) (-293 "ESCONT1.spad" 419973 419985 420214 420219) (-292 "ES2.spad" 419468 419484 419963 419968) (-291 "ES1.spad" 419034 419050 419458 419463) (-290 "ERROR.spad" 416355 416363 419024 419029) (-289 "EQTBL.spad" 414827 414849 415036 415063) (-288 "EQ.spad" 409701 409711 412500 412612) (-287 "EQ2.spad" 409417 409429 409691 409696) (-286 "EP.spad" 405731 405741 409407 409412) (-285 "ENV.spad" 404433 404441 405721 405726) (-284 "ENTIRER.spad" 404101 404109 404377 404428) (-283 "EMR.spad" 403302 403343 404027 404096) (-282 "ELTAGG.spad" 401542 401561 403292 403297) (-281 "ELTAGG.spad" 399746 399767 401498 401503) (-280 "ELTAB.spad" 399193 399211 399736 399741) (-279 "ELFUTS.spad" 398572 398591 399183 399188) (-278 "ELEMFUN.spad" 398261 398269 398562 398567) (-277 "ELEMFUN.spad" 397948 397958 398251 398256) (-276 "ELAGG.spad" 395879 395889 397916 397943) (-275 "ELAGG.spad" 393759 393771 395798 395803) (-274 "ELABEXPR.spad" 392690 392698 393749 393754) (-273 "EFUPXS.spad" 389466 389496 392646 392651) (-272 "EFULS.spad" 386302 386325 389422 389427) (-271 "EFSTRUC.spad" 384257 384273 386292 386297) (-270 "EF.spad" 379023 379039 384247 384252) (-269 "EAB.spad" 377299 377307 379013 379018) (-268 "E04UCFA.spad" 376835 376843 377289 377294) (-267 "E04NAFA.spad" 376412 376420 376825 376830) (-266 "E04MBFA.spad" 375992 376000 376402 376407) (-265 "E04JAFA.spad" 375528 375536 375982 375987) (-264 "E04GCFA.spad" 375064 375072 375518 375523) (-263 "E04FDFA.spad" 374600 374608 375054 375059) (-262 "E04DGFA.spad" 374136 374144 374590 374595) (-261 "E04AGNT.spad" 369978 369986 374126 374131) (-260 "DVARCAT.spad" 366663 366673 369968 369973) (-259 "DVARCAT.spad" 363346 363358 366653 366658) (-258 "DSMP.spad" 360777 360791 361082 361209) (-257 "DROPT.spad" 354722 354730 360767 360772) (-256 "DROPT1.spad" 354385 354395 354712 354717) (-255 "DROPT0.spad" 349212 349220 354375 354380) (-254 "DRAWPT.spad" 347367 347375 349202 349207) (-253 "DRAW.spad" 339967 339980 347357 347362) (-252 "DRAWHACK.spad" 339275 339285 339957 339962) (-251 "DRAWCX.spad" 336717 336725 339265 339270) (-250 "DRAWCURV.spad" 336254 336269 336707 336712) (-249 "DRAWCFUN.spad" 325426 325434 336244 336249) (-248 "DQAGG.spad" 323582 323592 325382 325421) (-247 "DPOLCAT.spad" 318923 318939 323450 323577) (-246 "DPOLCAT.spad" 314350 314368 318879 318884) (-245 "DPMO.spad" 307653 307669 307791 308092) (-244 "DPMM.spad" 300969 300987 301094 301395) (-243 "DOMAIN.spad" 300240 300248 300959 300964) (-242 "DMP.spad" 297462 297477 298034 298161) (-241 "DLP.spad" 296810 296820 297452 297457) (-240 "DLIST.spad" 295222 295232 295993 296020) (-239 "DLAGG.spad" 293623 293633 295202 295217) (-238 "DIVRING.spad" 293165 293173 293567 293618) (-237 "DIVRING.spad" 292751 292761 293155 293160) (-236 "DISPLAY.spad" 290931 290939 292741 292746) (-235 "DIRPROD.spad" 281785 281801 282425 282556) (-234 "DIRPROD2.spad" 280593 280611 281775 281780) (-233 "DIRPCAT.spad" 279523 279539 280445 280588) (-232 "DIRPCAT.spad" 278194 278212 279118 279123) (-231 "DIOSP.spad" 277019 277027 278184 278189) (-230 "DIOPS.spad" 275991 276001 276987 277014) (-229 "DIOPS.spad" 274949 274961 275947 275952) (-228 "DIFRING.spad" 274241 274249 274929 274944) (-227 "DIFRING.spad" 273541 273551 274231 274236) (-226 "DIFEXT.spad" 272700 272710 273521 273536) (-225 "DIFEXT.spad" 271776 271788 272599 272604) (-224 "DIAGG.spad" 271394 271404 271744 271771) (-223 "DIAGG.spad" 271032 271044 271384 271389) (-222 "DHMATRIX.spad" 269336 269346 270489 270516) (-221 "DFSFUN.spad" 262744 262752 269326 269331) (-220 "DFLOAT.spad" 259465 259473 262634 262739) (-219 "DFINTTLS.spad" 257674 257690 259455 259460) (-218 "DERHAM.spad" 255584 255616 257654 257669) (-217 "DEQUEUE.spad" 254902 254912 255191 255218) (-216 "DEGRED.spad" 254517 254531 254892 254897) (-215 "DEFINTRF.spad" 252042 252052 254507 254512) (-214 "DEFINTEF.spad" 250538 250554 252032 252037) (-213 "DEFAST.spad" 249906 249914 250528 250533) (-212 "DECIMAL.spad" 247787 247795 248373 248466) (-211 "DDFACT.spad" 245586 245603 247777 247782) (-210 "DBLRESP.spad" 245184 245208 245576 245581) (-209 "DBASE.spad" 243756 243766 245174 245179) (-208 "DATAARY.spad" 243218 243231 243746 243751) (-207 "D03FAFA.spad" 243046 243054 243208 243213) (-206 "D03EEFA.spad" 242866 242874 243036 243041) (-205 "D03AGNT.spad" 241946 241954 242856 242861) (-204 "D02EJFA.spad" 241408 241416 241936 241941) (-203 "D02CJFA.spad" 240886 240894 241398 241403) (-202 "D02BHFA.spad" 240376 240384 240876 240881) (-201 "D02BBFA.spad" 239866 239874 240366 240371) (-200 "D02AGNT.spad" 234670 234678 239856 239861) (-199 "D01WGTS.spad" 232989 232997 234660 234665) (-198 "D01TRNS.spad" 232966 232974 232979 232984) (-197 "D01GBFA.spad" 232488 232496 232956 232961) (-196 "D01FCFA.spad" 232010 232018 232478 232483) (-195 "D01ASFA.spad" 231478 231486 232000 232005) (-194 "D01AQFA.spad" 230924 230932 231468 231473) (-193 "D01APFA.spad" 230348 230356 230914 230919) (-192 "D01ANFA.spad" 229842 229850 230338 230343) (-191 "D01AMFA.spad" 229352 229360 229832 229837) (-190 "D01ALFA.spad" 228892 228900 229342 229347) (-189 "D01AKFA.spad" 228418 228426 228882 228887) (-188 "D01AJFA.spad" 227941 227949 228408 228413) (-187 "D01AGNT.spad" 224000 224008 227931 227936) (-186 "CYCLOTOM.spad" 223506 223514 223990 223995) (-185 "CYCLES.spad" 220338 220346 223496 223501) (-184 "CVMP.spad" 219755 219765 220328 220333) (-183 "CTRIGMNP.spad" 218245 218261 219745 219750) (-182 "CTOR.spad" 217688 217696 218235 218240) (-181 "CTORKIND.spad" 217303 217311 217678 217683) (-180 "CTORCALL.spad" 216891 216899 217293 217298) (-179 "CSTTOOLS.spad" 216134 216147 216881 216886) (-178 "CRFP.spad" 209838 209851 216124 216129) (-177 "CRCEAST.spad" 209558 209566 209828 209833) (-176 "CRAPACK.spad" 208601 208611 209548 209553) (-175 "CPMATCH.spad" 208101 208116 208526 208531) (-174 "CPIMA.spad" 207806 207825 208091 208096) (-173 "COORDSYS.spad" 202699 202709 207796 207801) (-172 "CONTOUR.spad" 202101 202109 202689 202694) (-171 "CONTFRAC.spad" 197713 197723 202003 202096) (-170 "CONDUIT.spad" 197471 197479 197703 197708) (-169 "COMRING.spad" 197145 197153 197409 197466) (-168 "COMPPROP.spad" 196659 196667 197135 197140) (-167 "COMPLPAT.spad" 196426 196441 196649 196654) (-166 "COMPLEX.spad" 190462 190472 190706 190955) (-165 "COMPLEX2.spad" 190175 190187 190452 190457) (-164 "COMPFACT.spad" 189777 189791 190165 190170) (-163 "COMPCAT.spad" 187903 187913 189511 189772) (-162 "COMPCAT.spad" 185722 185734 187332 187337) (-161 "COMMUPC.spad" 185468 185486 185712 185717) (-160 "COMMONOP.spad" 185001 185009 185458 185463) (-159 "COMM.spad" 184810 184818 184991 184996) (-158 "COMMAAST.spad" 184573 184581 184800 184805) (-157 "COMBOPC.spad" 183478 183486 184563 184568) (-156 "COMBINAT.spad" 182223 182233 183468 183473) (-155 "COMBF.spad" 179591 179607 182213 182218) (-154 "COLOR.spad" 178428 178436 179581 179586) (-153 "COLONAST.spad" 178094 178102 178418 178423) (-152 "CMPLXRT.spad" 177803 177820 178084 178089) (-151 "CLLCTAST.spad" 177465 177473 177793 177798) (-150 "CLIP.spad" 173557 173565 177455 177460) (-149 "CLIF.spad" 172196 172212 173513 173552) (-148 "CLAGG.spad" 168671 168681 172176 172191) (-147 "CLAGG.spad" 165027 165039 168534 168539) (-146 "CINTSLPE.spad" 164352 164365 165017 165022) (-145 "CHVAR.spad" 162430 162452 164342 164347) (-144 "CHARZ.spad" 162345 162353 162410 162425) (-143 "CHARPOL.spad" 161853 161863 162335 162340) (-142 "CHARNZ.spad" 161606 161614 161833 161848) (-141 "CHAR.spad" 159474 159482 161596 161601) (-140 "CFCAT.spad" 158790 158798 159464 159469) (-139 "CDEN.spad" 157948 157962 158780 158785) (-138 "CCLASS.spad" 156097 156105 157359 157398) (-137 "CATEGORY.spad" 155876 155884 156087 156092) (-136 "CATAST.spad" 155503 155511 155866 155871) (-135 "CASEAST.spad" 155217 155225 155493 155498) (-134 "CARTEN.spad" 150320 150344 155207 155212) (-133 "CARTEN2.spad" 149706 149733 150310 150315) (-132 "CARD.spad" 146995 147003 149680 149701) (-131 "CAPSLAST.spad" 146769 146777 146985 146990) (-130 "CACHSET.spad" 146391 146399 146759 146764) (-129 "CABMON.spad" 145944 145952 146381 146386) (-128 "BYTE.spad" 145118 145126 145934 145939) (-127 "BYTEBUF.spad" 142940 142948 144287 144314) (-126 "BTREE.spad" 142009 142019 142547 142574) (-125 "BTOURN.spad" 141012 141022 141616 141643) (-124 "BTCAT.spad" 140388 140398 140968 141007) (-123 "BTCAT.spad" 139796 139808 140378 140383) (-122 "BTAGG.spad" 138906 138914 139752 139791) (-121 "BTAGG.spad" 138048 138058 138896 138901) (-120 "BSTREE.spad" 136783 136793 137655 137682) (-119 "BRILL.spad" 134978 134989 136773 136778) (-118 "BRAGG.spad" 133892 133902 134958 134973) (-117 "BRAGG.spad" 132780 132792 133848 133853) (-116 "BPADICRT.spad" 130761 130773 131016 131109) (-115 "BPADIC.spad" 130425 130437 130687 130756) (-114 "BOUNDZRO.spad" 130081 130098 130415 130420) (-113 "BOP.spad" 125545 125553 130071 130076) (-112 "BOP1.spad" 122931 122941 125501 125506) (-111 "BOOLEAN.spad" 122255 122263 122921 122926) (-110 "BMODULE.spad" 121967 121979 122223 122250) (-109 "BITS.spad" 121386 121394 121603 121630) (-108 "BINDING.spad" 120805 120813 121376 121381) (-107 "BINARY.spad" 118695 118703 119272 119365) (-106 "BGAGG.spad" 117880 117890 118663 118690) (-105 "BGAGG.spad" 117085 117097 117870 117875) (-104 "BFUNCT.spad" 116649 116657 117065 117080) (-103 "BEZOUT.spad" 115783 115810 116599 116604) (-102 "BBTREE.spad" 112602 112612 115390 115417) (-101 "BASTYPE.spad" 112274 112282 112592 112597) (-100 "BASTYPE.spad" 111944 111954 112264 112269) (-99 "BALFACT.spad" 111384 111396 111934 111939) (-98 "AUTOMOR.spad" 110831 110840 111364 111379) (-97 "ATTREG.spad" 107550 107557 110583 110826) (-96 "ATTRBUT.spad" 103573 103580 107530 107545) (-95 "ATTRAST.spad" 103290 103297 103563 103568) (-94 "ATRIG.spad" 102760 102767 103280 103285) (-93 "ATRIG.spad" 102228 102237 102750 102755) (-92 "ASTCAT.spad" 102030 102037 102218 102223) (-91 "ASTCAT.spad" 101830 101839 102020 102025) (-90 "ASTACK.spad" 101163 101172 101437 101464) (-89 "ASSOCEQ.spad" 99963 99974 101119 101124) (-88 "ASP9.spad" 99044 99057 99953 99958) (-87 "ASP8.spad" 98087 98100 99034 99039) (-86 "ASP80.spad" 97409 97422 98077 98082) (-85 "ASP7.spad" 96569 96582 97399 97404) (-84 "ASP78.spad" 96020 96033 96559 96564) (-83 "ASP77.spad" 95389 95402 96010 96015) (-82 "ASP74.spad" 94481 94494 95379 95384) (-81 "ASP73.spad" 93752 93765 94471 94476) (-80 "ASP6.spad" 92384 92397 93742 93747) (-79 "ASP55.spad" 90893 90906 92374 92379) (-78 "ASP50.spad" 88710 88723 90883 90888) (-77 "ASP4.spad" 88005 88018 88700 88705) (-76 "ASP49.spad" 87004 87017 87995 88000) (-75 "ASP42.spad" 85411 85450 86994 86999) (-74 "ASP41.spad" 83990 84029 85401 85406) (-73 "ASP35.spad" 82978 82991 83980 83985) (-72 "ASP34.spad" 82279 82292 82968 82973) (-71 "ASP33.spad" 81839 81852 82269 82274) (-70 "ASP31.spad" 80979 80992 81829 81834) (-69 "ASP30.spad" 79871 79884 80969 80974) (-68 "ASP29.spad" 79337 79350 79861 79866) (-67 "ASP28.spad" 70610 70623 79327 79332) (-66 "ASP27.spad" 69507 69520 70600 70605) (-65 "ASP24.spad" 68594 68607 69497 69502) (-64 "ASP20.spad" 67810 67823 68584 68589) (-63 "ASP1.spad" 67191 67204 67800 67805) (-62 "ASP19.spad" 61877 61890 67181 67186) (-61 "ASP12.spad" 61291 61304 61867 61872) (-60 "ASP10.spad" 60562 60575 61281 61286) (-59 "ARRAY2.spad" 59922 59931 60169 60196) (-58 "ARRAY1.spad" 58757 58766 59105 59132) (-57 "ARRAY12.spad" 57426 57437 58747 58752) (-56 "ARR2CAT.spad" 53076 53097 57382 57421) (-55 "ARR2CAT.spad" 48758 48781 53066 53071) (-54 "APPRULE.spad" 48002 48024 48748 48753) (-53 "APPLYORE.spad" 47617 47630 47992 47997) (-52 "ANY.spad" 45959 45966 47607 47612) (-51 "ANY1.spad" 45030 45039 45949 45954) (-50 "ANTISYM.spad" 43469 43485 45010 45025) (-49 "ANON.spad" 43166 43173 43459 43464) (-48 "AN.spad" 41467 41474 42982 43075) (-47 "AMR.spad" 39646 39657 41365 41462) (-46 "AMR.spad" 37662 37675 39383 39388) (-45 "ALIST.spad" 35074 35095 35424 35451) (-44 "ALGSC.spad" 34197 34223 34946 34999) (-43 "ALGPKG.spad" 29906 29917 34153 34158) (-42 "ALGMFACT.spad" 29095 29109 29896 29901) (-41 "ALGMANIP.spad" 26515 26530 28892 28897) (-40 "ALGFF.spad" 24830 24857 25047 25203) (-39 "ALGFACT.spad" 23951 23961 24820 24825) (-38 "ALGEBRA.spad" 23682 23691 23907 23946) (-37 "ALGEBRA.spad" 23445 23456 23672 23677) (-36 "ALAGG.spad" 22943 22964 23401 23440) (-35 "AHYP.spad" 22324 22331 22933 22938) (-34 "AGG.spad" 20623 20630 22304 22319) (-33 "AGG.spad" 18896 18905 20579 20584) (-32 "AF.spad" 17321 17336 18831 18836) (-31 "ADDAST.spad" 16999 17006 17311 17316) (-30 "ACPLOT.spad" 15570 15577 16989 16994) (-29 "ACFS.spad" 13309 13318 15460 15565) (-28 "ACFS.spad" 11146 11157 13299 13304) (-27 "ACF.spad" 7748 7755 11048 11141) (-26 "ACF.spad" 4436 4445 7738 7743) (-25 "ABELSG.spad" 3977 3984 4426 4431) (-24 "ABELSG.spad" 3516 3525 3967 3972) (-23 "ABELMON.spad" 3059 3066 3506 3511) (-22 "ABELMON.spad" 2600 2609 3049 3054) (-21 "ABELGRP.spad" 2172 2179 2590 2595) (-20 "ABELGRP.spad" 1742 1751 2162 2167) (-19 "A1AGG.spad" 870 879 1698 1737) (-18 "A1AGG.spad" 30 41 860 865))
\ No newline at end of file +((-3 NIL 2273376 2273381 2273386 2273391) (-2 NIL 2273356 2273361 2273366 2273371) (-1 NIL 2273336 2273341 2273346 2273351) (0 NIL 2273316 2273321 2273326 2273331) (-1266 "ZMOD.spad" 2273125 2273138 2273254 2273311) (-1265 "ZLINDEP.spad" 2272169 2272180 2273115 2273120) (-1264 "ZDSOLVE.spad" 2262018 2262040 2272159 2272164) (-1263 "YSTREAM.spad" 2261511 2261522 2262008 2262013) (-1262 "XRPOLY.spad" 2260731 2260751 2261367 2261436) (-1261 "XPR.spad" 2258522 2258535 2260449 2260548) (-1260 "XPOLY.spad" 2258077 2258088 2258378 2258447) (-1259 "XPOLYC.spad" 2257394 2257410 2258003 2258072) (-1258 "XPBWPOLY.spad" 2255831 2255851 2257174 2257243) (-1257 "XF.spad" 2254292 2254307 2255733 2255826) (-1256 "XF.spad" 2252733 2252750 2254176 2254181) (-1255 "XFALG.spad" 2249757 2249773 2252659 2252728) (-1254 "XEXPPKG.spad" 2249008 2249034 2249747 2249752) (-1253 "XDPOLY.spad" 2248622 2248638 2248864 2248933) (-1252 "XALG.spad" 2248282 2248293 2248578 2248617) (-1251 "WUTSET.spad" 2244121 2244138 2247928 2247955) (-1250 "WP.spad" 2243320 2243364 2243979 2244046) (-1249 "WHILEAST.spad" 2243118 2243127 2243310 2243315) (-1248 "WHEREAST.spad" 2242789 2242798 2243108 2243113) (-1247 "WFFINTBS.spad" 2240352 2240374 2242779 2242784) (-1246 "WEIER.spad" 2238566 2238577 2240342 2240347) (-1245 "VSPACE.spad" 2238239 2238250 2238534 2238561) (-1244 "VSPACE.spad" 2237932 2237945 2238229 2238234) (-1243 "VOID.spad" 2237609 2237618 2237922 2237927) (-1242 "VIEW.spad" 2235231 2235240 2237599 2237604) (-1241 "VIEWDEF.spad" 2230428 2230437 2235221 2235226) (-1240 "VIEW3D.spad" 2214263 2214272 2230418 2230423) (-1239 "VIEW2D.spad" 2202000 2202009 2214253 2214258) (-1238 "VECTOR.spad" 2200675 2200686 2200926 2200953) (-1237 "VECTOR2.spad" 2199302 2199315 2200665 2200670) (-1236 "VECTCAT.spad" 2197202 2197213 2199270 2199297) (-1235 "VECTCAT.spad" 2194910 2194923 2196980 2196985) (-1234 "VARIABLE.spad" 2194690 2194705 2194900 2194905) (-1233 "UTYPE.spad" 2194334 2194343 2194680 2194685) (-1232 "UTSODETL.spad" 2193627 2193651 2194290 2194295) (-1231 "UTSODE.spad" 2191815 2191835 2193617 2193622) (-1230 "UTS.spad" 2186604 2186632 2190282 2190379) (-1229 "UTSCAT.spad" 2184055 2184071 2186502 2186599) (-1228 "UTSCAT.spad" 2181150 2181168 2183599 2183604) (-1227 "UTS2.spad" 2180743 2180778 2181140 2181145) (-1226 "URAGG.spad" 2175375 2175386 2180733 2180738) (-1225 "URAGG.spad" 2169971 2169984 2175331 2175336) (-1224 "UPXSSING.spad" 2167614 2167640 2169052 2169185) (-1223 "UPXS.spad" 2164762 2164790 2165746 2165895) (-1222 "UPXSCONS.spad" 2162519 2162539 2162894 2163043) (-1221 "UPXSCCA.spad" 2161084 2161104 2162365 2162514) (-1220 "UPXSCCA.spad" 2159791 2159813 2161074 2161079) (-1219 "UPXSCAT.spad" 2158372 2158388 2159637 2159786) (-1218 "UPXS2.spad" 2157913 2157966 2158362 2158367) (-1217 "UPSQFREE.spad" 2156325 2156339 2157903 2157908) (-1216 "UPSCAT.spad" 2153918 2153942 2156223 2156320) (-1215 "UPSCAT.spad" 2151217 2151243 2153524 2153529) (-1214 "UPOLYC.spad" 2146195 2146206 2151059 2151212) (-1213 "UPOLYC.spad" 2141065 2141078 2145931 2145936) (-1212 "UPOLYC2.spad" 2140534 2140553 2141055 2141060) (-1211 "UP.spad" 2137691 2137706 2138084 2138237) (-1210 "UPMP.spad" 2136581 2136594 2137681 2137686) (-1209 "UPDIVP.spad" 2136144 2136158 2136571 2136576) (-1208 "UPDECOMP.spad" 2134381 2134395 2136134 2136139) (-1207 "UPCDEN.spad" 2133588 2133604 2134371 2134376) (-1206 "UP2.spad" 2132950 2132971 2133578 2133583) (-1205 "UNISEG.spad" 2132303 2132314 2132869 2132874) (-1204 "UNISEG2.spad" 2131796 2131809 2132259 2132264) (-1203 "UNIFACT.spad" 2130897 2130909 2131786 2131791) (-1202 "ULS.spad" 2121449 2121477 2122542 2122971) (-1201 "ULSCONS.spad" 2113843 2113863 2114215 2114364) (-1200 "ULSCCAT.spad" 2111572 2111592 2113689 2113838) (-1199 "ULSCCAT.spad" 2109409 2109431 2111528 2111533) (-1198 "ULSCAT.spad" 2107625 2107641 2109255 2109404) (-1197 "ULS2.spad" 2107137 2107190 2107615 2107620) (-1196 "UFD.spad" 2106202 2106211 2107063 2107132) (-1195 "UFD.spad" 2105329 2105340 2106192 2106197) (-1194 "UDVO.spad" 2104176 2104185 2105319 2105324) (-1193 "UDPO.spad" 2101603 2101614 2104132 2104137) (-1192 "TYPE.spad" 2101535 2101544 2101593 2101598) (-1191 "TYPEAST.spad" 2101454 2101463 2101525 2101530) (-1190 "TWOFACT.spad" 2100104 2100119 2101444 2101449) (-1189 "TUPLE.spad" 2099588 2099599 2100003 2100008) (-1188 "TUBETOOL.spad" 2096425 2096434 2099578 2099583) (-1187 "TUBE.spad" 2095066 2095083 2096415 2096420) (-1186 "TS.spad" 2093655 2093671 2094631 2094728) (-1185 "TSETCAT.spad" 2080782 2080799 2093623 2093650) (-1184 "TSETCAT.spad" 2067895 2067914 2080738 2080743) (-1183 "TRMANIP.spad" 2062261 2062278 2067601 2067606) (-1182 "TRIMAT.spad" 2061220 2061245 2062251 2062256) (-1181 "TRIGMNIP.spad" 2059737 2059754 2061210 2061215) (-1180 "TRIGCAT.spad" 2059249 2059258 2059727 2059732) (-1179 "TRIGCAT.spad" 2058759 2058770 2059239 2059244) (-1178 "TREE.spad" 2057330 2057341 2058366 2058393) (-1177 "TRANFUN.spad" 2057161 2057170 2057320 2057325) (-1176 "TRANFUN.spad" 2056990 2057001 2057151 2057156) (-1175 "TOPSP.spad" 2056664 2056673 2056980 2056985) (-1174 "TOOLSIGN.spad" 2056327 2056338 2056654 2056659) (-1173 "TEXTFILE.spad" 2054884 2054893 2056317 2056322) (-1172 "TEX.spad" 2052016 2052025 2054874 2054879) (-1171 "TEX1.spad" 2051572 2051583 2052006 2052011) (-1170 "TEMUTL.spad" 2051127 2051136 2051562 2051567) (-1169 "TBCMPPK.spad" 2049220 2049243 2051117 2051122) (-1168 "TBAGG.spad" 2048256 2048279 2049200 2049215) (-1167 "TBAGG.spad" 2047300 2047325 2048246 2048251) (-1166 "TANEXP.spad" 2046676 2046687 2047290 2047295) (-1165 "TABLE.spad" 2045087 2045110 2045357 2045384) (-1164 "TABLEAU.spad" 2044568 2044579 2045077 2045082) (-1163 "TABLBUMP.spad" 2041351 2041362 2044558 2044563) (-1162 "SYSTEM.spad" 2040625 2040634 2041341 2041346) (-1161 "SYSSOLP.spad" 2038098 2038109 2040615 2040620) (-1160 "SYNTAX.spad" 2034368 2034377 2038088 2038093) (-1159 "SYMTAB.spad" 2032424 2032433 2034358 2034363) (-1158 "SYMS.spad" 2028409 2028418 2032414 2032419) (-1157 "SYMPOLY.spad" 2027416 2027427 2027498 2027625) (-1156 "SYMFUNC.spad" 2026891 2026902 2027406 2027411) (-1155 "SYMBOL.spad" 2024318 2024327 2026881 2026886) (-1154 "SWITCH.spad" 2021075 2021084 2024308 2024313) (-1153 "SUTS.spad" 2017974 2018002 2019542 2019639) (-1152 "SUPXS.spad" 2015109 2015137 2016106 2016255) (-1151 "SUP.spad" 2011878 2011889 2012659 2012812) (-1150 "SUPFRACF.spad" 2010983 2011001 2011868 2011873) (-1149 "SUP2.spad" 2010373 2010386 2010973 2010978) (-1148 "SUMRF.spad" 2009339 2009350 2010363 2010368) (-1147 "SUMFS.spad" 2008972 2008989 2009329 2009334) (-1146 "SULS.spad" 1999511 1999539 2000617 2001046) (-1145 "SUCHTAST.spad" 1999280 1999289 1999501 1999506) (-1144 "SUCH.spad" 1998960 1998975 1999270 1999275) (-1143 "SUBSPACE.spad" 1990967 1990982 1998950 1998955) (-1142 "SUBRESP.spad" 1990127 1990141 1990923 1990928) (-1141 "STTF.spad" 1986226 1986242 1990117 1990122) (-1140 "STTFNC.spad" 1982694 1982710 1986216 1986221) (-1139 "STTAYLOR.spad" 1975092 1975103 1982575 1982580) (-1138 "STRTBL.spad" 1973597 1973614 1973746 1973773) (-1137 "STRING.spad" 1973006 1973015 1973020 1973047) (-1136 "STRICAT.spad" 1972794 1972803 1972974 1973001) (-1135 "STREAM.spad" 1969652 1969663 1972319 1972334) (-1134 "STREAM3.spad" 1969197 1969212 1969642 1969647) (-1133 "STREAM2.spad" 1968265 1968278 1969187 1969192) (-1132 "STREAM1.spad" 1967969 1967980 1968255 1968260) (-1131 "STINPROD.spad" 1966875 1966891 1967959 1967964) (-1130 "STEP.spad" 1966076 1966085 1966865 1966870) (-1129 "STBL.spad" 1964602 1964630 1964769 1964784) (-1128 "STAGG.spad" 1963677 1963688 1964592 1964597) (-1127 "STAGG.spad" 1962750 1962763 1963667 1963672) (-1126 "STACK.spad" 1962101 1962112 1962357 1962384) (-1125 "SREGSET.spad" 1959805 1959822 1961747 1961774) (-1124 "SRDCMPK.spad" 1958350 1958370 1959795 1959800) (-1123 "SRAGG.spad" 1953447 1953456 1958318 1958345) (-1122 "SRAGG.spad" 1948564 1948575 1953437 1953442) (-1121 "SQMATRIX.spad" 1946180 1946198 1947096 1947183) (-1120 "SPLTREE.spad" 1940732 1940745 1945616 1945643) (-1119 "SPLNODE.spad" 1937320 1937333 1940722 1940727) (-1118 "SPFCAT.spad" 1936097 1936106 1937310 1937315) (-1117 "SPECOUT.spad" 1934647 1934656 1936087 1936092) (-1116 "SPADXPT.spad" 1926786 1926795 1934637 1934642) (-1115 "spad-parser.spad" 1926251 1926260 1926776 1926781) (-1114 "SPADAST.spad" 1925952 1925961 1926241 1926246) (-1113 "SPACEC.spad" 1909965 1909976 1925942 1925947) (-1112 "SPACE3.spad" 1909741 1909752 1909955 1909960) (-1111 "SORTPAK.spad" 1909286 1909299 1909697 1909702) (-1110 "SOLVETRA.spad" 1907043 1907054 1909276 1909281) (-1109 "SOLVESER.spad" 1905563 1905574 1907033 1907038) (-1108 "SOLVERAD.spad" 1901573 1901584 1905553 1905558) (-1107 "SOLVEFOR.spad" 1899993 1900011 1901563 1901568) (-1106 "SNTSCAT.spad" 1899593 1899610 1899961 1899988) (-1105 "SMTS.spad" 1897853 1897879 1899158 1899255) (-1104 "SMP.spad" 1895292 1895312 1895682 1895809) (-1103 "SMITH.spad" 1894135 1894160 1895282 1895287) (-1102 "SMATCAT.spad" 1892245 1892275 1894079 1894130) (-1101 "SMATCAT.spad" 1890287 1890319 1892123 1892128) (-1100 "SKAGG.spad" 1889248 1889259 1890255 1890282) (-1099 "SINT.spad" 1887556 1887565 1889114 1889243) (-1098 "SIMPAN.spad" 1887284 1887293 1887546 1887551) (-1097 "SIG.spad" 1886612 1886621 1887274 1887279) (-1096 "SIGNRF.spad" 1885720 1885731 1886602 1886607) (-1095 "SIGNEF.spad" 1884989 1885006 1885710 1885715) (-1094 "SIGAST.spad" 1884370 1884379 1884979 1884984) (-1093 "SHP.spad" 1882288 1882303 1884326 1884331) (-1092 "SHDP.spad" 1871999 1872026 1872508 1872639) (-1091 "SGROUP.spad" 1871607 1871616 1871989 1871994) (-1090 "SGROUP.spad" 1871213 1871224 1871597 1871602) (-1089 "SGCF.spad" 1864094 1864103 1871203 1871208) (-1088 "SFRTCAT.spad" 1863022 1863039 1864062 1864089) (-1087 "SFRGCD.spad" 1862085 1862105 1863012 1863017) (-1086 "SFQCMPK.spad" 1856722 1856742 1862075 1862080) (-1085 "SFORT.spad" 1856157 1856171 1856712 1856717) (-1084 "SEXOF.spad" 1856000 1856040 1856147 1856152) (-1083 "SEX.spad" 1855892 1855901 1855990 1855995) (-1082 "SEXCAT.spad" 1853443 1853483 1855882 1855887) (-1081 "SET.spad" 1851743 1851754 1852864 1852903) (-1080 "SETMN.spad" 1850177 1850194 1851733 1851738) (-1079 "SETCAT.spad" 1849662 1849671 1850167 1850172) (-1078 "SETCAT.spad" 1849145 1849156 1849652 1849657) (-1077 "SETAGG.spad" 1845666 1845677 1849125 1849140) (-1076 "SETAGG.spad" 1842195 1842208 1845656 1845661) (-1075 "SEQAST.spad" 1841898 1841907 1842185 1842190) (-1074 "SEGXCAT.spad" 1841020 1841033 1841888 1841893) (-1073 "SEG.spad" 1840833 1840844 1840939 1840944) (-1072 "SEGCAT.spad" 1839740 1839751 1840823 1840828) (-1071 "SEGBIND.spad" 1838812 1838823 1839695 1839700) (-1070 "SEGBIND2.spad" 1838508 1838521 1838802 1838807) (-1069 "SEGAST.spad" 1838222 1838231 1838498 1838503) (-1068 "SEG2.spad" 1837647 1837660 1838178 1838183) (-1067 "SDVAR.spad" 1836923 1836934 1837637 1837642) (-1066 "SDPOL.spad" 1834313 1834324 1834604 1834731) (-1065 "SCPKG.spad" 1832392 1832403 1834303 1834308) (-1064 "SCOPE.spad" 1831537 1831546 1832382 1832387) (-1063 "SCACHE.spad" 1830219 1830230 1831527 1831532) (-1062 "SASTCAT.spad" 1830128 1830137 1830209 1830214) (-1061 "SAOS.spad" 1830000 1830009 1830118 1830123) (-1060 "SAERFFC.spad" 1829713 1829733 1829990 1829995) (-1059 "SAE.spad" 1827888 1827904 1828499 1828634) (-1058 "SAEFACT.spad" 1827589 1827609 1827878 1827883) (-1057 "RURPK.spad" 1825230 1825246 1827579 1827584) (-1056 "RULESET.spad" 1824671 1824695 1825220 1825225) (-1055 "RULE.spad" 1822875 1822899 1824661 1824666) (-1054 "RULECOLD.spad" 1822727 1822740 1822865 1822870) (-1053 "RSTRCAST.spad" 1822444 1822453 1822717 1822722) (-1052 "RSETGCD.spad" 1818822 1818842 1822434 1822439) (-1051 "RSETCAT.spad" 1808606 1808623 1818790 1818817) (-1050 "RSETCAT.spad" 1798410 1798429 1808596 1808601) (-1049 "RSDCMPK.spad" 1796862 1796882 1798400 1798405) (-1048 "RRCC.spad" 1795246 1795276 1796852 1796857) (-1047 "RRCC.spad" 1793628 1793660 1795236 1795241) (-1046 "RPTAST.spad" 1793330 1793339 1793618 1793623) (-1045 "RPOLCAT.spad" 1772690 1772705 1793198 1793325) (-1044 "RPOLCAT.spad" 1751764 1751781 1772274 1772279) (-1043 "ROUTINE.spad" 1747627 1747636 1750411 1750438) (-1042 "ROMAN.spad" 1746955 1746964 1747493 1747622) (-1041 "ROIRC.spad" 1746035 1746067 1746945 1746950) (-1040 "RNS.spad" 1744938 1744947 1745937 1746030) (-1039 "RNS.spad" 1743927 1743938 1744928 1744933) (-1038 "RNG.spad" 1743662 1743671 1743917 1743922) (-1037 "RMODULE.spad" 1743300 1743311 1743652 1743657) (-1036 "RMCAT2.spad" 1742708 1742765 1743290 1743295) (-1035 "RMATRIX.spad" 1741532 1741551 1741875 1741914) (-1034 "RMATCAT.spad" 1737065 1737096 1741488 1741527) (-1033 "RMATCAT.spad" 1732488 1732521 1736913 1736918) (-1032 "RINTERP.spad" 1732376 1732396 1732478 1732483) (-1031 "RING.spad" 1731846 1731855 1732356 1732371) (-1030 "RING.spad" 1731324 1731335 1731836 1731841) (-1029 "RIDIST.spad" 1730708 1730717 1731314 1731319) (-1028 "RGCHAIN.spad" 1729287 1729303 1730193 1730220) (-1027 "RGBCSPC.spad" 1729068 1729080 1729277 1729282) (-1026 "RGBCMDL.spad" 1728598 1728610 1729058 1729063) (-1025 "RF.spad" 1726212 1726223 1728588 1728593) (-1024 "RFFACTOR.spad" 1725674 1725685 1726202 1726207) (-1023 "RFFACT.spad" 1725409 1725421 1725664 1725669) (-1022 "RFDIST.spad" 1724397 1724406 1725399 1725404) (-1021 "RETSOL.spad" 1723814 1723827 1724387 1724392) (-1020 "RETRACT.spad" 1723242 1723253 1723804 1723809) (-1019 "RETRACT.spad" 1722668 1722681 1723232 1723237) (-1018 "RETAST.spad" 1722480 1722489 1722658 1722663) (-1017 "RESULT.spad" 1720540 1720549 1721127 1721154) (-1016 "RESRING.spad" 1719887 1719934 1720478 1720535) (-1015 "RESLATC.spad" 1719211 1719222 1719877 1719882) (-1014 "REPSQ.spad" 1718940 1718951 1719201 1719206) (-1013 "REP.spad" 1716492 1716501 1718930 1718935) (-1012 "REPDB.spad" 1716197 1716208 1716482 1716487) (-1011 "REP2.spad" 1705769 1705780 1716039 1716044) (-1010 "REP1.spad" 1699759 1699770 1705719 1705724) (-1009 "REGSET.spad" 1697556 1697573 1699405 1699432) (-1008 "REF.spad" 1696885 1696896 1697511 1697516) (-1007 "REDORDER.spad" 1696061 1696078 1696875 1696880) (-1006 "RECLOS.spad" 1694844 1694864 1695548 1695641) (-1005 "REALSOLV.spad" 1693976 1693985 1694834 1694839) (-1004 "REAL.spad" 1693848 1693857 1693966 1693971) (-1003 "REAL0Q.spad" 1691130 1691145 1693838 1693843) (-1002 "REAL0.spad" 1687958 1687973 1691120 1691125) (-1001 "RDUCEAST.spad" 1687679 1687688 1687948 1687953) (-1000 "RDIV.spad" 1687330 1687355 1687669 1687674) (-999 "RDIST.spad" 1686894 1686904 1687320 1687325) (-998 "RDETRS.spad" 1685691 1685708 1686884 1686889) (-997 "RDETR.spad" 1683799 1683816 1685681 1685686) (-996 "RDEEFS.spad" 1682873 1682889 1683789 1683794) (-995 "RDEEF.spad" 1681870 1681886 1682863 1682868) (-994 "RCFIELD.spad" 1679057 1679065 1681772 1681865) (-993 "RCFIELD.spad" 1676330 1676340 1679047 1679052) (-992 "RCAGG.spad" 1674243 1674253 1676320 1676325) (-991 "RCAGG.spad" 1672083 1672095 1674162 1674167) (-990 "RATRET.spad" 1671444 1671454 1672073 1672078) (-989 "RATFACT.spad" 1671137 1671148 1671434 1671439) (-988 "RANDSRC.spad" 1670457 1670465 1671127 1671132) (-987 "RADUTIL.spad" 1670212 1670220 1670447 1670452) (-986 "RADIX.spad" 1667114 1667127 1668679 1668772) (-985 "RADFF.spad" 1665528 1665564 1665646 1665802) (-984 "RADCAT.spad" 1665122 1665130 1665518 1665523) (-983 "RADCAT.spad" 1664714 1664724 1665112 1665117) (-982 "QUEUE.spad" 1664057 1664067 1664321 1664348) (-981 "QUAT.spad" 1662639 1662649 1662981 1663046) (-980 "QUATCT2.spad" 1662258 1662276 1662629 1662634) (-979 "QUATCAT.spad" 1660423 1660433 1662188 1662253) (-978 "QUATCAT.spad" 1658339 1658351 1660106 1660111) (-977 "QUAGG.spad" 1657165 1657175 1658307 1658334) (-976 "QQUTAST.spad" 1656934 1656942 1657155 1657160) (-975 "QFORM.spad" 1656397 1656411 1656924 1656929) (-974 "QFCAT.spad" 1655100 1655110 1656299 1656392) (-973 "QFCAT.spad" 1653394 1653406 1654595 1654600) (-972 "QFCAT2.spad" 1653085 1653101 1653384 1653389) (-971 "QEQUAT.spad" 1652642 1652650 1653075 1653080) (-970 "QCMPACK.spad" 1647389 1647408 1652632 1652637) (-969 "QALGSET.spad" 1643464 1643496 1647303 1647308) (-968 "QALGSET2.spad" 1641460 1641478 1643454 1643459) (-967 "PWFFINTB.spad" 1638770 1638791 1641450 1641455) (-966 "PUSHVAR.spad" 1638099 1638118 1638760 1638765) (-965 "PTRANFN.spad" 1634225 1634235 1638089 1638094) (-964 "PTPACK.spad" 1631313 1631323 1634215 1634220) (-963 "PTFUNC2.spad" 1631134 1631148 1631303 1631308) (-962 "PTCAT.spad" 1630383 1630393 1631102 1631129) (-961 "PSQFR.spad" 1629690 1629714 1630373 1630378) (-960 "PSEUDLIN.spad" 1628548 1628558 1629680 1629685) (-959 "PSETPK.spad" 1613981 1613997 1628426 1628431) (-958 "PSETCAT.spad" 1607901 1607924 1613961 1613976) (-957 "PSETCAT.spad" 1601795 1601820 1607857 1607862) (-956 "PSCURVE.spad" 1600778 1600786 1601785 1601790) (-955 "PSCAT.spad" 1599545 1599574 1600676 1600773) (-954 "PSCAT.spad" 1598402 1598433 1599535 1599540) (-953 "PRTITION.spad" 1597347 1597355 1598392 1598397) (-952 "PRTDAST.spad" 1597066 1597074 1597337 1597342) (-951 "PRS.spad" 1586628 1586645 1597022 1597027) (-950 "PRQAGG.spad" 1586059 1586069 1586596 1586623) (-949 "PROPLOG.spad" 1585462 1585470 1586049 1586054) (-948 "PROPFRML.spad" 1583380 1583391 1585452 1585457) (-947 "PROPERTY.spad" 1582874 1582882 1583370 1583375) (-946 "PRODUCT.spad" 1580554 1580566 1580840 1580895) (-945 "PR.spad" 1578940 1578952 1579645 1579772) (-944 "PRINT.spad" 1578692 1578700 1578930 1578935) (-943 "PRIMES.spad" 1576943 1576953 1578682 1578687) (-942 "PRIMELT.spad" 1574924 1574938 1576933 1576938) (-941 "PRIMCAT.spad" 1574547 1574555 1574914 1574919) (-940 "PRIMARR.spad" 1573552 1573562 1573730 1573757) (-939 "PRIMARR2.spad" 1572275 1572287 1573542 1573547) (-938 "PREASSOC.spad" 1571647 1571659 1572265 1572270) (-937 "PPCURVE.spad" 1570784 1570792 1571637 1571642) (-936 "PORTNUM.spad" 1570559 1570567 1570774 1570779) (-935 "POLYROOT.spad" 1569388 1569410 1570515 1570520) (-934 "POLY.spad" 1566685 1566695 1567202 1567329) (-933 "POLYLIFT.spad" 1565946 1565969 1566675 1566680) (-932 "POLYCATQ.spad" 1564048 1564070 1565936 1565941) (-931 "POLYCAT.spad" 1557454 1557475 1563916 1564043) (-930 "POLYCAT.spad" 1550162 1550185 1556626 1556631) (-929 "POLY2UP.spad" 1549610 1549624 1550152 1550157) (-928 "POLY2.spad" 1549205 1549217 1549600 1549605) (-927 "POLUTIL.spad" 1548146 1548175 1549161 1549166) (-926 "POLTOPOL.spad" 1546894 1546909 1548136 1548141) (-925 "POINT.spad" 1545733 1545743 1545820 1545847) (-924 "PNTHEORY.spad" 1542399 1542407 1545723 1545728) (-923 "PMTOOLS.spad" 1541156 1541170 1542389 1542394) (-922 "PMSYM.spad" 1540701 1540711 1541146 1541151) (-921 "PMQFCAT.spad" 1540288 1540302 1540691 1540696) (-920 "PMPRED.spad" 1539757 1539771 1540278 1540283) (-919 "PMPREDFS.spad" 1539201 1539223 1539747 1539752) (-918 "PMPLCAT.spad" 1538271 1538289 1539133 1539138) (-917 "PMLSAGG.spad" 1537852 1537866 1538261 1538266) (-916 "PMKERNEL.spad" 1537419 1537431 1537842 1537847) (-915 "PMINS.spad" 1536995 1537005 1537409 1537414) (-914 "PMFS.spad" 1536568 1536586 1536985 1536990) (-913 "PMDOWN.spad" 1535854 1535868 1536558 1536563) (-912 "PMASS.spad" 1534866 1534874 1535844 1535849) (-911 "PMASSFS.spad" 1533835 1533851 1534856 1534861) (-910 "PLOTTOOL.spad" 1533615 1533623 1533825 1533830) (-909 "PLOT.spad" 1528446 1528454 1533605 1533610) (-908 "PLOT3D.spad" 1524866 1524874 1528436 1528441) (-907 "PLOT1.spad" 1524007 1524017 1524856 1524861) (-906 "PLEQN.spad" 1511223 1511250 1523997 1524002) (-905 "PINTERP.spad" 1510839 1510858 1511213 1511218) (-904 "PINTERPA.spad" 1510621 1510637 1510829 1510834) (-903 "PI.spad" 1510228 1510236 1510595 1510616) (-902 "PID.spad" 1509184 1509192 1510154 1510223) (-901 "PICOERCE.spad" 1508841 1508851 1509174 1509179) (-900 "PGROEB.spad" 1507438 1507452 1508831 1508836) (-899 "PGE.spad" 1498691 1498699 1507428 1507433) (-898 "PGCD.spad" 1497573 1497590 1498681 1498686) (-897 "PFRPAC.spad" 1496716 1496726 1497563 1497568) (-896 "PFR.spad" 1493373 1493383 1496618 1496711) (-895 "PFOTOOLS.spad" 1492631 1492647 1493363 1493368) (-894 "PFOQ.spad" 1492001 1492019 1492621 1492626) (-893 "PFO.spad" 1491420 1491447 1491991 1491996) (-892 "PF.spad" 1490994 1491006 1491225 1491318) (-891 "PFECAT.spad" 1488660 1488668 1490920 1490989) (-890 "PFECAT.spad" 1486354 1486364 1488616 1488621) (-889 "PFBRU.spad" 1484224 1484236 1486344 1486349) (-888 "PFBR.spad" 1481762 1481785 1484214 1484219) (-887 "PERM.spad" 1477443 1477453 1481592 1481607) (-886 "PERMGRP.spad" 1472179 1472189 1477433 1477438) (-885 "PERMCAT.spad" 1470731 1470741 1472159 1472174) (-884 "PERMAN.spad" 1469263 1469277 1470721 1470726) (-883 "PENDTREE.spad" 1468602 1468612 1468892 1468897) (-882 "PDRING.spad" 1467093 1467103 1468582 1468597) (-881 "PDRING.spad" 1465592 1465604 1467083 1467088) (-880 "PDEPROB.spad" 1464607 1464615 1465582 1465587) (-879 "PDEPACK.spad" 1458609 1458617 1464597 1464602) (-878 "PDECOMP.spad" 1458071 1458088 1458599 1458604) (-877 "PDECAT.spad" 1456425 1456433 1458061 1458066) (-876 "PCOMP.spad" 1456276 1456289 1456415 1456420) (-875 "PBWLB.spad" 1454858 1454875 1456266 1456271) (-874 "PATTERN.spad" 1449289 1449299 1454848 1454853) (-873 "PATTERN2.spad" 1449025 1449037 1449279 1449284) (-872 "PATTERN1.spad" 1447327 1447343 1449015 1449020) (-871 "PATRES.spad" 1444874 1444886 1447317 1447322) (-870 "PATRES2.spad" 1444536 1444550 1444864 1444869) (-869 "PATMATCH.spad" 1442693 1442724 1444244 1444249) (-868 "PATMAB.spad" 1442118 1442128 1442683 1442688) (-867 "PATLRES.spad" 1441202 1441216 1442108 1442113) (-866 "PATAB.spad" 1440966 1440976 1441192 1441197) (-865 "PARTPERM.spad" 1438328 1438336 1440956 1440961) (-864 "PARSURF.spad" 1437756 1437784 1438318 1438323) (-863 "PARSU2.spad" 1437551 1437567 1437746 1437751) (-862 "script-parser.spad" 1437071 1437079 1437541 1437546) (-861 "PARSCURV.spad" 1436499 1436527 1437061 1437066) (-860 "PARSC2.spad" 1436288 1436304 1436489 1436494) (-859 "PARPCURV.spad" 1435746 1435774 1436278 1436283) (-858 "PARPC2.spad" 1435535 1435551 1435736 1435741) (-857 "PAN2EXPR.spad" 1434947 1434955 1435525 1435530) (-856 "PALETTE.spad" 1433917 1433925 1434937 1434942) (-855 "PAIR.spad" 1432900 1432913 1433505 1433510) (-854 "PADICRC.spad" 1430230 1430248 1431405 1431498) (-853 "PADICRAT.spad" 1428245 1428257 1428466 1428559) (-852 "PADIC.spad" 1427940 1427952 1428171 1428240) (-851 "PADICCT.spad" 1426481 1426493 1427866 1427935) (-850 "PADEPAC.spad" 1425160 1425179 1426471 1426476) (-849 "PADE.spad" 1423900 1423916 1425150 1425155) (-848 "OWP.spad" 1423140 1423170 1423758 1423825) (-847 "OVAR.spad" 1422921 1422944 1423130 1423135) (-846 "OUT.spad" 1422005 1422013 1422911 1422916) (-845 "OUTFORM.spad" 1411301 1411309 1421995 1422000) (-844 "OUTBFILE.spad" 1410719 1410727 1411291 1411296) (-843 "OUTBCON.spad" 1409997 1410005 1410709 1410714) (-842 "OUTBCON.spad" 1409273 1409283 1409987 1409992) (-841 "OSI.spad" 1408748 1408756 1409263 1409268) (-840 "OSGROUP.spad" 1408666 1408674 1408738 1408743) (-839 "ORTHPOL.spad" 1407127 1407137 1408583 1408588) (-838 "OREUP.spad" 1406580 1406608 1406807 1406846) (-837 "ORESUP.spad" 1405879 1405903 1406260 1406299) (-836 "OREPCTO.spad" 1403698 1403710 1405799 1405804) (-835 "OREPCAT.spad" 1397755 1397765 1403654 1403693) (-834 "OREPCAT.spad" 1391702 1391714 1397603 1397608) (-833 "ORDSET.spad" 1390868 1390876 1391692 1391697) (-832 "ORDSET.spad" 1390032 1390042 1390858 1390863) (-831 "ORDRING.spad" 1389422 1389430 1390012 1390027) (-830 "ORDRING.spad" 1388820 1388830 1389412 1389417) (-829 "ORDMON.spad" 1388675 1388683 1388810 1388815) (-828 "ORDFUNS.spad" 1387801 1387817 1388665 1388670) (-827 "ORDFIN.spad" 1387735 1387743 1387791 1387796) (-826 "ORDCOMP.spad" 1386200 1386210 1387282 1387311) (-825 "ORDCOMP2.spad" 1385485 1385497 1386190 1386195) (-824 "OPTPROB.spad" 1384123 1384131 1385475 1385480) (-823 "OPTPACK.spad" 1376508 1376516 1384113 1384118) (-822 "OPTCAT.spad" 1374183 1374191 1376498 1376503) (-821 "OPQUERY.spad" 1373732 1373740 1374173 1374178) (-820 "OP.spad" 1373474 1373484 1373554 1373621) (-819 "ONECOMP.spad" 1372219 1372229 1373021 1373050) (-818 "ONECOMP2.spad" 1371637 1371649 1372209 1372214) (-817 "OMSERVER.spad" 1370639 1370647 1371627 1371632) (-816 "OMSAGG.spad" 1370427 1370437 1370595 1370634) (-815 "OMPKG.spad" 1369039 1369047 1370417 1370422) (-814 "OM.spad" 1368004 1368012 1369029 1369034) (-813 "OMLO.spad" 1367429 1367441 1367890 1367929) (-812 "OMEXPR.spad" 1367263 1367273 1367419 1367424) (-811 "OMERR.spad" 1366806 1366814 1367253 1367258) (-810 "OMERRK.spad" 1365840 1365848 1366796 1366801) (-809 "OMENC.spad" 1365184 1365192 1365830 1365835) (-808 "OMDEV.spad" 1359473 1359481 1365174 1365179) (-807 "OMCONN.spad" 1358882 1358890 1359463 1359468) (-806 "OINTDOM.spad" 1358645 1358653 1358808 1358877) (-805 "OFMONOID.spad" 1354832 1354842 1358635 1358640) (-804 "ODVAR.spad" 1354093 1354103 1354822 1354827) (-803 "ODR.spad" 1353737 1353763 1353905 1354054) (-802 "ODPOL.spad" 1351083 1351093 1351423 1351550) (-801 "ODP.spad" 1340930 1340950 1341303 1341434) (-800 "ODETOOLS.spad" 1339513 1339532 1340920 1340925) (-799 "ODESYS.spad" 1337163 1337180 1339503 1339508) (-798 "ODERTRIC.spad" 1333104 1333121 1337120 1337125) (-797 "ODERED.spad" 1332491 1332515 1333094 1333099) (-796 "ODERAT.spad" 1330042 1330059 1332481 1332486) (-795 "ODEPRRIC.spad" 1326933 1326955 1330032 1330037) (-794 "ODEPROB.spad" 1326190 1326198 1326923 1326928) (-793 "ODEPRIM.spad" 1323464 1323486 1326180 1326185) (-792 "ODEPAL.spad" 1322840 1322864 1323454 1323459) (-791 "ODEPACK.spad" 1309442 1309450 1322830 1322835) (-790 "ODEINT.spad" 1308873 1308889 1309432 1309437) (-789 "ODEIFTBL.spad" 1306268 1306276 1308863 1308868) (-788 "ODEEF.spad" 1301635 1301651 1306258 1306263) (-787 "ODECONST.spad" 1301154 1301172 1301625 1301630) (-786 "ODECAT.spad" 1299750 1299758 1301144 1301149) (-785 "OCT.spad" 1297888 1297898 1298604 1298643) (-784 "OCTCT2.spad" 1297532 1297553 1297878 1297883) (-783 "OC.spad" 1295306 1295316 1297488 1297527) (-782 "OC.spad" 1292805 1292817 1294989 1294994) (-781 "OCAMON.spad" 1292653 1292661 1292795 1292800) (-780 "OASGP.spad" 1292468 1292476 1292643 1292648) (-779 "OAMONS.spad" 1291988 1291996 1292458 1292463) (-778 "OAMON.spad" 1291849 1291857 1291978 1291983) (-777 "OAGROUP.spad" 1291711 1291719 1291839 1291844) (-776 "NUMTUBE.spad" 1291298 1291314 1291701 1291706) (-775 "NUMQUAD.spad" 1279160 1279168 1291288 1291293) (-774 "NUMODE.spad" 1270296 1270304 1279150 1279155) (-773 "NUMINT.spad" 1267854 1267862 1270286 1270291) (-772 "NUMFMT.spad" 1266694 1266702 1267844 1267849) (-771 "NUMERIC.spad" 1258766 1258776 1266499 1266504) (-770 "NTSCAT.spad" 1257268 1257284 1258734 1258761) (-769 "NTPOLFN.spad" 1256813 1256823 1257185 1257190) (-768 "NSUP.spad" 1249823 1249833 1254363 1254516) (-767 "NSUP2.spad" 1249215 1249227 1249813 1249818) (-766 "NSMP.spad" 1245410 1245429 1245718 1245845) (-765 "NREP.spad" 1243782 1243796 1245400 1245405) (-764 "NPCOEF.spad" 1243028 1243048 1243772 1243777) (-763 "NORMRETR.spad" 1242626 1242665 1243018 1243023) (-762 "NORMPK.spad" 1240528 1240547 1242616 1242621) (-761 "NORMMA.spad" 1240216 1240242 1240518 1240523) (-760 "NONE.spad" 1239957 1239965 1240206 1240211) (-759 "NONE1.spad" 1239633 1239643 1239947 1239952) (-758 "NODE1.spad" 1239102 1239118 1239623 1239628) (-757 "NNI.spad" 1237989 1237997 1239076 1239097) (-756 "NLINSOL.spad" 1236611 1236621 1237979 1237984) (-755 "NIPROB.spad" 1235152 1235160 1236601 1236606) (-754 "NFINTBAS.spad" 1232612 1232629 1235142 1235147) (-753 "NETCLT.spad" 1232586 1232597 1232602 1232607) (-752 "NCODIV.spad" 1230784 1230800 1232576 1232581) (-751 "NCNTFRAC.spad" 1230426 1230440 1230774 1230779) (-750 "NCEP.spad" 1228586 1228600 1230416 1230421) (-749 "NASRING.spad" 1228182 1228190 1228576 1228581) (-748 "NASRING.spad" 1227776 1227786 1228172 1228177) (-747 "NARNG.spad" 1227120 1227128 1227766 1227771) (-746 "NARNG.spad" 1226462 1226472 1227110 1227115) (-745 "NAGSP.spad" 1225535 1225543 1226452 1226457) (-744 "NAGS.spad" 1215060 1215068 1225525 1225530) (-743 "NAGF07.spad" 1213453 1213461 1215050 1215055) (-742 "NAGF04.spad" 1207685 1207693 1213443 1213448) (-741 "NAGF02.spad" 1201494 1201502 1207675 1207680) (-740 "NAGF01.spad" 1197097 1197105 1201484 1201489) (-739 "NAGE04.spad" 1190557 1190565 1197087 1197092) (-738 "NAGE02.spad" 1180899 1180907 1190547 1190552) (-737 "NAGE01.spad" 1176783 1176791 1180889 1180894) (-736 "NAGD03.spad" 1174703 1174711 1176773 1176778) (-735 "NAGD02.spad" 1167234 1167242 1174693 1174698) (-734 "NAGD01.spad" 1161347 1161355 1167224 1167229) (-733 "NAGC06.spad" 1157134 1157142 1161337 1161342) (-732 "NAGC05.spad" 1155603 1155611 1157124 1157129) (-731 "NAGC02.spad" 1154858 1154866 1155593 1155598) (-730 "NAALG.spad" 1154393 1154403 1154826 1154853) (-729 "NAALG.spad" 1153948 1153960 1154383 1154388) (-728 "MULTSQFR.spad" 1150906 1150923 1153938 1153943) (-727 "MULTFACT.spad" 1150289 1150306 1150896 1150901) (-726 "MTSCAT.spad" 1148323 1148344 1150187 1150284) (-725 "MTHING.spad" 1147980 1147990 1148313 1148318) (-724 "MSYSCMD.spad" 1147414 1147422 1147970 1147975) (-723 "MSET.spad" 1145356 1145366 1147120 1147159) (-722 "MSETAGG.spad" 1145201 1145211 1145324 1145351) (-721 "MRING.spad" 1142172 1142184 1144909 1144976) (-720 "MRF2.spad" 1141740 1141754 1142162 1142167) (-719 "MRATFAC.spad" 1141286 1141303 1141730 1141735) (-718 "MPRFF.spad" 1139316 1139335 1141276 1141281) (-717 "MPOLY.spad" 1136751 1136766 1137110 1137237) (-716 "MPCPF.spad" 1136015 1136034 1136741 1136746) (-715 "MPC3.spad" 1135830 1135870 1136005 1136010) (-714 "MPC2.spad" 1135472 1135505 1135820 1135825) (-713 "MONOTOOL.spad" 1133807 1133824 1135462 1135467) (-712 "MONOID.spad" 1133126 1133134 1133797 1133802) (-711 "MONOID.spad" 1132443 1132453 1133116 1133121) (-710 "MONOGEN.spad" 1131189 1131202 1132303 1132438) (-709 "MONOGEN.spad" 1129957 1129972 1131073 1131078) (-708 "MONADWU.spad" 1127971 1127979 1129947 1129952) (-707 "MONADWU.spad" 1125983 1125993 1127961 1127966) (-706 "MONAD.spad" 1125127 1125135 1125973 1125978) (-705 "MONAD.spad" 1124269 1124279 1125117 1125122) (-704 "MOEBIUS.spad" 1122955 1122969 1124249 1124264) (-703 "MODULE.spad" 1122825 1122835 1122923 1122950) (-702 "MODULE.spad" 1122715 1122727 1122815 1122820) (-701 "MODRING.spad" 1122046 1122085 1122695 1122710) (-700 "MODOP.spad" 1120705 1120717 1121868 1121935) (-699 "MODMONOM.spad" 1120434 1120452 1120695 1120700) (-698 "MODMON.spad" 1117193 1117209 1117912 1118065) (-697 "MODFIELD.spad" 1116551 1116590 1117095 1117188) (-696 "MMLFORM.spad" 1115411 1115419 1116541 1116546) (-695 "MMAP.spad" 1115151 1115185 1115401 1115406) (-694 "MLO.spad" 1113578 1113588 1115107 1115146) (-693 "MLIFT.spad" 1112150 1112167 1113568 1113573) (-692 "MKUCFUNC.spad" 1111683 1111701 1112140 1112145) (-691 "MKRECORD.spad" 1111285 1111298 1111673 1111678) (-690 "MKFUNC.spad" 1110666 1110676 1111275 1111280) (-689 "MKFLCFN.spad" 1109622 1109632 1110656 1110661) (-688 "MKCHSET.spad" 1109487 1109497 1109612 1109617) (-687 "MKBCFUNC.spad" 1108972 1108990 1109477 1109482) (-686 "MINT.spad" 1108411 1108419 1108874 1108967) (-685 "MHROWRED.spad" 1106912 1106922 1108401 1108406) (-684 "MFLOAT.spad" 1105428 1105436 1106802 1106907) (-683 "MFINFACT.spad" 1104828 1104850 1105418 1105423) (-682 "MESH.spad" 1102560 1102568 1104818 1104823) (-681 "MDDFACT.spad" 1100753 1100763 1102550 1102555) (-680 "MDAGG.spad" 1100040 1100050 1100733 1100748) (-679 "MCMPLX.spad" 1096026 1096034 1096640 1096829) (-678 "MCDEN.spad" 1095234 1095246 1096016 1096021) (-677 "MCALCFN.spad" 1092336 1092362 1095224 1095229) (-676 "MAYBE.spad" 1091585 1091596 1092326 1092331) (-675 "MATSTOR.spad" 1088861 1088871 1091575 1091580) (-674 "MATRIX.spad" 1087565 1087575 1088049 1088076) (-673 "MATLIN.spad" 1084891 1084915 1087449 1087454) (-672 "MATCAT.spad" 1076476 1076498 1084859 1084886) (-671 "MATCAT.spad" 1067933 1067957 1076318 1076323) (-670 "MATCAT2.spad" 1067201 1067249 1067923 1067928) (-669 "MAPPKG3.spad" 1066100 1066114 1067191 1067196) (-668 "MAPPKG2.spad" 1065434 1065446 1066090 1066095) (-667 "MAPPKG1.spad" 1064252 1064262 1065424 1065429) (-666 "MAPPAST.spad" 1063565 1063573 1064242 1064247) (-665 "MAPHACK3.spad" 1063373 1063387 1063555 1063560) (-664 "MAPHACK2.spad" 1063138 1063150 1063363 1063368) (-663 "MAPHACK1.spad" 1062768 1062778 1063128 1063133) (-662 "MAGMA.spad" 1060558 1060575 1062758 1062763) (-661 "MACROAST.spad" 1060137 1060145 1060548 1060553) (-660 "M3D.spad" 1057833 1057843 1059515 1059520) (-659 "LZSTAGG.spad" 1055061 1055071 1057823 1057828) (-658 "LZSTAGG.spad" 1052287 1052299 1055051 1055056) (-657 "LWORD.spad" 1048992 1049009 1052277 1052282) (-656 "LSTAST.spad" 1048776 1048784 1048982 1048987) (-655 "LSQM.spad" 1047002 1047016 1047400 1047451) (-654 "LSPP.spad" 1046535 1046552 1046992 1046997) (-653 "LSMP.spad" 1045375 1045403 1046525 1046530) (-652 "LSMP1.spad" 1043179 1043193 1045365 1045370) (-651 "LSAGG.spad" 1042848 1042858 1043147 1043174) (-650 "LSAGG.spad" 1042537 1042549 1042838 1042843) (-649 "LPOLY.spad" 1041491 1041510 1042393 1042462) (-648 "LPEFRAC.spad" 1040748 1040758 1041481 1041486) (-647 "LO.spad" 1040149 1040163 1040682 1040709) (-646 "LOGIC.spad" 1039751 1039759 1040139 1040144) (-645 "LOGIC.spad" 1039351 1039361 1039741 1039746) (-644 "LODOOPS.spad" 1038269 1038281 1039341 1039346) (-643 "LODO.spad" 1037653 1037669 1037949 1037988) (-642 "LODOF.spad" 1036697 1036714 1037610 1037615) (-641 "LODOCAT.spad" 1035355 1035365 1036653 1036692) (-640 "LODOCAT.spad" 1034011 1034023 1035311 1035316) (-639 "LODO2.spad" 1033284 1033296 1033691 1033730) (-638 "LODO1.spad" 1032684 1032694 1032964 1033003) (-637 "LODEEF.spad" 1031456 1031474 1032674 1032679) (-636 "LNAGG.spad" 1027258 1027268 1031446 1031451) (-635 "LNAGG.spad" 1023024 1023036 1027214 1027219) (-634 "LMOPS.spad" 1019760 1019777 1023014 1023019) (-633 "LMODULE.spad" 1019402 1019412 1019750 1019755) (-632 "LMDICT.spad" 1018685 1018695 1018953 1018980) (-631 "LITERAL.spad" 1018591 1018602 1018675 1018680) (-630 "LIST.spad" 1016309 1016319 1017738 1017765) (-629 "LIST3.spad" 1015600 1015614 1016299 1016304) (-628 "LIST2.spad" 1014240 1014252 1015590 1015595) (-627 "LIST2MAP.spad" 1011117 1011129 1014230 1014235) (-626 "LINEXP.spad" 1010549 1010559 1011097 1011112) (-625 "LINDEP.spad" 1009326 1009338 1010461 1010466) (-624 "LIMITRF.spad" 1007240 1007250 1009316 1009321) (-623 "LIMITPS.spad" 1006123 1006136 1007230 1007235) (-622 "LIE.spad" 1004137 1004149 1005413 1005558) (-621 "LIECAT.spad" 1003613 1003623 1004063 1004132) (-620 "LIECAT.spad" 1003117 1003129 1003569 1003574) (-619 "LIB.spad" 1001165 1001173 1001776 1001791) (-618 "LGROBP.spad" 998518 998537 1001155 1001160) (-617 "LF.spad" 997437 997453 998508 998513) (-616 "LFCAT.spad" 996456 996464 997427 997432) (-615 "LEXTRIPK.spad" 991959 991974 996446 996451) (-614 "LEXP.spad" 989962 989989 991939 991954) (-613 "LETAST.spad" 989661 989669 989952 989957) (-612 "LEADCDET.spad" 988045 988062 989651 989656) (-611 "LAZM3PK.spad" 986749 986771 988035 988040) (-610 "LAUPOL.spad" 985438 985451 986342 986411) (-609 "LAPLACE.spad" 985011 985027 985428 985433) (-608 "LA.spad" 984451 984465 984933 984972) (-607 "LALG.spad" 984227 984237 984431 984446) (-606 "LALG.spad" 984011 984023 984217 984222) (-605 "KVTFROM.spad" 983746 983756 984001 984006) (-604 "KTVLOGIC.spad" 983169 983177 983736 983741) (-603 "KRCFROM.spad" 982907 982917 983159 983164) (-602 "KOVACIC.spad" 981620 981637 982897 982902) (-601 "KONVERT.spad" 981342 981352 981610 981615) (-600 "KOERCE.spad" 981079 981089 981332 981337) (-599 "KERNEL.spad" 979614 979624 980863 980868) (-598 "KERNEL2.spad" 979317 979329 979604 979609) (-597 "KDAGG.spad" 978420 978442 979297 979312) (-596 "KDAGG.spad" 977531 977555 978410 978415) (-595 "KAFILE.spad" 976494 976510 976729 976756) (-594 "JORDAN.spad" 974321 974333 975784 975929) (-593 "JOINAST.spad" 974015 974023 974311 974316) (-592 "JAVACODE.spad" 973881 973889 974005 974010) (-591 "IXAGG.spad" 972004 972028 973871 973876) (-590 "IXAGG.spad" 969982 970008 971851 971856) (-589 "IVECTOR.spad" 968753 968768 968908 968935) (-588 "ITUPLE.spad" 967898 967908 968743 968748) (-587 "ITRIGMNP.spad" 966709 966728 967888 967893) (-586 "ITFUN3.spad" 966203 966217 966699 966704) (-585 "ITFUN2.spad" 965933 965945 966193 966198) (-584 "ITAYLOR.spad" 963725 963740 965769 965894) (-583 "ISUPS.spad" 956136 956151 962699 962796) (-582 "ISUMP.spad" 955633 955649 956126 956131) (-581 "ISTRING.spad" 954636 954649 954802 954829) (-580 "ISAST.spad" 954355 954363 954626 954631) (-579 "IRURPK.spad" 953068 953087 954345 954350) (-578 "IRSN.spad" 951028 951036 953058 953063) (-577 "IRRF2F.spad" 949503 949513 950984 950989) (-576 "IRREDFFX.spad" 949104 949115 949493 949498) (-575 "IROOT.spad" 947435 947445 949094 949099) (-574 "IR.spad" 945224 945238 947290 947317) (-573 "IR2.spad" 944244 944260 945214 945219) (-572 "IR2F.spad" 943444 943460 944234 944239) (-571 "IPRNTPK.spad" 943204 943212 943434 943439) (-570 "IPF.spad" 942769 942781 943009 943102) (-569 "IPADIC.spad" 942530 942556 942695 942764) (-568 "IP4ADDR.spad" 942078 942086 942520 942525) (-567 "IOMODE.spad" 941699 941707 942068 942073) (-566 "IOBFILE.spad" 941060 941068 941689 941694) (-565 "IOBCON.spad" 940925 940933 941050 941055) (-564 "INVLAPLA.spad" 940570 940586 940915 940920) (-563 "INTTR.spad" 933816 933833 940560 940565) (-562 "INTTOOLS.spad" 931527 931543 933390 933395) (-561 "INTSLPE.spad" 930833 930841 931517 931522) (-560 "INTRVL.spad" 930399 930409 930747 930828) (-559 "INTRF.spad" 928763 928777 930389 930394) (-558 "INTRET.spad" 928195 928205 928753 928758) (-557 "INTRAT.spad" 926870 926887 928185 928190) (-556 "INTPM.spad" 925233 925249 926513 926518) (-555 "INTPAF.spad" 923001 923019 925165 925170) (-554 "INTPACK.spad" 913311 913319 922991 922996) (-553 "INT.spad" 912672 912680 913165 913306) (-552 "INTHERTR.spad" 911938 911955 912662 912667) (-551 "INTHERAL.spad" 911604 911628 911928 911933) (-550 "INTHEORY.spad" 908017 908025 911594 911599) (-549 "INTG0.spad" 901480 901498 907949 907954) (-548 "INTFTBL.spad" 895509 895517 901470 901475) (-547 "INTFACT.spad" 894568 894578 895499 895504) (-546 "INTEF.spad" 892883 892899 894558 894563) (-545 "INTDOM.spad" 891498 891506 892809 892878) (-544 "INTDOM.spad" 890175 890185 891488 891493) (-543 "INTCAT.spad" 888428 888438 890089 890170) (-542 "INTBIT.spad" 887931 887939 888418 888423) (-541 "INTALG.spad" 887113 887140 887921 887926) (-540 "INTAF.spad" 886605 886621 887103 887108) (-539 "INTABL.spad" 885123 885154 885286 885313) (-538 "INS.spad" 882590 882598 885025 885118) (-537 "INS.spad" 880143 880153 882580 882585) (-536 "INPSIGN.spad" 879577 879590 880133 880138) (-535 "INPRODPF.spad" 878643 878662 879567 879572) (-534 "INPRODFF.spad" 877701 877725 878633 878638) (-533 "INNMFACT.spad" 876672 876689 877691 877696) (-532 "INMODGCD.spad" 876156 876186 876662 876667) (-531 "INFSP.spad" 874441 874463 876146 876151) (-530 "INFPROD0.spad" 873491 873510 874431 874436) (-529 "INFORM.spad" 870652 870660 873481 873486) (-528 "INFORM1.spad" 870277 870287 870642 870647) (-527 "INFINITY.spad" 869829 869837 870267 870272) (-526 "INETCLTS.spad" 869806 869814 869819 869824) (-525 "INEP.spad" 868338 868360 869796 869801) (-524 "INDE.spad" 868067 868084 868328 868333) (-523 "INCRMAPS.spad" 867488 867498 868057 868062) (-522 "INBFILE.spad" 866560 866568 867478 867483) (-521 "INBFF.spad" 862330 862341 866550 866555) (-520 "INBCON.spad" 861629 861637 862320 862325) (-519 "INBCON.spad" 860926 860936 861619 861624) (-518 "INAST.spad" 860591 860599 860916 860921) (-517 "IMPTAST.spad" 860299 860307 860581 860586) (-516 "IMATRIX.spad" 859244 859270 859756 859783) (-515 "IMATQF.spad" 858338 858382 859200 859205) (-514 "IMATLIN.spad" 856943 856967 858294 858299) (-513 "ILIST.spad" 855599 855614 856126 856153) (-512 "IIARRAY2.spad" 854987 855025 855206 855233) (-511 "IFF.spad" 854397 854413 854668 854761) (-510 "IFAST.spad" 854011 854019 854387 854392) (-509 "IFARRAY.spad" 851498 851513 853194 853221) (-508 "IFAMON.spad" 851360 851377 851454 851459) (-507 "IEVALAB.spad" 850749 850761 851350 851355) (-506 "IEVALAB.spad" 850136 850150 850739 850744) (-505 "IDPO.spad" 849934 849946 850126 850131) (-504 "IDPOAMS.spad" 849690 849702 849924 849929) (-503 "IDPOAM.spad" 849410 849422 849680 849685) (-502 "IDPC.spad" 848344 848356 849400 849405) (-501 "IDPAM.spad" 848089 848101 848334 848339) (-500 "IDPAG.spad" 847836 847848 848079 848084) (-499 "IDENT.spad" 847753 847761 847826 847831) (-498 "IDECOMP.spad" 844990 845008 847743 847748) (-497 "IDEAL.spad" 839913 839952 844925 844930) (-496 "ICDEN.spad" 839064 839080 839903 839908) (-495 "ICARD.spad" 838253 838261 839054 839059) (-494 "IBPTOOLS.spad" 836846 836863 838243 838248) (-493 "IBITS.spad" 836045 836058 836482 836509) (-492 "IBATOOL.spad" 832920 832939 836035 836040) (-491 "IBACHIN.spad" 831407 831422 832910 832915) (-490 "IARRAY2.spad" 830395 830421 831014 831041) (-489 "IARRAY1.spad" 829440 829455 829578 829605) (-488 "IAN.spad" 827653 827661 829256 829349) (-487 "IALGFACT.spad" 827254 827287 827643 827648) (-486 "HYPCAT.spad" 826678 826686 827244 827249) (-485 "HYPCAT.spad" 826100 826110 826668 826673) (-484 "HOSTNAME.spad" 825908 825916 826090 826095) (-483 "HOMOTOP.spad" 825651 825661 825898 825903) (-482 "HOAGG.spad" 822919 822929 825641 825646) (-481 "HOAGG.spad" 819962 819974 822686 822691) (-480 "HEXADEC.spad" 818064 818072 818429 818522) (-479 "HEUGCD.spad" 817079 817090 818054 818059) (-478 "HELLFDIV.spad" 816669 816693 817069 817074) (-477 "HEAP.spad" 816061 816071 816276 816303) (-476 "HEADAST.spad" 815592 815600 816051 816056) (-475 "HDP.spad" 805435 805451 805812 805943) (-474 "HDMP.spad" 802611 802626 803229 803356) (-473 "HB.spad" 800848 800856 802601 802606) (-472 "HASHTBL.spad" 799318 799349 799529 799556) (-471 "HASAST.spad" 799034 799042 799308 799313) (-470 "HACKPI.spad" 798517 798525 798936 799029) (-469 "GTSET.spad" 797456 797472 798163 798190) (-468 "GSTBL.spad" 795975 796010 796149 796164) (-467 "GSERIES.spad" 793142 793169 794107 794256) (-466 "GROUP.spad" 792411 792419 793122 793137) (-465 "GROUP.spad" 791688 791698 792401 792406) (-464 "GROEBSOL.spad" 790176 790197 791678 791683) (-463 "GRMOD.spad" 788747 788759 790166 790171) (-462 "GRMOD.spad" 787316 787330 788737 788742) (-461 "GRIMAGE.spad" 779921 779929 787306 787311) (-460 "GRDEF.spad" 778300 778308 779911 779916) (-459 "GRAY.spad" 776759 776767 778290 778295) (-458 "GRALG.spad" 775806 775818 776749 776754) (-457 "GRALG.spad" 774851 774865 775796 775801) (-456 "GPOLSET.spad" 774305 774328 774533 774560) (-455 "GOSPER.spad" 773570 773588 774295 774300) (-454 "GMODPOL.spad" 772708 772735 773538 773565) (-453 "GHENSEL.spad" 771777 771791 772698 772703) (-452 "GENUPS.spad" 767878 767891 771767 771772) (-451 "GENUFACT.spad" 767455 767465 767868 767873) (-450 "GENPGCD.spad" 767039 767056 767445 767450) (-449 "GENMFACT.spad" 766491 766510 767029 767034) (-448 "GENEEZ.spad" 764430 764443 766481 766486) (-447 "GDMP.spad" 761448 761465 762224 762351) (-446 "GCNAALG.spad" 755343 755370 761242 761309) (-445 "GCDDOM.spad" 754515 754523 755269 755338) (-444 "GCDDOM.spad" 753749 753759 754505 754510) (-443 "GB.spad" 751267 751305 753705 753710) (-442 "GBINTERN.spad" 747287 747325 751257 751262) (-441 "GBF.spad" 743044 743082 747277 747282) (-440 "GBEUCLID.spad" 740918 740956 743034 743039) (-439 "GAUSSFAC.spad" 740215 740223 740908 740913) (-438 "GALUTIL.spad" 738537 738547 740171 740176) (-437 "GALPOLYU.spad" 736983 736996 738527 738532) (-436 "GALFACTU.spad" 735148 735167 736973 736978) (-435 "GALFACT.spad" 725281 725292 735138 735143) (-434 "FVFUN.spad" 722304 722312 725271 725276) (-433 "FVC.spad" 721356 721364 722294 722299) (-432 "FUNCTION.spad" 721205 721217 721346 721351) (-431 "FT.spad" 719498 719506 721195 721200) (-430 "FTEM.spad" 718661 718669 719488 719493) (-429 "FSUPFACT.spad" 717561 717580 718597 718602) (-428 "FST.spad" 715647 715655 717551 717556) (-427 "FSRED.spad" 715125 715141 715637 715642) (-426 "FSPRMELT.spad" 713949 713965 715082 715087) (-425 "FSPECF.spad" 712026 712042 713939 713944) (-424 "FS.spad" 706088 706098 711801 712021) (-423 "FS.spad" 699928 699940 705643 705648) (-422 "FSINT.spad" 699586 699602 699918 699923) (-421 "FSERIES.spad" 698773 698785 699406 699505) (-420 "FSCINT.spad" 698086 698102 698763 698768) (-419 "FSAGG.spad" 697203 697213 698042 698081) (-418 "FSAGG.spad" 696282 696294 697123 697128) (-417 "FSAGG2.spad" 694981 694997 696272 696277) (-416 "FS2UPS.spad" 689464 689498 694971 694976) (-415 "FS2.spad" 689109 689125 689454 689459) (-414 "FS2EXPXP.spad" 688232 688255 689099 689104) (-413 "FRUTIL.spad" 687174 687184 688222 688227) (-412 "FR.spad" 680868 680878 686198 686267) (-411 "FRNAALG.spad" 675955 675965 680810 680863) (-410 "FRNAALG.spad" 671054 671066 675911 675916) (-409 "FRNAAF2.spad" 670508 670526 671044 671049) (-408 "FRMOD.spad" 669902 669932 670439 670444) (-407 "FRIDEAL.spad" 669097 669118 669882 669897) (-406 "FRIDEAL2.spad" 668699 668731 669087 669092) (-405 "FRETRCT.spad" 668210 668220 668689 668694) (-404 "FRETRCT.spad" 667587 667599 668068 668073) (-403 "FRAMALG.spad" 665915 665928 667543 667582) (-402 "FRAMALG.spad" 664275 664290 665905 665910) (-401 "FRAC.spad" 661374 661384 661777 661950) (-400 "FRAC2.spad" 660977 660989 661364 661369) (-399 "FR2.spad" 660311 660323 660967 660972) (-398 "FPS.spad" 657120 657128 660201 660306) (-397 "FPS.spad" 653957 653967 657040 657045) (-396 "FPC.spad" 652999 653007 653859 653952) (-395 "FPC.spad" 652127 652137 652989 652994) (-394 "FPATMAB.spad" 651889 651899 652117 652122) (-393 "FPARFRAC.spad" 650362 650379 651879 651884) (-392 "FORTRAN.spad" 648868 648911 650352 650357) (-391 "FORT.spad" 647797 647805 648858 648863) (-390 "FORTFN.spad" 644967 644975 647787 647792) (-389 "FORTCAT.spad" 644651 644659 644957 644962) (-388 "FORMULA.spad" 642115 642123 644641 644646) (-387 "FORMULA1.spad" 641594 641604 642105 642110) (-386 "FORDER.spad" 641285 641309 641584 641589) (-385 "FOP.spad" 640486 640494 641275 641280) (-384 "FNLA.spad" 639910 639932 640454 640481) (-383 "FNCAT.spad" 638497 638505 639900 639905) (-382 "FNAME.spad" 638389 638397 638487 638492) (-381 "FMTC.spad" 638187 638195 638315 638384) (-380 "FMONOID.spad" 635242 635252 638143 638148) (-379 "FM.spad" 634937 634949 635176 635203) (-378 "FMFUN.spad" 631967 631975 634927 634932) (-377 "FMC.spad" 631019 631027 631957 631962) (-376 "FMCAT.spad" 628673 628691 630987 631014) (-375 "FM1.spad" 628030 628042 628607 628634) (-374 "FLOATRP.spad" 625751 625765 628020 628025) (-373 "FLOAT.spad" 619039 619047 625617 625746) (-372 "FLOATCP.spad" 616456 616470 619029 619034) (-371 "FLINEXP.spad" 616168 616178 616436 616451) (-370 "FLINEXP.spad" 615834 615846 616104 616109) (-369 "FLASORT.spad" 615154 615166 615824 615829) (-368 "FLALG.spad" 612800 612819 615080 615149) (-367 "FLAGG.spad" 609818 609828 612780 612795) (-366 "FLAGG.spad" 606737 606749 609701 609706) (-365 "FLAGG2.spad" 605418 605434 606727 606732) (-364 "FINRALG.spad" 603447 603460 605374 605413) (-363 "FINRALG.spad" 601402 601417 603331 603336) (-362 "FINITE.spad" 600554 600562 601392 601397) (-361 "FINAALG.spad" 589535 589545 600496 600549) (-360 "FINAALG.spad" 578528 578540 589491 589496) (-359 "FILE.spad" 578111 578121 578518 578523) (-358 "FILECAT.spad" 576629 576646 578101 578106) (-357 "FIELD.spad" 576035 576043 576531 576624) (-356 "FIELD.spad" 575527 575537 576025 576030) (-355 "FGROUP.spad" 574136 574146 575507 575522) (-354 "FGLMICPK.spad" 572923 572938 574126 574131) (-353 "FFX.spad" 572298 572313 572639 572732) (-352 "FFSLPE.spad" 571787 571808 572288 572293) (-351 "FFPOLY.spad" 563039 563050 571777 571782) (-350 "FFPOLY2.spad" 562099 562116 563029 563034) (-349 "FFP.spad" 561496 561516 561815 561908) (-348 "FF.spad" 560944 560960 561177 561270) (-347 "FFNBX.spad" 559456 559476 560660 560753) (-346 "FFNBP.spad" 557969 557986 559172 559265) (-345 "FFNB.spad" 556434 556455 557650 557743) (-344 "FFINTBAS.spad" 553848 553867 556424 556429) (-343 "FFIELDC.spad" 551423 551431 553750 553843) (-342 "FFIELDC.spad" 549084 549094 551413 551418) (-341 "FFHOM.spad" 547832 547849 549074 549079) (-340 "FFF.spad" 545267 545278 547822 547827) (-339 "FFCGX.spad" 544114 544134 544983 545076) (-338 "FFCGP.spad" 543003 543023 543830 543923) (-337 "FFCG.spad" 541795 541816 542684 542777) (-336 "FFCAT.spad" 534822 534844 541634 541790) (-335 "FFCAT.spad" 527928 527952 534742 534747) (-334 "FFCAT2.spad" 527673 527713 527918 527923) (-333 "FEXPR.spad" 519382 519428 527429 527468) (-332 "FEVALAB.spad" 519088 519098 519372 519377) (-331 "FEVALAB.spad" 518579 518591 518865 518870) (-330 "FDIV.spad" 518021 518045 518569 518574) (-329 "FDIVCAT.spad" 516063 516087 518011 518016) (-328 "FDIVCAT.spad" 514103 514129 516053 516058) (-327 "FDIV2.spad" 513757 513797 514093 514098) (-326 "FCPAK1.spad" 512310 512318 513747 513752) (-325 "FCOMP.spad" 511689 511699 512300 512305) (-324 "FC.spad" 501604 501612 511679 511684) (-323 "FAXF.spad" 494539 494553 501506 501599) (-322 "FAXF.spad" 487526 487542 494495 494500) (-321 "FARRAY.spad" 485672 485682 486709 486736) (-320 "FAMR.spad" 483792 483804 485570 485667) (-319 "FAMR.spad" 481896 481910 483676 483681) (-318 "FAMONOID.spad" 481546 481556 481850 481855) (-317 "FAMONC.spad" 479768 479780 481536 481541) (-316 "FAGROUP.spad" 479374 479384 479664 479691) (-315 "FACUTIL.spad" 477570 477587 479364 479369) (-314 "FACTFUNC.spad" 476746 476756 477560 477565) (-313 "EXPUPXS.spad" 473579 473602 474878 475027) (-312 "EXPRTUBE.spad" 470807 470815 473569 473574) (-311 "EXPRODE.spad" 467679 467695 470797 470802) (-310 "EXPR.spad" 462954 462964 463668 464075) (-309 "EXPR2UPS.spad" 459046 459059 462944 462949) (-308 "EXPR2.spad" 458749 458761 459036 459041) (-307 "EXPEXPAN.spad" 455687 455712 456321 456414) (-306 "EXIT.spad" 455358 455366 455677 455682) (-305 "EXITAST.spad" 455094 455102 455348 455353) (-304 "EVALCYC.spad" 454552 454566 455084 455089) (-303 "EVALAB.spad" 454116 454126 454542 454547) (-302 "EVALAB.spad" 453678 453690 454106 454111) (-301 "EUCDOM.spad" 451220 451228 453604 453673) (-300 "EUCDOM.spad" 448824 448834 451210 451215) (-299 "ESTOOLS.spad" 440664 440672 448814 448819) (-298 "ESTOOLS2.spad" 440265 440279 440654 440659) (-297 "ESTOOLS1.spad" 439950 439961 440255 440260) (-296 "ES.spad" 432497 432505 439940 439945) (-295 "ES.spad" 424950 424960 432395 432400) (-294 "ESCONT.spad" 421723 421731 424940 424945) (-293 "ESCONT1.spad" 421472 421484 421713 421718) (-292 "ES2.spad" 420967 420983 421462 421467) (-291 "ES1.spad" 420533 420549 420957 420962) (-290 "ERROR.spad" 417854 417862 420523 420528) (-289 "EQTBL.spad" 416326 416348 416535 416562) (-288 "EQ.spad" 411200 411210 413999 414111) (-287 "EQ2.spad" 410916 410928 411190 411195) (-286 "EP.spad" 407230 407240 410906 410911) (-285 "ENV.spad" 405932 405940 407220 407225) (-284 "ENTIRER.spad" 405600 405608 405876 405927) (-283 "EMR.spad" 404801 404842 405526 405595) (-282 "ELTAGG.spad" 403041 403060 404791 404796) (-281 "ELTAGG.spad" 401245 401266 402997 403002) (-280 "ELTAB.spad" 400692 400710 401235 401240) (-279 "ELFUTS.spad" 400071 400090 400682 400687) (-278 "ELEMFUN.spad" 399760 399768 400061 400066) (-277 "ELEMFUN.spad" 399447 399457 399750 399755) (-276 "ELAGG.spad" 397390 397400 399427 399442) (-275 "ELAGG.spad" 395270 395282 397309 397314) (-274 "ELABEXPR.spad" 394201 394209 395260 395265) (-273 "EFUPXS.spad" 390977 391007 394157 394162) (-272 "EFULS.spad" 387813 387836 390933 390938) (-271 "EFSTRUC.spad" 385768 385784 387803 387808) (-270 "EF.spad" 380534 380550 385758 385763) (-269 "EAB.spad" 378810 378818 380524 380529) (-268 "E04UCFA.spad" 378346 378354 378800 378805) (-267 "E04NAFA.spad" 377923 377931 378336 378341) (-266 "E04MBFA.spad" 377503 377511 377913 377918) (-265 "E04JAFA.spad" 377039 377047 377493 377498) (-264 "E04GCFA.spad" 376575 376583 377029 377034) (-263 "E04FDFA.spad" 376111 376119 376565 376570) (-262 "E04DGFA.spad" 375647 375655 376101 376106) (-261 "E04AGNT.spad" 371489 371497 375637 375642) (-260 "DVARCAT.spad" 368174 368184 371479 371484) (-259 "DVARCAT.spad" 364857 364869 368164 368169) (-258 "DSMP.spad" 362288 362302 362593 362720) (-257 "DROPT.spad" 356233 356241 362278 362283) (-256 "DROPT1.spad" 355896 355906 356223 356228) (-255 "DROPT0.spad" 350723 350731 355886 355891) (-254 "DRAWPT.spad" 348878 348886 350713 350718) (-253 "DRAW.spad" 341478 341491 348868 348873) (-252 "DRAWHACK.spad" 340786 340796 341468 341473) (-251 "DRAWCX.spad" 338228 338236 340776 340781) (-250 "DRAWCURV.spad" 337765 337780 338218 338223) (-249 "DRAWCFUN.spad" 326937 326945 337755 337760) (-248 "DQAGG.spad" 325105 325115 326905 326932) (-247 "DPOLCAT.spad" 320446 320462 324973 325100) (-246 "DPOLCAT.spad" 315873 315891 320402 320407) (-245 "DPMO.spad" 308099 308115 308237 308538) (-244 "DPMM.spad" 300338 300356 300463 300764) (-243 "DOMAIN.spad" 299609 299617 300328 300333) (-242 "DMP.spad" 296831 296846 297403 297530) (-241 "DLP.spad" 296179 296189 296821 296826) (-240 "DLIST.spad" 294758 294768 295362 295389) (-239 "DLAGG.spad" 293169 293179 294748 294753) (-238 "DIVRING.spad" 292711 292719 293113 293164) (-237 "DIVRING.spad" 292297 292307 292701 292706) (-236 "DISPLAY.spad" 290477 290485 292287 292292) (-235 "DIRPROD.spad" 280057 280073 280697 280828) (-234 "DIRPROD2.spad" 278865 278883 280047 280052) (-233 "DIRPCAT.spad" 277807 277823 278729 278860) (-232 "DIRPCAT.spad" 276478 276496 277402 277407) (-231 "DIOSP.spad" 275303 275311 276468 276473) (-230 "DIOPS.spad" 274287 274297 275283 275298) (-229 "DIOPS.spad" 273245 273257 274243 274248) (-228 "DIFRING.spad" 272537 272545 273225 273240) (-227 "DIFRING.spad" 271837 271847 272527 272532) (-226 "DIFEXT.spad" 270996 271006 271817 271832) (-225 "DIFEXT.spad" 270072 270084 270895 270900) (-224 "DIAGG.spad" 269702 269712 270052 270067) (-223 "DIAGG.spad" 269340 269352 269692 269697) (-222 "DHMATRIX.spad" 267644 267654 268797 268824) (-221 "DFSFUN.spad" 261052 261060 267634 267639) (-220 "DFLOAT.spad" 257773 257781 260942 261047) (-219 "DFINTTLS.spad" 255982 255998 257763 257768) (-218 "DERHAM.spad" 253892 253924 255962 255977) (-217 "DEQUEUE.spad" 253210 253220 253499 253526) (-216 "DEGRED.spad" 252825 252839 253200 253205) (-215 "DEFINTRF.spad" 250350 250360 252815 252820) (-214 "DEFINTEF.spad" 248846 248862 250340 250345) (-213 "DEFAST.spad" 248214 248222 248836 248841) (-212 "DECIMAL.spad" 246320 246328 246681 246774) (-211 "DDFACT.spad" 244119 244136 246310 246315) (-210 "DBLRESP.spad" 243717 243741 244109 244114) (-209 "DBASE.spad" 242371 242381 243707 243712) (-208 "DATAARY.spad" 241833 241846 242361 242366) (-207 "D03FAFA.spad" 241661 241669 241823 241828) (-206 "D03EEFA.spad" 241481 241489 241651 241656) (-205 "D03AGNT.spad" 240561 240569 241471 241476) (-204 "D02EJFA.spad" 240023 240031 240551 240556) (-203 "D02CJFA.spad" 239501 239509 240013 240018) (-202 "D02BHFA.spad" 238991 238999 239491 239496) (-201 "D02BBFA.spad" 238481 238489 238981 238986) (-200 "D02AGNT.spad" 233285 233293 238471 238476) (-199 "D01WGTS.spad" 231604 231612 233275 233280) (-198 "D01TRNS.spad" 231581 231589 231594 231599) (-197 "D01GBFA.spad" 231103 231111 231571 231576) (-196 "D01FCFA.spad" 230625 230633 231093 231098) (-195 "D01ASFA.spad" 230093 230101 230615 230620) (-194 "D01AQFA.spad" 229539 229547 230083 230088) (-193 "D01APFA.spad" 228963 228971 229529 229534) (-192 "D01ANFA.spad" 228457 228465 228953 228958) (-191 "D01AMFA.spad" 227967 227975 228447 228452) (-190 "D01ALFA.spad" 227507 227515 227957 227962) (-189 "D01AKFA.spad" 227033 227041 227497 227502) (-188 "D01AJFA.spad" 226556 226564 227023 227028) (-187 "D01AGNT.spad" 222615 222623 226546 226551) (-186 "CYCLOTOM.spad" 222121 222129 222605 222610) (-185 "CYCLES.spad" 218953 218961 222111 222116) (-184 "CVMP.spad" 218370 218380 218943 218948) (-183 "CTRIGMNP.spad" 216860 216876 218360 218365) (-182 "CTOR.spad" 216303 216311 216850 216855) (-181 "CTORKIND.spad" 215918 215926 216293 216298) (-180 "CTORCALL.spad" 215506 215514 215908 215913) (-179 "CSTTOOLS.spad" 214749 214762 215496 215501) (-178 "CRFP.spad" 208453 208466 214739 214744) (-177 "CRCEAST.spad" 208173 208181 208443 208448) (-176 "CRAPACK.spad" 207216 207226 208163 208168) (-175 "CPMATCH.spad" 206716 206731 207141 207146) (-174 "CPIMA.spad" 206421 206440 206706 206711) (-173 "COORDSYS.spad" 201314 201324 206411 206416) (-172 "CONTOUR.spad" 200716 200724 201304 201309) (-171 "CONTFRAC.spad" 196328 196338 200618 200711) (-170 "CONDUIT.spad" 196086 196094 196318 196323) (-169 "COMRING.spad" 195760 195768 196024 196081) (-168 "COMPPROP.spad" 195274 195282 195750 195755) (-167 "COMPLPAT.spad" 195041 195056 195264 195269) (-166 "COMPLEX.spad" 189077 189087 189321 189570) (-165 "COMPLEX2.spad" 188790 188802 189067 189072) (-164 "COMPFACT.spad" 188392 188406 188780 188785) (-163 "COMPCAT.spad" 186530 186540 188138 188387) (-162 "COMPCAT.spad" 184349 184361 185959 185964) (-161 "COMMUPC.spad" 184095 184113 184339 184344) (-160 "COMMONOP.spad" 183628 183636 184085 184090) (-159 "COMM.spad" 183437 183445 183618 183623) (-158 "COMMAAST.spad" 183200 183208 183427 183432) (-157 "COMBOPC.spad" 182105 182113 183190 183195) (-156 "COMBINAT.spad" 180850 180860 182095 182100) (-155 "COMBF.spad" 178218 178234 180840 180845) (-154 "COLOR.spad" 177055 177063 178208 178213) (-153 "COLONAST.spad" 176721 176729 177045 177050) (-152 "CMPLXRT.spad" 176430 176447 176711 176716) (-151 "CLLCTAST.spad" 176092 176100 176420 176425) (-150 "CLIP.spad" 172184 172192 176082 176087) (-149 "CLIF.spad" 170823 170839 172140 172179) (-148 "CLAGG.spad" 167308 167318 170813 170818) (-147 "CLAGG.spad" 163664 163676 167171 167176) (-146 "CINTSLPE.spad" 162989 163002 163654 163659) (-145 "CHVAR.spad" 161067 161089 162979 162984) (-144 "CHARZ.spad" 160982 160990 161047 161062) (-143 "CHARPOL.spad" 160490 160500 160972 160977) (-142 "CHARNZ.spad" 160243 160251 160470 160485) (-141 "CHAR.spad" 158111 158119 160233 160238) (-140 "CFCAT.spad" 157427 157435 158101 158106) (-139 "CDEN.spad" 156585 156599 157417 157422) (-138 "CCLASS.spad" 154734 154742 155996 156035) (-137 "CATEGORY.spad" 154513 154521 154724 154729) (-136 "CATAST.spad" 154140 154148 154503 154508) (-135 "CASEAST.spad" 153854 153862 154130 154135) (-134 "CARTEN.spad" 148957 148981 153844 153849) (-133 "CARTEN2.spad" 148343 148370 148947 148952) (-132 "CARD.spad" 145632 145640 148317 148338) (-131 "CAPSLAST.spad" 145406 145414 145622 145627) (-130 "CACHSET.spad" 145028 145036 145396 145401) (-129 "CABMON.spad" 144581 144589 145018 145023) (-128 "BYTE.spad" 143902 143910 144571 144576) (-127 "BYTEBUF.spad" 141724 141732 143071 143098) (-126 "BTREE.spad" 140793 140803 141331 141358) (-125 "BTOURN.spad" 139796 139806 140400 140427) (-124 "BTCAT.spad" 139184 139194 139764 139791) (-123 "BTCAT.spad" 138592 138604 139174 139179) (-122 "BTAGG.spad" 137714 137722 138560 138587) (-121 "BTAGG.spad" 136856 136866 137704 137709) (-120 "BSTREE.spad" 135591 135601 136463 136490) (-119 "BRILL.spad" 133786 133797 135581 135586) (-118 "BRAGG.spad" 132710 132720 133776 133781) (-117 "BRAGG.spad" 131598 131610 132666 132671) (-116 "BPADICRT.spad" 129579 129591 129834 129927) (-115 "BPADIC.spad" 129243 129255 129505 129574) (-114 "BOUNDZRO.spad" 128899 128916 129233 129238) (-113 "BOP.spad" 124363 124371 128889 128894) (-112 "BOP1.spad" 121749 121759 124319 124324) (-111 "BOOLEAN.spad" 121073 121081 121739 121744) (-110 "BMODULE.spad" 120785 120797 121041 121068) (-109 "BITS.spad" 120204 120212 120421 120448) (-108 "BINDING.spad" 119623 119631 120194 120199) (-107 "BINARY.spad" 117734 117742 118090 118183) (-106 "BGAGG.spad" 116931 116941 117714 117729) (-105 "BGAGG.spad" 116136 116148 116921 116926) (-104 "BFUNCT.spad" 115700 115708 116116 116131) (-103 "BEZOUT.spad" 114834 114861 115650 115655) (-102 "BBTREE.spad" 111653 111663 114441 114468) (-101 "BASTYPE.spad" 111325 111333 111643 111648) (-100 "BASTYPE.spad" 110995 111005 111315 111320) (-99 "BALFACT.spad" 110435 110447 110985 110990) (-98 "AUTOMOR.spad" 109882 109891 110415 110430) (-97 "ATTREG.spad" 106601 106608 109634 109877) (-96 "ATTRBUT.spad" 102624 102631 106581 106596) (-95 "ATTRAST.spad" 102341 102348 102614 102619) (-94 "ATRIG.spad" 101811 101818 102331 102336) (-93 "ATRIG.spad" 101279 101288 101801 101806) (-92 "ASTCAT.spad" 101183 101190 101269 101274) (-91 "ASTCAT.spad" 101085 101094 101173 101178) (-90 "ASTACK.spad" 100418 100427 100692 100719) (-89 "ASSOCEQ.spad" 99218 99229 100374 100379) (-88 "ASP9.spad" 98299 98312 99208 99213) (-87 "ASP8.spad" 97342 97355 98289 98294) (-86 "ASP80.spad" 96664 96677 97332 97337) (-85 "ASP7.spad" 95824 95837 96654 96659) (-84 "ASP78.spad" 95275 95288 95814 95819) (-83 "ASP77.spad" 94644 94657 95265 95270) (-82 "ASP74.spad" 93736 93749 94634 94639) (-81 "ASP73.spad" 93007 93020 93726 93731) (-80 "ASP6.spad" 91874 91887 92997 93002) (-79 "ASP55.spad" 90383 90396 91864 91869) (-78 "ASP50.spad" 88200 88213 90373 90378) (-77 "ASP4.spad" 87495 87508 88190 88195) (-76 "ASP49.spad" 86494 86507 87485 87490) (-75 "ASP42.spad" 84901 84940 86484 86489) (-74 "ASP41.spad" 83480 83519 84891 84896) (-73 "ASP35.spad" 82468 82481 83470 83475) (-72 "ASP34.spad" 81769 81782 82458 82463) (-71 "ASP33.spad" 81329 81342 81759 81764) (-70 "ASP31.spad" 80469 80482 81319 81324) (-69 "ASP30.spad" 79361 79374 80459 80464) (-68 "ASP29.spad" 78827 78840 79351 79356) (-67 "ASP28.spad" 70100 70113 78817 78822) (-66 "ASP27.spad" 68997 69010 70090 70095) (-65 "ASP24.spad" 68084 68097 68987 68992) (-64 "ASP20.spad" 67548 67561 68074 68079) (-63 "ASP1.spad" 66929 66942 67538 67543) (-62 "ASP19.spad" 61615 61628 66919 66924) (-61 "ASP12.spad" 61029 61042 61605 61610) (-60 "ASP10.spad" 60300 60313 61019 61024) (-59 "ARRAY2.spad" 59660 59669 59907 59934) (-58 "ARRAY1.spad" 58495 58504 58843 58870) (-57 "ARRAY12.spad" 57164 57175 58485 58490) (-56 "ARR2CAT.spad" 52826 52847 57132 57159) (-55 "ARR2CAT.spad" 48508 48531 52816 52821) (-54 "APPRULE.spad" 47752 47774 48498 48503) (-53 "APPLYORE.spad" 47367 47380 47742 47747) (-52 "ANY.spad" 45709 45716 47357 47362) (-51 "ANY1.spad" 44780 44789 45699 45704) (-50 "ANTISYM.spad" 43219 43235 44760 44775) (-49 "ANON.spad" 42916 42923 43209 43214) (-48 "AN.spad" 41217 41224 42732 42825) (-47 "AMR.spad" 39396 39407 41115 41212) (-46 "AMR.spad" 37412 37425 39133 39138) (-45 "ALIST.spad" 34824 34845 35174 35201) (-44 "ALGSC.spad" 33947 33973 34696 34749) (-43 "ALGPKG.spad" 29656 29667 33903 33908) (-42 "ALGMFACT.spad" 28845 28859 29646 29651) (-41 "ALGMANIP.spad" 26265 26280 28642 28647) (-40 "ALGFF.spad" 24580 24607 24797 24953) (-39 "ALGFACT.spad" 23701 23711 24570 24575) (-38 "ALGEBRA.spad" 23534 23543 23657 23696) (-37 "ALGEBRA.spad" 23399 23410 23524 23529) (-36 "ALAGG.spad" 22909 22930 23367 23394) (-35 "AHYP.spad" 22290 22297 22899 22904) (-34 "AGG.spad" 20599 20606 22280 22285) (-33 "AGG.spad" 18872 18881 20555 20560) (-32 "AF.spad" 17297 17312 18807 18812) (-31 "ADDAST.spad" 16975 16982 17287 17292) (-30 "ACPLOT.spad" 15546 15553 16965 16970) (-29 "ACFS.spad" 13297 13306 15448 15541) (-28 "ACFS.spad" 11134 11145 13287 13292) (-27 "ACF.spad" 7736 7743 11036 11129) (-26 "ACF.spad" 4424 4433 7726 7731) (-25 "ABELSG.spad" 3965 3972 4414 4419) (-24 "ABELSG.spad" 3504 3513 3955 3960) (-23 "ABELMON.spad" 3047 3054 3494 3499) (-22 "ABELMON.spad" 2588 2597 3037 3042) (-21 "ABELGRP.spad" 2160 2167 2578 2583) (-20 "ABELGRP.spad" 1730 1739 2150 2155) (-19 "A1AGG.spad" 870 879 1698 1725) (-18 "A1AGG.spad" 30 41 860 865))
\ No newline at end of file |