0`
478`\spad{additiveValuation} implies \spad{euclideanSize(a*b)=euclideanSize(a)+euclideanSize(b)}.
524`\spad{additiveValuation} implies \spad{euclideanSize(a*b)=euclideanSize(a)+euclideanSize(b)}.
572`\spad{additiveValuation} implies \spad{euclideanSize(a*b)=euclideanSize(a)+euclideanSize(b)}.
620`\spad{additiveValuation} implies \spad{euclideanSize(a*b)=euclideanSize(a)+euclideanSize(b)}.
668`\spad{additiveValuation} implies \spad{euclideanSize(a*b)=euclideanSize(a)+euclideanSize(b)}.
795`euclideanSize(a*b) = euclideanSize(a) + euclideanSize(\spad{b})
866`\spad{approximate} means "is an approximation to the real numbers".
983`\spad{arbitraryPrecision} means the user can set the precision for subsequent calculations.
1032`\spad{arbitraryPrecision} means the user can set the precision for subsequent calculations.
1081`\spad{arbitraryPrecision} means the user can set the precision for subsequent calculations.
1130`\spad{arbitraryPrecision} means the user can set the precision for subsequent calculations.
1179`\spad{arbitraryPrecision} means the user can set the precision for subsequent calculations.
1264`canonicalUnitNormal guarantees that the function unitCanonical returns the same representative for all associates of any particular element.
1436`canonicalUnitNormal guarantees that the function unitCanonical returns the same representative for all associates of any particular element.
1522`\spad{canonicalUnitNormal} is \spad{true} if we can choose a canonical representative for each class of associate elements,{} that is \spad{associates?(a,b)} returns \spad{true} if and only if \spad{unitCanonical(a) = unitCanonical(b)}.
1573`\spad{canonicalUnitNormal} is \spad{true} if we can choose a canonical representative for each class of associate elements,{} that is \spad{associates?(a,b)} returns \spad{true} if and only if \spad{unitCanonical(a) = unitCanonical(b)}.
1624`\spad{canonicalUnitNormal} is \spad{true} if we can choose a canonical representative for each class of associate elements,{} that is \spad{associates?(a,b)} returns \spad{true} if and only if \spad{unitCanonical(a) = unitCanonical(b)}.
1675`\spad{canonicalUnitNormal} is \spad{true} if we can choose a canonical representative for each class of associate elements,{} that is \spad{associates?(a,b)} returns \spad{true} if and only if \spad{unitCanonical(a) = unitCanonical(b)}.
1726`\spad{canonicalUnitNormal} is \spad{true} if we can choose a canonical representative for each class of associate elements,{} that is \spad{associates?(a,b)} returns \spad{true} if and only if \spad{unitCanonical(a) = unitCanonical(b)}.
1777`either 0 or 1.
1866`we can choose a unique representative for each associate class. This normalization is chosen to be normalization of leading coefficient (by default).
1955`\spad{canonical} is \spad{true} if and only if distinct elements have distinct data structures. For example,{} a domain of mathematical objects which has the \spad{canonical} attribute means that two objects are mathematically equal if and only if their data structures are equal.
1996`\spad{canonical} is \spad{true} if and only if distinct elements have distinct data structures. For example,{} a domain of mathematical objects which has the \spad{canonical} attribute means that two objects are mathematically equal if and only if their data structures are equal.
2037`\spad{canonical} is \spad{true} if and only if distinct elements have distinct data structures. For example,{} a domain of mathematical objects which has the \spad{canonical} attribute means that two objects are mathematically equal if and only if their data structures are equal.
2078`\spad{canonical} is \spad{true} if and only if distinct elements have distinct data structures. For example,{} a domain of mathematical objects which has the \spad{canonical} attribute means that two objects are mathematically equal if and only if their data structures are equal.
2119`\spad{canonical} is \spad{true} if and only if distinct elements have distinct data structures. For example,{} a domain of mathematical objects which has the \spad{canonical} attribute means that two objects are mathematically equal if and only if their data structures are equal.
2254`\spad{canonical} means that equal elements are in fact identical.
2373`mathematical equality is data structure equality.
2404`mathematical equality is data structure equality.
2440`\spad{canonical} means that mathematical equality is implied by data structure equality.
2477`\spad{canonicalsClosed} is \spad{true} if \spad{unitCanonical(a)*unitCanonical(b) = unitCanonical(a*b)}.
2525`\spad{canonicalsClosed} is \spad{true} if \spad{unitCanonical(a)*unitCanonical(b) = unitCanonical(a*b)}.
2573`\spad{canonicalsClosed} is \spad{true} if \spad{unitCanonical(a)*unitCanonical(b) = unitCanonical(a*b)}.
2621`\spad{canonicalsClosed} is \spad{true} if \spad{unitCanonical(a)*unitCanonical(b) = unitCanonical(a*b)}.
2669`\spad{canonicalsClosed} is \spad{true} if \spad{unitCanonical(a)*unitCanonical(b) = unitCanonical(a*b)}.
2717`since \spad{0*0=0},{} \spad{1*1=1}
2753`two positives multiply to give positive.
2791`two positives multiply to give positive.
2834`\spad{canonicalClosed} means two positives multiply to give positive.
2878`\spad{central} is \spad{true} if,{} given an algebra over a ring \spad{R},{} the image of \spad{R} is the center of the algebra,{} \spadignore{i.e.} the set of members of the algebra which commute with all others is precisely the image of \spad{R} in the algebra.
2917`\spad{central} is \spad{true} if,{} given an algebra over a ring \spad{R},{} the image of \spad{R} is the center of the algebra,{} \spadignore{i.e.} the set of members of the algebra which commute with all others is precisely the image of \spad{R} in the algebra.
2956`\spad{central} is \spad{true} if,{} given an algebra over a ring \spad{R},{} the image of \spad{R} is the center of the algebra,{} \spadignore{i.e.} the set of members of the algebra which commute with all others is precisely the image of \spad{R} in the algebra.
2995`\spad{central} is \spad{true} if,{} given an algebra over a ring \spad{R},{} the image of \spad{R} is the center of the algebra,{} \spadignore{i.e.} the set of members of the algebra which commute with all others is precisely the image of \spad{R} in the algebra.
3034`\spad{central} is \spad{true} if,{} given an algebra over a ring \spad{R},{} the image of \spad{R} is the center of the algebra,{} \spadignore{i.e.} the set of members of the algebra which commute with all others is precisely the image of \spad{R} in the algebra.
3073`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.
3141`\spad{commutative("*")} is \spad{true} if it has an operation \spad{"*": (D,D) -> D} which is commutative.
3189`\spad{commutative("*")} is \spad{true} if it has an operation \spad{"*": (D,D) -> D} which is commutative.
3237`\spad{commutative("*")} is \spad{true} if it has an operation \spad{"*": (D,D) -> D} which is commutative.
3285`\spad{commutative("*")} is \spad{true} if it has an operation \spad{"*": (D,D) -> D} which is commutative.
3333`\spad{commutative("*")} is \spad{true} if it has an operation \spad{"*": (D,D) -> D} which is commutative.
3381`multiplication is commutative.
3427`a domain \spad{D} has \spad{commutative("*")} if it has an operation \spad{"*": (D,D) -> D} which is commutative.
3472`\spad{commutative("*")} means multiplication is commutative : \spad{x*y = y*x}.
3521`\spad{commutative("*")} means multiplication is commutative : x*y = y*x
3567`indicates that \% has sqrt(\spad{-1})
3914`\spad{finiteAggregate} is \spad{true} if it is an aggregate with a finite number of elements.
3961`\spad{finiteAggregate} is \spad{true} if it is an aggregate with a finite number of elements.
4008`\spad{finiteAggregate} is \spad{true} if it is an aggregate with a finite number of elements.
4055`\spad{finiteAggregate} is \spad{true} if it is an aggregate with a finite number of elements.
4102`\spad{finiteAggregate} is \spad{true} if it is an aggregate with a finite number of elements.
4149`Binary trees have a finite number of components
4197`attribute to indicate an aggregate of finite size
4341`matrices are finite
4523`matrices are finite
4667`two-dimensional arrays are finite
4896`A ByteBuffer object is a finite aggregate
5117`nextItem never returns \spad{nothing}.
5147`\spad{leftUnitary} is \spad{true} if \spad{1 * x = x} for all \spad{x}.
5190`\spad{leftUnitary} is \spad{true} if \spad{1 * x = x} for all \spad{x}.
5233`\spad{leftUnitary} is \spad{true} if \spad{1 * x = x} for all \spad{x}.
5276`\spad{leftUnitary} is \spad{true} if \spad{1 * x = x} for all \spad{x}.
5319`\spad{leftUnitary} is \spad{true} if \spad{1 * x = x} for all \spad{x}.
5362`\spad{1 * x = x}
5396`\spad{multiplicativeValuation} implies \spad{euclideanSize(a*b)=euclideanSize(a)*euclideanSize(b)}.
5451`\spad{multiplicativeValuation} implies \spad{euclideanSize(a*b)=euclideanSize(a)*euclideanSize(b)}.
5506`\spad{multiplicativeValuation} implies \spad{euclideanSize(a*b)=euclideanSize(a)*euclideanSize(b)}.
5561`\spad{multiplicativeValuation} implies \spad{euclideanSize(a*b)=euclideanSize(a)*euclideanSize(b)}.
5616`\spad{multiplicativeValuation} implies \spad{euclideanSize(a*b)=euclideanSize(a)*euclideanSize(b)}.
5762`euclideanSize(a*b) returns \spad{euclideanSize(a)*euclideanSize(b)}.
5935`\spad{noZeroDivisors} is \spad{true} if \spad{x * y \~~= 0} implies both \spad{x} and \spad{y} are non-zero.
5981`\spad{noZeroDivisors} is \spad{true} if \spad{x * y \~~= 0} implies both \spad{x} and \spad{y} are non-zero.
6027`\spad{noZeroDivisors} is \spad{true} if \spad{x * y \~~= 0} implies both \spad{x} and \spad{y} are non-zero.
6073`\spad{noZeroDivisors} is \spad{true} if \spad{x * y \~~= 0} implies both \spad{x} and \spad{y} are non-zero.
6119`\spad{noZeroDivisors} is \spad{true} if \spad{x * y \~~= 0} implies both \spad{x} and \spad{y} are non-zero.
6165`if a product is zero then one of the factors must be zero.
6275`\spad{noetherian} is \spad{true} if all of its ideals are finitely generated.
6318`\spad{noetherian} is \spad{true} if all of its ideals are finitely generated.
6361`\spad{noetherian} is \spad{true} if all of its ideals are finitely generated.
6404`\spad{noetherian} is \spad{true} if all of its ideals are finitely generated.
6447`\spad{noetherian} is \spad{true} if all of its ideals are finitely generated.
6490`ascending chain condition on ideals.
6523`ascending chain condition on ideals.
6561`\spad{noetherian} all ideals are finitely generated (in fact principal).
6600`\spad{partiallyOrderedSet} is \spad{true} if a set with \spadop{<} which is transitive,{} but \spad{not(a < b or a = b)} does not necessarily imply \spad{b<a}.
6652`\spad{partiallyOrderedSet} is \spad{true} if a set with \spadop{<} which is transitive,{} but \spad{not(a < b or a = b)} does not necessarily imply \spad{b<a}.
6704`\spad{partiallyOrderedSet} is \spad{true} if a set with \spadop{<} which is transitive,{} but \spad{not(a < b or a = b)} does not necessarily imply \spad{b<a}.
6756`\spad{partiallyOrderedSet} is \spad{true} if a set with \spadop{<} which is transitive,{} but \spad{not(a < b or a = b)} does not necessarily imply \spad{b<a}.
6808`\spad{partiallyOrderedSet} is \spad{true} if a set with \spadop{<} which is transitive,{} but \spad{not(a < b or a = b)} does not necessarily imply \spad{b<a}.
6903`\spad{rightUnitary} is \spad{true} if \spad{x * 1 = x} for all \spad{x}.
6948`\spad{rightUnitary} is \spad{true} if \spad{x * 1 = x} for all \spad{x}.
6993`\spad{rightUnitary} is \spad{true} if \spad{x * 1 = x} for all \spad{x}.
7038`\spad{rightUnitary} is \spad{true} if \spad{x * 1 = x} for all \spad{x}.
7083`\spad{rightUnitary} is \spad{true} if \spad{x * 1 = x} for all \spad{x}.
7128`\spad{x * 1 = x}
7253`One may destructively alter TwoDimensionalArray's.
7304`\spad{shallowlyMutable} is \spad{true} if its values have immediate components that are updateable (mutable). Note: the properties of any component domain are irrevelant to the \spad{shallowlyMutable} proper.
7353`\spad{shallowlyMutable} is \spad{true} if its values have immediate components that are updateable (mutable). Note: the properties of any component domain are irrevelant to the \spad{shallowlyMutable} proper.
7402`\spad{shallowlyMutable} is \spad{true} if its values have immediate components that are updateable (mutable). Note: the properties of any component domain are irrevelant to the \spad{shallowlyMutable} proper.
7451`\spad{shallowlyMutable} is \spad{true} if its values have immediate components that are updateable (mutable). Note: the properties of any component domain are irrevelant to the \spad{shallowlyMutable} proper.
7500`\spad{shallowlyMutable} is \spad{true} if its values have immediate components that are updateable (mutable). Note: the properties of any component domain are irrevelant to the \spad{shallowlyMutable} proper.
7549`shallowlyMutable means that elements of bags may be destructively changed.
7593`Binary trees have updateable components
7696`One may destructively alter matrices
7847`one may destructively alter arrays
8076`one may destructively alter a stream by assigning new values to its entries.
8211`\spad{unitsKnown} is \spad{true} if a monoid (a multiplicative semigroup with a 1) has \spad{unitsKnown} means that the operation \spadfun{recip} can only return "failed" if its argument is not a unit.
8254`\spad{unitsKnown} is \spad{true} if a monoid (a multiplicative semigroup with a 1) has \spad{unitsKnown} means that the operation \spadfun{recip} can only return "failed" if its argument is not a unit.
8297`\spad{unitsKnown} is \spad{true} if a monoid (a multiplicative semigroup with a 1) has \spad{unitsKnown} means that the operation \spadfun{recip} can only return "failed" if its argument is not a unit.
8340`\spad{unitsKnown} is \spad{true} if a monoid (a multiplicative semigroup with a 1) has \spad{unitsKnown} means that the operation \spadfun{recip} can only return "failed" if its argument is not a unit.
8383`\spad{unitsKnown} is \spad{true} if a monoid (a multiplicative semigroup with a 1) has \spad{unitsKnown} means that the operation \spadfun{recip} can only return "failed" if its argument is not a unit.
8497`unitsKnown means that \spadfun{recip} truly yields reciprocal or \spad{"failed"} if not a unit,{} similarly for \spadfun{leftRecip} and \spadfun{rightRecip}. The reason is that we use left,{} respectively right,{} minimal polynomials to decide this question.
8575`unitsKnown asserts that recip only returns "failed" for non-units.
8606`recip truly yields reciprocal or "failed" if not a unit. Note: \spad{recip(0) = "failed"}.
8636`the invertible matrices are simply the matrices whose determinants are units in the Ring \spad{R}.
8742`The class of abelian groups,{} \spadignore{i.e.} additive monoids where each element has an additive inverse. \blankline
8788`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 supp
8788`--ort a useful common model for polynomials and power series. Conceptually at least,{} only the non-zero terms are ever operated on.
8865`The class of multiplicative monoids,{} \spadignore{i.e.} semigroups with an additive identity element. \blankline
8912`the class of all additive (commutative) semigroups,{} \spadignore{i.e.} a set with a commutative and associative operation \spadop{+}. \blankline
8961`This is the category of Spad abstract syntax trees.
9016`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 doma
9016`--in has a finite number of elements.
9055`The category of associative algebras (modules which are themselves rings). \blankline
9114`Model for algebraically closed fields.
9168`Model for algebraically closed function spaces.
9248`Category for the inverse hyperbolic trigonometric functions.
9308`Category for the inverse trigonometric functions.
9372`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.
9462`This category exports the attributes in the AXIOM Library
9512`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.
9563`\spadtype{BasicType} is the basic category for describing a collection of elements with \spadop{=} (equality).
9606`A \spadtype{BiModule} is both a left and right module with respect to potentially different rings. \blankline
9662`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
9725`\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.
9789`The bit aggregate category models aggregates representing large quantities of Boolean data.
9833`This is the category of Boolean logic structures.
9877`A cachable set is a set whose elements keep an integer as part of their structure.
9922`This is an \spadtype{AbelianMonoid} with the cancellation property,{} \spadignore{i.e.} \spad{ a+b = a+c => b=c }. This is formalised by the partial subtraction operator,{} which satisfies the axioms listed below: \blankline
9980`Rings of Characteristic Non Zero
10034`Rings of Characteristic Zero.
10084`A is coercible from \spad{B} iff any element of domain \spad{B} can be automically converted into an element of domain A.
10138`A is coercible to \spad{B} means any element of A can automatically be converted into an element of \spad{B} by the interpreter.
10189`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.
10238`Category for the usual combinatorial functions.
10299`CombinatorialOpsCategory is the category obtaining by adjoining summations and products to the usual combinatorial operations.
10357`The category of commutative rings with unity,{} \spadignore{i.e.} rings where \spadop{*} is commutative,{} and which have a multiplicative identity. element.
10406`This category represents the extension of a ring by a square root of \spad{-1}.
10473`This category is the root of the I/O conduits.
10514`This category declares basic operations on all constructors.
10567`A is convertible from \spad{B} iff any element of domain \spad{B} can be explicitly converted into an element of domain A.
10623`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.
10677`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.
10732`This category is a collection of operations common to both categories \spadtype{Dictionary} and \spadtype{MultiDictionary}
10798`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.
10854`This category captures the interface of domains with a distinguished operation named \spad{differentiate}. Usually,{} additional properties are wanted. For example,{} that it obeys the usual Leibniz identity of differentiation of product,{} in case of differential rings. One could also want \spad{differentiate} to obey the chain rule when considering differential manifolds. The lack of specific requirement in this category is an implicit admis
10854`--sion that currently \Language{} is not expressive enough to express the most general notion of differentiation in an adequate manner,{} suitable for computational purposes.
10913`Differential extensions of a ring \spad{R}. Given a differentiation on \spad{R},{} extend it to a differentiation on \%.
10974`Category of modules that extend differential rings. \blankline
11040`An \spad{R}-module equipped with a distinguised differential operator. If \spad{R} is a differential ring,{} then differentiation on the module should extend differentiation on the differential ring \spad{R}. The latter can be the null operator. In that case,{} the differentiation operator on the module is just an \spad{R}-linear operator. For that reason,{} we do not require that the ring \spad{R} be a DifferentialRing; \blankline
11099`\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 differ
11099`--ential 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 derivati
11099`--ves 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
11245`An ordinary differential ring,{} that is,{} a ring with an operation \spadfun{differentiate}. \blankline
11295`Extension of a base differential space with a derivation. \blankline
11360`This category is like \spadtype{DifferentialDomain} where the target of the differentiation operator is the same as its source.
11411`\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{
11411`--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 
11411`--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 deriva
11411`--tive 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,{}
11411`-- 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.
11486`\indented{2}{This category represents a finite cartesian product of a given type.} Many categorical properties are preserved under this construction.
11571`A division ring (sometimes called a skew field),{} \spadignore{i.e.} a not necessarily commutative ring where all non-zero elements have multiplicative inverses.
11617`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.
11677`Category for the elementary functions.
11737`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}.
11810`An eltable over domains \spad{S} and \spad{T} is a structure which can be viewed as a function from \spad{S} to \spad{T}. Examples of eltable structures range from data structures,{} \spadignore{e.g.} those of type \spadtype{List},{} to algebraic structures,{} \spadignore{e.g.} \spadtype{Polynomial}.
11863`Entire Rings (non-commutative Integral Domains),{} \spadignore{i.e.} a ring not necessarily commutative which has no zero divisors. \blankline
11907`A constructive euclidean domain,{} \spadignore{i.e.} one can divide producing a quotient and a remainder where the remainder is either zero or is smaller (\spadfun{euclideanSize}) than the divisor. \blankline Conditional attributes: \indented{2}{multiplicativeValuation\tab{25}\spad{Size(a*b)=Size(a)*Size(b)}} \indented{2}{additiveValuation\tab{25}\spad{Size(a*b)=Size(a)+Size(b)}}
11955`This category provides \spadfun{eval} operations. A domain may belong to this category if it is possible to make ``evaluation'' substitutions.
12010`An expression space is a set which is closed under certain operators.
12054`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.
12118`ExtensionField {\em F} is the category of fields which extend the field \spad{F}
12169`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.
12225`The category of commutative fields,{} \spadignore{i.e.} commutative rings where all non-zero elements have multiplicative inverses. The \spadfun{factor} operation while trivial is useful to have defined. \blankline
12262`This category provides an interface to operate on files in the computer's file system. The precise method of naming files is determined by the Name parameter. The type of the contents of the file is determined by \spad{S}.
12339`This category provides an interface to names in the file system.
12387`This category is similar to AbelianMonoidRing,{} except that the sum is assumed to be finite. It is a useful model for polynomials,{} but is somewhat more general.
12471`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
12471`-- 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 \spad
12471`--fun{linearAssociatedExp} is defined completely by its action on monomials from {\em F[X]}: \spadfun{linearAssociatedExp}(a,{}monomial(1,{}\spad{k})\$SUP(\spad{F})) is defined to be \spadfun{Frobenius}(a,{}\spad{k}) which is {\em a**(q**k)} where {\em q=size()\$F}. The operations order and discreteLog associated with the multiplicative exponentiation have additive analogues associated to the operation \spadfun{linearAssociatedExp}. These are the functions \spadfun{linearAssociatedOrder} and \sp
12471`--adfun{linearAssociatedLog},{} respectively.
12539`This category describes finite rational divisors on a curve,{} that is finite formal sums SUM(\spad{n} * \spad{P}) where the \spad{n}'s are integers and the \spad{P}'s are finite rational points on the curve.
12730`FiniteFieldCategory is the category of finite fields
12783`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.
12843`A FiniteRankAlgebra is an algebra over a commutative ring \spad{R} which is a free \spad{R}-module of finite rank.
12949`A FiniteRankNonAssociativeAlgebra is a non associative algebra over a commutative ring \spad{R} which is a free \spad{R}-module of finite rank.
13032`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.
13096`The category of domains composed of a finite set of elements. We include the functions \spadfun{lookup} and \spadfun{index} to give a bijection between the finite set and an initial segment of positive integers. \blankline
13135`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 implemena
13135`--tions are usually binary or decimal)} \indented{2}{2: \spadfunFrom{precision}{FloatingPointSystem} of the \spadfunFrom{mantissa}{FloatingPointSystem} (arbitrary or fixed)} \indented{2}{3: rounding error for operations} \blankline Because a Float is an approximation to the real numbers,{} even though it is defined to be a join of a Field and OrderedRing,{} some of the attributes do not hold. In particular associative("+") does not hold. Algorithms defined over a field need special consideration
13135`--s when the field is a floating point system.
13184`\axiomType{FortranFunctionCategory} is the category of arguments to NAG Library routines which return (sets of) function values.
13240`A category of domains which model machine arithmetic used by machines in the AXIOM-NAG link.
13297`\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}.
13348`\axiomType{FortranMatrixFunctionCategory} provides support for producing Functions and Subroutines representing matrices of expressions.
13409`\axiomType{FortranProgramCategory} provides various models of FORTRAN subprograms. These can be transformed into actual FORTRAN code.
13465`\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}.
13516`\axiomType{FortranVectorFunctionCategory} is the catagory of arguments to NAG Library routines which return the values of vectors of functions.
13577`A \spadtype{FramedAlgebra} is a \spadtype{FiniteRankAlgebra} together with a fixed \spad{R}-module basis.
13679`FramedNonAssociativeAlgebra(\spad{R}) is a \spadtype{FiniteRankNonAssociativeAlgebra} (\spadignore{i.e.} a non associative algebra over \spad{R} which is a free \spad{R}-module of finite rank) over a commutative ring \spad{R} together with a fixed \spad{R}-module basis.
13758`A free abelian monoid on a set \spad{S} is the monoid of finite sums of the form \spad{reduce(+,[ni * si])} where the \spad{si}'s are in \spad{S},{} and the \spad{ni}'s are in a given abelian monoid. The operation is commutative.
13858`The category of free Lie algebras. It is used by domains of non-commutative algebra: \spadtype{LiePolynomial} and \spadtype{XPBWPolynomial}. \newline Author: Michel Petitot (petitot@lifl.fr)
13940`A domain of this category implements formal linear combinations of elements from a domain \spad{Basis} with coefficients in a domain \spad{R}. The domain \spad{Basis} needs only to belong to the category \spadtype{SetCategory} and \spad{R} to the category \spadtype{Ring}. Thus the coefficient ring may be non-commutative. See the \spadtype{XDistributedPolynomial} constructor for examples of domains built with the \spadtype{FreeModule
13940`--Cat} category constructor. Author: Michel Petitot (petitot@lifl.fr)
14010`A free monoid on a set \spad{S} is the monoid of finite products of the form \spad{reduce(*,[si ** ni])} where the \spad{si}'s are in \spad{S},{} and the \spad{ni}'s are nonnegative integers. The multiplication is not commutative.
14076`This category provides a selection of evaluation operations depending on what the argument type \spad{R} provides.
14141`\spad{S} is \spadtype{FullyLinearlyExplicitRingOver R} means that \spad{S} is a \spadtype{LinearlyExplicitRingOver R} and,{} in addition,{} if \spad{R} is a \spadtype{LinearlyExplicitRingOver Integer},{} then so is \spad{S}
14211`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).
14273`\indented{2}{A is fully retractable to \spad{B} means that A is retractable to \spad{B},{} and,{}} \indented{2}{in addition,{} if \spad{B} is retractable to the integers or rational} \indented{2}{numbers then so is A.} \indented{2}{In particular,{} what we are asserting is that there are no integers} \indented{2}{(rationals) in A which don't retract into \spad{B}.} Date Created: March 1990 Date Last Updated: 9 April 1991
14332`This category is a model for the function field of a plane algebraic curve.
14501`A space of formal functions with arguments in an arbitrary ordered set.
14557`This category describes domains where \spadfun{gcd} can be computed but where there is no guarantee of the existence of \spadfun{factor} operation for factorisation into irreducibles. However,{} if such a \spadfun{factor} operation exist,{} factorization will be unique up to order and units.
14599`GradedAlgebra(\spad{R},{}\spad{E}) denotes ``E-graded \spad{R}-algebra''. A graded algebra is a graded module together with a degree preserving \spad{R}-linear map,{} called the {\em product}. \blankline The name ``product'' is written out in full so inner and outer products with the same mapping type can be distinguished by name.
14678`GradedModule(\spad{R},{}\spad{E}) denotes ``E-graded \spad{R}-module'',{} \spadignore{i.e.} collection of \spad{R}-modules indexed by an abelian monoid \spad{E}. An element \spad{g} of \spad{G[s]} for some specific \spad{s} in \spad{E} is said to be an element of \spad{G} with {\em degree} \spad{s}. Sums are defined in each module \spad{G[s]} so two elements of \spad{G} have a sum if they have the same degree. \blankline Mor
14678`--phisms can be defined and composed by degree to give the mathematical category of graded modules.
14756`The class of multiplicative groups,{} \spadignore{i.e.} monoids with multiplicative inverses. \blankline
14793`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.
14852`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.
14904`Category for the hyperbolic trigonometric functions.
14963`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.
15040`This category represents the direct product of some set with respect to an ordered indexing set.
15125`This category provides \spadfun{eval} operations. A domain may belong to this category if it is possible to make ``evaluation'' substitutions. The difference between this and \spadtype{Evalable} is that the operations in this category specify the substitution as a pair of arguments rather than as an equation.
15193`This category describes input byte stream conduits.
15242`This category describes byte stream conduits supporting both input and output operations.
15297`An \spad{IntegerNumberSystem} is a model for the integers.
15346`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}
15393`\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.
15474`A keyed dictionary is a dictionary of key-entry pairs for which there is a unique entry for each key.
15555`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.
15615`The category of all left algebras over an arbitrary ring.
15664`\indented{2}{A set is an \spad{S}-left linear set if it is stable by left-dilation} \indented{2}{by elements in the semigroup \spad{S}.} See Also: RightLinearSet.
15723`The category of left modules over an rng (ring not necessarily with unit). This is an abelian group which supports left multiplation by elements of the rng. \blankline
15773`\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.
15834`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 ex
15834`--ported here apply to infinite objects (\spadignore{e.g.} streams) as well to finite ones. For finite linear aggregates,{} see \spadtype{FiniteLinearAggregate}.
15888`\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}}
15971`\indented{2}{A set is an \spad{S}-linear set if it is stable by dilation} \indented{2}{by elements in the semigroup \spad{S}.} See Also: LeftLinearSet,{} RightLinearSet.
16025`An extension of left-module with an explicit linear dependence test.
16089`Category for the transcendental Liouvillian functions.
16148`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.
16200``Logic' provides the basic operations for lattices,{} \spadignore{e.g.} boolean algebra.
16237`\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}. T
16237`--he 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.
16351`The category of modules over a commutative ring. \blankline
16408`\indented{1}{MonadWithUnit is the class of multiplicative monads with unit,{}} \indented{1}{\spadignore{i.e.} sets with a binary operation and a unit element.} Axioms \indented{3}{leftIdentity("*":(\%,{}\%)->\%,{}1)\space{3}\tab{30} 1*x=x} \indented{3}{rightIdentity("*":(\%,{}\%)->\%,{}1)\space{2}\tab{30} x*1=x} Common Additional Axioms \indented{3}{unitsKnown
16408`---if "recip" says "failed",{} that PROVES input wasn't a unit}
16455`Monad is the class of all multiplicative monads,{} \spadignore{i.e.} sets with a binary operation.
16492`A \spadtype{MonogenicAlgebra} is an algebra of finite rank which can be generated by a single element.
16597`This is the category of linear operator rings with one generator. The generator is not named by the category but can always be constructed as \spad{monomial(1,1)}. \blankline For convenience,{} call the generator \spad{G}. Then each value is equal to \indented{4}{\spad{sum(a(i)*G**i, i = 0..n)}} for some unique \spad{n} and \spad{a(i)} in \spad{R}. \blankline Note that multiplication is not necessarily commutative. In fact,{} if \spad{a} is i
16597`--n \spad{R},{} it is quite normal to have \spad{a*G \~= G*a}.
16657`The class of multiplicative monoids,{} \spadignore{i.e.} semigroups with a multiplicative identity element. \blankline
16696`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.
16757`A multi-set aggregate is a set which keeps track of the multiplicity of its elements.
16822`\spadtype{MultivariateTaylorSeriesCategory} is the most general multivariate Taylor series category.
16974`NonAssociativeAlgebra is the category of non associative algebras (modules which are themselves non associative rngs). Axioms \indented{3}{r*(a*b) = (r*a)*b = a*(r*b)}
17045`A NonAssociativeRing is a non associative rng which has a unit,{} the multiplication is not necessarily commutative or associative.
17097`NonAssociativeRng is a basic ring-type structure,{} not necessarily commutative or associative,{} and not necessarily with unit. Axioms \indented{2}{x*(y+z) = x*y + x*z} \indented{2}{(x+y)*z = x*z + y*z} Common Additional Axioms \indented{2}{noZeroDivisors\space{2}ab = 0 => \spad{a=0} or \spad{b=0}}
17146`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-const
17146`--ant 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 
17146`--the Theories} \indented{5}{of Triangular Sets" Journal of Symbol. Comp. (to appear)} \indented{1}{[3] \spad{M}. MORENO MAZA and \spad{R}. RIOBOO "Computations of gcd over} \indented{5}{algebraic towers of simple extensions" In proceedings of \spad{AAECC11}} \indented{5}{Paris,{} 1995.} \indented{1}{[4] \spad{M}. MORENO MAZA "Calculs de pgcd au-dessus des tours} \indented{5}{d'extensions simples et resolution des systemes d'equations} \indented{5}{algebriques" These,{} Universite \spad{P}.etM. 
17146`--Curie,{} Paris,{} 1997.}
17419`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.
17482`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
17482`-- 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.
17549`\spadtype{OpenMath} provides operations for exporting an object in OpenMath format.
17586`This category specifies the interface for operators used to build terms,{} in the sense of Universal Algebra. The domain parameter \spad{S} provides representation for the `external name' of an operator.
17650`Ordered sets which are also abelian groups,{} such that the addition preserves the ordering.
17703`This domain is an OrderedAbelianMonoid with a \spadfun{sup} operation added. The purpose of the \spadfun{sup} operator in this domain is to act as a supremum with respect to the partial order imposed by \spadop{-},{} rather than with respect to the total \spad{>} order (since that is "max"). \blankline
17759`Ordered sets which are also abelian monoids,{} such that the addition preserves the ordering.
17811`Ordered sets which are also abelian semigroups,{} such that the addition preserves the ordering. \indented{2}{\spad{ x < y => x+z < y+z}}
17866`Ordered sets which are also abelian cancellation monoids,{} such that the addition preserves the ordering.
17931`Ordered finite sets.
17977`The category of ordered commutative integral domains,{} where ordering and the arithmetic operations are compatible \blankline
18032`Ordered sets which are also monoids,{} such that multiplication preserves the ordering. \blankline
18078`to become an in order iterator
18148`Ordered sets which are also rings,{} that is,{} domains where the ring operations are compatible with the ordering. \blankline
18193`Semigroups with compatible ordering.
18243`The class of totally ordered sets,{} that is,{} sets such that for each pair of elements \spad{(a,b)} exactly one of the following relations holds \spad{a<b or a=b or b<a} and the relation is transitive,{} \spadignore{i.e.} \spad{a<b and b<c => a<c}.
18286`Category of types equipped with a total ordering.
18403`This category describes output byte stream conduits.
18454`This is the catefory of stream-based representations of \indented{2}{the \spad{p}-adic integers.}
18518`\indented{2}{This category captures the interface of domains with a distinguished} \indented{2}{operation named \spad{differentiate} for partial differentiation with} \indented{2}{respect to some domain of variables.} See Also: \indented{2}{DifferentialDomain,{} PartialDifferentialSpace}
18660`A partial differential \spad{R}-module with differentiations indexed by a parameter type \spad{S}. \blankline
18738`A partial differential ring with differentiations indexed by a parameter type \spad{S}. \blankline
18808`\indented{2}{This category captures the interface of domains stable by partial} \indented{2}{differentiation with respect to variables from some domain.} See Also: \indented{2}{PartialDifferentialDomain}
18878`This is the description of any package which provides partial functions on a domain belonging to TranscendentalFunctionCategory.
18975`A set \spad{R} is PatternMatchable over \spad{S} if elements of \spad{R} can be matched to patterns over \spad{S}.
19038`An object \spad{S} is Patternable over an object \spad{R} if \spad{S} can lift the conversions from \spad{R} into \spadtype{Pattern(Integer)} and \spadtype{Pattern(Float)} to itself.
19088`PermutationCategory provides a categorial environment \indented{1}{for subgroups of bijections of a set (\spadignore{i.e.} permutations)}
19155`PlottablePlaneCurveCategory is the category of curves in the plane which may be plotted via the graphics facilities. Functions are provided for obtaining lists of lists of points,{} representing the branches of the curve,{} and for determining the ranges of the \spad{x}-coordinates and \spad{y}-coordinates of the points on the curve.
19216`PlottableSpaceCurveCategory is the category of curves in 3-space which may be plotted via the graphics facilities. Functions are provided for obtaining lists of lists of points,{} representing the branches of the curve,{} and for determining the ranges of the x-,{} y-,{} and \spad{z}-coordinates of the points on the curve.
19277`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.
19329`The category for general multi-variate polynomials over a ring \spad{R},{} in variables from VarSet,{} with exponents from the \spadtype{OrderedAbelianMonoidSup}.
19432`This is the category of domains that know "enough" about themselves in order to factor univariate polynomials over themselves. This will be used in future releases for supporting factorization over finitely generated coefficient fields,{} it is not yet available in the current release of axiom.
19496`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
19496`-- 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.
19655`\spadtype{PowerSeriesCategory} is the most general power series category with exponents in an ordered abelian monoid.
19758`Category for the functions defined by integrals.
19817`The category of constructive principal ideal domains,{} \spadignore{i.e.} where a single generator can be constructively found for any ideal given by a finite set of generators. Note that this constructive definition only implies that finitely generated ideals are principal. It is not clear what we would mean by an infinitely generated ideal.
19867`A priority queue is a bag of items from an ordered set where the item extracted is always the maximum element.
19935`This category declares the connectives of Propositional Logic.
19987`\spadtype{QuaternionCategory} describes the category of quaternions and implements functions that are not representation specific.
20057`A queue is a bag where the first item inserted is the first item extracted.
20110`QuotientField(\spad{S}) is the category of fractions of an Integral Domain \spad{S}.
20180`This category defines the common interface for RGB color models.
20243`This category defines the common interface for RGB color spaces.
20306`The \spad{RadicalCategory} is a model for the rational numbers.
20354`\axiomType{RealClosedField} provides common acces functions for all real closed fields.
20403`The category of real numeric domains,{} \spadignore{i.e.} convertible to floats.
20446`The real number system category is intended as a model for the real numbers. The real numbers form an ordered normed field. Note that we have purposely not included \spadtype{DifferentialRing} or the elementary functions (see \spadtype{TranscendentalFunctionCategory}) in the definition.
20492`\axiomType{RealRootCharacterizationCategory} provides common acces functions for all real root codings.
20642`\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.
20818`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.
20875`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 operatio
20875`--ns usually defined for univariate polynomials make sense here.
20982`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 \sp
20982`--ad{k} is the fraction field of \spad{R}. The triangular set \spad{[t1,...,tm]} is regular iff for every \spad{i} the initial of \spad{ti+1} is invertible in the tower of simple extensions associated with \spad{[t1,...,ti]}. A family \spad{[T1,...,Ts]} of regular triangular sets is a split of Kalkbrener of a given ideal \spad{I} iff the radical of \spad{I} is equal to the intersection of the radical ideals generated by the saturated ideals of the \spad{[T1,...,Ti]}. A family \spad{[T1,...,Ts]} 
20982`--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 give
20982`--n subset \spad{S} of \spad{A} iff the union of the \spad{W(Ti)} contains \spad{S} and is contained in the closure of \spad{S} (\spad{w}.\spad{r}.\spad{t}. Zariski topology). A family \spad{[T1,...,Ts]} of regular triangular sets is a split of Lazard of a given triangular set \spad{T} if it is a split of Lazard of \spad{W(T)}. Note that if \spad{[T1,...,Ts]} is a split of Lazard of \spad{T} then it is also a split of Kalkbrener of \spad{T}. The converse is \spad{false}. This category provides o
20982`--perations related to both kinds of splits,{} the former being related to ideals decomposition whereas the latter deals with varieties decomposition. See the example illustrating the \spadtype{RegularTriangularSet} constructor for more explanations about decompositions by means of regular triangular sets. \newline References : \indented{1}{[1] \spad{M}. KALKBRENER "Three contributions to elimination theory"} \indented{5}{Phd Thesis,{} University of Linz,{} Austria,{} 1991.} \indented{1}{[2] \sp
20982`--ad{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.}
21138`A is retractable to \spad{B} means that some elementsif A can be converted into elements of \spad{B} and any element of \spad{B} can be converted into an element of A.
21192`\indented{2}{A set is an \spad{S}-right linear set if it is stable by right-dilation} \indented{2}{by elements in the semigroup \spad{S}.} See Also: LeftLinearSet.
21252`The category of right modules over an rng (ring not necessarily with unit). This is an abelian group which supports right multiplation by elements of the rng. \blankline
21303`The category of rings with unity,{} always associative,{} but not necessarily commutative.
21338`The category of associative rings,{} not necessarily commutative,{} and not necessarily with a 1. This is a combination of an abelian group and a semigroup,{} with multiplication distributing over addition. \blankline
21371`This category allows the manipulation of Lisp values while keeping the grunge fairly localized.
21504`This category provides operations on ranges,{} or {\em segments} as they are called.
21559`This category provides an interface for expanding segments to a stream of elements.
21654`the class of all multiplicative semigroups,{} \spadignore{i.e.} a set with an associative operation \spadop{*}. \blankline
21696`The category of all semiring structures,{} \spadignore{e.g.} triples (\spad{D},{}+,{}*) such that (\spad{D},{}+) is an Abelian monoid and (\spad{D},{}*) is a monoid with the following laws:
21736`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.
21795`\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{=}}
21839`This category describes the exported \indented{2}{signatures of the SpadAst domain.}
21887`This is the category of Spad syntax objects.
21939`Category for the other special functions.
21995`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}
22164`The category of square-free regular triangular sets. A regular triangular set \spad{ts} is square-free if the gcd of any polynomial \spad{p} in \spad{ts} and \spad{differentiate(p,mvar(p))} \spad{w}.\spad{r}.\spad{t}. \axiomOpFrom{collectUnder}{TriangularSetCategory}(ts,{}\axiomOpFrom{mvar}{RecursivePolynomialCategory}(\spad{p})) has degr
22164`--ee 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
22164`-- algorithm for computing triangular} \indented{5}{decomposition of algebraic varieties" NAG Tech. Rep. 4/98.}
22330`\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.
22490`A stack is a bag where the last item inserted is the first item extracted.
22543`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: \ind
22543`--ented{2}{infinite\tab{15}repeated \spad{nextItem}'s are never \spad{nothing}.}
22585`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}.
22639`A string aggregate is a category for strings,{} that is,{} one dimensional arrays of characters.
22686`A table aggregate is a model of a table,{} \spadignore{i.e.} a discrete many-to-one mapping from keys to entries.
22766`The category ThreeSpaceCategory is used for creating three dimensional objects using functions for defining points,{} curves,{} polygons,{} constructs and the subspaces containing them.
22824`Category for the transcendental elementary functions.
22888`The category of triangular sets of multivariate polynomials with coefficients in an integral domain. Let \axiom{\spad{R}} be an integral domain and \axiom{\spad{V}} a finite ordered set of variables,{} say \axiom{\spad{X1} < \spad{X2} < ... < Xn}. A set \axiom{\spad{S}} of polynomials in \axiom{\spad{R}[\spad{X1},{}\spad{X2},{}...,{}Xn]} is triangula
22888`--r 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
22888`---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"
22888`-- Journal of Symbol. Comp. (to appear)}
23042`Category for the trigonometric functions.
23105`\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 obt
23105`--ained 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.
23233`The fundamental Type.
23268`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 
23268`--list. Since these aggregates are recursive aggregates,{} they may be cyclic.
23330`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.
23371`A constructive unique factorization domain,{} \spadignore{i.e.} where we can constructively factor members into a product of a finite number of irreducible elements.
23426`\spadtype{UnivariateLaurentSeriesCategory} is the category of Laurent series in one variable.
23500`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)}.
23632`The category of univariate polynomials over a ring \spad{R}. No particular model is assumed - implementations can be either sparse or dense.
23700`\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.
23799`\spadtype{UnivariatePuiseuxSeriesCategory} is the category of Puiseux series in one variable.
23874`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)}.
24007`This is the category of univariate skew polynomials over an Ore coefficient ring. The multiplication is given by \spad{x a = \sigma(a) x + \delta a}. This category is an evolution of the types \indented{2}{MonogenicLinearOperator,{} OppositeMonogenicLinearOperator,{} and} \indented{2}{NonCommutativeOperatorDivision} developped by Jean Della Dora and Stephen \spad{M}. Watt.
24080`\spadtype{UnivariateTaylorSeriesCategory} is the category of Taylor series in one variable.
24153`\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.
24208`Vector Spaces (not necessarily finite dimensional) over a field.
24260`This is the category of algebras over non-commutative rings. It is used by constructors of non-commutative algebras such as: \indented{4}{\spadtype{XPolynomialRing}.} \indented{4}{\spadtype{XFreeAlgebra}} Author: Michel Petitot (petitot@lifl.fr)
24306`This category specifies opeations for polynomials and formal series with non-commutative variables.
24371`The Category of polynomial rings with non-commutative variables. The coefficient ring may be non-commutative too. However coefficients commute with vaiables.
24440`This domain represents the syntax for an add-expression.
24499`AlgebraGivenByStructuralConstants implements finite rank algebras over a commutative ring,{} given by the structural constants \spad{gamma} with respect to a fixed basis \spad{[a1,..,an]},{} where \spad{gamma} is an \spad{n}-vector of \spad{n} by \spad{n} matrices \spad{[(gammaijk) for k in 1..rank()]} defined by \spad{ai * aj = gammaij1
24499`-- * a1 + ... + gammaijn * an}. The symbols for the fixed basis have to be given as a list of symbols.
24666`Function field defined by \spad{f}(\spad{x},{} \spad{y}) = 0.
24868`Algebraic closure of the rational numbers,{} with mathematical =
24929`This domain implements anonymous functions
24990`The domain of antisymmetric polynomials.
25073`\spadtype{Any} implements a type that packages up objects and their types in objects of \spadtype{Any}. Roughly speaking that means that if \spad{s : S} then when converted to \spadtype{Any},{} the new object will include both the original object and its type. This is a way of converting arbitrary objects into a single type without losing any of the original information. Any object can be converted to one of \spadtype{Any}. The original object can be recov
25073`--ered by `is-case' pattern matching as exemplified here and \spad{AnyFunctions1}.
25119`This domain implements the arity of a function or an operator,{} \spadignore{e.g.} the number of arguments that an operator can take. An arity is either a definition nonnegative integer,{} and the special value `arbitrary',{} signifying that an operation can take any number of arguments.
25169`A stack represented as a flexible array.
25245`\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}
25325`\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}
25398`\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
25398`--)*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)/
25398`--(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.
25398`--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.0
25398`--D0)/(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)+1
25398`--8.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
25398`--(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
25398`---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)*     
25398`--&*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(
25398`--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
25398`--(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}
25478`\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}
25550`\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(
25550`--7))+(-2.0D0*X(6))      RETURN      END\end{verbatim}
25630`\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+(-3
25630`--2.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}
25704`\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(
25704`--     &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.
25704`--5D0*W(3))+W(     &2)+(-0.5D0*W(1)))*Z(2)+((-0.5D0*W(2))+W(1))*Z(1)      RETURN      END\end{verbatim}
25766`\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
25766`--     &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.0176407246399974
25766`--4D0*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
25766`--(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.
25766`--     &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.00182
25766`--2737697581869D0*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.0401514
25766`--7277405744D0*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(
25766`--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
25766`--*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))
25766`--+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.0
25766`--02563370039476418D0*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   
25766`--  &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(
25766`--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.0294704
25766`--6460707379D0*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     &468897
25766`--337339577D0*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.05375944956767
25766`--728D0*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.052588891863382
25766`--82D0*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
25766`--)+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}
25828`\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}
25901`\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     
25901`-- 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
25901`--.2)THEN        CALL F06PAF('T',M,N,1.0D0,A,M,Y,1,1.0D0,X,1)      ENDIF      RETURN      END\end{verbatim}
25963`\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))      
25963`--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}
26043`\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}
26116`\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
26116`--      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}
26178`\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)=
26178`--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}
26258`\spadtype{Asp41} produces Fortran for Type 41 ASPs,{} needed for NAG routines \axiomOpFrom{d02raf}{d02Package} and \axiomOpFrom{d02saf}{d02Package} in particular. These ASPs are in fact three Fortran routines which return a vector of functions,{} and their derivatives wrt \spad{Y}(\spad{i}) and also a continuation parameter EPS,{} for example:\begin{verbatim}      SUBROUTINE FCN(X,EPS,Y
26258`--,F,N)      DOUBLE PRECISION EPS,F(N),X,Y(N)      INTEGER N      F(1)=Y(2)      F(2)=Y(3)      F(3)=(-1.0D0*Y(1)*Y(3))+2.0D0*EPS*Y(2)**2+(-2.0D0*EPS)      RETURN      END      SUBROUTINE JACOBF(X,EPS,Y,F,N)      DOUBLE PRECISION EPS,F(N,N),X,Y(N)      INTEGER N      F(1,1)=0.0D0      F(1,2)=1.0D0      F(1,3)=0.0D0      F(2,1)=0.0D0      F(2,2)=0.0D0      F(2,3)=1.0D0      F(3,1)=-1.0D0*Y(3)      F(3,2)=4.0D0*EPS*Y(2)      F(3,3)=-1.0D0*Y(1)      RETURN      END      SUBROU
26258`--TINE JACEPS(X,EPS,Y,F,N)      DOUBLE PRECISION EPS,F(N),X,Y(N)      INTEGER N      F(1)=0.0D0      F(2)=0.0D0      F(3)=2.0D0*Y(2)**2-2.0D0      RETURN      END\end{verbatim}
26373`\spadtype{Asp42} produces Fortran for Type 42 ASPs,{} needed for NAG routines \axiomOpFrom{d02raf}{d02Package} and \axiomOpFrom{d02saf}{d02Package} in particular. These ASPs are in fact three Fortran routines which return a vector of functions,{} and their derivatives wrt \spad{Y}(\spad{i}) and also a continuation parameter EPS,{} for example:\begin{verbatim}      SUBROUTINE G(EPS,YA,YB
26373`--,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)
26373`--=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}
26488`\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)) 
26488`--     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}
26562`\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}
26634`\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.0D
26634`--0*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))      
26634`--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.299
26634`--999999999999D0)*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}
26714`\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)
26714`--=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)
26714`--**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}
26794`\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.0D
26794`--0*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.0D
26794`--0*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}
26872`\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{verbati
26872`--m}
26953`\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)THE
26953`--N        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}
27034`\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}
27115`\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}
27196`\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)     
27196`--&**2))/(Z(2)*DCOS(Z(3)))      F(3)=-0.03199999999999999D0/(X*Z(2)**2)      RETURN      END\end{verbatim}
27275`\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}
27356`\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    
27356`--  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}
27417`\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 
27417`--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.
27490`\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 al
27490`--gebra 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),{} th
27490`--en 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.
27622`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},{}\sp
27622`--ad{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
27622`-- 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.
27748`\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.
27863`This domain represents the syntax of an attribute in \indented{2}{a category expression.}
27930`\axiomType{AttributeButtons} implements a database and associated adjustment mechanisms for a set of attributes. \blankline For ODEs these attributes are "stiffness",{} "stability" (\spadignore{i.e.} how much affect the cosine or sine component of the solution has on the stability of the result),{} "accuracy" and "expense" (\spadignore{i.e.} how expensive is the evaluation of the ODE). All these have bearing on the cost of calculating the 
27930`--solution given that reducing the step-length to achieve greater accuracy requires considerable number of evaluations and calculations. \blankline The effect of each of these attributes can be altered by increasing or decreasing the button value. \blankline For Integration there is a button for increasing and decreasing the preset number of function evaluations for each method. This is automatically used by ANNA when a method fails due to insufficient workspace or where the limit of function ev
27930`--aluations has been reached before the required accuracy is achieved. \blankline
27994`Automorphism \spad{R} is the multiplicative group of automorphisms of \spad{R}.
28055`\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.
28144`Stream-based implementation of Zp: \spad{p}-adic numbers are represented as sum(\spad{i} = 0..,{} a[\spad{i}] * p^i),{} where the a[\spad{i}] lie in -(\spad{p} - 1)\spad{/2},{}...,{}(\spad{p} - 1)\spad{/2}.
28223`Stream-based implementation of Qp: numbers are represented as sum(\spad{i} = \spad{k}..,{} a[\spad{i}] * p^i),{} where the a[\spad{i}] lie in -(\spad{p} - 1)\spad{/2},{}...,{}(\spad{p} - 1)\spad{/2}.
28394`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.
28450`This domain allows rational numbers to be presented as repeating binary expansions.
28531`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.
28617`\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)}
28703`\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.
28783`\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.
28850`\spadtype{Bits} provides logical functions for Indexed Bits.
28900`\indented{1}{\spadtype{Boolean} is the elementary logic with 2 values:} \spad{true} and \spad{false}
28957`ByteBuffer provides datatype for buffers of bytes. This domain differs from PrimitiveArray Byte in that it is not as rigid as PrimitiveArray Byte. That is,{} the typical use of ByteBuffer is to pre-allocate a vector of Byte of some capacity `n'. The array can then store up to `n' bytes. The actual interesting bytes count (the length of the buffer) is therefore different from the capacity. The length is no more than the cap
28957`--acity,{} 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.}
29038`This datatype describes byte order of machine values stored memory.
29095`Byte is the datatype of 8-bit sized unsigned integer values.
29146`This domain represents the capsule of a domain definition.
29212`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}cartesi
29212`--an 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)}} an
29212`--d 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
29270`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}.
29417`This domain represents a `case' expression.
29479`This domain represents the unnamed category defined \indented{2}{by a list of exported signatures}
29544`This domain provides representations for category constructors.
29683`This domain allows classes of characters to be defined and manipulated efficiently.
29744`This domain provides the basic character data type.
29800`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. \bl
29800`--ankline 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.
29904`This domain represents `coerce' expressions.
29968`This domain represents list comprehension syntax.
30034`This domain represents type specification \indented{2}{for an identifier or expression.}
30098`Color() specifies a domain of 27 colors provided in the \Language{} system (the colors mix additively).
30154`This domain represents the syntax of a comma-separated \indented{2}{list of expressions.}
30218`A type for basic commutators
30273`This package implements a Spad compiler.
30330`\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}.
30410`This domain represents `literal sequence' syntax.
30557`This domain enumerates the three kinds of constructors available in OpenAxiom: category constructors,{} domain constructors,{} and package constructors.
30621`This domain provides implementations for constructors.
30685`\spadtype{ContinuedFraction} implements general \indented{1}{continued fractions.\space{2}This version is not restricted to simple,{}} \indented{1}{finite fractions and uses the \spadtype{Stream} as a} \indented{1}{representation.\space{2}The arithmetic functions assume that the} \indented{1}{approximants alternate below/above the convergence point.} \indented{1}{This is enforced by ensuring the partial numerators and pa
30685`--rtial} \indented{1}{denominators are greater than 0 in the Euclidean domain view of \spad{R}} \indented{1}{(\spadignore{i.e.} \spad{sizeLess?(0, x)}).}
30768`\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: January 18,{} 2008. A `Contour' a list of bindings making up a `virtual scope'.
30835`This domain provides for a fixed-sized homogeneous data buffer.
30926`This domain provides some nice functions on lists
30998`\indented{1}{This domain implements a simple view of a database whose fields are} indexed by symbols
31075`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.
31205`This domain allows rational numbers to be presented as repeating decimal expansions.
31288`This domain represents the syntax of a definition.
31355`\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)
31471`Linked list implementation of a Dequeue
31548`\spadtype{DifferentialSparseMultivariatePolynomial} implements an ordinary differential polynomial ring by combining a domain belonging to the category \spadtype{DifferentialVariableCategory} with the domain \spadtype{SparseMultivariatePolynomial}. \blankline
31737`This constructor provides a direct product type with a left matrix-module view.
31937`This constructor provides a direct product of \spad{R}-modules with an \spad{R}-module view.
32064`\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 c
32064`--reated by converting vector elements using the \spadfun{directProduct} function or by taking appropriate linear combinations of basis vectors provided by the \spad{unitVector} operation.
32164`\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 fi
32164`--rst in the list.
32340`This domain provides representations for domains constructors.
32413`Represntation of domain templates resulting from compiling a domain constructor
32524`\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}{Doub
32524`--leFloat},{} \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 \spadf
32524`--unFrom{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{DoubleFloa
32524`--t} 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.
32590`DrawOption allows the user to specify defaults for the creation and rendering of plots.
32646`\indented{1}{Author: Gabriel Dos Reis} Date Created: July 2,{} 2010 Date Last Modified: July 2,{} 2010 Descrption: \indented{2}{Representation of a dual vector space basis,{} given by symbols.}
32722`This domains an expresion as elaborated by the interpreter. See Also:
32868`\indented{1}{This package provides elementary functions on any Laurent series} domain over a field which was constructed from a Taylor series domain. These functions are implemented by calling the corresponding functions on the Taylor series domain. We
32868`-- also provide 'partial functions' which compute transcendental functions of Laurent series when possible and return "failed" when this is not possible.
33123`\indented{1}{This package provides elementary functions on any Laurent series} domain over a field which was constructed from a Taylor series domain. These functions are implemented by calling the correspo
33123`--nding functions on the Taylor series domain. We also provide 'partial functions' which compute transcendental functions of Laurent series when possible and return "failed" when this is not possible.
33425`\spad{Enumeration(a,b,...,c)} is a primitive type in AXIOM used to represent the object composed of the symbols \spad{a},\spad{b},..., and \spad{c}.
33474`\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: March 18,{} 2010. An `Environment' is a stack of scope.
33541`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.
33648`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.
33699`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}
33941`This domain represents exit expressions.
34003`A function which does not return directly to its caller should have Exit as its return type. \blankline Note: It is convenient to have a formal \spad{coerce} into each type from type Exit. This allows,{} for example,{} errors to be raised in one half of a type-balanced \spad{if}.
34042`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 univaria
34042`--te Puiseux series.
34290`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 in
34290`--finity 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.
34436`Expressions involving symbolic functions.
34510`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 w
34510`--hich 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.
34564`\spadtype{Factored} creates a domain whose objects are kept in factored form as long as possible. Thus certain operations like multiplication and gcd are relatively easy to do. Others,{} like addition require somewhat more work,{} and unless the argument domain provides a factor function,{} the result may not be completely factored. Each object consists of a unit and a list of factors,{} where a factor has a member of \spad{R} (the 
34564`--"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.
34635`This domain provides an interface to names in the file system.
34684`This domain provides a basic model of files to save arbitrary values. The operations provide sequential access to the contents.
34760`This domains implements finite rational divisors on a curve,{} that is finite formal sums SUM(\spad{n} * \spad{P}) where the \spad{n}'s are integers and the \spad{P}'s are finite rational points on the curve.
34979`FiniteFieldCyclicGroupExtensionByPolynomial(GF,{}defpol) implements a finite extension field of the ground field {\em GF}. Its elements are represented by powers of a primitive element,{} \spadignore{i.e.} a generator of the multiplicative (cyclic) group. As primitive element we choose the root of the extension polynomial {\em def
34979`--pol},{} 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.
35154`FiniteFieldCyclicGroupExtension(GF,{}\spad{n}) implements a extension of degree \spad{n} over the ground field {\em GF}. Its elements are represented by powers of a primitive element,{} \spadignore{i.e.} a generator of the multiplicative (cyclic) group. As primitive element we choose the root of the extension polynomial,{} which is created by {\em createPrimit
35154`--ivePoly} 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.
35299`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
35299`-- {\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.
35440`FiniteFieldExtensionByPolynomial(GF,{} defpol) implements the extension of the finite field {\em GF} generated by the extension polynomial {\em defpol} which MUST be irreducible. Note: the user has the responsibility to ensure that {\em defpol} is irreducible.
35592`FiniteFieldExtensionByPolynomial(GF,{} \spad{n}) implements an extension of the finite field {\em GF} of degree \spad{n} generated by the extension polynomial constructed by \spadfunFrom{createIrreduciblePoly}{FiniteFieldPolynomialPackage} from \spadtype{FiniteFieldPolynomialPackage}.
35709`FiniteFieldNormalBasisExtensionByPolynomial(GF,{}uni) implements a finite extension of the ground field {\em GF}. The elements are represented by coordinate vectors with respect to. a normal basis,{} \spadignore{i.e.} a basis consisting of the conjugates (\spad{q}-powers) of a
35709`--n 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)
35939`FiniteFieldNormalBasisExtensionByPolynomial(GF,{}\spad{n}) implements a finite extension field of degree \spad{n} over the ground field {\em GF}. The elements are represented by coordinate vectors with respect to a normal basis,{} \spadignore{i.e.} a basis consisting of the conjugates (\spad{q}-powers) of an element,{} in this case called normal element. This 
35939`--is chosen as a root of the extension polynomial,{} created by {\em createNormalPoly} from \spadtype{FiniteFieldPolynomialPackage}
36084`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 cho
36084`--sen as a root of the extension polynomial created by \spadfunFrom{createNormalPoly}{FiniteFieldPolynomialPackage}.
36225`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}.
36338`\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}
36338`--. 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 implementatio
36338`--n of many data structures in particular heaps,{} stacks and sets.
36425`\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
36425`-- 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
36425`-- 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
36425`-- 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. 
36425`--\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 exponen
36425`--tiation 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. Thi
36425`--s 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{/},
36425`--{} \spad{sqrt},{} \spad{pi},{} \spad{exp1},{} \spad{log2},{} \spad{log10}: \spad{ O( n**2 )}} \indented{5}{\spad{exp},{} \spad{log},{} \spad{sin},{} \spad{atan}:\space{2}\spad{ O( sqrt(n) n**2 )}} The other elementary functions are coded in terms of the ones above.
36484`This domain builds representations of program code segments for use with the FortranProgram domain.
36538`A domain of expressions involving functions which can be translated into standard Fortran-77,{} with some extra extensions from the NAG Fortran Library.
36694`\axiomType{FortranProgram} allows the user to build and manipulate simple models of FORTRAN subprograms. These can then be transformed into actual FORTRAN notation.
36874`Creates and manipulates objects which correspond to the basic FORTRAN data types: REAL,{} INTEGER,{} COMPLEX,{} LOGICAL and CHARACTER
36947`Code to manipulate Fortran templates
37025`Creates and manipulates objects which correspond to FORTRAN data types,{} including array dimensions.
37079`\indented{1}{Author: James Davenport} Date Created: 17 April 1992 Date Last Updated: 12 June 1992 Basic Functions: Related Constructors: Also See: AMS Classifications: Keywords: References: Description:
37153`\indented{1}{Author: James Davenport} Date Created: 17 April 1992 Date Last Updated: Basic Functions: Related Constructors: Also See: AMS Classifications: Keywords: References: Description:
37266`Fraction takes an IntegralDomain \spad{S} and produces the domain of Fractions with numerators and denominators from \spad{S}. If \spad{S} is also a GcdDomain,{} then gcd's between numerator and denominator will be cancelled during all operations.
37349`Fractional ideals in a framed algebra.
37527`Module representation of fractional ideals.
37708`The free abelian group on a set \spad{S} is the monoid of finite sums of the form \spad{reduce(+,[ni * si])} where the \spad{si}'s are in \spad{S},{} and the \spad{ni}'s are integers. The operation is commutative.
37787`The free abelian monoid on a set \spad{S} is the monoid of finite sums of the form \spad{reduce(+,[ni * si])} where the \spad{si}'s are in \spad{S},{} and the \spad{ni}'s are non-negative integers. The operation is commutative.
37893`The free group on a set \spad{S} is the group of finite products of the form \spad{reduce(*,[si ** ni])} where the \spad{si}'s are in \spad{S},{} and the \spad{ni}'s are integers. The multiplication is not commutative.
37957`This domain implements linear combinations of elements from the domain \spad{S} with coefficients in the domain \spad{R} where \spad{S} is an ordered set and \spad{R} is a ring (which may be non-commutative). This domain is used by domains of non-commutative algebra such as: \indented{4}{\spadtype{XDistributedPolynomial},{}} \indented{4}{\spadtype{XRecursivePolynomial}.} Author: Michel Petitot (petitot@lifl.fr)
38041`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.
38119`The free monoid on a set \spad{S} is the monoid of finite products of the form \spad{reduce(*,[si ** ni])} where the \spad{si}'s are in \spad{S},{} and the \spad{ni}'s are nonnegative integers. The multiplication is not commutative.
38191`Generate the Free Lie Algebra over a ring \spad{R} with identity; A \spad{P}. Hall basis is generated by a package call to HallBasis.
38331`\indented{1}{Full partial fraction expansion of rational functions} Author: Manuel Bronstein Date Created: 9 December 1992 Date Last Updated: June 18,{} 2010 References: \spad{M}.Bronstein & \spad{B}.Salvy,{} \indented{12}{Full Partial Fraction Decomposition of Rational Functions,{}} \indented{12}{in Proceedings of \spad{ISSAC'93},{} Kiev,{} ACM Press.}
38466`This domain implements named functions
38538`This is the datatype for exported function descriptor. A function descriptor consists of: (1) a signature; (2) a predicate; and (3) a slot into the scope object.
38604`Represntation of data needed to instantiate a domain constructor.
38664`\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
38664`-- orderings include: \spadtype{DirectProduct},{} \spadtype{HomogeneousDirectProduct},{} \spadtype{SplitHomogeneousDirectProduct} and finally \spadtype{OrderedDirectProduct} which accepts an arbitrary user function to define a term ordering.
38865`This package \undocumented
39167`A domain for polynomial sets.
39365`A sparse table has a default entry,{} which is returned if no other value has been explicitly stored for a key.
39518`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 
39518`--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)}
39694`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)}.
39839`AlgebraGenericElementPackage allows you to create generic elements of an algebra,{} \spadignore{i.e.} the scalars are extended to include symbolic coefficients
40036`TwoDimensionalGraph creates virtual two dimensional graphs (to be displayed on TwoDimensionalViewports).
40094`This domain represents a `has' expression.
40154`This domain provides access to the underlying Lisp hash tables. By varying the hashfn parameter,{} tables suited for different purposes can be obtained.
40279`This domain represents the header of a definition.
40341`Heap implemented in a flexible array to allow for insertions
40417`This domain allows rational numbers to be presented as repeating hexadecimal expansions.
40504`\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}.
40630`\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 
40630`--respect to the position that the variables appear in the list of variables parameter.
40829`This domain represents hostnames on computer network.
40886`This domains implements finite rational divisors on an hyperelliptic curve,{} that is finite formal sums SUM(\spad{n} * \spad{P}) where the \spad{n}'s are integers and the \spad{P}'s are finite rational points on the curve. The equation of the curve must be \spad{y^2} = \spad{f}(\
40886`--spad{x}) and \spad{f} must have odd degree.
41112`This domain provides constants to describe directions of IO conduits (file,{} etc) mode of operations.
41165`This domain provides representation for ARPA Internet \spad{IP4} addresses.
41223`This domain represents identifer AST. This domain differs from Symbol in that it does not support any form of scripting. A value of this domain is a plain old identifier. \blankline
41279`This domain represents AST for conditional expressions.
41337`This domain represents an `import' of types.
41401`This domain represents the `in' iterator syntax.
41459`\indented{1}{This domain implements a container of information} about the AXIOM library
41513`\spadtype{IndexedBits} is a domain to compactly represent large quantities of Boolean data.
41582`\indented{1}{Indexed direct products of abelian groups over an abelian group \spad{A} of} generators indexed by the ordered set \spad{S}. All items have finite support: only non-zero terms are stored.
41692`\indented{1}{Indexed direct products of abelian monoids over an abelian monoid \spad{A} of} generators indexed by the ordered set \spad{S}. All items have finite support. Only non-zero terms are stored.
41805`Indexed direct products of objects over a set \spad{A} of generators indexed by an ordered set \spad{S}. All items have finite support.
41916`\indented{1}{Indexed direct products of ordered abelian monoid sups \spad{A},{}} generators indexed by the ordered set \spad{S}. All items have finite support: only non-zero terms are stored.
42060`\indented{1}{Indexed direct products of ordered abelian monoids \spad{A} of} generators indexed by the ordered set \spad{S}. The inherited order is lexicographical. All items have finite support: only non-zero terms are stored.
42195`\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
42286`\indented{1}{Author: Michael Monagan \spad{July/87},{} modified SMW \spad{June/91}} A FlexibleArray is the notion of an array intended to allow for growth at the end only. Hence the following efficient operations \indented{2}{\spad{append(x,a)} meaning append item \spad{x} at the end of the array \spad{a}} \indented{2}{\spad{delete(a,n)} meaning delete the last item from the array \spad{a}} Flexibl
42286`--e 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,{} 
42286`--it is copied into a smaller array. Flexible arrays provide for an efficient implementation of many data structures in particular heaps,{} stacks and sets.
42392`\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 rathe
42392`--r than as a mere wrapper for LISP lists.
42462`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
42462`-- first element of a 'Row' is the same as the index of the first column in a matrix and vice versa.
42612`\indented{1}{Author Micheal Monagan \spad{Aug/87}} This is the basic one dimensional array data type.
42714`This domain implements low-level strings
42780`\indented{1}{An IndexedTwoDimensionalArray is a 2-dimensional array where} the minimal row and column indices are parameters of the type. Rows and columns are returned as IndexedOneDimensionalArray's with minimal indices matching those of the IndexedTwoDimensionalArray. The index of the 'first' row may b
42780`--e 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.
42982`\indented{2}{This type represents vector like objects with varying lengths} and a user-specified initial index.
43143`Functions defined on streams with entries in two sets.
43222`This package implements 'infinite tuples' for the interpreter. The representation is a stream.
43301`Algebraic closure of the rational numbers.
43369`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}.
43493`Internal implementation of a free abelian monoid.
43620`\indented{1}{This is an internal type which provides an implementation of} 2-dimensional arrays as PrimitiveArray's of PrimitiveArray's.
43820`This domain implements Zp,{} the \spad{p}-adic completion of the integers. This is an internal domain.
43916`InnerPrimeField(\spad{p}) implements the field with \spad{p} elements. Note: argument \spad{p} MUST be a prime (this domain does not check). See \spadtype{PrimeField} for a domain that does check.
44001`InnerSparseUnivariatePowerSeries is an internal domain \indented{2}{used for creating sparse Taylor and Laurent series.}
44121`This domain is used to provide a conditional "add" domain for the implementation of \spadtype{Table}.
44279`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.
44347`This domain provides representation for binary files open for input operations. `Binary' here means that the conduits do not interpret their contents.
44415`Domain of parsed forms which can be passed to the interpreter. This is also the interface between algebra code and facilities in the interpreter.
44525`\indented{2}{This domain provides representation for binary files open} \indented{2}{for input and output operations.} See Also: InputBinaryFile,{} OutputBinaryFile
44605`This domain is a datatype for (signed) integer values of precision 16 bits.
44658`This domain is a datatype for (signed) integer values of precision 32 bits.
44711`This domain is a datatype for (signed) integer values of precision 64 bits.
44764`This domain is a datatype for (signed) integer values of precision 8 bits.
44815`IntegerMod(\spad{n}) creates the ring of integers reduced modulo the integer \spad{n}.
44892`\spadtype{Integer} provides the domain of arbitrary precision integers.
44951`\blankline
45006`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 kee
45006`--ping both parts separately. The logs are not explicitly computed.
45088`This domain provides representations for the intermediate form data structure used by the Spad elaborator.
45161`This domain provides representations for internal type form.
45224`\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.
45309`This domain represents a `has' expression.
45367`This is the datatype for the JVM bytecodes.
45427`JVM class file access bitmask and values.
45494`JVM class file constant pool tags.
45557`JVM class field access bitmask and values.
45620`JVM class method access bitmask and values.
45684`This is the datatype for the JVM opcodes.
45739`This domain represents the join of categories ASTs.
45801`A kernel over a set \spad{S} is an operator applied to a given list of arguments from \spad{S}.
45868`This domain allows a random access file to be viewed both as a table and as a file object.
45990`This domain implements Kleene's 3-valued propositional logic.
46066`\indented{1}{Univariate polynomials with negative and positive exponents.} Author: Manuel Bronstein Date Created: May 1988 Date Last Updated: 26 Apr 1990
46201`This domain represents assignment expressions.
46261`This domain provides a simple way to save values in files.
46327`Management of the Lie Group associated with a free nilpotent Lie algebra. Every Lie bracket with length greater than \axiom{Order} are assumed to be null. The implementation inherits from the \spadtype{XPBWPolynomial} domain constructor: Lyndon coordinates are exponential coordinates of the second kind. \newline Author: Michel Petitot (petitot@lifl.fr).
46451`This type supports Lie polynomials in Lyndon basis see Free Lie Algebras by \spad{C}. Reutenauer (Oxford science publications). \newline Author: Michel Petitot (petitot@lifl.fr).
46561`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.
46711`\indented{1}{Author: Gabriel Dos Reis} Date Created: July 2,{} 2010 Date Last Modified: July 2,{} 2010 Descrption: \indented{2}{Representation of a vector space basis,{} given by symbols.}
46791`A simple data structure for elements that form a vector space of finite dimension over a given field,{} with a given symbolic basis.
46879`A simple data structure for linear forms on a vector space of finite dimension over a given field,{} with a given symbolic basis.
46965`\spad{LinearOrdinaryDifferentialOperator1} defines a ring of differential operators with coefficients in a differential ring A. Multiplication of operators corresponds to functional composition: \indented{4}{\spad{(L1 * L2).(f) = L1 L2 f}}
47089`\spad{LinearOrdinaryDifferentialOperator2} defines a ring of differential operators with coefficients in a differential ring A and acting on an A-module \spad{M}. Multiplication of operators corresponds to functional composition: \indented{4}{\spad{(L1 * L2).(f) = L1 L2 f}}
47253`\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}}
47377`This internal package represents monoid (abelian or not,{} with or without inverses) as lists and provides some common operations to the various flavors of monoids.
47555`\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}.
47616`This domain represents AST for Spad literals.
47692`LocalAlgebra produces the localization of an algebra,{} \spadignore{i.e.} fractions whose numerators come from some \spad{R} algebra.
47808`Localize(\spad{M},{}\spad{R},{}\spad{S}) produces fractions with numerators from an \spad{R} module \spad{M} and denominators from some multiplicative subset \spad{D} of \spad{R}.
47918`Lyndon words over arbitrary (ordered) symbols: see Free Lie Algebras by \spad{C}. Reutenauer (Oxford science publications). A Lyndon word is a word which is smaller than any of its right factors \spad{w}.\spad{r}.\spad{t}. the pure lexicographical ordering. If \axiom{a} and \axiom{\spad{b}} are two Lyndon words such that \axiom{a < \spad{b}} holds \spad{w}.\spad{r}.\spad{t} lexicographical ordering then \axiom{a*b} is a Lyndon wor
47918`--d. Parenthesized Lyndon words can be generated from symbols by using the following rule: \axiom{[[a,{}\spad{b}],{}\spad{c}]} is a Lyndon word iff \axiom{a*b < \spad{c} <= \spad{b}} holds. Lyndon words are internally represented by binary trees using the \spadtype{Magma} domain constructor. Two ordering are provided: lexicographic and length-lexicographic. \newline Author : Michel Petitot (petitot@lifl.fr).
47991`A domain which models the complex number representation used by machines in the AXIOM-NAG link.
48067`A domain which models the floating point representation used by machines in the AXIOM-NAG link.
48134`A domain which models the integer representation used by machines in the AXIOM-NAG link.
48208`This domain represents the syntax of a macro definition.
48272`This type is the basic representation of parenthesized words (binary trees over arbitrary symbols) useful in \spadtype{LiePolynomial}. \newline Author: Michel Petitot (petitot@lifl.fr).
48340`This domain represents a mapping type AST. A mapping AST \indented{2}{is a syntactic description of a function type,{} \spadignore{e.g.} its result} \indented{2}{type and the list of its argument types.}
48405`\spad{Mapping(T,S)} is a primitive type in AXIOM used to represent mappings from source type \spad{S} to target type \spad{T}. Similarly, \spad{Mapping(T,A,B)} denotes a mapping from source type \spad{(A,B)} to target type \spad{T}.
48447`\spadtype{MathMLFormat} provides a coercion from \spadtype{OutputForm} to MathML format.
48507`\spadtype{Matrix} is a matrix domain where 1-based indexing is used for both rows and columns.
48593`This domain implements the notion of optional value,{} where a computation may fail to produce expected value.
48668`This package \undocumented
48792`\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}
48985`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}
49175`This package \undocumented
49340`Algebra of ADDITIVE operators on a module.
49420`\indented{1}{MoebiusTransform(\spad{F}) is the domain of fractional linear (Moebius)} transformations over \spad{F}.
49486`\spadtype{MonoidRing}(\spad{R},{}\spad{M}),{} implements the algebra of all maps from the monoid \spad{M} to the commutative ring \spad{R} with finite support. Multiplication of two maps \spad{f} and \spad{g} is defined to map an element \spad{c} of \spad{M} to the (convolution) sum over {\em f(a)g(b)} such that {\em ab = c}. Thus \spad{M} can be identified with a canonical basis and the maps can also be considered as formal linear comb
49486`--inations of the elements in \spad{M}. Scalar multiples of a basis element are called monomials. A prominent example is the class of polynomials where the monoid is a direct product of the natural numbers with pointwise addition. When \spad{M} is \spadtype{FreeMonoid Symbol},{} one gets polynomials in infinitely many non-commuting variables. Another application area is representation theory of finite groups \spad{G},{} where modules over \spadtype{MonoidRing}(\spad{R},{}\spad{G}) are studied.
49553`A multiset is a set with multiplicities.
49629`\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.
49788`A post-facto extension for \axiomType{SMP} in order to speed up operations related to pseudo-division and gcd. This domain is based on the \axiomType{NSUP} constructor which is itself a post-facto extension of the \axiomType{SUP} constructor.
49947`A post-facto extension for \axiomType{SUP} in order to speed up operations related to pseudo-division and gcd for both \axiomType{SUP} and,{} consequently,{} \axiomType{NSMP}.
50048`\spadtype{NonNegativeInteger} provides functions for non \indented{2}{negative integers.}
50122`\spadtype{None} implements a type with no objects. It is mainly used in technical situations where such a thing is needed (\spadignore{e.g.} the interpreter and some of the internal \spadtype{Expression} code).
50425`\axiom{ODEIntensityFunctionsTable()} provides a dynamic table and a set of functions to store details found out about sets of ODE's.
50482`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
50482`-- in addition the imaginary parts \spad{E},{} \spad{I},{} \spad{J},{} \spad{K}.
50560`This is the domain of 1-based one dimensional arrays
50653`Adjunction of a complex infinity to a set. Date Created: 4 Oct 1989 Date Last Updated: 1 Nov 1989
50733`\spadtype{OpenMathConnection} provides low-level functions for handling connections to and from \spadtype{OpenMathDevice}\spad{s}.
50780`\spadtype{OpenMathDevice} provides support for reading and writing openMath objects to files,{} strings etc. It also provides access to low-level operations from within the interpreter.
50822`\spadtype{OpenMathEncoding} is the set of valid OpenMath encodings.
50884`\spadtype{OpenMathErrorKind} represents different kinds of OpenMath errors: specifically parse errors,{} unknown CD or symbol errors,{} and read errors.
50948`\spadtype{OpenMathError} is the domain of OpenMath errors.
51007`This the datatype for an operator-signature pair.
51087`Algebra of ADDITIVE operators over a ring.
51138`This constructor creates the \spadtype{MonogenicLinearOperator} domain which is ``opposite'' in the ring sense to \spad{P}. That is,{} as sets \spad{P = \$} but \spad{a * b} in \spad{\$} is equal to \spad{b * a} in \spad{P}.
51267`\indented{1}{Author : Larry Lambe} Date created : 14 August 1988 Date Last Updated : 11 March 1991 Description : A domain used in order to take the free \spad{R}-module on the Integers \spad{I}. This is actually the forgetful functor from OrderedRings to OrderedSets applied to \spad{I}
51320`Adjunction of two real infinites quantities to a set. Date Created: 4 Oct 1989 Date Last Updated: 1 Nov 1989
51399`\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}.
51554`\indented{3}{The free monoid on a set \spad{S} is the monoid of finite products of} the form \spad{reduce(*,[si ** ni])} where the \spad{si}'s are in \spad{S},{} and the \spad{ni}'s are non-negative integers. The multiplication is not commutative. For two elements \spad{x} and \spad{y} the relation \spad{x < y} holds if either \spad{length(x) < length(y)} holds or if these lengths are equal and if \spad{x} is small
51554`--er than \spad{y} \spad{w}.\spad{r}.\spad{t}. the lexicographical ordering induced by \spad{S}. This domain inherits implementation from \spadtype{FreeMonoid}.
51643`This domain turns any total ordering \spad{f} on a type \spad{T} into a model of the category \spadtype{OrderedType}.
51734`This domain implements ordered variables
51826`\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
52027`\spadtype{OrderlyDifferentialVariable} adds a commonly used orderly ranking to the set of derivatives of an ordered list of differential indeterminates. An orderly ranking is a ranking \spadfun{<} of the derivatives with the property that for two derivatives \spad{u} and \spad{v},{} \spad{u} \spadfun{<} \spad{v} if the \spadfun{order} of \spad{u} is less than that of \spad{v}. This domain belongs to \spadtyp
52027`--e{DifferentialVariableCategory}. It defines \spadfun{weight} to be just \spadfun{order},{} and it defines an orderly ranking \spadfun{<} on derivatives \spad{u} via the lexicographic order on the pair (\spadfun{order}(\spad{u}),{} \spadfun{variable}(\spad{u})).
52123`This constructor produces an ordinary differential ring from a partial differential ring by specifying a variable.
52272`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.
52414`This domain provides representation for binary files open for output operations. `Binary' here means that the conduits do not interpret their contents.
52485`This domain is used to create and manipulate mathematical expressions for output. It is intended to provide an insulating layer between the expression rendering software (\spadignore{e.g.} TeX,{} or Script) and the output coercions in the various domains.
52543`This domain represents set of overloaded operators (in fact operator descriptors).
52602`Stream-based implementation of Zp: \spad{p}-adic numbers are represented as sum(\spad{i} = 0..,{} a[\spad{i}] * p^i),{} where the a[\spad{i}] lie in 0,{}1,{}...,{}(\spad{p} - 1).
52672`This is the category of stream-based representations of Qp.
52809`Stream-based implementation of Qp: numbers are represented as sum(\spad{i} = \spad{k}..,{} a[\spad{i}] * p^i) where the a[\spad{i}] lie in 0,{}1,{}...,{}(\spad{p} - 1).
52908`\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.
52966`This domain describes four groups of color shades (palettes).
53021`Representation of parameters to functions or constructors. For the most part,{} they are Identifiers. However,{} in very cases,{} they are "flags",{} \spadignore{e.g.} string literals.
53089`ParametricPlaneCurve is used for plotting parametric plane curves in the affine plane.
53163`ParametricSpaceCurve is used for plotting parametric space curves in affine 3-space.
53237`ParametricSurface is used for plotting parametric surfaces in affine 3-space.
53307`The domain \spadtype{PartialFraction} implements partial fractions over a euclidean domain \spad{R}. This requirement on the argument domain allows us to normalize the fractions. Of particular interest are the 2 forms for these fractions. The ``compact'' form has only one fractional term per prime in the denominator,{} while the ``p-adic'' form expands each numerator \spad{p}-adically via the prime \spad{p} in the denominator. For c
53307`--omputational efficiency,{} the compact form is used,{} though the \spad{p}-adic form may be gotten by calling the function \spadfunFrom{padicFraction}{PartialFraction}. For a general euclidean domain,{} it is not known how to factor the denominator. Thus the function \spadfunFrom{partialFraction}{PartialFraction} takes as its second argument an element of \spadtype{Factored(R)}.
53378`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}.
53457`A PatternMatchListResult is an object internally returned by the pattern matcher when matching on lists. It is either a failed match,{} or a pair of PatternMatchResult,{} one for atoms (elements of the list),{} and one for lists.
53578`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.
53673`Patterns for use by the pattern matcher.
53742`\indented{1}{A PendantTree(\spad{S})is either a leaf? and is an \spad{S} or has} a left and a right both PendantTree(\spad{S})'s
53832`PermutationGroup implements permutation groups acting on a set \spad{S},{} \spadignore{i.e.} all subgroups of the symmetric group of \spad{S},{} represented as a list of permutations (generators). Note that therefore the objects are not members of the \Language category \spadtype{Group}. Using the idea of base and strong generators by Sims,{} basic routines and algorithms are implemented so that the word problem for permutati
53832`--on groups can be solved.
53910`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}{
53910`--of equal length representing preimages and images.}
53991`\indented{1}{Symbolic fractions in \%\spad{pi} with integer coefficients;} \indented{1}{The point for using \spad{Pi} as the default domain for those fractions} \indented{1}{is that \spad{Pi} is coercible to the float types,{} and not Expression.} Date Created: 21 Feb 1990 Date Last Updated: 12 Mai 1992
54034`\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:
54120`Plot3D supports parametric plots defined over a real number system. A real number system is a model for the real numbers and as such may be an approximation. For example,{} floating point numbers and infinite continued fractions are real number systems. The facilities at this point are limited to 3-dimensional parametric plots.
54189`The Plot domain supports plotting of functions defined over a real number system. A real number system is a model for the real numbers and as such may be an approximation. For example floating point numbers and infinite continued fractions. The facilities at this point are limited to 2-dimensional plots or either a single function or a parametric function.
54254`This domain provides the internal representation of polynomials in non-commutative variables written over the Poincare-Birkhoff-Witt basis. See the \spadtype{XPBWPolynomial} domain constructor. See Free Lie Algebras by \spad{C}. Reutenauer (Oxford science publications). \newline Author: Michel Petitot (petitot@lifl.fr).
54348`This domain implements points in coordinate space
54401`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 use
54401`--d 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.
54581`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.
54687`\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.
54791`This domain represents network port numbers (notable TCP and UDP).
54849`\spadtype{PositiveInteger} provides functions for \indented{2}{positive integers.}
54919`This domain represents `pretend' expressions.
54984`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.
55063`\indented{1}{This provides a fast array type with no bound checking on elt's.} Minimum index is 0 in this type,{} cannot be changed
55142`This domain implements cartesian product
55227`\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.
55296`This package collects unary functions operating on propositional formulae.
55382`This package collects binary functions operating on propositional formulae.
55484`This domain implements propositional formula build over a term domain,{} that itself belongs to PropositionalLogic
55574`This domain provides modest support for quadratic forms.
55662`\spadtype{QuasiAlgebraicSet} constructs a domain representing quasi-algebraic sets,{} which is the intersection of a Zariski closed set,{} defined as the common zeros of a given list of polynomials (the defining polynomials for equations),{} and a principal Zariski open set,{} defined as the complement of the common zeros of a 
55662`--polynomial \spad{f} (the defining polynomial for the inequation). This domain provides simplification of a user-given representation using groebner basis computations. There are two simplification routines: the first function \spadfun{idealSimplify} uses groebner basis of ideals alone,{} while the second,{} \spadfun{simplify} uses both groebner basis and factorization. The resulting defining equations \spad{L} always form a groebner basis,{} and the resulting defining inequation \spad{f} is al
55662`--ways reduced. The function \spadfun{simplify} may be applied several times if desired. A third simplification routine \spadfun{radicalSimplify} is provided in \spadtype{QuasiAlgebraicSet2} for comparison study only,{} as it is inefficient compared to the other two,{} as well as is restricted to only certain coefficient domains. For detail analysis and a comparison of the three methods,{} please consult the reference cited. \blankline A polynomial function \spad{q} defined on the quasi-algebrai
55662`--c set is equivalent to its reduced form with respect to \spad{L}. While this may be obtained using the usual normal form algorithm,{} there is no canonical form for \spad{q}. \blankline The ordering in groebner basis computation is determined by the data type of the input polynomials. If it is possible we suggest to use refinements of total degree orderings.
55840`This domain represents the syntax of a quasiquote \indented{2}{expression.}
55908`\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.}
55981`This domain implements simple database queries
56053`Linked List implementation of a Queue
56124`Function field defined by y**n = \spad{f}(\spad{x}).
56364`This domain allows rational numbers to be presented as repeating decimal expansions or more generally as repeating expansions in any base.
56454`This domain represents the notion of binding a variable to range over a specific segment (either bounded,{} or half bounded).
56535`This domain implements the real closure of an ordered field.
56628`\spad{Record(a:A,b:B,...,c:C)} is a primitive type in AXIOM used to represent composite objects made up of objects of type \spad{A}, \spad{B},..., \spad{C} which are indexed by "keys" (identifiers) \spad{a},\spad{b},...,\spad{c}.
56680`\spadtype{RectangularMatrix} is a matrix domain where the number of rows and the number of columns are parameters of the domain.
56857`This domain represents list reduction syntax.
56922`\indented{1}{\spadtype{Reference} is for making a changeable instance} of something.
56975`A domain for regular chains (\spadignore{i.e.} regular triangular sets) over a Gcd-Domain and with a fix list of variables. This is just a front-end for the \spadtype{RegularTriangularSet} domain constructor.
57211`This domain provides an implementation of regular chains. Moreover,{} the operation \axiomOpFrom{zeroSetSplit}{RegularTriangularSetCategory} is an implementation of a new algorithm for solving polynomial systems by means of regular chains.\newline References : \indented{1}{[1] \spad{M}. MORENO MAZA "A new algorithm f
57211`--or computing triangular} \indented{5}{decomposition of algebraic varieties" NAG Tech. Rep. 4/98.}
57400`This domain represents the `repeat' iterator syntax.
57463`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
57659`This domain represents `restrict' expressions.
57726`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.
57794`This domain represents `return' expressions.
57857`\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.
57985`\axiomType{RightOpenIntervalRootCharacterization} provides work with interval root coding.
58208`\spadtype{RomanNumeral} provides functions for converting \indented{1}{integers to roman numerals.}
58274`\axiomType{RoutinesTable} implements a database and associated tuning mechanisms for a set of known NAG routines
58350`This domain implements named rules
58418`A ruleset is a set of pattern matching rules grouped together.
58545`This is the datatype of OpenAxiom runtime values. It exists solely for internal purposes.
58598`This domain allows the manipulation of Lisp values over arbitrary atomic types.
58775`This domain allows the manipulation of the usual Lisp values.
58874`\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: January 18,{} 2008. A `Scope' is a sequence of contours.
58937`This domain represents segement expressions.
59001`This domain is used to provide the function argument syntax \spad{v=a..b}. This is used,{} for example,{} by the top-level \spadfun{draw} functions.
59063`This type is used to specify a range of values from type \spad{S}.
59128`This domain represents a block of expressions.
59193`\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
59403`\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{Different
59403`--ialVariableCategory}. 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})).
59502`\spadtype{SetOfMIntegersInOneToN} implements the subsets of \spad{M} integers in the interval \spad{[1..n]}
59601`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. Specifica
59601`--lly,{} 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 \spa
59601`--d{O(n log n)}} \indented{2}{\spad{insert(x,t)} and \spad{remove(x,t)} is \spad{O(n)}}
59662`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.}
59728`This is the datatype for operation signatures as \indented{2}{used by the compiler and the interpreter.\space{2}Note that this domain} \indented{2}{differs from SignatureAst.} See also: ConstructorCall,{} Domain.
59781`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 th
59781`--an 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.
59913`\axiomType{SimpleFortranProgram(\spad{f},{}type)} provides a simple model of some FORTRAN subprograms,{} making it possible to coerce objects of various domains into a FORTRAN subprogram called \axiom{\spad{f}}. These can then be translated into legal FORTRAN code.
60029`SingleInteger is intended to support machine integer arithmetic.
60095`This trivial domain lets us build Univariate Polynomials in an anonymous variable
60160`This domain represents a kind of base domain \indented{2}{for Spad syntax domain.\space{2}It merely exists as a kind of} \indented{2}{of abstract base in object-oriented programming language.} \indented{2}{However,{} this is not an abstract class.}
60208`\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.
60344`This domain provides multivariate Taylor series with variables from an arbitrary ordered set. A Taylor series is represented by a stream of polynomials from the polynomial domain SMP. The \spad{n}th element of the stream is a form of degree \spad{n}. SMTS is an internal domain.
60543`A sparse table has a default entry,{} which is returned if no other value has been explicitly stored for a key.
60646`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
60646`--{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.}
60843`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.
60940`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} \indent
60940`--ed{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.}
61139`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}.
61284`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.\s
61284`--pace{2}For example,{}} \indented{2}{\spadtype{SparseUnivariateTaylorSeries}(Integer,{}\spad{x},{}3) represents Taylor} \indented{2}{series in \spad{(x - 3)} with \spadtype{Integer} coefficients.}
61421`\indented{2}{This type represents the finite direct or cartesian product of an} underlying ordered component type. The vectors are ordered as if they were split into two blocks. The \spad{dim1} parameter specifies the length of the first block. The ordering is lexicographic between the blocks but acts like \spadtype{HomogeneousDirectProduct} w
61421`--ithin each block. This type is a suitable third argument for \spadtype{GeneralDistributedMultivariatePolynomial}.
61583`This domain exports a modest implementation for the vertices of splitting trees. These vertices are called here splitting nodes. Every of these nodes store 3 informations. The first one is its value,{} that is the current expression to evaluate. The second one is its condition,{} that is the hypothesis under which the value has to be evaluated. The last one is its status,{} that is a boolean f
61583`--lag which is \spad{true} iff the value is the result of its evaluation under its condition. Two splitting vertices are equal iff they have the sane values and the same conditions (so their status do not matter).
61694`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(
61694`--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 i
61694`--f 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.
61832`This domain provides an implementation of square-free regular chains. Moreover,{} the operation \axiomOpFrom{zeroSetSplit}{SquareFreeRegularTriangularSetCategory} is an implementation of a new algorithm for solving polynomial systems by means of regular chains.\newline References : \indented{1}{[
61832`--1] \spad{M}. MORENO MAZA "A new algorithm for computing triangular} \indented{5}{decomposition of algebraic varieties" NAG Tech. Rep. 4/98.} \indented{2}{Version: 2}
62042`\spadtype{SquareMatrix} is a matrix domain of square matrices,{} where the number of rows (= number of columns) is a parameter of the type.
62197`Linked List implementation of a Stack
62261`This domain represents an arithmetic progression iterator syntax.
62323`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.
62394`This domain provides tables where the keys are strings. A specialized hash function for strings is used.
62539`This domain implements some global properties of subspaces.
62613`This domain \undocumented
62697`This domain represents the filter iterator syntax.
62764`This domain implements "such that" forms
62850`This domain builds representations of boolean expressions for use with the \axiomType{FortranCode} domain.
62915`Create and manipulate a symbol table for generated FORTRAN code
62985`Basic and scripted symbols.
63037`This domain implements symmetric polynomial
63136`\indented{1}{This domain provides a simple domain,{} general enough for} \indented{2}{building complete representation of Spad programs as objects} \indented{2}{of a term algebra built from ground terms of type integers,{} foats,{}} \indented{2}{identifiers,{} and strings.} \indented{2}{This domain differs from InputForm in that it represents} \indented{2}{any entity in a Spad program,{} not just expressions.\space{2}Furthermore,{}} \indented{2}{while 
63136`--InputForm may contain atoms like vectors and other Lisp} \indented{2}{objects,{} the Syntax domain is supposed to contain only that} \indented{2}{initial algebra build from the primitives listed above.} Related Constructors: \indented{2}{Integer,{} DoubleFloat,{} Identifier,{} String,{} SExpression.} See Also: SExpression,{} InputForm. The equality supported by this domain is structural.
63187`This domain implements sized (signed) integer datatypes parameterized by the precision (or width) of the underlying representation. The intent is that they map directly to the hosting hardware natural integer datatypes. Consequently,{} natural values for \spad{N} are: 8,{} 16,{} 32,{} 64,{} etc. These datatypes are mostly useful for system programming tasks,{} \spadignore{i.e.} interfacting with the hosting operating system
63187`--,{} reading/writing external binary format files.
63267`This domain implements sized (unsigned) integer datatypes parameterized by the precision (or width) of the underlying representation. The intent is that they map directly to the hosting hardware natural integer datatypes. Consequently,{} natural values for \spad{N} are: 8,{} 16,{} 32,{} 64,{} etc. These datatypes are mostly useful for system programming tasks,{} \spadignore{i.e.} interfacting with the hosting ope
63267`--rating system,{} reading/writing external binary format files.
63358`This domain is a datatype system-level pointer values.
63408`The package \spadtype{System} provides information about the runtime system and its characteristics.
63454`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}
63559`\indented{1}{The tableau domain is for printing Young tableaux,{} and} coercions to and from List List \spad{S} where \spad{S} is a set.
63610`\spadtype{TaylorSeries} is a general multivariate Taylor series domain over the ring Coef and with variables of type Symbol.
63709`\indented{1}{Author: Gabriel Dos Reis} Date Created: April 17,{} 2010 Date Last Modified: April 17,{} 2010
63797`\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{setEpi
63797`--logue!}) so that contain the appropriate tags for printing. For example,{} the prologue and epilogue might simply contain ``\verb+\[+'' and ``\verb+\]+'',{} respectively,{} so that the TeX section will be printed in LaTeX display math mode.
63850`This domain provides an implementation of text files. Text is stored in these files using the native character set of the computer.
63925`Creates and manipulates one global symbol table for FORTRAN code generation,{} containing details of types,{} dimensions,{} and argument lists.
63996`This domain represents three dimensional matrices over a general object type
64154`The domain ThreeSpace is used for creating three dimensional objects using functions for defining points,{} curves,{} polygons,{} constructs and the subspaces containing them.
64218`\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.
64291`\indented{2}{Package for constructing tubes around 3-dimensional parametric curves.} Domain of tubes around 3-dimensional parametric curves.
64360`\indented{1}{This domain is used to interface with the interpreter's notion} of comma-delimited sequences of values.
64437`\indented{1}{A TwoDimensionalArray is a two dimensional array with} 1-based indexing for both rows and columns.
64575`TwoDimensionalViewport creates viewports to display graphs.
64644`This domain represents a type AST.
64696`This domain is a datatype for (unsigned) integer values of precision 16 bits.
64751`This domain is a datatype for (unsigned) integer values of precision 32 bits.
64806`This domain is a datatype for (unsigned) integer values of precision 64 bits.
64861`This domain is a datatype for (unsigned) integer values of precision 8 bits.
64914`\spad{Union(A,B,...,C)} is a primitive type in AXIOM used to represent objects of type \spad{A} or of type \spad{B} or...or of type \spad{C}.
64958`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)}.
65131`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 
65131`--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.}
65315`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.
65416`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)}.
65591`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 s
65591`--eries 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.
65891`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,{} an
65891`--d 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.}
66077`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}.
66224`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) repre
66224`--sents Taylor series in \spad{(x - 3)} with \spadtype{Integer} coefficients.
66354`This domain provides segments which may be half open. That is,{} ranges of the form \spad{a..} or \spad{a..b}.
66431`This domain implements variables
66499`This type represents vector like objects with varying lengths and indexed by a finite segment of integers starting at 1.
66565`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.
66626`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.
66849`This domain represents the syntax of a `where' expression.
66913`This domain represents the `while' iterator syntax.
66977`A domain constructor of the category \axiomType{GeneralTriangularSet}. The only requirement for a list of polynomials to be a member of such a domain is the following: no polynomial is constant and two distinct polynomials have distinct main variables. Such a triangular set may not be auto-reduced or consistent. The 
66977`--\axiomOpFrom{construct}{WuWenTsunTriangularSet} operation does not check the previous requirement. Triangular sets are stored as sorted lists \spad{w}.\spad{r}.\spad{t}. the main variables of their members. Furthermore,{} this domain exports operations dealing with the characteristic set method of Wu Wen Tsun and some optimizations mainly proposed by Dong Ming Wang.\newline References : \indented{1}{[1] \spad{W}. \spad{T}. WU "A Zero Structure Theorem for polynomial equations solving"} \indent
66977`--ed{6}{MM Research Preprints,{} 1987.} \indented{1}{[2] \spad{D}. \spad{M}. WANG "An implementation of the characteristic set method in Maple"} \indented{6}{Proc. \spad{DISCO'92}. Bath,{} England.}
67166`\indented{2}{This type supports distributed multivariate polynomials} whose variables do not commute. The coefficient ring may be non-commutative too. However,{} coefficients and variables commute.
67285`This domain constructor implements polynomials in non-commutative variables written in the Poincare-Birkhoff-Witt basis from the Lyndon basis. These polynomials can be used to compute Baker-Campbell-Hausdorff relations. \newline Author: Michel Petitot (petitot@lifl.fr).
67400`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.
67477`\indented{2}{This type supports multivariate polynomials} whose set of variables is \spadtype{Symbol}. The representation is recursive. The coefficient ring may be non-commutative and the variables do not commute. However,{} coefficients and variables commute.
67555`\indented{2}{This type supports multivariate polynomials} whose variables do not commute. The representation is recursive. The coefficient ring may be non-commutative. Coefficients and variables commute.
67663`This domain provides representations of Young diagrams.
67798`\axiomType{d01ajfAnnaType} is a domain of \axiomType{NumericalIntegrationCategory} for the NAG routine D01AJF,{} a general numerical integration routine which can handle some singularities in the input function. The function \axiomFun{measure} measures the usefulness of the routine D01AJF for the given problem. The function \axiomFun{numericalIntegration} performs the integration by using \axiomType{NagIntegrationPackage}.
67867`\axiomType{d01akfAnnaType} is a domain of \axiomType{NumericalIntegrationCategory} for the NAG routine D01AKF,{} a numerical integration routine which is is suitable for oscillating,{} non-singular functions. The function \axiomFun{measure} measures the usefulness of the routine D01AKF for the given problem. The function \axiomFun{numericalIntegration} performs the integration by using \axiomType{NagIntegrationPackage}.
67936`\axiomType{d01alfAnnaType} is a domain of \axiomType{NumericalIntegrationCategory} for the NAG routine D01ALF,{} a general numerical integration routine which can handle a list of singularities. The function \axiomFun{measure} measures the usefulness of the routine D01ALF for the given problem. The function \axiomFun{numericalIntegration} performs the integration by using \axiomType{NagIntegrationPackage}.
68005`\axiomType{d01amfAnnaType} is a domain of \axiomType{NumericalIntegrationCategory} for the NAG routine D01AMF,{} a general numerical integration routine which can handle infinite or semi-infinite range of the input function. The function \axiomFun{measure} measures the usefulness of the routine D01AMF for the given problem. The function \axiomFun{numericalIntegration} performs the integration by using \axiomType{NagIntegrationPackage}
68005`--.
68074`\axiomType{d01anfAnnaType} is a domain of \axiomType{NumericalIntegrationCategory} for the NAG routine D01ANF,{} a numerical integration routine which can handle weight functions of the form cos(\omega \spad{x}) or sin(\omega \spad{x}). The function \axiomFun{measure} measures the usefulness of the routine D01ANF for the given problem. The function \axiomFun{numericalIntegration} performs the integration by using \axiomType{NagIntegra
68074`--tionPackage}.
68143`\axiomType{d01apfAnnaType} is a domain of \axiomType{NumericalIntegrationCategory} for the NAG routine D01APF,{} a general numerical integration routine which can handle end point singularities of the algebraico-logarithmic form \spad{w}(\spad{x}) = (\spad{x}-a)^c * (\spad{b}-\spad{x})^d. The function \axiomFun{measure} measures the usefulness of the routine D01APF for the given problem. The function \axiomFun{numericalIntegration} pe
68143`--rforms the integration by using \axiomType{NagIntegrationPackage}.
68212`\axiomType{d01aqfAnnaType} is a domain of \axiomType{NumericalIntegrationCategory} for the NAG routine D01AQF,{} a general numerical integration routine which can solve an integral of the form \newline \centerline{\inputbitmap{/home/bjd/Axiom/anna/hypertex/bitmaps/d01aqf.xbm}} The function \axiomFun{measure} measures the usefulness of the routine D01AQF for the given problem. The function \axiomFun{numericalIntegration} performs the i
68212`--ntegration by using \axiomType{NagIntegrationPackage}.
68281`\axiomType{d01asfAnnaType} is a domain of \axiomType{NumericalIntegrationCategory} for the NAG routine D01ASF,{} a numerical integration routine which can handle weight functions of the form cos(\omega \spad{x}) or sin(\omega \spad{x}) on an semi-infinite range. The function \axiomFun{measure} measures the usefulness of the routine D01ASF for the given problem. The function \axiomFun{numericalIntegration} performs the integration by u
68281`--sing \axiomType{NagIntegrationPackage}.
68350`\axiomType{d01fcfAnnaType} is a domain of \axiomType{NumericalIntegrationCategory} for the NAG routine D01FCF,{} a numerical integration routine which can handle multi-dimensional quadrature over a finite region. The function \axiomFun{measure} measures the usefulness of the routine D01GBF for the given problem. The function \axiomFun{numericalIntegration} performs the integration by using \axiomType{NagIntegrationPackage}.
68419`\axiomType{d01gbfAnnaType} is a domain of \axiomType{NumericalIntegrationCategory} for the NAG routine D01GBF,{} a numerical integration routine which can handle multi-dimensional quadrature over a finite region. The function \axiomFun{measure} measures the usefulness of the routine D01GBF for the given problem. The function \axiomFun{numericalIntegration} performs the integration by using \axiomType{NagIntegrationPackage}.
68488`\axiomType{d02bbfAnnaType} is a domain of \axiomType{OrdinaryDifferentialEquationsInitialValueProblemSolverCategory} for the NAG routine D02BBF,{} a ODE routine which uses an Runge-Kutta method to solve a system of differential equations. The function \axiomFun{measure} measures the usefulness of the routine D02BBF for the given problem. The function \axiomFun{ODESolve} performs the integration by using \axiomType{NagOr
68488`--dinaryDifferentialEquationsPackage}.
68572`\axiomType{d02bhfAnnaType} is a domain of \axiomType{OrdinaryDifferentialEquationsInitialValueProblemSolverCategory} for the NAG routine D02BHF,{} a ODE routine which uses an Runge-Kutta method to solve a system of differential equations. The function \axiomFun{measure} measures the usefulness of the routine D02BHF for the given problem. The function \axiomFun{ODESolve} performs the integration by using \axiomType{NagOr
68572`--dinaryDifferentialEquationsPackage}.
68656`\axiomType{d02cjfAnnaType} is a domain of \axiomType{OrdinaryDifferentialEquationsInitialValueProblemSolverCategory} for the NAG routine D02CJF,{} a ODE routine which uses an Adams-Moulton-Bashworth method to solve a system of differential equations. The function \axiomFun{measure} measures the usefulness of the routine D02CJF for the given problem. The function \axiomFun{ODESolve} performs the integration by using \axi
68656`--omType{NagOrdinaryDifferentialEquationsPackage}.
68740`\axiomType{d02ejfAnnaType} is a domain of \axiomType{OrdinaryDifferentialEquationsInitialValueProblemSolverCategory} for the NAG routine D02EJF,{} a ODE routine which uses a backward differentiation formulae method to handle a stiff system of differential equations. The function \axiomFun{measure} measures the usefulness of the routine D02EJF for the given problem. The function \axiomFun{ODESolve} performs the integrati
68740`--on by using \axiomType{NagOrdinaryDifferentialEquationsPackage}.
68824`\axiomType{d03eefAnnaType} is a domain of \axiomType{PartialDifferentialEquationsSolverCategory} for the NAG routines D03EEF/D03EDF.
68907`\axiomType{d03fafAnnaType} is a domain of \axiomType{PartialDifferentialEquationsSolverCategory} for the NAG routine D03FAF.
68990`\axiomType{e04dgfAnnaType} is a domain of \axiomType{NumericalOptimization} for the NAG routine E04DGF,{} a general optimization routine which can handle some singularities in the input function. The function \axiomFun{measure} measures the usefulness of the routine E04DGF for the given problem. The function \axiomFun{numericalOptimization} performs the optimization by using \axiomType{NagOptimisationPackage}.
69060`\axiomType{e04fdfAnnaType} is a domain of \axiomType{NumericalOptimization} for the NAG routine E04FDF,{} a general optimization routine which can handle some singularities in the input function. The function \axiomFun{measure} measures the usefulness of the routine E04FDF for the given problem. The function \axiomFun{numericalOptimization} performs the optimization by using \axiomType{NagOptimisationPackage}.
69130`\axiomType{e04gcfAnnaType} is a domain of \axiomType{NumericalOptimization} for the NAG routine E04GCF,{} a general optimization routine which can handle some singularities in the input function. The function \axiomFun{measure} measures the usefulness of the routine E04GCF for the given problem. The function \axiomFun{numericalOptimization} performs the optimization by using \axiomType{NagOptimisationPackage}.
69200`\axiomType{e04jafAnnaType} is a domain of \axiomType{NumericalOptimization} for the NAG routine E04JAF,{} a general optimization routine which can handle some singularities in the input function. The function \axiomFun{measure} measures the usefulness of the routine E04JAF for the given problem. The function \axiomFun{numericalOptimization} performs the optimization by using \axiomType{NagOptimisationPackage}.
69270`\axiomType{e04mbfAnnaType} is a domain of \axiomType{NumericalOptimization} for the NAG routine E04MBF,{} an optimization routine for Linear functions. The function \axiomFun{measure} measures the usefulness of the routine E04MBF for the given problem. The function \axiomFun{numericalOptimization} performs the optimization by using \axiomType{NagOptimisationPackage}.
69340`\axiomType{e04nafAnnaType} is a domain of \axiomType{NumericalOptimization} for the NAG routine E04NAF,{} an optimization routine for Quadratic functions. The function \axiomFun{measure} measures the usefulness of the routine E04NAF for the given problem. The function \axiomFun{numericalOptimization} performs the optimization by using \axiomType{NagOptimisationPackage}.
69410`\axiomType{e04ucfAnnaType} is a domain of \axiomType{NumericalOptimization} for the NAG routine E04UCF,{} a general optimization routine which can handle some singularities in the input function. The function \axiomFun{measure} measures the usefulness of the routine E04UCF for the given problem. The function \axiomFun{numericalOptimization} performs the optimization by using \axiomType{NagOptimisationPackage}.
69923`\spad{\# x} returns the length of the domain template \spad{x}.
69979`\spad{\# p} returns the number of terms in \spad{p}.
70041`\spad{\#((a1,...,an))} returns \spad{n}.
70113`\spad{\# u} returns the number of items in \spad{u}.
70198`\spad{\#x} returns the sum of all parts of the partition \spad{x}.
70301`\spad{a ** b} is the formal exponential a**b.
70354`\spad{x ** q} is \spad{x} raised to the rational power \spad{q}.
70448`\spad{x ** n} computes the \spad{n}-th power of a square matrix. The power \spad{n} is assumed greater than 1.
71100`\spad{s ** n} returns the product of \spad{s} by itself \spad{n} times.
71695`\spad{s ** n} returns the product of \spad{s} by itself \spad{n} times.
72469`\spad{st1 ** st2} computes the power of a power series \spad{st1} by another power series \spad{st2}.
72564`\spad{st1 ** st2} computes the power of a power series \spad{st1} by another power series \spad{st2}.
72673`\spad{s ** r} raises a Laurent series \spad{s} to a rational power \spad{r}
72791`\spad{z ** r} raises a Puiseaux series \spad{z} to a rational power \spad{r}
72918`\spad{x**n} \undocumented{} See \axiomFunFrom{**}{DivisionRing}
73003`\spad{a ** b} returns the input form corresponding to \spad{a ** b}.
73088`\spad{a ** b} returns the input form corresponding to \spad{a ** b}.
73143`\spad{a ** n} returns the pattern \spad{a ** n}.
73199`\spad{f ** g} creates the equivalent infix form.
73239`\spad{a ** b} returns the pattern \spad{a ** b}.
73279`\spad{f**n} is the function which is the \spad{n}-fold application \indented{1}{of \spad{f}.}
73351`\spad{op**n} \undocumented
73416`\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.
73499`\spad{x ** y} is the rational exponentiation of \spad{x} by the power \spad{y}.
73559`\spad{x**n} returns \spad{x} raised to the integer power \spad{n}.
73606`\spad{x**n} returns \spad{x} raised to the integer power \spad{n}.
73646`\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.
73718`\spad{m**n} computes an integral power of the matrix \spad{m}. Error: if the matrix is not invertible.
73801`\spad{op**n} \undocumented
73855`\spad{x**n} returns \spad{x} * \spad{x} * \spad{x} * ... * \spad{x} (\spad{n} times).
73933`\spad{x ** n} computes a non-negative integral power of the matrix \spad{x}. Error: if the matrix is not square.
74004`\spad{a**n} returns the \spad{n}\spad{-}th power of \spad{a},{} defined by repeated squaring.
74063`\spad{x**n} returns the repeated product of \spad{x} \spad{n} times,{} \spadignore{i.e.} exponentiation.
74115`\spad{I**n} computes the \spad{n}th power of the ideal \spad{I}.
74199`\spad{a**n} returns the \spad{n}\spad{-}th power of \spad{a},{} defined by repeated squaring.
74247`\spad{x**n} returns the repeated product of \spad{x} \spad{n} times,{} \spadignore{i.e.} exponentiation.
74299`\spad{x**y} returns \spad{x} to the power \spad{y}.
74355`\spad{x**y} returns \spad{\#(X**Y)} where \spad{X**Y} is defined \indented{1}{as \spad{\{g| g:Y->X\}}.}
74399`\spad{x ** y} returns the \spad{y}th power of \spad{x} (equal to \spad{exp(y log x)}).
74440`\spad{x ** y} computes \spad{exp(y log x)} where \spad{x >= 0}.
74475`\spad{r * a} returns the power series scalar multiplication of \spad{r} by \spad{a}: \spad{r * [a0,a1,...] = [r * a0,r * a1,...]}
74610`\spad{s * p} returns a point whose coordinates are the scalar multiple of the point \spad{p} by the scalar \spad{s},{} preserving the color,{} or fourth coordinate,{} of \spad{p}.
76327`\spad{p*x} \undocumented
77522`\axiom{\spad{r} * \spad{v}} computes the product of \axiom{\spad{r}} and \axiom{\spad{v}}
78574`\spad{s*r} returns the product \spad{r*s} used by \spadtype{XRecursivePolynomial}
79037`\spad{s * x} returns the product of \spad{x} by \spad{s} on the left.
79086`\spad{s * x} returns the product of \spad{x} by \spad{s} on the left.
79126`\spad{smp*ts} multiplies a TaylorSeries by a monomial SMP.
79200`\spad{a * r} returns the power series scalar multiplication of \spad{a} by r: \spad{[a0,a1,...] * r = [a0 * r,a1 * r,...]}
79273`\spad{a * b} returns the power series (Cauchy) product of \spad{a} and b: \spad{[a0,a1,...] * [b0,b1,...] = [c0,c1,...]} where \spad{ck = sum(i + j = k,ai * bk)}.
79354`\spad{x*y} \undocumented{} See \axiomFunFrom{*}{SemiGroup}
79441`\spad{x*i} returns the product of integer \spad{i} and the series \spad{x}.
79498`\spad{p*r} returns the product of \spad{p} by \spad{r}.
79546`\spad{x * s} returns the product of \spad{x} by \spad{s} on the right.
79595`\spad{x * s} returns the product of \spad{x} by \spad{s} on the right.
79635`\spad{a * b} returns the input form corresponding to \spad{a * b}.
79673`\axiom{x*y} returns the tree \axiom{[\spad{x},{}\spad{y}]}.
79715`\spad{f * g} creates the equivalent infix form.
79754`\spad{a * b} returns the pattern \spad{a * b}.
79793`\spad{f*g} is the function \spad{h} \indented{1}{such that \spad{h x= f(g x)}.}
79856`\spad{s * c},{} returns the color \spad{c},{} whose weighted shade has been scaled by \spad{s}.
79899`\spad{e * s} returns \spad{e} times \spad{s}.
79956`\spad{n * x} is an integer multiple.
80015`\spad{n * y} multiplies each component of the vector \spad{y} by the integer \spad{n}.
80085`\spad{n * x} is left-multiplication by a non negative integer
80143`\spad{n*x} computes the left-multiplication of \spad{x} by the positive integer \spad{n}. This is equivalent to adding \spad{x} to itself \spad{n} times.
80201`\spad{s * c},{} returns the color \spad{c},{} whose weighted shade has been scaled by \spad{s}.
80248`\spad{r*b} returns the product of \spad{r} by \spad{b}.
80301`\spad{r*g} is left module multiplication.
80346`\spad{r*x} is the left scalar multiple of the scalar \spad{r} and the matrix \spad{x}.
80399`\spad{r * y} multiplies the element \spad{r} times each component of the vector \spad{y}.
80457`\spad{r * x} is the product of the row vector \spad{r} and the matrix \spad{x}. Error: if the dimensions are incompatible.
80513`\spad{r * x} is the product of the row vector \spad{r} and the matrix \spad{x}. Error: if the dimensions are incompatible.
80580`\spad{s*x} is the left-dilation of \spad{x} by \spad{s}.
80624`\spad{x*eqn} produces a new equation by multiplying both sides of equation eqn by \spad{x}.
80679`\spad{x * c} is the product of the matrix \spad{x} and the column vector \spad{c}. Error: if the dimensions are incompatible.
80735`\spad{x * c} is the product of the matrix \spad{x} and the column vector \spad{c}. Error: if the dimensions are incompatible.
80802`\spad{t*p} applies the dhmatrix \spad{t} to point \spad{p}
80869`\spad{g*r} is right module multiplication.
80914`\spad{x * r} is the right scalar multiple of the scalar \spad{r} and the matrix \spad{x}.
80967`\spad{y * r} multiplies each component of the vector \spad{y} by the element \spad{r}.
81025`\spad{x * r} returns the product of \spad{x} by \spad{r}. Usefull if \spad{R} is a non-commutative Ring.
81071`\spad{x*s} is the right-dilation of \spad{x} by \spad{s}.
81116`\spad{eqn*x} produces a new equation by multiplying both sides of equation eqn by \spad{x}.
81171`\spad{x * y} is the product of the matrices \spad{x} and \spad{y}. Error: if the dimensions are incompatible.
81225`\spad{a*b} is the product of \spad{a} and \spad{b} in a set with a binary operation.
81259`\spad{x*y} returns the product of \spad{x} and \spad{y}.
81297`\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.
81354`\spad{I*J} computes the product of the ideal \spad{I} and \spad{J}.
81421`\spad{v * x} returns the product of a variable \spad{x} by \spad{x}.
81468`\spad{p + q} computes and returns a point whose coordinates are the sums of the coordinates of the two points \spad{p} and \spad{q},{} using the color,{} or fourth coordinate,{} of the first point \spad{p} as the color also of the point \spad{q}.
81778`\spad{a + b} returns the power series sum of \spad{a} and \spad{b}: \spad{[a0,a1,..] + [b0,b1,..] = [a0 + b0,a1 + b1,..]}
81859`\spad{a + b} returns the input form corresponding to \spad{a + b}.
81897`\spad{f + g} creates the equivalent infix form.
81936`\spad{a + b} returns the pattern \spad{a + b}.
81975`\spad{s + x} returns the sum of \spad{s} and \spad{x}.
82033`\spad{x+eqn} produces a new equation by adding \spad{x} to both sides of equation eqn.
82095`\spad{p + x} returns the sum of \spad{p} and \spad{x}
82158`\spad{eqn+x} produces a new equation by adding \spad{x} to both sides of equation eqn.
82220`\spad{x+y} computes the sum of \spad{x} and \spad{y}.
82265`\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.
82311`\spad{x + y} is the sum of the matrices \spad{x} and \spad{y}. Error: if the dimensions are incompatible.
82365`\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.
82434`\spad{c1 + c2} additively mixes the two colors \spad{c1} and \spad{c2}.
82468`\spad{db1+db2} returns the merge of databases \spad{db1} and \spad{db2}
82508`\spad{I+J} computes the ideal generated by the union of \spad{I} and \spad{J}.
82916`\spad{- a} returns the power series negative of \spad{a}: \spad{- [a0,a1,...] = [- a0,- a1,...]}
82987`\spad{- f} creates the equivalent prefix form.
83023`\spad{-x} is the additive inverse of \spad{x}
83061`\spad{-g} is the additive inverse of \spad{g} in the module of elements of the same grade as \spad{g}.
83104`\spad{-x} returns the negative of the matrix \spad{x}.
83155`\spad{-x} negates all components of the vector \spad{x}.
83217`\spad{p - q} computes and returns a point whose coordinates are the differences of the coordinates of two points \spad{p} and \spad{q},{} using the color,{} or fourth coordinate,{} of the first point \spad{p} as the color also of the point \spad{q}.
83664`\spad{a - b} returns the power series difference of \spad{a} and \spad{b}: \spad{[a0,a1,..] - [b0,b1,..] = [a0 - b0,a1 - b1,..]}
83745`\spad{f - g} creates the equivalent infix form.
83784`\spad{x-eqn} produces a new equation by subtracting both sides of equation eqn from \spad{x}.
83842`\spad{eqn-x} produces a new equation by subtracting \spad{x} from both sides of equation eqn.
83900`\spad{x - y} returns an element \spad{z} such that \spad{z+y=x} or "failed" if no such element exists.
83959`\spad{x-y} is the difference of \spad{x} and \spad{y} \spadignore{i.e.} \spad{x + (-y)}.
84000`\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.
84046`\spad{x - y} is the difference of the matrices \spad{x} and \spad{y}. Error: if the dimensions are incompatible.
84100`\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.
84165`\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}
84243`\spadignore { /\ }returns the logical `meet',{} \spadignore{e.g.} `and'.
84316`\spad{a / d} divides the element \spad{a} by \spad{d}.
84362`\spad{m / d} divides the element \spad{m} by \spad{d}.
84716`\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.
84797`\spad{x/y} \undocumented{} See \axiomFunFrom{/}{Field}
84884`\spad{p/r} returns \spad{p*(1/r)}.
84944`\spad{x / d} divides the element \spad{x} by \spad{d}.
84991`\spad{x / d} divides the element \spad{x} by \spad{d}.
85034`\spad{x/y} division (only works if minimum weight of divisor is zero,{} and if \spad{R} is a Field)
85135`\spad{x/y} division (only works if minimum weight of divisor is zero,{} and if \spad{R} is a Field)
85239`\spad{a / b} returns the input form corresponding to \spad{a / b}.
85277`\spad{f / g} creates the equivalent infix form.
85316`\spad{a / b} returns the pattern \spad{a / b}.
85355`\spad{d1 / d2} returns the fraction \spad{d1} divided by \spad{d2}.
85406`\spad{p1/p2} returns the quotient of \spad{p1} and \spad{p2} as an element of \%.
85552`\spad{x / i} computes the division from \spad{x} by an integer \spad{i}.
85597`\spad{x / i} computes the division from \spad{x} by an integer \spad{i}.
85636`\spad{p/c} divides \spad{p} by the coefficient \spad{c}.
85698`\axiom{x/r} returns the division of \axiom{\spad{x}} by \axiom{\spad{r}}.
85751`\spad{m/r} divides the elements of \spad{m} by \spad{r}. Error: if \spad{r = 0}.
85816`\spad{m/r} divides the elements of \spad{m} by \spad{r}. Error: if \spad{r = 0}.
85896`\spad{x/y} divides the vector \spad{x} by the scalar \spad{y}.
85938`\spad{x/y} divides the element \spad{x} by the element \spad{y}. Error: if \spad{y} is 0.
85972`\spad{x/y} is the same as \spad{x} times the inverse of \spad{y}.
86006`\spad{e1/e2} produces a new equation by dividing the left and right hand sides of equations \spad{e1} and \spad{e2}.
86513`\spad{f <= g} creates the equivalent infix form.
86553`\spad{x <= y} holds if \spad{x} is less or equal than \spad{y} in the current domain.
86599`\spad{gp1 <= gp2} returns \spad{true} if and only if {\em gp1} is a subgroup of {\em gp2}. Note: because of a bug in the parser you have to call this function explicitly by {\em gp1 <=\$(PERMGRP S) gp2}.
86975`\spad{f < g} creates the equivalent infix form.
87014`\spad{x < y} holds if \spad{x} is less than \spad{y} in the current domain.
87059`\spad{p < q} is an order relation on permutations. Note: this order is only total if and only if \spad{S} is totally ordered or \spad{S} is finite.
87115`\spad{gp1 < gp2} returns \spad{true} if and only if {\em gp1} is a proper subgroup of {\em gp2}.
88080`\spad{a=b} tests if \spad{a} and \spad{b} are equal.
88126`\spad{f = g} creates the equivalent infix form.
88165`\spad{a=b} creates an equation.
88203`\spad{x=y} tests if \spad{x} and \spad{y} are equal.
88246`\spad{x=y} tests for equality
88340`\spad{f >= g} creates the equivalent infix form.
88380`\spad{x <= y} holds if \spad{x} is greater or equal than \spad{y} in the current domain.
88468`\spad{f > g} creates the equivalent infix form.
88507`\spad{x > y} holds if \spad{x} is greater than \spad{y} in the current domain.
88552`\spad{AND(x,y)} returns the \axiomType{Switch} expression representing \spad{x and y}.
88761`\spad{Aleph(n)} provides the named (infinite) cardinal number.
88821`\spad{An(x)} \undocumented
88870`\spad{And(n,m)} returns the bit-by-bit logical {\em And} of \spad{n} and \spad{m}.
88916`\spad{And(n,m)} returns the bit-by-bit logical {\em and} of the single integers \spad{n} and \spad{m}.
88960`\spad{B1solve(s)} solves the system (\spad{s}.mat) \spad{z} = \spad{s}.vec for the variables given by the column indices of \spad{s}.cols in terms of the other variables and the right hand side \spad{s}.vec b
88960`--y assuming that the rank is \spad{s}.rank,{} that the system is consistent,{} with the linearly independent equations indexed by the given row indices \spad{s}.rows; the coefficients in \spad{s}.mat involving parameters are treated as polynomials. B1solve(\spad{s}) returns a particular solution to the system and a basis of the homogeneous system (\spad{s}.mat) \spad{z} = 0.
89259`\spad{s by n} creates a new segment in which only every \spad{n}\spad{-}th element is used.
89312`\spad{BasicMethod(n)} returns the factorization of integer \spad{n} by trial division
89386`\spad{Beta(x,y)} returns the beta function applied to \spad{x} and \spad{y}
89445`\spad{Beta(n,m)} \undocumented
89540`\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)}.}
89653`\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)}.}
89739`\spad{Beta(x,y)} is \spad{Gamma(x) * Gamma(y)/Gamma(x+y)}.
89794`\spad{Beta(x,y)} is \spad{Gamma(x) * Gamma(y)/Gamma(x+y)}.
89837`\spad{BumInSepFFE(f)} is a local function,{} exported only because it has multiple conditional definitions.
90039`\spad{Ci(f)} denotes the cosine integral
90088`\spad{Ci(x)} returns the cosine integral of \spad{x},{} \spadignore{i.e.} the integral of \spad{cos(x) / x dx}.
90208`\spad{D()} provides the operator corresponding to a derivation in the ring \spad{A}.
90411`\spad{D x} is a shorthand for \spad{differentiate x}
90928`\spad{D(x,d)} is a shorthand for \spad{differentiate(x,d)}.
90990`\spad{D(x,[s1,...sn])} is a shorthand for \spad{differentiate(x,[s1,...sn])}.
91051`\spad{D(x, n)} returns the \spad{n}\spad{-}th derivative of \spad{x}.
91113`\spad{D(x,v)} is a shorthand for \spad{differentiate(x,v)}
91565`\spad{D(x,d,n)} is a shorthand for \spad{differentiate(x,d,n)}.
91646`\spad{D(x,[s1,...,sn],[n1,...,nn])} is a shorthand for \spad{differentiate(x,[s1,...,sn],[n1,...,nn])}.
91732`\spad{D(x,s,n)} is a shorthand for \spad{differentiate(x,s,n)}.
91806`\spad{EQ(x,y)} returns the \axiomType{Switch} expression representing \spad{x = y}.
92014`\spad{Ei(f)} denotes the exponential integral
92063`\spad{Ei(x)} returns the exponential integral of \spad{x},{} \spadignore{i.e.} the integral of \spad{exp(x)/x dx}.
92117`\spad{F2FG(a + sqrt(-1) b)} returns \spad{a + i b}.
92184`\spad{FG2F(a + i b)} returns \spad{a + sqrt(-1) b}.
92251`\spad{F(n,m)} \undocumented
92343`\spad{FormatArabic(n)} forms an Arabic numeral string from an integer \spad{n}.
92410`\spad{FormatRoman(n)} forms a Roman numeral string from an integer \spad{n}.
92476`\spad{Frobenius(x)} \undocumented
92599`\spad{Frobenius(a)} returns \spad{a ** q} where \spad{q} is the \spad{size()\$F}.
92729`\spad{Frobenius(a,s)} returns \spad{a**(q**s)} where \spad{q} is the size()\$\spad{F}.
92812`\spad{GE(x,y)} returns the \axiomType{Switch} expression representing \spad{x>=y}.
93020`\spad{GF2FG(a + i b)} returns \spad{a + i b} viewed as a function with the \spad{i} pushed down into the coefficient domain.
93097`\spad{GT(x,y)} returns the \axiomType{Switch} expression representing \spad{x>y}.
93305`\spad{Gamma(f)} returns the formal Gamma function applied to \spad{f}
93363`\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)}.}
93456`\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)}.}
93531`\spad{Gamma(x)} is the Euler Gamma function.
93584`\spad{Gamma(x)} is the Euler Gamma function.
93625`\spad{Gamma(a,x)} returns the incomplete Gamma function applied to a and \spad{x}
93685`\spad{Gamma(a,x)} is the incomplete Gamma function.
93741`\spad{GospersMethod(b, n, new)} returns a rational function \spad{rf(n)} such that \spad{a(n) * rf(n)} is the indefinite sum of \spad{a(n)} with respect to upward difference on \spad{n},{} \spadignore{i.e.} \spad{a(n+1) * rf(n+1) - a(n) * rf(n) = a(n)},{} where \spad{b(n) = a(n)/a(n-1)} is a rational function. Returns "failed" if no such rational function \spad{rf(n)} exists. Note: \spad{new} is a nullary functi
93741`--on returning a new \spad{V} every time. The condition on \spad{a(n)} is that \spad{a(n)/a(n-1)} is a rational function of \spad{n}.
93833`\axiom{Hausdorff(a,{}\spad{b},{}\spad{n})} returns log(exp(a)*exp(\spad{b})) truncated at order \axiom{\spad{n}}.
93933`\spad{HenselLift(pol,lfacts,prime,bound)} lifts \spad{lfacts},{} that are the factors of \spad{pol} mod \spad{prime},{} to factors of \spad{pol} mod prime**k > \spad{bound}. No recombining is done .
94053`\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
94053`--} have no polynomial parts. \spad{D} is the derivation to use on \spadtype{UP}.
94231`\spad{HermiteIntegrate(f, ')} returns \spad{[g,h]} such that \spad{f = g' + h} and \spad{h} has a only simple finite normal poles.
94344`\spad{Is([e1,...,en], pat)} matches the pattern pat on the list of expressions \spad{[e1,...,en]} and returns the result.
94464`\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}.
94625`\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}.
94746`\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}.
95125`\spad{LE(x,y)} returns the \axiomType{Switch} expression representing \spad{x<=y}.
95333`\spad{LODO2FUN(op)} returns the function to pass to the series ODE solver in order to solve \spad{op y = 0}.
95402`\spad{LT(x,y)} returns the \axiomType{Switch} expression representing \spad{x<y}.
95610`\spad{LagrangeInterpolation(l1,l2)} \undocumented
95706`\axiom{\spad{Lazard2}(\spad{F},{} \spad{x},{} \spad{y},{} \spad{n})} computes \axiom{(x/y)**(\spad{n}-1) * \spad{F}}
95796`\axiom{\spad{LazardQuotient2}(\spad{p},{}a,{}\spad{b},{}\spad{n})} returns \axiom{(a**(\spad{n}-1) * \spad{p}) exquo b**(\spad{n}-1)} assuming that this quotient does not fail.
95916`\axiom{LazardQuotient(a,{}\spad{b},{}\spad{n})} returns \axiom{a**n exquo b**(\spad{n}-1)} assuming that this quotient does not fail.
96032`\axiom{Lazard(\spad{x},{} \spad{y},{} \spad{n})} computes \axiom{x**n/y**(\spad{n}-1)}
96113`\axiom{LiePolyIfCan(\spad{p})} returns \axiom{\spad{p}} in Lyndon basis if \axiom{\spad{p}} is a Lie polynomial,{} otherwise \axiom{"failed"} is returned.
96219`\axiom{LiePolyIfCan(\spad{p})} return \axiom{\spad{p}} if \axiom{\spad{p}} is a Lie polynomial.
96317`\axiom{LiePoly(\spad{l})} returns the bracketed form of \axiom{\spad{l}} as a Lie polynomial.
96389`\spad{ListOfTerms([l1]*[l2]*...[ln])} returns the list of words \spad{l1, l2, .... ln}.
96486`\axiom{ListOfTerms(\spad{p})} returns the internal representation of \axiom{\spad{p}}.
96610`\spad{ListOfTerms(x)} returns a list \spad{lt} of terms with type \spad{Record(k: Basis, c: R)} such that \spad{x} equals \spad{reduce(+, map(x +-> monom(x.k, x.c), lt))}.
96691`\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}.
96772`\axiom{LyndonBasis(lv)} returns the Lyndon basis of the nilpotent free Lie algebra.
96876`\axiom{LyndonCoordinates(\spad{g})} returns the exponential coordinates of \axiom{\spad{g}}.
96985`\axiom{\spad{LyndonWordsList1}(vl,{} \spad{n})} returns an array of lists of Lyndon words over the alphabet \axiom{vl},{} up to order \axiom{\spad{n}}.
97097`\axiom{LyndonWordsList(vl,{} \spad{n})} returns the list of Lyndon words over the alphabet \axiom{vl},{} up to order \axiom{\spad{n}}.
97187`\spad{NOT(x)} returns the \axiomType{Switch} expression representing \spad{\~~x}.
97307`\spad{NOT(x)} returns the \axiomType{Switch} expression representing \spad{\~~x}.
97341`\spad{Not(n)} returns the bit-by-bit logical {\em Not} of \spad{n}.
97384`\spad{Not(n)} returns the bit-by-bit logical {\em not} of the single integer \spad{n}.
97425`\spad{Nul()} gives the basis element 1 for the algebra generated by \spad{n} generators.
97480`\spad{ODESolve(args)} performs the integration of the function given the strategy or method returned by \axiomFun{measure}.
97749`\spad{OMParseError?(u)} tests whether \spad{u} is an OpenMath parsing error.
97809`\spad{OMReadError?(u)} tests whether \spad{u} is an OpenMath read error.
97868`\spad{OMUnknownCD?(u)} tests whether \spad{u} is an OpenMath unknown CD error.
97927`\spad{OMUnknownSymbol?(u)} tests whether \spad{u} is an OpenMath unknown symbol error.
97990`\spad{OMbindTCP}
98061`\spad{OMcloseConn}
98117`\spad{OMclose(dev)} closes \axiom{\spad{dev}},{} flushing output if necessary.
98165`\spad{OMconnInDevice:}
98234`\spad{OMconnOutDevice:}
98304`\spad{OMconnectTCP}
98385`\spad{OMencodingBinary()} is the constant for the OpenMath binary encoding.
98440`\spad{OMencodingSGML()} is the constant for the deprecated OpenMath SGML encoding.
98493`\spad{OMencodingUnknown()} is the constant for unknown encoding types. If this is used on an input device,{} the encoding will be autodetected. It is invalid to use it on an output device.
98549`\spad{OMencodingXML()} is the constant for the OpenMath XML encoding.
98601`\spad{OMgetApp(dev)} reads a begin application token from \axiom{\spad{dev}}.
98650`\spad{OMgetAtp(dev)} reads a begin attribute pair token from \axiom{\spad{dev}}.
98699`\spad{OMgetAttr(dev)} reads a begin attribute token from \axiom{\spad{dev}}.
98749`\spad{OMgetBVar(dev)} reads a begin bound variable list token from \axiom{\spad{dev}}.
98799`\spad{OMgetBind(dev)} reads a begin binder token from \axiom{\spad{dev}}.
98849`\spad{OMgetEndApp(dev)} reads an end application token from \axiom{\spad{dev}}.
98901`\spad{OMgetEndAtp(dev)} reads an end attribute pair token from \axiom{\spad{dev}}.
98953`\spad{OMgetEndAttr(dev)} reads an end attribute token from \axiom{\spad{dev}}.
99006`\spad{OMgetEndBVar(dev)} reads an end bound variable list token from \axiom{\spad{dev}}.
99059`\spad{OMgetEndBind(dev)} reads an end binder token from \axiom{\spad{dev}}.
99112`\spad{OMgetEndError(dev)} reads an end error token from \axiom{\spad{dev}}.
99166`\spad{OMgetEndObject(dev)} reads an end object token from \axiom{\spad{dev}}.
99221`\spad{OMgetError(dev)} reads a begin error token from \axiom{\spad{dev}}.
99272`\spad{OMgetFloat(dev)} reads a float from \axiom{\spad{dev}}.
99330`\spad{OMgetInteger(dev)} reads an integer from \axiom{\spad{dev}}.
99386`\spad{OMgetObject(dev)} reads a begin object token from \axiom{\spad{dev}}.
99438`\spad{OMgetString(dev)} reads a string from \axiom{\spad{dev}}.
99492`\spad{OMgetSymbol(dev)} reads a symbol from \axiom{\spad{dev}}.
99569`\spad{OMgetType(dev)} returns the type of the next object on \axiom{\spad{dev}}.
99621`\spad{OMgetVariable(dev)} reads a variable from \axiom{\spad{dev}}.
99677`\spad{OMlistCDs()} lists all the CDs supported by AXIOM.
99734`\spad{OMlistSymbols(cd)} lists all the symbols in \axiom{\spad{cd}}.
99801`\spad{OMmakeConn}
99865`\spad{OMopenFile(f,mode,enc)} opens file \axiom{\spad{f}} for reading or writing OpenMath objects (depending on \axiom{\spad{mode}} which can be "r",{} "w" or "a" for read,{} write and append respectively),{} in the encoding \axiom{\spad{enc}}.
99942`\spad{OMopenString(s,mode)} opens the string \axiom{\spad{s}} for reading or writing OpenMath objects in encoding \axiom{enc}.
100014`\spad{OMputApp(dev)} writes a begin application token to \axiom{\spad{dev}}.
100063`\spad{OMputAtp(dev)} writes a begin attribute pair token to \axiom{\spad{dev}}.
100112`\spad{OMputAttr(dev)} writes a begin attribute token to \axiom{\spad{dev}}.
100162`\spad{OMputBVar(dev)} writes a begin bound variable list token to \axiom{\spad{dev}}.
100212`\spad{OMputBind(dev)} writes a begin binder token to \axiom{\spad{dev}}.
100262`\spad{OMputEndApp(dev)} writes an end application token to \axiom{\spad{dev}}.
100314`\spad{OMputEndAtp(dev)} writes an end attribute pair token to \axiom{\spad{dev}}.
100366`\spad{OMputEndAttr(dev)} writes an end attribute token to \axiom{\spad{dev}}.
100419`\spad{OMputEndBVar(dev)} writes an end bound variable list token to \axiom{\spad{dev}}.
100472`\spad{OMputEndBind(dev)} writes an end binder token to \axiom{\spad{dev}}.
100525`\spad{OMputEndError(dev)} writes an end error token to \axiom{\spad{dev}}.
100579`\spad{OMputEndObject(dev)} writes an end object token to \axiom{\spad{dev}}.
100634`\spad{OMputError(dev)} writes a begin error token to \axiom{\spad{dev}}.
100685`\spad{OMputFloat(dev,i)} writes the float \axiom{\spad{i}} to \axiom{\spad{dev}}.
100748`\spad{OMputInteger(dev,i)} writes the integer \axiom{\spad{i}} to \axiom{\spad{dev}}.
100809`\spad{OMputObject(dev)} writes a begin object token to \axiom{\spad{dev}}.
100861`\spad{OMputString(dev,i)} writes the string \axiom{\spad{i}} to \axiom{\spad{dev}}.
100920`\spad{OMputSymbol(dev,cd,s)} writes the symbol \axiom{\spad{s}} from CD \axiom{\spad{cd}} to \axiom{\spad{dev}}.
100986`\spad{OMputVariable(dev,i)} writes the variable \axiom{\spad{i}} to \axiom{\spad{dev}}.
101047`\spad{OMreadFile(f)} reads an OpenMath object from \axiom{\spad{f}} and passes it to AXIOM.
101102`\spad{OMreadStr(f)} reads an OpenMath object from \axiom{\spad{f}} and passes it to AXIOM.
101156`\spad{OMread(dev)} reads an OpenMath object from \axiom{\spad{dev}} and passes it to AXIOM.
101215`\spad{OMreceive(c)} reads an OpenMath object from connection \axiom{\spad{c}} and returns the appropriate AXIOM object.
101287`\spad{OMsend(c,u)} attempts to output \axiom{\spad{u}} on \aciom{\spad{c}} in OpenMath.
101361`\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.
101441`\spad{OMsetEncoding(dev,enc)} sets the encoding used for reading or writing OpenMath objects to or from \axiom{\spad{dev}} to \axiom{\spad{enc}}.
101512`\spad{OMsupportsCD?(cd)} returns \spad{true} if AXIOM supports \axiom{\spad{cd}},{} \spad{false} otherwise.
101574`\spad{OMsupportsSymbol?(s,cd)} returns \spad{true} if AXIOM supports symbol \axiom{\spad{s}} from CD \axiom{\spad{cd}},{} \spad{false} otherwise.
101647`\spad{OMunhandledSymbol(s,cd)} raises an error if AXIOM reads a symbol which it is unable to handle. Note that this is different from an unexpected symbol.
101782`\spad{OMwrite(u)} returns the OpenMath XML encoding of \axiom{\spad{u}} as a complete OpenMath object.
101977`\spad{OMwrite(dev, u)} writes the OpenMath form of \axiom{\spad{u}} to the OpenMath device \axiom{\spad{dev}} as a complete OpenMath object.
102034`\spad{OMwrite(u, true)} returns the OpenMath XML encoding of \axiom{\spad{u}} as a complete OpenMath object; OMwrite(\spad{u},{} \spad{false}) returns the OpenMath XML encoding of \axiom{\spad{u}} as an OpenMath fragment.
102172`\spad{OMwrite(dev, u, true)} writes the OpenMath form of \axiom{\spad{u}} to the OpenMath device \axiom{\spad{dev}} as a complete OpenMath object; OMwrite(\spad{dev},{} \spad{u},{} \spad{false}) writes the object as an OpenMath fragment.
102237`\spad{OR(x,y)} returns the \axiomType{Switch} expression representing \spad{x or y}.
102445`\spad{Or(n,m)} returns the bit-by-bit logical {\em Or} of \spad{n} and \spad{m}.
102490`\spad{Or(n,m)} returns the bit-by-bit logical {\em or} of the single integers \spad{n} and \spad{m}.
102533`\spad{PDESolve(args)} performs the integration of the function given the strategy or method returned by \axiomFun{measure}.
102878`\spad{ParCondList(c,r)} computes a list of subdeterminants of each rank >= \spad{r} of the matrix \spad{c} and returns a groebner basis for the ideal they generate
103094`\spad{ParCond(m,k)} returns the list of all \spad{k} by \spad{k} subdeterminants in the matrix \spad{m}
103250`\spad{PollardSmallFactor(n)} returns a factor of \spad{n} or "failed" if no one is found
103337`\spad{RF2UTS(f)} converts \spad{f} to a Taylor series.
103423`\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}.
103480`\spad{ReduceOrder(op, [f1,...,fk])} returns \spad{[op1,[g1,...,gk]]} such that for any solution \spad{z} of \spad{op1 z = 0},{} \spad{y = gk \int(g_{k-1} \int(... \int(g1 \int z)...)} is a solution of \spad{op y = 0}. Each \spad{fi} must satisfy \spad{op fi = 0}.
103637`\spad{RemainderList(p)} returns the regular part of \spad{p} as a list of terms.
103822`\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})}.
103918`\spad{SEGMENT(x)} creates the prefix form: \spad{x..}.
103960`\spad{l..} produces a half open segment,{} that is,{} one with no upper bound.
104010`\spad{SEGMENT(x,y)} creates the infix form: \spad{x..y}.
104055`\spad{l..h} creates a segment with \spad{l} and \spad{h} as the endpoints.
104106`\spad{SFunction(li)} is the \spad{S}-function of the partition \spad{li} \indented{1}{expressed in terms of power sum symmetric functions.}
104210`\spad{ScanArabic(s)} forms an integer from an Arabic numeral string \spad{s}.
104275`\spad{ScanFloatIgnoreSpacesIfCan(s)} tries to form a floating point number from the string \spad{s} ignoring any spaces.
104362`\spad{ScanFloatIgnoreSpaces(s)} forms a floating point number from the string \spad{s} ignoring any spaces. Error is generated if the string is not recognised as a floating point number.
104428`\spad{ScanRoman(s)} forms an integer from a Roman numeral string \spad{s}.
104492`\spad{Si(f)} denotes the sine integral
104541`\spad{Si(x)} returns the sine integral of \spad{x},{} \spadignore{i.e.} the integral of \spad{sin(x) / x dx}.
104595`\spad{SturmHabichtCoefficients(p1,p2)} computes the principal Sturm-Habicht coefficients of \spad{p1} and \spad{p2}
104722`\spad{SturmHabichtMultiple(p1,p2)} computes c_{+}-c_{-} where c_{+} is the number of real roots of \spad{p1} with \spad{p2>0} and c_{-} is the number of real roots of \spad{p1} with \spad{p2<0}. If \spad{p2=1} what you get is the number of real roots of \spad{p1}.
104861`\spad{SturmHabichtSequence(p1,p2)} computes the Sturm-Habicht sequence of \spad{p1} and \spad{p2}
105008`\spad{SturmHabicht(p1,p2)} computes c_{+}-c_{-} where c_{+} is the number of real roots of \spad{p1} with \spad{p2>0} and c_{-} is the number of real roots of \spad{p1} with \spad{p2<0}. If \spad{p2=1} what you get is the number of real roots of \spad{p1}.
105123`\spad{UP2UTS(p)} converts \spad{p} to a Taylor series.
105178`\spad{UP2ifCan(x)} should be local but conditional.
105380`\spad{UTS2UP(s, n)} converts the first \spad{n} terms of \spad{s} to a univariate polynomial.
105454`\spad{UnVectorise(v)} \undocumented
105512`\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}.
105592`\spad{Vectorise(x)} \undocumented
105648`\spad{Y(f)} computes a fixed point of the function \spad{f}.
105736`\spad{Y(g,n)} computes a fixed point of the function \spad{g},{} where \spad{g} takes a list of \spad{n} streams and returns a list of \spad{n} streams.
105919`\spadignore{ \/ } returns the logical `join',{} \spadignore{e.g.} `or'.
105954`\spad{aCubic(f,g,h,j)} \undocumented
106020`\spad{aLinear(f,g)} \undocumented
106083`\spad{aQuadratic(f,g,h)} \undocumented
106151`\spad{aQuartic(f,g,h,i,k)} \undocumented
106221`\spad{abelianGroup([n1,...,nk])} constructs the abelian group that is the direct product of cyclic groups with order {\em ni}.
106324`\spad{abs(f)} returns the absolute value operator applied to \spad{f}
106554`\spad{abs(o)} computes the absolute value of an octonion,{} equal to the square root of the \spadfunFrom{norm}{Octonion}.
106623`\spad{abs(q)} computes the absolute value of quaternion \spad{q} (sqrt of norm).
106694`\spad{abs(x)} returns the absolute value of \spad{x} = sqrt(norm(\spad{x})).
106763`\spad{abs(x)} returns the absolute value of \spad{x}.
106810`\spad{abs(x)} returns the absolute value of \spad{x}.
106861`\spad{abs(x)} represents the Fortran intrinsic function ABS
106941`\spad{absolutelyIrreducible?()} tests if the curve absolutely irreducible?
107026`\spad{absolutelyIrreducible?()} tests if the curve absolutely irreducible?
107108`\spad{accuracyIF(o)} returns the intensity value of the accuracy requirements of the input ODE. A request of accuracy of 10^-6 corresponds to the neutral intensity. It returns a value in the range [0,{}1].
107351`\spad{acosIfCan(z)} returns acos(\spad{z}) if possible,{} and "failed" otherwise.
107432`\spad{acos(x)} applies the inverse cosine operator to \spad{x}
107642`\spad{acos(st)} computes arccosine of a power series \spad{st}.
107726`\spad{acos(st)} computes arccosine of a power series \spad{st}.
107824`\spad{acos(z)} returns the arc-cosine of Laurent series \spad{z}.
107911`\spad{acos(z)} returns the arc-cosine of a Puiseux series \spad{z}.
108007`\spad{acos(x)} returns the arc-cosine of \spad{x}.
108068`\spad{acos(x)} represents the Fortran intrinsic function ACOS
108149`\spad{acoshIfCan(z)} returns acosh(\spad{z}) if possible,{} and "failed" otherwise.
108231`\spad{acosh(x)} applies the inverse hyperbolic cosine operator to \spad{x}
108445`\spad{acosh(st)} computes the inverse hyperbolic cosine of a power series \spad{st}.
108530`\spad{acosh(st)} computes the inverse hyperbolic cosine of a power series \spad{st}.
108629`\spad{acosh(z)} returns the inverse hyperbolic cosine of Laurent series \spad{z}.
108717`\spad{acosh(z)} returns the inverse hyperbolic cosine of a Puiseux series \spad{z}.
108814`\spad{acosh(x)} returns the hyperbolic arc-cosine of \spad{x}.
108873`\spad{acotIfCan(z)} returns acot(\spad{z}) if possible,{} and "failed" otherwise.
108954`\spad{acot(x)} applies the inverse cotangent operator to \spad{x}
109121`\spad{acot(st)} computes arccotangent of a power series \spad{st}.
109205`\spad{acot(st)} computes arccotangent of a power series \spad{st}.
109303`\spad{acot(z)} returns the arc-cotangent of Laurent series \spad{z}.
109390`\spad{acot(z)} returns the arc-cotangent of a Puiseux series \spad{z}.
109486`\spad{acot(x)} returns the arc-cotangent of \spad{x}.
109547`\spad{acothIfCan(z)} returns acoth(\spad{z}) if possible,{} and "failed" otherwise.
109629`\spad{acoth(x)} applies the inverse hyperbolic cotangent operator to \spad{x}
109799`\spad{acoth(st)} computes the inverse hyperbolic cotangent of a power series \spad{st}.
109884`\spad{acoth(st)} computes the inverse hyperbolic cotangent of a power series \spad{st}.
109983`\spad{acoth(z)} returns the inverse hyperbolic cotangent of Laurent series \spad{z}.
110071`\spad{acoth(z)} returns the inverse hyperbolic cotangent of a Puiseux series \spad{z}.
110168`\spad{acoth(x)} returns the hyperbolic arc-cotangent of \spad{x}.
110227`\spad{acscIfCan(z)} returns acsc(\spad{z}) if possible,{} and "failed" otherwise.
110308`\spad{acsc(x)} applies the inverse cosecant operator to \spad{x}
110477`\spad{acsc(st)} computes arccosecant of a power series \spad{st}.
110561`\spad{acsc(st)} computes arccosecant of a power series \spad{st}.
110659`\spad{acsc(z)} returns the arc-cosecant of Laurent series \spad{z}.
110746`\spad{acsc(z)} returns the arc-cosecant of a Puiseux series \spad{z}.
110842`\spad{acsc(x)} returns the arc-cosecant of \spad{x}.
110903`\spad{acschIfCan(z)} returns acsch(\spad{z}) if possible,{} and "failed" otherwise.
110985`\spad{acsch(x)} applies the inverse hyperbolic cosecant operator to \spad{x}
111155`\spad{acsch(st)} computes the inverse hyperbolic cosecant of a power series \spad{st}.
111240`\spad{acsch(st)} computes the inverse hyperbolic cosecant of a power series \spad{st}.
111339`\spad{acsch(z)} returns the inverse hyperbolic cosecant of Laurent series \spad{z}.
111427`\spad{acsch(z)} returns the inverse hyperbolic cosecant of a Puiseux series \spad{z}.
111524`\spad{acsch(x)} returns the hyperbolic arc-cosecant of \spad{x}.
111583`\spad{adaptive3D?()} determines whether plotting be done adaptively.
111628`\spad{adaptive?()} determines whether plotting be done adaptively
111669`\spad{adaptive()} determines whether plotting will be done adaptively.
111721`\spad{adaptive(true)} turns adaptive plotting on; \spad{adaptive(false)} turns adaptive plotting off.
111780`\spad{adaptive(b)} turns adaptive 2D plotting on if \spad{b} is \spad{true},{} or off if \spad{b} is \spad{false}. This option is expressed in the form \spad{adaptive == b}.
111828`\spad{adaptive(l,b)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{adaptive}. If the option does not exist the value,{} \spad{b} is returned.
111908`\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".
111984`\spad{addBadValue(p, v)} adds \spad{v} to the list of "bad values" for \spad{p}. Note: \spad{p} is not allowed to match any of its "bad values".
112034`\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).
112115`\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.
112184`\spad{addPoint2(s,p)} adds the 4 dimensional point,{} \spad{p},{} to the 3 dimensional subspace,{} \spad{s}. The subspace \spad{s} is returned with the additional point.
112240`\spad{addPointLast(s,s2,li,p)} adds the 4 dimensional point,{} \spad{p},{} to the 3 dimensional subspace,{} \spad{s}. \spad{s2} point to the end of the subspace \spad{s}. \spad{n} is the path in the \spad{s2} component. The subspace \spad{s} is returned with the additional point.
112321`\spad{addPoint(s,p)} adds the point,{} \spad{p},{} to the 3 dimensional subspace,{} \spad{s},{} and returns the new total number of points in \spad{s}.
112392`\spad{addPoint(s,li,i)} adds the 4 dimensional point indicated by the index location,{} \spad{i},{} to the 3 dimensional subspace,{} \spad{s}. The list of non negative integers,{} \spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component in which the point is to be added. It's length should range from 0 to \spad{n - 1} where \spad{n} is the dimension of the subspace. If
112392`-- the length is \spad{n - 1},{} then a specific lowest level component is being referenced. If it is less than \spad{n - 1},{} then some higher level component (0 indicates top level component) is being referenced and a component of that level with the desired point is created. The subspace \spad{s} is returned with the additional point.
112482`\spad{addPoint(s,li,p)} adds the 4 dimensional point,{} \spad{p},{} to the 3 dimensional subspace,{} \spad{s}. The list of non negative integers,{} \spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component in which the point is to be added. It's length should range from 0 to \spad{n - 1} where \spad{n} is the dimension of the subspace. If the length is \spad{n - 1},{} then a spec
112482`--ific lowest level component is being referenced. If it is less than \spad{n - 1},{} then some higher level component (0 indicates top level component) is being referenced and a component of that level with the desired point is created. The subspace \spad{s} is returned with the additional point.
112562`\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>)}.
112646`\spad{addmod(a,b,p)},{} \spad{0<=a,b<p>1},{} means \spad{a+b mod p}.
112835`\spad{adjoint(m)} returns the ajoint matrix of \spad{m} (\spadignore{i.e.} the matrix \spad{n} such that m*n = determinant(\spad{m})*id) and the detrminant of \spad{m}.
112951`\spad{adjoint(a)} returns the adjoint operator of a.
113028`\spad{adjoint(op)} returns the adjoint of the operator \spad{op}.
113164`\spad{adjoint(op1, op2)} sets the adjoint of \spad{op1} to be \spad{op2}. \spad{op1} must be a basic operator
113240`\spad{airyAi(x)} returns the airyai function applied to \spad{x}
113299`\spad{airyAi(x)} is the Airy function \spad{Ai(x)}. This function satisfies the differential equation: \indented{2}{\spad{Ai''(x) - x * Ai(x) = 0}.}
113393`\spad{airyAi(x)} is the Airy function \spad{Ai(x)}. This function satisfies the differential equation: \indented{2}{\spad{Ai''(x) - x * Ai(x) = 0}.}
113469`\spad{airyAi(x)} is the Airy function \spad{Ai(x)}.
113523`\spad{airyBi(x)} returns the airybi function applied to \spad{x}
113582`\spad{airyBi(x)} is the Airy function \spad{Bi(x)}. This function satisfies the differential equation: \indented{2}{\spad{Bi''(x) - x * Bi(x) = 0}.}
113676`\spad{airyBi(x)} is the Airy function \spad{Bi(x)}. This function satisfies the differential equation: \indented{2}{\spad{Bi''(x) - x * Bi(x) = 0}.}
113752`\spad{airyBi(x)} is the Airy function \spad{Bi(x)}.
113806`\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.
114069`\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.
114309`\spad{algebraic?(a)} tests whether an element \spad{a} is algebraic with respect to the ground field \spad{F}.
114435`\axiom{algebraic?(\spad{v},{}ts)} returns \spad{true} iff \axiom{\spad{v}} is the main variable of some polynomial in \axiom{ts}.
114595`\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}.
114986`\axiom{algebraicOf(char)} is the external number
115124`\axiom{algebraicSort(lts)} sorts \axiom{lts} \spad{w}.\spad{r}.\spad{t} \axiomOpFrom{supDimElseRittWu?}{QuasiComponentPackage}.
115207`\axiom{algebraicSort(lts)} sorts \axiom{lts} \spad{w}.\spad{r}.\spad{t} \axiomOpFrom{supDimElseRittWu}{QuasiComponentPackage}.
115375`\axiom{algebraicVariables(ts)} returns the decreasingly sorted list of the main variables of the polynomials of \axiom{ts}.
115453`\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]}.
115609`\spad{algintegrate(f, d)} integrates \spad{f} with respect to the derivation \spad{d}.
116188`\axiom{allRootsOf(pol)} creates all the roots of \axiom{pol} naming each uniquely
116271`\axiom{allRootsOf(pol)} creates all the roots of \axiom{pol} naming each uniquely
116344`\axiom{allRootsOf(pol)} creates all the roots of \axiom{pol} naming each uniquely
116412`\axiom{allRootsOf(pol)} creates all the roots of \axiom{pol} naming each uniquely
116511`\axiom{allRootsOf(pol)} creates all the roots of \axiom{pol} naming each uniquely
116600`\axiom{allRootsOf(pol)} creates all the roots of \axiom{pol} naming each uniquely
116684`\axiom{allRootsOf(pol)} creates all the roots of \axiom{pol} in the Real Closure,{} assumed in order.
116780`\spad{alphabetic?(c)} tests if \spad{c} is a letter,{} \spadignore{i.e.} one of a..\spad{z} or A..\spad{Z}.
116830`\spad{alphabetic()} returns the class of all characters for which \spadfunFrom{alphabetic?}{Character} is \spad{true}.
116877`\spad{alphanumeric?(c)} tests if \spad{c} is either a letter or number,{} \spadignore{i.e.} one of 0..9,{} a..\spad{z} or A..\spad{Z}.
116929`\spad{alphanumeric()} returns the class of all characters for which \spadfunFrom{alphanumeric?}{Character} is \spad{true}.
116978`\spad{alternatingGroup(li)} constructs the alternating group acting on the integers in the list {\em li},{} generators are in general the {\em n-2}-cycle {\em (li.3,...,li.n)} and the 3-cycle {\em (li.1,li.2,li.3)},{} if \spad{n} is odd and product of the 2-cycle {\em (li.1,li.2)} with {\em n-2}-cycle {\em (li.3,...,li.n)} and the 3-cycle {\em (li.1,li.2,li.3)},{} if \spad{n} is even. Note: duplicates in 
116978`--the list will be removed.
117077`\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.
117178`\spad{alternating n} is the cycle index of the \indented{1}{alternating group of degree \spad{n}.}
117278`\spad{alternative?()} tests if \spad{2*associator(a,a,b) = 0 = 2*associator(a,b,b)} for all \spad{a},{} \spad{b} in the algebra. Note: we only can test this; in general we don't know whether \spad{2*a=0} implies \spad{a=0}.
117355`\spad{alternative?()} tests if \spad{2*associator(a,a,b) = 0 = 2*associator(a,b,b)} for all \spad{a},{} \spad{b} in the algebra. Note: we only can test this; in general we don't know whether \spad{2*a=0} implies \spad{a=0}.
117429`\spad{f and g} creates the equivalent infix form.
117470`\spad{x and y} returns the conjunction of \spad{x} and \spad{y}.
117513`\spad{anfactor(p)} tries to factor \spad{p} over algebraic numbers,{} returning "failed" if it cannot
117697`\spad{antiAssociative?()} tests if multiplication in algebra is anti-associative,{} \spadignore{i.e.} \spad{(a*b)*c + a*(b*c) = 0} for all \spad{a},{}\spad{b},{}\spad{c} in the algebra.
117778`\spad{antiAssociative?()} tests if multiplication in algebra is anti-associative,{} \spadignore{i.e.} \spad{(a*b)*c + a*(b*c) = 0} for all \spad{a},{}\spad{b},{}\spad{c} in the algebra.
117856`\spad{antiCommutative?()} tests if \spad{a*a = 0} for all \spad{a} in the algebra. Note: this implies \spad{a*b + b*a = 0} for all \spad{a} and \spad{b}.
117937`\spad{antiCommutative?()} tests if \spad{a*a = 0} for all \spad{a} in the algebra. Note: this implies \spad{a*b + b*a = 0} for all \spad{a} and \spad{b}.
118070`\spad{antiCommutator(a,b)} returns \spad{a*b+b*a}.
118129`\spad{anticoord }\undocumented
118462`\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.
118531`\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.
118615`\spad{antisymmetricTensors(la,n)} applies to each \spad{m}-by-\spad{m} square matrix in the list {\em la} the irreducible,{} polynomial representation of the general linear group {\em GLm} which corresponds to the partition {\em (1,1,...,1,0,0,...,0)} of \spad{n}. Error: if \spad{n} is greater than \spad{m}. Note: this corresponds to the symmetrization of the
118615`-- representation with the sign representation of the symmetric group {\em Sn}. The carrier spaces of the representation are the antisymmetric tensors of the \spad{n}-fold tensor product.
118761`\spad{antisymmetricTensors(a,n)} applies to the square matrix {\em a} the irreducible,{} polynomial representation of the general linear group {\em GLm},{} where \spad{m} is the number of rows of {\em a},{} which corresponds to the partition {\em (1,1,...,1,0,0,...,0)} of \spad{n}. Error: if \spad{n} is greater than \spad{m}. Note: this corresponds to the symmetrization 
118761`--of the representation with the sign representation of the symmetric group {\em Sn}. The carrier spaces of the representation are the antisymmetric tensors of the \spad{n}-fold tensor product.
119410`\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})}.
119514`\spad{any(type,object)} is a technical function for creating an \spad{object} of \spadtype{Any}. Arugment \spad{type} is a \spadgloss{LISP} form for the \spad{type} of \spad{object}.
119559`\spad{appendPoint(gi,pt)} appends the point \spad{pt} to the end of the list of points component for the graph,{} \spad{gi},{} which is of the domain \spadtype{GraphImage}.
119626`\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.
119781`\spad{applyQuote(foo, [x1,...,xn])} returns \spad{'foo(x1,...,xn)}.
119845`\spad{applyQuote(foo, x)} returns \spad{'foo(x)}.
119959`\spad{applyQuote(foo, x, y)} returns \spad{'foo(x,y)}.
120078`\spad{applyQuote(foo, x, y, z)} returns \spad{'foo(x,y,z)}.
120202`\spad{applyQuote(foo, x, y, z, t)} returns \spad{'foo(x,y,z,t)}.
120269`\spad{applyRules([r1,...,rn], expr)} applies the rules \spad{r1},{}...,{}rn to \spad{f} an unlimited number of times,{} \spadignore{i.e.} until none of \spad{r1},{}...,{}rn is applicable to the expression.
120350`\spad{applyRules([r1,...,rn], expr, n)} applies the rules \spad{r1},{}...,{}rn to \spad{f} a most \spad{n} times.
120513`\spad{apply(m,a)} defines a left operation of \spad{n} by \spad{n} matrices where \spad{n} is the rank of the algebra in terms of matrix-vector multiplication,{} this is a substitute for a left module structure. Error: if shape of matrix doesn't fit.
120583`\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}.
120656`\spad{apply(p, c, m)} returns \spad{p(m)} where the action is given by \spad{x m = c sigma(m) + delta(m)}.
120724`\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)}.
120819`\spad{approxRoot(n,r)} returns an approximation \spad{x} to \spad{n**(1/r)} such that \spad{-1 < x - n**(1/r) < 1}
120889`\spad{approxSqrt(n)} returns an approximation \spad{x} to \spad{sqrt(n)} such that \spad{-1 < x - sqrt(n) < 1}. Compute an approximation \spad{s} to \spad{sqrt(n)} such that \indented{10}{\spad{-1 < s - sqrt(n) < 1}} A variable precision Newton iteration is used. The running time is \spad{O( log(n)**2 )}.
120937`\spad{approximants(x)} returns the stream of approximants of the continued fraction \spadvar{\spad{x}}. If the continued fraction is finite,{} then the stream will be infinite and periodic with period 1.
121159`\spad{approximate(x,n)} returns a rational number \spad{y} such that \spad{y = x (mod p^n)}.
121251`\spad{approximate(f)} returns a truncated power series with the series variable viewed as an element of the coefficient domain.
121422`\spad{approximate(x,n)} returns an integer \spad{y} such that \spad{y = x (mod p^n)} when \spad{n} is positive,{} and 0 otherwise.
121494`\axiom{approximate(\spad{n},{}\spad{p})} gives an approximation of \axiom{\spad{n}} that has precision \axiom{\spad{p}}
121563`\axiom{approximate(term,{}root,{}prec)} gives an approximation of \axiom{term} over \axiom{root} with precision \axiom{prec}
121672`aribitrary is the arity of a function that accepts any number of arguments.
121709`\spad{areEquivalent?(aG0,aG1)} calls {\em areEquivalent?(aG0,aG1,true,25)}. Note: the choice of 25 was rather arbitrary.
121821`\spad{areEquivalent?(aG0,aG1,numberOfTries)} calls {\em areEquivalent?(aG0,aG1,true,25)}. Note: the choice of 25 was rather arbitrary.
121941`\spad{areEquivalent?(aG0,aG1,randomelements,numberOfTries)} tests whether the two lists of matrices,{} all assumed of same square shape,{} can be simultaneously conjugated by a non-singular matrix. If these matrices represent the same group generators,{} the representations are equivalent. The algorithm tries {\em numberOfTries} times to create elements in the generated algebr
121941`--as in the same fashion. If their ranks differ,{} they are not equivalent. If an isomorphism is assumed,{} then the kernel of an element of the first algebra is mapped to the kernel of the corresponding element in the second algebra. Now consider the one-dimensional ones. If they generate the whole space (\spadignore{e.g.} irreducibility !) we use {\em standardBasisOfCyclicSubmodule} to create the only possible transition matrix. The method checks whether the matrix conjugates all corresponding
121941`-- matrices from {\em aGi}. The way to choose the singular matrices is as in {\em meatAxe}. If the two representations are equivalent,{} this routine returns the transformation matrix {\em TM} with {\em aG0.i * TM = TM * aG1.i} for all \spad{i}. If the representations are not equivalent,{} a small 0-matrix is returned. Note: the case with different sets of group generators cannot be handled.
122069`\spad{arg1(a,c)} selects its first argument.
122131`\spad{arg2(a,c)} selects its second argument.
122193`\spad{argscript(s, [a1,...,an])} returns \spad{s} arg-scripted by \spad{[a1,...,an]}.
122250`\spad{argumentList!(l)} declares that the argument list for the current subprogram in the global symbol table is \spad{l}.
122314`\spad{argumentList!(f,l)} declares that the argument list for subprogram \spad{f} in the global symbol table is \spad{l}.
122385`\spad{argumentList!(f,l,tab)} declares that the argument list for subprogram \spad{f} in symbol table \spad{tab} is \spad{l}.
122459`\spad{argumentListOf(f,tab)} returns the argument list of \spad{f}
122576`\spad{argument(x)} returns the argument of a given sin/cos expressions
122627`\spad{argument(op(a1,...,an))} returns \spad{[a1,...,an]}.
122674`\spad{argument(x)} returns the angle made by (0,{}1) and (0,{}\spad{x}).
122761`\spad{arguments(t)} returns the list of syntax objects for the arguments used to invoke the constructor.
122873`\spad{arity(op)} returns the arity of the operator \spad{op}.
122925`\spad{aromberg(fn,a,b,epsrel,epsabs,nmin,nmax,nint)} uses the adaptive romberg method to numerically integrate function \spad{fn} over the closed interval from \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin}
122925`-- to \spad{nmax},{} and where \spad{nint} is the number of independent intervals to apply the integrator. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
123099`\spad{arrayStack([x,y,...,z])} creates an array stack with first (top) element \spad{x},{} second element \spad{y},{}...,{}and last element \spad{z}.
123152`\spad{asecIfCan(z)} returns asec(\spad{z}) if possible,{} and "failed" otherwise.
123233`\spad{asec(x)} applies the inverse secant operator to \spad{x}
123402`\spad{asec(st)} computes arcsecant of a power series \spad{st}.
123486`\spad{asec(st)} computes arcsecant of a power series \spad{st}.
123584`\spad{asec(z)} returns the arc-secant of Laurent series \spad{z}.
123671`\spad{asec(z)} returns the arc-secant of a Puiseux series \spad{z}.
123767`\spad{asec(x)} returns the arc-secant of \spad{x}.
123828`\spad{asechIfCan(z)} returns asech(\spad{z}) if possible,{} and "failed" otherwise.
123910`\spad{asech(x)} applies the	inverse hyperbolic secant operator to \spad{x}
124080`\spad{asech(st)} computes the inverse hyperbolic secant of a power series \spad{st}.
124165`\spad{asech(st)} computes the inverse hyperbolic secant of a power series \spad{st}.
124264`\spad{asech(z)} returns the inverse hyperbolic secant of Laurent series \spad{z}.
124352`\spad{asech(z)} returns the inverse hyperbolic secant of a Puiseux series \spad{z}.
124449`\spad{asech(x)} returns the hyperbolic arc-secant of \spad{x}.
124508`\spad{asimpson(fn,a,b,epsrel,epsabs,nmin,nmax,nint)} uses the adaptive simpson method to numerically integrate function \spad{fn} over the closed interval from \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin}
124508`-- to \spad{nmax},{} and where \spad{nint} is the number of independent intervals to apply the integrator. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
124682`\spad{asinIfCan(z)} returns asin(\spad{z}) if possible,{} and "failed" otherwise.
124763`\spad{asin(x)} applies the inverse sine operator to \spad{x}
124973`\spad{asin(st)} computes arcsine of a power series \spad{st}.
125057`\spad{asin(st)} computes arcsine of a power series \spad{st}.
125155`\spad{asin(z)} returns the arc-sine of Laurent series \spad{z}.
125242`\spad{asin(z)} returns the arc-sine of a Puiseux series \spad{z}.
125338`\spad{asin(x)} returns the arc-sine of \spad{x}.
125399`\spad{asin(x)} represents the Fortran intrinsic function ASIN
125480`\spad{asinhIfCan(z)} returns asinh(\spad{z}) if possible,{} and "failed" otherwise.
125562`\spad{asinh(x)} applies the inverse hyperbolic sine operator to \spad{x}
125776`\spad{asinh(st)} computes the inverse hyperbolic sine of a power series \spad{st}.
125861`\spad{asinh(st)} computes the inverse hyperbolic sine of a power series \spad{st}.
125960`\spad{asinh(z)} returns the inverse hyperbolic sine of Laurent series \spad{z}.
126048`\spad{asinh(z)} returns the inverse hyperbolic sine of a Puiseux series \spad{z}.
126145`\spad{asinh(x)} returns the hyperbolic arc-sine of \spad{x}.
126204`\spad{aspFilename("f")} returns a String consisting of \spad{"f"} suffixed with \indented{1}{an extension identifying the current AXIOM session.}
126269`\spad{assert(x, s)} makes the assertion \spad{s} about \spad{x}. Error: if \spad{x} is not a symbol.
126337`\spad{assert(x, s)} makes the assertion \spad{s} about \spad{x}.
126422`\spad{assert(op, p)} attaches property \spad{p} to \spad{op}. Argument \spad{op} is modified "in place",{} \spadignore{i.e.} no copy is made.
126477`\spad{assign(f,g)} creates a form for the assignment \spad{f := g}.
126521`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
126594`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
126658`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
126724`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
126797`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
126868`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
126941`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
127022`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
127094`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
127168`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
127249`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
127328`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
127409`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
127478`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
127545`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
127614`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
127667`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
127748`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
127820`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
127894`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
127975`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
128054`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
128135`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
128204`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
128271`\spad{assign(x,y)} creates a representation of the FORTRAN expression x=y.
128340`\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).
128439`\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).
128529`\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).
128621`\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).
128720`\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).
128817`\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).
128916`\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}.
129026`\spad{associatedEquations(op, m)} returns \spad{[w, eq, lw, lop]} such that \spad{eq(w) = 0} where \spad{w} is the given minor,{} and \spad{lw_i = lop_i(w)} for all the other minors.
129206`\spad{associatedSystem(op, m)} returns \spad{[M,w]} such that the \spad{m}-th associated equation system to \spad{L} is \spad{w' = M w}.
129440`\spad{associates?(x,y)} tests whether \spad{x} and \spad{y} are associates,{} \spadignore{i.e.} differ by a unit factor.
129498`\spad{associative?()} tests if multiplication in algebra is associative.
129575`\spad{associative?()} tests if multiplication in algebra is associative.
129649`\spad{associatorDependence()} looks for the associator identities,{} \spadignore{i.e.} finds a basis of the solutions of the linear combinations of the six permutations of \spad{associator(a,b,c)} which yield 0,{} for all \spad{a},{}\spad{b},{}\spad{c} in the algebra. The order of the permutations is \spad{123 231 312 132 321 213}.
129742`\spad{associatorDependence()} looks for the associator identities,{} \spadignore{i.e.} finds a basis of the solutions of the linear combinations of the six permutations of \spad{associator(a,b,c)} which yield 0,{} for all \spad{a},{}\spad{b},{}\spad{c} in the algebra. The order of the permutations is \spad{123 231 312 132 321 213}.
129906`\spad{associator(a,b,c)} returns \spad{(a*b)*c-a*(b*c)}.
129964`\spad{atanIfCan(z)} returns atan(\spad{z}) if possible,{} and "failed" otherwise.
130045`\spad{atan(x)} applies the inverse tangent operator to \spad{x}
130199`\spad{atan(st)} computes arctangent of a power series \spad{st}.
130283`\spad{atan(st)} computes arctangent of a power series \spad{st}.
130381`\spad{atan(z)} returns the arc-tangent of Laurent series \spad{z}.
130468`\spad{atan(z)} returns the arc-tangent of a Puiseux series \spad{z}.
130564`\spad{atan(x)} returns the arc-tangent of \spad{x}.
130625`\spad{atan(x)} represents the Fortran intrinsic function ATAN
130706`\spad{atan(x,y)} computes the arc tangent from \spad{x} with phase \spad{y}.
130749`\spad{atan(x,y)} computes the arc tangent from \spad{x} with phase \spad{y}.
130786`\spad{atanhIfCan(z)} returns atanh(\spad{z}) if possible,{} and "failed" otherwise.
130868`\spad{atanh(x)} applies the inverse hyperbolic tangent operator to \spad{x}
131082`\spad{atanh(st)} computes the inverse hyperbolic tangent of a power series \spad{st}.
131167`\spad{atanh(st)} computes the inverse hyperbolic tangent of a power series \spad{st}.
131266`\spad{atanh(z)} returns the inverse hyperbolic tangent of Laurent series \spad{z}.
131354`\spad{atanh(z)} returns the inverse hyperbolic tangent of a Puiseux series \spad{z}.
131451`\spad{atanh(x)} returns the hyperbolic arc-tangent of \spad{x}.
131510`\spad{atom?(s)} is \spad{true} if \spad{s} is a Lisp atom.
131586`\spad{atoms f} ++ returns the set of atoms appearing in the formula \spad{f}.
131674`\spad{atoms(r)} returns the list of matches that match atoms (elements of the lists).
131754`\spad{atrapezoidal(fn,a,b,epsrel,epsabs,nmin,nmax,nint)} uses the adaptive trapezoidal method to numerically integrate function \spad{fn} over the closed interval from \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from
131754`-- \spad{nmin} to \spad{nmax},{} and where \spad{nint} is the number of independent intervals to apply the integrator. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
131932`\spad{att2Result(m)} converts a attributes record into a \axiomType{Result}
132642`\spad{attributeData x} returns the list of attribute-predicate bit vector index pair associated with the functor data \spad{x}.
133042`\spad{augment(lp,lts)} returns the same as \spad{concat([augment(lp,ts) for ts in lts])}
133131`\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))}
133214`\spad{augment(p,lts)} returns the same as \spad{concat([augment(p,ts) for ts in lts])}
133297`\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.
133374`\spad{autoCoerce(s)} returns the AttributeAst view of `s'. Left at the discretion of the compiler.
133433`\spad{autoCoerce(s)} returns the CapsuleAst view of `s'. Left at the discretion of the compiler.
133490`\spad{autoCoerce(s)} returns the CaseAst view of `s'. Left at the discretion of the compiler.
133544`\spad{autoCoerce(s)} returns the CategoryAst view of `s'. Left at the discretion of the compiler.
133602`\spad{autoCoerce(s)} returns the CoerceAst view of `s'. Left at the discretion of the compiler.
133658`\spad{autoCoerce(s)} returns the CollectAst view of `s'. Left at the discretion of the compiler.
133715`\spad{autoCoerce(s)} returns the ColoonAst view of `s'. Left at the discretion of the compiler.
133770`\spad{autoCoerce(s)} returns the ConstructAst view of `s'. Left at the discretion of the compiler.
133829`\spad{autoCoerce(s)} returns the DefinitionAst view of `s'. Left at the discretion of the compiler.
133889`\spad{autoCoerce(s)} forcibly extracts a float value from the syntax `s'; no check performed. To be called only at the discretion of the compiler
133939`\spad{autoCoerce(s)} returns the ExitAst view of `s'. Left at the discretion of the compiler.
133993`\spad{autoCoerce(s)} returns the HasAst view of `s'. Left at the discretion of the compiler.
134046`\spad{autoCoerce(s)} returns the Identifier view of `s'. Left at the discretion of the compiler.
134103`\spad{autoCoerce(x)@Identifier} implicitly coerce the object \spad{x} to \spadtype{Identifier}. This function is left at the discretion of the compiler.
134158`\spad{autoCoerce(s)} forcibly extracts an identifier from the Syntax domain `s'; no check performed. To be called only at at the discretion of the compiler.
134207`\spad{autoCoerce(s)} returns the IfAst view of `s'. Left at the discretion of the compiler.
134259`\spad{autoCoerce(s)} returns the ImportAst view of `s'. Left at the discretion of the compiler.
134315`\spad{autoCoerce(s)} returns the InAst view of `s'. Left at the discretion of the compiler.
134367`\spad{autoCoerce(s)} returns the Integer view of `s'. Left at the discretion of the compiler.
134421`\spad{autoCoerce(s)} forcibly extracts an integer value from the syntax `s'; no check performed. To be called only at the discretion of the compiler.
134467`\spad{autoCoerce(s)} returns the IsAst view of `s'. Left at the discretion of the compiler.
134519`\spad{autoCoerce(s)} returns the \spadype{JoinAst} view of of the AST object \spad{s}. Left at the discretion of the compiler.
134573`\spad{autoCoerce(s)} returns the LetAst view of `s'. Left at the discretion of the compiler.
134626`\spad{autoCoerce(s)} returns the MacroAst view of `s'. Left at the discretion of the compiler.
134681`\spad{autoCoerce(s)} returns the MappingAst view of `s'. Left at the discretion of the compiler.
134738`\spad{autoCoerce(s)} returns the PretendAst view of `s'. Left at the discretion of the compiler.
134795`\spad{autoCoerce(s)} returns the RepeatAst view of `s'. Left at the discretion of the compiler.
134851`\spad{autoCoerce(s)} returns the RestrictAst view of `s'. Left at the discretion of the compiler.
134909`\spad{autoCoerce(s)} returns the ReturnAst view of `s'. Left at the discretion of the compiler.
134965`\spad{autoCoerce(s)} returns the SegmentAst view of `s'. Left at the discretion of the compiler.
135022`\spad{autoCoerce(s)} returns the SequenceAst view of `s'. Left at the discretion of the compiler.
135080`\spad{autoCoerce(s)} returns the SignatureAst view of `s'. Left at the discretion of the compiler.
135139`\spad{autoCoerce(s)} returns the InAst view of \spad{s}. Left at the discretion of the compiler.
135193`\spad{autoCoerce(s)} returns the String view of `s'. Left at the discretion of the compiler.
135246`\spad{autoCoerce(x)@String} implicitly coerce the object \spad{x} to \spadtype{String}. This function is left at the discretion of the compiler.
135297`\spad{autoCoerce(s)} forcibly extracts a string value from the syntax `s'; no check performed. To be called only at the discretion of the compiler.
135342`\spad{autoCoerce(s)} returns the SuchThatAst view of `s'. Left at the discretion of the compiler.
135400`\spad{autoCoerce} is a courtesy coercion function used by the compiler in case it knows that `x' really is a \spadtype{T}.
135442`\spad{autoCoerce(s)} returns the WhereAst view of `s'. Left at the discretion of the compiler.
135497`\spad{autoCoerce(s)} returns the WhileAst view of `s'. Left at the discretion of the compiler.
135642`\axiom{autoReduced?(ts,{}redOp?)} returns \spad{true} iff every element of \axiom{ts} is reduced \spad{w}.\spad{r}.\spad{t} to every other in the sense of \axiom{redOp?}
135735`\spad{axesColorDefault()} returns the default color of the axes in a 2D viewport.
135798`\spad{axesColorDefault(p)} sets the default color of the axes in a 2D viewport to the palette \spad{p}.
135868`\spad{axes(v,s)} displays the axes of the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport},{} if \spad{s} is "on",{} or does not display the axes if \spad{s} is "off".
135930`\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}.
136007`\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".
136083`\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}.
136206`\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.
136251`\spad{backspace} designates the backspace character.
136292`\spad{badNum(p)} \undocumented
136388`\spad{badNum(u)} \undocumented
136459`\spad{badValues(p)} returns the list of "bad values" for \spad{p}; \spad{p} is not allowed to match any of its "bad values".
136573`\spad{bag([x,y,...,z])} creates a bag with elements \spad{x},{}\spad{y},{}...,{}\spad{z}.
136621`\spad{balancedBinaryTree(n, s)} creates a balanced binary tree with \spad{n} nodes each with value \spad{s}.
136703`\spad{balancedFactorisation(a, [b1,...,bn])} returns a factorisation \spad{a = p1^e1 ... pm^em} such that each \spad{pi} is balanced with respect to \spad{[b1,...,bm]}.
136795`\spad{balancedFactorisation(a, b)} returns a factorisation \spad{a = p1^e1 ... pm^em} such that each \spad{pi} is balanced with respect to \spad{b}.
136881`\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,{} whos
136881`--e rows are the vectors formed by diagonal,{} subdiagonal,{} etc. of the real,{} full-matrix,{} hessian. (The notation conforms to LAPACK/NAG-\spad{F07} conventions.)
136994`\spad{bandedJacobian(vf,xlist,kl,ku)} computes the jacobian,{} the matrix of first partial derivatives,{} of the vector field \spad{vf},{} \spad{vf} a vector function of the variables listed in \spad{xlist},{} \spad{kl} is the number of nonzero subdiagonals,{} \spad{ku} is the number of nonzero superdiagonals,{} \spad{kl+ku+1} being actual bandwidth. Stores the nonzero
136994`-- band in a matrix,{} dimensions \spad{kl+ku+1} by \#xlist. The upper triangle is in the top \spad{ku} rows,{} the diagonal is in row \spad{ku+1},{} the lower triangle in the last \spad{kl} rows. Entries in a column in the band store correspond to entries in same column of full store. (The notation conforms to LAPACK/NAG-\spad{F07} conventions.)
137130`\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.
137248`\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.
137384`\spad{base()} returns the base of the \spadfunFrom{exponent}{FloatingPointSystem}.
137443`\spad{base()} returns the base for the operations of \spad{IntegerNumberSystem}.
137489`\spad{base(b)} sets the base of the model to \spad{b}
137556`\spad{base(gp)} returns a base for the group {\em gp}.
137609`\spad{base(d)} returns the base domain(\spad{s}) of the add-domain expression.
137769`\axiom{basicSet(ps,{}redOp?)} returns \axiom{[bs,{}ts]} where \axiom{concat(bs,{}ts)} is \axiom{ps} and \axiom{bs} is a basic set in Wu Wen Tsun sense of \axiom{ps} \spad{w}.\spad{r}.\spad{t} the reduction-test \axiom{redOp?},{} if no non-zero constant polynomial lie in \axiom{ps},{} otherwise \axiom{"failed"} is returned.
138025`\axiom{basicSet(ps,{}pred?,{}redOp?)} returns the same as \axiom{basicSet(qs,{}redOp?)} where \axiom{qs} consists of the polynomials of \axiom{ps} satisfying property \axiom{pred?}.
138161`\spad{basisOfCenter()} returns a basis of the space of all \spad{x} of \spad{A} satisfying \spad{commutator(x,a) = 0} and \spad{associator(x,a,b) = associator(a,x,b) = associator(a,b,x) = 0} for all \spad{a},{}\spad{b} in \spad{A}.
138221`\spad{basisOfCentroid()} returns a basis of the centroid,{} \spadignore{i.e.} the endomorphism ring of \spad{A} considered as \spad{(A,A)}-bimodule.
138291`\spad{basisOfCommutingElements()} returns a basis of the space of all \spad{x} of \spad{A} satisfying \spad{0 = commutator(x,a)} for all \spad{a} in \spad{A}.
138362`\spad{basisOfLeftAnnihilator(a)} returns a basis of the space of all \spad{x} of \spad{A} satisfying \spad{0 = x*a}.
138432`\spad{basisOfLeftNucleus()} returns a basis of the space of all \spad{x} of \spad{A} satisfying \spad{0 = associator(x,a,b)} for all \spad{a},{}\spad{b} in \spad{A}.
138497`\spad{basisOfLeftNucloid()} returns a basis of the space of endomorphisms of \spad{A} as right module. Note: left nucloid coincides with left nucleus if \spad{A} has a unit.
138570`\spad{basisOfMiddleNucleus()} returns a basis of the space of all \spad{x} of \spad{A} satisfying \spad{0 = associator(a,x,b)} for all \spad{a},{}\spad{b} in \spad{A}.
138637`\spad{basisOfNucleus()} returns a basis of the space of all \spad{x} of \spad{A} satisfying \spad{associator(x,a,b) = associator(a,x,b) = associator(a,b,x) = 0} for all \spad{a},{}\spad{b} in \spad{A}.
138698`\spad{basisOfRightAnnihilator(a)} returns a basis of the space of all \spad{x} of \spad{A} satisfying \spad{0 = a*x}.
138769`\spad{basisOfRightNucleus()} returns a basis of the space of all \spad{x} of \spad{A} satisfying \spad{0 = associator(a,b,x)} for all \spad{a},{}\spad{b} in \spad{A}.
138835`\spad{basisOfRightNucloid()} returns a basis of the space of endomorphisms of \spad{A} as left module. Note: right nucloid coincides with right nucleus if \spad{A} has a unit.
138964`\spad{basis()} returns a fixed basis of \$ as \spad{F}-vectorspace.
139032`\spad{basis()} returns the fixed \spad{R}-module basis.
139087`\spad{basis()} returns the fixed \spad{R}-module basis.
139153`\spad{basis(n)} \undocumented{} See \axiomFunFrom{basis}{FiniteAlgebraicExtensionField}
139246`\spad{basis((f1,...,fn))} returns the vector \spad{[f1,...,fn]}.
139308`\spad{basis((f1,...,fn))} = the vector \spad{[f1,...,fn]}.
139374`\spad{basis(n)} returns a fixed basis of a subfield of \$ as \spad{F}-vectorspace.
139457`\spad{basis(va)} selects a basis from the elements of \spad{va}.
139542`\spad{bat1(llp)} unbumps a tableau \spad{llp}. Operation \spad{bat1} is the inverse of \spad{tab1}.
139617`\spad{bat(ls)} unbumps a tableau \spad{ls}
139688`\spad{beauzamyBound(p)} returns a bound on the larger coefficient of any factor of \spad{p}.
139986`\spad{before?(x,y)} holds if the system representation of \spad{x} comes before that of \spad{y} in a an implementation defined manner.
140035`\spad{belong?(op)} is \spad{true} if \spad{op} is an algebraic operator,{} that is,{} an \spad{n}th root or implicit algebraic operator.
140105`\spad{belong?(op)} is \spad{true} if \spad{op} is a combinatorial operator.
140179`\spad{belong?(p)} returns \spad{true} if operator \spad{p} is elementary
140250`\spad{belong?(op)} is \spad{true} if \spad{op} is a special function operator.
140328`\spad{belong?(op)} checks if \spad{op} is Liouvillian
140400`\spad{belong?(op)} tests if \% accepts \spad{op} as applicable to its elements.
140529`\spad{belong?(op)} tests if \% accepts \spad{op} as applicable to its elements.
140592`\spad{bernoulliB(n,r)} \undocumented
140714`\spad{bernoulli(n)} returns the \spad{n}th Bernoulli polynomial \spad{B[n](x)}. Note: Bernoulli polynomials denoted \spad{B(n,x)} computed by solving the differential equation \spad{differentiate(B(n,x),x) = n B(n-1,x)} where \spad{B(0,x) = 1} and initial condition comes from \spad{B(n) = B(n,0)}.
140827`\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.
140909`\spad{besselI(x,y)} returns the besseli function applied to \spad{x} and \spad{y}
140971`\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}.}
141087`\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}.}
141176`\spad{besselI(v,z)} is the modified Bessel function of the first kind.
141234`\spad{besselJ(x,y)} returns the besselj function applied to \spad{x} and \spad{y}
141296`\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}.}
141412`\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}.}
141501`\spad{besselJ(v,z)} is the Bessel function of the first kind.
141559`\spad{besselK(x,y)} returns the besselk function applied to \spad{x} and \spad{y}
141621`\spad{besselK(v,x)} is the modified Bessel function of the first kind,{} \spad{K(v,x)}. This function satisfies the differential equation: \indented{2}{\spad{x^2 w''(x) + x w'(x) - (x^2+v^2)w(x) = 0}.} Note: The default implmentation uses the relation \indented{2}{\spad{K(v,x) = \%pi/2*(I(-v,x) - I(v,x))/sin(v*\%pi)}} so is not valid for integer values of \spad{v}.
141737`\spad{besselK(v,x)} is the modified Bessel function of the first kind,{} \spad{K(v,x)}. This function satisfies the differential equation: \indented{2}{\spad{x^2 w''(x) + x w'(x) - (x^2+v^2)w(x) = 0}.} Note: The default implmentation uses the relation \indented{2}{\spad{K(v,x) = \%pi/2*(I(-v,x) - I(v,x))/sin(v*\%pi)}.} so is not valid for integer values of \spad{v}.
141826`\spad{besselK(v,z)} is the modified Bessel function of the second kind.
141884`\spad{besselY(x,y)} returns the bessely function applied to \spad{x} and \spad{y}
141946`\spad{besselY(v,x)} is the Bessel function of the second kind,{} \spad{Y(v,x)}. This function satisfies the differential equation: \indented{2}{\spad{x^2 w''(x) + x w'(x) + (x^2-v^2)w(x) = 0}.} Note: The default implmentation uses the relation \indented{2}{\spad{Y(v,x) = (J(v,x) cos(v*\%pi) - J(-v,x))/sin(v*\%pi)}} so is not valid for integer values of \spad{v}.
142062`\spad{besselY(v,x)} is the Bessel function of the second kind,{} \spad{Y(v,x)}. This function satisfies the differential equation: \indented{2}{\spad{x^2 w''(x) + x w'(x) + (x^2-v^2)w(x) = 0}.} Note: The default implmentation uses the relation \indented{2}{\spad{Y(v,x) = (J(v,x) cos(v*\%pi) - J(-v,x))/sin(v*\%pi)}} so is not valid for integer values of \spad{v}.
142151`\spad{besselY(v,z)} is the Bessel function of the second kind.
142209`\spad{bezoutDiscriminant(p)} computes the discriminant of a polynomial \spad{p} by computing the determinant of a Bezout matrix.
142313`\spad{bezoutMatrix(p,q)} returns the Bezout matrix for the two polynomials \spad{p} and \spad{q}.
142380`\spad{bezoutResultant(p,q)} computes the resultant of the two polynomials \spad{p} and \spad{q} by computing the determinant of a Bezout matrix.
142484`\spad{bfEntry(k)} returns the entry in the \axiomType{BasicFunctions} table corresponding to \spad{k}
142624`\spad{bfKeys()} returns the names of each function in the \axiomType{BasicFunctions} table
142677`\spad{biRank(x)} determines the number of linearly independent elements in \spad{x},{} \spad{x*bi},{} \spad{bi*x},{} \spad{bi*x*bj},{} \spad{i,j=1,...,n},{} where \spad{b=[b1,...,bn]} is a basis. Note: if \spad{A} has a unit,{} then \spadfunFrom{doubleRank}{AlgebraPackage},{} \spadfunFrom{weakBiRank}{AlgebraPackage} and \spadfunFrom{biRank}{AlgebraPackage} coincide.
142742`\spad{bigEndian} describes big endian host
142783`\spad{binaryFunction(s)} is a local function
142871`\spad{binarySearchTree(l)} \undocumented
142936`\spad{binaryTournament(ls)} creates a binary tournament with the elements of \spad{ls} as values at the nodes.
143001`\spad{binaryTree(v)} is an non-empty binary tree with value \spad{v},{} and left and right empty.
143048`\spad{binaryTree(l,v,r)} creates a binary tree with value \spad{v} with left subtree \spad{l} and right subtree \spad{r}.
143101`\spad{binary(r)} converts a rational number to a binary expansion.
143162`\spad{binary(op, [a1,...,an])} returns the input form corresponding to \spad{a1 op a2 op ... op an}.
143211`\spad{binding(n,props)} constructs a binding with name `n' and property list `props'.
143273`\spad{bindings(c)} returns the list of bindings in countour \spad{c}.
143406`\spad{binomThmExpt(p,q,n)} returns \spad{(x+y)^n} by means of the binomial theorem trick.
143515`\spad{binomial(n, r)} returns the number of subsets of \spad{r} objects taken among \spad{n} objects,{} \spadignore{i.e.} n!/(r! * (\spad{n}-\spad{r})!).
143574`\spad{binomial(n,f)} \undocumented
143713`\spad{binomial(n,m)} creates a form for the binomial coefficient of \spad{n} and \spad{m}.
143759`\spad{binomial(n,r)} returns the binomial coefficient \spad{C(n,r) = n!/(r! (n-r)!)},{} where \spad{n >= r >= 0}. This is the number of combinations of \spad{n} objects taken \spad{r} at a time.
143823`\spad{binomial(n,r)} returns the \spad{(n,r)} binomial coefficient (often denoted in the literature by \spad{C(n,r)}). Note: \spad{C(n,r) = n!/(r!(n-r)!)} where \spad{n >= r >= 0}.
143888`\spad{bipolarCylindrical(a)} transforms from bipolar cylindrical coordinates to Cartesian coordinates: \spad{bipolarCylindrical(a)} is a function which will map the point \spad{(u,v,z)} to \spad{x = a*sinh(v)/(cosh(v)-cos(u))},{} \spad{y = a*sin(u)/(cosh(v)-cos(u))},{} \spad{z}.
143968`\spad{bipolar(a)} transforms from bipolar coordinates to Cartesian coordinates: \spad{bipolar(a)} is a function which will map the point \spad{(u,v)} to \spad{x = a*sinh(v)/(cosh(v)-cos(u))},{} \spad{y = a*sin(u)/(cosh(v)-cos(u))}.
144037`\spad{birth(x)} \undocumented
144133`\spad{bit?(n,i)} returns \spad{true} if and only if \spad{i}-th bit of \spad{n} is a 1.
144189`\spad{bitCoef(n,m)} returns the coefficient of 2**m in abs(\spad{n})
144250`\spad{bitLength(n)} returns the number of bits to represent abs(\spad{n})
144305`\spad{bitTruth(n,m)} returns \spad{true} if coefficient of 2**m in abs(\spad{n}) is 1
144367`\spad{bitand(x,y)} returns the bitwise `and' of `x' and `y'.
144567`\spad{bitand(x,y)} returns the bitwise `and' of `x' and `y'.
144605`\spad{bitior(x,y)} returns the bitwise `inclusive or' of `x' and `y'.
144805`bitor(\spad{x},{}\spad{y}) returns the bitwise `inclusive or' of `x' and `y'.
144843`\spad{bits()} returns ceiling's precision in bits.
144902`\spad{bits(n)} set the \spadfunFrom{precision}{FloatingPointSystem} to \spad{n} bits.
145013`\spad{bits(n,b)} creates bits with \spad{n} values of \spad{b}
145070`\axiom{bivariate?(\spad{p})} returns \spad{true} iff \axiom{\spad{p}} involves two and only two variables.
145147`\axiom{bivariatePolynomials(lp)} returns \axiom{bps,{}nbps} where \axiom{bps} is a list of the bivariate polynomials,{} and \axiom{nbps} are the other ones.
145273`\spad{bivariateSLPEBR(lp,p,v)} implements the bivariate case of \spadfunFrom{solveLinearPolynomialEquationByRecursion}{PolynomialFactorizationByRecursionUnivariate}; its implementation depends on \spad{R}
145480`\spad{blankSeparate(l)} creates the form separating the elements of \spad{l} by blanks.
145534`\spad{block(l)} creates a representation of the statements in \spad{l} as a block.
145581`\spad{blue()} returns the position of the blue hue from total hues.
145613`\spad{blue(c)} returns the `blue' component of `c'.
145657`\spad{body(e)} return the list of expressions being redcued.
145700`\spad{body(f)} returns the body of the unnamed function `f'.
145750`\spad{body(c)} returns the list of top level expressions appearing in `c'.
145800`\spad{body(c)} returns the list of exports in category syntax `c'.
145851`\spad{body(e)} returns the list of expressions making up `e'.
145899`\spad{body(e)} returns the list of expressions in the sequence of instruction `e'.
145950`base(\spad{d}) returns the actual body of the add-domain expression `d'.
145990`\spad{body(e)} return the expression being collected by the list comprehension `e'.
146034`\spad{body(d)} returns the right hand side of the definition `d'.
146081`\spad{body(m)} returns the right hand side of the definition `m'.
146123`\spad{body(e)} returns the body of the loop `e'.
146166`\spad{bombieriNorm(p)} returns quadratic Bombieri's norm of \spad{p}.
146243`\spad{bombieriNorm(p,n)} returns the \spad{n}th Bombieri's norm of \spad{p}.
146336`\spad{bothWays} indicates that an IO conduit is for both input and output.
146373`\spad{bottom!(d)} returns the element at the bottom (back) of the dequeue.
146423`\axiom{boundOfCauchy(\spad{p})} bounds the roots of \spad{p}
146545`\spad{bounds(s)} returns the bounds of the segment `s'. If `s' designates an infinite interval,{} then the returns list a singleton list.
146683`\spad{box(f)} encloses \spad{f} in a box.
146721`\spad{box([f1,...,fn])} returns \spad{(f1,...,fn)} with a 'box' around them that prevents the \spad{fi} from being evaluated when operators are applied to them,{} and makes them applicable to a unary operator. For example,{} \spad{atan(box [x, 2])} returns the formal kernel \spad{atan(x, 2)}.
146770`\spad{box(f)} returns \spad{f} with a 'box' around it that prevents \spad{f} from being evaluated when operators are applied to it. For example,{} \spad{log(1)} returns 0,{} but \spad{log(box 1)} returns the formal kernel log(1).
146859`\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.
146955`\spad{brace(lf)} creates the form separating the elements of \spad{lf} by commas and encloses the result in curly brackets.
147001`\spad{brace(f)} creates the form enclosing \spad{f} in braces (curly brackets).
147041`\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.
147091`\spad{bracket(lf)} creates the form separating the elements of \spad{lf} by commas and encloses the result in square brackets.
147139`\spad{bracket(f)} creates the form enclosing \spad{f} in square brackets.
147181`\axiom{branchIfCan(leq,{}ts,{}lineq,{}\spad{b1},{}\spad{b2},{}\spad{b3},{}\spad{b4},{}\spad{b5})} is an internal subroutine,{} exported only for developement.
147360`\axiom{branchIfCan(leq,{}ts,{}lineq,{}\spad{b1},{}\spad{b2},{}\spad{b3},{}\spad{b4},{}\spad{b5})} is an internal subroutine,{} exported only for developement.
147549`\spad{branchPoint?(a)} tests whether \spad{x = a} is a branch point.
147622`\spad{branchPoint?(p)} tests whether \spad{p(x) = 0} is a branch point.
147696`\spad{branchPointAtInfinity?()} tests if there is a branch point at infinity.
147778`\spad{bright(c)} sets the shade of a hue,{} \spad{c},{} above dim,{} but below pastel.
147819`\spad{bright(l)} sets the font property of a list of strings,{} \spad{l},{} to bold-face type.
147884`\spad{bright(s)} sets the font property of the string \spad{s} to bold-face type.
147943`\spad{brillhartIrreducible?(p)} returns \spad{true} if \spad{p} can be shown to be irreducible by a remark of Brillhart,{} \spad{false} is inconclusive.
148012`\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.
148089`\spad{brillhartTrials()} returns the number of tests in \spadfun{brillhartIrreducible?}.
148161`\spad{brillhartTrials(n)} sets to \spad{n} the number of tests in \spadfun{brillhartIrreducible?} and returns the previous value.
148251`\spad{bringDown(f)} \undocumented
148323`\spad{bringDown(f,k)} \undocumented
148433`\spad{bsolve(c, w, r, s, m)} returns a list of regimes and solutions of the system \spad{c} \spad{z} = \spad{w} for ranks at least \spad{r}; depending on the mode \spad{m} 
148433`--chosen,{} it writes the output to a file given by the string \spad{s}.
148768`\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
148768`--{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.
148936`\spad{bubbleSort!(a)} \undocumented
149003`\spad{bubbleSort!(a,f)} \undocumented
149068`\spad{buildSyntax(op, [a1, ..., an])} builds a syntax object for \spad{op}(\spad{a1},{}...,{}an).
149127`\spad{buildSyntax(op, [a1, ..., an])} builds a syntax object for \spad{op}(\spad{a1},{}...,{}an).
149178`\spad{build(r,i,e)} \undocumented
149251`\spad{bumprow(cf,pr,r)} is an auxiliary function which bumps a row \spad{r} with a pair \spad{pr} using comparison function \spad{cf},{} and returns a record
149379`\spad{bumptab1(pr,t)} bumps a tableau \spad{t} with a pair \spad{pr} using comparison function \spadfun{<},{} returning a new tableau
149472`\spad{bumptab(cf,pr,t)} bumps a tableau \spad{t} with a pair \spad{pr} using comparison function \spad{cf},{} returning a new tableau
149579`\spad{byteBuffer(n)} creates a buffer of capacity \spad{n},{} and length 0.
149640`\spad{byte(x)} injects the unsigned integer value `v' into the Byte algebra. `v' must be non-negative and less than 256.
149689`\spad{bytes(x)} returns the bytes of the numeric address `x'.
149744`\spad{c02aff(a,n,scale,ifail)} finds all the roots of a complex polynomial equation,{} using a variant of Laguerre's Method. See \downlink{Manual Page}{manpageXXc02aff}.
149845`\spad{c02agf(a,n,scale,ifail)} finds all the roots of a real polynomial equation,{} using a variant of Laguerre's Method. See \downlink{Manual Page}{manpageXXc02agf}.
149946`\spad{c05adf(a,b,eps,eta,ifail,f)} locates a zero of a continuous function in a given interval by a combination of the methods of linear interpolation,{} extrapolation and bisection. See \downlink{Manual Page}{manpageXXc05adf}.
150085`\spad{c05nbf(n,lwa,x,xtol,ifail,fcn)} is an easy-to-use routine to find a solution of a system of nonlinear equations by a modification of the Powell hybrid method. See \downlink{Manual Page}{manpageXXc05nbf}.
150226`\spad{c05pbf(n,ldfjac,lwa,x,xtol,ifail,fcn)} is an easy-to-use routine to find a solution of a system of nonlinear equations by a modification of the Powell hybrid method. The user must provide the Jacobian. See \downlink{Manual Page}{manpageXXc05pbf}.
150376`\spad{c06eaf(n,x,ifail)} calculates the discrete Fourier transform of a sequence of \spad{n} real data values. (No extra workspace required.) See \downlink{Manual Page}{manpageXXc06eaf}.
150469`\spad{c06ebf(n,x,ifail)} calculates the discrete Fourier transform of a Hermitian sequence of \spad{n} complex data values. (No extra workspace required.) See \downlink{Manual Page}{manpageXXc06ebf}.
150562`\spad{c06ecf(n,x,y,ifail)} calculates the discrete Fourier transform of a sequence of \spad{n} complex data values. (No extra workspace required.) See \downlink{Manual Page}{manpageXXc06ecf}.
150675`\spad{c06ekf(job,n,x,y,ifail)} calculates the circular convolution of two real vectors of period \spad{n}. No extra workspace is required. See \downlink{Manual Page}{manpageXXc06ekf}.
150796`\spad{c06fpf(m,n,init,x,trig,ifail)} computes the discrete Fourier transforms of \spad{m} sequences,{} each containing \spad{n} real data values. This routine is designed to be particularly efficient on vector processors. See \downlink{Manual Page}{manpageXXc06fpf}.
150924`\spad{c06fqf(m,n,init,x,trig,ifail)} computes the discrete Fourier transforms of \spad{m} Hermitian sequences,{} each containing \spad{n} complex data values. This routine is designed to be particularly efficient on vector processors. See \downlink{Manual Page}{manpageXXc06fqf}.
151052`\spad{c06frf(m,n,init,x,y,trig,ifail)} computes the discrete Fourier transforms of \spad{m} sequences,{} each containing \spad{n} complex data values. This routine is designed to be particularly efficient on vector processors. See \downlink{Manual Page}{manpageXXc06frf}.
151200`\spad{c06fuf(m,n,init,x,y,trigm,trign,ifail)} computes the two-dimensional discrete Fourier transform of a bivariate sequence of complex data values. This routine is designed to be particularly efficient on vector processors. See \downlink{Manual Page}{manpageXXc06fuf}.
151368`\spad{c06gbf(n,x,ifail)} forms the complex conjugate of \spad{n} data values. See \downlink{Manual Page}{manpageXXc06gbf}.
151461`\spad{c06gcf(n,y,ifail)} forms the complex conjugate of a sequence of \spad{n} data values. See \downlink{Manual Page}{manpageXXc06gcf}.
151554`\spad{c06gqf(m,n,x,ifail)} forms the complex conjugates,{} each containing \spad{n} data values. See \downlink{Manual Page}{manpageXXc06gqf}.
151655`\spad{c06gsf(m,n,x,ifail)} takes \spad{m} Hermitian sequences,{} each containing \spad{n} data values,{} and forms the real and imaginary parts of the \spad{m} corresponding complex sequences. See \downlink{Manual Page}{manpageXXc06gsf}.
151756`\spad{cAcos(f)} computes the arccosine of the power series \spad{f}. For use when the coefficient ring is commutative.
151860`\spad{cAcosh(f)} computes the inverse hyperbolic cosine of the power series \spad{f}. For use when the coefficient ring is commutative.
151965`\spad{cAcot(f)} computes the arccotangent of the power series \spad{f}. For use when the coefficient ring is commutative.
152069`\spad{cAcoth(f)} computes the inverse hyperbolic cotangent of the power series \spad{f}. For use when the coefficient ring is commutative.
152174`\spad{cAcsc(f)} computes the arccosecant of the power series \spad{f}. For use when the coefficient ring is commutative.
152278`\spad{cAcsch(f)} computes the inverse hyperbolic cosecant of the power series \spad{f}. For use when the coefficient ring is commutative.
152383`\spad{cAsec(f)} computes the arcsecant of the power series \spad{f}. For use when the coefficient ring is commutative.
152487`\spad{cAsech(f)} computes the inverse hyperbolic secant of the power series \spad{f}. For use when the coefficient ring is commutative.
152592`\spad{cAsin(f)} computes the arcsine of the power series \spad{f}. For use when the coefficient ring is commutative.
152696`\spad{cAsinh(f)} computes the inverse hyperbolic sine of the power series \spad{f}. For use when the coefficient ring is commutative.
152801`\spad{cAtan(f)} computes the arctangent of the power series \spad{f}. For use when the coefficient ring is commutative.
152905`\spad{cAtanh(f)} computes the inverse hyperbolic tangent of the power series \spad{f}. For use when the coefficient ring is commutative.
153010`\spad{cCos(f)} computes the cosine of the power series \spad{f}. For use when the coefficient ring is commutative.
153113`\spad{cCosh(f)} computes the hyperbolic cosine of the power series \spad{f}. For use when the coefficient ring is commutative.
153217`\spad{cCot(f)} computes the cotangent of the power series \spad{f}. For use when the coefficient ring is commutative.
153320`\spad{cCoth(f)} computes the hyperbolic cotangent of the power series \spad{f}. For use when the coefficient ring is commutative.
153424`\spad{cCsc(f)} computes the cosecant of the power series \spad{f}. For use when the coefficient ring is commutative.
153527`\spad{cCsch(f)} computes the hyperbolic cosecant of the power series \spad{f}. For use when the coefficient ring is commutative.
153631`\spad{cExp(f)} computes the exponential of the power series \spad{f}. For use when the coefficient ring is commutative.
153734`\spad{cLog(f)} computes the logarithm of the power series \spad{f}. For use when the coefficient ring is commutative.
153837`\spad{cPower(f,r)} computes \spad{f^r},{} where \spad{f} has constant coefficient 1. For use when the coefficient ring is commutative.
153947`\spad{cRationalPower(f,r)} computes \spad{f^r}. For use when the coefficient ring is commutative.
154078`\spad{cSec(f)} computes the secant of the power series \spad{f}. For use when the coefficient ring is commutative.
154181`\spad{cSech(f)} computes the hyperbolic secant of the power series \spad{f}. For use when the coefficient ring is commutative.
154285`\spad{cSin(f)} computes the sine of the power series \spad{f}. For use when the coefficient ring is commutative.
154388`\spad{cSinh(f)} computes the hyperbolic sine of the power series \spad{f}. For use when the coefficient ring is commutative.
154492`\spad{cTan(f)} computes the tangent of the power series \spad{f}. For use when the coefficient ring is commutative.
154595`\spad{cTanh(f)} computes the hyperbolic tangent of the power series \spad{f}. For use when the coefficient ring is commutative.
154699`\spad{cache()} returns the current cache as a list.
154746`\spad{calcRanges(l)} \undocumented
154842`\spad{callForm?(e)} is \spad{true} when `e' is a call expression.
154901`\spad{call(s)} creates a representation of a FORTRAN CALL statement
154945`\spad{cap(s1,s2)},{} introduced by Redfield,{} \indented{1}{is the scalar product of two cycle indices.}
155078`\spad{capacity(buf)} returns the pre-allocated maximum size of `buf'.
155137`\spad{car((a1,...,an))} returns \spad{a1}.
155276`\spad{cardinality(u)} returns the number of elements of \spad{u}. Note: \axiom{cardinality(\spad{u}) = \#u}.
155349`\spad{carriageReturn} designates carriage return.
155395`\spad{cartesian(pt)} returns the Cartesian coordinates of point \spad{pt}.
155461`\spad{x case false} holds if the value of `x' is `false'
155527`\spad{s case true} holds if the value of `x' is `true'.
155592`\spad{x case unknown} holds if the value of `x' is `unknown'
155660`\spad{s case AttributeAst} holds if `s' represents an attribute.
155727`\spad{s case CapsuleAst} holds if `s' represents a domain capsule.
155792`\spad{s case CaseAst} holds if `s' represents a case-expression.
155854`\spad{s case CategoryAst} holds if `s' represents an unnamed category.
155920`\spad{s case ReturnAst} holds if `s' represents a coerce-expression.
155984`\spad{s case CollectAst} holds if `s' represents a list-comprehension.
156049`\spad{s case ColonAst} holds if `s' represents a colon-expression.
156112`\spad{s case ConstructAst} holds if `s' represents a list-expression.
156179`\spad{s case DefinitionAst} holds if `s' represents a definition.
156247`\spad{x case DoubleFloat} is \spad{true} if `x' really is a DoubleFloat
156305`\spad{s case ExitAst} holds if `s' represents an exit-expression.
156367`\spad{s case HasAst} holds if `s' represents a has-expression.
156428`\spad{s case Identifier} holds if `s' represents an identifier.
156493`\spad{x case Identifier} if the parameter AST object \spad{x} designates an \spadtype{Identifier}.
156556`\spad{x case Identifier} is \spad{true} if `x' really is an Identifier
156613`\spad{s case IfAst} holds if `s' represents an if-statement.
156673`\spad{s case ImportAst} holds if `s' represents an `import' statement.
156737`\spad{s case InAst} holds if `s' represents a in-iterator
156797`\spad{s case Integer} holds if `s' represents an integer literal.
156859`\spad{x case Integer} is \spad{true} if `x' really is an Integer
156913`\spad{s case IsAst} holds if `s' represents an is-expression.
156973`\spad{s case JoinAst} holds is the syntax object \spad{s} denotes the join of several categories.
157035`\spad{s case LetAst} holds if `s' represents an assignment-expression.
157096`\spad{s case MacroAst} holds if `s' represents a macro definition.
157159`\spad{s case MappingAst} holds if `s' represents a mapping type.
157224`\spad{s case PretendAst} holds if `s' represents a pretend-expression.
157289`\spad{s case RepeatAst} holds if `s' represents an repeat-loop.
157353`\spad{s case RestrictAst} holds if `s' represents a restrict-expression.
157419`\spad{s case ReturnAst} holds if `s' represents a return-statement.
157483`\spad{s case SegmentAst} holds if `s' represents a segment-expression.
157548`\spad{s case SequenceAst} holds if `s' represents a sequence-of-statements.
157614`\spad{s case SignatureAst} holds if `s' represents a signature export.
157681`\spad{s case StepAst} holds if \spad{s} represents an arithmetic progression iterator.
157743`\spad{s case String} holds if `s' represents a string literal.
157804`\spad{x case String} if the parameter AST object \spad{x} designates a flag.
157863`\spad{x case String} is \spad{true} if `x' really is a String
157916`\spad{s case SuchThatAst} holds if `s' represents a qualified-expression.
157982`\spad{x case T} returns \spad{true} if \spad{x} is actually a data of type \spad{T}.
158032`\spad{s case WhereAst} holds if `s' represents an expression with local definitions.
158095`\spad{s case WhileAst} holds if `s' represents a while-iterator
158158`\spad{x case nothing} holds if the value for \spad{x} is missing.
158214`\spad{categories x} returns the list of categories forms each domain object obtained from the domain data \spad{x} belongs to.
158310`catehories(\spad{x}) returns the types in the join `x'.
158363`the current category environment in the interpreter.
158410`\spad{categoryMode} is a constant mode denoting Category.
158461``category' is the kind of category constructors
158507`\spad{cdr((a1,...,an))} returns \spad{(a2,...,an)}.
158621`\spad{ceiling(x)} returns the smallest integral element above \spad{x}.
158702`\spad{ceiling x} returns the small integer \spad{>= x}.
158750`\spad{center(f)} centers form \spad{f} in total space.
158791`\spad{center(f)} returns the point about which the series \spad{f} is expanded.
158865`\spad{center(f,n)} centers form \spad{f} within space of width \spad{n}.
158914`\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}.
158994`\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.
159062`\spad{central?(f,g,l)} \undocumented{}
159167`\axiom{certainlySubVariety?(newlp,{}lp)} returns \spad{true} iff for every \axiom{\spad{p}} in \axiom{lp} the remainder of \axiom{\spad{p}} by \axiom{newlp} using the division algorithm of Groebner techniques is zero.
159268`\spad{cfirst n} is used internally.
159384`\axiom{chainSubResultants(\spad{P},{} \spad{Q})} computes the list of non zero subresultants of \axiom{\spad{P}} and \axiom{\spad{Q}}.
159473`\spad{changeBase(exp,man,base)} \undocumented{}
159549`\spad{changeBase(M, A, sig, der)}: computes the new matrix of a pseudo-linear transform given by the matrix \spad{M} under the change of base A
159656`\spad{changeMeasure(R,s,newValue)} changes the maximum value for a measure of the given NAG routine.
159720`\spad{changeNameToObjf(s,r)} changes the name of item \axiom{\spad{s}} in \axiom{\spad{r}} to objf.
159792`\spad{changeName(s,t,r)} changes the name of item \axiom{\spad{s}} in \axiom{\spad{r}} to \axiom{\spad{t}}.
159865`\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.
159932`\spad{changeVar(+/[ai D^i], a)} returns the operator \spad{+/[ai (D+a)^i]}.
160005`\spad{changeVar(+/[ai D^i], a)} returns the operator \spad{+/[ai (D+a)^i]}.
160068`\spad{changeWeightLevel(n)} This changes the weight level to the new value given: NB: previously calculated terms are not affected
160172`\spad{changeWeightLevel(n)} changes the weight level to the new value given: NB: previously calculated terms are not affected
160279`\spad{charClass(l)} creates a character class which contains exactly the characters given in the list \spad{l}.
160340`\spad{charClass(s)} creates a character class which contains exactly the characters given in the string \spad{s}.
160392`\spad{char(i)} provides a character corresponding to the integer code \spad{i}.	It is always \spad{true} that \spad{ord char i = i}.
160446`\spad{char(s)} provides a character from a string \spad{s} of length one.
160488`\spad{character?(t)} tests whether \spad{t} is equivalent to the FORTRAN type CHARACTER.
160545`\spad{characteristicPolynomial(e)} returns the characteristic polynomial of \spad{e} using resultants
160873`\spad{characteristicPolynomial(m)} returns the characteristic polynomial of the matrix \spad{m} expressed as polynomial over complex rationals with a new symbol as variable.
161021`\spad{characteristicPolynomial(m)} returns the characteristic polynomial of the matrix \spad{m} expressed as polynomial over RN with a new symbol as variable.
161148`\spad{characteristicPolynomial(m)} returns the characteristicPolynomial of the matrix \spad{m} using a new generated symbol symbol as the main variable.
161252`\spad{characteristicPolynomial(a)} returns the characteristic polynomial of the regular representation of \spad{a} with respect to any basis.
161324`\spad{characteristicPolynomial(m,x)} returns the characteristic polynomial of the matrix \spad{m} expressed as polynomial over Complex Rationals with variable \spad{x}.
161479`\spad{characteristicPolynomial(m,x)} returns the characteristic polynomial of the matrix \spad{m} expressed as polynomial over RN with variable \spad{x}. Fraction \spad{P} RN.
161613`\spad{characteristicPolynomial(m,var)} returns the characteristicPolynomial of the matrix \spad{m} using the symbol \spad{var} as the main variable.
161724`\spad{characteristicPolynomial(m,r)} computes the characteristic polynomial of the matrix \spad{m} evaluated at the point \spad{r}. In particular,{} if \spad{r} is the polynomial 'x,{} then it returns the characteristic polynomial expressed as a polynomial in 'x.
161815`\axiom{characteristicSerie(ps)} returns the same as \axiom{characteristicSerie(ps,{}initiallyReduced?,{}initiallyReduce)}.
161901`\axiom{characteristicSerie(ps,{}redOp?,{}redOp)} returns a list \axiom{lts} of triangular sets such that the zero set of \axiom{ps} is the union of the regular zero sets of the members of \axiom{lts}. This is made by the Ritt and Wu Wen Tsun process applying the operation \axiom{characteristicSet(ps,{}redOp?,{}redOp)} to compute characteristic sets in Wu Wen Tsun sense.
162011`\axiom{characteristicSet(ps)} returns the same as \axiom{characteristicSet(ps,{}initiallyReduced?,{}initiallyReduce)}.
162105`\axiom{characteristicSet(ps,{}redOp?,{}redOp)} returns a non-contradictory characteristic set of \axiom{ps} in Wu Wen Tsun sense \spad{w}.\spad{r}.\spad{t} the reduction-test \axiom{redOp?} (using \axiom{redOp} to reduce polynomials \spad{w}.\spad{r}.\spad{t} a \axiom{redOp?} basic set),{} if no non-zero constant polynomial appear during those reductions,{} else \axiom{"failed"} is retu
162105`--rned. The operations \axiom{redOp} and \axiom{redOp?} must satisfy the following conditions: \axiom{redOp?(redOp(\spad{p},{}\spad{q}),{}\spad{q})} holds for every polynomials \axiom{\spad{p},{}\spad{q}} and there exists an integer \axiom{\spad{e}} and a polynomial \axiom{\spad{f}} such that we have \axiom{init(\spad{q})^e*p = f*q + redOp(\spad{p},{}\spad{q})}.
162861`\spad{characteristic()} returns the characteristic of the ring.
162932`\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.
162989`\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}
163468`\spad{charthRoot(x)} returns the \spad{p}th root of \spad{x} where \spad{p} is the characteristic of the ring.
163531`\spad{charthRoot(r)} returns the \spad{p}\spad{-}th root of \spad{r},{} or \spad{nothing} if none exists in the domain.
163633`\spad{charthRoot(a)} takes the characteristic'th root of {\em a}. Note: such a root is alway defined in finite fields.
163687`\spad{chebyshevT(n)} returns the \spad{n}th Chebyshev polynomial \spad{T[n](x)}. Note: Chebyshev polynomials of the first kind,{} denoted \spad{T[n](x)},{} computed from the two term recurrence. The generating function \spad{(1-t*x)/(1-2*t*x+t**2) = sum(T[n](x)*t**n, n=0..infinity)}.
163791`\spad{chebyshevT(n,x)} is the \spad{n}-th Chebyshev polynomial of the first kind,{} \spad{T[n](x)}. These are defined by \spad{(1-t*x)/(1-2*t*x+t**2) = sum(T[n](x) *t**n, n = 0..)}.
163875`\spad{chebyshevU(n)} returns the \spad{n}th Chebyshev polynomial \spad{U[n](x)}. Note: Chebyshev polynomials of the second kind,{} denoted \spad{U[n](x)},{} computed from the two term recurrence. The generating function \spad{1/(1-2*t*x+t**2) = sum(T[n](x)*t**n, n=0..infinity)}.
163979`\spad{chebyshevU(n,x)} is the \spad{n}-th Chebyshev polynomial of the second kind,{} \spad{U[n](x)}. These are defined by \spad{1/(1-2*t*x+t**2) = sum(T[n](x) *t**n, n = 0..)}.
164063`\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.
164227`\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.
164382`\spad{checkPrecision()} \undocumented{}
164445`\spad{checkRur(ts,lus)} returns \spad{true} if \spad{lus} is a rational univariate representation of \spad{ts}.
164551`\spad{check(s)} returns lllpt,{} list of lists of lists of point information about the \spadtype{ThreeSpace} \spad{s}.
164602`\spad{check should} be local
164802`\spad{chiSquare1(n)} \undocumented
164880`\spad{chiSquare(n)} \undocumented
165074`\spad{child?(u,v)} tests if node \spad{u} is a child of node \spad{v}.
165152`\spad{child(x,n)} \undocumented
165394`\spad{children(x)} \undocumented
165446`\spad{children(u)} returns a list of the children of aggregate \spad{u}.
165506`\spad{chineseRemainder(llv,lm)} returns a list of values,{} each of which corresponds to the Chinese remainder of the associated element of \axiom{\spad{llv}} and axiom{\spad{lm}}. This is more efficient than applying chineseRemainder several times.
165584`\spad{chineseRemainder(lv,lm)} returns a value \axiom{\spad{v}} such that,{} if \spad{x} is \axiom{\spad{lv}.\spad{i}} modulo \axiom{\spad{lm}.\spad{i}} for all \axiom{\spad{i}},{} then \spad{x} is \axiom{\spad{v}} modulo \axiom{\spad{lm}(1)*lm(2)*...*lm(\spad{n})}.
165650`\spad{chineseRemainder(lu,lr,n)} \undocumented
165872`\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.
165975`\spad{choosemon }\undocumented
166153`\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}.
166297`\spad{clearCache()} empties the cache.
166346`\spad{clearDenominator([q1,...,qn])} returns \spad{[p1,...,pn]} such that \spad{qi = pi/d} where \spad{d} is a common denominator for the \spad{qi}'s.
166416`\spad{clearDenominator([q1,...,qn])} returns \spad{[p1,...,pn]} such that \spad{qi = pi/d} where \spad{d} is a common denominator for the \spad{qi}'s.
166479`\spad{clearDenominator(q)} returns \spad{p} such that \spad{q = p/d} where \spad{d} is a common denominator for the elements of \spad{q}.
166562`\spad{clearDenominator(q)} returns \spad{p} such that \spad{q = p/d} where \spad{d} is a common denominator for the coefficients of \spad{q}.
166648`\spad{clearFortranOutputStack()} clears the Fortran output stack
166730`\axiom{clearTable!()} clears the hash-table and assumes that it will no longer be used.
166804`\spad{clearTheFTable()} clears the current table of functions.
166868`\spad{clearTheIFTable()} clears the current table of intensity functions.
166934`\spad{clearTheSymbolTable()} clears the current symbol table.
166992`\spad{clearTheSymbolTable(x)} removes the symbol \spad{x} from the table
167056`\spad{clikeUniv(v)} is used internally.
167175`\spad{clipBoolean(l,b)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{clipBoolean}. If the option does not exist the value,{} \spad{b} is returned.
167258`\spad{clipParametric(p)} performs two-dimensional clipping on a plot,{} \spad{p},{} from the domain \spadtype{Plot} for the parametric curve \spad{x = f(t)},{} \spad{y = g(t)}; the default parameters \spad{1/2} for the fraction and \spad{5/1} for the scale are used in the \fakeAxiomFun{iClipParametric} subroutine,{} which is called by thi
167258`--s function.
167425`\spad{clipParametric(p,frac,sc)} performs two-dimensional clipping on a plot,{} \spad{p},{} from the domain \spadtype{Plot} for the parametric curve \spad{x = f(t)},{} \spad{y = g(t)}; the fraction parameter is specified by \spad{frac} and the scale parameter is specified by \spad{sc} for use in the \fa
167425`--keAxiomFun{iClipParametric} subroutine,{} which is called by this function.
167628`\spad{clipPointsDefault()} determines whether or not automatic clipping is to be done.
167689`\spad{clipPointsDefault(true)} turns on automatic clipping; \spad{clipPointsDefault(false)} turns off automatic clipping. The default setting is \spad{true}.
167757`\spad{clipSurface(v,s)} displays the graph with the specified clipping region removed if \spad{s} is "on",{} or displays the graph without clipping implemented if \spad{s} is "off",{} for the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport}.
167826`\spad{clipWithRanges(pointLists,xMin,xMax,yMin,yMax)} performs clipping on a list of lists of points,{} \spad{pointLists}. Clipping is done within the specified ranges of \spad{xMin},{} \spad{xMax} and \spad{yMin},{} \spad{yMax}. This function is used internally by 
167826`--the \fakeAxiomFun{iClipParametric} subroutine in this package.
168067`\spad{clip(ll)} performs two-dimensional clipping on a list of lists of points,{} \spad{ll}; the default parameters \spad{1/2} for the fraction and \spad{5/1} for the scale are used in the \fakeAxiomFun{iClipParametric} subroutine,{} which is called by this function.
168250`\spad{clip(l)} performs two-dimensional clipping on a curve \spad{l},{} which is a list of points; the default parameters \spad{1/2} for the fraction and \spad{5/1} for the scale are used in the \fakeAxiomFun{iClipParametric} subroutine,{} which is called by this function.
168427`\spad{clip(p)} performs two-dimensional clipping on a plot,{} \spad{p},{} from the domain \spadtype{Plot} for the graph of one variable,{} \spad{y = f(x)}; the default parameters \spad{1/4} for the fraction and \spad{5/1} for the scale are used in the \spadfun{clip} function.
168584`\spad{clip(b)} turns 2D clipping on if \spad{b} is \spad{true},{} or off if \spad{b} is \spad{false}. This option is expressed in the form \spad{clip == b}.
168628`\spad{clip([l])} provides ranges for user-defined clipping as specified in the list \spad{l}. This option is expressed in the form \spad{clip == [l]}.
168685`\spad{clip(p,frac,sc)} performs two-dimensional clipping on a plot,{} \spad{p},{} from the domain \spadtype{Plot} for the graph of one variable \spad{y = f(x)}; the fraction parameter is specified by \spad{frac} and the scale parameter is specified by \spad{sc} for use in the \spadfun{clip} function.
168878`\spad{close!(c)} closes the conduit \spad{c},{} changing its state to one that is invalid for future read or write operations.
168916`\spad{close!(f)} returns the file \spad{f} closed to input and output.
168967`\spad{closeComponent(s,li,b)} sets the property of the component in the 3 dimensional subspace,{} \spad{s},{} to be closed if \spad{b} is \spad{true},{} or open if \spad{b} is \spad{false}. The list of non negative integers,{} \spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component whose closed property is to be set. The subspace,{} \spad{s},{} is returned with the compone
168967`--nt property modification.
169052`\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.
169106`\spad{close(v)} closes the viewport window of the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport},{} and terminates the corresponding process ID.
169162`\spad{close(x,b)} \undocumented
169230`\spad{closed?(x)} \undocumented
169292`\spad{closed?(t)} tests whether the given tube plot \spad{t} is closed.
169344`\spad{closedCurve?(s)} returns \spad{true} if the \spadtype{ThreeSpace} \spad{s} contains a single closed curve component,{} \spadignore{i.e.} the first element of the curve is also the last element,{} or \spad{false} otherwise.
169407`\spad{closedCurve(lp)} sets a list of points defined by the first element of \spad{lp} through the last element of \spad{lp} and back to the first elelment again and returns a \spadtype{ThreeSpace} whose component is the closed curve defined by \spad{lp}.
169476`\spad{closedCurve(s)} checks to see if the \spadtype{ThreeSpace},{} \spad{s},{} is composed of a single closed curve component defined by a list of points in which the first point is also the last point,{} all of which are from the domain \spad{PointDomain(m,R)} and if so,{} returns the list of points. An error is signaled otherwise.
169545`\spad{closedCurve(s,[[lr0],[lr1],...,[lrn],[lr0]])} adds a closed curve component defined by a list of points \spad{lr0} through \spad{lrn},{} which are lists of elements from the domain \spad{PointDomain(m,R)},{} where \spad{R} is the \spadtype{Ring} over which the point elements are defined and \spad{m} is the dimension of the points,{} in which the last element of the list of points contains a copy of the first element list,{} \s
169545`--pad{lr0}. The closed curve is added to the \spadtype{ThreeSpace},{} \spad{s}.
169616`\spad{closedCurve(s,[p0,p1,...,pn,p0])} adds a closed curve component which is a list of points defined by the first element \spad{p0} through the last element \spad{pn} and back to the first element \spad{p0} again,{} to the \spadtype{ThreeSpace} \spad{s}.
169688`\spad{closed} indicates that the IO conduit has been closed.
169723`\spad{cn(x,k)} expands the elliptic function cn as a Taylor \indented{1}{series.}
169882`\axiom{coHeight(ts)} returns \axiom{size()\$\spad{V}} minus \axiom{\#ts}.
169974`\spad{code(f)} returns the internal representation of the object represented by \spad{f}.
170704`\spad{coefChoose should} be local
170787`\spad{coef(p,e)} extracts the coefficient of the monomial \spad{e}. Returns zero if \spad{e} is not present.
170837`\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.
170920`\spad{coef(x,w)} returns the coefficient of the word \spad{w} in \spad{x}.
170988`\spad{coef(x,y)} returns scalar product of \spad{x} by \spad{y},{} the set of words being regarded as an orthogonal basis.
171101`\spad{coefficient(x,n)} \undocumented
171167`\spad{coefficient(f,m)} extracts the coefficient of \spad{m} in \spad{f} with respect to the canonical basis \spad{M}.
171219`\spad{coefficient(s, n)} gives the terms of total degree \spad{n}.
171319`\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.
171410`\spad{coefficient(p,u)} returns the coefficient of the term in \spad{p} containing the basis term \spad{u} if such a term exists,{} and 0 otherwise. Error: if the second argument \spad{u} is not a basis element.
171464`\spad{coefficient(s, e1 a1 + ... + en an)} returns \spad{ei} such that \spad{ai} = \spad{s},{} or 0 if \spad{s} is not one of the \spad{ai}'s.
171531`\spad{coefficient(x,b)} returns the coefficient of \spad{b} in \spad{x}.
171594`\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.
171653`\spad{coefficient(x,[i1,i2,...,iN])} extracts the coefficient of \spad{e(i1)*e(i2)*...*e(iN)} in \spad{x}.
171732`\spad{coefficient(s, n)} gives the terms of total degree \spad{n}.
171819`\spad{coefficient(l,k)} is \spad{a(k)} if \indented{2}{\spad{l = sum(monomial(a(i),i), i = 0..n)}.}
171899`\spad{coefficient(l,k)} is \spad{a(k)} if \indented{2}{\spad{l = sum(monomial(a(i),i), i = 0..n)}.}
172176`\spad{coefficient(f,[x1,x2,...,xk],[n1,n2,...,nk])} returns the coefficient of \spad{x1^n1 * ... * xk^nk} in \spad{f}.
172289`\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)}.
172393`\spad{coefficient(f,x,n)} returns the coefficient of \spad{x^n} in \spad{f}.
172494`\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.
172727`\spad{coefficients(f)} lists all non-zero coefficients.
172784`\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.}
172854`\spad{coefficients(p)} gives the list of non-zero coefficients of polynomial \spad{p}.
172924`\spad{coefficients(x)} returns the list of coefficients of \spad{x}.
172988`\spad{coefficients(l)} returns the list of all the nonzero coefficients of \spad{l}.
173065`\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.
173148`\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.
173254`\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.
173336`coerceS(\spad{o}) changes \spad{o} in the standard output format to MathML format and displays result as one long string.
173392`\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.
173459`\spad{coerceP(v)} coerces a vector \spad{v} with entries in \spadtype{Matrix R} as vector over \spadtype{Matrix Polynomial R}
173561`\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.
173632`\spad{coerceS(o)} changes \spad{o} in the standard output format to MathML format and displays formatted result.
174367`\spad{coerce(r)} converts a ring element \spad{r} to a stream with one element.
174606`\spad{coerce(f)} produces the equivalence class of \spad{f} in the residue ring
175907`\spad{coerce(gi)} converts the indicated \spadtype{GraphImage},{} \spad{gi},{} into the \spadtype{TwoDimensionalViewport} form.
177099`\axiom{coerce(\spad{p})} returns \axiom{\spad{p}}.
177175`\spad{coerce(l)} converts a list of 0's and 1's into a basis element,{} where 1 (respectively 0) designates that the variable of the corresponding index of \spad{l} is (respectively,{} is not) present. Error: if an element of \spad{l} is not 0 or 1.
177228`\spad{coerce(llp)} component(\spad{gi},{}pt) creates and returns a graph of the domain \spadtype{GraphImage} which is composed of the list of list of points given by \spad{llp},{} and whose point colors,{} line colors and point sizes are determined by the default functions \spadfun{pointColorDefault},{} \spadfun{lineColorDefault},{} and \spadfun{pointSizeDefault}. The graph data is then sent to the viewport manager where it waits to b
177228`--e included in a two-dimensional viewport window.
177297`\spad{coerce(lt)} converts a list of terms and coefficients to a member of the domain.
180157`\spad{coerce(poly)} regroups the terms by total degree and forms a series.
180311`\spad{coerce(p)} returns \spad{p} viewed as an algebraic number.
180650`\spad{coerce(p)} converts a univariate polynomial \spad{p} in the variable \spad{var} to a univariate Taylor series in \spad{var}.
180751`\spad{coerce(p)} converts a univariate polynomial \spad{p} in the variable \spad{var} to a univariate Taylor series in \spad{var}.
180846`\spad{coerce(f)} converts a \spadtype{UnivariatePuiseuxSeries} to an \spadtype{ExponentialExpansion}.
181071`\spad{coerce(var)} converts a variable to a Taylor series
181147`\spad{coerce(v)} return \spad{v}
181221`\spad{coerce(var)} converts the series variable \spad{var} into a Laurent series.
181306`\spad{coerce(var)} converts the series variable \spad{var} into a \indented{1}{Taylor series.}
181390`\spad{coerce(var)} converts the series variable \spad{var} into a Laurent series.
181469`\spad{coerce(var)} converts the series variable \spad{var} into a \indented{1}{Taylor series.}
181547`\spad{coerce(v)} assumes that it is called with a vector of length equal to the dimension of the algebra,{} then a linear combination with the basis element is formed
181649`\spad{coerce(v)} coerces a vector \spad{v} with entries in \spadtype{Matrix R} as vector over \spadtype{Matrix Fraction Polynomial R}
181760`\axiom{coerce(\spad{x})} returns the element of \axiomType{Magma}(VarSet) corresponding to \axiom{\spad{x}}.
181820`\axiom{coerce(\spad{x})} returns the element of \axiomType{OrderedFreeMonoid}(VarSet) corresponding to \axiom{\spad{x}}.
181892`\axiom{coerce(\spad{x})} returns the element of \axiomType{OrderedFreeMonoid}(VarSet) corresponding to \axiom{\spad{x}} by removing parentheses.
181959`\spad{coerce([l1]*[l2]*...[ln])} returns the word \spad{l1*l2*...*ln},{} where \spad{[l_i]} is the backeted form of the Lyndon word \spad{l_i}.
182052`\spad{coerce(gi)} returns the indicated graph,{} \spad{gi},{} of domain \spadtype{GraphImage} as output of the domain \spadtype{OutputForm}.
182101`\spad{coerce(v)} returns the given two-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{TwoDimensionalViewport} as output of the domain \spadtype{OutputForm}.
182162`\spad{coerce(x)} \undocumented
182246`\spad{coerce(x)} \undocumented
182320`\spad{coerce(x)} \undocumented
182393`\spad{coerce(x)} returns the symbol
182441`\axiom{coerce(\spad{g})} returns the internal representation of \axiom{\spad{g}}.
182533`\axiom{coerce(\spad{p})} returns \axiom{\spad{p}} as a distributed polynomial.
182618`\axiom{coerce(\spad{g})} returns the internal representation of \axiom{\spad{g}}.
182702`\axiom{coerce(\spad{p})} returns \axiom{\spad{p}} as a recursive polynomial.
182785`\spad{coerce A} changes its argument into a \indented{1}{nullary function.}
182836`\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).
182894`\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).
182949`\spad{coerce(c)} returns \spad{c} as a string \spad{s} with the character \spad{c}.
183002`\spad{coerce(col)} converts the column \spad{col} to a column matrix.
183059`\spad{coerce(c)} sets the average shade for the palette to that of the indicated color \spad{c}.
183100`\spad{coerce(u)} transforms \spad{u} into a MachineComplex
183157`\spad{coerce(u)} transforms \spad{u} into a MachineComplex
183216`\spad{coerce(u)} transforms \spad{u} into a MachineComplex
183280`\spad{coerce(u)} transforms \spad{u} into a MachineComplex
183346`\spad{coerce(v)} views a vector as a rank 1 tensor.
183423`\spad{coerce(eq)} \undocumented{}
183537`\spad{coerce(eq)} \undocumented{}
183642`\spad{coerce(eq)} \undocumented{}
183749`\spad{coerce(eq)} \undocumented{}
183863`\spad{coerce(eq)} \undocumented{}
183975`\spad{coerce(eq)} \undocumented{}
184089`\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.
184148`\spad{coerce(e)} \undocumented{}
184252`\spad{coerce(e)} \undocumented{}
184347`\spad{coerce(x)} returns \spad{x} with coefficients in the domain
184421`\spad{coerce(e)} \undocumented{}
184518`\spad{coerce(e)} \undocumented{}
184622`\spad{coerce(e)} \undocumented{}
184724`\spad{coerce(e)} \undocumented{}
184828`\spad{coerce(x)} is the homomorphic image of \spad{x} from {\em F1} in {\em F2}. Thus {\em coerce} is a field homomorphism between the fields extensions {\em F1} and {\em F2} both over ground field {\em GF} (the second argument to the package). Error: if the extension degree of {\em F1} doesn't divide the extension degree of {\em F2}. Note that the other coercion function in the \spadtype{FiniteFieldHomomorphisms} is a left inverse.
184893`\spad{coerce(x)} is the homomorphic image of \spad{x} from {\em F2} in {\em F1},{} where {\em coerce} is a field homomorphism between the fields extensions {\em F2} and {\em F1} both over ground field {\em GF} (the second argument to the package). Error: if the extension degree of {\em F2} doesn't divide the extension degree of {\em F1}. Note that the other coercion function in the \spadtype{FiniteFieldHomomorphisms} is a left inverse.
184958`\spad{coerce(e)} takes an object from \spadtype{FortranCode} and \indented{1}{uses it as the body of an ASP.}
185021`\spad{coerce(e)} takes an object from \spadtype{FortranCode} and \indented{1}{uses it as the body of an ASP.}
185082`\spad{coerce(e)} takes an object from \spadtype{FortranCode} and \indented{1}{uses it as the body of an ASP.}
185151`\spad{coerce(e)} takes an object from \spadtype{FortranCode} and \indented{1}{uses it as the body of an ASP.}
185212`\spad{coerce(e)} takes an object from \spadtype{FortranCode} and \indented{1}{uses it as the body of an ASP.}
185281`\spad{coerce(fc)} \undocumented{}
185370`\spad{coerce(f)} takes an object from the appropriate instantiation of \spadtype{FortranExpression} and turns it into an ASP.
185468`\spad{coerce(f)} takes an object from the appropriate instantiation of \spadtype{FortranExpression} and turns it into an ASP.
185562`\spad{coerce(f)} takes an object from the appropriate instantiation of \spadtype{FortranExpression} and turns it into an ASP.
185656`\spad{coerce(f)} takes an object from the appropriate instantiation of \spadtype{FortranExpression} and turns it into an ASP.
185751`\spad{coerce(f)} takes an object from the appropriate instantiation of \spadtype{FortranExpression} and turns it into an ASP.
185847`\spad{coerce(t)} creates an element from a scalar type
185904`\spad{coerce(c)} converts sin/cos terms into Fourier Series
185970`\spad{coerce(f)} takes a fraction with numerator and denominator in factored form and creates a partial fraction. It is necessary for the parts to be factored because it is not known in general how to factor elements of \spad{R} and this is needed to decompose into partial fractions.
186038`\spad{coerce(rf)} converts \spad{rf},{} a fraction of polynomial \spad{p} with algebraic number coefficients to \spadtype{Expression Integer}.
186144`\spad{coerce(f)} returns \spad{f} as an element of \%.
186243`\spad{coerce(q)} returns \spad{q} as an element of \%.
186320`\spad{coerce(n)} coerces the integer \spad{n} to an element of the ring.
186374`\spad{coerce(i)} returns the element corresponding to \spad{i}
186420`\spad{coerce(polyList)} converts the list of polynomials \spad{polyList} to an ideal.
186498`\spad{coerce(e)} takes an object from \spadtype{List FortranCode} and \indented{1}{uses it as the body of an ASP.}
186567`\spad{coerce(e)} takes an object from \spadtype{List FortranCode} and \indented{1}{uses it as the body of an ASP.}
186634`\spad{coerce(e)} takes an object from \spadtype{List FortranCode} and \indented{1}{uses it as the body of an ASP.}
186709`\spad{coerce(e)} takes an object from \spadtype{List FortranCode} and \indented{1}{uses it as the body of an ASP.}
186776`\spad{coerce(e)} takes an object from \spadtype{List FortranCode} and \indented{1}{uses it as the body of an ASP.}
186851`\spad{coerce(lfc)} \undocumented{}
186946`\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.
187002`\spad{coerce(ls)} coerces a list of permutations {\em ls} to the group generated by this list.
187070`\spad{coerce([r_1,...,r_dim])} allows tensors to be constructed using lists.
187134`\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.
187184`ts::ImportAst constructs an ImportAst for the list if types `ts'.
187235`ts::JoinAst construct the AST for a join of the types `ts'.
187284`\spad{coerce([t_1,...,t_dim])} allows tensors to be constructed using lists.
187349`\spad{coerce(u)} transforms a MachineInteger into a MachineFloat
187404`\spad{coerce(f)} takes objects from the appropriate instantiation of \spadtype{FortranExpression} and turns them into an ASP.
187507`\spad{coerce(f)} takes objects from the appropriate instantiation of \spadtype{FortranExpression} and turns them into an ASP.
187613`\spad{coerce(f)} takes objects from the appropriate instantiation of \spadtype{FortranExpression} and turns them into an ASP.
187727`\spad{coerce(v)} produces an ASP which returns the value of \spad{v}.
187797`coerceS(\spad{o}) changes \spad{o} in the standard output format to MathML format.
187852`\spad{coerce(f)} returns \spad{f} as an Expression(\spad{R}).
187908`\spad{coerce(p)} converts the polynomial \spad{p} with algebraic number coefficients to \spadtype{Expression Integer}.
188004`\spad{coerce(s)} regroups terms of \spad{s} by total degree \indented{1}{and forms a series.}
188067`\spad{coerce(p)} returns \spad{p} as an element of \%.
188156`\spad{coerce(p)} moves from the representation type (PrimitiveArray PrimitiveArray PrimitiveArray \spad{R}) to the domain
188259`\spad{coerce(r)} returns \spad{r} viewed as a rational function over \spad{R}.
188329`\spad{coerce(r)} returns \spad{r} * 1 where 1 is the identity of the left algebra.
188373`\spad{coerce(r)} converts coefficients into Fourier Series
188421`\spad{coerce(x)} \undocumented{}
188648`\spad{coerce(x)} \undocumented{}
188828`\spad{coerce(x)} \undocumented{}
188949`\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.
189056`\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.
189161`\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.
189274`\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.
189379`\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.
189492`\spad{coerce(r)} \undocumented{}
189625`\spad{coerce(x)} \undocumented{}
189941`\spad{coerce(x)} \undocumented{}
190126`\spad{coerce(x)} \undocumented{}
190365`\spad{coerce(s)} creates an object of \spadtype{Any} from the object \spad{s} of type \spad{S}.
190412`\spad{coerce(x)} changes \spad{x} into an object of type \spadtype{None}.
190461`\spad{coerce(s)} provides a direct coercion from a domain \spad{S} to TeX format. This allows the user to skip the step of first manually coercing the object to standard output format before it is coerced to TeX format.
190511`\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.
190570`\spad{coerce(s)} transforms `s' into an element of `\%'.
190616`\spad{coerce(s)} returns \spad{s},{} viewed as the zero-th order derivative of \spad{s}.
190677`\spad{coerce(x)} allows \spadtype{Segment} values to be used as \%.
190735`\spad{coerce(x = a..b)} returns \spad{x = c..d} where \spad{c} and \spad{d} are the numerical values of \spad{a} and \spad{b}.
190830`sig::MappingAst builds a MappingAst from the Signature `sig'.
190878`\spad{coerce(p)} returns \spad{p} viewed as an algebraic number.
190970`\spad{coerce(p)} returns \spad{p} as an element of \%.
191068`\spad{coerce(m)} views a matrix as a rank 2 tensor.
191144`\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"
191196`\spad{coerce(s)} converts \axiom{\spad{s}} into an \axiom{IndexCard}. Warning: if \axiom{\spad{s}} is not of the right format then an error will occur when using it.
191240`\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
191292`\spad{coerce(u)} creates an OpenMath error object of an appropriate type if \axiom{\spad{u}} is one of \axiom{OMParseError},{} \axiom{OMReadError},{} \axiom{OMUnknownCD} or \axiom{OMUnknownSymbol},{} otherwise it raises a runtime error.
191344`\spad{coerce(s)} \undocumented{}
191385`\spad{coerce(s)} converts a variable to a Taylor series
191438`\spad{coerce(x)} \undocumented{}
191765`\spad{coerce(x)} \undocumented{}
192072`\spad{coerce(f)} converts a Puiseux series to a general power series.
192180`\axiom{coerce(\spad{x})} returns \axiom{\spad{x}} as a Lie polynomial.
192239`\spad{coerce(var)} converts the series variable \spad{var} into a Puiseux series.
192323`\spad{coerce(f)} takes objects from the appropriate instantiation of \spadtype{FortranExpression} and turns them into an ASP.
192458`\spad{coerce(f)} takes objects from the appropriate instantiation of \spadtype{FortranExpression} and turns them into an ASP.
192573`\spad{coerce(f)} takes objects from the appropriate instantiation of \spadtype{FortranExpression} and turns them into an ASP.
192680`\spad{coerce(f)} takes objects from the appropriate instantiation of \spadtype{FortranExpression} and turns them into an ASP.
192786`\spad{coerce(f)} takes objects from the appropriate instantiation of \spadtype{FortranExpression} and turns them into an ASP.
192889`\spad{coerce(f)} takes objects from the appropriate instantiation of \spadtype{FortranExpression} and turns them into an ASP.
193022`\spad{coerce(f)} takes objects from the appropriate instantiation of \spadtype{FortranExpression} and turns them into an ASP.
193128`\spad{coerce(f)} takes objects from the appropriate instantiation of \spadtype{FortranExpression} and turns them into an ASP.
193231`\spad{coerce(f)} takes objects from the appropriate instantiation of \spadtype{FortranExpression} and turns them into an ASP.
193334`\spad{coerce(f)} takes objects from the appropriate instantiation of \spadtype{FortranExpression} and turns them into an ASP.
193438`\spad{coerce(f)} takes objects from the appropriate instantiation of \spadtype{FortranExpression} and turns them into an ASP.
193542`\spad{coerce(v)} produces an ASP which returns the value of \spad{v}.
193612`\spad{coerce(v)} converts a vector to a member of the algebra by forming a linear combination with the basis element. Note: the vector is assumed to have length equal to the dimension of the algebra.
193697`\spad{coerce(u)} transforms \spad{u} into a COmplex Float
193754`\spad{coerce(s)} extracts a float value from the syntax `s'.
193800`\spad{coerce(x)} \undocumented{}
193894`\spad{coerce(u)} transforms a MachineFloat to a standard Float
193940`\spad{coerce(p)} sums up the components of the partial fraction and returns a single fraction.
193998`\spad{coerce(s)} extracts an identifier from the syntax `s'.
194043`\spad{coerce(s)} extracts and integer value from the syntax `s'
194085`\spad{coerce(gp)} returns the generators of the group {\em gp}.
194153`\spad{coerce(s)} returns the \spadtype{ThreeSpace} \spad{s} to Output format.
194213`\spad{coerce(t)} converts a tableau \spad{t} to an output form.
194262`\spad{coerce(x)} moves from the domain to the representation type
194365`\spad{coerce(x)} returns the \spad{s}-expression associated with \spad{x}
194422`\spad{coerce(a)} transforms a into an element of \spad{S}.
194466`\spad{coerce(s)} extracts a string value from the syntax `s'.
194507`\spad{coerce(x)} returns the symbol associated with \spad{x}
194559`\spad{coerce(x)} returns a table view of \spad{x}
194624`\axiom{coerce(\spad{x})} returns \axiom{\spad{x}} as distributed polynomial.
194709`\axiom{coerce(\spad{x})} returns \axiom{\spad{x}} as a recursive polynomial.
194792`\spad{coerce(v)} returns \spad{v}.
194841`\spad{coleman(alpha,beta,pi)}: there is a bijection from the set of matrices having nonnegative entries and row sums {\em alpha},{} column sums {\em beta} to the set of {\em Salpha - Sbeta} double cosets of the symmetric group {\em Sn}. ({\em Salpha} is the Young subgroup corresponding to the improper partition {\em alpha}). For a representing element {\em pi} of such a double coset,{}
194841`-- coleman(\spad{alpha},{}\spad{beta},{}\spad{pi}) generates the Coleman-matrix corresponding to {\em alpha, beta, pi}. Note: The permutation {\em pi} of {\em {1,2,...,n}} has to be given in list form. Note: the inverse of this map is {\em inverseColeman} (if {\em pi} is the lexicographical smallest permutation in the coset). For details see James/Kerber.
195028`\axiom{collectQuasiMonic(ts)} returns the subset of \axiom{ts} consisting of the polynomials with initial in \axiom{\spad{R}}.
195240`\axiom{collectUnder(ps,{}\spad{v})} returns the set consisting of the polynomials of \axiom{ps} with main variable less than \axiom{\spad{v}}.
195459`\axiom{collectUpper(ps,{}\spad{v})} returns the set consisting of the polynomials of \axiom{ps} with main variable greater than \axiom{\spad{v}}.
195608`\axiom{collect(ps,{}\spad{v})} returns the set consisting of the polynomials of \axiom{ps} with \axiom{\spad{v}} as main variable.
195682`\spad{colorDef(v,c1,c2)} sets the range of colors along the colormap so that the lower end of the colormap is defined by \spad{c1} and the top end of the colormap is defined by \spad{c2},{} for the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport}.
195753`\spad{colorFunction(f(z))} specifies the color based upon the \spad{z}-component of three dimensional plots. This option is expressed in the form \spad{colorFunction == f(z)}.
195825`\spad{colorFunction(f(u,v))} specifies the color for three dimensional plots as a function based upon the two parametric variables. This option is expressed in the form \spad{colorFunction == f(u,v)}.
195909`\spad{colorFunction(f(x,y,z))} specifies the color for three dimensional plots as a function of \spad{x},{} \spad{y},{} and \spad{z} coordinates. This option is expressed in the form \spad{colorFunction == f(x,y,z)}.
196005`\spad{color(pt)} returns the fourth element of the point,{} \spad{pt},{} although no assumptions are made with regards as to how the components of higher dimensional points are interpreted. This function is defined for the convenience of the user using specifically,{} color to express a fourth dimension.
196055`\spad{color(i)} returns a color of the indicated hue \spad{i}.
196170`\spad{column(m,j)} returns the \spad{j}th column of the matrix \spad{m}. Error: if the index outside the proper range.
196250`\spad{column(m,j)} returns the \spad{j}th column of \spad{m} error check to determine if index is in proper ranges
196328`\spad{combineFeatureCompatibility(C1,C2)} is for interacting attributes
196408`\spad{combineFeatureCompatibility(C1,L)} is for interacting attributes
196494`\spad{commaSeparate(l)} creates the form separating the elements of \spad{l} by commas.
196548`\spad{commaSeparate(l)} produces a comma separated string from a list of strings.
196616`\spad{comment(s)} creates a representation of the Strings \spad{s} as a multi-line FORTRAN comment.
196669`\spad{comment(s)} creates a representation of the String \spad{s} as a single FORTRAN comment.
196716`\spad{commonDenominator([q1,...,qn])} returns a common denominator \spad{d} for \spad{q1},{}...,{}qn.
196787`\spad{commonDenominator([q1,...,qn])} returns a common denominator \spad{d} for \spad{q1},{}...,{}qn.
196851`\spad{commonDenominator(q)} returns a common denominator \spad{d} for the elements of \spad{q}.
196927`\spad{commonDenominator(q)} returns a common denominator \spad{d} for the coefficients of \spad{q}.
197013`\spad{common(name,contents)} creates a representation a named common block.
197072`\spad{commutative?()} tests if multiplication in the algebra is commutative.
197149`\spad{commutative?()} tests if multiplication in the algebra is commutative.
197223`\spad{commutativeEquality(x,y)} returns \spad{true} if \spad{x} and \spad{y} are equal assuming commutativity
197386`\spad{commutator(p,q)} computes \spad{inv(p) * inv(q) * p * q}.
197429`\spad{commutator(a,b)} returns \spad{a*b-b*a}.
197484`\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.
197560`\spad{comp(f,g,x)} is \spad{f(g x)}.
197636`\spad{compactFraction(p)} normalizes the partial fraction \spad{p} to the compact representation. In this form,{} the partial fraction has only one fractional term per prime in the denominator.
197694`\spad{companionBlocks(m, v)} returns \spad{[[C_1, g_1],...,[C_k, g_k]]} such that each \spad{C_i} is a companion block and \spad{m = diagonal(C_1,...,C_k)}.
197811`\spad{comparison(op, foo?)} attaches foo? as the "\%less?" property to \spad{op}. If \spad{op1} and \spad{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}.
197876`\spad{compdegd should} be local
198011`\spad{compile(f, [t1,...,tn])} forces the interpreter to compile the function \spad{f} with signature \spad{(t1,...,tn) -> ?}. returns the symbol \spad{f} if successful. Error: if \spad{f} was not defined beforehand in the interpreter,{} or if the \spad{ti}'s are not valid types,{} or if the compiler fails.
198069`\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}.
198152`\spad{compiledFunction(expr,x,y)} returns a function \spad{f: (D1, D2) -> I} defined by \spad{f(x, y) == expr}. Function \spad{f} is compiled and directly applicable to objects of type \spad{(D1, D2)}
198303`\spad{complement(u)} returns the complement of the set \spad{u},{} \spadignore{i.e.} the set of all values not in \spad{u}.
198459`\spad{complementaryBasis(b1,...,bn)} returns the complementary basis \spad{(b1',...,bn')} of \spad{(b1,...,bn)}.
198550`\spad{completeEchelonBasis(lv)} completes the basis {\em lv} assumed to be in echelon form of a subspace of {\em R**n} (\spad{n} the length of all the vectors in {\em lv}) with unit vectors to a basis of {\em R**n}. It is assumed that the argument is not an empty vector and that it is not the basis of the 0-subspace. Note: the rows of the result correspond to the vectors of the basis.
198642`\spad{completeEval(upoly, lvar, lval)} evaluates the polynomial \spad{upoly} with each variable in \spad{lvar} replaced by the corresponding value in lval. Substitutions are done for all variables in \spad{upoly} producing a univariate polynomial over \spad{R}.
198778`\spad{completeHensel(pol,lfact,prime,bound)} lifts \spad{lfact},{} the factorization mod \spad{prime} of \spad{pol},{} to the factorization mod prime**k>bound. Factors are recombined on the way.
198878`\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}
198968`\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}
199122`\spad{complete n} is the \spad{n} th complete homogeneous \indented{1}{symmetric function expressed in terms of power sums.} \indented{1}{Alternatively it is the cycle index of the symmetric} \indented{1}{group of degree \spad{n}.}
199219`\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.
199274`\spad{complete(x)} forces the computation of all digits.
199330`\spad{complete(f)} causes all terms of \spad{f} to be computed. Note: this results in an infinite loop if \spad{f} has infinitely many terms.
199398`\spad{complete(x)} causes all entries in \spadvar{\spad{x}} to be computed. Normally entries are only computed as needed. If \spadvar{\spad{x}} is an infinite continued fraction,{} a user-initiated interrupt is necessary to stop the computation.
199451`\spad{complex?(t)} tests whether \spad{t} is equivalent to the FORTRAN type COMPLEX.
199506`\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).
199632`\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 
199632`--of \spad{eps} (float or rational).
199825`\spad{complexElementary(f)} rewrites \spad{f} in terms of the 2 fundamental complex transcendental elementary functions: \spad{log, exp}.
199903`\spad{complexElementary(f)} rewrites \spad{f} in terms of the 2 fundamental complex transcendental elementary functions: \spad{log, exp}.
199974`\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}.
200059`\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}.
200137`\spad{complexExpand(i)} returns the expanded complex function corresponding to \spad{i}.
200224`\spad{complexExpand(i)} returns the expanded complex function corresponding to \spad{i}.
200345`\spad{complexForm(f)} returns \spad{[real f, imag f]}.
200438`\spad{complexForm(f)} returns \spad{[real f, imag f]}.
200512`\spad{complexIntegrate(f, x)} returns the integral of \spad{f(x)dx} where \spad{x} is viewed as a complex variable.
200594`\spad{complexIntegrate(f, x)} returns the integral of \spad{f(x)dx} where \spad{x} is viewed as a complex variable.
200731`\spad{complexLimit(f(x),x = a)} computes the complex limit \spad{lim(x -> a,f(x))}.
200866`\spad{complexLimit(f(x),x = a)} computes the complex limit of \spad{f} as its argument \spad{x} approaches \spad{a}.
201030`\spad{complexLimit(f(x),x = a)} computes the complex limit of \spad{f} as its argument \spad{x} approaches \spad{a}.
201204`\spad{complexNormalize(f)} rewrites \spad{f} using the least possible number of complex independent kernels.
201281`\spad{complexNormalize(f)} rewrites \spad{f} using the least possible number of complex independent kernels.
201351`\spad{complexNormalize(f, x)} rewrites \spad{f} using the least possible number of complex independent kernels involving \spad{x}.
201435`\spad{complexNormalize(f, x)} rewrites \spad{f} using the least possible number of complex independent kernels involving \spad{x}.
201512`\spad{complexNumericIfCan(x)} returns a complex approximation of \spad{x},{} or "failed" if \axiom{\spad{x}} is not a constant.
201658`\spad{complexNumericIfCan(x)} returns a complex approximation of \spad{x},{} or "failed" if \axiom{\spad{x}} is not a constant.
201795`\spad{complexNumericIfCan(x)} returns a complex approximation of \spad{x},{} or "failed" if \axiom{\spad{x}} is not a constant.
201928`\spad{complexNumericIfCan(x)} returns a complex approximation of \spad{x},{} or "failed" if \axiom{\spad{x}} is not a constant.
202052`\spad{complexNumericIfCan(x)} returns a complex approximation of \spad{x},{} or "failed" if \axiom{\spad{x}} is not constant.
202176`\spad{complexNumericIfCan(x)} returns a complex approximation of \spad{x},{} or "failed" if \axiom{\spad{x}} is not a constant.
202280`\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.
202442`\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.
202595`\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.
202744`\spad{complexNumericIfCan(x, n)} returns a complex approximation of \spad{x},{} or "failed" if \axiom{\spad{x}} is not a constant.
202884`\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.
203024`\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.
203144`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
203235`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
203360`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
203476`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
203588`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
203691`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
203794`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
203877`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
203937`\spad{complexNumeric(x, n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places.
204044`\spad{complexNumeric(x, n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places.
204185`\spad{complexNumeric(x, n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places.
204317`\spad{complexNumeric(x, n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places.
204445`\spad{complexNumeric(x, n)} returns a complex approximation of \spad{x}
204564`\spad{complexNumeric(x, n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places.
204683`\spad{complexNumeric(x, n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places.
204782`\spad{complexNumeric(x, n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places.
204858`\spad{complexRoots(rf, eps)} finds all the complex solutions of a univariate rational function with rational number coefficients. The solutions are computed to precision eps.
204978`\spad{complexRoots(lrf, lv, eps)} finds all the complex solutions of a list of rational functions with rational number coefficients with respect the the variables appearing in \spad{lv}. Each solution is computed to precision eps and returned as list corresponding to the order of variables in \spad{lv}.
205123`\spad{complexSolve(eq,eps)} finds all the complex solutions of the equation \spad{eq} of rational functions with rational rational coefficients with respect to all the variables appearing in \spad{eq},{} with precision \spad{eps}.
205275`\spad{complexSolve(p,eps)} find all the complex solutions of the rational function \spad{p} with complex rational coefficients with respect to all the variables appearing in \spad{p},{} with precision \spad{eps}.
205417`\spad{complexSolve(leq,eps)} finds all the complex solutions to precision \spad{eps} of the system \spad{leq} of equations of rational functions over complex rationals with respect to all the variables appearing in lp.
205581`\spad{complexSolve(lp,eps)} finds all the complex solutions to precision \spad{eps} of the system \spad{lp} of rational functions over the complex rationals with respect to all the variables appearing in \spad{lp}.
205735`\spad{complexZeros(p)} tries to determine all complex zeros of the polynomial \spad{p} with accuracy given by the package constant {\em globalEps} which you may change by {\em setErrorBound}.
205817`\spad{complexZeros(p, eps)} tries to determine all complex zeros of the polynomial \spad{p} with accuracy given by {\em eps}.
205901`\spad{complexZeros(poly, eps)} finds the complex zeros of the univariate polynomial \spad{poly} to precision eps with solutions returned as complex floats or rationals depending on the type of eps.
205984`\spad{complex(x,y)} constructs \spad{x} + \%i*y.
206035`componentUpperBound is an upper bound for all component values.
206092`\spad{component(gi,pt)} modifies the graph \spad{gi} of the domain \spadtype{GraphImage} to contain one point component,{} \spad{pt} whose point color,{} line color and point size are determined by the default functions \spadfun{pointColorDefault},{} \spadfun{lineColorDefault},{} and \spadfun{pointSizeDefault}.
206157`\spad{component(gi,lp,pal1,pal2,p)} sets the components of the graph,{} \spad{gi} of the domain \spadtype{GraphImage},{} to the values given. The point list for \spad{gi} is set to the list \spad{lp},{} the color of the points in \spad{lp} is set to the palette color \spad{pal1},{} the color of the lines which connect the points \spad{lp} is set to the palette color \spad{pal2},{} and the size of the 
206157`--points in \spad{lp} is given by the integer \spad{p}.
206260`\spad{component(gi,pt,pal1,pal2,ps)} modifies the graph \spad{gi} of the domain \spadtype{GraphImage} to contain one point component,{} \spad{pt} whose point color is set to the palette color \spad{pal1},{} line color is set to the palette color \spad{pal2},{} and point size is set to the positive integer \spad{ps}.
206357`\spad{components(s)} takes the \spadtype{ThreeSpace} \spad{s},{} and creates a list containing a unique \spadtype{ThreeSpace} for each single component of \spad{s}. If \spad{s} has no components defined,{} the list returned is empty.
206419`\spad{compose(a,b)} composes the power series \spad{a} with the power series \spad{b}.
206506`\spad{compose(p,q)} \undocumented
206568`\spad{composite([s1,s2,...,sn])} will create a new \spadtype{ThreeSpace} that is a union of all the components from each \spadtype{ThreeSpace} in the parameter list,{} grouped as a composite.
206807`\spad{composite(f, q)} returns \spad{h} if \spad{f} = \spad{h}(\spad{q}),{} and "failed" is no such \spad{h} exists.
206932`\spad{composite(p, q)} returns \spad{h} if \spad{p = h(q)},{} and "failed" no such \spad{h} exists.
207037`\spad{composites(s)} takes the \spadtype{ThreeSpace} \spad{s},{} and creates a list containing a unique \spadtype{ThreeSpace} for each single composite of \spad{s}. If \spad{s} has no composites defined (composites need to be explicitly created),{} the list returned is empty. Note that not all the components need to be part of a composite.
207099`\spad{compound? x} is \spad{true} when `x' is not an atomic syntax.
207144`\spad{computeBasis }\undocumented
207313`\spad{computeCycleEntry(x,cycElt)},{} where \spad{cycElt} is a pointer to a node in the cyclic part of the cyclic stream \spad{x},{} returns a pointer to the first node in the cycle
207381`\spad{computeCycleLength(s)} returns the length of the cycle of a cyclic stream \spad{t},{} where \spad{s} is a pointer to a node in the cyclic part of \spad{t}.
207463`\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 v
207463`--alues. Otherwise,{} limits must be computed.
207620`\spad{computePowers()} \undocumented
207899`\spad{concat!(u,x)} destructively adds element \spad{x} to the end of \spad{u}.
207961`\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}])}.
208056`\spad{concat!(u,v)} destructively concatenates doubly-linked aggregate \spad{v} to the end of doubly-linked aggregate \spad{u}.
208150`\spad{concat!(u,v)} destructively appends \spad{v} to the end of \spad{u}. \spad{v} is unchanged
208213`\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})}.
208536`\spad{concat(l)} concatenates a list of aggregates of type \axiomType{Result}
208605`\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}))}.
208660`\spad{concat(u)} returns the left-to-right concatentation of the streams in \spad{u}. Note: \spad{concat(u) = reduce(concat,u)}.
209475`\spad{concat(a,b)} adds two aggregates of type \axiomType{Result}.
209545`\spad{concat(x,u)} returns aggregate \spad{u} with additional element at the front. Note: for lists: \axiom{concat(\spad{x},{}\spad{u}) == concat([\spad{x}],{}\spad{u})}.
209596`\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}}.
209655`\spad{concat(u,x)} returns aggregate \spad{u} with additional element \spad{x} at the end. Note: for lists,{} \axiom{concat(\spad{u},{}\spad{x}) == concat(\spad{u},{}[\spad{x}])}
209706`\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}}.
209758`\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)}.
209818`\spad{concat(x,y)} merges two tables \spad{x} and \spad{y}
209865`\spad{cond(s,e)} creates a representation of the FORTRAN expression IF (\spad{s}) THEN \spad{e}.
209912`\spad{cond(s,e,f)} creates a representation of the FORTRAN expression IF (\spad{s}) THEN \spad{e} ELSE \spad{f}.
210138`\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.
210224`\spad{conditionP(m)} returns a vector of elements,{} not all zero,{} whose \spad{p}\spad{-}th powers (\spad{p} is the characteristic of the domain) are a solution of the homogenous linear system represented by \spad{m},{} or "failed" is there is no such vector.
210351`\axiom{condition(\spad{n})} returns the condition of the node \spad{n}.
210402`\spad{condition(e)} returns the condition of the if-expression `e'.
210446`\spad{condition(i)} returns the condition of the while iterator `i'.
210493`\spad{conditionsForIdempotents()} determines a complete list of polynomial equations for the coefficients of idempotents with respect to the fixed \spad{R}-module basis
210620`\spad{conditionsForIdempotents()} determines a complete list of polynomial equations for the coefficients of idempotents with respect to the fixed \spad{R}-module basis.
210717`\spad{conditionsForIdempotents()} determines a complete list of polynomial equations for the coefficients of idempotents with respect to the fixed \spad{R}-module basis.
210912`\spad{conditionsForIdempotents([v1,...,vn])} determines a complete list of polynomial equations for the coefficients of idempotents with respect to the \spad{R}-module basis \spad{v1},{}...,{}\spad{vn}
211049`\spad{conditionsForIdempotents([v1,...,vn])} determines a complete list of polynomial equations for the coefficients of idempotents with respect to the \spad{R}-module basis \spad{v1},{}...,{}\spad{vn}.
211157`\axiom{conditions(a)} returns the list of the conditions of the leaves of a
211215`\spad{conical(a,b)} transforms from conical coordinates to Cartesian coordinates: \spad{conical(a,b)} is a function which will map the point \spad{(lambda,mu,nu)} to \spad{x = lambda*mu*nu/(a*b)},{} \spad{y = lambda/a*sqrt((mu**2-a**2)*(nu**2-a**2)/(a**2-b**2))},{} \spad{z = lambda/b*sqrt((mu**2-b**2)*(nu**2-b**2)/(b**2-a**2))}.
211343`\spad{conjug(x)}should be local but conditional
211561`\spad{conjugate(pt)} is the conjugate of the partition \spad{pt}.
211658`\spad{conjugate(x + \%i y)} returns \spad{x} - \%\spad{i} \spad{y}.
211710`\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}.
211763`\spad{conjugate(q)} negates the imaginary parts of quaternion \spad{q}.
211818`\spad{conjugate(p)} returns the conjugate partition of a partition \spad{p}
211899`\spad{conjugate(p,q)} computes \spad{inv(q) * p * q}; this is 'right action by conjugation'.
211941`\spad{conjugates(lp)} is the stream of conjugates of a stream \indented{1}{of partitions \spad{lp}.}
212055`\spad{conjunction(p,q)} returns a formula denoting the conjunction of \spad{p} and \spad{q}.
212260`\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".
212339`\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.
212377`\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)}.
212417`\spad{consnewpol should} be local
212625`\spad{constDsolve(op, g, x)} returns \spad{[f, [y1,...,ym]]} where \spad{f} is a particular solution of the equation \spad{op y = g},{} and the \spad{yi}'s form a basis for the solutions of \spad{op y = 0}.
212720`\spad{const c} is a function which produces \spad{c} when \indented{1}{applied to its argument.}
212773`\spad{constant?(p)} tests if \spad{p} contains no matching variables.
212822`\spad{constant?(p)} tests whether the polynomial \spad{p} belongs to the coefficient ring.
212881`\spad{constant?(x)} returns \spad{true} if \spad{x} is constant.
212938`\spad{constant?(e)} returns \spad{true} if `e' is a constant.
212997`\spad{constantCoefficientRicDE(op, ric)} returns \spad{[[a1, L1], [a2, L2], ... , [ak, Lk]]} such that any rational solution with no polynomial part of the associated Riccati equation of \spad{op y = 0} must be one of the \spad{ai}'s in which case the equation for \spad{z = y e^{-int ai}} is \spad{Li z = 0}. \spad{ric} is a Riccati equation solver over \spad{F},{} whose input is the asso
212997`--ciated linear equation.
213114`\spad{constantIfCan(k)} \undocumented
213195`\spad{constantKernel(r)} \undocumented
213261`\spad{constantLeft(f)} is the function \spad{g} \indented{1}{such that \spad{g (a,b)= f b}.}
213330`\spad{constantOpIfCan(op)} returns \spad{a} if \spad{op} is the constant nullary operator always returning \spad{a},{} "failed" otherwise.
213422`\spad{constantOperator(a)} returns a nullary operator op such that \spad{op()} always evaluate to \spad{a}.
213499`\spad{constantRight(f)} is the function \spad{g} \indented{1}{such that \spad{g (a,b)= f a}.}
213569`\spad{constantToUnaryFunction(s)} is a local function which takes the value of \spad{s},{} which may be a function of a constant,{} and returns a function which always returns the value \spadtype{DoubleFloat} \spad{s}.
213668`\spad{constant(p)} return the constant term of \spad{p}.
213720`\spad{vu(f)} is the function \spad{g} \indented{1}{such that \spad{g a= f ()}.}
213780`\spad{constant(x)} tells the pattern matcher that \spad{x} should match only the symbol 'x and no other quantity. Error: if \spad{x} is not a symbol.
213839`\spad{constant(x)} tells the pattern matcher that \spad{x} should match only the symbol 'x and no other quantity.
213915`\spad{constant(x)} returns the constant term of \spad{x}.
214031`\spad{construct([v1,e1],...,[vn,en])} returns the match result containing the matches (\spad{v1},{}\spad{e1}),{}...,{}(vn,{}en).
214118`\axiom{construct(lvt)} returns the same as \axiom{[construct(vt.val,{}vt.tower) for vt in lvt]}
214442`\axiom{construct(vt)} returns the same as \axiom{construct(vt.val,{}vt.tower)}
214513`\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})}.
214581`\spad{construct(lll)} creates a 3-\spad{D} matrix from a List List List \spad{R} \spad{lll}
214657`\spad{construct(l)} is the inverse of fracPart.
214781`\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.
214833`\spad{construct(t)} converts an infinite tuple to a stream.
214890`\spad{construct(i,e)} \undocumented
214949`\spad{construct(op,sig)} construct a signature-operator with operator name `op',{} and signature `sig'.
215018`\axiom{construct(\spad{x},{}\spad{y})} returns the Lie bracket \axiom{[\spad{x},{}\spad{y}]}.
215110`\axiom{construct(\spad{x},{}\spad{y})} returns the Lie bracket \axiom{[\spad{x},{}\spad{y}]}.
215186`\spad{construct(s,t)} makes a form s:t
215238`\axiom{construct(\spad{v},{}\spad{t})} returns the same as \axiom{construct(\spad{v},{}\spad{t},{}\spad{false})}
215291`\axiom{construct(\spad{v},{}lt)} returns the same as \axiom{[construct(\spad{v},{}\spad{t}) for \spad{t} in lt]}
215356`\axiom{construct(\spad{x},{}\spad{y})} returns the Lie bracket \axiom{[\spad{x},{}\spad{y}]}.
215432`\spad{construct(s,t)} is same as pair(\spad{s},{}\spad{t}),{} with syntactic sugar.
215476`\axiom{construct(\spad{x},{}\spad{y})} returns the Lie bracket of \axiom{\spad{x}} and \axiom{\spad{y}}.
215526`\axiom{construct(\spad{v},{}\spad{t},{}\spad{b})} returns the non-empty node with value \spad{v},{} condition \spad{t} and flag \spad{b}
215587`\axiom{construct(\spad{v},{}\spad{t},{}ls)} creates a splitting tree with value (\spadignore{i.e.} root vertex) given by \axiom{[\spad{v},{}\spad{t}]\$\spad{S}} and with children list given by \axiom{[[\spad{s}]\$\% for \spad{s} in ls]}.
215665`\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.
215727`\spad{construct(type,dims)} creates an element of FortranType
215844`\spad{construct(type,dims)} creates an element of FortranType
215948`\axiom{construct(\spad{v1},{}\spad{t},{}\spad{v2},{}lt)} creates a splitting tree with value (\spadignore{i.e.} root vertex) given by \axiom{[\spad{v},{}\spad{t}]\$\spad{S}} and with children list given by \axiom{[[[\spad{v},{}\spad{t}]\$\spad{S}]\$\% for \spad{s} in ls]}.
216011`\spad{constructor(t)} returns the name of the constructor used to make the call.
216064`\spad{constructor(c)} returns the category constructor used to instantiate the category object `c'.
216125`\spad{constructor(d)} returns the domain constructor that is instantiated to the domain object `d'.
216182`\spad{contains?(i,f)} returns \spad{true} if \axiom{\spad{f}} is contained within the interval \axiom{\spad{i}},{} \spad{false} otherwise.
216242`\spad{content([f1,..,fk])} = content of a list of univariate polynonials
216537`\spad{content(p)} gives the gcd of the coefficients of polynomial \spad{p}.
216612`\spad{content(l)} returns the gcd of all the coefficients of \spad{l}.
216840`\spad{content(p,v)} is the gcd of the coefficients of the polynomial \spad{p} when \spad{p} is viewed as a univariate polynomial with respect to the variable \spad{v}. Thus,{} for polynomial 7*x**2*y + 14*x*y**2,{} the gcd of the coefficients with respect to \spad{x} is 7*y.
216925`\spad{continue(l)} creates a representation of a FORTRAN CONTINUE labelled with \spad{l}
217162`\spad{continuedFraction(x)} converts the \spad{p}-adic rational number \spad{x} to a continued fraction.
217271`\spad{continuedFraction(f)} converts the floating point number \spad{f} to a reduced continued fraction.
217363`\spad{continuedFraction(r)} converts the fraction \spadvar{\spad{r}} with components of type \spad{R} to a continued fraction over \spad{R}.
217434`\spad{continuedFraction(b0,a,b)} constructs a continued fraction in the following way: if \spad{a = [a1,a2,...]} and \spad{b = [b1,b2,...]} then the result is the continued fraction \spad{b0 + a1/(b1 + a2/(b2 + ...))}.
217515`\spad{contours(s)} returns the list of contours in scope \spad{s}.
217564`\spad{contractSolve(eq,x)} finds the solutions expressed in terms of radicals of the equation of rational functions \spad{eq} with respect to the symbol \spad{x}. The result contains new symbols for common subexpressions in order to reduce the size of the output.
217719`\spad{contractSolve(rf,x)} finds the solutions expressed in terms of radicals of the equation \spad{rf} = 0 with respect to the symbol \spad{x},{} where \spad{rf} is a rational function. The result contains new symbols for common subexpressions in order to reduce the size of the output.
217864`\spad{contract(I,lvar)} contracts the ideal \spad{I} to the polynomial ring \spad{F[lvar]}.
218259`\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))}.}
218336`\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))}.}
218416`\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".
218484`\spad{controlPanel(v,s)} displays the control panel of the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport},{} if \spad{s} is "on",{} or hides the control panel if \spad{s} is "off".
218554`\spad{convergents(x)} returns the stream of the convergents of the continued fraction \spadvar{\spad{x}}. If the continued fraction is finite,{} then the stream will be finite.
218937`\spad{convert(cs)} converts the complex expression \spad{cs} to a pattern
219053`\axiom{convert(lp)} returns the polynomial set whose members are the polynomials of \axiom{lp}.
219124`\spad{convert([a1,...,an])} returns the pattern \spad{[a1,...,an]}.
221370`\spad{convert(s)} makes \spad{s} into an input form.
221778`\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}.
221857`\spad{convert(l)} is a function to convert a \axiomType{Segment OrderedCompletion Float} to a \axiomType{Segment OrderedCompletion DoubleFloat}
221993`\spad{convert(q)} converts \spad{q}.
222175`\spad{convert(q)} converts \spad{q}.
222335`\axiom{convert(\spad{p})} returns the same as \axiom{retract(\spad{p})}.
222495`\axiom{convert(\spad{p})} returns the same as \axiom{retract(\spad{p})}.
222645`\axiom{convert(\spad{p})} returns the same as \axiom{retract(\spad{p})}.
222824`\spad{convert(p)} converts \spad{p}.
222938`\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.
223251`\spad{convert(s)} transforms `s' into an element of `\%'.
223300`\spad{convert(s)} converts an \spad{s}-expression to Syntax. Note,{} when `s' is not an atom,{} it is expected that it designates a proper list,{} \spadignore{e.g.} a sequence of cons cells ending with nil.
223347`\spad{convert(u)} converts \spad{u}.
223493`\spad{convert(st)} returns the members of \spad{st}.	
223784`\spad{convert(up)} converts the univariate polynomial \spad{up} to an algebra element,{} reducing by the \spad{definingPolynomial()} if necessary.
223838`\spad{convert([a1,..,an])} returns \spad{a1*v1 + ... + an*vn},{} where \spad{v1},{} ...,{} vn are the elements of the fixed basis.
223896`\spad{convert([a1,...,an])} returns \spad{a1*v1 + ... + an*vn},{} where \spad{v1},{} ...,{} \spad{vn} are the elements of the fixed \spad{R}-module basis.
223965`\spad{convert(s)} returns the \spad{s}-expression representation of a syntax.
224012`\spad{convert(a)} transforms a into an element of \spad{S}.
224059`\spad{convert(a)} returns the coordinates of \spad{a} with respect to the fixed \spad{R}-module basis.
224117`\spad{convert(a)} returns the coordinates of \spad{a} with respect to the fixed \spad{R}-module basis.
224186`\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.
224243`\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.
224311`\spad{coord(p)} specifies a change of coordinates of point \spad{p}. This option is expressed in the form \spad{coord == p}.
224389`\spad{coord }\undocumented
224555`\spad{coord(l,p)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{coord}. If the option does not exist the value,{} \spad{p} is returned.
224698`\spad{coordinate(c,i)} returns a coordinate function for \spad{c} using 1-based indexing according to \spad{i}. This indicates what the function for the coordinate component \spad{i} of the plane curve is.
224806`\spad{coordinate(c,i)} returns a coordinate function of \spad{c} using 1-based indexing according to \spad{i}. This indicates what the function for the coordinate component,{} \spad{i},{} of the space curve is.
224914`\spad{coordinate(s,i)} returns a coordinate function of \spad{s} using 1-based indexing according to \spad{i}. This indicates what the function for the coordinate component,{} \spad{i},{} of the surface is.
225569`\spad{coordinates(p)} specifies a change of coordinate systems of point \spad{p}. This option is expressed in the form \spad{coordinates == p}.
225653`\spad{coordinates([v1,...,vm])} returns the coordinates of the \spad{vi}'s with to the fixed basis. The coordinates of \spad{vi} are contained in the \spad{i}th row of the matrix returned by this function.
225736`\spad{coordinates([v1,...,vm])} returns the coordinates of the \spad{vi}'s with to the fixed basis. The coordinates of \spad{vi} are contained in the \spad{i}th row of the matrix returned by this function.
225806`\spad{coordinates([a1,...,am])} returns a matrix whose \spad{i}-th row is formed by the coordinates of \spad{ai} with respect to the fixed \spad{R}-module basis.
225887`\spad{coordinates(a)} returns the coordinates of \spad{a} with respect to the fixed \spad{F}-vectorspace basis.
225962`\spad{coordinates x} returns the coordinates of the linear element with respect to the basis \spad{B}.
226023`\spad{coordinates x} returns the coordinates of the linear form with respect to the basis \spad{DualBasis B}.
226081`\spad{coordinates(a)} returns the coordinates of \spad{a} with respect to the fixed \spad{R}-module basis.
226143`\spad{coordinates(a)} returns the coordinates of \spad{a} with respect to the fixed \spad{R}-module basis.
227004`\spad{coordinates(a,[v1,...,vn])} returns the coordinates of \spad{a} with respect to the \spad{R}-module basis \spad{v1},{}...,{}\spad{vn}.
227099`\spad{coordinates([v1,...,vm], basis)} returns the coordinates of the \spad{vi}'s with to the basis \spad{basis}. The coordinates of \spad{vi} are contained in the \spad{i}th row of the matrix returned by this function.
227184`\spad{coordinates([a1,...,am],[v1,...,vn])} returns a matrix whose \spad{i}-th row is formed by the coordinates of \spad{ai} with respect to the \spad{R}-module basis \spad{v1},{}...,{}\spad{vn}.
227280`\spad{coordinates(a,basis)} returns the coordinates of \spad{a} with respect to the \spad{basis} \spad{basis}.
227357`\spad{coordinates(a,[v1,...,vn])} returns the coordinates of \spad{a} with respect to the \spad{R}-module basis \spad{v1},{}...,{}\spad{vn}.
227445`\spad{copies(i,s)} will take a string \spad{s} and create a new string composed of \spad{i} copies of \spad{s}.
227506`\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.
227722`\spad{copyInto!(u,v,i)} returns aggregate \spad{u} containing a copy of \spad{v} inserted at element \spad{i}.
228125`\spad{copy(p)} returns a recursive copy of \spad{p}.
228164`\axiom{copy(\spad{n})} returns a copy of \spad{n}.
228211`\spad{copy(x)} \undocumented
228265`\spad{copy(u)} returns a top-level (non-recursive) copy of \spad{u}. Note: for collections,{} \axiom{copy(\spad{u}) == [\spad{x} for \spad{x} in \spad{u}]}.
228303`\spad{copy(n)} gives a copy of \spad{n}.
228351`\spad{copy(s)} returns a new \spadtype{ThreeSpace} that is an exact copy of \spad{s}.
228401`\spad{copy(op)} returns a copy of \spad{op}.
228443`\spad{corrPoly(u,lv,lr,ln,lu,t,r)} \undocumented
228705`\spad{cos2sec(f)} converts every \spad{cos(u)} appearing in \spad{f} into \spad{1/sec(u)}.
228767`\spad{cosIfCan(z)} returns cos(\spad{z}) if possible,{} and "failed" otherwise.
228847`\spad{cosSinInfo(n)} returns the list of lists of values for \spad{n},{} in the form: \spad{[[cos(n - 1) a,sin(n - 1) a],...,[cos 2 a,sin 2 a],[cos a,sin a]]} where \spad{a = 2 pi/n}. Note: \spad{n} should be greater than 2.
228921`\spad{cos(x)} makes a cos kernel for use in Fourier series
228967`\spad{cos(x)} applies the cosine operator to \spad{x}
229118`\spad{cos(st)} computes cosine of a power series \spad{st}.
229201`\spad{cos(st)} computes cosine of a power series \spad{st}.
229298`\spad{cos(z)} returns the cosine of Laurent series \spad{z}.
229384`\spad{cos(z)} returns the cosine of a Puiseux series \spad{z}.
229479`\spad{cos(x)} returns the cosine of \spad{x}.
229536`\spad{cos(x)} represents the Fortran intrinsic function COS
229616`\spad{cosh2sech(f)} converts every \spad{cosh(u)} appearing in \spad{f} into \spad{1/sech(u)}.
229680`\spad{coshIfCan(z)} returns cosh(\spad{z}) if possible,{} and "failed" otherwise.
229761`\spad{cosh(x)} applies the hyperbolic cosine operator to \spad{x}
229967`\spad{cosh(st)} computes the hyperbolic cosine of a power series \spad{st}.
230051`\spad{cosh(st)} computes the hyperbolic cosine of a power series \spad{st}.
230149`\spad{cosh(z)} returns the hyperbolic cosine of Laurent series \spad{z}.
230236`\spad{cosh(z)} returns the hyperbolic cosine of a Puiseux series \spad{z}.
230332`\spad{cosh(x)} returns the hyperbolic cosine of \spad{x}.
230387`\spad{cosh(x)} represents the Fortran intrinsic function COSH
230468`\spad{cot2tan(f)} converts every \spad{cot(u)} appearing in \spad{f} into \spad{1/tan(u)}.
230530`\spad{cot2trig(f)} converts every \spad{cot(u)} appearing in \spad{f} into \spad{cos(u)/sin(u)}.
230593`\spad{cotIfCan(z)} returns cot(\spad{z}) if possible,{} and "failed" otherwise.
230673`\spad{cot(x)} applies the cotangent operator to \spad{x}
230836`\spad{cot(st)} computes cotangent of a power series \spad{st}.
230919`\spad{cot(st)} computes cotangent of a power series \spad{st}.
231016`\spad{cot(z)} returns the cotangent of Laurent series \spad{z}.
231102`\spad{cot(z)} returns the cotangent of a Puiseux series \spad{z}.
231197`\spad{cot(x)} returns the cotangent of \spad{x}.
231254`\spad{coth2tanh(f)} converts every \spad{coth(u)} appearing in \spad{f} into \spad{1/tanh(u)}.
231318`\spad{coth2trigh(f)} converts every \spad{coth(u)} appearing in \spad{f} into \spad{cosh(u)/sinh(u)}.
231383`\spad{cothIfCan(z)} returns coth(\spad{z}) if possible,{} and "failed" otherwise.
231464`\spad{coth(x)} applies the hyperbolic cotangent operator to \spad{x}
231627`\spad{coth(st)} computes the hyperbolic cotangent of a power series \spad{st}.
231711`\spad{coth(st)} computes the hyperbolic cotangent of a power series \spad{st}.
231809`\spad{coth(z)} returns the hyperbolic cotangent of Laurent series \spad{z}.
231896`\spad{coth(z)} returns the hyperbolic cotangent of a Puiseux series \spad{z}.
231992`\spad{coth(x)} returns the hyperbolic cotangent of \spad{x}.
232047`\spad{countRealRootsMultiple(p)} says how many real roots \spad{p} has,{} counted with multiplicity
232162`\spad{countRealRoots(p)} says how many real roots \spad{p} has
233372`\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)}.
233488`\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)}.
233617`\spad{countable?(\spad{a})} determines whether \spad{a} is a countable cardinal,{} \spadignore{i.e.} an integer or \spad{Aleph 0}.
233671`\spad{create3Space()} creates a \spadtype{ThreeSpace} object capable of holding point,{} curve,{} mesh components and any combination.
233727`\spad{create3Space(s)} creates a \spadtype{ThreeSpace} object containing objects pre-defined within some \spadtype{SubSpace} \spad{s}.
233796`\spad{createGenericMatrix(m)} creates a square matrix of dimension \spad{k} whose entry at the \spad{i}-th row and \spad{j}-th column is the indeterminate {\em x[i,j]} (double subscripted).
233900`\spad{createIrreduciblePoly(n)}\$FFPOLY(GF) generates a monic irreducible univariate polynomial of degree \spad{n} over the finite field {\em GF}.
234019`\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 {
234019`--\em GF}
234197`\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
234347`\spad{createMultiplicationMatrix(m)} forms the multiplication table {\em m} into a matrix over the ground field.
234478`\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}.
234699`\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.
234786`\spad{createNormalPoly(n)}\$FFPOLY(GF) generates a normal polynomial of degree \spad{n} over the finite field {\em GF}.
234900`\spad{createNormalPrimitivePoly(n)}\$FFPOLY(GF) generates a normal and primitive polynomial of degree \spad{n} over the field {\em GF}. Note: this function is equivalent to createPrimitiveNormalPoly(\spad{n})
235085`\spad{createPrimitiveElement()} computes a generator of the (cyclic) multiplicative group of the field.
235149`\spad{createPrimitiveNormalPoly(n)}\$FFPOLY(GF) generates a normal and primitive polynomial of degree \spad{n} over the field {\em GF}. polynomial of degree \spad{n} over the field {\em GF}.
235272`\spad{createPrimitivePoly(n)}\$FFPOLY(GF) generates a primitive polynomial of degree \spad{n} over the finite field {\em GF}.
235389`\spad{createRandomElement(aG,x)} creates a random element of the group algebra generated by {\em aG}.
235488`\spad{createThreeSpace()} creates a \spadtype{ThreeSpace(DoubleFloat)} object capable of holding point,{} curve,{} mesh components and any combination.
235566`\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 \spadty
235566`--pe{FFCGP},{} \spadtype{FFCGX}.
235730`\spad{credPol }\undocumented
235823`\spad{crest n} is used internally.
235938`\spad{critB }\undocumented
236040`\spad{critBonD }\undocumented
236264`\spad{critMTonD1 }\undocumented
236485`\spad{critM }\undocumented
236575`\spad{critMonD1 }\undocumented
236801`\spad{critT }\undocumented
236946`\spad{critpOrder }\undocumented
237163`\spad{cross(p,q)} computes the cross product of the two points \spad{p} and \spad{q} using only the first three coordinates,{} and keeping the color of the first point \spad{p}. The result is returned as a point.
237302`\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
237351`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.
237412`\axiom{crushedSet(lp)} returns \axiom{lq} such that \axiom{lp} and and \axiom{lq} generate the same ideal and no rough basic sets reduce (in the sense of Groebner bases) the other polynomials in \axiom{lq}.
237495`\spad{csc2sin(f)} converts every \spad{csc(u)} appearing in \spad{f} into \spad{1/sin(u)}.
237557`\spad{cscIfCan(z)} returns csc(\spad{z}) if possible,{} and "failed" otherwise.
237637`\spad{csc(x)} applies the cosecant operator to \spad{x}
237800`\spad{csc(st)} computes cosecant of a power series \spad{st}.
237883`\spad{csc(st)} computes cosecant of a power series \spad{st}.
237980`\spad{csc(z)} returns the cosecant of Laurent series \spad{z}.
238066`\spad{csc(z)} returns the cosecant of a Puiseux series \spad{z}.
238161`\spad{csc(x)} returns the cosecant of \spad{x}.
238218`\spad{csch2sinh(f)} converts every \spad{csch(u)} appearing in \spad{f} into \spad{1/sinh(u)}.
238282`\spad{cschIfCan(z)} returns csch(\spad{z}) if possible,{} and "failed" otherwise.
238363`\spad{csch(x)} applies the hyperbolic cosecant operator to \spad{x}
238526`\spad{csch(st)} computes the hyperbolic cosecant of a power series \spad{st}.
238610`\spad{csch(st)} computes the hyperbolic cosecant of a power series \spad{st}.
238708`\spad{csch(z)} returns the hyperbolic cosecant of Laurent series \spad{z}.
238795`\spad{csch(z)} returns the hyperbolic cosecant of a Puiseux series \spad{z}.
238891`\spad{csch(x)} returns the hyperbolic cosecant of \spad{x}.
238946`\spad{csubst(a,b)} is for internal use only
239062`\spad{cubic(u)} \undocumented
239128`\spad{cubic(f,g,h,i)} \undocumented
239199`\spad{cup(s1,s2)},{} introduced by Redfield,{} \indented{1}{is the scalar product of two cycle indices,{} in which the} \indented{1}{power sums are retained to produce a cycle index.}
239353`\spad{currentCategoryFrame()} returns the category frame currently in effect.
239401`the current normal environment in effect.
239445`\spad{currentScope()} returns the scope currently in effect
239485`\spad{currentSubProgram()} returns the name of the current subprogram being processed
239543`\spad{curryLeft(f,a)} is the function \spad{g} \indented{1}{such that \spad{g b = f(a,b)}.}
239611`\spad{curryRight(f,b)} is the function \spad{g} such that \indented{1}{\spad{g a = f(a,b)}.}
239680`\spad{cu(f,a)} is the function \spad{g} \indented{1}{such that \spad{g ()= f a}.}
239739`\spad{curve?(s)} queries whether the \spadtype{ThreeSpace},{} \spad{s},{} is a curve,{} \spadignore{i.e.} has one component,{} a list of list of points,{} and returns \spad{true} if it is,{} or \spad{false} otherwise.
239796`\spad{curveColorPalette(l,p)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{curveColorPalette}. If the option does not exist the value,{} \spad{p} is returned.
239885`\spad{curveColor(v)} specifies a color,{} \spad{v},{} for 2D graph curves. This option is expressed in the form \spad{curveColor == v}.
239933`\spad{curveColor(p)} specifies a color index for 2D graph curves from the spadcolors palette \spad{p}. This option is expressed in the form \spad{curveColor ==p}.
239983`\spad{curve([p0,p1,p2,...,pn])} creates a space curve defined by the list of points \spad{p0} through \spad{pn},{} and returns the \spadtype{ThreeSpace} whose component is the curve.
240046`\spad{curve(s)} checks to see if the \spadtype{ThreeSpace},{} \spad{s},{} is composed of a single curve defined by a list of points and if so,{} returns the curve,{} \spadignore{i.e.} list of points. An error is signaled otherwise.
240109`\spad{curve(c1,c2)} creates a plane curve from 2 component functions \spad{c1} and \spad{c2}.
240211`\spad{curve(s,[[p0],[p1],...,[pn]])} adds a space curve which is a list of points \spad{p0} through pn defined by lists of elements from the domain \spad{PointDomain(m,R)},{} where \spad{R} is the \spadtype{Ring} over which the point elements are defined and \spad{m} is the dimension of the points,{} to the \spadtype{ThreeSpace} \spad{s}.
240276`\spad{curve(s,[p0,p1,...,pn])} adds a space curve component defined by a list of points \spad{p0} through \spad{pn},{} to the \spadtype{ThreeSpace} \spad{s}.
240342`\spad{curve(c1,c2,c3)} creates a space curve from 3 component functions \spad{c1},{} \spad{c2},{} and \spad{c3}.
240462`\spad{cycleElt(s)} returns a pointer to a node in the cycle if the stream \spad{s} is cyclic and returns "failed" if \spad{s} is not cyclic
240644`\spad{cycleEntry(u)} returns the head of a top-level cycle contained in aggregate \spad{u},{} or \axiom{empty()} if none exists.
240851`\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.
240929`\spad{cyclePartition(p)} returns the cycle structure of a permutation \spad{p} including cycles of length 1 only if \spad{S} is finite.
240989`\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]}.
241112`\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}.
241317`\spad{cycleTail(u)} returns the last node in the cycle,{} or empty if none exists.
241377`\spad{cycle(ls)} coerces a cycle {\em ls},{} \spadignore{i.e.} a list with not repetitions to a permutation,{} which maps {\em ls.i} to {\em ls.i+1},{} indices modulo the length of the list. Error: if repetitions occur.
241434`\spad{cycles(lls)} coerces a list list of cycles {\em lls} to a permutation,{} each cycle being a list with not repetitions,{} is coerced to the permutation,{} which maps {\em ls.i} to {\em ls.i+1},{} indices modulo the length of the list,{} then these permutations are mutiplied. Error: if repetitions occur in one cycle.
241675`\spad{cyclic?(u)} tests if \spad{u} has a cycle.
241733`\spad{cyclic?(t)} tests if \spad{t} is a cyclic tree.
241777`\spad{cyclicCopy(l)} makes a copy of a (possibly) cyclic tree \spad{l}.
241819`\spad{cyclicEntries(t)} returns a list of top-level cycles in tree \spad{t}.
241870`\spad{cyclicEqual?(t1, t2)} tests of two cyclic trees have the same structure.
241922`\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.
242016`\spad{cyclicGroup(n)} constructs the cyclic group of order \spad{n} acting on the integers 1,{}...,{}\spad{n}.
242112`\spad{cyclicParents(t)} returns a list of cycles that are parents of \spad{t}.
242163`\spad{cyclicSubmodule(lm,v)} generates a basis as follows. It is assumed that the size \spad{n} of the vector equals the number of rows and columns of the matrices. Then the matrices generate a subalgebra,{} say \spad{A},{} of the algebra of all square matrices of dimension \spad{n}. {\em V R} is an \spad{A}-module in the natural way. cyclicSubmodule(\spad{lm},{}\spad{v}) generat
242163`--es the \spad{R}-Basis of {\em Av} as described in section 6 of \spad{R}. A. Parker's "The Meat-Axe". Note: in contrast to the description in "The Meat-Axe" and to {\em standardBasisOfCyclicSubmodule} the result is in echelon form.
242288`\spad{cyclic n} is the cycle index of the \indented{1}{cyclic group of degree \spad{n}.}
242383`\spad{cyclotomicDecomposition(n)} \undocumented{}
242502`\spad{cyclotomicFactorization(n)} \undocumented{}
242625`\spad{cyclotomic(n)} \undocumented{}
242725`\spad{cyclotomic(n)} returns the \spad{n}th cyclotomic polynomial \spad{phi[n](x)}. Note: \spad{phi[n](x)} is the factor of \spad{x**n - 1} whose roots are the primitive \spad{n}th roots of unity.
242829`\spad{cyclotomic(n,r)} \undocumented
242918`\spad{cylindrical(pt)} transforms \spad{pt} from polar coordinates to Cartesian coordinates: the function produced will map the point \spad{(r,theta,z)} to \spad{x = r * cos(theta)},{} \spad{y = r * sin(theta)},{} \spad{z}.
242986`\spad{d01ajf(a,b,epsabs,epsrel,lw,liw,ifail,f)} is a general-purpose integrator which calculates an approximation to the integral of a function \spad{f}(\spad{x}) over a finite interval [a,{}\spad{b}]: See \downlink{Manual Page}{manpageXXd01ajf}.
243141`\spad{d01akf(a,b,epsabs,epsrel,lw,liw,ifail,f)} is an adaptive integrator,{} especially suited to oscillating,{} non-singular integrands,{} which calculates an approximation to the integral of a function \spad{f}(\spad{x}) over a finite interval [a,{}\spad{b}]: See \downlink{Manual Page}{manpageXXd01akf}.
243296`\spad{d01alf(a,b,npts,points,epsabs,epsrel,lw,liw,ifail,f)} is a general purpose integrator which calculates an approximation to the integral of a function \spad{f}(\spad{x}) over a finite interval [a,{}\spad{b}]: See \downlink{Manual Page}{manpageXXd01alf}.
243480`\spad{d01amf(bound,inf,epsabs,epsrel,lw,liw,ifail,f)} calculates an approximation to the integral of a function \spad{f}(\spad{x}) over an infinite or semi-infinite interval [a,{}\spad{b}]: See \downlink{Manual Page}{manpageXXd01amf}.
243631`\spad{d01anf(a,b,omega,key,epsabs,epsrel,lw,liw,ifail,g)} calculates an approximation to the sine or the cosine transform of a function \spad{g} over [a,{}\spad{b}]: See \downlink{Manual Page}{manpageXXd01anf}.
243807`\spad{d01apf(a,b,alfa,beta,key,epsabs,epsrel,lw,liw,ifail,g)} is an adaptive integrator which calculates an approximation to the integral of a function \spad{g}(\spad{x})\spad{w}(\spad{x}) over a finite interval [a,{}\spad{b}]: See \downlink{Manual Page}{manpageXXd01apf}.
243995`\spad{d01aqf(a,b,c,epsabs,epsrel,lw,liw,ifail,g)} calculates an approximation to the Hilbert transform of a function \spad{g}(\spad{x}) over [a,{}\spad{b}]: See \downlink{Manual Page}{manpageXXd01aqf}.
244162`\spad{d01asf(a,omega,key,epsabs,limlst,lw,liw,ifail,g)} calculates an approximation to the sine or the cosine transform of a function \spad{g} over [a,{}infty): See \downlink{Manual Page}{manpageXXd01asf}.
244321`\spad{d01bbf(a,b,itype,n,gtype,ifail)} returns the weight appropriate to a Gaussian quadrature. The formulae provided are Gauss-Legendre,{} Gauss-Rational,{} Gauss- Laguerre and Gauss-Hermite. See \downlink{Manual Page}{manpageXXd01bbf}.
244430`\spad{d01fcf(ndim,a,b,maxpts,eps,lenwrk,minpts,ifail,functn)} attempts to evaluate a multi-dimensional integral (up to 15 dimensions),{} with constant and finite limits,{} to a specified relative accuracy,{} using an adaptive subdivision strategy. See \downlink{Manual Page}{manpageXXd01fcf}.
244610`\spad{d01gaf(x,y,n,ifail)} integrates a function which is specified numerically at four or more points,{} over the whole of its specified range,{} using third-order finite-difference formulae with error estimates,{} according to a method due to Gill and Miller. See \downlink{Manual Page}{manpageXXd01gaf}.
244719`\spad{d01gbf(ndim,a,b,maxcls,eps,lenwrk,mincls,wrkstr,ifail,functn)} returns an approximation to the integral of a function over a hyper-rectangular region,{} using a Monte Carlo method. An approximate relative error estimate is also returned. This routine is suitable for low accuracy work. See \downlink{
244719`--Manual Page}{manpageXXd01gbf}.
244920`\spad{d02bbf(xend,m,n,irelab,x,y,tol,ifail,fcn,output)} integrates a system of first-order ordinary differential equations over an interval with suitable initial conditions,{} using a Runge-Kutta-Merson method,{} and returns the solution at points specified by the user. See \down
244920`--link{Manual Page}{manpageXXd02bbf}.
245147`\spad{d02bhf(xend,n,irelab,hmax,x,y,tol,ifail,g,fcn)} integrates a system of first-order ordinary differential equations over an interval with suitable initial conditions,{} using a Runge-Kutta-Merson method,{} until a user-specified function of the solution is zero. See \downlink
245147`--{Manual Page}{manpageXXd02bhf}.
245373`\spad{d02cjf(xend,m,n,tol,relabs,x,y,ifail,g,fcn,output)} integrates a system of first-order ordinary differential equations over a range with suitable initial conditions,{} using a variable-order,{} variable-step Adams method until a user-specified f
245373`--unction,{} if supplied,{} of the solution is zero,{} and returns the solution at points specified by the user,{} if desired. See \downlink{Manual Page}{manpageXXd02cjf}.
245629`\spad{d02ejf(xend,m,n,relabs,iw,x,y,tol,ifail,g,fcn,pederv,output)} integrates a stiff system of first-order ordinary differential equations over an interval with suitable initial conditions,{} using a varia
245629`--ble-order,{} variable-step method implementing the Backward Differentiation Formulae (BDF),{} until a user-specified function,{} if supplied,{} of the solution is zero,{} and returns the solution at points specified by the user,{} if desired. See \downlink{Manual Page}{manpageXXd02ejf}.
245929`\spad{d02gaf(u,v,n,a,b,tol,mnp,lw,liw,x,np,ifail,fcn)} solves the two-point boundary-value problem with assigned boundary values for a system of ordinary differential equations,{} using a deferred correction technique and a Newton iteration. See \downlink{Man
245929`--ual Page}{manpageXXd02gaf}.
246177`\spad{d02gbf(a,b,n,tol,mnp,lw,liw,c,d,gam,x,np,ifail,fcnf,fcng)} solves a general linear two-point boundary value problem for a system of ordinary differential equations using a deferred correction techn
246177`--ique. See \downlink{Manual Page}{manpageXXd02gbf}.
246481`\spad{d02kef(xpoint,m,k,tol,maxfun,match,elam,delam,hmax,maxit,ifail,coeffn,bdyval)} finds a specified eigenvalue of a regular singular second- order Sturm-Liouville system on a finite or infinite range,{} using a Pruefer transformation an
246481`--d a shooting method. It also reports values of the eigenfunction and its derivatives. Provision is made for discontinuities in the coefficient functions or their derivatives. See \downlink{Manual Page}{manpageXXd02kef}. ASP domains \spad{Asp12} and \spad{Asp33} are used to supply default subroutines for the MONIT and REPORT arguments via their \axiomOp{outputAsFortran} operation.
246749`\spad{d02kef(xpoint,m,k,tol,maxfun,match,elam,delam,hmax,maxit,ifail,coeffn,bdyval,monit,report)} finds a specified eigenvalue of a regular singular second- order Sturm-Liouville system on a finite or infinite range,{} us
246749`--ing a Pruefer transformation and a shooting method. It also reports values of the eigenfunction and its derivatives. Provision is made for discontinuities in the coefficient functions or their derivatives. See \downlink{Manual Page}{manpageXXd02kef}. Files \spad{monit} and \spad{report} will be used to define the subroutines for the MONIT and REPORT arguments. See \downlink{Manual Page}{manpageXXd02gbf}.
247035`\spad{d02raf(n,mnp,numbeg,nummix,tol,init,iy,ijac,lwork,liwork,np,x,y,deleps,ifail,fcn,g)} solves the two-point boundary-value problem with general boundary conditions for a system of ordinar
247035`--y differential equations,{} using a deferred correction technique and Newton iteration. See \downlink{Manual Page}{manpageXXd02raf}.
247351`\spad{d03edf(ngx,ngy,lda,maxit,acc,iout,a,rhs,ub,ifail)} solves seven-diagonal systems of linear equations which arise from the discretization of an elliptic partial differential equation on a rectangular region. This routine uses a multigrid technique. See \downlink{Manual Page}{manpageXXd03edf}.
247542`\spad{d03eef(xmin,xmax,ymin,ymax,ngx,ngy,lda,scheme,ifail,pdef,bndy)} discretizes a second order elliptic partial differential equation (PDE) on a rectangular region. See \downlink{Manual Page}{manpageXXd03eef}.
247768`\spad{d03faf(xs,xf,l,lbdcnd,bdxs,bdxf,ys,yf,m,mbdcnd,bdys,bdyf,zs,zf,n,nbdcnd,bdzs,bdzf,lambda,ldimf,mdimf,lwrk,f,if
247768`--ail)} solves the Helmholtz equation in Cartesian co-ordinates in three dimensions using the standard seven-point finite difference approximation. This routine is designed to be particularly efficient on vector processors. See \downlink{Manual Page}{manpageXXd03faf}.
248159`\spad{dAndcExp(v,n,k)} computes \spad{v**e} interpreting \spad{v} as an element of normal basis field. A divide and conquer algorithm similar to the one from \spad{D}.\spad{R}.Stinson,{} "Some observations on parallel Algorithms for fast exponentiation in GF(2^n)",{} Siam \spad{J}. Computation,{} Vol.19,{} No.4,{} pp.711-717,{} August 1990 is used. Argument \spad{k} is a parameter of this
248159`-- algorithm.
248275`\spad{dark(c)} sets the shade of the indicated hue of \spad{c} to it's lowest value.
248314`\spad{datalist(l)} creates a datalist from \spad{l}
248363`\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}.
248470`\spad{debug3D(true)} turns debug mode on; debug3D(\spad{false}) turns debug mode off.
248518`\spad{debug(true)} turns debug mode on \spad{debug(false)} turns debug mode off
248562`\spad{dec(x)} returns \spad{x - 1}.
248609`\spad{decimal(r)} converts a rational number to a decimal expansion.
248672`\spad{declare!(u,t)} declares the parameter \spad{u} to have type \spad{t} in the current level of the symbol table.
248744`\spad{declare!(l,t,tab)} creates new entrys in \spad{tab},{} declaring each of \spad{l} to be of type \spad{t}
248822`\spad{declare!(u,t,asp)} declares the parameter \spad{u} to have type \spad{t} in \spad{asp}.
248901`\spad{declare!(u,t,tab)} creates a new entry in \spad{tab},{} declaring \spad{u} to be of type \spad{t}
248973`\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}.
249061`\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}.
249143`\spad{declare(t)} returns a name \spad{f} such that \spad{f} has been declared to the interpreter to be of type \spad{t},{} but has not been assigned a value yet. Note: \spad{t} should be created as \spad{devaluate(T)\$Lisp} where \spad{T} is the actual type of \spad{f} (this hack is required for the case where \spad{T} is a mapping type).
249194`\spad{decomposeFunc(func1, func2, newvar)} returns a function \spad{func3} where \spad{func1} = \spad{func3}(\spad{func2}) and expresses it in the new variable newvar. If there is no solution then \spad{func1} will be returned.
249461`\spad{decompose(up)} \undocumented
249530`\spad{decompose(d)} returns \spad{[id, f]} where \spad{d = (id) + div(f)}.
249662`\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.
249797`\spad{decompose(up,m,n)} \undocumented
250432`\spad{decreasePrecision(n)} decreases the current \spadfunFrom{precision}{FloatingPointSystem} precision by \spad{n} decimal digits.
250548`\axiom{decrease(attributeName)} decreases the value for the effect of the attribute \axiom{attributeName} with all routines. \blankline \axiom{attributeName} should be one of the values "stiffness",{} "stability",{} "accuracy",{} "expense" or "functionEvaluations".
250604`\axiom{decrease(routineName,{}attributeName)} decreases the value for the effect of the attribute \axiom{attributeName} with routine \axiom{routineName}. \blankline \axiom{attributeName} should be one of the values "stiffness",{} "stability",{} "accuracy",{} "expense" or "functionEvaluations".
250667`\spad{deepCopy(x)} \undocumented
250713`\spad{deepExpand(x)} \undocumented{}
250852`\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})}.
250991`\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}))}.
251061`\spad{defineProperty(s,li,p)} defines the component property in the 3 dimensional subspace,{} \spad{s},{} to be that of \spad{p},{} where \spad{p} is of the domain \spadtype{SubSpaceComponentProperty}. The list of non negative integers,{} \spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component whose property is being defined. The subspace,{} \spad{s},{} i
251061`--s returned with the component property definition.
251164`\spad{definingEquations(s)} returns a list of defining polynomials for equations,{} that is,{} for the Zariski closed part of \spad{s}.
251251`\spad{definingInequation(s)} returns a single defining polynomial for the inequation,{} that is,{} the Zariski open part of \spad{s}.
251417`\spad{definingPolynomial()} returns the polynomial used to define the field extension.
251517`\spad{definingPolynomial()} returns the minimal polynomial which \spad{generator()} satisfies.
251580`\spad{definingPolynomial(f)} returns the defining polynomial of \spad{f} as an element of \spad{F}. Error: if \spad{f} is not a kernel.
251672`\axiom{definingPolynomial(aRoot)} gives a polynomial such that \axiom{definingPolynomial(aRoot).aRoot = 0}
251770`\spad{definingPolynomial(x)} returns an expression \spad{p} such that \spad{p(x) = 0}.
251840`\spad{degreePartition(f)} returns the degree partition (\spadignore{i.e.} the multiset of the degrees of the irreducible factors) of the polynomial \spad{f}.
251952`\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}.
252079`\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}.
252233`\axiom{degreeSubResultant(\spad{P},{} \spad{Q},{} \spad{d})} computes a subresultant of degree \axiom{\spad{d}}.
252788`\spad{degree(df)} returns the homogeneous degree of differential form \spad{df}.
252858`\spad{degree(x)} \undocumented
252917`\spad{degree(p)} returns the homogeneous degree of \spad{p}.
252980`\spad{degree(x)} gives the numbers of 1's in \spad{x},{} \spadignore{i.e.} the number of non-zero exponents in the basis element that \spad{x} represents.
253038`\spad{degree(p)} returns the maximum of the exponents of the terms of \spad{p}.
253090`\spad{degree(g)} names the degree of \spad{g}. The set of all elements of a given degree form an \spad{R}-module.
253137`\spad{degree(f)} returns the exponent of the lowest order term of \spad{f}.
253206`\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.
253304`\spad{degree(f(x))} returns the degree of the lowest order term of \spad{f(x)},{} which may have zero as a coefficient.
253392`\axiom{degree(\spad{x})} returns the greatest length of a word in the support of \axiom{\spad{x}}.
253463`\spad{degree(l)} is \spad{n} if \indented{2}{\spad{l = sum(monomial(a(i),i), i = 0..n)}.}
253536`\axiom{degree(ts)} returns the product of main degrees of the members of \axiom{ts}.
253613`\spad{degree(l)} is \spad{n} if \indented{2}{\spad{l = sum(monomial(a(i),i), i = 0..n)}.}
253695`\spad{degree(p)} returns the degree of \spad{p}. \indented{1}{Note that the degree of a word is its length.}
253763`\spad{degree(p)} retuns the number of points moved by the permutation \spad{p}.
253824`\spad{degree(gp)} returns the number of points moved by all permutations of the group {\em gp}.
253890`\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.
253971`\spad{degree(a)} returns the degree of the minimal polynomial of an element \spad{a} over the ground field \spad{F}.
254520`\spad{degree(upoly, lvar)} returns a list containing the maximum degree for each variable in lvar.
254637`\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}.
254733`\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.
254821`\spad{degree(p,v)} gives the degree of polynomial \spad{p} with respect to the variable \spad{v}.
254905`\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.
255070`\spad{delete!(u,i)} destructively deletes the \axiom{\spad{i}}th element of \spad{u}.
255138`\spad{delete!(u,i..j)} destructively deletes elements \spad{u}.\spad{i} through \spad{u}.\spad{j}.
255224`\spad{deleteProperty!(op, p)} unattaches property \spad{p} from \spad{op}. Argument \spad{op} is modified "in place",{} \spadignore{i.e.} no copy is made.
255288`\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.
255348`\spad{deleteRoutine!(R,s)} destructively deletes the given routine from the current database of NAG routines
255833`\spad{delete(u,i)} returns a copy of \spad{u} with the \axiom{\spad{i}}th element deleted. Note: for lists,{} \axiom{delete(a,{}\spad{i}) == concat(a(0..\spad{i} - 1),{}a(\spad{i} + 1,{}..))}.
255890`\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}..))}.
255965`\spad{delta(S,k,p)} returns the number of elements of \spad{S} which are strictly between \spad{p} and the k^{th} element of \spad{S}.
256070`\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.
256157`\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}.
256234`\spad{denomRicDE(op)} returns a polynomial \spad{d} such that any rational solution of the associated Riccati equation of \spad{op y = 0} is of the form \spad{p/d + q'/q + r} for some polynomials \spad{p} and \spad{q} and a reduced \spad{r}. Also,{} \spad{deg(p) < deg(d)} and {gcd(\spad{d},{}\spad{q}) = 1}.
256296`\spad{denom(1/d * (f1,...,fn))} returns \spad{d}.
256350`\spad{denom x} returns the denominator of \spad{x}.
256398`\spad{denom x} returns the denominator of \spad{x}.
256442`\spad{denom(f)} returns the denominator of \spad{f} viewed as a polynomial in the kernels over \spad{Z}.
256538`\spad{denom(x)} returns the denominator of the fraction \spad{x}.
256591`\spad{denom(f)} returns the denominator of \spad{f} viewed as a polynomial in the kernels over \spad{Z}.
256682`\spad{denom(f)} returns the denominator of \spad{f} viewed as a polynomial in the kernels over \spad{R}.
256893`\spad{denominator(f)} returns the denominator of \spad{f} converted to \%.
256966`\spad{denominator(x)} is the denominator of the fraction \spad{x} converted to \%.
257026`\spad{denominators(x)} returns the stream of denominators of the approximants of the continued fraction \spadvar{\spad{x}}. If the continued fraction is finite,{} then the stream will be finite.
257090`\spad{depth(p)} returns the nesting level of \spad{p}.
257146`\spad{depth(s)} returns the number of elements of stack \spad{s}. Note: \axiom{depth(\spad{s}) = \#s}.
257209`\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.
257258`\spad{dequeue()}\$\spad{D} creates an empty dequeue of type \spad{D}.
257307`\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}.
257363`\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}.
257410`\spad{deref(n)} is equivalent to \spad{elt(n)}.
257451`\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,...]}.
257613`\spad{derivationCoordinates(b, ')} returns \spad{M} such that \spad{b' = M b}.
257715`\spad{derivative(op)} returns the value of the "\%diff" property of \spad{op} if it has one,{} and "failed" otherwise.
257819`\spad{derivative(op, foo)} attaches foo as the "\%diff" property of \spad{op}. If \spad{op} has an "\%diff" property \spad{f},{} then applying a derivation \spad{D} to \spad{op}(a) returns \spad{f(a) * D(a)}. Argument \spad{op} must be unary.
257909`\spad{derivative(op, [foo1,...,foon])} attaches [\spad{foo1},{}...,{}foon] as the "\%diff" property of \spad{op}. If \spad{op} has an "\%diff" property \spad{[f1,...,fn]} then applying a derivation \spad{D} to \spad{op(a1,...,an)} returns \spad{f1(a1,...,an) * D(a1) + ... + fn(a1,...,an) * D(an)}.
258011`\spad{destruct(r)} returns the list of matches (var,{} expr) in \spad{r}. Error: if \spad{r} is a failed match.
258097`\spad{destruct((a1,...,an))} returns the list [\spad{a1},{}...,{}an].
258177`\spad{determinant(m)} returns the determinant of the matrix \spad{m}. an error message is returned if the matrix is not square.
258257`\spad{determinant(m)} returns the determinant of the matrix \spad{m}. an error message is returned if the matrix is not square.
258332`\spad{determinant(m)} returns the determinant of the matrix \spad{m}. Error: if the matrix is not square.
258426`\spad{determinant(m)} returns the determinant of the matrix \spad{m}.
258531`\spad{df2ef(a)} coerces a \axiomType{DoubleFloat} to \axiomType{Expression Float}
258609`\spad{df2fi(n)} is a function to convert a \axiomType{DoubleFloat} to a \axiomType{Fraction Integer}
258687`\spad{df2mf(n)} coerces a \axiomType{DoubleFloat} to \axiomType{MachineFloat}
258760`\spad{df2st(n)} coerces a \axiomType{DoubleFloat} to \axiomType{String}
258832`\spad{df2st(n)} coerces a \axiomType{DoubleFloat} to \axiomType{String}
258899`\spad{df2st(n)} coerces a \axiomType{DoubleFloat} to \axiomType{String}
258958`\spad{dfRange(r)} converts a range including \inputbitmap{\htbmdir{}/plusminus.bitmap} \infty to \axiomType{DoubleFloat} equavalents.
259088`\spad{dflist(l)} returns a list of \axiomType{DoubleFloat} equivalents of list \spad{l}
259216`\spad{diag(f)} is the function \spad{g} \indented{1}{such that \spad{g a = f(a,a)}.}
259412`\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.
259476`\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.
259687`\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \spad{l} on the diagonal.
259756`\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \spad{l} on the diagonal.
259836`\spad{diagonalMatrix([m1,...,mk])} creates a block diagonal matrix \spad{M} with block matrices {\em m1},{}...,{}{\em mk} down the diagonal,{} with 0 block matrices elsewhere. More precisly: if \spad{ri := nrows mi},{} \spad{ci := ncols mi},{} then \spad{m} is an (r1+..+rk) by (c1+..+ck) - matrix with entries \spad{m.i.j = ml.(i-r1-..-r(l-1)).(j-n1-..-n(l-1))},{} if \spad{(r1+..+r(l-1)) < i <= r1+..+rl} and \spad{(c1+..+c(l-1)) < i <
259836`--= c1+..+cl},{} \spad{m.i.j} = 0 otherwise.
259906`\spad{diagonalMatrix(v)} returns a diagonal matrix where the elements of \spad{v} appear on the diagonal.
259961`\spad{diagonalProduct(m)} returns the product of the elements on the diagonal of the matrix \spad{m}
260105`\spad{diagonalProduct(m)} returns the product of the elements on the diagonal of the matrix \spad{m}.
260247`\spad{diagonal(m)} returns a row consisting of the elements on the diagonal of the matrix \spad{m}.
260317`\spad{diagonals(v,s)} displays the diagonals of the polygon outline showing a triangularized surface instead of a quadrilateral surface outline,{} for the given three-dimensional viewport \spad{v} which is of domain \spadtype{ThreeDimensionalViewport},{} if \spad{s} is "on",{} or does not display the diagonals if \spad{s} is "off".
260480`\spad{dictionary()}\$\spad{D} creates an empty dictionary of type \spad{D}.
260646`\spad{dictionary([x,y,...,z])} creates a dictionary consisting of entries \axiom{\spad{x},{}\spad{y},{}...,{}\spad{z}}.
260709`\spad{diff(x)} returns the derivation with respect to \spad{x}.
260969`\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}})}.
261021`\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})}}.
261161`\spad{differentialVariables(p)} returns a list of differential indeterminates occurring in a differential polynomial \spad{p}.
262096`\spad{differentiate x} compute the derivative of \spad{x}.
266080`\spad{differentiate(ir,D)} differentiates \spad{ir} with respect to the derivation \spad{D}.
266144`\spad{differentiate(f,n)} creates a form for the \spad{n}th derivative of \spad{f},{} \spadignore{e.g.} \spad{f'},{} \spad{f''},{} \spad{f'''},{} "f super \spad{iv}".
266211`\spad{differentiate(ir,x)} differentiates \spad{ir} with respect to \spad{x}
266313`\spad{differentiate(x,d)} computes the derivative of \spad{x},{} extending differentiation \spad{d} on \spad{R}.
266387`\spad{differentiate(x, d)} extends the derivation \spad{d} from UP to \$ and applies it to \spad{x}.
266466`\spad{differentiate(x,[s1,...sn])} computes successive partial derivatives,{} \spadignore{i.e.} \spad{differentiate(...differentiate(x, s1)..., sn)}.
266539`\spad{differentiate(x,n)} returns the \spad{n}\spad{-}th derivative of \spad{x}.
266613`\spad{differentiate(x,v)} computes the partial derivative of \spad{x} with respect to \spad{v}.
270302`\spad{differentiate(x,d,n)} computes the \spad{n}\spad{-}th derivative of \spad{x} using a derivation extending \spad{d} on \spad{R}.
270395`\spad{differentiate(p, d, x')} extends the \spad{R}-derivation \spad{d} to an extension \spad{D} in \spad{R[x]} where Dx is given by x',{} and returns \spad{Dp}.
270474`\spad{differentiate(x,[s1,...,sn],[n1,...,nn])} computes multiple partial derivatives,{} \spadignore{i.e.}
270572`\spad{differentiate(x,s,n)} computes multiple partial derivatives,{} \spadignore{i.e.} \spad{n}\spad{-}th derivative of \spad{x} with respect to \spad{s}.
270658`\spad{digamma(x)} returns the digamma function applied to \spad{x}
270718`\spad{digamma(x)} is the function,{} \spad{psi(x)},{} defined by \indented{2}{\spad{psi(x) = Gamma'(x)/Gamma(x)}.}
270813`\spad{digamma(x)} is the function,{} \spad{psi(x)},{} defined by \indented{2}{\spad{psi(x) = Gamma'(x)/Gamma(x)}.}
270890`\spad{digamma(x)} is the logarithmic derivative of \spad{Gamma(x)} (often written \spad{psi(x)} in the literature).
270945`\spad{digit?(c)} tests if \spad{c} is a digit character,{} \spadignore{i.e.} one of 0..9.
270990`\spad{digit()} returns the class of all characters for which \spadfunFrom{digit?}{Character} is \spad{true}.
271032`\spad{digits()} returns ceiling's precision in decimal digits.
271097`\spad{digits()} returns ceiling's precision in decimal digits.
271158`\spad{digits(d)} set the \spadfunFrom{precision}{FloatingPointSystem} to \spad{d} digits.
271238`\spad{digits(d)} set the \spadfunFrom{precision}{FloatingPointSystem} to \spad{d} digits.
271351`\spad{digits(x)} returns a stream of \spad{p}-adic digits of \spad{x}.
271418`\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.
271514`\spad{dihedralGroup(n)} constructs the dihedral group of order 2n acting on integers 1,{}...,{}\spad{N}.
271612`\spad{dihedral n} is the cycle index of the \indented{1}{dihedral group of degree \spad{n}.}
271709`\spad{dilog(f)} denotes the dilogarithm
271761`\spad{dilog(x)} returns the dilogarithm of \spad{x},{} \spadignore{i.e.} the integral of \spad{log(x) / (1 - x) dx}.
271818`\spad{dim(c)} sets the shade of a hue,{} \spad{c},{} above dark,{} but below bright.
271856`\spad{dimensionOfIrreducibleRepresentation(lambda)} is the dimension of the ordinary irreducible representation of the symmetric group corresponding to {\em lambda}. Note: the Robinson-Thrall hook formula is implemented.
272115`\spad{dimension()} returns the dimensionality of the vector space.
272173`\spad{dimension()} is the rank of this Lie algebra
272248`\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}
272325`\spad{dimension(s)} returns the dimension of the point category \spad{s}.
272388`\spad{dimension(I,lvar)} gives the dimension of the ideal \spad{I},{} in the ring \spad{F[lvar]}
272478`\spad{dimensionsOf(t)} returns the dimensions of \spad{t}
272549`\spad{dimensionsOf(s,m)} \undocumented{}
272640`\spad{dimensionsOf(s,m)} \undocumented{}
272727`\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 \spa
272727`--dfun{makeViewport2D} is executed again for \spad{v}.
272856`\spad{dimensions(v,x,y,width,height)} sets the position of the upper left-hand corner of the three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport},{} to the window coordinate \spad{x},{} \spad{y},{} and sets the dimensions of the window to that of \spad{width},{} \spad{height}. The new dimensions are not displayed until the functio
272856`--n \spadfun{makeViewport3D} is executed again for \spad{v}.
272987`\spad{dioSolve(u)} computes a basis of all minimal solutions for linear homogeneous Diophantine equation \spad{u},{} then all minimal solutions of inhomogeneous equation
273192`\spad{diophantineSystem(A,B)} returns a particular integer solution and an integer basis of the equation \spad{AX = B}.
273317`\spad{directProduct(v)} converts the vector \spad{v} to become a direct product. Error: if the length of \spad{v} is different from dim.
273390`\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}.
273484`\spad{directSum(a,b,D)} computes an operator \spad{c} of minimal order such that the nullspace of \spad{c} is generated by all the sums of a solution of \spad{a} by a solution of \spad{b}. \spad{D} is the derivation to use.
273568`\spad{direction(s)} \undocumented
273626`\spad{directory(f)} returns the directory part of the file name.
273749`\spad{discreteLog(a)} computes the discrete logarithm of \spad{a} with respect to \spad{primitiveElement()} of the field.
273907`\spad{discreteLog(b,a)} computes \spad{s} with \spad{b**s = a} if such an \spad{s} exists.
274004`\axiom{discriminantEuclidean(\spad{P})} carries out the equality \axiom{\spad{coef1} * \spad{P} + \spad{coef2} * \spad{D}(\spad{P}) = discriminant(\spad{P})}.
274125`\spad{discriminant()} returns the discriminant of the integral closure of \spad{Z} in the quotient field of the framed algebra \spad{F}.
274245`\spad{discriminant()} = determinant(traceMatrix()).
274301`\spad{discriminant()} = determinant(traceMatrix()).
274537`\axiom{discriminant(\spad{P},{} \spad{Q})} returns the discriminant of \axiom{\spad{P}} and \axiom{\spad{Q}}.
274606`\spad{discriminant([v1,..,vn])} returns \spad{determinant(traceMatrix([v1,..,vn]))}.
274673`\spad{discriminant(p)} returns the discriminant of the polynomial \spad{p}.
274832`\spad{discriminant(p,v)} returns the disriminant of the polynomial \spad{p} with respect to the variable \spad{v}.
274928`\spad{disjunction(p,q)} returns a formula denoting the disjunction of \spad{p} and \spad{q}.
274990`prints the string returned by coerce,{} adding <math ...> tags.
275040`\spad{display(op)} returns the "\%display" property of \spad{op} if it has one attached,{} and \spad{nothing} otherwise.
275120`\spad{display(db)} prints a summary line for each entry in \axiom{\spad{db}}.
275165`\spad{display(ic)} prints a summary of the information contained in \axiom{\spad{ic}}.
275208`\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}.
275251`\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)}.
275327`\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.
275397`\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}}.
275448`\spad{distFact(contm,unilist,plead,vl,lvar,lval)},{} where \spad{contm} is the content of the evaluated polynomial,{} \spad{unilist} is the list of factors of the evaluated polynomial,{} \spad{plead} is the complete factorization of 
275448`--the leading coefficient,{} \spad{vl} is the list of factors of the leading coefficient evaluated,{} \spad{lvar} is the list of variables,{} \spad{lval} is the list of values,{} returns a record giving the list of leading coefficients to impose on the univariate factors,{}
275781`\spad{distance(u,v)} returns the path length (an integer) from node \spad{u} to \spad{v}.
275843`\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.
276014`\spad{distribute(f)} expands all the kernels in \spad{f} that are formally enclosed by a \spadfunFrom{box}{ExpressionSpace} or \spadfunFrom{paren}{ExpressionSpace} expression.
276113`\spad{distribute(f, g)} expands all the kernels in \spad{f} that contain \spad{g} in their arguments and that are formally enclosed by a \spadfunFrom{box}{ExpressionSpace} or a \spadfunFrom{paren}{ExpressionSpace} expression.
276166`\spad{x div y} returns the left and right exact quotients of \spad{x} by \spad{y},{} that is \spad{[l, r]} such that \spad{x = l * y * r}. "failed" is returned iff \spad{x} is not of the form \spad{l * y * r}. monomial of \spad{x}.
276250`\spad{f div g} creates the equivalent infix form.
276291`\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}.
276377`\spad{divideExponents(p,n)} returns a new polynomial resulting from dividing all exponents of the polynomial \spad{p} by the non negative integer \spad{n},{} or "failed" if some exponent is not exactly divisible by \spad{n}.
276483`\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.
276572`\spad{divideIfCan(f,g)} returns quotient and remainder of the division of \spad{f} by \spad{g} or "failed" if it has not succeeded.
276927`\spad{divide(x, y)} returns the left and right exact quotients of \spad{x} by \spad{y},{} \spadignore{i.e.} \spad{[l, r]} such that \spad{x = l * y * r},{} "failed" if \spad{x} is not of the form \spad{l * y * r}.
277015`\axiom{divide(\spad{F},{}\spad{G})} computes quotient and rest of the exact euclidean division of \axiom{\spad{F}} by \axiom{\spad{G}}.
277118`\spad{divide(x,y)} divides \spad{x} by \spad{y} producing a record containing a \spad{quotient} and \spad{remainder},{} where the remainder is smaller (see \spadfunFrom{sizeLess?}{EuclideanDomain}) than the divisor \spad{y}.
277197`\spad{divide(a,b)} returns a record containing both remainder and quotient.
277279`\spad{divisorCascade(p,tp)} assumes that degree of polynomial {\em tp} is smaller than degree of polynomial \spad{p},{} both monic. A sequence of divisions is calculated using the remainder,{} made monic,{} as divisor for the the next division. The result contains also the error of the factorizations,{} \spadignore{i.e.} the norm of the remainder polynomial.
277388`\spad{divisorCascade(p,tp)} assumes that degree of polynomial {\em tp} is smaller than degree of polynomial \spad{p},{} both monic. A sequence of divisions are calculated using the remainder,{} made monic,{} as divisor for the the next division. The result contains also the error of the factorizations,{} \spadignore{i.e.} the norm of the remainder polynomial. If {\em info} is {\em true},
277388`--{} then information messages are issued.
277505`\spad{divisor(I)} makes a divisor \spad{D} from an ideal \spad{I}.
277608`\spad{divisor(g)} returns the divisor of the function \spad{g}.
277673`\spad{divisor(a, b)} makes the divisor P: \spad{(x = a, y = b)}. Error: if \spad{P} is singular.
277740`\spad{divisor(a, b, n)} makes the divisor \spad{nP} where P: \spad{(x = a, y = b)}. \spad{P} is allowed to be singular if \spad{n} is a multiple of the rank.
277815`\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}
277891`\spad{divisors(n)} returns a list of the divisors of \spad{n}.
277968`\spad{dmp2rfi(p)} converts \spad{p} to target domain
278062`\spad{dmp2rfi(l)} converts \spad{l} to target domain
278168`\spad{dmp2rfi(m)} converts \spad{m} to target domain
278278`\spad{dmpToHdmp(p)} converts \spad{p} from a \spadtype{DMP} to a \spadtype{HDMP}.
278411`\spad{dmpToP(p)} converts \spad{p} from a \spadtype{DMP} to a \spadtype{POLY}.
278504`\spad{dn(x,k)} expands the elliptic function dn as a Taylor \indented{1}{series.}
278587`\spad{dom(a)} returns a \spadgloss{LISP} form of the type of the original object that was converted to \spadtype{Any}.
278627`\spad{domainTemplate x} returns the domain template vector associated with the functor data \spad{x}.
278689``domain' is the kind of domain constructors
278733`\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 \
278733`--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.
279028`\spad{dot(f)} creates the form with a one dot overhead.
279066`\spad{dot(p,q)} computes the dot product of the two points \spad{p} and \spad{q} using only the first three coordinates,{} and returns the resulting \spadtype{DoubleFloat}.
279194`\spad{dot(f,n)} creates the form \spad{f} with \spad{n} dots overhead.
279251`\spad{dot(x,y)} computes the inner product of the vectors \spad{x} and \spad{y}.
279320`\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.
279378`\spad{double?(t)} tests whether \spad{t} is equivalent to the FORTRAN type DOUBLE PRECISION
279432`\spad{doubleComplex?(t)} tests whether \spad{t} is equivalent to the (non-standard) FORTRAN type DOUBLE COMPLEX.
279493`\spad{doubleDisc(u)} \undocumented
279568`change the output format for doublefloats using lisp format strings
279628`\spad{doubleRank(x)} determines the number of linearly independent elements in \spad{b1*x},{}...,{}\spad{x*bn},{} where \spad{b=[b1,...,bn]} is a basis.
279697`\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.
279780`\spad{double(i, r)} multiplies \spad{r} by \spad{i} using repeated doubling.
279844`\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}.
279904`\spad{drawComplexVectorField(f,rRange,iRange)} draws a complex vector field using arrows on the \spad{x
279904`--y} plane. These vector fields should be viewed from the top by pressing the "XY" translate button on the 3-\spad{d} viewport control panel.\newline Sample call: \indented{3}{\spad{f z == sin z}} \indented{3}{\spad{drawComplexVectorField(f
279904`--, -2..2, -2..2)}} Parameter descriptions: \indented{2}{\spad{f} : the function to draw} \indented{2}{\spad{rRange} : the range of the real values} \indented{2}{\spad{iRange} : the range of the imaginary values} Call the functions \axiomFunFrom{setRealSteps}{DrawComplex} and \axiomFunFrom{setImagSteps}{DrawComplex} to change the number of steps used in each direction.
280068`\spad{drawComplex(f,rRange,iRange,arrows?)} draws a complex function as a height field. It uses the complex norm as the height and the complex argument as the color. It will optionally draw arrows on the surface indicating the direction of the complex value.\newline Sample call: \indented{2}{\spad{f z == exp(1/z)}} \indented{2}{\spad{drawComple
280068`--x(f, 0.3..3, 0..2*\%pi, false)}} Parameter descriptions: \indented{2}{f:\space{2}the function to draw} \indented{2}{\spad{rRange} : the range of the real values} \indented{2}{\spad{iRange} : the range of imaginary values} \indented{2}{\spad{arrows?} : a flag indicating whether to draw the phase arrows for \spad{f}} Call the functions \axiomFunFrom{setRealSteps}{DrawComplex} and \axiomFunFrom{setImagSteps}{DrawComplex} to change the number of steps used in each direction.
280229`\spad{drawCurves([[p0],[p1],...,[pn]],[options])} creates a \spadtype{TwoDimensionalViewport} from the list of lists of points,{} \spad{p0} throught pn,{} using the options specified in the list \spad{options}.
280344`\spad{drawCurves([[p0],[p1],...,[pn]],ptColor,lineColor,ptSize,[options])} creates a \spadtype{TwoDimensionalViewport} from the list of lists of points,{} \spad{p0} throught pn,{} using the options specified in the list \spad{options}. The point color is specified by \spad{ptColor},{} the line color is specified by \spad{lineColor},{} and the point size is s
280344`--pecified by \spad{ptSize}.
280491`\spad{drawStyle(v,s)} displays the surface for the given three-dimensional viewport \spad{v} which is of domain \spadtype{ThreeDimensionalViewport} in the style of drawing indicated by \spad{s}. If \spad{s} is not a valid drawing style the style is wireframe by default. Possible styles are \spad{"shade"},{} \spad{"solid"} or \spad{"opaque"},{} \spad{"smooth"},{} and \spad{"wireMesh"}.
280558`\spad{drawToScale()} determines whether or not plots are to be drawn to scale.
280613`\spad{drawToScale(true)} causes plots to be drawn to scale. \spad{drawToScale(false)} causes plots to be drawn so that they fill up the viewport window. The default setting is \spad{false}.
280675`\spad{draw(lp)} plots the curve constructed from the list of points \spad{lp}.
280776`\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)}.
280905`\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)}.
281043`\spad{draw(f(x),x = a..b)} draws the graph of \spad{y = f(x)} as \spad{x} ranges from \spad{min(a,b)} to \spad{max(a,b)}; \spad{f(x)} appears in the title bar.
281139`\spad{draw(lx,ly)} plots the curve constructed of points (\spad{x},{}\spad{y}) for \spad{x} in \spad{lx} for \spad{y} in \spad{ly}.
281251`\spad{draw(lp,l)} plots the curve constructed from the list of points \spad{lp}. The options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
281369`\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)}.
281520`\spad{draw(curve(f(t),g(t)),t = a..b)} draws the graph of the parametric curve \spad{x = f(t), y = g(t)} as \spad{t} ranges from \spad{min(a,b)} to \spad{max(a,b)}; \spad{(f(t),g(t))} appears in the title bar.
281638`\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)}.
281791`\spad{draw(curve(f(t),g(t),h(t)),t = a..b)} draws the graph of the parametric curve \spad{x = f(t)},{} \spad{y = g(t)},{} \spad{z = h(t)} as \spad{t} ranges from \spad{min(a,b)} to \spad{max(a,b)}; \spad{h(t)} is the default title.
281911`\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.
282057`\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.
282212`\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)}.
282370`\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.
282535`\spad{draw(f(x),x = a..b,l)} draws the graph of \spad{y = f(x)} as \spad{x} ranges from \spad{min(a,b)} to \spad{max(a,b)}; \spad{f(x)} is the default title,{} and the options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
282648`\spad{draw(f(x,y),x = a..b,y = c..d)} draws the graph of \spad{z = f(x,y)} as \spad{x} ranges from \spad{min(a,b)} to \spad{max(a,b)} and \spad{y} ranges from \spad{min(c,d)} to \spad{max(c,d)}; \spad{f(x,y)} appears in the title bar.
282768`\spad{draw(lx,ly,lz)} draws the surface constructed by projecting the values in the \axiom{\spad{lz}} list onto the rectangular grid formed by the \axiom{\spad{lx} \spad{X} \spad{ly}}.
282900`\spad{draw(lx,ly,l)} plots the curve constructed of points (\spad{x},{}\spad{y}) for \spad{x} in \spad{lx} for \spad{y} in \spad{ly}. The options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
283029`\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.
283197`\spad{draw(curve(f(t),g(t)),t = a..b,l)} draws the graph of the parametric curve \spad{x = f(t), y = g(t)} as \spad{t} ranges from \spad{min(a,b)} to \spad{max(a,b)}; \spad{(f(t),g(t))} is the default title,{} and the options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
283332`\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.
283502`\spad{draw(curve(f(t),g(t),h(t)),t = a..b,l)} draws the graph of the parametric curve \spad{x = f(t)},{} \spad{y = g(t)},{} \spad{z = h(t)} as \spad{t} ranges from \spad{min(a,b)} to \spad{max(a,b)}; \spad{h(t)} is the default title,{} and the options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
283639`\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)}.
283816`\spad{draw(surface(f(u,v),g(u,v),h(u,v)),u = a..b,v = c..d)} draws the graph of the parametric surface \spad{x = f(u,v)},{} \spad{y = g(u,v)},{} \spad{z = h(u,v)} as \spad{u} ranges from \spad{min(a,b)} to \spad{max(a,b)} and \spad{v} ranges from \spad{min(c,d)} to \spad{max(c,d)}; \spad{h(t)} is the default title.
283955`\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.
284130`\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.
284312`\spad{draw(f(x,y) = g(x,y),x,y,l)} draws the graph of a polynomial equation. The list \spad{l} of draw options must specify a region in the plane in which the curve is to sketched.
284447`\spad{draw(f(x,y),x = a..b,y = c..d,l)} draws the graph of \spad{z = f(x,y)} as \spad{x} ranges from \spad{min(a,b)} to \spad{max(a,b)} and \spad{y} ranges from \spad{min(c,d)} to \spad{max(c,d)}; \spad{f(x,y)} is the default title,{} and the options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
284584`\spad{draw(lx,ly,lz,l)} draws the surface constructed by projecting the values in the \axiom{\spad{lz}} list onto the rectangular grid formed by the The options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
284733`\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 dom
284733`--ain \spad{DrawOption} are applied.
284927`\spad{draw(surface(f(u,v),g(u,v),h(u,v)),u = a..b,v = c..d,l)} draws the graph of the parametric surface \spad{x = f(u,v)},{} \spad{y = g(u,v)},{} \spad{z = h(u,v)} as \spad{u} ranges from \spad{min(a,b)} to \spad{max(a,b)} and \spad{v} ranges from \spad{min(c,d)} to \spad{max(c,d)}; \spad{h(t)} is the default title,{} and the options contained in t
284927`--he list \spad{l} of the domain \spad{DrawOption} are applied.
285083`\spad{droot(l)} should be a non-exported function.
285214`\spad{dualSignature(c)} returns a list \spad{l} of Boolean values with the following meaning: \indented{2}{\spad{l}.(\spad{i+1}) holds when the constructor takes a domain object} \indented{10}{as the `i'th argument.\space{2}Otherwise the argument} \indented{10}{must be a non-domain object.}
285282`\spad{dual f} returns the dual of the proposition \spad{f}.
285386`\spad{dual f} constructs the dual vector of a linear form which is part of a basis.
285445`\spad{dual x} constructs the dual vector of a linear element which is part of a basis.
285504`\spad{duplicates?(d)} tests if dictionary \spad{d} has duplicate entries.
285567`\spad{duplicates(d)} returns a list of values which have duplicates in \spad{d}
285664`\spad{e01baf(m,x,y,lck,lwrk,ifail)} determines a cubic spline to a given set of data. See \downlink{Manual Page}{manpageXXe01baf}.
285791`\spad{e01bef(n,x,f,ifail)} computes a monotonicity-preserving piecewise cubic Hermite interpolant to a set of data points. See \downlink{Manual Page}{manpageXXe01bef}.
285902`\spad{e01bff(n,x,f,d,m,px,ifail)} evaluates a piecewise cubic Hermite interpolant at a set of points. See \downlink{Manual Page}{manpageXXe01bff}.
286061`\spad{e01bgf(n,x,f,d,m,px,ifail)} evaluates a piecewise cubic Hermite interpolant and its first derivative at a set of points. See \downlink{Manual Page}{manpageXXe01bgf}.
286220`\spad{e01bhf(n,x,f,d,a,b,ifail)} evaluates the definite integral of a piecewise cubic Hermite interpolant over the interval [a,{}\spad{b}]. See \downlink{Manual Page}{manpageXXe01bhf}.
286375`\spad{e01daf(mx,my,x,y,f,ifail)} computes a bicubic spline interpolating surface through a set of data values,{} given on a rectangular grid in the \spad{x}-\spad{y} plane. See \downlink{Manual Page}{manpageXXe01daf}.
286514`\spad{e01saf(m,x,y,f,ifail)} generates a two-dimensional surface interpolating a set of scattered data points,{} using the method of Renka and Cline. See \downlink{Manual Page}{manpageXXe01saf}.
286645`\spad{e01sbf(m,x,y,f,triang,grads,px,py,ifail)} evaluates at a given point the two-dimensional interpolant function computed by E01SAF. See \downlink{Manual Page}{manpageXXe01sbf}.
286836`\spad{e01sef(m,x,y,f,nw,nq,rnw,rnq,ifail)} generates a two-dimensional surface interpolating a set of scattered data points,{} using a modified Shepard method. See \downlink{Manual Page}{manpageXXe01sef}.
287007`\spad{e01sff(m,x,y,f,rnw,fnodes,px,py,ifail)} evaluates at a given point the two-dimensional interpolating function computed by E01SEF. See \downlink{Manual Page}{manpageXXe01sff}.
287194`\spad{e02adf(m,kplus1,nrows,x,y,w,ifail)} computes weighted least-squares polynomial approximations to an arbitrary set of data points. See \downlink{Manual Page}{manpageXXe02adf}.
287335`\spad{e02aef(nplus1,a,xcap,ifail)} evaluates a polynomial from its Chebyshev-series representation. See \downlink{Manual Page}{manpageXXe02aef}.
287432`\spad{e02agf(m,kplus1,nrows,xmin,xmax,x,y,w,mf,xf,yf,lyf,ip,lwrk,liwrk,ifail)} computes constrained weighted least-squares polynomial approximations in Chebyshev-series form to an arbitrary set of data points. The values of the approximations and any nu
287432`--mber of their derivatives can be specified at selected points. See \downlink{Manual Page}{manpageXXe02agf}.
287686`\spad{e02ahf(np1,xmin,xmax,a,ia1,la,iadif1,ladif,ifail)} determines the coefficients in the Chebyshev-series representation of the derivative of a polynomial given in Chebyshev-series form. See \downlink{Manual Page}{manpageXXe02ahf}.
287827`\spad{e02ajf(np1,xmin,xmax,a,ia1,la,qatm1,iaint1,laint,ifail)} determines the coefficients in the Chebyshev-series representation of the indefinite integral of a polynomial given in Chebyshev-series form. See \downlink{Manual Page}{manpageXXe02ajf}.
287981`\spad{e02akf(np1,xmin,xmax,a,ia1,la,x,ifail)} evaluates a polynomial from its Chebyshev-series representation,{} allowing an arbitrary index increment for accessing the array of coefficients. See \downlink{Manual Page}{manpageXXe02akf}.
288118`\spad{e02baf(m,ncap7,x,y,w,lamda,ifail)} computes a weighted least-squares approximation to an arbitrary set of data points by a cubic splines prescribed by the user. Cubic spline can also be carried out. See \downlink{Manual Page}{manpageXXe02baf}.
288271`\spad{e02bbf(ncap7,lamda,c,x,ifail)} evaluates a cubic spline representation. See \downlink{Manual Page}{manpageXXe02bbf}.
288388`\spad{e02bcf(ncap7,lamda,c,x,left,ifail)} evaluates a cubic spline and its first three derivatives from its \spad{B}-spline representation. See \downlink{Manual Page}{manpageXXe02bcf}.
288513`\spad{e02bdf(ncap7,lamda,c,ifail)} computes the definite integral from its \spad{B}-spline representation. See \downlink{Manual Page}{manpageXXe02bdf}.
288618`\spad{e02bef(start,m,x,y,w,s,nest,lwrk,n,lamda,ifail,wrk,iwrk)} computes a cubic spline approximation to an arbitrary set of data points. The knot are located automatically,{} but a single parameter must be specified to control the trade-off between closeness of fit and smoothness 
288618`--of fit. See \downlink{Manual Page}{manpageXXe02bef}.
288843`\spad{e02daf(m,px,py,x,y,f,w,mu,point,npoint,nc,nws,eps,lamda,ifail)} forms a minimal,{} weighted least-squares bicubic spline surface fit with prescribed knots to a given set of data points. See \downlink{Manual Page}{manpageXXe02daf}.
289097`\spad{e02dcf(start,mx,x,my,y,f,s,nxest,nyest,lwrk,liwrk,nx,lamda,ny,mu,wrk,iwrk,ifail)} computes a bicubic spline approximation to a set of data values,{} given on a rectangular grid in the \spad{x}-\spad{y} plane. The knots of th
289097`--e spline are located automatically,{} but a single parameter must be specified to control the trade-off between closeness of fit and smoothness of fit. See \downlink{Manual Page}{manpageXXe02dcf}.
289374`\spad{e02ddf(start,m,x,y,f,w,s,nxest,nyest,lwrk,liwrk,nx,lamda,ny,mu,wrk,ifail)} computes a bicubic spline approximation to a set of scattered data are located automatically,{} but a single parameter must be specified to control the t
289374`--rade-off between closeness of fit and smoothness of fit. See \downlink{Manual Page}{manpageXXe02ddf}.
289647`\spad{e02def(m,px,py,x,y,lamda,mu,c,ifail)} calculates values of a bicubic spline representation. See \downlink{Manual Page}{manpageXXe02def}.
289828`\spad{e02dff(mx,my,px,py,x,y,lamda,mu,c,lwrk,liwrk,ifail)} calculates values of a bicubic spline representation. The spline is evaluated at all points on a rectangular grid. See \downlink{Manual Page}{manpageXXe02dff}.
290034`\spad{e02gaf(m,la,nplus2,toler,a,b,ifail)} calculates an \spad{l} solution to an over-determined system of \indented{22}{1} linear equations. See \downlink{Manual Page}{manpageXXe02gaf}.
290167`\spad{e02zaf(px,py,lamda,mu,m,x,y,npoint,nadres,ifail)} sorts two-dimensional data into rectangular panels. See \downlink{Manual Page}{manpageXXe02zaf}.
290345`\spad{e04dgf(n,es,fu,it,lin,list,ma,op,pr,sta,sto,ve,x,ifail,objfun)} minimizes an unconstrained nonlinear function of several variables using a pre-conditioned,{} limited memory quasi-Newton conjugate gradient method. First derivatives are required. The routine is intend
290345`--ed for use on large scale problems. See \downlink{Manual Page}{manpageXXe04dgf}.
290580`\spad{e04fdf(m,n,liw,lw,x,ifail,lsfun1)} is an easy-to-use algorithm for finding an unconstrained minimum of a sum of squares of \spad{m} nonlinear functions in \spad{n} variables (m>=n). No derivatives are required. See \downlink{Manual Page}{manpageXXe04fdf}.
290730`\spad{e04gcf(m,n,liw,lw,x,ifail,lsfun2)} is an easy-to-use quasi-Newton algorithm for finding an unconstrained minimum of \spad{m} nonlinear functions in \spad{n} variables (m>=n). First derivatives are required. See \downlink{Manual Page}{manpageXXe04gcf}.
290880`\spad{e04jaf(n,ibound,liw,lw,bl,bu,x,ifail,funct1)} is an easy-to-use quasi-Newton algorithm for finding a minimum of a function \spad{F}(\spad{x} ,{}\spad{x} ,{}...,{}\spad{x} ),{} subject to fixed upper and \indented{25}{1\space{2}2\space{6}\spad{n}} lower bounds of the independent variables \spad{x} ,{}\spad{x} ,
290880`--{}...,{}\spad{x} ,{} using \indented{43}{1\space{2}2\space{6}\spad{n}} function values only. See \downlink{Manual Page}{manpageXXe04jaf}.
291070`\spad{e04mbf(itmax,msglvl,n,nclin,nctotl,nrowa,a,bl,bu,cvec,linobj,liwork,lwork,x,ifail)} is an easy-to-use routine for solving linear programming problems,{} or for finding a feasible point for such problems. It is not intended for large sparse problems. See \downlink{Ma
291070`--nual Page}{manpageXXe04mbf}.
291305`\spad{e04naf(itmax,msglvl,n,nclin,nctotl,nrowa,nrowh,ncolh,bigbnd,a,bl,bu,cvec,featol,hess,cold,lpp,orthog,liwork,lwork,x,istate,ifail,q
291305`--phess)} is a comprehensive programming (QP) or linear programming (LP) problems. It is not intended for large sparse problems. See \downlink{Manual Page}{manpageXXe04naf}.
291676`\spad{e04ucf(n,nclin,ncnln,nrowa,nrowj,nrowr,a,bl,bu,liwork,lwork,sta,cra,der,fea,fun,hes,infb,infs,linf,lint,list,maji,majp,mini,minp,mon,nonf,opt,ste,stao,stac,stoo,stoc,ve,istate,cjac,clamda,r,x,ifail,confun,objfun)} is designed to minimize an arbitrary smooth function subject to constraints on the variables,{} linear constraints. (E04UCF may be used for unconstrained,{} bound-constrained and linearly constraine
291676`--d optimization.) The user must provide subroutines that define the objective and constraint functions and as many of their first partial derivatives as possible. Unspecified derivatives are approximated by finite differences. All matrices are treated as dense,{} and hence E04UCF is not intended for large sparse problems. See \downlink{Manual Page}{manpageXXe04ucf}.
292265`\spad{e04ycf(job,m,n,fsumsq,s,lv,v,ifail)} returns estimates of elements of the variance matrix of the estimated regression coefficients for a nonlinear least squares problem. The estimates are derived from the Jacobian of the function \spad{f}(\spad{x}) at the solution. See \downlink{Manual Page}{manpageXXe04ycf}.
292411`\spad{e(n)} produces the appropriate unit element.
292472`\spad{edf2df(n)} maps \axiomType{Expression DoubleFloat} to \axiomType{DoubleFloat} It is an error if \spad{n} is not coercible to DoubleFloat
292557`\spad{edf2ef(e)} maps \axiomType{Expression DoubleFloat} to \axiomType{Expression Float}
292648`\spad{edf2efi(e)} coerces \axiomType{Expression DoubleFloat} into \axiomType{Expression Fraction Integer}
292752`\spad{edf2fi(n)} maps \axiomType{Expression DoubleFloat} to \axiomType{Fraction Integer} It is an error if \spad{n} is not coercible to Fraction Integer
292843`\spad{ef2edf(f)} is a function to convert an \axiomType{Expression Float} to an \axiomType{Expression DoubleFloat}
292934`\spad{eigenMatrix(m)} returns the matrix \spad{b} such that \spad{b*m*(inverse b)} is diagonal,{} or "failed" if no such \spad{b} exists.
293065`\spad{eigenvalues(m)} returns the eigenvalues of the matrix \spad{m} which are expressible as rational functions over the rational numbers.
293210`\spad{eigenvector(eigval,m)} returns the eigenvectors belonging to the eigenvalue \spad{eigval} for the matrix \spad{m}.
293387`\spad{eigenvectors(m)} returns the eigenvalues and eigenvectors for the matrix \spad{m}. The rational eigenvalues and the correspondent eigenvectors are explicitely computed,{} while the non rational ones are given via their minimal polynomial and the corresponding eigenvec
293387`--tors are expressed in terms of a "generic" root of such a polynomial.
293620`\spad{eisensteinIrreducible?(p)} returns \spad{true} if \spad{p} can be shown to be irreducible by Eisenstein's criterion,{} \spad{false} is inconclusive.
293697`\spad{elColumn2!(m,a,i,j)} adds to column \spad{i} a*column(\spad{m},{}\spad{j}) : elementary operation of second kind. (\spad{i} ~=j)
293789`\spad{elRow1!(m,i,j)} swaps rows \spad{i} and \spad{j} of matrix \spad{m} : elementary operation of first kind
293876`\spad{elRow2!(m,a,i,j)} adds to row \spad{i} a*row(\spad{m},{}\spad{j}) : elementary operation of second kind. (\spad{i} ~=j)
294039`\spad{elaborate(s)} returns the elaboration of the syntax object \spad{s} in the empty environement.
294109`\spad{elaboration(ir,ty,env)} construct an elaboration object for for the internal representation form \spad{ir},{} with type \spad{ty},{} and environment \spad{env}.
294209`\spad{elem?(ir)} tests if an integration result is elementary over F?
294264`\spad{element?(f,I)} tests whether the polynomial \spad{f} belongs to the ideal \spad{I}.
294346`\spad{elementary n} is the \spad{n} th elementary symmetric \indented{1}{function expressed in terms of power sums.}
294445`\spad{elements(S)} returns the list of the elements of \spad{S} in increasing order.
294524`\spad{elements(e)} returns the list of expressions in the `literal' list `e'.
294580`\spad{elliptic?(r)} \undocumented{}
294901`\spad{ellipticCylindrical(a)} transforms from elliptic cylindrical coordinates to Cartesian coordinates: \spad{ellipticCylindrical(a)} is a function which will map the point \spad{(u,v,z)} to \spad{x = a*cosh(u)*cos(v)},{} \spad{y = a*sinh(u)*sin(v)},{} \spad{z}.
294982`\spad{elliptic()} returns \spad{p(x)} if the curve is the elliptic defined by \spad{y**2 = p(x)},{} "failed" otherwise.
295064`\spad{elliptic()} returns \spad{p(x)} if the curve is the elliptic defined by \spad{y**2 = p(x)},{} "failed" otherwise.
295143`\spad{elliptic(a)} transforms from elliptic coordinates to Cartesian coordinates: \spad{elliptic(a)} is a function which will map the point \spad{(u,v)} to \spad{x = a*cosh(u)*cos(v)},{} \spad{y = a*sinh(u)*sin(v)}.
295213`thenBranch(\spad{e}) returns the `else-branch' of `e'.
295258`\spad{elt(n)} returns the object \spad{n}.
295297`\spad{elt(t)} gives the component of a rank 0 tensor.
296731`\spad{elt(op, [a1,...,an])} returns \spad{op(a1,...,an)}.
297572`\spad{elt(op,l)} creates a form for application of \spad{op} to list of arguments \spad{l}.
297619`\spad{elt(op,[x1,...,xn])} or \spad{op}([\spad{x1},{}...,{}xn]) applies the \spad{n}-ary operator \spad{op} to \spad{x1},{}...,{}xn.
297682`\spad{elt(op,x)} or \spad{op}(\spad{x}) applies the unary operator \spad{op} to \spad{x}.
297739`\spad{elt(a,b)} evaluates the fraction of univariate polynomials \spad{a} with the distinguished variable replaced by \spad{b}.
297852`\spad{elt(a,r)} evaluates the fraction of univariate polynomials \spad{a} with the distinguished variable replaced by the constant \spad{r}.
297934`\axiom{\spad{l}."count"} returns the number of elements in \axiom{\spad{l}}.
297997`\spad{elt(u,"first")} (also written: \axiom{\spad{u} . first}) is equivalent to first \spad{u}.
298058`\spad{elt(u,"last")} (also written: \axiom{\spad{u} . last}) is equivalent to last \spad{u}.
298118`\spad{elt(u,"left")} (also written: \axiom{a . left}) is equivalent to \axiom{left(a)}.
298180`\spad{elt(\%,"rest")} (also written: \axiom{\spad{u}.rest}) is equivalent to \axiom{rest \spad{u}}.
298241`\spad{elt(a,"right")} (also written: \axiom{a . right}) is equivalent to \axiom{right(a)}.
298304`\axiom{\spad{l}.sort} returns \axiom{\spad{l}} with elements sorted. Note: \axiom{\spad{l}.sort = sort(\spad{l})}
298350`\axiom{\spad{l}.unique} returns \axiom{\spad{l}} with duplicates removed. Note: \axiom{\spad{l}.unique = removeDuplicates(\spad{l})}.
298398`\spad{elt(u,"value")} (also written: \axiom{a. value}) is equivalent to \axiom{value(a)}.
298454`\spad{elt(t,[i1,...,iN])} gives a component of a rank \spad{N} tensor.
298523`\spad{elt(s,[a1,...,an])} or \spad{s}([\spad{a1},{}...,{}an]) returns \spad{s} subscripted by \spad{[a1,...,an]}.
298574`\spad{elt(gp,i)} returns the \spad{i}-th generator of the group {\em gp}.
298652`\spad{elt(db,q)} returns all elements of \axiom{\spad{db}} which satisfy \axiom{\spad{q}}.
298705`\spad{elt(u,s)} (also written: \spad{u.s}) returns the value of \spad{u} at \spad{s}. Error: if \spad{u} is not defined at \spad{s}.
298746`\spad{elt(db,s)} returns the \axiom{\spad{s}} field of each element of \axiom{\spad{db}}.
298806`\spad{elt(ic,s)} selects a particular field from \axiom{\spad{ic}}. Valid fields are \axiom{name,{} nargs,{} exposed,{} type,{} abbreviation,{} kind,{} origin,{} params,{} condition,{} doc}.
298854`\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"}.
299663`\spad{elt(op,x,y)} or \spad{op}(\spad{x},{} \spad{y}) applies the binary operator \spad{op} to \spad{x} and \spad{y}.
299723`\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.
299782`\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.
299845`\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.
299911`\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.
299973`\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.
300056`\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
300137`\spad{elt(t,i,j)} gives a component of a rank 2 tensor.
300208`\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>)}.
300552`\spad{elt(op,x,y,z)} or \spad{op}(\spad{x},{} \spad{y},{} \spad{z}) applies the ternary operator \spad{op} to \spad{x},{} \spad{y} and \spad{z}.
300615`\spad{elt(t,i,j,k)} gives a component of a rank 3 tensor.
300694`\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.
300779`\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
300862`\spad{elt(x,i,j,k)} extract an element from the matrix \spad{x}
301091`\spad{elt(op,x,y,z,t)} or \spad{op}(\spad{x},{} \spad{y},{} \spad{z},{} \spad{t}) applies the 4-ary operator \spad{op} to \spad{x},{} \spad{y},{} \spad{z} and \spad{t}.
301157`\spad{elt(t,i,j,k,l)} gives a component of a rank 4 tensor.
301287`\spad{empty?(s)} returns \spad{true} if the quasialgebraic set \spad{s} has no points,{} and \spad{false} otherwise.
301359`\axiom{empty?(\spad{n})} returns \spad{true} iff the node \spad{n} is \axiom{empty()\$\%}.
301413`\spad{empty?(u)} tests if \spad{u} has 0 elements.
301458`\spad{empty()} creates an empty form.
301496`\spad{empty()} returns the empty quasi-algebraic set
301560`\axiom{empty()} returns the same as \axiom{[empty()\$\spad{V},{}empty()\$\spad{C},{}\spad{false}]\$\%}
301606`\spad{empty()}\$\spad{D} creates an aggregate of type \spad{D} with 0 elements. Note: The {\em \$D} can be dropped if understood by context,{} \spadignore{e.g.} \axiom{u: \spad{D} := empty()}.
301643`\spad{empty()} constructs an empty environment
301682`\spad{empty()} returns an empty scope.
301715`\spad{empty()} returns a new,{} empty symbol table
301754`\spad{empty()} creates a new,{} empty symbol table.
301796`\spad{encodintDirectory x} returns the directory of domain-wide entity description.
301881`\spad{endOfFile?(f)} tests whether the file \spad{f} is positioned after the end of all text. If the file is open for output,{} then this test is always \spad{true}.
301929`\spad{endSubProgram()} asserts that we are no longer processing the current subprogram.
301983`\spad{enqueue!(x,q)} inserts \spad{x} into the queue \spad{q} at the back end.
302034`\spad{enterInCache(x, f)} enters \spad{x} in the cache,{} calling \spad{f(y)} to determine whether \spad{x} is equal to \spad{y}. It returns \spad{x} with an integer associated with it.
302096`\spad{enterInCache(x, f)} enters \spad{x} in the cache,{} calling \spad{f(x, y)} to determine whether \spad{x < y (f(x,y) < 0), x = y (f(x,y) = 0)},{} or \spad{x > y (f(x,y) > 0)}. It returns \spad{x} with an integer associated with it.
302160`\spad{enterPointData(s,[p0,p1,...,pn])} adds a list of points from \spad{p0} through pn to the \spadtype{ThreeSpace},{} \spad{s},{} and returns the index,{} to the starting point of the list.
302437`\spad{entries(u)} returns a list of all the entries of aggregate \spad{u} in no assumed order.
302507`\spad{entries(x)} \undocumented{}
303433`\spad{entry?(x,u)} tests if \spad{x} equals \axiom{\spad{u} . \spad{i}} for some index \spad{i}.
303566`\spad{entry(n)} \undocumented{}
304395`\spad{enumerate()} returns a vector of all the sets of \spad{M} integers in \spad{1..n}.
304462`\spad{environment(x)} returns the environment of the elaboration \spad{x}.
304518`\spad{eof?(ifile)} holds when the last read reached end of file.
304567`\spad{epilogue(t)} extracts the epilogue section of a TeX form \spad{t}.
304661`\spad{eq?(u,v)} tests if \spad{u} and \spad{v} are same objects.
304706`\spad{eq(x,y)} holds if both values \spad{x} and \spad{y} resides at the same address in memory.
304753`\spad{eq(s, t)} is \spad{true} if \%peq(\spad{s},{}\spad{t}) is \spad{true} for pointers.
304829`\spad{equality(op, foo?)} attaches foo? as the "\%equal?" property to \spad{op}. If \spad{op1} and \spad{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 \spad{op1} and \spad{op2} should be considered equal.
304892`\spad{equation(a,b)} creates an equation.
304937`\spad{equation(v,s)} creates a segment binding value with variable \spad{v} and segment \spad{s}. Note that the interpreter parses \spad{v=s} to this form.
305053`\spad{equation(s,"a")} creates a new equation.
305110`\spad{equiv(p,q)} returns the logical equivalence of `p',{} `q'.
305161`\spad{erf(f)} denotes the error function
305211`\spad{erf(x)} returns the error function of \spad{x},{} \spadignore{i.e.} \spad{2 / sqrt(\%pi)} times the integral of \spad{exp(-x**2) dx}.
305266`\spad{errorInfo(u)} returns information about the error \spad{u}.
305323`\spad{errorKind(u)} returns the type of error which \spad{u} represents.
305385`\spad{error(lmsg)} displays error message \spad{lmsg} and terminates.
305441`\spad{error(msg)} displays error message \spad{msg} and terminates.
305491`\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.
305554`\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.
305611`\spad{escape} designate the escape character.
305649`\spad{euclideanGroebner(lp)} computes a groebner basis for a polynomial ideal over a euclidean domain generated by the list of polynomials \spad{lp}.
305759`\spad{euclideanGroebner(lp, infoflag)} computes a groebner basis for a polynomial ideal over a euclidean domain generated by the list of polynomials \spad{lp}. During computation,{} additional information is printed out if infoflag is given as either "info" (for summary information) or "redcrit" (for reduced critical pairs)
305876`\spad{euclideanGroebner(lp, "info", "redcrit")} computes a groebner basis for a polynomial ideal generated by the list of polynomials \spad{lp}. If the second argument is \spad{"info"},{} a summary is given of the critical pairs. If the third argument is "redcrit",{} critical pairs are printed.
306000`\spad{euclideanNormalForm(poly,gb)} reduces the polynomial \spad{poly} modulo the precomputed groebner basis \spad{gb} giving a canonical representative of the residue class.
306390`\spad{euclideanSize(x)} returns the euclidean size of the element \spad{x}. Error: if \spad{x} is zero.
306459`\spad{eulerE(n,r)} \undocumented
306577`\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.
306648`\spad{euler(n)} returns the \spad{n}th Euler polynomial \spad{E[n](x)}. Note: Euler polynomials denoted \spad{E(n,x)} computed by solving the differential equation \spad{differentiate(E(n,x),x) = n E(n-1,x)} where \spad{E(0,x) = 1} and initial condition comes from \spad{E(n) = 2**n E(n,1/2)}.
306757`\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.
306866`\spad{eval s} is the sum of the coefficients of a cycle index.
306961`\spad{eval(f)} unquotes all the quoted operators in \spad{f}.
307037`\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.}
308254`\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}.
308330`\spad{eval(m,x)} returns \spad{(a*x + b)/(c*x + d)} where \spad{m = moebius(a,b,c,d)} (see \spadfunFrom{moebius}{MoebiusTransform}).
308379`\spad{eval(m,x)} returns \spad{(a*x + b)/(c*x + d)} where \spad{m = moebius(a,b,c,d)} (see \spadfunFrom{moebius}{MoebiusTransform}).
308468`\spad{eval(f, v = g)} returns \spad{f} with \spad{v} replaced by \spad{g}. Error: if \spad{v} is not a symbol.
308592`\spad{eval(f, [v1 = g1,...,vn = gn])} returns \spad{f} with each \spad{vi} replaced by \spad{gi} in parallel,{} \spadignore{i.e.} \spad{vi}'s appearing inside the \spad{gi}'s are not replaced. Error: if any \spad{vi} is not a symbol.
308722`\spad{eval(f,a)} evaluates a power series at a value in the ground ring by returning a stream of partial sums.
308847`\spad{eval(f,x = v)} replaces \spad{x} by \spad{v} in \spad{f}.
308899`\spad{eval(f, [x1 = v1,...,xn = vn])} replaces \spad{xi} by \spad{vi} in \spad{f}.
308957`\spad{eval(f, [foo1,...,foon])} unquotes all the \spad{fooi}'s in \spad{f}.
309046`\spad{eval(eqn, [x1=v1, ... xn=vn])} replaces \spad{xi} by \spad{vi} in equation \spad{eqn}.
309137`\spad{eval(f, foo)} unquotes all the foo's in \spad{f}.
309220`\spad{eval(eqn, x=f)} replaces \spad{x} by \spad{f} in equation \spad{eqn}.
312995`\spad{eval(p(x,y), f(x), g(x))} returns \spad{p(f(x), y * g(x))}.
313081`\spad{eval(f, [v1,...,vn], [g1,...,gn])} returns \spad{f} with each \spad{vi} replaced by \spad{gi} in parallel,{} \spadignore{i.e.} \spad{vi}'s appearing inside the \spad{gi}'s are not replaced.
313214`\spad{eval(f, v, g)} returns \spad{f} with \spad{v} replaced by \spad{g}.
313335`\spad{eval(mat,symbols,values)} evaluates a multivariable matrix at given \spad{values} for each of a list of variables
313483`\spad{eval(f, x, v)} replaces \spad{x} by \spad{v} in \spad{f}.
313534`\spad{eval(x, s, f)} replaces every \spad{s(a1,..,am)} in \spad{x} by \spad{f(a1,..,am)} for any \spad{a1},{}...,{}\spad{am}.
313607`\spad{eval(x, s, f)} replaces every \spad{s(a)} in \spad{x} by \spad{f(a)} for any \spad{a}.
313674`\spad{eval(f, [x1,...,xn], [v1,...,vn])} replaces \spad{xi} by \spad{vi} in \spad{f}.
313737`\spad{eval(x, [s1,...,sm], [f1,...,fm])} replaces every \spad{si(a1,...,an)} in \spad{x} by \spad{fi(a1,...,an)} for any \spad{a1},{}...,{}\spad{an}.
313822`\spad{eval(x, [s1,...,sm], [f1,...,fm])} replaces every \spad{si(a)} in \spad{x} by \spad{fi(a)} for any \spad{a}.
313901`\spad{eval(x, [s1,...,sm], [f1,...,fm])} replaces every \spad{si(a1,...,an)} in \spad{x} by \spad{fi(a1,...,an)} for any \spad{a1},{}...,{}\spad{an}.
313979`\spad{eval(x, [s1,...,sm], [f1,...,fm])} replaces every \spad{si(a)} in \spad{x} by \spad{fi(a)} for any \spad{a}.
314051`\axiom{eval(\spad{p},{} [\spad{x1},{}...,{}xn],{} [\spad{v1},{}...,{}vn])} replaces \axiom{\spad{xi}} by \axiom{\spad{vi}} in \axiom{\spad{p}}.
314126`\spad{eval(x, s, f)} replaces every \spad{s(a1,..,am)} in \spad{x} by \spad{f(a1,..,am)} for any \spad{a1},{}...,{}\spad{am}.
314192`\spad{eval(x, s, f)} replaces every \spad{s(a)} in \spad{x} by \spad{f(a)} for any \spad{a}.
314252`\axiom{eval(\spad{p},{} \spad{x},{} \spad{v})} replaces \axiom{\spad{x}} by \axiom{\spad{v}} in \axiom{\spad{p}}.
314799`\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}.
314899`\spad{eval(x, [s1,...,sm], [f1,...,fm], y)} replaces every \spad{si(a)} in \spad{x} by \spad{fi(y)} with \spad{y} replaced by \spad{a} for any \spad{a}.
315011`\spad{eval(x, [s1,...,sm], [n1,...,nm], [f1,...,fm])} replaces every \spad{si(a1,...,an)**ni} in \spad{x} by \spad{fi(a1,...,an)} for any \spad{a1},{}...,{}am.
315126`\spad{eval(x, [s1,...,sm], [n1,...,nm], [f1,...,fm])} replaces every \spad{si(a)**ni} in \spad{x} by \spad{fi(a)} for any \spad{a}.
315235`\spad{eval(x, s, n, f)} replaces every \spad{s(a1,...,am)**n} in \spad{x} by \spad{f(a1,...,am)} for any \spad{a1},{}...,{}am.
315332`\spad{eval(x, s, n, f)} replaces every \spad{s(a)**n} in \spad{x} by \spad{f(a)} for any \spad{a}.
315476`\spad{evaluateInverse(x,f)} \undocumented
315542`\spad{evaluate(op)} returns the value of the "\%eval" property of \spad{op} if it has one,{} and "failed" otherwise.
315684`\spad{evaluate(op, foo)} attaches foo as the "\%eval" property of \spad{op}. If \spad{op} has an "\%eval" property \spad{f},{} then applying \spad{op} to a returns the result of \spad{f(a)}. Argument \spad{op} must be unary.
315772`\spad{evaluate(op, foo)} attaches foo as the "\%eval" property of \spad{op}. If \spad{op} has an "\%eval" property \spad{f},{} then applying \spad{op} to \spad{(a1,...,an)} returns the result of \spad{f(a1,...,an)}.
315866`\spad{evaluate(op, [a1,...,an])} checks if \spad{op} has an "\%eval" property \spad{f}. If it has,{} then \spad{f(a1,...,an)} is returned,{} and "failed" otherwise.
315959`\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}.
316118`\spad{even? x} is \spad{true} if \spad{x} is an even integer.
316198`\spad{even?(n)} returns \spad{true} if and only if \spad{n} is even.
316252`\spad{even?(p)} returns \spad{true} if and only if \spad{p} is an even permutation,{} \spadignore{i.e.} {\em sign(p)} is 1.
316301`\spad{evenInfiniteProduct(f(x))} computes \spad{product(n=2,4,6...,f(x**n))}. The series \spad{f(x)} should have constant coefficient 1.
316392`\spad{evenInfiniteProduct(f(x))} computes \spad{product(n=2,4,6...,f(x**n))}. The series \spad{f(x)} should have constant coefficient 1.
316481`\spad{evenInfiniteProduct(f(x))} computes \spad{product(n=2,4,6...,f(x**n))}. The series \spad{f(x)} should have constant coefficient 1.
316568`\spad{evenInfiniteProduct(f(x))} computes \spad{product(n=2,4,6...,f(x**n))}. The series \spad{f(x)} should have constant coefficient 1.
316649`\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))))}.
316730`\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))))}.}
317331`\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})}.
317437`\spad{exQuo(x,y)} \undocumented
317540`\spad{exQuo(x,y)} \undocumented
317633`\spad{exQuo(x,y)} \undocumented
317867`\axiom{exactQuotient!(\spad{p},{}\spad{r})} replaces \axiom{\spad{p}} by \axiom{exactQuotient(\spad{p},{}\spad{r})}.
317963`\axiom{exactQuotient!(a,{}\spad{b})} replaces \axiom{a} by \axiom{exactQuotient(a,{}\spad{b})}
318200`\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!
318295`\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!
318391`\spad{exists?(f)} tests if the file exists in the file system.
318444`\spad{exp1()} returns the natural log base \spad{2.718281828...}.
318482`\spad{exp1()} returns exp 1: \spad{2.7182818284...}.
318514`\spad{expIfCan(z)} returns exp(\spad{z}) if possible,{} and "failed" otherwise.
318594`\spad{expPot(v,e,d)} returns the sum from \spad{i = 0} to \spad{e - 1} of \spad{v**(q**i*d)},{} interpreting \spad{v} as an element of a normal basis field and where \spad{q} is the size of the ground field. Note: for a description of the algorithm,{} see \spad{T}.Itoh and \spad{S}.Tsujii,{} "A fast algorithm for computing multiplicative inverses in GF(2^m) using normal bases",{} Information and
318594`-- Computation 78,{} pp.171-177,{} 1988.
318703`\spad{exp(x)} applies the exponential operator to \spad{x}
318752`\axiom{exp(\spad{p})} returns the exponential of \axiom{\spad{p}}.
318832`\spad{exp([i1,...in])} returns \spad{u_1\^{i_1} ... u_n\^{i_n}}
318989`\spad{exp(st)} computes the exponential of a power series \spad{st}.
319072`\spad{exp(st)} computes the exponential of a power series \spad{st}.
319169`\spad{exp(z)} returns the exponential of Laurent series \spad{z}.
319255`\spad{exp(z)} returns the exponential of a Puiseux series \spad{z}.
319350`\spad{exp(x)} returns \%\spad{e} to the power \spad{x}.
319404`\spad{exp(x)} represents the Fortran intrinsic function EXP
319484`\axiom{exp(\spad{p},{} \spad{n})} returns the exponential of \axiom{\spad{p}} truncated at order \axiom{\spad{n}}.
319572`\axiom{exp(\spad{p},{}\spad{n})} returns the exponential of \axiom{\spad{p}} (truncated up to order \axiom{\spad{n}}).
319675`\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)}..
319739`\spad{expandPower(f)} converts every power \spad{(a/b)**c} appearing in \spad{f} into \spad{a**c * b**(-c)}.
319805`\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 
319805`--is relatively expensive. To avoid getting into an infinite loop the transformations are applied at most ten times.
320072`\spad{expand(p)} returns \spad{p} in distributed form.
320163`\spad{expand(f)} performs the following expansions on f:\begin{items} \item 1. logs of products are expanded into sums of logs,{} \item 2. trigonometric and hyperbolic trigonometric functions of sums are expanded into sums of products of trigonometric and hyperbolic trigonometric functions. \item 3. formal powers of the form \spad{(a/b)**c} are expanded into \spad{a**c * b**(-c)}. \end{items}
320224`\spad{expand(i)} returns the list of possible real functions corresponding to \spad{i}.
320310`\spad{expand(i)} returns the list of possible real functions corresponding to \spad{i}.
320430`\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]}.
320495`\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]}.
320554`\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.
320595`\spad{expand(f,n)} \undocumented{}
320701`\spad{expenseOfEvaluationIF(o)} returns the intensity value of the cost of evaluating the input ODE. This is in terms of the number of ``operational units''. It returns a value in the range [0,{}1].\newline\indent{20} 400 ``operation units'' -> 0.75 \ne
320701`--wline 200 ``operation units'' -> 0.5 \newline 83 ``operation units'' -> 0.25 \newline\indent{15} exponentiation = 4 units ,{} function calls = 10 units.
320955`\spad{expenseOfEvaluation(o)} returns the intensity value of the cost of evaluating the input set of functions. This is in terms of the number of ``operational units''. It returns a value in the range [0,{}1].
321080`\spad{expenseOfEvaluation(o)} gives an approximation of the cost of evaluating a list of expressions in terms of the number of basic operations. < 0.3 inexpensive ; 0.5 neutral ; > 0.7 very expensive 400 `operation units' -> 0.75 200 `operation units' -> 0.5 83 `operation units' -> 0.25 ** = 4 units ,{} function calls = 10 units.
321180`\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
321180`--. Argument \spad{foo} is a Risch differential equation function on \spad{F}.
321424`\spad{expint(f, x)} returns e^{the integral of \spad{f} with respect to \spad{x}}.
321479`\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}.
321663`\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}.
321838`\spad{explicitEntries?(s)} returns \spad{true} if the stream \spad{s} has explicitly computed entries,{} and \spad{false} otherwise.
321906`\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.
322102`\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})}.
322167`\spad{explimitedint(f, ', foo, [u1,...,un])} returns \spad{[v, [c1,...,cn], a]} such that \spad{ci' = 0},{} \spad{f = v' + a + reduce(+,[ci * ui'/ui])},{} and \spad{a = 0} or \spad{a} has no integral in \spad{F}. Returns "fa
322167`--iled" if no such \spad{v},{} \spad{ci},{} a exist. Argument \spad{foo} is a Risch differential equation function on \spad{F}.
322450`\spad{explogs2trigs(f)} rewrites all the complex logs and exponentials appearing in \spad{f} in terms of trigonometric functions.
322535`\spad{exponent(x)} \undocumented
322590`\spad{exponent(exp(f(x)))} returns \spad{f(x)}
322704`\spad{exponent(x)} returns the \spadfunFrom{exponent}{FloatingPointSystem} part of \spad{x}.
322761`\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.
322810`\spad{exponent(u)} returns the exponent of \spad{u}
322860`\spad{exponential1()} \undocumented
322922`\spad{exponentialOrder(exp(c * x **(-n) + ...))} returns \spad{-n}. exponentialOrder(0) returns \spad{0}.
323026`\spad{exponential(f)} \undocumented
323096`\spad{exponential(f(x))} returns \spad{exp(f(x))}. Note: the function does NOT check that \spad{f(x)} has no non-negative terms.
323213`\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.
323269`\spad{exportedOperators(c)} returns the list of all operator signatures exported by the category `c',{} along with their predicates.
323340`\axiom{exprHasAlgebraicWeight} looks for algebraic weights giving rise to singularities of the function at the end-points.
323562`\axiom{exprHasLogarithmicWeights} looks for logarithmic weights giving rise to singularities of the function at the end-points.
323761`\axiom{exprHasWeightCosWXorSinWX} looks for trigonometric weights in an expression of the form \axiom{cos \omega \spad{x}} or \axiom{sin \omega \spad{x}},{} returning the value of \omega (\notequal 1) and the operator.
324007`\spad{exprToGenUPS(fcn,posCheck?,atanFlag)} converts the expression \spad{fcn} to a generalized power series. If \spad{posCheck?} is \spad{true},{} log'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
324007`-- 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 
324007`--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 ri
324007`--ght. 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 probl
324007`--em. 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.
324175`\spad{exprToUPS(fcn,posCheck?,atanFlag)} converts the expression \spad{fcn} to a power series. If \spad{posCheck?} is \spad{true},{} log'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 \spa
324175`--d{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 expansi
324175`--on 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{atan
324175`--Flag} 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 expandi
324175`--ng 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.
324340`\spad{exprToXXP(fcn,posCheck?)} converts the expression \spad{fcn} to an exponential expansion. If \spad{posCheck?} is \spad{true},{} log'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.
324518`\spad{expr(s)} returns \spad{s} as an element of Expr; Error: if \spad{s} is not an atom that also belongs to Expr.
324666`\spad{expressIdealMember([f1,...,fn],h)} returns a representation of \spad{h} as a linear combination of the \spad{fi} or \spad{nothing} if \spad{h} is not in the ideal generated by the \spad{fi}.
324751`\spad{expression(e)} returns the expression being converted.
324800`\spad{expression(e)} returns the exit expression of `e'.
324847`\spad{expression(e)} returns the expression being converted.
324897`\spad{expression(e)} returns the syntax for the expression being quoted.
324950`\spad{expression(e)} returns the expression being converted.
325001`\spad{expression(e)} returns the expression returned by `e'.
325050`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).
325105`\spad{exptMod(u,k,v)} raises the polynomial \spad{u} to the \spad{k}th power modulo the polynomial \spad{v}.
325188`\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}.
325270`\spad{expt(r, i)} computes r**i by repeated squaring
325858`\spad{exquo(a,b)} returns the power series quotient of \spad{a} by \spad{b},{} if the quotient exists,{} and "failed" otherwise
325959`\axiom{\spad{v} exquo \spad{r}} computes the exact quotient of \axiom{\spad{v}} by \axiom{\spad{r}}
326042`\spad{exquo(f,g)} creates the equivalent infix form.
326085`\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.
326172`\spad{exquo(p,r)} returns the exact quotient of polynomial \spad{p} by \spad{r},{} or "failed" if none exists.
326269`\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.
326363`\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.
326472`\spad{exquo(l, a)} returns the exact quotient of \spad{l} by a,{} returning \axiom{"failed"} if this is not possible.
326576`\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.
326639`\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.
326706`\axiom{extendIfCan(ts,{}\spad{p})} returns a triangular set which encodes the simple extension by \axiom{\spad{p}} of the extension of the base field defined by \axiom{ts},{} according to the properties of triangular sets of the current domain. If the required properties do not hold then "failed" is returned. This operation encodes in some sense the properties of the triangular sets of the current category. Is is used t
326706`--o implement the \axiom{construct} operation to guarantee that every triangular set build from a list of polynomials has the required properties.
327284`\spad{extend(lp,lts)} returns the same as \spad{concat([extend(lp,ts) for ts in lts])|}
327372`\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))}
327454`\spad{extend(p,lts)} returns the same as \spad{concat([extend(p,ts) for ts in lts])|}
327536`\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.
327612`\spad{extend(f,n)} causes all terms of \spad{f} of degree <= \spad{n} to be computed.
327690`\spad{extend(st,n)} causes entries to be computed,{} if necessary,{} so that 'st' will have at least 'n' explicit entries or so that all entries of 'st' will be computed if 'st' is finite with length <= \spad{n}.
327751`\spad{extend(x,n)} forces the computation of digits up to order \spad{n}.
327813`\spad{extend(x,n)} causes the first \spadvar{\spad{n}} entries in the continued fraction \spadvar{\spad{x}} to be computed. Normally entries are only computed as needed.
327872`\spad{extend(x,l,r)} \undocumented
327927`\spad{extend(f,n)} causes all terms of \spad{f} of degree \spad{<= n} to be computed.
328019`\axiom{extend(ts,{}\spad{p})} returns a triangular set which encodes the simple extension by \axiom{\spad{p}} of the extension of the base field defined by \axiom{ts},{} according to the properties of triangular sets of the current category If the required properties do not hold an error is returned.
328172`\spad{extendedEuclidean(x,y)} returns a record rec where \spad{rec.coef1*x+rec.coef2*y = rec.generator} and rec.generator is a gcd of \spad{x} and \spad{y}. The gcd is unique only up to associates if \spadatt{canonicalUnitNormal} is not asserted. \spadfun{principalIdeal} provides a version of this operation which accepts an arbitrary length list of arguments.
328364`\spad{extendedEuclidean(x,y,z)} either returns a record rec where \spad{rec.coef1*x+rec.coef2*y=z} or returns "failed" if \spad{z} cannot be expressed as a linear combination of \spad{x} and \spad{y}.
328466`\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.
328673`\axiom{extendedResultant(a,{}\spad{b})} returns \axiom{[\spad{r},{}ca,{}cb]} such that \axiom{\spad{r}} is the resultant of \axiom{a} and \axiom{\spad{b}} and \axiom{\spad{r} = ca * a + cb * \spad{b}}
328806`\axiom{extendedSubResultantGcd(a,{}\spad{b})} returns \axiom{[\spad{g},{}ca,{} cb]} such that \axiom{\spad{g}} is a gcd of \axiom{a} and \axiom{\spad{b}} in \axiom{R^(\spad{-1}) \spad{P}} and \axiom{\spad{g} = ca * a + cb * \spad{b}}
328940`\axiom{extendedSubResultantGcd(a,{}\spad{b})} returns \axiom{[ca,{}cb,{}\spad{r}]} such that \axiom{\spad{r}} is \axiom{subResultantGcd(a,{}\spad{b})} and we have \axiom{ca * a + cb * cb = \spad{r}} .
329076`\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.
329322`\spad{extensionDegree()} returns the degree of field extension.
329408`\spad{extensionDegree()} returns the degree of the field extension if the extension is algebraic,{} and \spad{infinity} if it is not.
329496`\spad{extensionDegree()} returns the degree of field extension.
329579`\spad{extension(f)} returns the type part of the file name.
329633`\spad{exteriorDifferential(df)} returns the exterior derivative (gradient,{} curl,{} divergence,{} ...) of the differential form \spad{df}.
329712`\spad{external?(u)} returns \spad{true} if \spad{u} is declared to be EXTERNAL
329762`\spad{externalList(tab)} returns a list of all the external symbols in \spad{tab}
329900`\spad{extract!(u)} destructively removes a (random) item from bag \spad{u}.
329947`\spad{extractBottom!(d)} destructively extracts the bottom (back) element from the dequeue \spad{d}. Error: if \spad{d} is empty.
330004`\spad{extractClosed(s)} returns the \spadtype{Boolean} value of the closed property for the indicated 3 dimensional subspace \spad{s}. If the property is closed,{} \spad{True} is returned,{} otherwise \spad{False} is returned.
330060`\axiom{extractIfCan(\spad{x})} searches the item whose key is \axiom{\spad{x}}.
330155`\spad{extractIndex(s)} returns a non negative integer which is the current index of the 3 dimensional subspace \spad{s}.
330221`\spad{extractPoint(s)} returns the point which is given by the current index location into the point data field of the 3 dimensional subspace \spad{s}.
330277`\spad{extractProperty(s)} returns the property of domain \spadtype{SubSpaceComponentProperty} of the indicated 3 dimensional subspace \spad{s}.
330353`\axiom{extractSplittingLeaf(a)} returns the left most leaf (as a tree) whose status is \spad{false} if any,{} else "failed" is returned.
330432`\spad{extractTop!(d)} destructively extracts the top (front) element from the dequeue \spad{d}. Error: if \spad{d} is empty.
330486`\spad{eyeDistance(v,d)} sets the distance of the observer from the center of the graph to \spad{d},{} for the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport}.
330554`\spad{f01brf(n,nz,licn,lirn,pivot,lblock,grow,abort,a,irn,icn,ifail)} factorizes a real sparse matrix. The routine either forms the LU factorization of a permutation of the entire matrix,{} or,{} optionally,{} first permutes the matrix to block lower triangular form and then only factorizes the diagonal blocks. S
330554`--ee \downlink{Manual Page}{manpageXXf01brf}.
330747`\spad{f01bsf(n,nz,licn,ivect,jvect,icn,ikeep,grow,eta,abort,idisp,avals,ifail)} factorizes a real sparse matrix using the pivotal sequence previously obtained by F01BRF when a matrix of the same sparsity pattern was factorized. See \downlink{Manual Page}{manpageXXf01bsf}.
330966`\spad{f01maf(n,nz,licn,lirn,abort,avals,irn,icn,droptl,densw,ifail)} computes an incomplete Cholesky factorization of a real sparse symmetric positive-definite matrix A. See \downlink{Manual Page}{manpageXXf01maf}.
331155`\spad{f01mcf(n,avals,lal,nrow,ifail)} computes the Cholesky factorization of a real symmetric positive-definite variable-bandwidth matrix. See \downlink{Manual Page}{manpageXXf01mcf}.
331273`\spad{f01qcf(m,n,lda,a,ifail)} finds the QR factorization of the real \spad{m} by \spad{n} matrix A,{} where m>=n. See \downlink{Manual Page}{manpageXXf01qcf}.
331383`\spad{f01qdf(trans,wheret,m,n,a,lda,zeta,ncolb,ldb,b,ifail)} performs one of the transformations See \downlink{Manual Page}{manpageXXf01qdf}.
331564`\spad{f01qef(wheret,m,n,ncolq,lda,zeta,a,ifail)} returns the first \spad{ncolq} columns of the real \spad{m} by \spad{m} orthogonal matrix \spad{Q},{} where \spad{Q} is given as the product of Householder transformation matrices. See \downlink{Manual Page}{manpageXXf01qef}.
331709`\spad{f01rcf(m,n,lda,a,ifail)} finds the QR factorization of the complex \spad{m} by \spad{n} matrix A,{} where m>=n. See \downlink{Manual Page}{manpageXXf01rcf}.
331828`\spad{f01rdf(trans,wheret,m,n,a,lda,theta,ncolb,ldb,b,ifail)} performs one of the transformations See \downlink{Manual Page}{manpageXXf01rdf}.
332036`\spad{f01ref(wheret,m,n,ncolq,lda,theta,a,ifail)} returns the first \spad{ncolq} columns of the complex \spad{m} by \spad{m} unitary matrix \spad{Q},{} where \spad{Q} is given as the product of Householder transformation matrices. See \downlink{Manual Page}{manpageXXf01ref}.
332199`\spad{f02aaf(ia,n,a,ifail)} calculates all the eigenvalue. See \downlink{Manual Page}{manpageXXf02aaf}.
332290`\spad{f02abf(a,ia,n,iv,ifail)} calculates all the eigenvalues of a real symmetric matrix. See \downlink{Manual Page}{manpageXXf02abf}.
332389`\spad{f02adf(ia,ib,n,a,b,ifail)} calculates all the eigenvalues of Ax=(lambda)Bx,{} where A is a real symmetric matrix and \spad{B} is a real symmetric positive- definite matrix. See \downlink{Manual Page}{manpageXXf02adf}.
332508`\spad{f02aef(ia,ib,n,iv,a,b,ifail)} calculates all the eigenvalues of Ax=(lambda)Bx,{} where A is a real symmetric matrix and \spad{B} is a real symmetric positive-definite matrix. See \downlink{Manual Page}{manpageXXf02aef}.
332635`\spad{f02aff(ia,n,a,ifail)} calculates all the eigenvalues of a real unsymmetric matrix. See \downlink{Manual Page}{manpageXXf02aff}.
332726`\spad{f02agf(ia,n,ivr,ivi,a,ifail)} calculates all the eigenvalues of a real unsymmetric matrix. See \downlink{Manual Page}{manpageXXf02agf}.
332833`\spad{f02ajf(iar,iai,n,ar,ai,ifail)} calculates all the eigenvalue. See \downlink{Manual Page}{manpageXXf02ajf}.
332952`\spad{f02akf(iar,iai,n,ivr,ivi,ar,ai,ifail)} calculates all the eigenvalues of a complex matrix. See \downlink{Manual Page}{manpageXXf02akf}.
333087`\spad{f02awf(iar,iai,n,ar,ai,ifail)} calculates all the eigenvalues of a complex Hermitian matrix. See \downlink{Manual Page}{manpageXXf02awf}.
333206`\spad{f02axf(ar,iar,ai,iai,n,ivr,ivi,ifail)} calculates all the eigenvalues of a complex Hermitian matrix. See \downlink{Manual Page}{manpageXXf02axf}.
333341`\spad{f02bbf(ia,n,alb,ub,m,iv,a,ifail)} calculates selected eigenvalues of a real symmetric matrix by reduction to tridiagonal form,{} bisection and inverse iteration,{} where the selected eigenvalues lie within a given interval. See \downlink{Manual Page}{manpageXXf02bbf}.
333472`\spad{f02bjf(n,ia,ib,eps1,matv,iv,a,b,ifail)} calculates all the eigenvalues and,{} if required,{} all the eigenvectors of the generalized eigenproblem Ax=(lambda)Bx where A and \spad{B} are real,{} square matrices,{} using the QZ algorithm. See \downlink{Manual Page}{manpageXXf02bjf}.
333619`\spad{f02fjf(n,k,tol,novecs,nrx,lwork,lrwork,liwork,m,noits,x,ifail,dot,image)} finds eigenvalues of a real sparse symmetric or generalized symmetric eigenvalue problem. See \downlink{Manual Page}{manpageXXf02fjf}.
333847`\spad{f02fjf(n,k,tol,novecs,nrx,lwork,lrwork,liwork,m,noits,x,ifail,dot,image,monit)} finds eigenvalues of a real sparse symmetric or generalized symmetric eigenvalue problem. See \downlink{Manual Page}{manpageXXf02fjf}.
334084`\spad{f02wef(m,n,lda,ncolb,ldb,wantq,ldq,wantp,ldpt,a,b,ifail)} returns all,{} or part,{} of the singular value decomposition of a general real matrix. See \downlink{Manual Page}{manpageXXf02wef}.
334252`\spad{f02xef(m,n,lda,ncolb,ldb,wantq,ldq,wantp,ldph,a,b,ifail)} returns all,{} or part,{} of the singular value decomposition of a general complex matrix. See \downlink{Manual Page}{manpageXXf02xef}.
334438`\spad{f04adf(ia,b,ib,n,m,ic,a,ifail)} calculates the approximate solution of a set of complex linear equations with multiple right-hand sides,{} using an LU factorization with partial pivoting. See \downlink{Manual Page}{manpageXXf04adf}.
334607`\spad{f04arf(ia,b,n,a,ifail)} calculates the approximate solution of a set of real linear equations with a single right-hand side,{} using an LU factorization with partial pivoting. See \downlink{Manual Page}{manpageXXf04arf}.
334734`\spad{f04asf(ia,b,n,a,ifail)} calculates the accurate solution of a set of real symmetric positive-definite linear equations with a single right- hand side,{} Ax=b,{} using a Cholesky factorization and iterative refinement. See \downlink{Manual Page}{manpageXXf04asf}.
334861`\spad{f04atf(a,ia,b,n,iaa,ifail)} calculates the accurate solution of a set of real linear equations with a single right-hand side,{} using an LU factorization with partial pivoting,{} and iterative refinement. See \downlink{Manual Page}{manpageXXf04atf}.
334996`\spad{f04axf(n,a,licn,icn,ikeep,mtype,idisp,rhs)} calculates the approximate solution of a set of real sparse linear equations with a single right-hand side,{} Ax=b or \indented{1}{\spad{T}} A x=b,{} where A has been factorized by F01BRF or F01BSF. See \downlink{Manual Page}{manpageXXf04axf}.
335171`\spad{f04faf(job,n,d,e,b,ifail)} calculates the approximate solution of a set of real symmetric positive-definite tridiagonal linear equations. See \downlink{Manual Page}{manpageXXf04faf}.
335318`\spad{f04jgf(m,n,nra,tol,lwork,a,b,ifail)} finds the solution of a linear least-squares problem,{} Ax=b ,{} where A is a real \spad{m} by \spad{n} (m>=n) matrix and \spad{b} is an \spad{m} element vector. If the matrix of observations is not of full rank,{} then the minimal least-squares solution is returned. See \downlink{Manual Page}{manpageXXf04jg
335318`--f}.
335473`\spad{f04maf(n,nz,avals,licn,irn,lirn,icn,wkeep,ikeep,inform,b,acc,noits,ifail)} \spad{e} a sparse symmetric positive-definite system of linear equations,{} Ax=b,{} using a pre-conditioned conjugate gradient method,{} where A has been factoriz
335473`--ed by F01MAF. See \downlink{Manual Page}{manpageXXf04maf}.
335737`\spad{f04mbf(n,b,precon,shift,itnlim,msglvl,lrwork,liwork,rtol,ifail,aprod,msolve)} solves a system of real sparse symmetric linear equations using a Lanczos algorithm. See \downlink{Manual Page}{manpageXXf04mbf}.
335972`\spad{f04mcf(n,al,lal,d,nrow,ir,b,nrb,iselct,nrx,ifail)} computes the approximate solution of a system of real linear equations with multiple right-hand sides,{} AX=B,{} where A is a symmetric positive-definite variable-bandwidth matrix,{} which has previously been factorized by F01MCF. Related systems may als
335972`--o be solved. See \downlink{Manual Page}{manpageXXf04mcf}.
336168`\spad{f04qaf(m,n,damp,atol,btol,conlim,itnlim,msglvl,lrwork,liwork,b,ifail,aprod)} solves sparse unsymmetric equations,{} sparse linear least- squares problems and sparse damped linear least-squares problems,{} using a Lanczos algorithm. See \downlink{Manual Page}{manpageXXf04qaf}.
336391`\spad{f07adf(m,n,lda,a)} (DGETRF) computes the LU factorization of a real \spad{m} by \spad{n} matrix. See \downlink{Manual Page}{manpageXXf07adf}.
336476`\spad{f07aef(trans,n,nrhs,a,lda,ipiv,ldb,b)} (DGETRS) solves a real system of linear equations with \indented{36}{\spad{T}} multiple right-hand sides,{} AX=B or A X=B,{} where A has been factorized by F07ADF (DGETRF). See \downlink{Manual Page}{manpageXXf07aef}.
336612`\spad{f07fdf(uplo,n,lda,a)} (DPOTRF) computes the Cholesky factorization of a real symmetric positive-definite matrix. See \downlink{Manual Page}{manpageXXf07fdf}.
336696`\spad{f07fef(uplo,n,nrhs,a,lda,ldb,b)} (DPOTRS) solves a real symmetric positive-definite system of linear equations with multiple right-hand sides,{} AX=B,{} where A has been factorized by F07FDF (DPOTRF). See \downlink{Manual Page}{manpageXXf07fef}.
336816`\spad{f2df(f)} is a function to convert a \axiomType{Float} to a \axiomType{DoubleFloat}
336881`\spad{f2st(n)} coerces a \axiomType{Float} to \axiomType{String}
336941`\spad{fTable(l)} creates a functions table from the elements of \spad{l}.
337798`\spad{factor1(a)} returns the factorisation of a,{} assuming that a has no first-order right factor.
338011`\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.
338088`\spad{factorByRecursion(p)} factors polynomial \spad{p}. This function performs the recursion step for factorPolynomial,{} as defined in \spadfun{PolynomialFactorizationExplicit} category (see \spadfun{factorPolynomial})
338242`\spad{factorByRecursion(p)} factors polynomial \spad{p}. This function performs the recursion step for factorPolynomial,{} as defined in \spadfun{PolynomialFactorizationExplicit} category (see \spadfun{factorPolynomial})
338397`\spad{factorFraction(r)} factors the numerator and the denominator of the polynomial fraction \spad{r}.
338517`\spad{factorGroebnerBasis(basis)} checks whether the \spad{basis} contains reducible polynomials and uses these to split the \spad{basis}.
338634`\spad{factorGroebnerBasis(basis,info)} checks whether the \spad{basis} contains reducible polynomials and uses these to split the \spad{basis}. If argument {\em info} is \spad{true},{} information is printed about partial results.
338759`\spad{factorList(u)} returns the list of factors with flags (for use by factoring code).
338876`\spad{factorList(k,n,m,j)} \undocumented
339045`\spad{factorOfDegree(d,f)} returns a factor of degree \spad{d} of the factored polynomial \spad{f}. Such a factor shall exist.
339146`\spad{factorOfDegree(d,p)} returns a factor of \spad{p} of degree \spad{d}.
339242`\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}.
339363`\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.
339478`\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.
339618`\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).
340154`\spad{factorPolynomial(p)} returns the factorization into irreducibles of the univariate polynomial \spad{p}.
340292`\spad{factorPolynomial(p)} \undocumented{}
340455`\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.
340609`\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.
340775`\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}).
340939`\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}).
341522`\spad{factorSquareFreePolynomial(p)} factors the univariate polynomial \spad{p} into irreducibles where \spad{p} is known to be square free and primitive with respect to its main variable.
341670`\spad{factorSquareFree(p)} factors an extended squareFree polynomial \spad{p} over the rational numbers.
341742`\spad{factorSquareFree(p)} returns the factorization of \spad{p} which is supposed not having any repeated factor (this is not checked).
341818`\spad{factorSquareFree(m)} returns the factorization of \spad{m} square free polynomial
341892`\spad{factorSquareFree(p)} produces the complete factorization of the square free polynomial \spad{p}.
341972`\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).
342073`\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).
342168`\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).
342288`\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).
342402`\spad{factor(n)} returns the full factorization of integer \spad{n}
342471`\spad{factor(a)} returns the factorisation of a.
342683`\axiom{factor(\spad{x})} returns the decreasing factorization into Lyndon words.
342761`\spad{factor(p)} factors the multivariate polynomial \spad{p} over its coefficient domain
342844`\spad{factor(p)} factors the multivariate polynomial \spad{p} with coefficients which are fractions of elements of \spad{R}.
342911`\spad{factor(p)} factors a polynomial with polynomial coefficients.
342988`\spad{factor(p)} factors an extended polynomial \spad{p} over the rational numbers.
343285`\spad{factor(p)} factors the univariate polynomial \spad{p} with coefficients which are fractions of polynomials over \spad{R}.
343431`\spad{factor(p)} returns the factorisation of \spad{p}
343542`\spad{factor(p)} tries to factor \spad{p} into linear factors with error atmost {\em globalEps},{} the internal error bound,{} which can be set by {\em setErrorBound}. An overall error bound {\em eps0} is determined and iterated tree-like calls to {\em pleskenSplit} are used to get the factorization.
343614`\spad{factor(p)} returns the factorization of \spad{p} over the integers.
343680`\spad{factor(m)} returns the factorization of \spad{m}
343744`\spad{factor(zi)} produces the complete factorization of the complex integer \spad{zi}.
343841`\spad{factor(p)} produces the complete factorization of the polynomial \spad{p}.
343911`\spad{factor(p)} factors the multivariate polynomial \spad{p} over its coefficient domain
343981`\spad{factor(p)} produces the complete factorization of the multivariate polynomial \spad{p} over a finite field.
344052`\spad{factor(p)} factorizes the polynomial \spad{p} with complex coefficients.
344120`\spad{factor(prf)} factors a polynomial with rational function coefficients.
344209`\spad{factor(p)} factors the multivariate polynomial \spad{p} over its coefficient domain where \spad{p} is represented as a univariate polynomial with multivariate coefficients
344335`\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.
344462`\spad{factor(p)} returns a prime factorisation of \spad{p} over the field generated by its coefficients.
344516`\spad{factor(p)} returns a prime factorisation of \spad{p}.
344583`\spad{factor(p)} returns a prime factorisation of \spad{p}.
344666`\spad{factor(p)} returns a prime factorisation of \spad{p}.
344754`\spad{factor(x)} returns the factorization of \spad{x} into irreducibles.
344820`\spad{factor(p, f)} returns a prime factorisation of \spad{p}; \spad{f} is a factorisation map for elements of UP.
344918`\spad{factor(a, zeros)} returns the factorisation of a. \spad{zeros} is a zero finder in \spad{UP}.
345113`\spad{factor(p,ufact)} factors the multivariate polynomial \spad{p} by specializing variables and calling the univariate factorizer \spad{ufact}.
345248`\spad{factor(p,ufact)} factors the multivariate polynomial \spad{p} by specializing variables and calling the univariate factorizer \spad{ufact}. \spad{p} is represented as a univariate polynomial with multivariate coefficients.
345439`\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}.
345530`\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.
345615`\spad{factor(p, eps)} tries to factor \spad{p} into linear factors with error atmost {\em eps}. An overall error bound {\em eps0} is determined and iterated tree-like calls to {\em pleskenSplit} are used to get the factorization.
345689`\spad{factor(p,lan)} factors the polynomial \spad{p} over the extension generated by the algebraic numbers given by the list \spad{lan}.
345775`\spad{factor(p,lan)} factors the polynomial \spad{p} over the extension generated by the algebraic numbers given by the list \spad{lan}. \spad{p} is presented as a univariate polynomial with multivariate coefficients.
345917`\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}.
345994`\spad{factor(p, [a1,...,an])} returns a prime factorisation of \spad{p} over the field generated by its coefficients and \spad{a1},{}...,{}an.
346070`\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.
346180`\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.
346284`\spad{factor(p, eps, info)} tries to factor \spad{p} into linear factors with error atmost {\em eps}. An overall error bound {\em eps0} is determined and iterated tree-like calls to {\em pleskenSplit} are used to get the factorization. If {\em info} is {\em true},{} then information messages are given.
346366`\spad{factorial(n)} returns the factorial of \spad{n},{} \spadignore{i.e.} n!.
346474`\spad{factorial(n)} returns \spad{n!}. this is the product of all integers between 1 and \spad{n} (inclusive). Note: \spad{0!} is defined to be 1.
346537`\spad{factorial(n)} computes the factorial of \spad{n} (denoted in the literature by \spad{n!}) Note: \spad{n! = n (n-1)! when n > 0}; also,{} \spad{0! = 1}.
346600`\spad{factorials(f)} rewrites the permutations and binomials in \spad{f} in terms of factorials.
346659`\spad{factorials(f)} rewrites the permutations and binomials in \spad{f} in terms of factorials.
346718`\spad{factorials(f, x)} rewrites the permutations and binomials in \spad{f} involving \spad{x} in terms of factorials.
346784`\spad{factorials(f, x)} rewrites the permutations and binomials in \spad{f} involving \spad{x} in terms of factorials.
346850`\spad{factorsOfCyclicGroupSize()} returns the factorization of size()\spad{-1}
346959`\spad{factorsOfDegree(d,f)} returns the factors of degree \spad{d} of the factored polynomial \spad{f}.
347067`\spad{factors(a1\^e1,...,an\^en)} returns \spad{[[a1, e1],...,[an, en]]}.
347140`\spad{factors(a1\^e1,...,an\^en)} returns \spad{[[a1, e1],...,[an, en]]}.
347233`\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})}).
347313`\spad{factorset(p)} returns the set of irreducible factors of \spad{p}.
347394`\spad{failed?(r)} tests if \spad{r} is a failed match.
347460`\spad{failed?(r)} tests if \spad{r} is a failed match.
347520`\spad{failed()} returns a failed match.
347578`\spad{failed()} returns a failed match.
347630`\spad{false} is a logical constant.
347676`\spad{ffactor(p)} tries to factor a univariate polynomial \spad{p} over \spad{F}
347765`\axiom{fglmIfCan(lp)} returns the lexicographical Groebner basis of \axiom{lp} by using the {\em FGLM} strategy,{} if \axiom{zeroDimensional?(lp)} holds .
347965`\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.
348071`\spad{fi2df(f)} coerces a \axiomType{Fraction Integer} to \axiomType{DoubleFloat}
348149`\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.
348305`\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.
348545`\spad{fill!(u,x)} replaces each entry in aggregate \spad{u} by \spad{x}. The modified \spad{u} is returned as value.
348645`\spad{fill!(m,r)} fills \spad{m} with \spad{r}'s
348715`\spad{fillPascalTriangle()} fills the stored table.
348781`\spad{filterUntil(p,t)} returns \spad{[x for x in t while not p(x)]}.
348846`\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}.
348904`\spad{filterWhile(p,t)} returns \spad{[x for x in t while p(x)]}.
348969`\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}.
349027`\spad{findBinding(c,n)} returns the first binding associated with `n'. Otherwise `nothing.
349093`\spad{findBinding(n,s)} returns the first binding of `n' in `s'; otherwise `nothing'.
349157`\spad{findConstructor(s)} attempts to find a constructor named \spad{s}. If successful,{} returns that constructor; otherwise,{} returns \spad{nothing}.
349223`\spad{findCycle(n,st)} determines if \spad{st} is periodic within \spad{n}.
349710`\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.
349780`\spad{finite?(\spad{a})} determines whether \spad{a} is a finite cardinal,{} \spadignore{i.e.} an integer.
349831`\spad{finite?(x)} tests if \spad{x} is finite.
349889`\spad{finite?(x)} tests if \spad{x} is finite.
349946`\spad{finiteBasis(d)} returns a basis for \spad{d} as a module over {\em K[x]}.
350015`\spad{finiteBound(l,b)} repaces all instances of an infinite entry in \axiom{\spad{l}} by a finite entry \axiom{\spad{b}} or \axiom{-b}.
350128`\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.}
350256`\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.}
350361`\spad{firstDenom(p)} extracts the denominator of the first fractional term. This returns 1 if there is no fractional part (use \spadfunFrom{wholePart}{PartialFraction} to get the whole part).
350423`\spad{firstNumer(p)} extracts the numerator of the first fractional term. This returns 0 if there is no fractional part (use \spadfunFrom{wholePart}{PartialFraction} to get the whole part).
350475`\spad{firstSubsetGray(n)} creates the first vector {\em ww} to start a loop using {\em nextSubsetGray(ww,n)}
350557`\spad{firstUncouplingMatrix(op, m)} returns the matrix A such that \spad{A w = (W',W'',...,W^N)} in the corresponding associated equations for right-factors of order \spad{m} of \spad{op}. Returns "failed" if the matrix A has not been precomputed for the particular combination \spad{degree(L), m}.
350899`\spad{first([l1]*[l2]*...[ln])} returns the Lyndon word \spad{l1}.
350984`\spad{first(x)} returns the first letter of \spad{x}.
351033`\axiom{first(\spad{x})} returns the first entry of the tree \axiom{\spad{x}}.
351080`\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.
351163`\spad{first(u)} returns the first element of \spad{u} (equivalently,{} the value at the current node).
351218`\spad{first(p)} extracts the first component of `p'.
351256`\axiom{first(ts)} returns the polynomial of \axiom{ts} with greatest main variable if \axiom{ts} is not empty,{} otherwise returns \axiom{"failed"}.
351461`\spad{first(u,n)} returns a copy of the first \spad{n} (\axiom{\spad{n} >= 0}) elements of \spad{u}.
351536`\spad{fixPredicate(f)} returns \spad{g} defined by \spad{g}(a) = \spad{f}(a::B).
351620`\spad{fixedDivisor(a)} for \spad{a(x)} in \spad{Z[x]} is the largest integer \spad{f} such that \spad{f} divides \spad{a(x=k)} for all integers \spad{k}. Note: fixed divisor of \spad{a} is \spad{reduce(gcd,[a(x=k) for k in 0..degree(a)])}.
351726`\spad{fixedPointExquo(f,g)} computes the exact quotient of \spad{f} and \spad{g} using a fixed point computation.
351813`\spad{fixedPoint f} is the fixed point of function \spad{f}. \indented{1}{\spadignore{i.e.} such that \spad{fixedPoint f = f(fixedPoint f)}.}
351869`\spad{fixedPoint(f,n)} is the fixed point of function \indented{1}{\spad{f} which is assumed to transform a list of length} \indented{1}{\spad{n}.}
351951`\spad{fixedPoints(p)} returns the points fixed by the permutation \spad{p}.
352018`\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}.
352107`\spad{flatten(s)} returns an input form corresponding to \spad{s} with all the nested operations flattened to triples using new local variables. If \spad{s} is a piece of code,{} this speeds up the compilation tremendously later on.
352148`\spad{flexible?()} tests if \spad{2*associator(a,b,a) = 0} for all \spad{a},{} \spad{b} in the algebra. Note: we only can test this; in general we don't know whether \spad{2*a=0} implies \spad{a=0}.
352222`\spad{flexible?()} tests if \spad{2*associator(a,b,a) = 0} for all \spad{a},{} \spad{b} in the algebra. Note: we only can test this; in general we don't know whether \spad{2*a=0} implies \spad{a=0}.
352293`\spad{flexibleArray(l)} creates a flexible array from the list of elements \spad{l}
352416`\spad{float?(s)} is \spad{true} if \spad{s} is an atom and belong to Flt.
352493`\spad{float(s)} returns \spad{s} as an element of Flt; Error: if \spad{s} is not an atom that also belongs to Flt.
352625`\spad{float(a,e)} returns \spad{a * base() ** e}.
352763`\spad{float(a,e,b)} returns \spad{a * b ** e}.
352884`\spad{floor(x)} returns the largest integral element below \spad{x}.
352963`\spad{floor x} returns the largest integer \spad{<= x}.
353009`\spad{fmecg(p1,e,r,p2)} finds \spad{X} : \spad{p1} - \spad{r} * X**e * \spad{p2}
353124`\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)}
353210`\spad{fmecg(p1,e,r,p2)} finds \spad{X} : \spad{p1} - \spad{r} * X**e * \spad{p2}
353422`\spad{fmecg(p1,e,r,p2)} finds \spad{X} : \spad{p1} - \spad{r} * X**e * \spad{p2}
353501`\spad{forLoop(i=1..10,c)} creates a representation of a FORTRAN DO loop with \spad{i} ranging over the values 1 to 10.
353580`\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}.
353679`\spad{formfeed} designates the form feed character.
353719`\spad{fortranCarriageReturn()} produces a carriage return on the current Fortran output stream
353780`\spad{fortranCharacter()} returns CHARACTER,{} an element of FortranType
353830`\spad{fortranCompilerName()} returns the name of the currently selected \indented{1}{Fortran compiler}
353897`\spad{fortranComplex()} returns COMPLEX,{} an element of FortranType
353945`\spad{fortranDoubleComplex()} returns DOUBLE COMPLEX,{} an element of FortranType
353999`\spad{fortranDouble()} returns DOUBLE PRECISION,{} an element of FortranType
354046`\spad{fortranInteger()} returns INTEGER,{} an element of FortranType
354094`\spad{fortranLinkerArgs()} returns the current linker arguments
354159`\spad{fortranLiteralLine(s)} writes \spad{s} to the current Fortran output stream,{} followed by a carriage return
354223`\spad{fortranLiteral(s)} writes \spad{s} to the current Fortran output stream
354283`\spad{fortranLogical()} returns LOGICAL,{} an element of FortranType
354331`\spad{fortranReal()} returns REAL,{} an element of FortranType
354376`\spad{fortranTypeOf(u,tab)} returns the type of \spad{u} in \spad{tab}
354441`\spad{fortran(fname,ftype,body)} builds an object of type \axiomType{FortranProgramCategory}. The three arguments specify the name,{} the type and the \spad{body} of the program.
354524`\spad{fprindINFO }\undocumented
354716`\spad{fracPart(f)} returns the list of summands of the fractional part of \spad{f}.
354839`\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...}.
354917`\spad{fractRagits(rx)} returns the ragits of the fractional part of a radix expansion.
354984`\spad{fractionFreeGauss(m)} performs the fraction free gaussian elimination on the matrix \spad{m}.
355194`\spad{fractionPart(b)} returns the fractional part of a binary expansion.
355261`\spad{fractionPart(d)} returns the fractional part of a decimal expansion.
355329`\spad{fractionPart(h)} returns the fractional part of a hexadecimal expansion.
355401`\spad{fractionPart(rx)} returns the fractional part of a radix expansion.
355471`\spad{fractionPart(x)} returns the fractional part of \spad{x}. \spad{x} = wholePart(\spad{x}) + fractionPart(\spad{x})
355554`\spad{fractionPart x} returns the fractional part of \spad{x}.
355716`\spad{freeOf?(x, s)} tests if \spad{x} does not contain any operator whose name is \spad{s}.
355775`\spad{freeOf?(x, y)} tests if \spad{x} does not contain any occurrence of \spad{y},{} where \spad{y} is a single kernel.
355830`\spad{frobenius(x)} \undocumented
355905`\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.
355951`\spad{froot(f, n)} returns \spad{[m,c,r]} such that \spad{f**(1/n) = c * r**(1/m)}.
356092`\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.
356142`\spad{fullDisplay(db)} prints full details of each entry in \axiom{\spad{db}}.
356191`\spad{fullDisplay(ic)} prints all of the information contained in \axiom{\spad{ic}}.
356238`\spad{fullDisplay(db,start,end )} prints full details of entries in the range \axiom{\spad{start}..end} in \axiom{\spad{db}}.
356319`\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}.
356407`\spad{functionIsContinuous
356407`--AtEndPoints(args)} uses power series limits to check for problems at the end points of the range of \spad{args}.
356888`\spad{functionIsFracPolynomial?(args)} tests whether the function can be retracted to \axiomType{Fraction(Polynomial(DoubleFloat))}
357099`\spad{functionIsOscillatory(a)} tests whether the function \spad{a.fn} has many zeros of its derivative.
357291`\spad{function(e, foo)} creates a function \spad{foo() == e}.
357349`\spad{function(code, [x1,...,xn], f)} returns the input form corresponding to \spad{f(x1,...,xn) == code}.
357411`\spad{function(e, foo, [x1,...,xn])} creates a function \spad{foo(x1,...,xn) == e}.
357482`\spad{function(e, foo, x)} creates a function \spad{foo(x) == e}.
357547`\spad{function(e, foo, x, y)} creates a function \spad{foo(x, y) = e}.
357619`\spad{functorData x} returns the functor data associated with the domain constructor \spad{x}.
357681`\spad{gbasis }\undocumented
357790`\spad{gcdPolynomial(p,q)} returns the GCD of \spad{p} and \spad{q}
358801`\spad{gcdPolynomial(p,q)} returns the gcd of the univariate polynomials \spad{p} qnd \spad{q}.
358957`\spad{gcdPrimitive lp} computes the gcd of the list of primitive polynomials lp.
359028`\spad{gcdPrimitive(p,q)} computes the gcd of the primitive polynomials \spad{p} and \spad{q}.
359095`\spad{gcdPrimitive(p,q)} computes the gcd of the primitive polynomials \spad{p} and \spad{q}.
359246`\spad{gcd([f1,..,fk])} = gcd of the polynomials \spad{fi}.
359290`\spad{gcd(lp)} computes the gcd of the list of polynomials \spad{lp}.
359538`\spad{gcd(lp)} computes the gcd of the list of polynomials \spad{lp}.
359656`\spad{gcd(l)} returns the common gcd of the elements in the list \spad{l}.
359699`\spad{gcd(p,q)} computes the gcd of the two polynomials \spad{p} and \spad{q}.
359987`\spad{gcd(p,q)} computes the gcd of the two polynomials \spad{p} and \spad{q}.
360129`\axiom{gcd(\spad{P},{} \spad{Q})} returns the gcd of \axiom{\spad{P}} and \axiom{\spad{Q}}.
360213`\axiom{gcd(\spad{r},{}\spad{p})} returns the gcd of \axiom{\spad{r}} and the content of \axiom{\spad{p}}.
360292`\spad{gcd(x,y)} returns the greatest common divisor of \spad{x} and \spad{y}.
360332`\spad{gcd(a,b)} computes the greatest common divisor of two non negative integers \spad{a} and \spad{b}.
360381`\spad{gcd(a,b)} computes the greatest common divisor of two positive integers \spad{a} and \spad{b}.
360427`\spad{gcd(f1,f2,p)} computes the gcd of the univariate polynomials \spad{f1} and \spad{f2} modulo the integer prime \spad{p}.
360497`\spad{gcdcofact([f1,..fk])} = gcd and cofactors of \spad{k} univariate polynomials.
360553`\spad{gcdcofactprim([f1,..fk])} = gcd and cofactors of \spad{k} primitive polynomials.
360613`\spad{gcdprim([f1,..,fk])} = gcd of \spad{k} PRIMITIVE univariate polynomials
360661`\spad{gderiv(f,[a0,a1,a2,..])} returns \spad{[f(0)*a0,f(1)*a1,f(2)*a2,..]}.
360750`\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.
360860`\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.
360968`\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.
361074`\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.
361174`\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.
361274`\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.}
361365`\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.
361506`\spad{generalSqFr(p)} returns the square-free factorisation of polynomial \spad{p},{} a sparse univariate polynomial (sup) over a sup over \spad{F}.
361677`\spad{generalTwoFactor(p)} returns the factorisation of polynomial \spad{p},{} a sparse univariate polynomial (sup) over a sup over \spad{F}.
361853`\spad{generalizedContinuumHypothesisAssumed?()} tests if the hypothesis is currently assumed.
361933`\spad{generalizedContinuumHypothesisAssumed(bool)} is used to dictate whether the hypothesis is to be assumed.
362019`\spad{generalizedEigenvector(eigen,m)} returns the generalized eigenvectors of the matrix relative to the eigenvalue \spad{eigen},{} as returned by the function eigenvectors.
362294`\spad{generalizedEigenvector(alpha,m,k,g)} returns the generalized eigenvectors of the matrix relative to the eigenvalue \spad{alpha}. The integers \spad{k} and \spad{g} are respectively the algebraic and the geometric multiplicity of tye eigenvalue \spad{alpha}. \spad{alpha} can 
362294`--be either rational or not. In the seconda case apha is the minimal polynomial of the eigenvalue.
362520`\spad{generalizedEigenvectors(m)} returns the generalized eigenvectors of the matrix \spad{m}.
362740`\spad{generalizedInverse(m)} returns the generalized (Moore
362740`--Penrose) inverse of the matrix \spad{m},{} \spadignore{i.e.} the matrix \spad{h} such that m*h*m=h,{} h*m*h=m,{} m*h and h*m are both symmetric matrices.
362827`\spad{generateIrredPoly(n)} generates an irreducible univariate polynomial of the given degree \spad{n} over the finite field.
362938`\spad{generate(f)} creates an infinite stream all of whose elements are equal to \spad{f()}. Note: \spad{generate(f) = [f(),f(),f(),...]}.
362983`\spad{generate(f,s)} returns \spad{[s,f(s),f(f(s)),...]}.
363038`\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)),...]}.
363086`\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
363233`\spad{generator()} returns a root of the defining polynomial. This element generates the field as an algebra over the ground field.
363310`\spad{generator()} returns the generator for this domain.
363364`\spad{generator(n)} returns the \spad{n}th multiplicative generator,{} a basis term.
363430`\spad{generator(n)} returns the \spad{n}th basis term for a differential form.
363514`\spad{generator(i)} is the \spad{i}th Hall Basis element
363591`\spad{generator(d)} returns \spad{f} if \spad{(f) = d},{} "failed" if \spad{d} is not principal.
363674`\spad{generators(I)} returns a list of generators for the ideal \spad{I}.
363756`\spad{generators(gp)} returns the generators of the group {\em gp}.
363828`\spad{generic?(p)} tests if \spad{p} is a single matching variable.
363876`\spad{genericLeftDiscriminant()} is the determinant of the generic left trace forms of all products of basis element,{} if the generic left trace form is associative,{} an algebra is separable if the generic left discriminant is invertible,{} if it is non-zero,{} there is some ring extension which makes the algebra separable
364006`\spad{genericLeftMinimalPolynomial(a)} substitutes the coefficients of {em a} for the generic coefficients in \spad{leftRankPolynomial()}
364171`\spad{genericLeftNorm(a)} substitutes the coefficients of \spad{a} for the generic coefficients into the coefficient of the constant term in \spadfun{leftRankPolynomial} and changes the sign if the degree of this polynomial is odd. This is a form of degree \spad{k}
364295`\spad{genericLeftTraceForm (a,b)} is defined to be \spad{genericLeftTrace (a*b)},{} this defines a symmetric bilinear form on the algebra
364427`\spad{genericLeftTrace(a)} substitutes the coefficients of \spad{a} for the generic coefficients into the coefficient of the second highest term in \spadfun{leftRankPolynomial} and changes the sign. \indented{1}{This is a linear form}
364552`\spad{genericPosition(lp,lv)} puts a radical zero dimensional ideal in general position,{} for system \spad{lp} in variables \spad{lv}.
364765`\spad{genericRightDiscriminant()} is the determinant of the generic left trace forms of all products of basis element,{} if the generic left trace form is associative,{} an algebra is separable if the generic left discriminant is invertible,{} if it is non-zero,{} there is some ring extension which makes the algebra separable
364896`\spad{genericRightMinimalPolynomial(a)} substitutes the coefficients of \spad{a} for the generic coefficients in \spadfun{rightRankPolynomial}
365062`\spad{genericRightNorm(a)} substitutes the coefficients of \spad{a} for the generic coefficients into the coefficient of the constant term in \spadfun{rightRankPolynomial} and changes the sign if the degree of this polynomial is odd
365187`\spad{genericRightTraceForm (a,b)} is defined to be \spadfun{genericRightTrace (a*b)},{} this defines a symmetric bilinear form on the algebra
365320`\spad{genericRightTrace(a)} substitutes the coefficients of \spad{a} for the generic coefficients into the coefficient of the second highest term in \spadfun{rightRankPolynomial} and changes the sign
365446`\spad{generic()} returns a generic element,{} \spadignore{i.e.} the linear combination of the fixed basis with the symbolic coefficients \spad{\%x1,\%x2,..}
365518`\spad{generic(s)} returns a generic element,{} \spadignore{i.e.} the linear combination of the fixed basis with the symbolic coefficients \spad{s1,s2,..}
365596`\spad{generic(vs)} returns a generic element,{} \spadignore{i.e.} the linear combination of the fixed basis with the symbolic coefficients \spad{vs}; error,{} if the vector of symbols is too short
365682`\spad{generic(ve)} returns a generic element,{} \spadignore{i.e.} the linear combination of \spad{ve} basis with the symbolic coefficients \spad{\%x1,\%x2,..}
365764`\spad{generic(s,v)} returns a generic element,{} \spadignore{i.e.} the linear combination of \spad{v} with the symbolic coefficients \spad{s1,s2,..}
365853`\spad{generic(vs,ve)} returns a generic element,{} \spadignore{i.e.} the linear combination of \spad{ve} with the symbolic coefficients \spad{vs} error,{} if the vector of symbols is shorter than the vector of elements
365950`\spad{gensym()} returns a new identifier,{} different from any other identifier in the running system
365989`\spad{genus()} returns the genus of one absolutely irreducible component
366068`\spad{genus()} returns the genus of one absolutely irreducible component
366144`\spad{geometric(f)} \undocumented
366225`\spad{getBadValues(p)} returns the list of "bad values" for \spad{p}. Note: \spad{p} is not allowed to match any of its "bad values".
366279`\axiom{getButtonValue(routineName,{}attributeName)} returns the current value for the effect of the attribute \axiom{attributeName} with routine \axiom{routineName}. \blankline \axiom{attributeName} should be one of the values "stiffness",{} "stability",{} "accuracy",{} "expense" or "functionEvaluations".
366348`\spad{getCode(f)} returns a Lisp list of strings representing \spad{f} in Fortran notation. This is used by the FortranProgram domain.
366400`\spad{getConstant(e)} retrieves the constant value of `e'e.
366481`\spad{getCurve(t)} returns the \spadtype{PlottableSpaceCurveCategory} representing the parametric curve of the given tube plot \spad{t}.
366532`\spad{getDatabase("char")} returns a list of appropriate entries in the browser database. The legal values for \spad{"char"} are "o" (operations),{} "k" (constructors),{} "d" (domains),{} "c" (categories) or "p" (packages).
366604`\spad{getExplanations(R,s)} gets the explanations of the output parameters for the given NAG routine.
366674`\spad{getGoodPrime n} returns the smallest prime not dividing \spad{n}
366762`\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}.
366841`\spad{getIdentifier(e)} retrieves the name of the variable `e'.
366923`\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}.
367005`\spad{getMeasure(R,s)} gets the current value of the maximum measure for the given NAG routine.
367063`\spad{getMultiplicationMatrix()} returns the multiplication table in form of a matrix.
367159`\spad{getMultiplicationMatrix()} returns the multiplication table in form of a matrix.
367264`\spad{getMultiplicationMatrix()} returns the multiplication table in form of a matrix.
367361`\spad{getMultiplicationTable()} returns the multiplication table for the normal basis of the field. This table is used to perform multiplications between field elements.
367496`\spad{getMultiplicationTable()} returns the multiplication table for the normal basis of the field. This table is used to perform multiplications between field elements.
367640`\spad{getMultiplicationTable()} returns the multiplication table for the normal basis of the field. This table is used to perform multiplications between field elements.
367776`\spad{getOperands(x)} returns the list of operands to the operator in `x'.
367824`\spad{getOperands(e)} returns the list of operands in `e',{} assuming it is a call form.
367902`\spad{getOperator(e)} retrieves the operator being invoked in `e',{} when `e' is an expression.
367982`\spad{getOperator(x)} returns the operator,{} or tag,{} of the syntax `x'. The value returned is itself a syntax if `x' really is an application of a function symbol as opposed to being an atomic ground term.
368069`\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])}.
368159`\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.
368243`\spad{getBinding(n,e)} returns the list of properties of \spad{n} in \spad{e}.
368315`\spad{getProperty(n,p,e)} returns the value of property with name \spad{p} for the symbol \spad{n} in environment \spad{e}. Otherwise,{} \spad{nothing}.
368400`\spad{getRef(f)} returns a reference containing the order to which the terms of \spad{f} have been computed.
368504`\spad{getStream(f)} returns the stream of terms representing the series \spad{f}.
368606`\spad{getSyntaxFormsFromFile(f)} parses the source file \spad{f} (supposedly containing Spad scripts) and returns a List Syntax. The filename \spad{f} is supposed to have the proper extension. Note that source location information is not part of result.
368673`\spad{getVariableOrder()} returns \spad{[[b1,...,bm], [a1,...,an]]} such that the ordering on the variables was given by \spad{setVariableOrder([b1,...,bm], [a1,...,an])}.
368779`\spad{getZechTable()} returns the zech logarithm table of the field. This table is used to perform additions in the field quickly.
368883`\spad{getZechTable()} returns the zech logarithm table of the field it is used to perform additions in the field quickly.
368999`\spad{getZechTable()} returns the zech logarithm table of the field. This table is used to perform additions in the field quickly.
369093`\spad{gethi(u)} gets the \axiomType{DoubleFloat} equivalent of the second endpoint of the range \axiom{\spad{u}}
369198`\spad{gethi(u)} gets the \axiomType{DoubleFloat} equivalent of the second endpoint of the range \spad{u}
369298`\spad{gethi(x)} gets the \axiomType{DoubleFloat} equivalent of the second endpoint of the range \axiom{\spad{x}}
369390`\spad{getlo(u)} gets the \axiomType{DoubleFloat} equivalent of the first endpoint of the range \axiom{\spad{u}}
369495`\spad{getlo(u)} gets the \axiomType{DoubleFloat} equivalent of the first endpoint of the range \spad{u}
369595`\spad{getlo(x)} gets the \axiomType{DoubleFloat} equivalent of the first endpoint of the range \axiom{\spad{x}}
369687`\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}.
369754`\spad{goodnessOfFit(prob)} is a top level ANNA function to check to goodness of fit of a least squares model as defined within \axiom{\spad{prob}}. \blankline It iterates over the \axiom{domains} of \axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \axiom{measure} and then optimize the function on that \axiom{domain}. It then calls the numerical routine 
369754`--\axiomType{E04YCF} to get estimates of the variance-covariance matrix of the regression coefficients of the least-squares problem. \blankline It thus returns both the results of the optimization and the variance-covariance calculation.
369854`\spad{goodnessOfFit(lf,start)} is a top level ANNA function to check to goodness of fit of a least squares model \spadignore{i.e.} the minimization of a set of functions,{} \axiom{\spad{lf}},{} of one or more variables without constraints. \blankline The parameter \axiom{\spad{start}} is a list of the initial guesses of the values of the variables. \blankline It iterates over the \axiom{domains} o
369854`--f \axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \axiom{measure} and then optimize the function on that \axiom{domain}. It then calls the numerical routine \axiomType{E04YCF} to get estimates of the variance-covariance matrix of the regression coefficients of the least-squares problem. \blankline It thus returns both the results of the optimization and the variance-covariance calculation. goodnessOfFit(\spad{lf},{}\spad{start}) is a top lev
369854`--el function to iterate over the \axiom{domains} of \axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \axiom{measure} and then optimize the function on that \axiom{domain}. It then checks the goodness of fit of the least squares model.
369961`\spad{goto(l)} creates a representation of a FORTRAN GOTO statement
370012`\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}.
370101`\spad{graeffe p} determines \spad{q} such that \spad{q(-z**2) = p(z)*p(-z)}. Note that the roots of \spad{q} are the squares of the roots of \spad{p}.
370164`\spad{gramschmidt(lv)} converts the list of column vectors \spad{lv} into a set of orthogonal column vectors of euclidean length 1 using the Gram-Schmidt algorithm.
370281`\spad{graphCurves([[p0],[p1],...,[pn]])} creates a \spadtype{GraphImage} from the list of lists of points indicated by \spad{p0} through pn.
370368`\spad{graphCurves([[p0],[p1],...,[pn]],[options])} creates a \spadtype{GraphImage} from the list of lists of points,{} \spad{p0} throught pn,{} using the options specified in the list \spad{options}.
370472`\spad{graphCurves([[p0],[p1],...,[pn]],ptColor,lineColor,ptSize,[options])} creates a \spadtype{GraphImage} from the list of lists of points,{} \spad{p0} throught pn,{} using the options specified in the list \spad{options}. The graph point color is specified by \spad{ptColor},{} the graph line color is specified by \spad{lineColor},{} and the size of the points is spe
370472`--cified by \spad{ptSize}.
370608`\spad{graphImage()} returns an empty graph with 0 point lists of the domain \spadtype{GraphImage}. A graph image contains the graph data component of a two dimensional viewport.
370651`\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} 
370651`--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 co
370651`--lor 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}.
370839`\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{TwoDi
370839`--mensionalViewport}.
371112`\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.
371200`\spad{graphs n} is the cycle index of the group induced on \indented{1}{the edges of a graph by applying the symmetric function to the} \indented{1}{\spad{n} nodes.}
371295`\spad{green()} returns the position of the green hue from total hues.
371328`\spad{green(c)} returns the `green' component of `c'.
371373`\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}.
371551`\spad{groebgen }\undocumented
371729`\spad{groebner?(I)} tests if the generators of the ideal \spad{I} are a Groebner basis.
371806`\spad{groebnerFactorize(listOfPolys)} returns a list of groebner bases. The union of their solutions is the solution of the system of equations given by {\em listOfPolys}. At each stage the polynomial \spad{p} under consideration (either from the given basis or obtained from a reduction of the next \spad{S}-polynomial) is factorized. For each irreducible factors of \spad{p},{} a new {\em c
371806`--reateGroebnerBasis} is started doing the usual updates with the factor in place of \spad{p}.
371921`\spad{groebnerFactorize(listOfPolys, info)} returns a list of groebner bases. The union of their solutions is the solution of the system of equations given by {\em listOfPolys}. At each stage the polynomial \spad{p} under consideration (either from the given basis or obtained from a reduction of the next \spad{S}-polynomial) is factorized. For each irreducible factors of \spad{p},{
371921`--} a new {\em createGroebnerBasis} is started doing the usual updates with the factor in place of \spad{p}. If {\em info} is \spad{true},{} information is printed about partial results.
372044`\spad{groebnerFactorize(listOfPolys, nonZeroRestrictions)} returns a list of groebner basis. The union of their solutions is the solution of the system of equations given by {\em listOfPolys} under the restriction that the polynomials of {\em nonZeroRestrictions} don't vanish. At each stage the polynomial \spad{p} under consideration (either from the given basis or obtained from
372044`-- a reduction of the next \spad{S}-polynomial) is factorized. For each irreducible factors of \spad{p},{} a new {\em createGroebnerBasis} is started doing the usual updates with the factor in place of \spad{p}.
372170`\spad{groebnerFactorize(listOfPolys, nonZeroRestrictions, info)} returns a list of groebner basis. The union of their solutions is the solution of the system of equations given by {\em listOfPolys} under the restriction that the polynomials of {\em nonZeroRestrictions} don't vanish. At each stage the polynomial \spad{p} under consideration (either from the given basis or
372170`-- obtained from a reduction of the next \spad{S}-polynomial) is factorized. For each irreducible factors of \spad{p} a new {\em createGroebnerBasis} is started doing the usual updates with the factor in place of \spad{p}. If argument {\em info} is \spad{true},{} information is printed about partial results.
372304`\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.
372389`\axiom{groebner(lp)} returns the lexicographical Groebner basis of \axiom{lp}. If \axiom{lp} generates a zero-dimensional ideal then the {\em FGLM} strategy is used,{} otherwise the {\em Sugar} strategy is used.
372572`\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.
372661`\spad{groebner(lp)} computes a groebner basis for a polynomial ideal generated by the list of polynomials \spad{lp}.
372748`\spad{groebner(I)} returns a set of generators of \spad{I} that are a Groebner basis for \spad{I}.
372819`\spad{groebner(lp, infoflag)} computes a groebner basis for a polynomial ideal generated by the list of polynomials \spad{lp}. Argument infoflag is used to get information on the computation. If infoflag is "info",{} then summary information is displayed for each \spad{s}-polynomial generated. If infoflag is "redcrit",{} the reduced critical pairs are displayed. If infoflag is any other string,{} no informatio
372819`--n is printed during computation.
372913`\spad{groebner(lp, "info", "redcrit")} computes a groebner basis for a polynomial ideal generated by the list of polynomials \spad{lp},{} displaying both a summary of the critical pairs considered (\spad{"info"}) and the result of reducing each critical pair ("redcrit"). If the second or third arguments have any other string value,{} the indicated information is suppressed.
373126`\spad{ground?(p)} tests if polynomial \spad{p} is a member of the coefficient ring.
373191`\spad{ground?(f)} tests if \spad{f} is an element of \spad{R}.
373342`\spad{ground(p)} retracts polynomial \spad{p} to the coefficient ring.
373400`\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}.
373446`\spad{hMonic }\undocumented
373527`\axiom{\spad{halfExtendedResultant1}(a,{}\spad{b})} returns \axiom{[\spad{r},{}ca]} such that \axiom{extendedResultant(a,{}\spad{b})} returns \axiom{[\spad{r},{}ca,{} cb]}
373656`\axiom{\spad{halfExtendedResultant2}(a,{}\spad{b})} returns \axiom{[\spad{r},{}ca]} such that \axiom{extendedResultant(a,{}\spad{b})} returns \axiom{[\spad{r},{}ca,{} cb]}
373785`\axiom{\spad{halfExtendedSubResultantGcd1}(a,{}\spad{b})} returns \axiom{[\spad{g},{}ca]} such that \axiom{extendedSubResultantGcd(a,{}\spad{b})} returns \axiom{[\spad{g},{}ca,{} cb]}
373915`\axiom{\spad{halfExtendedSubResultantGcd1}(a,{}\spad{b})} returns \axiom{[\spad{g},{}ca]} if \axiom{extendedSubResultantGcd(a,{}\spad{b})} returns \axiom{[\spad{g},{}ca,{}cb]} otherwise produces an error.
374047`\axiom{\spad{halfExtendedSubResultantGcd2}(a,{}\spad{b})} returns \axiom{[\spad{g},{}cb]} such that \axiom{extendedSubResultantGcd(a,{}\spad{b})} returns \axiom{[\spad{g},{}ca,{} cb]}
374177`\axiom{\spad{halfExtendedSubResultantGcd2}(a,{}\spad{b})} returns \axiom{[\spad{g},{}cb]} if \axiom{extendedSubResultantGcd(a,{}\spad{b})} returns \axiom{[\spad{g},{}ca,{}cb]} otherwise produces an error.
374309`\spad{harmonic(n)} returns the \spad{n}th harmonic number. This is \spad{H[n] = sum(1/k,k=1..n)}.
374390`\spad{has?(op,p)} tests if property \spad{s} is attached to \spad{op}.
374448`\spad{hasHi(s)} tests whether the segment \spad{s} has an upper bound.
374502`\spad{hasPredicate?(p)} tests if \spad{p} has predicates attached to it.
374555`\spad{hasSolution?(A,B)} tests if the linear system \spad{AX = B} has a solution.
374638`\spad{hasSolution?(A,B)} tests if the linear system \spad{AX = B} has a solution.
374726`\spad{hasTopPredicate?(p)} tests if \spad{p} has a top-level predicate.
374831`\spad{hash(s)} calculates a hash code for \spad{s}.
374882`\spad{hasoln(g, l)} tests whether the quasi-algebraic set defined by \spad{p} = 0 for \spad{p} in \spad{g} and \spad{q} ~= 0 for \spad{q} in \spad{l} is empty or not and returns a simplified definition of the quasi-algebraic set
375012`\spad{hclf(x, y)} returns the highest common left factor of \spad{x} and \spad{y},{} \spadignore{i.e.} the largest \spad{d} such that \spad{x = d a} and \spad{y = d b}.
375065`\spad{hconcat(u)} horizontally concatenates all forms in list \spad{u}.
375113`\spad{hconcat(f,g)} horizontally concatenate forms \spad{f} and \spad{g}.
375158`\spad{hcrf(x, y)} returns the highest common right factor of \spad{x} and \spad{y},{} \spadignore{i.e.} the largest \spad{d} such that \spad{x = a d} and \spad{y = b d}.
375211`\spad{hdmpToDmp(p)} converts \spad{p} from a \spadtype{HDMP} to a \spadtype{DMP}.
375344`\spad{hdmpToP(p)} converts \spad{p} from a \spadtype{HDMP} to a \spadtype{POLY}.
375449`\spad{headAst(f,[x1,..,xn])} constructs a function definition header.
375645`\axiom{headReduce(\spad{p},{}ts)} returns a polynomial \axiom{\spad{r}} such that \axiom{headReduce?(\spad{r},{}ts)} holds and there exists some product \axiom{\spad{h}} of \axiom{initials(ts)} such that \axiom{h*p - \spad{r}} lies in the ideal generated by \axiom{ts}.
375711`\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}}.
375852`\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}}.
376151`\axiom{headReduced?(\spad{p},{}ts)} returns \spad{true} iff the head of \axiom{\spad{p}} is reduced \spad{w}.\spad{r}.\spad{t}. \axiom{ts}.
376225`\axiom{headReduced?(\spad{q},{}lp)} returns \spad{true} iff \axiom{headReduced?(\spad{q},{}\spad{p})} holds for every \axiom{\spad{p}} in \axiom{lp}.
376310`\axiom{headReduced?(a,{}\spad{b})} returns \spad{true} iff \axiom{degree(head(a),{}mvar(\spad{b})) < mdeg(\spad{b})}.
376478`\axiom{headRemainder(a,{}ps)} returns \axiom{[\spad{b},{}\spad{r}]} such that the leading monomial of \axiom{\spad{b}} is reduced in the sense of Groebner bases \spad{w}.\spad{r}.\spad{t}. \axiom{ps} and \axiom{r*a - \spad{b}} lies in the ideal generated by \axiom{ps}.
376650`\spad{head(d)} returns the head of the definition `d'. This is a list of identifiers starting with the name of the operation followed by the name of the parameters,{} if any.
376697`\spad{head(m)} returns the head of the macro definition `m'. This is a list of identifiers starting with the name of the macro followed by the name of the parameters,{} if any.
376739`\spad{head(l)} returns the first element of a doubly-linked aggregate \spad{l}. Error: if \spad{l} is empty.
376792`\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.
376855`\spad{heapSort(f, agg)} sorts the aggregate agg with the ordering function \spad{f} using the heapsort algorithm.
376931`\spad{heap(ls)} creates a heap of elements consisting of the elements of \spad{ls}.
376972`\spad{height()} returns the height of the display area (an integer).
377076`\spad{height(p)} returns the maximal absolute value of the coefficients of the polynomial \spad{p}.
377147`\spad{height(f)} returns the height of form \spad{f} (an integer).
377193`\spad{height(k)} returns the nesting level of \spad{k}.
377249`\spad{height(d)} returns the number of elements in dequeue \spad{d}. Note: \axiom{height(\spad{d}) = \# \spad{d}}.
377315`\spad{height(f)} returns the highest nesting level appearing in \spad{f}. Constants have height 0. Symbols have height 1. For any operator op and expressions \spad{f1},{}...,{}fn,{} \spad{op(f1,...,fn)} has height equal to \spad{1 + max(height(f1),...,height(fn))}.
377377`\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).
377505`\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.
377631`\spad{hermiteH(n,x)} is the \spad{n}-th Hermite polynomial,{} \spad{H[n](x)}. These are defined by \spad{exp(2*t*x-t**2) = sum(H[n](x)*t**n/n!, n = 0..)}.
377713`\spad{hermite(n)} returns the \spad{n}th Hermite polynomial \spad{H[n](x)}. Note: Hermite polynomials,{} denoted \spad{H[n](x)},{} are computed from the two term recurrence. The generating function is: \spad{exp(2*t*x-t**2) = sum(H[n](x)*t**n/n!, n=0..infinity)}.
377814`\spad{hermite(m)} returns the Hermite normal form of the matrix \spad{m}.
377872`\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}.
377960`\spad{hexDigit?(c)} tests if \spad{c} is a hexadecimal numeral,{} \spadignore{i.e.} one of 0..9,{} a..\spad{f} or A..\spad{F}.
378008`\spad{hexDigit()} returns the class of all characters for which \spadfunFrom{hexDigit?}{Character} is \spad{true}.
378053`\spad{hex(r)} converts a rational number to a hexadecimal expansion.
378116`\spad{hi(s)} returns the second endpoint of \spad{s}. Note: \spad{hi(l..h) = h}.
378160`\spad{highCommonTerms(e1 a1 + ... + en an, f1 b1 + ... + fm bm)} returns \indented{2}{\spad{reduce(+,[max(ei, fi) ci])}} where \spad{ci} ranges in the intersection of \spad{{a1,...,an}} and \spad{{b1,...,bm}}.
378260`\spad{high(s)} returns the second endpoint of \spad{s}. Note: \spad{high(l..h) = h}.
378306`\spad{hitherPlane(v,h)} sets the hither clipping plane of the graph to \spad{h},{} for the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport}.
378374`\spad{homogeneous?(p)} tests if all of the terms of \spad{p} have the same degree.
378432`\spad{homogeneous?(df)} tests if all of the terms of differential form \spad{df} have the same degree.
378567`\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.
378631`\spad{horizontalTab} designates horizontal tab.
378676`\sapd{hostByteOrder}
378725`\spad{hostPlatform} is a string `triplet' description of the platform hosting the running OpenAxiom system.
378770`\spad{host(n)} constructs a Hostname from the name `n'.
378811`\spad{hspace(n)} creates white space of width \spad{n}.
378857`\spad{htrigs(f)} converts all the exponentials in \spad{f} into hyperbolic sines and cosines.
378918`\spad{hue(pt)} returns the third element of the two dimensional point,{} \spad{pt},{} although no assumptions are made with regards as to how the components of higher dimensional points are interpreted. This function is defined for the convenience of the user using specifically,{} hue to express a third dimension.
378966`\spad{hue(p)} returns the hue field of the indicated palette \spad{p}.
379004`\spad{hue(c)} returns the hue index of the indicated color \spad{c}.
379042`\spad{hyperelliptic()} returns \spad{p(x)} if the curve is the hyperelliptic defined by \spad{y**2 = p(x)},{} "failed" otherwise.
379129`\spad{hyperelliptic()} returns \spad{p(x)} if the curve is the hyperelliptic defined by \spad{y**2 = p(x)},{} "failed" otherwise.
379213`\spad{hypergeometric0F1(c,z)} is the hypergeometric function \spad{0F1(; c; z)}.
379339`\spad{hypergeometric0F1(c,z)} is the hypergeometric function \spad{0F1(; c; z)}.
379438`\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.
379512`\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)}.
379608`\spad{iFTable(l)} creates an intensity-functions table from the elements of \spad{l}.
379974`\spad{id x} is \spad{x}.
380017`\spad{idealSimplify(s)} returns a different and presumably simpler representation of \spad{s} with the defining polynomials for the equations forming a groebner basis,{} and the defining polynomial for the inequation reduced with respect to the basis,{} using Buchberger's algorithm.
380091`\spad{ideal([f1,...,fn])} returns the ideal \spad{(f1,...,fn)}.
380153`\spad{ideal(polyList)} constructs the ideal generated by the list of polynomials \spad{polyList}.
380230`\spad{ideal(D)} returns the ideal corresponding to a divisor \spad{D}.
380331`\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}.
380421`\spad{idealiser(m1,m2)} computes the order of an ideal defined by \spad{m1} and \spad{m2}
380505`\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
380591`\axiom{identification(\spad{g},{}\spad{h})} returns the list of equations \axiom{g_i = h_i},{} where \axiom{g_i} (resp. \axiom{h_i}) are exponential coordinates of \axiom{\spad{g}} (resp. \axiom{\spad{h}}).
380679`\spad{identityMatrix(n)} create an identity matrix we note that this must be square
380770`\spad{identitySquareMatrix(s,p)} \undocumented{}
380867`\spad{identity()} create the identity dhmatrix
380924`\spad{iflist2Result(m)} converts a attributes record into a \axiomType{Result}
381082`\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.
381152`\spad{iiGamma(x)} should be local but conditional.
381212`\spad{iiabs(x)} should be local but conditional.
381270`\spad{iiacos(x)} should be local but conditional
381322`\spad{iiacosh(x)} should be local but conditional
381375`\spad{iiacot(x)} should be local but conditional
381427`\spad{iiacoth(x)} should be local but conditional
381480`\spad{iiacsc(x)} should be local but conditional
381532`\spad{iiacsch(x)} should be local but conditional
381585`\spad{iiasec(x)} should be local but conditional
381637`\spad{iiasech(x)} should be local but conditional
381690`\spad{iiasin(x)} should be local but conditional
381742`\spad{iiasinh(x)} should be local but conditional
381795`\spad{iiatan(x)} should be local but conditional
381847`\spad{iiatanh(x)} should be local but conditional
381900`\spad{iibinom(l)} should be local but conditional.
381962`\spad{iicos(x)} should be local but conditional
382013`\spad{iicosh(x)} should be local but conditional
382065`\spad{iicot(x)} should be local but conditional
382116`\spad{iicoth(x)} should be local but conditional
382168`\spad{iicsc(x)} should be local but conditional
382219`\spad{iicsch(x)} should be local but conditional
382271`\spad{iidprod(l)} should be local but conditional.
382333`\spad{iidsum(l)} should be local but conditional.
382394`\spad{iiexp(x)} should be local but conditional
382445`\spad{iifact(x)} should be local but conditional.
382500`\spad{iilog(x)} should be local but conditional
382551`\spad{iiperm(l)} should be local but conditional.
382612`\spad{iipow(l)} should be local but conditional.
382672`\spad{iisec(x)} should be local but conditional
382723`\spad{iisech(x)} should be local but conditional
382775`\spad{iisin(x)} should be local but conditional
382826`\spad{iisinh(x)} should be local but conditional
382878`\spad{iisqrt2()} should be local but conditional
382930`\spad{iisqrt3()} should be local but conditional
382982`\spad{iitan(x)} should be local but conditional
383033`\spad{iitanh(x)} should be local but conditional
383085`\spad{imagE(o)} extracts the imaginary \spad{E} part of octonion \spad{o}.
383133`\spad{imagI(o)} extracts the imaginary \spad{I} part of octonion \spad{o}.
383181`\spad{imagI(q)} extracts the imaginary \spad{i} part of quaternion \spad{q}.
383231`\spad{imagJ(o)} extracts the imaginary \spad{J} part of octonion \spad{o}.
383279`\spad{imagJ(q)} extracts the imaginary \spad{j} part of quaternion \spad{q}.
383329`\spad{imagK(o)} extracts the imaginary \spad{K} part of octonion \spad{o}.
383377`\spad{imagK(q)} extracts the imaginary \spad{k} part of quaternion \spad{q}.
383427`\spad{imag(f)} returns the imaginary part of \spad{f} where \spad{f} is a complex function.
383504`\spad{imag(f)} returns the imaginary part of \spad{f} where \spad{f} is a complex function.
383562`\spad{imag(x)} returns imaginary part of \spad{x}.
383608`\spad{imagi(o)} extracts the \spad{i} part of octonion \spad{o}.
383703`\spad{imaginary()} = sqrt(\spad{-1}) = \%\spad{i}.
383753`\spad{imagj(o)} extracts the \spad{j} part of octonion \spad{o}.
383801`\spad{imagk(o)} extracts the \spad{k} part of octonion \spad{o}.
383849`\spad{implies(p,q)} returns the logical implication of `q' by `p'.
383902`\spad{imports(x)} returns the list of imported types.
383954`\spad{in?(p)} tests whether point \spad{p} is internal to the range [\spad{A..B}]
384031`\spad{in?(p,range)} tests whether point \spad{p} is internal to the \spad{range} \spad{range}
384137`\spad{in?(I,J)} tests if the ideal \spad{I} is contained in the ideal \spad{J}.
384211`\spad{inGroundField?(a)} tests whether an element \spad{a} is already in the ground field \spad{F}.
384272`\spad{inHallBasis?(numberOfGens, leftCandidate, rightCandidate, left)} tests to see if a new element should be added to the \spad{P}. Hall basis being constructed. The list \spad{[leftCandidate,wt,rightCandidate]} is included in the basis if in the unique factorization of \spad{rightCandidate},{} we have left factor leftOfRight,{} and leftOfRight <= \spad{leftCandidate}
384352`\spad{inR?(p)} tests if \spad{p} is an atom (\spadignore{i.e.} an element of \spad{R}).
384396`\spad{inRadical?(f,I)} tests if some power of the polynomial \spad{f} belongs to the ideal \spad{I}.
384480`\spad{inc(x)} returns \spad{x + 1}.
384527`inconsistant?(pl) returns \spad{true} if the system of equations \spad{p} = 0 for \spad{p} in pl is inconsistent. It is assumed that pl is a groebner basis.
384617`inconsistant?(pl) returns \spad{true} if the system of equations \spad{p} = 0 for \spad{p} in pl is inconsistent. It is assumed that pl is a groebner basis.
384718`\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}.
384770`\spad{increasePrecision(n)} increases the current \spadfunFrom{precision}{FloatingPointSystem} by \spad{n} decimal digits.
384886`\axiom{increase(attributeName)} increases the value for the effect of the attribute \axiom{attributeName} with all routines. \blankline \axiom{attributeName} should be one of the values "stiffness",{} "stability",{} "accuracy",{} "expense" or "functionEvaluations".
384942`\axiom{increase(routineName,{}attributeName)} increases the value for the effect of the attribute \axiom{attributeName} with routine \axiom{routineName}. \blankline \axiom{attributeName} should be one of the values "stiffness",{} "stability",{} "accuracy",{} "expense" or "functionEvaluations".
385005`\spad{incrementBy(n)} produces a function which adds \spad{n} to whatever argument it is given. For example,{} if {\spad{f} := increment(\spad{n})} then \spad{f x} is \spad{x+n}.
385063`\spad{incrementKthElement(S,k)} increments the k^{th} element of \spad{S},{} and returns "failed" if the result is not a set of \spad{M} integers in \spad{1..n} any more.
385166`\spad{increment()} produces a function which adds \spad{1} to whatever argument it is given. For example,{} if {\spad{f} := increment()} then \spad{f x} is \spad{x+1}.
385405`\spad{index?(i,u)} tests if \spad{i} is an index of aggregate \spad{u}.
385537`\spad{index(x)} \undocumented
385590`\spad{index(i)} takes a positive integer \spad{i} less than or equal to \spad{size()} and returns the \spad{i}\spad{-}th element of the set. This operation establishs a bijection between the elements of the finite set and \spad{1..size()}.
385639`\spad{index(n,m)} is a index function for vectors of length \spad{n} over the ground field.
385740`\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})}
385894`\axiom{indiceSubResultant(\spad{P},{} \spad{Q},{} \spad{i})} returns the subresultant of indice \axiom{\spad{i}}
386177`\spad{indices(u)} returns a list of indices of aggregate \spad{u} in no particular order.
386247`\spad{indicialEquationAtInfinity op} returns the indicial equation of \spad{op} at infinity.
386363`\spad{indicialEquationAtInfinity op} returns the indicial equation of \spad{op} at infinity.
386482`\spad{indicialEquation(op, a)} returns the indicial equation of \spad{op} at \spad{a}.
386549`\spad{indicialEquation(op, a)} returns the indicial equation of \spad{op} at \spad{a}.
386617`\spad{indicialEquations op} returns \spad{[[d1,e1],...,[dq,eq]]} where the \spad{d_i}'s are the affine singularities of \spad{op},{} and the \spad{e_i}'s are the indicial equations at each \spad{d_i}.
386716`\spad{indicialEquations op} returns \spad{[[d1,e1],...,[dq,eq]]} where the \spad{d_i}'s are the affine singularities of \spad{op},{} and the \spad{e_i}'s are the indicial equations at each \spad{d_i}.
386816`\spad{indicialEquations(op, p)} returns \spad{[[d1,e1],...,[dq,eq]]} where the \spad{d_i}'s are the affine singularities of \spad{op} above the roots of \spad{p},{} and the \spad{e_i}'s are the indicial equations at each \spad{d_i}.
386918`\spad{indicialEquations(op, p)} returns \spad{[[d1,e1],...,[dq,eq]]} where the \spad{d_i}'s are the affine singularities of \spad{op} above the roots of \spad{p},{} and the \spad{e_i}'s are the indicial equations at each \spad{d_i}.
387021`\axiom{infLex?(\spad{n1},{}\spad{n2},{}\spad{o1},{}\spad{o2})} returns \spad{true} iff \axiom{\spad{o1}(value(\spad{n1}),{}value(\spad{n2}))} or \axiom{value(\spad{n1}) = value(\spad{n2})} and \axiom{\spad{o2}(condition(\spad{n1}),{}condition(\spad{n2}))}.
387251`\axiom{infRittWu?(\spad{lp1},{}\spad{lp2})} is an internal subroutine,{} exported only for developement.
387337`\axiom{infRittWu?(\spad{lp1},{}\spad{lp2})} is an internal subroutine,{} exported only for developement.
387433`\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.
387510`\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.
387583`\spad{inf(u)} returns the infinum of \axiom{\spad{u}}.
387629`\spad{infieldIntegrate(f, x)} returns a fraction \spad{g} such that \spad{dg/dx = f} if \spad{g} exists,{} "failed" otherwise.
387765`\spad{infieldint(f)} returns \spad{g} such that \spad{g' = f} or "failed" if the integral of \spad{f} is not a rational function.
387861`\spad{infinite?(x)} tests if \spad{x} is infinite.
387921`\spad{infinite?(x)} tests if \spad{x} is +infinity or -infinity,{}
387980`\spad{infiniteProduct(f(x))} computes \spad{product(n=1,2,3...,f(x**n))}. The series \spad{f(x)} should have constant coefficient 1.
388067`\spad{infiniteProduct(f(x))} computes \spad{product(n=1,2,3...,f(x**n))}. The series \spad{f(x)} should have constant coefficient 1.
388152`\spad{infiniteProduct(f(x))} computes \spad{product(n=1,2,3...,f(x**n))}. The series \spad{f(x)} should have constant coefficient 1.
388235`\spad{infiniteProduct(f(x))} computes \spad{product(n=1,2,3...,f(x**n))}. The series \spad{f(x)} should have constant coefficient 1.
388312`\spad{infinityNorm(f)} returns the maximal absolute value of the coefficients of the polynomial \spad{f}.
388389`\spad{infinity()} returns infinity.
388453`\spad{infinity()} returns infinity.
388505`\spad{infix?(op)} returns \spad{true} if \spad{op} is an infix operator,{} and \spad{false} otherwise.
388551`\spad{infix(f,l)} creates a form depicting the \spad{n}-ary application of infix operation \spad{f} to a tuple of arguments \spad{l}.
388600`\spad{infix(op, a, b)} creates a form which prints as: a \spad{op} \spad{b}.
388646`\axiom{initTable!()} initializes the hash-table.
388910`\spad{init()} chooses an initial object for stepping.
389007`\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.
389137`\spad{initial(p)} returns the leading coefficient when the differential polynomial \spad{p} is written as a univariate polynomial in its leader.
389208`\spad{initializeGroupForWordProblem(gp)} initializes the group {\em gp} for the word problem. Notes: it calls the other function of this name with parameters 0 and 1: {\em initializeGroupForWordProblem(gp,0,1)}. Notes: (1) be careful: invoking this routine will destroy the possibly information about your group (but will recompute it again) (2) users need not call this function normally for the soultion of the word problem.
389283`\spad{initializeGroupForWordProblem(gp,m,n)} initializes the group {\em gp} for the word problem. Notes: (1) with a small integer you get shorter words,{} but the routine takes longer than the standard routine for longer words. (2) be careful: invoking this routine will destroy the possibly stored information about your group (but will recompute it again). (3) users need not call this function normally for the so
389283`--ultion of the word problem.
389514`\axiom{initiallyReduce(\spad{p},{}ts)} returns a polynomial \axiom{\spad{r}} such that \axiom{initiallyReduced?(\spad{r},{}ts)} holds and there exists some product \axiom{\spad{h}} of \axiom{initials(ts)} such that \axiom{h*p - \spad{r}} lies in the ideal generated by \axiom{ts}.
389585`\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}}.
389736`\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.
390055`\axiom{initiallyReduced?(\spad{p},{}ts)} returns \spad{true} iff \axiom{\spad{p}} and all its iterated initials are reduced \spad{w}.\spad{r}.\spad{t}. to the elements of \axiom{ts} with the same main variable.
390134`\axiom{initiallyReduced?(\spad{q},{}lp)} returns \spad{true} iff \axiom{initiallyReduced?(\spad{q},{}\spad{p})} holds for every \axiom{\spad{p}} in \axiom{lp}.
390224`\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}}.
390373`\axiom{initials(ts)} returns the list of the non-constant initials of the members of \axiom{ts}.
390441`\spad{innerEigenvectors(m,eps,factor)} computes explicitly the eigenvalues and the correspondent eigenvectors of the matrix \spad{m}. The parameter \spad{eps} determines the type of the output,{} \spad{factor} is the univariate factorizer to br used to reduce the characteristic polynomia
390441`--l into irreducible factors.
390660`\spad{innerSolve1(p,eps)} returns the list of the zeros of the polynomial \spad{p} with precision \spad{eps}.
390754`\spad{innerSolve1(up,eps)} returns the list of the zeros of the univariate polynomial \spad{up} with precision \spad{eps}.
390864`\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}.
391002`\spad{innerint(f, x, a, b, ignore?)} should be local but conditional
391226`\spad{inputBinaryFile(f)} returns an input conduit obtained by opening the file named by `f' as a binary file.
391287`\spad{inputBinaryFile(f)} returns an input conduit obtained by opening the file named by `f' as a binary file.
391346`\spad{inputOutputBinaryFile(f)} returns an input/output conduit obtained by opening the file designated by `f' as a binary file.
391419`\spad{inputOutputBinaryFile(f)} returns an input/output conduit obtained by opening the file named by `f' as a binary file.
391490`\spad{input} indicates that an IO conduit is for input.
391524`\spad{input(op)} returns the "\%input" property of \spad{op} if it has one attached,{} \spad{nothing} otherwise.
391600`\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)}.
391672`\spad{inrootof(p, x)} should be a non-exported function.
391755`\spad{insert!(r)} inserts an entry \spad{r} into theIFTable
392607`\spad{insert!(r)} inserts an entry \spad{r} into theIFTable
392967`\axiom{insert!(\spad{x},{}\spad{y})} stores the item whose key is \axiom{\spad{x}} and whose entry is \axiom{\spad{y}}.
393127`\spad{insert!(x,u)} inserts item \spad{x} into bag \spad{u}.
393176`\spad{insert!(x,b)} inserts element \spad{x} as leaves into binary search tree \spad{b}.
393229`\spad{insert!(x,b)} inserts element \spad{x} as leaves into binary tournament \spad{b}.
393390`\spad{insert!(x,u,i)} destructively inserts \spad{x} into \spad{u} at position \spad{i}.
393460`\spad{insert!(x,d,n)} destructively inserts \spad{n} copies of \spad{x} into dictionary \spad{d}.
393531`\spad{insert!(v,u,i)} destructively inserts aggregate \spad{v} into \spad{u} at position \spad{i}.
393602`\spad{insertBottom!(x,d)} destructively inserts \spad{x} into the dequeue \spad{d} at the bottom (back) of the dequeue.
393660`\spad{insertMatch(var, expr, r)} adds the match (\spad{var},{} \spad{expr}) in \spad{r},{} without checking predicates or previous matches for \spad{var}.
393732`\spad{insertRoot!(x,b)} inserts element \spad{x} as a root of binary search tree \spad{b}.
393789`\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.
394338`\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}..))}.
394397`\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}..) )}.
394457`\spad{insertionSort! }\undocumented
394527`\spad{insertionSort!(a,f)} \undocumented
394674`\spad{inspect(u)} returns an (random) element from a bag.
394720`\spad{intChoose should} be local
394971`\spad{intPatternMatch(f, x, int, pmint)} tries to integrate \spad{f} first by using the integration function \spad{int},{} and then by using
394971`-- the pattern match intetgration function \spad{pmint} on any remaining unintegrable part.
395338`\spad{int(r)} returns [\spad{r},{}\spad{r+1},{}\spad{r+2},{}...],{} where \spad{r} is a ring element.
395403`\spad{int(expr)} creates the form prefixing \spad{expr} with an integral sign.
395441`\spad{int(f, x)} returns the integral of \spad{f} with respect to \spad{x}.
395493`\spad{int(expr,lowerlimit)} creates the form prefixing \spad{expr} by an integral sign with a \spad{lowerlimit}.
395534`\spad{int(expr,lowerlimit,upperlimit)} creates the form prefixing \spad{expr} by an integral sign with both a \spad{lowerlimit} and \spad{upperlimit}.
395578`\spad{intcompBasis }\undocumented
395828`\spad{integer?(x)} is \spad{true} if \spad{x} is an integer,{} \spad{false} otherwise.
395886`\spad{integer?(s)} is \spad{true} if \spad{s} is an atom and belong to Int.
395965`\spad{integer?(t)} tests whether \spad{t} is equivalent to the FORTRAN type INTEGER.
396020`\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.
396085`\spad{integerIfCan(x)} returns \spad{x} as an integer,{} "failed" if \spad{x} is not an integer.
396163`\spad{integer(x)} returns \spad{x} as an integer; error if \spad{x} is not an integer.
396220`\spad{integer(s)} returns \spad{s} as an element of Int. Error: if \spad{s} is not an atom that also belongs to Int.
396294`\spad{integers(n)} returns \spad{[n,n+1,n+2,...]}.
396444`\spad{integral?()} tests if \spad{f} is integral over \spad{k[x]}.
396656`\spad{integral?(f, a)} tests whether \spad{f} is locally integral at \spad{x = a}.
396729`\spad{integral?(f, p)} tests whether \spad{f} is locally integral at \spad{p(x) = 0}.
396881`\spad{integralAtInfinity?()} tests if \spad{f} is locally integral at infinity.
396962`\spad{integralBasisAtInfinity()} returns the local integral basis at infinity.
397048`\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 bas
397048`--is is \spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of \spad{basis} contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix \spad{basisInv} contains the coordinates of \spad{wi} with respect to the basis \spad{v1,...,vn}: if \spad{basisInv} is the matrix \spad{(bij, i = 1..n, j = 1..n)},{} then \spad{wi = sum(bij * vj, j = 1..n)}.
397183`\spad{integralBasis()} returns a record \spad{[basis,basisDen,basisInv]} containing information regarding the integral closure of \spad{R} in the quotient field of \spad{F},{} where \spad{F} is a framed algebra with \spad{R}-module basis \spad{w1,w2,...,wn}. If \spad{basis} is the matrix \spad{(aij, i = 1..n, j = 1..n)},{} then the \spad{i}th element of the integral basis is \spad{vi
397183`-- = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of \spad{basis} contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix \spad{basisInv} contains the coordinates of \spad{wi} with respect to the basis \spad{v1,...,vn}: if \spad{basisInv} is the matrix \spad{(bij, i = 1..n, j = 1..n)},{} then \spad{wi = sum(bij * vj, j = 1..n)}.
397304`\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
397304`-- basis is \spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of 'basis' contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix 'basisInv' contains the coordinates of \spad{wi} with respect to the basis \spad{v1,...,vn}: if 'basisInv' is the matrix \spad{(bij, i = 1..n, j = 1..n)},{} then \spad{wi = sum(bij * vj, j = 1..n)}.
397436`\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 \s
397436`--pad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of \spad{basis} contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix \spad{basisInv} contains the coordinates of \spad{wi} with respect to the basis \spad{v1,...,vn}: if \spad{basisInv} is the matrix \spad{(bij, i = 1..n, j = 1..n)},{} then \spad{wi = sum(bij * vj, j = 1..n)}.
397563`\spad{integralBasis()} returns the integral basis for the curve.
397639`\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()}.
397742`\spad{integralDerivationMatrix(d)} extends the derivation \spad{d} from UP to \$ and returns (\spad{M},{} \spad{Q}) such that the i^th row of \spad{M} divided by \spad{Q} form the coordinates of \spad{d(wi)} with respect to \spad{(w1,...,wn)} where \spad{(w1,...,wn)} is the integral basis returned by integralBasis().
397856`\axiom{integralLastSubResultant(\spad{p1},{}\spad{p2},{}ts)} is an internal subroutine,{} exported only for developement.
397977`\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()}.
398074`\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}.
398161`\spad{integralRepresents([A1,...,An], D)} returns \spad{(A1 w1+...+An wn)/D} where \spad{(w1,...,wn)} is the integral basis of \spad{integralBasis()}.
398247`\spad{integral(f,x)} returns the formal integral of \spad{f} with respect to \spad{x}
398301`\spad{integral(f,x = a..b)} denotes the definite integral of \spad{f} with respect to \spad{x} from \spad{a} to \spad{b}.
398374`\spad{integral(f,x)} indefinite integral of \spad{f} with respect to \spad{x}.
398436`\spad{integral(f,x)} returns the formal integral of \spad{f} with respect to \spad{x}
398523`\spad{integral(f, x = a..b)} returns the formal definite integral of \spad{f} dx for \spad{x} between \spad{a} and \spad{b}.
398600`\spad{integral(f, x)} returns the formal integral of \spad{f} dx.
398665`\spad{integrate(f)} returns \spad{g} such that \spad{g' = f}.
398824`\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}.
398932`\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
398932`-- the best \axiom{measure}. \blankline It then performs the integration of the given expression on that \axiom{domain}.
399026`\spad{integrate(f(x))} returns an anti-derivative of the power series \spad{f(x)} with constant coefficient 1. We may integrate a series when we can divide coefficients by integers.
399133`\spad{integrate(p)} integrates the univariate polynomial \spad{p} with respect to its distinguished variable.
399231`\spad{integrate(f(x))} returns an anti-derivative of the power series \spad{f(x)} with constant coefficient 1. We may integrate a series when we can divide coefficients by rational numbers.
399338`\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.
399444`\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,...]}.
399558`\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.
399685`\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.
399812`\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.
399938`\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.
400059`\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.
400180`\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.
400300`\spad{integrate(exp, [a..b,c..d,...])} is a top level ANNA function to integrate a multivariate expression,{} {\tt \spad{exp}},{} over a given set of ranges. \blankline It iterates over the \axiom{domains} of \axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \spa
400300`--dignore{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.
400424`\spad{integrate(exp, a..b)} is a top level ANNA function to integrate an expression,{} {\tt \spad{exp}},{} over a given range {\tt a} to {\tt \spad{b}}. \blankline It iterates over the \axiom{domains} of \axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \spadignore{i.e
400424`--.} 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.
400542`\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}.
400747`\spad{integrate(f, x)} returns the integral of \spad{f(x)dx} where \spad{x} is viewed as a real variable.
400830`\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}.
401089`\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}.
401358`\spad{integrate(f, x)} returns the integral of \spad{f(x)dx} where \spad{x} is viewed as a real variable..
401515`\spad{integrate(f(x),y)} returns an anti-derivative of the power series \spad{f(x)} with respect to the variable \spad{y}.
401763`\spad{integrate(f(x),y)} returns an anti-derivative of the power series \spad{f(x)} with respect to the variable \spad{y}.
401981`\spad{integrate(f(x),y)} returns an anti-derivative of the power series \spad{f(x)} with respect to the variable \spad{y}.
402229`\spad{integrate(f(x),y)} returns an anti-derivative of the power series \spad{f(x)} with respect to the variable \spad{y}.
402447`\spad{integrate(f(x),y)} returns an anti-derivative of the power series \spad{f(x)} with respect to the variable \spad{y}.
402694`\spad{integrate(f(x),y)} returns an anti-derivative of the power series \spad{f(x)} with respect to the variable \spad{y}.
402911`\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}.
402998`\spad{integrate(f,x)} returns the anti-derivative of the power series \spad{f(x)} with respect to the variable \spad{x} with constant coefficient 1. We may integrate a series when we can divide coefficients by integers.
403114`\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.
403240`\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.}
403363`\spad{integrate(exp, [a..b,c..d,...], epsrel)} is a top level ANNA function to integrate a multivariate expression,{} {\tt \spad{exp}},{} over a given set of ranges to the required relative accuracy. \blankline It iterates over the \axiom{domains} of \axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical r
403363`--outine 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.
403493`\spad{integrate(exp, a..b, epsrel)} is a top level ANNA function to integrate an expression,{} {\tt \spad{exp}},{} over a given range {\tt a} to {\tt \spad{b}} to the required relative accuracy. \blankline It iterates over the \axiom{domains} of \axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine like
403493`--ly 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.
403617`\spad{integrate(exp, x = a..b, "numerical")} is a top level ANNA function to integrate an expression,{} {\tt \spad{exp}},{} over a given range,{} {\tt a} to {\tt \spad{b}}. \blankline It iterates over the \axiom{domains} of \axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine li
403617`--kely to be the most appropriate,{} \spadignore{i.e.} have the best \axiom{measure}. \blankline It then performs the integration of the given expression on that \axiom{domain}.\newline \blankline Default values for the absolute and relative error are used. \blankline It is an error of the last argument is not {\tt "numerical"}.
403765`\spad{integrate(exp, x = a..b, numerical)} is a top level ANNA function to integrate an expression,{} {\tt \spad{exp}},{} over a given range,{} {\tt a} to {\tt \spad{b}}. \blankline It iterates over the \axiom{domains} of \axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine like
403765`--ly to be the most appropriate,{} \spadignore{i.e.} have the best \axiom{measure}. \blankline It then performs the integration of the given expression on that \axiom{domain}.\newline \blankline Default values for the absolute and relative error are used. \blankline It is an error if the last argument is not {\tt numerical}.
403913`\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 \s
403913`--pad{f} has a pole for \spad{x} between a and \spad{b} or if the last argument is not "noPole".
404125`\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 wi
404125`--ll 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".
404391`\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 f
404391`--unction 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".
404667`\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.}
404767`\spad{integrate(exp, [a..b,c..d,...], epsabs, epsrel)} is a top level ANNA function to integrate a multivariate expression,{} {\tt \spad{exp}},{} over a given set of ranges to the required absolute and relative accuracy. \blankline It iterates over the \axiom{domains} of \axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the 
404767`--(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}.
404903`\spad{integrate(exp, a..b, epsabs, epsrel)} is a top level ANNA function to integrate an expression,{} {\tt \spad{exp}},{} over a given range {\tt a} to {\tt \spad{b}} to the required absolute and relative accuracy. \blankline It iterates over the \axiom{domains} of \axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of 
404903`--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}.
405033`\spad{integrate(exp, [a..b,c..d,...], epsabs, epsrel, routines)} is a top level ANNA function to integrate a multivariate expression,{} {\tt \spad{exp}},{} over a given set of ranges to the required absolute and relative accuracy,{} using the routines available in the RoutinesTable provided. \blankline It iterates over the \axiom{domains} of \axiomType{Nu
405033`--mericalIntegrationCategory} 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}.
405183`\spad{integrate(exp, a..b, epsrel, routines)} is a top level ANNA function to integrate an expression,{} {\tt \spad{exp}},{} over a given range {\tt a} to {\tt \spad{b}} to the required absolute and relative accuracy using the routines available in the RoutinesTable provided. \blankline It iterates over the \axiom{domains} of \axiomType{NumericalIntegrationCate
405183`--gory} 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}.
405327`\spad{intensity(v,i)} sets the intensity of the light source to \spad{i},{} for the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport}.
405393`\axiom{interReduce(lp)} returns \axiom{lq} such that \axiom{lp} and \axiom{lq} generate the same ideal and no polynomial in \axiom{lq} is reducuble by the others in the sense of Groebner bases. Since no assumptions are required the result may depend on the ordering the reductions are performed.
405477`the current interactive environment in effect.
405525`\spad{intermediateResultsIF(o)} returns a value corresponding to the required number of intermediate results required and,{} therefore,{} an indication of how much this would affect the step-length of the calculation. It returns a value in the range [0,
405525`--{}1].
405779`\spad{internal?(x)} \undocumented
405831`\spad{internalAugment(lp,ts)} returns \spad{ts} if \spad{lp} is empty otherwise returns \spad{internalAugment(rest lp, internalAugment(first lp, ts))}
405916`\spad{internalAugment(p,ts)} assumes that \spad{augment(p,ts)} returns a singleton and returns it.
405995`\axiom{internalAugment(\spad{p},{}ts,{}\spad{b1},{}\spad{b2},{}\spad{b3},{}\spad{b4},{}\spad{b5})} is an internal subroutine,{} exported only for developement.
406112`\axiom{internalAugment(\spad{p},{}ts,{}\spad{b1},{}\spad{b2},{}\spad{b3},{}\spad{b4},{}\spad{b5})} is an internal subroutine,{} exported only for developement.
407201`\axiom{internalInfRittWu?(\spad{lp1},{}\spad{lp2})} is an internal subroutine,{} exported only for developement.
407295`\axiom{internalInfRittWu?(\spad{lp1},{}\spad{lp2})} is an internal subroutine,{} exported only for developement.
407399`\spad{internalIntegrate0 should} be a local function,{} but is conditional.
407502`\spad{internalIntegrate(f, x)} returns the integral of \spad{f(x)dx} where \spad{x} is viewed as a complex variable.
407604`\spad{internalIntegrate(f, x)} returns \spad{g} such that \spad{dg/dx = f}.
407744`\axiom{internalLastSubResultant(lpwt,{}\spad{v},{}flag)} is an internal subroutine,{} exported only for developement.
407903`\axiom{internalLastSubResultant(\spad{p1},{}\spad{p2},{}ts,{}inv?,{}break?)} is an internal subroutine,{} exported only for developement.
408040`\axiom{internalSubPolSet?(\spad{lp1},{}\spad{lp2})} returns \spad{true} iff \axiom{\spad{lp1}} is a sub-set of \axiom{\spad{lp2}} assuming that these lists are sorted increasingly \spad{w}.\spad{r}.\spad{t}. \axiomOpFrom{infRittWu?}{RecursivePolynomialCategory}.
408134`\axiom{internalSubPolSet?(\spad{lp1},{}\spad{lp2})} returns \spad{true} iff \axiom{\spad{lp1}} is a sub-set of \axiom{\spad{lp2}} assuming that these lists are sorted increasingly \spad{w}.\spad{r}.\spad{t}. \axiomOpFrom{infRittWu?}{RecursivePolynomialCategory}.
408238`\axiom{internalSubQuasiComponent?(ts,{}us)} returns a boolean \spad{b} value if the fact that the regular zero set of \axiom{us} contains that of \axiom{ts} can be decided (and in that case \axiom{\spad{b}} gives this inclusion) otherwise returns \axiom{"failed"}.
408346`\axiom{internalSubQuasiComponent?(ts,{}us)} returns a boolean \spad{b} value if the fact the regular zero set of \axiom{us} contains that of \axiom{ts} can be decided (and in that case \axiom{\spad{b}} gives this inclusion) otherwise returns \axiom{"failed"}.
408464`\axiom{internalZeroSetSplit(lp,{}\spad{b1},{}\spad{b2},{}\spad{b3})} is an internal subroutine,{} exported only for developement.
408573`\axiom{internalZeroSetSplit(lp,{}\spad{b1},{}\spad{b2},{}\spad{b3})} is an internal subroutine,{} exported only for developement.
408692`\spad{interpolate(lf,lg)} \undocumented
408797`\spad{interpolate(u,lf,lg)} \undocumented
409056`\spad{interpretString(s)} treats a string as a piece of AXIOM input,{} by parsing and interpreting it.
409118`\spad{interpret(f)} passes \spad{f} to the interpreter,{} and transforms the result into an object of type \spad{R}.
409180`\spad{interpret(f)} passes \spad{f} to the interpreter.
409224`\spad{intersect(LI)} computes the intersection of the list of ideals \spad{LI}.
409679`\spad{intersect(lp,lts)} returns the same as \spad{concat([intersect(lp,ts) for ts in lts])|}
409770`\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}.
409855`\spad{intersect(p,lts)} returns the same as \spad{intersect([p],lts)}
409940`\spad{intersect(p,ts)} returns the same as \spad{intersect([p],ts)}
410019`\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})}.
410071`\spad{intersect(I,J)} computes the intersection of the ideals \spad{I} and \spad{J}.
410146`\spad{interval(f)} creates a new interval around \spad{f}.
410213`\spad{interval(f)} creates a new interval around \spad{f}.
410264`\spad{interval(inf,sup)} creates a new interval,{} either \axiom{[\spad{inf},{}\spad{sup}]} if \axiom{\spad{inf} <= \spad{sup}} or \axiom{[\spad{sup},{}in]} otherwise.
410477`\spad{inv x} \undocumented{} See \axiomFunFrom{inv}{DivisionRing}
410555`\spad{inv(x)} \undocumented
410637`\spad{inv(x)} \undocumented
410708`\spad{inv x} returns the multiplicative inverse of \spad{x}. Error: if \spad{x} is 0.
410748`\spad{inv(x)} returns the inverse of \spad{x}.
410781`\spad{inv(o)} returns the inverse of \spad{o} if it exists.
410840`\spad{inv(x)} returns the multiplicative inverse of \spad{x}.
410891`\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(\sp
410891`--ad{alpha},{}\spad{beta},{}\spad{C}) calculates the lexicographical smallest {\em pi} in the corresponding double coset. Note: the resulting permutation {\em pi} of {\em {1,2,...,n}} is given in list form. Notes: the inverse of this map is {\em coleman}. For details,{} see James/Kerber.
411017`\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()}.
411121`\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}.
411215`\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.
411310`\spad{inverse(ls)} forms the inverse of a sequence \spad{ls}
411370`\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.
411462`\spad{inverse(m)} returns the inverse of the matrix \spad{m}. If the matrix is not invertible,{} "failed" is returned. Error: if the matrix is not square. Note: the result will have entries in the quotient field.
411571`\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.
411670`\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.
411755`\spad{inverse(m)} returns the inverse of the matrix \spad{m},{} if that matrix is invertible and returns "failed" otherwise.
411851`\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.
411920`\spad{invertIfCan(m)} returns the inverse of \spad{m} over \spad{R}
412032`\spad{invertible?(p,ts)} returns \spad{true} iff \spad{p} is invertible in the tower associated with \spad{ts}.
412112`\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}.
412219`\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}.
412324`\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}.
412456`\spad{invmod(a,b)},{} \spad{0<=a<b>1},{} \spad{(a,b)=1} means \spad{1/a mod b}.
412509`\spad{invmultisect(a,b,st)} substitutes \spad{x**((a+b)*n)} for \spad{x**n} and multiplies by \spad{x**b}.
412607`\spad{invmultisect(a,b,f(x))} substitutes \spad{x^((a+b)*n)} \indented{1}{for \spad{x^n} and multiples by \spad{x^b}.}
412696`\spad{iomode(f)} returns the status of the file \spad{f}. The input/output status of \spad{f} may be "input",{} "output" or "closed" mode.
412751`\spad{ip4Address(a)} builds a numeric address out of the ASCII form `a'.
412800`\spad{ipow(l)} should be local but conditional.
412859`\axiom{iprint(\spad{s})} prints \axiom{\spad{s}} at the current position of the cursor.
412916`\spad{irCtor(n,t)} returns an IR for a constructor reference of type designated by the type form \spad{t}
412998`\spad{irDef(f,ts,e)} returns an IR representation for a definition of a function named \spad{f},{} with signature \spad{ts} and body \spad{e}.
413082`\spad{irForm(x)} returns the internal representation form of the elaboration \spad{x}.
413148`\spad{irVar(x,t)} returns an IR for a variable reference of type designated by the type form \spad{t}
413229`\spad{iroot(p, n)} should be a non-exported function.
413316`\spad{irreducible?(p)} tests whether the polynomial \spad{p} is irreducible.
413387`\spad{irreducibleFactor(base,exponent)} creates a factored object with a single factor whose \spad{base} is asserted to be irreducible (flag = "irred").
413447`\axiom{irreducibleFactors(lp)} returns \axiom{lf} such that if \axiom{lp = [\spad{p1},{}...,{}pn]} and \axiom{lf = [\spad{f1},{}...,{}fm]} then \axiom{p1*p2*...\spad{*pn=0}} means \axiom{f1*f2*...\spad{*fm=0}},{} and the \axiom{\spad{fi}} are irreducible over \axiom{\spad{R}} and are pairwise distinct.
413591`\spad{irreducibleRepresentation(lambda)} is the list of the two irreducible representations corresponding to the partition {\em lambda} in Young's natural form for the following two generators of the symmetric group,{} whose elements permute {\em {1,2,...,n}},{} namely {\em (1 2)} (2-cycle) and {\em (1 2 ... n)} (\spad{n}-cycle).
413698`\spad{irreducibleRepresentation(lambda,listOfPerm)} is the list of the irreducible representations corresponding to {\em lambda} in Young's natural form for the list of permutations given by {\em listOfPerm}.
413832`\spad{irreducibleRepresentation(lambda,pi)} is the irreducible representation corresponding to partition {\em lambda} in Young's natural form of the permutation {\em pi} in the symmetric group,{} whose elements permute {\em {1,2,...,n}}.
414118`\spad{is?(op(a1,...,an), f)} tests if op = \spad{f}.
414174`\spad{is?(op(a1,...,an), s)} tests if the name of op is \spad{s}.
414223`\spad{is?([e1,...,en], pat)} tests if the list of expressions \spad{[e1,...,en]} matches the pattern pat.
414301`\spad{is?(expr, pat)} tests if the expression \spad{expr} matches the pattern pat.
414373`\spad{is?(x, op)} tests if \spad{x} is a kernel and is its operator is op.
414435`\spad{is?(op,n)} holds if the name of the operator \spad{op} is \spad{n}.
414489`\spad{is?(x, s)} tests if \spad{x} is a kernel and is the name of its operator is \spad{s}.
414544`\spad{isAbsolutelyIrreducible?(aG)} calls {\em isAbsolutelyIrreducible?(aG,25)}. Note: the choice of 25 was rather arbitrary.
414648`\spad{isAbsolutelyIrreducible?(aG, numberOfTries)} uses Norton's irreducibility test to check for absolute irreduciblity,{} assuming if a one-dimensional kernel is found. As no field extension changes create "new" elements in a one-dimensional space,{} the criterium stays \spad{true} for every extension. The method looks for one-dimensionals only by creating random elements (no fingerprints) 
414648`--since a run of {\em meatAxe} would have proved absolute irreducibility anyway.
414760`\spad{isAnd f} returns a value \spad{v} such that \spad{v case Pair(\%,\%)} holds if the formula \spad{f} is a conjunction formula.
414829`\spad{isAtom f} returns a value \spad{v} such that \spad{v case T} holds if the formula \spad{f} is a term.
414948`\spad{isEquiv f} returns a value \spad{v} such that \spad{v case Pair(\%,\%)} holds if the formula \spad{f} is an equivalence formula.
415019`\spad{isExpt(p)} returns \spad{[x, n]} if \spad{p = x**n} and \spad{n <> 0},{} "failed" otherwise.
415353`\spad{isExpt(p)} returns \spad{[q, n]} if \spad{n > 0} and \spad{p = q ** n},{} and "failed" otherwise.
415450`\spad{isExpt(p)} returns \spad{[x, n]} if \spad{p = x**n} and \spad{n <> 0}.
415566`\spad{isExpt(p)} returns \spad{[x, n]} if polynomial \spad{p} has the form \spad{x**n} and \spad{n > 0}.
415900`\spad{isExpt(p,op)} returns \spad{[x, n]} if \spad{p = x**n} and \spad{n <> 0} and \spad{x = op(a)}.
416025`\spad{isExpt(p,f)} returns \spad{[x, n]} if \spad{p = x**n} and \spad{n <> 0} and \spad{x = f(a)}.
416143`\spad{isImplies f} returns a value \spad{v} such that \spad{v case Pair(\%,\%)} holds if the formula \spad{f} is an implication formula.
416216`\spad{isList(p)} returns \spad{[a1,...,an]} if \spad{p = [a1,...,an]},{} "failed" otherwise.
416371`\spad{isMult(p)} returns \spad{[n, x]} if \spad{p = n * x} and \spad{n <> 0}.
416490`\spad{isNot f} returns a value \spad{v} such that \spad{v case \%} holds if the formula \spad{f} is a negation.
416550`\spad{isOp(p)} returns \spad{[op, [a1,...,an]]} if \spad{p = op(a1,...,an)},{} and "failed" otherwise.
416640`\spad{isOp(p, op)} returns \spad{[a1,...,an]} if \spad{p = op(a1,...,an)},{} and "failed" otherwise.
416715`\spad{isOpen?(ifile)} holds if `ifile' is in open state.
416767`\spad{isOpen?(f)} holds if `f' is in open state.
416825`open?(ifile) holds if `ifile' is in open state.
416878`\spad{isOr f} returns a value \spad{v} such that \spad{v case Pair(\%,\%)} holds if the formula \spad{f} is a disjunction formula.
416946`\spad{isPlus(p)} returns [\spad{m1},{}...,{}mn] if \spad{p = m1 + ... + mn} and \spad{n > 1},{} "failed" otherwise.
417187`\spad{isPlus(p)} returns \spad{[a1,...,an]} if \spad{n > 1} \indented{1}{and \spad{p = a1 + ... + an},{}} and "failed" otherwise.
417250`\spad{isPlus(p)} returns \spad{[m1,...,mn]} if \spad{p = m1 +...+ mn} and \spad{n > 1}.
417342`\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.
417425`\spad{isPower(p)} returns \spad{[x, n]} if \spad{p = x**n} and \spad{n <> 0},{} "failed" otherwise.
417635`\spad{isPower(p)} returns \spad{[a, b]} if \spad{p = a ** b},{} and "failed" otherwise.
417717`\spad{isPower(p)} returns \spad{[x, n]} if \spad{p = x**n} and \spad{n <> 0}.
417821`\spad{isQuotient(p)} returns \spad{[a, b]} if \spad{p = a / b},{} and "failed" otherwise.
417901`\spad{isQuotient(expr)} returns the quotient part of the input expression or \spad{"failed"} if the expression is not of that form.
418018`\spad{isTimes(p)} returns \spad{[a1,...,an]} if \spad{p = a1 ... an} and \spad{n > 1},{} "failed" otherwise.
418262`\spad{isTimes(p)} returns \spad{[a1,...,an]} if \spad{n > 1} and \spad{p = a1 * ... * an},{} and "failed" otherwise.
418326`\spad{isTimes(p)} returns \spad{[a1,...,an]} if \spad{p = a1*...*an} and \spad{n > 1}.
418412`\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.
418571`\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.
418649`\spad{iter(f,n,x)} applies \spad{f n} times to \spad{x}.
418810`\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}}.
418891`\spad{iterationVar(i)} returns the name of the iterating variable of the `in' iterator 'i'
418941`\spad{iterationVar(i)} returns the name of the iterating variable of the arithmetic progression iterator \spad{i}.
418993`\spad{iterators(e)} returns the list of the iterators of the list comprehension `e'.
419048`\spad{iterators(e)} returns the list of iterators controlling the loop `e'.
419102`\spad{jacobiIdentity?()} tests if \spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} for all \spad{a},{}\spad{b},{}\spad{c} in the algebra. For example,{} this holds for crossed products of 3-dimensional vectors.
419182`\spad{jacobiIdentity?()} tests if \spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} for all \spad{a},{}\spad{b},{}\spad{c} in the algebra. For example,{} this holds for crossed products of 3-dimensional vectors.
419259`\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.
419336`\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}.
419428`\spad{jacobian(v,w)} is a local function to make a jacobian matrix
419548`\spad{janko2 constructs} the janko group acting on the integers 1,{}...,{}100.
419624`\spad{janko2(li)} constructs the janko group acting on the 100 integers given in the list {\em li}. Note: duplicates in the list will be removed. Error: if {\em li} has less or more than 100 different entries
419713`\spad{jokerMode} is a constant that stands for any mode in a type inference context
419761`\spad{jordanAdmissible?()} tests if 2 is invertible in the coefficient domain and the multiplication defined by \spad{(1/2)(a*b+b*a)} determines a Jordan algebra,{} \spadignore{i.e.} satisfies the Jordan identity. The property of \spadatt{commutative("*")} follows from by definition.
419843`\spad{jordanAdmissible?()} tests if 2 is invertible in the coefficient domain and the multiplication defined by \spad{(1/2)(a*b+b*a)} determines a Jordan algebra,{} \spadignore{i.e.} satisfies the Jordan identity. The property of \spadatt{commutative("*")} follows from by definition.
419922`\spad{jordanAlgebra?()} tests if the algebra is commutative,{} characteristic is not 2,{} and \spad{(a*b)*a**2 - a*(b*a**2) = 0} for all \spad{a},{}\spad{b},{}\spad{c} in the algebra (Jordan identity). Example: for every associative algebra \spad{(A,+,@)} we can construct a Jordan algebra \spad{(A,+,*)},{} where \spad{a*b := (a@b+b@a)/2}.
420001`\spad{jordanAlgebra?()} tests if the algebra is commutative,{} characteristic is not 2,{} and \spad{(a*b)*a**2 - a*(b*a**2) = 0} for all \spad{a},{}\spad{b},{}\spad{c} in the algebra (Jordan identity). Example: for every associative algebra \spad{(A,+,@)} we can construct a Jordan algebra \spad{(A,+,*)},{} where \spad{a*b := (a@b+b@a)/2}.
420077`\spad{just x} injects the value `x' into \%.
420113`The class was declared abstract; therefore object of this class may not be created.
420165`The method was declared abstract; therefore no implementation is provided.
420214`The corresponding constant pool entry represents a class or and interface.
420270`The corresponding constant pool entry is a double constant info.
420327`The corresponding constant pool entry represents a class field info.
420386`The class was declared final; therefore no derived class allowed.
420435`The field was declared final; therefore may not be modified after initialization.
420480`The method was declared final; therefore may not be overriden. in derived classes.
420526`The corresponding constant pool entry is a float constant info.
420582`The corresponding constant pool entry is an integer constant info.
420640`The correspondong constant pool entry represents an interface method info.
420706`The class file represents an interface,{} not a class.
420759`The corresponding constant pool entry is a long constant info.
420814`The correspondong constant pool entry represents a class method info.
420874`The correspondong constant pool entry represents the name and type of a field or method info.
420936`The method was declared native; therefore implemented in a language other than Java.
420983`The field was declared private; threfore can be accessed only within the defining class.
421030`The method was declared private; threfore can be accessed only within the defining class.
421078`The field was declared protected; therefore may be accessed withing derived classes.
421127`The method was declared protected; therefore may be accessed withing derived classes.
421177`The class was declared public,{} therefore may be accessed from outside its package
421227`The field was declared public; therefore mey accessed from outside its package.
421273`The method was declared public; therefore mey accessed from outside its package.
421320`The field was declared static.
421366`The method was declared static.
421413`The method was declared fpstrict; therefore floating-point mode is FP-strict.
421460`The corresponding constant pool entry is a string constant info.
421517`Instruct the JVM to treat base clss method invokation specially.
421566`The method was declared synchronized.
421619`The field was declared transient.
421668`The corresponding constant pool entry is sequence of bytes representing Java \spad{UTF8} string constant.
421723`The field was declared volatile.
421886`\spad{karatsubaDivide(p,n)} returns the same as \spad{monicDivide(p,monomial(1,n))}
422006`\spad{karatsuba(a,b)} returns \spad{a*b} by applying Karatsuba's trick once. The other multiplications are performed by calling \spad{*} from \spad{U}.
422090`\spad{karatsuba(a,b,l,k)} returns \spad{a*b} by applying Karatsuba's trick provided that both \spad{a} and \spad{b} have at least \spad{l} terms and \spad{k > 0} holds and by calling \spad{noKaratsuba} otherwise. The other multiplications are performed by recursive calls with the same third argument and \spad{k-1} as fourth argument.
422208`\spad{kernel(x)} returns \spad{x} viewed as a kernel.
422372`\spad{kernel(op, [f1,...,fn])} constructs \spad{op(f1,...,fn)} without evaluating it.
422438`\spad{kernel(op, x)} constructs \spad{op}(\spad{x}) without evaluating it.
422498`\spad{kernel(op, [a1,...,an], m)} returns the kernel \spad{op(a1,...,an)} of nesting level \spad{m}. Error: if \spad{op} is \spad{k}-ary for some \spad{k} not equal to \spad{m}.
422634`\spad{kernels(f)} returns the list of all the top-level kernels appearing in \spad{f},{} but not the ones appearing in the arguments of the top-level kernels.
422756`\spad{key?(k,t)} tests if \spad{k} is a key in table \spad{t}.
422820`\spad{key(gi)} returns the process ID of the given graph,{} \spad{gi},{} of the domain \spadtype{GraphImage}.
422863`\spad{key(v)} returns the process ID number of the given two-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{TwoDimensionalViewport}.
422918`\spad{key(v)} returns the process ID number of the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport}.
423034`\spad{keys(t)} returns the list the keys in table \spad{t}.
423096`\spad{keys(f)} returns the list of keys of \spad{f}
423283`\spad{keys(tab)} returns the list of keys of \spad{f}
423592`\spad{kind(ctor)} returns the kind of the constructor `ctor'.
423653`\spad{kind(c)} returns the kind of unnamed category,{} either 'domain' or 'package'.
423706`\spad{kmax([k1,...,kn])} returns the top-level \spad{ki} for integration.
423776`\spad{knownInfBasis(n)} \undocumented{}
423873`\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.
424008`\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
424008`-- a factorisation in \spad{UP},{} not necessarily into irreducibles.
424162`\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}}
424227`\spad{ksec(k, [k1,...,kn], x)} returns the second top-level \spad{ki} after \spad{k} involving \spad{x}.
424314`\spad{lSpaceBasis(d)} returns a basis for \spad{L(d) = {f | (f) >= -d}} as a module over \spad{K[x]}.
424383`\spad{label(n,f)} gives form \spad{f} an equation label \spad{n}.
424426`\spad{lagrange(g)} produces the power series for \spad{f} where \spad{f} is implicitly defined as \spad{f(z) = z*g(f(z))}.
424504`\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))}.}
424573`\spad{laguerreL(n,x)} is the \spad{n}-th Laguerre polynomial,{} \spad{L[n](x)}. These are defined by \spad{exp(-t*x/(1-t))/(1-t) = sum(L[n](x)*t**n/n!, n = 0..)}.
424656`\spad{laguerreL(m,n,x)} is the associated Laguerre polynomial,{} \spad{L<m>[n](x)}. This is the \spad{m}-th derivative of \spad{L[n](x)}.
424758`\spad{laguerre(n)} returns the \spad{n}th Laguerre polynomial \spad{L[n](x)}. Note: Laguerre polynomials,{} denoted \spad{L[n](x)},{} are computed from the two term recurrence. The generating function is: \spad{exp(x*t/(t-1))/(1-t) = sum(L[n](x)*t**n/n!, n=0..infinity)}.
424860`\spad{lambda(code, [x1,...,xn])} returns the input form corresponding to \spad{(x1,...,xn) +-> code} if \spad{n > 1},{} or to \spad{x1 +-> code} if \spad{n = 1}.
424913`\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))))}.
424990`\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))))}.}
425058`\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.
425123`\spad{laplacian(v,xlist)} computes the laplacian of the scalar field \spad{v},{} \spad{v} a function of the variables listed in \spad{xlist}.
425205`\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}.
425287`\spad{largest(l, fn)} returns the largest element of \spad{l} where the partial ordering induced by setOrder is completed into a total one by fn.
425367`\spad{lastSubResultantElseSplit(p1,p2,ts)} returns either \spad{g} a quasi-monic gcd of \spad{p1} and \spad{p2} \spad{w}.\spad{r}.\spad{t}. the \spad{ts} or a split of Kalkbrener of \spad{ts}. This assumes that \spad{p1} and \spad{p2} have the same maim variable and that this variable is greater that any variable occurring in \spad{ts}.
425473`\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}}.
425606`\axiom{lastSubResultant(a,{}\spad{b})} returns \axiom{resultant(a,{}\spad{b})} if \axiom{a} and \axiom{\spad{b}} has no non-trivial gcd in \axiom{R^(\spad{-1}) \spad{P}} otherwise the non-zero sub-resultant with smallest index.
425703`\axiom{lastSubResultant(\spad{P},{} \spad{Q})} computes the last non zero subresultant of \axiom{\spad{P}} and \axiom{\spad{Q}}
425784`\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}}.
425883`\spad{lastSubResultant(p1,p2,ts)} returns \spad{lpwt} such that \spad{lpwt.i.val} is a quasi-monic gcd of \spad{p1} and \spad{p2} \spad{w}.\spad{r}.\spad{t}. \spad{lpwt.i.tower},{} for every \spad{i},{} and such that the list of the \spad{lpwt.i.tower} is a split of Kalkbrener of \spad{ts}. Moreover,{} if \spad{p1} and \spad{p2} do not have a non-trivial gcd \spad{w}.\spad{r}.\spad{t}. \spad{lpwt
425883`--.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}.
426160`\spad{last(l)} returns the last element of a doubly-linked aggregate \spad{l}. Error: if \spad{l} is empty.
426212`\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)}.
426266`\spad{last(e)} returns the last instruction in `e'.
426311`\axiom{last(ts)} returns the polynomial of \axiom{ts} with smallest main variable if \axiom{ts} is not empty,{} otherwise returns \axiom{"failed"}.
426521`\spad{last(u,n)} returns a copy of the last \spad{n} (\axiom{\spad{n} >= 0}) nodes of \spad{u}. Note: \axiom{last(\spad{u},{}\spad{n})} is a list of \spad{n} elements.
426638`\spad{latex(s)} returns a LaTeX-printable output representation of \spad{s}.
426683`\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.
426789`\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)]}.
426877`\spad{laurent(f)} returns a Laurent expansion of the expression \spad{f}. Note: \spad{f} should have only one variable; the series will be expanded in powers of that variable.
426949`\spad{laurent(x)} returns \spad{x} viewed as a Laurent series.
427025`\spad{laurent(f(x))} converts the Puiseux series \spad{f(x)} to a Laurent series if possible. Error: if this is not possible.
427110`\spad{laurent(f,x = a)} expands the expression \spad{f} as a Laurent series in powers of \spad{(x - a)}.
427195`\spad{laurent(f,n)} returns a Laurent expansion of the expression \spad{f}. Note: \spad{f} should have only one variable; the series will be expanded in powers of that variable and terms will be computed up to order at least \spad{n}.
427275`\spad{laurent(n,f(x))} returns \spad{x**n * f(x)}.
427368`\spad{laurent(n +-> a(n),x = a,n0..)} returns \spad{sum(n = n0..,a(n) * (x - a)**n)}; \spad{laurent(n +-> a(n),x = a,n0..n1)} returns \spad{sum(n = n0..n1,a(n) * (x - a)**n)}.
427486`\spad{laurent(f,x = a,n)} expands the expression \spad{f} as a Laurent series in powers of \spad{(x - a)}; terms will be computed up to order at least \spad{n}.
427579`\spad{laurent(a(n),n,x=a,n0..)} returns \spad{sum(n = n0..,a(n) * (x - a)**n)}; \spad{laurent(a(n),n,x=a,n0..n1)} returns \spad{sum(n = n0..n1,a(n) * (x - a)**n)}.
427693`\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}.
427750`\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
427809`\spad{lazyGintegrate(f,r,g)} is used for fixed point computations.
427924`\spad{lazyIntegrate(r,f)} is a local function used for fixed point computations.
428046`\axiom{lazyIrreducibleFactors(lp)} returns \axiom{lf} such that if \axiom{lp = [\spad{p1},{}...,{}pn]} and \axiom{lf = [\spad{f1},{}...,{}fm]} then \axiom{p1*p2*...\spad{*pn=0}} means \axiom{f1*f2*...\spad{*fm=0}},{} and the \axiom{\spad{fi}} are irreducible over \axiom{\spad{R}} and are pairwise distinct. The algorithm tries to avoid factorization into irr
428046`--educible factors as far as possible and makes previously use of gcd techniques over \axiom{\spad{R}}.
428259`\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}]}.
428396`\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}]}.
428592`\axiom{lazyPremWithDefault(a,{}\spad{b})} returns \axiom{[\spad{c},{}\spad{g},{}\spad{r}]} such that \axiom{\spad{r} = lazyPrem(a,{}\spad{b})} and \axiom{(c**g)*r = prem(a,{}\spad{b})}.
428848`\axiom{lazyPremWithDefault(a,{}\spad{b},{}\spad{v})} returns \axiom{[\spad{c},{}\spad{g},{}\spad{r}]} such that \axiom{\spad{r} = lazyPrem(a,{}\spad{b},{}\spad{v})} and \axiom{(c**g)*r = prem(a,{}\spad{b},{}\spad{v})}.
429045`\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.
429182`\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.
429386`\axiom{lazyPseudoDivide(a,{}\spad{b})} returns \axiom{[\spad{c},{}\spad{g},{}\spad{q},{}\spad{r}]} such that \axiom{c^n * a = q*b +r} and \axiom{lazyResidueClass(a,{}\spad{b})} returns \axiom{[\spad{r},{}\spad{c},{}\spad{n}]} where \axiom{\spad{n} + \spad{g} = max(0,{} degree(\spad{b}) - degree(a) + 1)}.
429522`\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.
429795`\axiom{lazyPseudoDivide(a,{}\spad{b},{}\spad{v})} returns \axiom{[\spad{c},{}\spad{g},{}\spad{q},{}\spad{r}]} such that \axiom{\spad{r} = lazyPrem(a,{}\spad{b},{}\spad{v})},{} \axiom{(c**g)*r = prem(a,{}\spad{b},{}\spad{v})} and \axiom{\spad{q}} is the pseudo-quotient computed in this lazy pseudo-division.
429936`\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}]}
430014`\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.
430215`\axiom{lazyResidueClass(a,{}\spad{b})} returns \axiom{[\spad{r},{}\spad{c},{}\spad{n}]} such that \axiom{\spad{r}} is reduced \spad{w}.\spad{r}.\spad{t}. \axiom{\spad{b}} and \axiom{\spad{b}} divides \axiom{c^n * a - \spad{r}} where \axiom{\spad{c}} is \axiom{leadingCoefficient(\spad{b})} and \axiom{\spad{n}} is as small as possible with the previous properties.
430340`\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})}.
430468`\axiom{lazyVariations(\spad{l},{}\spad{s1},{}sn)} is the number of sign variations in the list of non null numbers [s1::l]@sn,{}
430664`\spad{lcm(l)} returns the least common multiple of the elements of the list \spad{l}.
430743`\spad{lcm(x,y)} returns the least common multiple of \spad{x} and \spad{y}.
430783`\spad{ldf2lst(ln)} coerces a List of \axiomType{DoubleFloat} to \axiomType{List}(\axiomType{String})
430869`\spad{ldf2lst(ln)} coerces a \axiomType{List DoubleFloat} to \axiomType{List String}
430950`\spad{ldf2lst(ln)} coerces a List of \axiomType{DoubleFloat} to \axiomType{List String}
431023`\spad{ldf2vmf(l)} coerces a \axiomType{List DoubleFloat} to \axiomType{List MachineFloat}
431178`\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.
431247`\spad{leadingBasisTerm(p)} returns the leading basis term of antisymmetric polynomial \spad{p}.
431304`\spad{leadingBasisTerm(df)} returns the leading basis term of differential form \spad{df}.
431379`\spad{leadingCoefficientRicDE(op)} returns \spad{[[m1, p1], [m2, p2], ... , [mk, pk]]} such that the polynomial part of any rational solution of the associated Riccati equation of \spad{op y = 0} must have degree mj for some \spad{j},{} and its leading coefficient is then a zero of pj. In addition,{}\spad{m1>m2> ... >mk}.
431650`\spad{leadingCoefficient(df)} returns the leading coefficient of differential form \spad{df}.
431745`\spad{leadingCoefficient(p)} returns the leading coefficient of antisymmetric polynomial \spad{p}.
431803`\spad{leadingCoefficient(x)} \undocumented
431884`\spad{leadingCoefficient }\undocumented
431949`\spad{leadingCoefficient(f)} gives the coefficient of \spad{f},{} whose corresponding monoid element is the greatest among all those with non-zero coefficients.
432023`\spad{leadingCoefficient(z)} returns the coefficient of the leading (with respect to the ordering on the indexing set) monomial of \spad{z}. Error: if \spad{z} has no support.
432098`\spad{leadingCoefficient(f)} returns the coefficient of the lowest order term of \spad{f}
432178`\spad{leadingCoefficient(p)} returns the coefficient highest degree term of \spad{p}.
432242`\spad{leadingCoefficient(x)} returns the first coefficient which appears in \spad{ListOfTerms(x)}.
432306`\spad{leadingCoefficient(l)} is \spad{a(n)} if \indented{2}{\spad{l = sum(monomial(a(i),i), i = 0..n)}.}
432374`\spad{leadingCoefficient(l)} is \spad{a(n)} if \indented{2}{\spad{l = sum(monomial(a(i),i), i = 0..n)}.}
432526`\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}}.
432605`\spad{leadingExponent(x)} \undocumented
432683`\spad{leadingIdeal(I)} is the ideal generated by the leading terms of the elements of the ideal \spad{I}.
432758`\spad{leadingIndex(x)} \undocumented
432911`\spad{leadingMonomial(f)} gives the monomial of \spad{f} whose corresponding monoid element is the greatest among all those with non-zero coefficients.
432982`\spad{leadingMonomial(x)} \undocumented
433082`\spad{leadingMonomial(x)} returns the first element from \spad{Basis} which appears in \spad{ListOfTerms(x)}.
433147`\spad{leadingMonomial(p)} returns the monomial of \spad{p} with the highest degree.
433209`\spad{leadingMonomial(f)} returns the monomial of \spad{f} of lowest order.
433284`\spad{leadingSupport(z)} returns the index of leading (with respect to the ordering on the indexing set) monomial of \spad{z}. Error: if \spad{z} has no support.
433355`\spad{leadingTerm(x)} returns the first term which appears in \spad{ListOfTerms(x)}.
433601`\spad{leaf?(x)} \undocumented
433649`\spad{leaf?(u)} tests if \spad{u} is a terminal node.
433705`\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}.
433905`\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.
433977`\spad{leastPower(p,n)} returns \spad{e},{} where \spad{e} is the smallest integer such that \spad{p **e >= n}
434149`\spad{leaves(t)} returns the list of values in obtained by visiting the nodes of tree \axiom{\spad{t}} in left-to-right order.
434206`\spad{leftAlternative?()} tests if \spad{2*associator(a,a,b) = 0} for all \spad{a},{} \spad{b} in the algebra. Note: we only can test this; in general we don't know whether \spad{2*a=0} implies \spad{a=0}.
434287`\spad{leftAlternative?()} tests if \spad{2*associator(a,a,b) = 0} for all \spad{a},{} \spad{b} in the algebra. Note: we only can test this; in general we don't know whether \spad{2*a=0} implies \spad{a=0}.
434476`\spad{leftCharacteristicPolynomial(a)} returns the characteristic polynomial of the left regular representation of \spad{a} with respect to any basis.
434590`\spad{leftDiscriminant()} returns the determinant of the \spad{n}-by-\spad{n} matrix whose element at the \spad{i}\spad{-}th row and \spad{j}\spad{-}th column is given by the left trace of the product \spad{vi*vj},{} where \spad{v1},{}...,{}\spad{vn} are the elements of the fixed \spad{R}-module basis. Note: the same as \spad{determinant(leftTraceMatrix())}.
434661`\spad{leftDiscriminant()} returns the determinant of the \spad{n}-by-\spad{n} matrix whose element at the \spad{i}\spad{-}th row and \spad{j}\spad{-}th column is given by the left trace of the product \spad{vi*vj},{} where \spad{v1},{}...,{}\spad{vn} are the elements of the fixed \spad{R}-module basis. Note: the same as \spad{determinant(leftTraceMatrix())}.
434883`\spad{leftDiscriminant([v1,...,vn])} returns the determinant of the \spad{n}-by-\spad{n} matrix whose element at the \spad{i}\spad{-}th row and \spad{j}\spad{-}th column is given by the left trace of the product \spad{vi*vj}. Note: the same as \spad{determinant(leftTraceMatrix([v1,...,vn]))}.
434965`\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''.
435064`\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''.
435179`\spad{leftDivide(a, b, sigma)} returns the pair \spad{[q,r]} such that \spad{a = b*q + r} and the degree of \spad{r} is less than the degree of \spad{b}. This process is called ``left division''. \spad{\sigma} is the morphism to use.
435311`\spad{leftExactQuotient(a,b)} computes the value \spad{q},{} if it exists,{} \indented{1}{such that \spad{a = b*q}.}
435495`\spad{leftExactQuotient(a,b)} computes the value \spad{q},{} if it exists,{} \indented{1}{such that \spad{a = b*q}.}
435710`\spad{leftExtendedGcd(a,b)} returns \spad{[c,d]} such that \spad{g = a * c + b * d = leftGcd(a, b)}.
435836`\spad{leftFactorIfCan(f,h)} returns the left factor (\spad{g} in \spad{f} = \spad{g} \spad{o} \spad{h}) of the functional decomposition of the polynomial \spad{f} with given \spad{h} or \spad{"failed"} if \spad{g} does not exist.
435941`\spad{leftFactor(p,q)} \undocumented
436024`\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.
436156`\spad{leftGcd(a,b)} computes the value \spad{g} of highest degree such that \indented{3}{\spad{a = g*aa}} \indented{3}{\spad{b = g*bb}} for some values \spad{aa} and \spad{bb}. The value \spad{g} is computed using left-division.
436238`\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.
436370`\spad{leftLcm(a,b)} computes the value \spad{m} of lowest degree such that \spad{m = aa*a = bb*b} for some values \spad{aa} and \spad{bb}. The value \spad{m} is computed using right-division.
436556`\spad{leftMinimalPolynomial(a)} returns the polynomial determined by the smallest non-trivial linear combination of left powers of \spad{a}. Note: the polynomial never has a constant term as in general the algebra has no unit.
436684`\spad{leftMult(s, a)} returns \spad{s * a} where \spad{*} is the monoid operation,{} which is assumed non-commutative.
436803`\spad{leftNorm(a)} returns the determinant of the left regular representation of \spad{a}.
436869`\spad{leftOne(eq)} divides by the left hand side.
436940`\spad{leftOne(eq)} divides by the left hand side.
437187`\spad{leftPower(a,n)} returns the \spad{n}\spad{-}th left power of \spad{a},{} \spadignore{i.e.} \spad{leftPower(a,n) := a * leftPower(a,n-1)} and \spad{leftPower(a,0) := 1}.
437253`\spad{leftPower(a,n)} returns the \spad{n}\spad{-}th left power of \spad{a},{} \spadignore{i.e.} \spad{leftPower(a,n) := a * leftPower(a,n-1)} and \spad{leftPower(a,1) := a}.
437308`\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.
437450`\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.
437537`\spad{leftRankPolynomial()} returns the left minimimal polynomial of the generic element
437690`\spad{leftRankPolynomial()} calculates the left minimal polynomial of the generic element in the algebra,{} defined by the same structural constants over the polynomial ring in symbolic coefficients with respect to the fixed basis.
437803`\spad{leftRankPolynomial()} calculates the left minimal polynomial of the generic element in the algebra,{} defined by the same structural constants over the polynomial ring in symbolic coefficients with respect to the fixed basis.
437925`\spad{leftRank(x)} determines the number of linearly independent elements in \spad{x*b1},{}...,{}\spad{x*bn},{} where \spad{b=[b1,...,bn]} is a basis.
438072`\spad{leftRecip(a)} returns an element,{} which is a left inverse of \spad{a},{} or \spad{"failed"} if there is no unit element,{} if such an element doesn't exist or cannot be determined (see unitsKnown).
438177`\spad{leftRecip(a)} returns an element,{} which is a left inverse of \spad{a},{} or \spad{"failed"} if such an element doesn't exist or cannot be determined (see unitsKnown).
438240`\spad{leftReducedSystem [v1,...,vn]} returns a matrix \spad{M} with coefficients in \spad{R} such that the system of equations \spad{c1*v1 + ... + cn*vn = 0\$\%} has the same solution as \spad{c * M = 0} where \spad{c} is the row vector \spad{[c1,...cn]}.
438324`\spad{reducedSystem([v1,...,vn],u)} returns a matrix \spad{M} with coefficients in \spad{R} and a vector \spad{w} such that the system of equations \spad{c1*v1 + ... + cn*vn = u} has the same solution as \spad{c * M = w} where \spad{c} is the row vector \spad{[c1,...cn]}.
438521`\spad{leftRegularRepresentation(a)} returns the matrix of the linear map defined by left multiplication by \spad{a} with respect to the fixed \spad{R}-module basis.
438800`\spad{leftRegularRepresentation(a,[v1,...,vn])} returns the matrix of the linear map defined by left multiplication by \spad{a} with respect to the \spad{R}-module basis \spad{[v1,...,vn]}.
438902`\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.
439046`\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.
439134`\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.
439236`\spad{leftTraceMatrix()} is the \spad{n}-by-\spad{n} matrix whose element at the \spad{i}\spad{-}th row and \spad{j}\spad{-}th column is given by left trace of the product \spad{vi*vj},{} where \spad{v1},{}...,{}\spad{vn} are the elements of the fixed \spad{R}-module basis.
439314`\spad{leftTraceMatrix()} is the \spad{n}-by-\spad{n} matrix whose element at the \spad{i}\spad{-}th row and \spad{j}\spad{-}th column is given by left trace of the product \spad{vi*vj},{} where \spad{v1},{}...,{}\spad{vn} are the elements of the fixed \spad{R}-module basis.
439557`\spad{leftTraceMatrix([v1,...,vn])} is the \spad{n}-by-\spad{n} matrix whose element at the \spad{i}\spad{-}th row and \spad{j}\spad{-}th column is given by the left trace of the product \spad{vi*vj}.
439710`\spad{leftTrace(a)} returns the trace of the left regular representation of \spad{a}.
439777`\spad{leftTrim(s,c)} returns \spad{s} with all leading characters \spad{c} deleted. For example,{} \axiom{leftTrim(" abc ",{} char " ")} returns \axiom{"abc "}.
439835`\spad{leftTrim(s,cc)} returns \spad{s} with all leading characters in \spad{cc} deleted. For example,{} \axiom{leftTrim("(abc)",{} charClass "()")} returns \axiom{"abc)"}.
439972`\spad{leftUnit()} returns a left unit of the algebra (not necessarily unique),{} or \spad{"failed"} if there is none.
440182`\spad{leftUnits()} returns the affine space of all left units of the algebra,{} or \spad{"failed"} if there is none
440306`\spad{leftUnits()} returns the affine space of all left units of the algebra,{} or \spad{"failed"} if there is none.
440443`\spad{leftZero(eq)} subtracts the left hand side.
440506`\axiom{left(\spad{x})} returns left subtree of \axiom{\spad{x}} or error if \axiomOpFrom{retractable?}{LyndonWord}(\axiom{\spad{x}}) is \spad{true}.
440553`\axiom{left(\spad{x})} returns left subtree of \axiom{\spad{x}} or error if \axiomOpFrom{retractable?}{Magma}(\axiom{\spad{x}}) is \spad{true}.
440595`\spad{left(f)} left-justifies form \spad{f} in total space.
440634`\axiom{left(rootChar)} is the left bound of the isolating interval
440726`\spad{left(u)} returns the left child.
440782`\spad{left(f,n)} left-justifies form \spad{f} within space of width \spad{n}.
440829`\spad{legendreP(n,x)} is the \spad{n}-th Legendre polynomial,{} \spad{P[n](x)}. These are defined by \spad{1/sqrt(1-2*x*t+t**2) = sum(P[n](x)*t**n, n = 0..)}.
440945`\spad{legendre(n)} returns the \spad{n}th Legendre polynomial \spad{P[n](x)}. Note: Legendre polynomials,{} denoted \spad{P[n](x)},{} are computed from the two term recurrence. The generating function is: \spad{1/sqrt(1-2*t*x+t**2) = sum(P[n](x)*t**n, n=0..infinity)}.
441057`\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)}.
441180`\spad{length(p)} returns the sum of the absolute values of the coefficients of the polynomial \spad{p}.
441251`\spad{length(x)} returns the length of \spad{x}.
441318`\spad{length([l1]*[l2]*...[ln])} returns the length of the word \spad{l1*l2*...*ln}.
441404`\spad{length(x)} returns the number of elements in tuple \spad{x}
441459`\axiom{length(\spad{x})} returns the number of entries in \axiom{\spad{x}}.
441521`\axiom{length(\spad{x})} returns the number of entries in \axiom{\spad{x}}.
441578`\spad{length(q)} returns the number of elements in the queue. Note: \axiom{length(\spad{q}) = \#q}.
441642`\spad{length(v)} computes the sqrt(dot(\spad{v},{}\spad{v})),{} \spadignore{i.e.} the magnitude
441728`\spad{length(a)} length of \spad{a} in digits.
441778`\spad{lepol }\undocumented
441934`\spad{less?(a, b)} compares \spad{a} and \spad{b} in the partial ordering induced by setOrder.
442015`\spad{less?(u,n)} tests if \spad{u} has less than \spad{n} elements.
442087`\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.
442167`\spad{level(s)} returns a non negative integer which is the current level field of the indicated 3 dimensional subspace \spad{s}.
442226`\spad{level(e)} returns the nesting exit level of `e'
442268`\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}.
442335`\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}.
442433`\axiom{lexTriangular(base,{} norm?)} decomposes the variety associated with \axiom{base} into regular chains. Thus a point belongs to this variety iff it is a regular zero of a regular set in in the output. Note that \axiom{base} needs to be a lexicographical Groebner basis of a zero-dimensional ideal. If \axiom{norm?} is \axiom{\spad{true}} then th
442433`--e regular sets are normalized.
442589`\spad{lex(ls)} sorts a list of pairs to lexicographic order
442657`\axiom{lexico(\spad{x},{}\spad{y})} returns \axiom{\spad{true}} iff \axiom{\spad{x}} is smaller than \axiom{\spad{y}} \spad{w}.\spad{r}.\spad{t}. the lexicographical ordering induced by \axiom{VarSet}.
442714`\axiom{lexico(\spad{x},{}\spad{y})} returns \axiom{\spad{true}} iff \axiom{\spad{x}} is smaller than \axiom{\spad{y}} \spad{w}.\spad{r}.\spad{t}. the lexicographical ordering induced by \axiom{VarSet}. \spad{N}.\spad{B}. This operation does not take into account the tree structure of its arguments. Thus this is not a total ordering.
442766`\spad{lexico(x,y)} returns \spad{true} iff \spad{x} is smaller than \spad{y} \spad{w}.\spad{r}.\spad{t}. the pure lexicographical ordering induced by \spad{S}.
442825`\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.
442936`\spad{lfextlimint(f,x,k,[k1,...,kn])} returns functions \spad{[h, c]} such that \spad{dh/dx = f - c dk/dx}. Value \spad{h} is looked for in a field containing \spad{f} and \spad{k1},{}...,{}kn (the \spad{ki}'s must be logs).
443069`\spad{lfinfieldint(f, x)} returns a function \spad{g} such that \spad{dg/dx = f} if \spad{g} exists,{} "failed" otherwise.
443153`\spad{lfintegrate(f, x)} = \spad{g} such that \spad{dg/dx = f}.
443239`\spad{lflimitedint(f,x,[g1,...,gn])} returns functions \spad{[h,[[ci, gi]]]} such that the \spad{gi}'s are among \spad{[g1,...,gn]},{} and \spad{d(h+sum(ci log(gi)))/dx = f},{} if possible,{} "failed" otherwise.
443391`\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
443448`\spad{lhs(f)} returns the left side of \spad{f}
443491`\spad{lhs(r)} returns the left hand side of the rule \spad{r}.
443539`\spad{lhs(eqn)} returns the left hand side of equation \spad{eqn}.
443577`\spad{lhs(e)} returns the left hand side of the case expression `e'.
443617`\spad{lhs(e)} returns the left hand side of the colon expression `e'.
443658`\spad{lhs(e)} returns the left hand side of the has expression `e'.
443697`\spad{lhs(e)} returns the left hand side of the is expression `e'.
443735`\spad{lhs(e)} returns the left hand side of the assignment expression `e'.
443774`\spad{li(f)} denotes the logarithmic integral
443823`\spad{li(x)} returns the logarithmic integral of \spad{x},{} \spadignore{i.e.} the integral of \spad{dx / log(x)}.
443877`\spad{library(ln)} creates a new library file.
443922`\spad{lieAdmissible?()} tests if the algebra defined by the commutators is a Lie algebra,{} \spadignore{i.e.} satisfies the Jacobi identity. The property of anticommutativity follows from definition.
444001`\spad{lieAdmissible?()} tests if the algebra defined by the commutators is a Lie algebra,{} \spadignore{i.e.} satisfies the Jacobi identity. The property of anticommutativity follows from definition.
444077`\spad{lieAlgebra?()} tests if the algebra is anticommutative and \spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} for all \spad{a},{}\spad{b},{}\spad{c} in the algebra (Jacobi identity). Example: for every associative algebra \spad{(A,+,@)} we can construct a Lie algebra \spad{(A,+,*)},{} where \spad{a*b := a@b-b@a}.
444153`\spad{lieAlgebra?()} tests if the algebra is anticommutative and \spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} for all \spad{a},{}\spad{b},{}\spad{c} in the algebra (Jacobi identity). Example: for every associative algebra \spad{(A,+,@)} we can construct a Lie algebra \spad{(A,+,*)},{} where \spad{a*b := a@b-b@a}.
444297`\spad{lift(x)} return the canonical representative of the equivalence class \spad{x}
444366`\spad{lift(x)} \undocumented
444411`\spad{lift(z)} returns a minimal degree univariate polynomial up such that \spad{z=reduce up}.
444462`\spad{lift(u,k)} \undocumented
444620`\spad{lift should} be local
444861`\spad{lifting1(u,lv,lu,lr,lp,lt,ln,t,r)} \undocumented
445183`\spad{lifting(u,lv,lu,lr,lp,ln,r)} \undocumented
445408`\spad{light(c)} sets the shade of a hue,{} \spad{c},{} to it's highest value.
445448`\spad{lighting(v,x,y,z)} sets the position of the light source to the coordinates \spad{x},{} \spad{y},{} and \spad{z} and displays the graph for the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport}.
445525`\spad{limitPlus(f(var))} returns \spad{limit(var -> a+,f(var))}.
445628`\spad{limitPlus(f(var))} returns \spad{limit(var -> cen+,f(var))}.
445760`\spad{limit(f(x),x = a)} computes the real limit \spad{lim(x -> a,f(x))}.
445999`\spad{limit(f(x),x = a)} computes the real two-sided limit of \spad{f} as its argument \spad{x} approaches \spad{a}.
446326`\spad{limit(f(x),x = a)} computes the real two-sided limit of \spad{f} as its argument \spad{x} approaches \spad{a}.
446662`\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))}.
446776`\spad{limit(f(x),x,a,"left")} computes the real limit of \spad{f} as its argument \spad{x} approaches \spad{a} from the left; limit(\spad{f}(\spad{x}),{}\spad{x},{}a,{}"right") computes the corresponding limit as \spad{x} approaches \spad{a} from the right.
446955`\spad{limitedIntegrate(f, x, [g1,...,gn])} returns fractions \spad{[h, [[ci,gi]]]} such that the \spad{gi}'s are among \spad{[g1,...,gn]},{} \spad{dci/dx = 0},{} and \spad{d(h + sum(ci log(gi)))/dx = f} if possible,{} "failed" otherwise.
447225`\spad{limitedint(f, [g1,...,gn])} returns fractions \spad{[h,[[ci, gi]]]} such that the \spad{gi}'s are among \spad{[g1,...,gn]},{} \spad{ci' = 0},{} and \spad{(h+sum(ci log(gi)))' = f},{} if possible,{} "failed" otherwise.
447422`\spad{linGenPos }\undocumented
447613`\spad{linSolve(lp,lvar)} finds the solutions of the linear system of polynomials \spad{lp} = 0 with respect to the list of symbols \spad{lvar}.
447783`\spad{lineColorDefault()} returns the default color of lines connecting points in a 2D viewport.
447846`\spad{lineColorDefault(p)} sets the default color of lines connecting points in a 2D viewport to the palette \spad{p}.
447916`\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}.
447990`\spad{linear?(e)} tests if \axiom{\spad{e}} is a linear function.
448064`\spad{linear?(l)} returns \spad{true} if all the bounds \spad{l} are either linear or simple.
448246`\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{line
448246`--arAssociatedExp} is defined completely by its action on monomials from {\em F[X]}: \spadfun{linearAssociatedExp}(a,{}monomial(1,{}\spad{k})\$SUP(\spad{F})) is defined to be \spadfun{Frobenius}(a,{}\spad{k}) which is {\em a**(q**k)},{} where {\em q=size()\$F}.
448465`\spad{linearAssociatedLog(a)} returns a polynomial {\em g},{} such that \spadfun{linearAssociatedExp}(normalElement(),{}\spad{g}) equals {\em a}.
448699`\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.
448936`\spad{linearAssociatedOrder(a)} retruns the monic polynomial {\em g} of least degree,{} such that \spadfun{linearAssociatedExp}(a,{}\spad{g}) is 0.
449054`\spad{linearlyDependenceOverZ([v1,...,vn])} returns \spad{[c1,...,cn]} if \spad{c1*v1 + ... + cn*vn = 0} and not all the \spad{ci}'s are 0,{} "failed" if the \spad{vi}'s are linearly independent over the integers.
449162`\spad{linearDependence([v1,...,vn])} returns \spad{[c1,...,cn]} if \spad{c1*v1 + ... + cn*vn = 0} and not all the \spad{ci}'s are 0,{} "failed" if the \spad{vi}'s are linearly independent over \spad{S}.
449254`\spad{linearElement [x1,..,xn]} returns a linear element \indented{1}{with coordinates \spad{[x1,..,xn]} with respect to} the basis elements \spad{B}.
449315`\spad{linearForm [x1,..,xn]} constructs a linear form with coordinates \spad{[x1,..,xn]} with respect to the basis elements \spad{DualBasis B}.
449370`\spad{linearMatrix(l,n)} returns a matrix of coefficients of the linear functions in \axiom{\spad{l}}. If \spad{l} is empty,{} the matrix has at least one row.
449486`\spad{linearPart(l)} returns the list of linear functions of \axiom{\spad{l}}.
449591`\axiom{linearPolynomials(lp)} returns \axiom{lps,{}nlps} where \axiom{lps} is a list of the linear polynomials in lp,{} and \axiom{nlps} are the other ones.
449714`\spad{linear(u)} \undocumented
449781`\spad{linear(f,g)} \undocumented
449849`\spad{linearlyDependent?([v1,...,vn])} returns \spad{true} if the \spad{vi}'s are linearly dependent over \spad{S},{} \spad{false} otherwise.
449925`\spad{linearlyDependentOverZ?([v1,...,vn])} returns \spad{true} if the \spad{vi}'s are linearly dependent over the integers,{} \spad{false} otherwise.
450011`\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}.
450083`\spad{linefeed} designates the line feed character.
450123`\spad{linkToFortran(s,l,t,lv)} \undocumented{}
450229`\spad{linkToFortran(s,l,ll,lv)} \undocumented{}
450405`\spad{linkToFortran(s,l,ll,lv,t)} \undocumented{}
450588`\spad{lintgcd([a1,..,ak])} = gcd of a list of integers
450646`\spad{list?(s)} is \spad{true} if \spad{s} is a Lisp list,{} possibly ().
450722`\spad{listBranches(c)} returns a list of lists of points,{} representing the branches of the curve \spad{c}.
450814`\spad{listBranches(c)} returns a list of lists of points,{} representing the branches of the curve \spad{c}.
450906`\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.
451140`\spad{listLoops(t)} returns the list of lists of points,{} or the 'loops',{} of the given tube plot \spad{t}.
451286`\spad{listOfLists(m)} returns the rows of the matrix \spad{m} as a list of lists.
451358`\spad{listOfLists(m)} returns the rows of the matrix \spad{m} as a list of lists.
451445`\spad{listOfLists t} converts a tableau \spad{t} to a list of lists.
451502`\spad{listOfMonoms(l)} returns the list of the monomials forming \spad{l}.
451583`\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.
451676`\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 ma
451676`--keYoungTableau} are used. The entries are from {\em 0,...,n-1}.
451832`\spad{list(x)} returns the list of one element \spad{x}.
451876`\spad{list(sy)} takes a scripted symbol and produces a list of the name followed by the scripts.
451917`\spad{listexp }\undocumented
451990`\spad{lists(r)} returns the list of matches that match lists.
452070`\spad{littleEndian} describes little endian host
452114`\spad{lllip(s)} checks to see if the \spadtype{ThreeSpace},{} \spad{s},{} is composed of a list of components,{} which are lists of curves,{} which are lists of indices to points,{} and if so,{} returns the list of lists of lists; An error is signaled otherwise.
452199`\spad{lllp(s)} checks to see if the \spadtype{ThreeSpace},{} \spad{s},{} is composed of a list of components,{} which are lists of curves,{} which are lists of points,{} and if so,{} returns the list of lists of lists; An error is signaled otherwise.
452273`\spad{llprop(s)} checks to see if the \spadtype{ThreeSpace},{} \spad{s},{} is composed of a list of curves which are lists of the subspace component properties of the curves,{} and if so,{} returns the list of lists; An error is signaled otherwise.
452360`\spad{lo(s)} returns the first endpoint of \spad{s}. Note: \spad{lo(l..h) = l}.
452404`\spad{loadNativeModule(path)} loads the native modile designated by \spadvar{\spad{path}}.
452457`\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't allow it.
452537`\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't allow it.
452629`\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 t
452629`--he \spad{i}th element of the integral basis is \spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of \spad{basis} contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix \spad{basisInv} contains the coordinates of \spad{wi} with respect to the basis \spad{v1,...,vn}: if \spad{basisInv} is the matrix \spad{(bij, i = 1..n, j = 1..n)},{} then \spad{wi = sum(bij * vj, j = 1..n)}.
452776`\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 elemen
452776`--t of the local integral basis is \spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of \spad{basis} contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix \spad{basisInv} contains the coordinates of \spad{wi} with respect to the basis \spad{v1,...,vn}: if \spad{basisInv} is the matrix \spad{(bij, i = 1..n, j = 1..n)},{} then \spad{wi = sum(bij * vj, j = 1..n)}.
452903`\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
452903`-- \spad{i}th element of the local integral basis is \spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of 'basis' contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix 'basisInv' contains the coordinates of \spad{wi} with respect to the basis \spad{v1,...,vn}: if 'basisInv' is the matrix \spad{(bij, i = 1..n, j = 1..n)},{} then \spad{wi = sum(bij * vj, j = 1..n)}.
453041`\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 
453041`--element of the local integral basis is \spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of \spad{basis} contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix \spad{basisInv} contains the coordinates of \spad{wi} with respect to the basis \spad{v1,...,vn}: if \spad{basisInv} is the matrix \spad{(bij, i = 1..n, j = 1..n)},{} then \spad{wi = sum(bij * vj, j = 1..n)}.
453174`\spad{localReal?(x)} should be local but conditional
453236`\spad{localUnquote(f,ls)} is a local function.
453304`\spad{log10()} returns \spad{ln 10}: \spad{2.3025809299...}.
453337`\spad{log10(x)} computes the logarithm with base 10 for \spad{x}.
453378`\spad{log10(x)} computes the logarithm for \spad{x} to base 10.
453413`\spad{log10(x)} represents the Fortran intrinsic function \spad{LOG10}
453495`\spad{log2()} returns \spad{ln 2},{} \spadignore{i.e.} \spad{0.6931471805...}.
453527`\spad{log2(x)} computes the logarithm with base 2 for \spad{x}.
453567`\spad{log2(x)} computes the logarithm for \spad{x} to base 2.
453601`\spad{logGamma(x)} is the natural log of \spad{Gamma(x)}. This can often be computed even if \spad{Gamma(x)} cannot.
453697`\spad{logGamma(x)} is the natural log of \spad{Gamma(x)}. This can often be computed even if \spad{Gamma(x)} cannot.
453775`\spad{logIfCan(z)} returns log(\spad{z}) if possible,{} and "failed" otherwise.
453855`\spad{log(x)} applies the logarithm operator to \spad{x}
453904`\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)}.
454107`\spad{log(st)} computes the log of a power series.
454190`\spad{log(st)} computes the log of a power series.
454287`\spad{log(z)} returns the logarithm of Laurent series \spad{z}.
454373`\spad{log(z)} returns the logarithm of a Puiseux series \spad{z}.
454468`\axiom{log(\spad{p})} returns the logarithm of \axiom{\spad{p}}.
454548`\spad{log(x)} returns the natural logarithm of \spad{x}.
454602`\spad{log(x)} represents the Fortran intrinsic function LOG
454682`\axiom{log(\spad{p},{} \spad{n})} returns the logarithm of \axiom{\spad{p}} truncated at order \axiom{\spad{n}}.
454770`\axiom{log(\spad{p},{}\spad{n})} returns the logarithm of \axiom{\spad{p}} (truncated up to order \axiom{\spad{n}}).
454873`\spad{logical?(t)} tests whether \spad{t} is equivalent to the FORTRAN type LOGICAL.
454928`\spad{logpart(ir)} returns the logarithmic part of an integration result
455089`\spad{lookupFunction x} returns the name of the lookup function associated with the functor data \spad{x}.
455209`\spad{lookup(x)} \undocumented{} See \axiomFunFrom{lookup}{Finite}
455295`\spad{lookup(x)} returns a positive integer such that \spad{x = index lookup x}.
455345`\spad{loopPoints(p,n,b,r,lls)} creates and returns a list of points which form the loop with radius \spad{r},{} around the center point indicated by the point \spad{p},{} with the principal normal vector of the space curve at point \spad{p} given by the point(vector) \spad{n},{} and the binormal vector given by the point(vector) \spad{b},{} and 
455345`--a list of lists,{} \spad{lls},{} which is the \spadfun{cosSinInfo} of the number of points defining the loop.
455505`\spad{low(s)} returns the first endpoint of \spad{s}. Note: \spad{low(l..h) = l}.
455550`\spad{lowerBound(i)} returns the lower bound on the values assumed by the iteration variable.
455597`\spad{lowerCase!(s)} destructively replaces the alphabetic characters in \spad{s} by lower case.
455647`\spad{lowerCase?(c)} tests if \spad{c} is an lower case letter,{} \spadignore{i.e.} one of a..\spad{z}.
455696`\spad{lowerCase()} returns the class of all characters for which \spadfunFrom{lowerCase?}{Character} is \spad{true}.
455788`\spad{lowerCase(s)} returns the string with all characters in lower case.
455837`\spad{lowerCase(c)} converts an upper case letter to the corresponding lower case letter. If \spad{c} is not an upper case letter,{} then it is returned unchanged.
455880`\spad{lowerPolynomial(upoly)} converts \spad{upoly} to be a univariate polynomial over \spad{R}. An error if the coefficients contain variables.
456002`\spad{lp(s)} returns the list of points component which the \spadtype{ThreeSpace},{} \spad{s},{} contains; these points are used by reference,{} \spadignore{i.e.} the component holds indices referring to the points rather than the points themselves. This allows for sharing of the points.
456062`\spad{lprop(s)} checks to see if the \spadtype{ThreeSpace},{} \spad{s},{} is composed of a list of subspace component properties,{} and if so,{} returns the list; An error is signaled otherwise.
456142`\spad{lquo(x, s)} returns the exact left quotient of \spad{x} by \spad{s}.
456209`\spad{lquo(x, y)} returns the exact left quotient of \spad{x} by \spad{y} \spadignore{i.e.} \spad{q} such that \spad{x = y * q},{} "failed" if \spad{x} is not of the form \spad{y * q}.
456278`\axiom{lquo(\spad{x},{}\spad{y})} returns the left simplification of \axiom{\spad{x}} by \axiom{\spad{y}}.
456390`\spad{lquo(x,w)} returns the left simplification of \spad{x} by the word \spad{w}.
456459`\spad{lquo(x,y)} returns the left simplification of \spad{x} by \spad{y}.
456509`\spad{lquo(x,v)} returns the left simplification of \spad{x} by the variable \spad{v}.
456559`\axiom{lyndon?(\spad{w})} test if \axiom{\spad{w}} is a Lyndon word.
456637`\axiom{lyndonIfCan(\spad{w})} convert \axiom{\spad{w}} into a Lyndon word.
456730`\axiom{lyndon(\spad{w})} convert \axiom{\spad{w}} into a Lyndon word,{} error if \axiom{\spad{w}} is not a Lyndon word.
456802`\spad{macroExpand(s,e)} traverses the syntax object \spad{s} replacing all (niladic) macro invokations with the corresponding substitution.
456922`\spad{magnitude(v)} computes the sqrt(dot(\spad{v},{}\spad{v})),{} \spadignore{i.e.} the length
457011`\axiom{mainCharacterization(\spad{x})} is the main algebraic quantity of \axiom{\spad{x}} (\axiom{SEG})
457240`\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.
457387`\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}}.
457473`\axiom{mainDefiningPolynomial(\spad{x})} is the defining polynomial for the main algebraic quantity of \axiom{\spad{x}}
457579`\spad{mainExpression(e)} returns the main expression of the `where' expression `e'.
457631`\axiom{mainForm(\spad{x})} is the main algebraic quantity name of \axiom{\spad{x}}
457845`\spad{mainKernel(f)} returns a kernel of \spad{f} with maximum nesting level,{} or if \spad{f} has no kernels (\spadignore{i.e.} \spad{f} is a constant).
457986`\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})}.
458131`\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.
458281`\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}}.
458446`\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}}.
458539`\axiom{mainValue(\spad{x})} is the expression of \axiom{\spad{x}} in terms of \axiom{SparseUnivariatePolynomial(\$)}
458714`\axiom{mainVariable?(\spad{v},{}ps)} returns \spad{true} iff \axiom{\spad{v}} is the main variable of some polynomial in \axiom{ps}.
458799`\spad{mainVariable(f)} returns the highest variable appearing in the numerator or the denominator of \spad{f},{} "failed" if \spad{f} has no variables.
458996`\spad{mainVariable(f)} returns the highest variable appearing in the numerator or the denominator of \spad{f},{} "failed" if \spad{f} has no variables.
459093`\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?
459260`\axiom{mainVariables(ps)} returns the decreasingly sorted list of the variables which are main variables of some polynomial in \axiom{ps}.
459343`\spad{makeCos(e,r)} makes a sin expression with given argument and coefficient
459394`\spad{makeCrit }\undocumented
459601`\spad{makeEq(lsol,lvar)} returns a list of equations formed by corresponding members of \spad{lvar} and \spad{lsol}.
459715`\spad{makeFR(flist)} turns the final factorization of henselFact into a \spadtype{Factored} object.
459841`\spad{makeFR(unit,listOfFactors)} creates a factored object (for use by factoring code).
459956`\spad{makeFloatFunction(expr, x)} returns a Lisp function \spad{f: \axiomType{DoubleFloat} -> \axiomType{DoubleFloat}} defined by \spad{f(x) == expr}. Function \spad{f} is compiled and directly applicable to objects of type \axiomType{DoubleFloat}.
460056`\spad{makeFloatFunction(expr, x, y)} returns a Lisp function \spad{f: (\axiomType{DoubleFloat}, \axiomType{DoubleFloat}) -> \axiomType{DoubleFloat}} defined by \spad{f(x, y) == expr}. Function \spad{f} is compiled and directly applicable to objects of type \spad{(\axiomType{DoubleFloat}, \axiomType{DoubleFloat})}.
460175`\spad{makeGraphImage(llp)} returns a graph of the domain \spadtype{GraphImage} which is composed of the points and lines from the list of lists of points,{} \spad{llp},{} with default point size and default point and line colours. The graph data is then sent to the viewport manager where it waits to be included in a two-dimensional viewport window.
460252`\spad{makeGraphImage(gi)} takes the given graph,{} \spad{gi} of the domain \spadtype{GraphImage},{} and sends it's data to the viewport manager where it waits to be included in a two-dimensional viewport window. \spad{gi} cannot be an empty graph,{} and it's elements must have been created using the \spadfun{point} or \spadfun{component} functions,{} not by a previous \spadfun{makeGraphImage}.
460301`\spad{makeGraphImage(llp,lpal1,lpal2,lp)} returns a graph of the domain \spadtype{GraphImage} which is composed of the points and lines from the list of lists of points,{} \spad{llp},{} whose point colors are indicated by the list of palette colors,{} \spad{lpal1},{} and whose lines are colored according to the list of palette colors,{} \spad{lpal2}. The paramater \spad{lp} is 
460301`--a list of integers which denote the size of the data points. The graph data is then sent to the viewport manager where it waits to be included in a two-dimensional viewport window.
460428`\spad{makeGraphImage(llp,lpal1,lpal2,lp,lopt)} returns a graph of the domain \spadtype{GraphImage} which is composed of the points and lines from the list of lists of points,{} \spad{llp},{} whose point colors are indicated by the list of palette colors,{} \spad{lpal1},{} and whose lines are colored according to the list of palette colors,{} \spad{lpal2}. The p
460428`--aramater \spad{lp} is a list of integers which denote the size of the data points,{} and \spad{lopt} is the list of draw command options. The graph data is then sent to the viewport manager where it waits to be included in a two-dimensional viewport window.
460572`\spad{makeMulti(l)} returns the element whose list of monomials is \spad{l}.
460650`\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)}.
460793`\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)}.
460951`\spad{makeObject(curve(f(t),g(t),h(t)),t = a..b)} returns a space of the domain \spadtype{ThreeSpace} which contains the graph of the parametric curve \spad{x = f(t)},{} \spad{y = g(t)},{} \spad{z = h(t)} as \spad{t} ranges from \spad{min(a,b)} to \spad{max(a,b)}; \spad{h(t)} is the default title.
461076`\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.
461236`\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)}.
461399`\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)}.
461569`\spad{makeObject(f(x,y),x = a..b,y = c..d)} returns a space of the domain \spadtype{ThreeSpace} which contains the graph of \spad{z = f(x,y)} as \spad{x} ranges from \spad{min(a,b)} to \spad{max(a,b)} and \spad{y} ranges from \spad{min(c,d)} to \spad{max(c,d)}; \spad{f(x,y)} appears as the default title.
461694`\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.
461869`\spad{makeObject(curve(f(t),g(t),h(t)),t = a..b,l)} returns a space of the domain \spadtype{ThreeSpace} which contains the graph of the parametric curve \spad{x = f(t)},{} \spad{y = g(t)},{} \spad{z = h(t)} as \spad{t} ranges from \spad{min(a,b)} to \spad{max(a,b)}; \spad{h(t)} is the default title,{} and the options contained in the list \spad{l} of the domain \
461869`--spad{DrawOption} are applied.
462011`\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
462011`--)}.
462193`\spad{makeObject(surface(f(u,v),g(u,v),h(u,v)),u = a..b,v = c..d)} returns a space of the domain \spadtype{ThreeSpace} which contains the graph of the parametric surface \spad{x = f(u,v)},{} \spad{y = g(u,v)},{} \spad{z = h(u,v)} as \spad{u} ranges from \spad{min(a,b)} to \spad{max(a,b)} and \spad{v} ranges from \spad{min(c,d)} to \spad{max(c,d)}; \spad{h(t)} i
462193`--s the default title.
462337`\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{DrawOpt
462337`--ion} are applied.
462517`\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 
462517`--domain \spad{DrawOption} are applied.
462704`\spad{makeObject(f(x,y),x = a..b,y = c..d,l)} returns a space of the domain \spadtype{ThreeSpace} which contains the graph of \spad{z = f(x,y)} as \spad{x} ranges from \spad{min(a,b)} to \spad{max(a,b)} and \spad{y} ranges from \spad{min(c,d)} to \spad{max(c,d)}; \spad{f(x,y)} is the default title,{} and the options contained in the list \spad{l} of the domain \s
462704`--pad{DrawOption} are applied.
462846`\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)}
462846`-- to \spad{max(c,d)}. The options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
463045`\spad{makeObject(surface(f(u,v),g(u,v),h(u,v)),u = a..b,v = c..d,l)} returns a space of the domain \spadtype{ThreeSpace} which contains the graph of the parametric surface \spad{x = f(u,v)},{} \spad{y = g(u,v)},{} \spad{z = h(u,v)} as \spad{u} ranges from \spad{min(a,b)} to \spad{max(a,b)} and \spad{v} ranges from \spad{min(c,d)} to \spad{max(c
463045`--,d)}; \spad{h(t)} is the default title,{} and the options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
463206`\spad{makeRecord(a,b)} creates a record object with type Record(part1:S,{} part2:R),{} where \spad{part1} is \spad{a} and \spad{part2} is \spad{b}.
463278`\spad{makeResult(r1,r2)} makes the combined result [\spad{r1},{}\spad{r2}].
463474`\spad{makeSUP(p)} converts the polynomial \spad{p} to be of type SparseUnivariatePolynomial over the same coefficients.
463564`\spad{makeSeries(refer,str)} creates a power series from the reference \spad{refer} and the stream \spad{str}.
463705`\spad{makeSin(e,r)} makes a sin expression with given argument and coefficient
463756`\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} 
463756`--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 plott
463756`--ed.
463899`\spad{makeTerm(s, e)} returns the monomial \spad{s} exponentiated by \spad{e} (\spadignore{e.g.} s^e or \spad{e} * \spad{s}).
463954`\spad{makeUnit()} returns the unit element of the monomial.
464194`\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.
464291`\spad{makeVariable(p)} views \spad{p} as an element of a differential ring,{} in such a way that the \spad{n}-th derivative of \spad{p} may be simply referenced as \spad{z}.\spad{n} where \spad{z} := makeVariable(\spad{p}). Note: In the interpreter,{} \spad{z} is given as an internal map,{} which may be ignored.
464412`\spad{makeVariable(s, n)} returns the \spad{n}-th derivative of a differential indeterminate \spad{s} as an algebraic indeterminate.
464498`\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}.
464559`\spad{makeViewport2D(gi,lopt)} creates and displays a viewport window of the domain \spadtype{TwoDimensionalViewport} whose graph field is assigned to be the given graph,{} \spad{gi},{} of domain \spadtype{GraphImage},{} and whose options field is set to be the list of options,{} \spad{lopt} of domain \spadtype{DrawOption}.
464645`\spad{makeViewport3D(v)} takes the given three-dimensional viewport,{} \spad{v},{} of the domain \spadtype{ThreeDimensionalViewport} and displays a viewport window on the screen which contains the contents of \spad{v}.
464708`\spad{makeViewport3D(sp,lopt)} takes the given space,{} \spad{sp} which is of the domain \spadtype{ThreeSpace} and displays a viewport window on the screen which contains the contents of \spad{sp},{} and whose draw options are indicated by the list \spad{lopt},{} which is a list of options from the domain \spad{DrawOption}.
464809`\spad{makeViewport3D(sp,s)} takes the given space,{} \spad{sp} which is of the domain \spadtype{ThreeSpace} and displays a viewport window on the screen which contains the contents of \spad{sp},{} and whose title is given by \spad{s}.
464900`\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}.
465083`\spad{makeop should} be local but conditional
465157`\spad{makeprod(a,b)} \undocumented
465203`\axiom{makingStats?()} returns \spad{true} iff the statisitics process is running.
465281`\spad{mantissa(x)} returns the mantissa part of \spad{x}.
465338`\spad{mantissa(u)} returns the mantissa of \spad{u}
465867`\spad{map!(f,a)} assign \spad{a(i,j)} to \spad{f(a(i,j))} for all \spad{i, j}
465941`\spad{map!(f,u)} destructively replaces each element \spad{x} of \spad{u} by \axiom{\spad{f}(\spad{x})}.
466035`\spad{mapBivariate(f,p(x,y))} applies the function \spad{f} to the coefficients of \spad{p(x,y)}.
466172`\spad{mapCoef(f, e1 a1 +...+ en an)} returns \spad{f(e1) a1 +...+ f(en) an}.
466241`\spad{mapDown!(t,p,f)} returns \spad{t} after traversing \spad{t} in "preorder" (node then left then right) fashion replacing the successive interior nodes as follows. The root value \spad{x} is replaced by \spad{q} := \spad{f}(\spad{p},{}\spad{x}). The mapDown!(\spad{l},{}\spad{q},{}\spad{f}) and mapDown!(\spad{r},{}\spad{q},{}\spad{f}) are evaluated for the left and right subtrees \spad{l} and \spad{r} of \spad{t}.
466306`\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 \s
466306`--pad{t},{} is evaluated producing two values pl and pr. Then \spad{mapDown!(l,pl,f)} and \spad{mapDown!(l,pr,f)} are evaluated.
466379`\spad{mapExpon(f, a1\^e1 ... an\^en)} returns \spad{a1\^f(e1) ... an\^f(en)}.
466440`\spad{mapExpon(f, a1\^e1 ... an\^en)} returns \spad{a1\^f(e1) ... an\^f(en)}.
466504`\spad{mapExpon(f, a1\^e1 ... an\^en)} returns \spad{a1\^f(e1) ... an\^f(en)}.
466667`\spad{mapExponents(fn,u)} maps function \spad{fn} onto the exponents of the non-zero monomials of polynomial \spad{u}.
466739`\spad{mapGen(f, a1\^e1 ... an\^en)} returns \spad{f(a1)\^e1 ... f(an)\^en}.
466798`\spad{mapGen(f, a1\^e1 ... an\^en)} returns \spad{f(a1)\^e1 ... f(an)\^en}.
466848`\spad{mapGen(f, a1\^e1 ... an\^en)} returns \spad{f(a1)\^e1 ... f(an)\^en}.
466907`\spad{mapGen(f, e1 a1 +...+ en an)} returns \spad{e1 f(a1) +...+ en f(an)}.
466975`\spad{mapMatrixIfCan(f,mat)} applies the function \spad{f} to the coefficients of the entries of \spad{mat} if possible,{} and returns \spad{"failed"} otherwise.
467133`\spad{mapSolve(u,f)} \undocumented
467254`\spad{mapUnivariateIfCan(f,p(x))} applies the function \spad{f} to the coefficients of \spad{p(x)},{} if possible,{} and returns \spad{"failed"} otherwise.
467400`\spad{mapUnivariate(f,p(x))} applies the function \spad{f} to the coefficients of \spad{p(x)}.
467509`\spad{mapUnivariate(f,p(x))} applies the function \spad{f} to the coefficients of \spad{p(x)}.
467618`\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.
467678`\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 identic
467678`--al shape at \spad{t}.
467878`\spad{map(f,df)} replaces each coefficient \spad{x} of differential form \spad{df} by \spad{f(x)}.
467985`\spad{map(f,p)} \undocumented{}
468334`\spad{map(f,p)} changes each coefficient of \spad{p} by the application of \spad{f}.
468385`\spad{map(fn,u)} maps function \spad{fn} onto the coefficients of the non-zero monomials of \spad{u}.
468435`\spad{map(fn,x)} returns \spad{Sum(fn(r_i) w_i)} if \spad{x} writes \spad{Sum(r_i w_i)}.
468490`\axiom{map(func,{} poly)} creates a new polynomial by applying func to every non-zero coefficient of the polynomial poly.
468629`\spad{map(f, p)} lifts \spad{f} to the domain of \spad{p} then applies it to \spad{p}.
469037`\spad{map(f,x)} returns a propositional formula where all atoms in \spad{x} have been replaced by the result of applying the function \spad{f} to them.
469149`\spad{map(f,x)} \undocumented
469241`\spad{map(f,z)} returns the new element created by applying the function \spad{f} to each component of the direct product element \spad{z}.
469309`\spad{map(f, v)} applies the function \spad{f} to every element of the vector \spad{v} producing a new vector containing the values.
469412`\spad{map(func,frac)} applies the function \spad{func} to the numerator and denominator of the fraction \spad{frac}.
469488`\spad{map(f,[x0,x1,x2,...])} returns \spad{[f(x0),f(x1),f(x2),..]}.
469579`\spad{map(fn,u)} applies \spad{fn} to each element of list \spad{u} and returns a new list with the results. For example \spad{map(square,[1,2,3]) = [1,4,9]}.
469643`\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.
469752`\spad{map(f, [(v1,a1),...,(vn,an)])} returns the matching result [(\spad{v1},{}\spad{f}(\spad{a1})),{}...,{}(vn,{}\spad{f}(an))].
469864`\spad{map(f,a)} applies function \spad{f} to each member of primitive array \spad{a} resulting in a new primitive array over a possibly different underlying domain.
469958`\spad{map(func,frac)} applies the function \spad{func} to the numerator and denominator of \spad{frac}.
470031`\spad{map(f,s)} returns a stream whose elements are the function \spad{f} applied to the corresponding elements of \spad{s}. Note: \spad{map(f,[x0,x1,x2,...]) = [f(x0),f(x1),f(x2),..]}.
470101`\spad{map(f, v)} applies the function \spad{f} to every element of the vector \spad{v} producing a new vector containing the values.
470171`\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"}.
470273`\spad{map(f,x)} \undocumented
470397`\spad{map(f,x)} \undocumented
470521`\spad{map(f,x)} \undocumented
470636`\spad{map(f,g(x))} applies the map \spad{f} to the coefficients of \indented{1}{the Taylor series \spad{g(x)}.}
470738`\spad{map(f,g(x))} applies the map \spad{f} to the coefficients of the Laurent series \spad{g(x)}.
470923`\spad{map(f,g(x))} applies the map \spad{f} to the coefficients of the Puiseux series \spad{g(x)}.
471108`\spad{map(f,ire)} \undocumented
471211`\spad{map(f, k)} returns \spad{g = op(f(a1),...,f(an))} where \spad{k = op(a1,...,an)}.
471282`\spad{map(f,ue)} \undocumented
471379`\spad{map(f,ufe)} \undocumented
471596`\spad{map(f,ure)} \undocumented
471741`\spad{map(fn,u)} maps function \spad{fn} onto the coefficients of the non-zero monomials of \spad{u}.
471798`\spad{map(fn,u)} maps function \spad{fn} onto the coefficients \indented{1}{of the non-zero monomials of \spad{u}.}
471855`\spad{map(f, ex)} evaluates ex,{} applying \spad{f} to values of type \spad{R} in ex.
471910`\spad{map(f,a)} returns \spad{b},{} where \spad{b(i,j) = a(i,j)} for all \spad{i},{} \spad{j}.
471985`\spad{map(f,a)} returns \spad{b},{} where \spad{b(i,j) = f(a(i,j))} for all \spad{i, j}
472058`\spad{map(fn,x)} returns \spad{Sum(fn(r_i) w_i)} if \spad{x} writes \spad{Sum(r_i w_i)}.
472111`\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.
472157`\spad{map(f, a)} applies \spad{f} to all the constants in \spad{R} appearing in \spad{a}.
472222`\spad{map(f,u)} maps \spad{f} onto the coordinates of \spad{u} to get an element in \spad{AS} via identification of the basis of \spad{AR} as beginning part of the basis of \spad{AS}.
472305`\spad{map(f,u)} maps \spad{f} onto real and imaginary parts of \spad{u}.
472378`\spad{map(f, e)} applies \spad{f} to all the constants appearing in \spad{e}.
472460`\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.
472536`\spad{map(f,u)} maps \spad{f} onto the coefficients \spad{f} the element \spad{u} of the monoid ring to create an element of a monoid ring with the same monoid \spad{b}.
472624`\spad{map(f,u)} maps \spad{f} onto the component parts of the octonion \spad{u}.
472696`\spad{map(f, r)} lifts \spad{f} and applies it to \spad{r},{} assuming that \spad{f}(infinity) = infinity.
472802`\spad{map(f, r)} lifts \spad{f} and applies it to \spad{r},{} assuming that \spad{f}(plusInfinity) = plusInfinity and that \spad{f}(minusInfinity) = minusInfinity.
472905`\spad{map(f,p)} \undocumented	
472982`\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.
473066`\spad{map(f, p)} applies \spad{f} to all the leaves of \spad{p} and returns the result as a pattern over \spad{S}.
473139`\spad{map(f, p)} produces a new polynomial as a result of applying the function \spad{f} to every coefficient of the polynomial \spad{p}.
473221`\spad{map(f,u)} maps \spad{f} onto the component parts of the quaternion \spad{u}.
473295`\spad{map(f,s)} expands the segment \spad{s},{} applying \spad{f} to each value. For example,{} if \spad{s = l..h by k},{} then the list \spad{[f(l), f(l+k),..., f(lN)]} is computed,{} where \spad{lN <= h < lN+k}.
473383`\spad{map(f,l..h)} returns a new segment \spad{f(l)..f(h)}.
473456`\spad{map(f,v=a..b)} returns the value given by \spad{v=f(a)..f(b)}.
473550`\spad{map(func, poly)} creates a new polynomial by applying \spad{func} to every non-zero coefficient of the polynomial poly.
473680`\spad{map(func, poly)} creates a new polynomial by applying \spad{func} to every non-zero coefficient of the polynomial poly.
473800`\spad{map(f,s)} expands the segment \spad{s},{} applying \spad{f} to each value.
473908`\spad{map(f,seg)} returns the new segment obtained by applying \spad{f} to the endpoints of \spad{seg}.
474008`\spad{map(f, p)} lifts \spad{f} to \spad{F1} and applies it to \spad{p}.
474109`\spad{map(f,d)} \undocumented{}
474258`\spad{map(f,i)} \undocumented{}
474397`\spad{map(f,m)} applies the function \spad{f} to the elements of the matrix \spad{m}.
474491`\spad{map(f,m)} applies the function \spad{f} to the elements of the matrix \spad{m}.
474600`\spad{map(f,m)} applies a mapping \spad{f:R1} -> \spad{R2} onto a matrix \spad{m} in \spad{R1} returning a matrix in \spad{R2}
474685`\spad{map(f,p)} \undocumented
474758`\spad{map(f,m)} applies the function \spad{f} to the elements of the matrix \spad{m}.
474884`\spad{map(f,a)} applies function \spad{f} to each member of aggregate \spad{a} resulting in a new aggregate over a possibly different underlying domain.
474957`\spad{map(f,a)} applies function \spad{f} to each member of aggregate \spad{a},{} creating a new aggregate with a possibly different underlying domain.
475027`\spad{map(f,eq)} returns an equation where \spad{f} is applied to the sides of \spad{eq}
475103`\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}.
475166`\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}]}.
475224`\spad{map(f,eqn)} constructs a new equation by applying \spad{f} to both sides of \spad{eqn}.
475270`\spad{map(f,t)} replaces the tuple \spad{t} by \spad{[f(x) for x in t]}.
475321`\spad{map(f,ts)} does a componentwise conversion of the tensor \spad{ts} to a tensor with components of type \spad{T}.
475448`\spad{map(f, k)} returns \spad{op(f(x1),...,f(xn))} where \spad{k = op(x1,...,xn)}.
475580`\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}.
475848`\spad{map(varmap, coefmap, p)} takes a \spad{varmap},{} a mapping from the variables of polynomial \spad{p} into \spad{S},{} \spad{coefmap},{} a mapping from coefficients of \spad{p} into \spad{S},{} and \spad{p},{} and produces a member of \spad{S} using the corresponding arithmetic. in \spad{S}
475930`\spad{map(f,a,b)} \undocumented
476042`\spad{map(f,a,b)} \undocumented
476140`\spad{map(fn,list1, u2)} applies the binary function \spad{fn} to corresponding elements of lists \spad{u1} and \spad{u2} and returns a list of the results (in the same order). Thus \spad{map(/,[1,2,3],[4,5,6]) = [1/4,2/4,1/2]}. The computation terminates when the end of either list is reached. That is,{} the length of the result list is equal to the minimum of the lengths of \spad{u1} and \spad{u2}.
476216`\spad{map(f,a,b)} \undocumented
476314`\spad{map(f,st1,st2)} returns the stream whose elements are the function \spad{f} applied to the corresponding elements of \spad{st1} and \spad{st2}. Note: \spad{map(f,[x0,x1,x2,..],[y0,y1,y2,..]) = [f(x0,y0),f(x1,y1),..]}.
476398`\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.
476475`\spad{map(f, r, i)} lifts \spad{f} and applies it to \spad{r},{} assuming that \spad{f}(infinity) = \spad{i}.
476603`\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}.
476683`\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}
476761`\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})}.
476894`\spad{map(f, r, p, m)} lifts \spad{f} and applies it to \spad{r},{} assuming that \spad{f}(plusInfinity) = \spad{p} and that \spad{f}(minusInfinity) = \spad{m}.
477039`\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)}.
477119`\spad{mapdiv([a0,a1,..],[b0,b1,..])} returns \spad{[a0/b0,a1/b1,..]}.
477217`\spad{mapmult([a0,a1,..],[b0,b1,..])} returns \spad{[a0*b0,a1*b1,..]}.
477304`\spad{mappingAst(s,t)} builds the mapping AST \spad{s} -> \spad{t}
477368`\spad{mappingMode(r,ts)} returns a mapping mode with return mode \spad{r},{} and parameter modes \spad{ts}.
477474`\spad{mask(n)} returns \spad{2**n-1} (an \spad{n} bit mask).
477522`\spad{mat(a,n)} constructs a one-dimensional matrix of a.
477625`\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.
477689`\spad{match(la, lb)} creates a map with no default source or target values defined by lists \spad{la} and lb of equal length. The target of a source value \spad{x} in \spad{la} is the value \spad{y} with the same index lb. Error: if \spad{la} and lb are not of equal length. Note: when this map is applied,{} an error occurs when applied to a value missing from \spad{la}.
477750`\spad{match(la, lb, f)} creates a map defined by lists \spad{la} and \spad{lb} of equal length. The target of a source value \spad{x} in \spad{la} is the value \spad{y} with the same index \spad{lb}. Argument \spad{f} is used as the function to call when the given function argument is not in \spad{la}. The value returned is \spad{f} applied to that argument.
477818`\spad{match(la, lb, a)} creates a map defined by lists \spad{la} and \spad{lb} of equal length,{} where \spad{a} is used as the default source value if the given one is not in \spad{la}. The target of a source value \spad{x} in \spad{la} is the value \spad{y} with the same index \spad{lb}. Error: if \spad{la} and \spad{lb} are not of equal length.
477876`\spad{match(la, lb, b)} creates a map defined by lists \spad{la} and \spad{lb} of equal length,{} where \spad{b} is used as the default target value if the given function argument is not in \spad{la}. The target of a source value \spad{x} in \spad{la} is the value \spad{y} with the same index \spad{lb}. Error: if \spad{la} and \spad{lb} are not of equal length.
477939`\spad{match(p,s,wc)} tests if pattern \axiom{\spad{p}} matches subject \axiom{\spad{s}} where \axiom{\spad{wc}} is a wild card character. If no match occurs,{} the index \axiom{0} is returned; otheriwse,{} the value returned is the first index of the first character in the subject matching the subject (excluding that matched by an initial wild-card). For example,{} \axiom{match("*to*",{}"yorktown",{}"*")} returns \axiom{5} indica
477939`--ting a successful match starting at index \axiom{5} of \axiom{"yorktown"}.
478013`\spad{match(la, lb, a, f)} creates a map defined by lists \spad{la} and \spad{lb} of equal length. and applies this map to a. The target of a source value \spad{x} in \spad{la} is the value \spad{y} with the same index \spad{lb}. Argument \spad{f} is a default function to call if a is not in \spad{la}. The value returned is then obtained by applying \spad{f} to argument a.
478078`\spad{match(la, lb, a, b)} creates a map defined by lists \spad{la} and \spad{lb} of equal length. and applies this map to a. The target of a source value \spad{x} in \spad{la} is the value \spad{y} with the same index \spad{lb}. Argument \spad{b} is the default target value if a is not in \spad{la}. Error: if \spad{la} and \spad{lb} are not of equal length.
478138`\spad{mathieu11 constructs} the mathieu group acting on the integers 1,{}...,{}11.
478217`\spad{mathieu11(li)} constructs the mathieu group acting on the 11 integers given in the list {\em li}. Note: duplicates in the list will be removed. error,{} if {\em li} has less or more than 11 different entries.
478309`\spad{mathieu12 constructs} the mathieu group acting on the integers 1,{}...,{}12.
478388`\spad{mathieu12(li)} constructs the mathieu group acting on the 12 integers given in the list {\em li}. Note: duplicates in the list will be removed Error: if {\em li} has less or more than 12 different entries.
478480`\spad{mathieu22 constructs} the mathieu group acting on the integers 1,{}...,{}22.
478559`\spad{mathieu22(li)} constructs the mathieu group acting on the 22 integers given in the list {\em li}. Note: duplicates in the list will be removed. Error: if {\em li} has less or more than 22 different entries.
478651`\spad{mathieu23 constructs} the mathieu group acting on the integers 1,{}...,{}23.
478730`\spad{mathieu23(li)} constructs the mathieu group acting on the 23 integers given in the list {\em li}. Note: duplicates in the list will be removed. Error: if {\em li} has less or more than 23 different entries.
478822`\spad{mathieu24 constructs} the mathieu group acting on the integers 1,{}...,{}24.
478901`\spad{mathieu24(li)} constructs the mathieu group acting on the 24 integers given in the list {\em li}. Note: duplicates in the list will be removed. Error: if {\em li} has less or more than 24 different entries.
478993`\spad{matrixConcat3D(s,x,y)} concatenates two 3-\spad{D} matrices along a specified axis
479067`\spad{matrixDimensions(x)} returns the dimensions of a matrix
479157`\spad{matrixGcd(mat,sing,n)} is \spad{gcd(sing,g)} where \spad{g} is the gcd of the entries of the \spad{n}-by-\spad{n} upper-triangular matrix \spad{mat}.
479308`\spad{matrix(llf)} makes \spad{llf} (a list of lists of forms) into a form which displays as a matrix.
479361`\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.
479428`\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.
479510`\spad{matrix(qf)} creates a square matrix from the quadratic form \spad{qf}.
479683`\spad{matrix(n,m,f)} construcys and \spad{n * m} matrix with the \spad{(i,j)} entry equal to \spad{f(i,j)}.
479795`\spad{maxColIndex(m)} returns the index of the 'last' column of the matrix \spad{m}.
479876`\spad{maxColIndex(m)} returns the index of the 'last' column of the array \spad{m}
480127`\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}.
480213`\spad{maxPoints3D()} returns the maximum number of points in a plot.
480258`\spad{maxPoints()} returns the maximum number of points in a plot
480299`\spad{maxPoints()} returns the maximum number of points in a plot.
480352`\spad{maxPoints()} sets the maximum number of points in a plot.
480412`\spad{maxRowIndex(m)} returns the index of the 'last' row of the matrix \spad{m}.
480493`\spad{maxRowIndex(m)} returns the index of the 'last' row of the array \spad{m}
480572`\spad{max()} returns the maximum floating point number.
480706`\spad{max} is the maximum value of \%.
480790`\spad{max(u)} returns the largest element of aggregate \spad{u}.
480855`\spad{max(q)} returns the maximum element of priority queue \spad{q}.
480945`\spad{max(x,y)} returns the maximum of \spad{x} and \spad{y} relative to the ordering.
480987`\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.
481037`\spad{maxdeg(p)} returns the greatest leading word in the support of \spad{p}.
481108`\spad{maximumExponent()} returns the maximum exponent in the model
481163`\spad{maximumExponent(e)} sets the maximum exponent in the model to \spad{e}
481225`\spad{maxint()} returns the maximum integer in the model
481281`\spad{maxint(u)} sets the maximum integer in the model to \spad{u}
481352`\spad{maxrank(r)} returns the maximum rank in the list \spad{r} of regimes
481553`\spad{maxrow(a,b,c,d,e)} is an auxiliary function for mr
481856`\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.
481935`\spad{measure2Result(m)} converts a measure record into a \axiomType{Result}
482059`\spad{measure2Result(m)} converts a measure record into a \axiomType{Result}
482196`\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 \spadignor
482196`--e{i.e.} the name of the most appropriate domain and any other relevant information.
482354`\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 meas
482354`--ures 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.
482499`\spad{measure(prob)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical optimization problem defined by \axiom{\spad{prob}} by checking various attributes of the functions and calculating a measure of compatibility of each routine to these attributes. \blankl
482499`--ine It calls each \axiom{domain} of \axiom{category} \axiomType{NumericalOptimizationCategory} in turn to calculate all measures and returns the best \spadignore{i.e.} the name of the most appropriate domain and any other relevant information.
482646`\spad{measure(prob)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical PDE problem defined by \axiom{\spad{prob}}. \blankline It calls each \axiom{domain} of \axiom{category} \axiomType{PartialDifferentialEquationsSolverCategory} in turn to calculate all measur
482646`--es and returns the best \spadignore{i.e.} the name of the most appropriate domain and any other relevant information. It predicts the likely most effective NAG numerical Library routine to solve the input set of PDEs by checking various attributes of the system of PDEs and calculating a measure of compatibility of each routine to these attributes.
482790`\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{NumericalI
482790`--ntegrationCategory} 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.
482962`\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{OrdinaryDifferentialEquationsSo
482962`--lverCategory} 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.
483121`\spad{measure(prob,R)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical optimization problem defined by \axiom{\spad{prob}} by checking various attributes of the functions and calculating a measure of compatibility of each routine to these att
483121`--ributes. \blankline It calls each \axiom{domain} listed in \axiom{\spad{R}} of \axiom{category} \axiomType{NumericalOptimizationCategory} in turn to calculate all measures and returns the best \spadignore{i.e.} the name of the most appropriate domain and any other relevant information.
483282`\spad{measure(prob,R)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical PDE problem defined by \axiom{\spad{prob}}. \blankline It calls each \axiom{domain} listed in \axiom{\spad{R}} of \axiom{category} \axiomType{PartialDifferentialEquationsSolv
483282`--erCategory} in turn to calculate all measures and returns the best \spadignore{i.e.} the name of the most appropriate domain and any other relevant information. It predicts the likely most effective NAG numerical Library routine to solve the input set of PDEs by checking various attributes of the system of PDEs and calculating a measure of compatibility of each routine to these attributes.
483440`\spad{measure(R,args)} calculates an estimate of the ability of a particular method to solve an optimization problem. \blankline This method may be either a specific NAG routine or a strategy (such as transforming the functio
483440`--n 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.
483722`\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 ea
483722`--sier 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.
483970`\spad{measure(R,args)} calculates an estimate of the ability of a particular method to solve an optimization problem. \blankline This method may be either a specific NAG routine or a strategy (such as transforming the function from one which is difficult to one which is easier to solve). \blankline It will call whichever agents a
483970`--re 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.
484146`\spad{measure(R,args)} calculates an estimate of the ability of a particular method to solve a problem. \blankline
484146`-- 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.
484539`\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 
484539`--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.
484792`\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 tra
484792`--nsforming 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.
485109`\spad{meatAxe(aG)} calls {\em meatAxe(aG,false,25,7)} returns a 2-list of representations as follows. All matrices of argument \spad{aG} are assumed to be square and of equal size. Then \spad{aG} generates a subalgebra,{} say \spad{A},{} of the algebra of all square matrices of dimension \spad{n}. {\em V R} is an A-module in the usual way. meatAxe(\spad{aG}) creates at most 25 random 
485109`--elements of the algebra,{} tests them for singularity. If singular,{} it tries at most 7 elements of its kernel to generate a proper submodule. If successful a list which contains first the list of the representations of the submodule,{} then a list of the representations of the factor module is returned. Otherwise,{} if we know that all the kernel is already scanned,{} Norton's irreducibility test can be used either to prove irreducibility or to find the splitting. Notes: the first 6 tries us
485109`--e Parker's fingerprints. Also,{} 7 covers the case of three-dimensional kernels over the field with 2 elements.
485229`\spad{meatAxe(aG, randomElements)} calls {\em meatAxe(aG,false,6,7)},{} only using Parker's fingerprints,{} if {\em randomElemnts} is \spad{false}. If it is \spad{true},{} it calls {\em meatAxe(aG,true,25,7)},{} only using random elements. Note: the choice of 25 was rather arbitrary. Also,{} 7 covers the case of three-dimensional kernels over the field with 2 elements.
485357`\spad{meatAxe(aG, numberOfTries)} calls {\em meatAxe(aG,true,numberOfTries,7)}. Notes: 7 covers the case of three-dimensional kernels over the field with 2 elements.
485493`\spad{meatAxe(aG,randomElements,numberOfTries, maxTests)} returns a 2-list of representations as follows. All matrices of argument \spad{aG} are assumed to be square and of equal size. Then \spad{aG} generates a subalgebra,{} say \spad{A},{} of the algebra of all square matrices of dimension \spad{n}. {\em V R} is an A-module in the usual way. meatAxe(\spad{aG}
485493`--,{}\spad{numberOfTries},{} maxTests) creates at most {\em numberOfTries} random elements of the algebra,{} tests them for singularity. If singular,{} it tries at most {\em maxTests} elements of its kernel to generate a proper submodule. If successful,{} a 2-list is returned: first,{} a list containing first the list of the representations of the submodule,{} then a list of the representations of the factor module. Otherwise,{} if we know that all the kernel is already scanned,{} Norton's irred
485493`--ucibility test can be used either to prove irreducibility or to find the splitting. If {\em randomElements} is {\em false},{} the first 6 tries use Parker's fingerprints.
485637`\axiom{medial(ps)} returns the same as \axiom{medialSet(ps,{}initiallyReduced?,{}initiallyReduce)}.
485723`\axiom{medialSet(ps,{}redOp?,{}redOp)} returns \axiom{bs} a basic set (in Wu Wen Tsun sense \spad{w}.\spad{r}.\spad{t} the reduction-test \axiom{redOp?}) of some set generating the same ideal as \axiom{ps} (with rank not higher than any basic set of \axiom{ps}),{} if no non-zero constant polynomials appear during the computatioms,{} else \axiom{"failed"} is returned. In the former case,{} \axio
485723`--m{bs} has to be understood as a candidate for being a characteristic set of \axiom{ps}. In the original algorithm,{} \axiom{bs} is simply a basic set of \axiom{ps}.
485833`\spad{member?(p, s)} returns \spad{true} is \spad{p} is in \spad{s},{} \spad{false} otherwise.
486197`\spad{member?(pp,gp)} answers the question,{} whether the permutation {\em pp} is in the group {\em gp} or not.
486268`\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})}.
486445`\spad{members(x)} returns the list of operator descriptors,{} \spadignore{e.g.} signature and implementation slots,{} of the overload set \spad{x}.
486510`\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})}.
486604`\spad{members(ms)} returns a list of the elements of \spad{ms} {\em without} their multiplicity. See also \spadfun{parts}.
486754`\spad{merge!(u,v)} destructively merges \spad{u} and \spad{v} in ascending order.
486833`\spad{merge!(q,q1)} destructively changes priority queue \spad{q} to include the values from priority queue \spad{q1}.
487024`\spad{merge!(p,u,v)} destructively merges \spad{u} and \spad{v} using predicate \spad{p}.
487101`\spad{mergeDifference(l1,l2)} returns a list of elements in \spad{l1} not present in \spad{l2}. Assumes lists are ordered and all \spad{x} in \spad{l2} are also in \spad{l1}.
487172`\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.
487267`\spad{merge(ls)} a list of subspaces,{} \spad{ls},{} into one subspace.
487316`\spad{merge([s1,s2,...,sn])} will create a new \spadtype{ThreeSpace} that has the components of all the ones in the list; Groupings of components into composites are maintained.
487528`\spad{merge(s1,s2)} the subspaces \spad{s1} and \spad{s2} into a single subspace.
487574`\spad{merge(u,v)} merges \spad{u} and \spad{v} in ascending order. Note: \axiom{merge(\spad{u},{}\spad{v}) = merge(<=,{}\spad{u},{}\spad{v})}.
487648`\spad{merge(q1,q2)} returns combines priority queues \spad{q1} and \spad{q2} to return a single priority queue \spad{q}.
487706`\spad{merge(s1,s2)} will create a new \spadtype{ThreeSpace} that has the components of \spad{s1} and \spad{s2}; Groupings of components into composites are maintained.
487960`\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 o
487960`--f 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]}.
488032`\spad{mesh?(s)} returns \spad{true} if the \spadtype{ThreeSpace} \spad{s} is composed of one component,{} a mesh comprising a list of curves which are lists of points,{} or returns \spad{false} if otherwise
488088`\spad{meshFun2Var(f,g,s1,s2,l)} \undocumented
488348`\spad{meshPar1Var(s,t,u,f,s1,l)} \undocumented
488565`\spad{meshPar2Var(f,s1,s2,l)} \undocumented
488762`\spad{meshPar2Var(sp,f,s1,s2,l)} \undocumented
488983`\spad{meshPar2Var(f,g,h,j,s1,s2,l)} \undocumented
489321`\spad{mesh([[p0],[p1],...,[pn]])} creates a surface defined by a list of curves which are lists,{} \spad{p0} through pn,{} of points,{} and returns a \spadtype{ThreeSpace} whose component is the surface.
489389`\spad{mesh(s)} checks to see if the \spadtype{ThreeSpace},{} \spad{s},{} is composed of a single surface component defined by a list curves which contain lists of points,{} and if so,{} returns the list of lists of points; An error is signaled otherwise.
489457`\spad{mesh([[p0],[p1],...,[pn]], close1, close2)} creates a surface defined over a list of curves,{} \spad{p0} through pn,{} which are lists of points; the booleans \spad{close1} and \spad{close2} indicate how the surface is to be closed: \spad{close1} set to \spad{true} means that each individual list (a curve) is to be closed (that is,{} the last point of the list is to be connected to the first point); \spad{close2} 
489457`--set to \spad{true} means that the boundary at one end of the surface is to be connected to the boundary at the other end (the boundaries are defined as the first list of points (curve) and the last list of points (curve)); the \spadtype{ThreeSpace} containing this surface is returned.
489541`\spad{mesh(s,[ [[r10]...,[r1m]], [[r20]...,[r2m]],..., [[rn0]...,[rnm]] ], close1, close2)} adds a surface component to the \spadtype{ThreeSpace} \spad{s},{} which is defined over a rectangular domain of size WxH where \spad{W} is the number of lists of points from the domain \spad{PointDomain(R)} and \spad{H} is the number of elements in each of those lists; the booleans \spad{close1} and \spad{close2} indicate how t
489541`--he surface is to be closed: if \spad{close1} is \spad{true} this means that each individual list (a curve) is to be closed (\spadignore{i.e.} the last point of the list is to be connected to the first point); if \spad{close2} is \spad{true},{} this means that the boundary at one end of the surface is to be connected to the boundary at the other end (the boundaries are defined as the first list of points (curve) and the last list of points (curve)).
489627`\spad{mesh(s,[ [[r10]...,[r1m]], [[r20]...,[r2m]],..., [[rn0]...,[rnm]] ], [props], prop)} adds a surface component to the \spadtype{ThreeSpace} \spad{s},{} which is defined over a rectangular domain of size WxH where \spad{W} is the number of lists of points from the domain \spad{PointDomain(R)} and \spad{H} is the number of elements in each of those lists; lprops is the list
489627`-- of the subspace component properties for each curve list,{} and prop is the subspace component property by which the points are defined.
489755`\spad{mesh(s,[[p0],[p1],...,[pn]], close1, close2)} adds a surface component to the \spadtype{ThreeSpace},{} which is defined over a list of curves,{} in which each of these curves is a list of points. The boolean arguments \spad{close1} and \spad{close2} indicate how the surface is to be closed. Argument \spad{close1} equal \spad{true} means that each individual list (a curve) is to be closed,{} \spadignore{i.e.} th
489755`--e last point of the list is to be connected to the first point. Argument \spad{close2} equal \spad{true} means that the boundary at one end of the surface is to be connected to the boundary at the other end,{} \spadignore{i.e.} the boundaries are defined as the first list of points (curve) and the last list of points (curve).
489842`\spad{mesh(s,[[p0],[p1],...,[pn]],[props],prop)} adds a surface component,{} defined over a list curves which contains lists of points,{} to the \spadtype{ThreeSpace} \spad{s}; props is a list which contains the subspace component properties for each surface parameter,{} and \spad{prop} is the subspace component property by which the points are defined.
489971`\spad{messagePrint(s)} prints \spad{s} without string quotes. Note: \spad{messagePrint(s)} is equivalent to \spad{print message(s)}.
490024`\spad{message(s)} creates an form with no string quotes from string \spad{s}.
490070`\axiom{middle(rootChar)} is the middle of the isolating interval
490164`\spad{midpoint(int)} returns the midpoint of the interval \spad{int}.
490284`\spad{midpoints(isolist)} returns the list of midpoints for the list of intervals \spad{isolist}.
490417`\axiom{mightHaveRoots(\spad{p},{}\spad{r})} is \spad{false} if \axiom{\spad{p}.\spad{r}} is not 0
490528`\spad{minColIndex(m)} returns the index of the 'first' column of the matrix \spad{m}.
490609`\spad{minColIndex(m)} returns the index of the 'first' column of the array \spad{m}
490688`\spad{minGbasis }\undocumented
490903`\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}.
490989`\spad{minPoints3D()} returns the minimum number of points in a plot.
491034`\spad{minPoints()} returns the minimum number of points in a plot
491075`\spad{minPoints()} returns the minimum number of points in a plot.
491128`\spad{minPoints()} sets the minimum number of points in a plot.
491188`\spad{minPol }\undocumented
491369`\spad{minPol }\undocumented
491607`\spad{minPoly(k)} returns the defining polynomial of \spad{k}.
491724`\spad{minPoly(k)} returns \spad{p} such that \spad{p(k) = 0}.
491819`\spad{minRowIndex(m)} returns the index of the 'first' row of the matrix \spad{m}.
491900`\spad{minRowIndex(m)} returns the index of the 'first' row of the array \spad{m}
491979`\spad{min()} returns the minimum floating point number.
492113`\spad{min} is the minimum value of \%.
492197`\spad{min(u)} returns the smallest element of aggregate \spad{u}.
492262`\spad{min(u)} returns the smallest entry in the multiset aggregate \spad{u}.
492354`\spad{min(x,y)} returns the minimum of \spad{x} and \spad{y} relative to the ordering.
492396`\spad{mindegTerm(x)} returns the term whose word is \spad{mindeg(x)}.
492482`\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.
492532`\spad{mindeg(x)} returns the little word which appears in \spad{x}. Error if \spad{x=0}.
492840`\spad{minimalPolynomial(x)} \undocumented{} See \axiomFunFrom{minimalPolynomial}{FiniteAlgebraicExtensionField}
492952`\spad{minimalPolynomial(a)} returns the minimal polynomial of an element \spad{a} over the ground field \spad{F}.
493053`\spad{minimalPolynomial(a)} returns the minimal polynomial of \spad{a}.
493244`\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}.
493375`\spad{minimize(I)} returns a reduced set of generators for \spad{I}.
493515`\spad{minimumDegree(p)} gives the least exponent of a non-zero term of polynomial \spad{p}. Error: if applied to 0.
493580`\spad{minimumDegree(l)} is the smallest \spad{k} such that \spad{a(k) \~= 0} if \indented{2}{\spad{l = sum(monomial(a(i),i), i = 0..n)}.}
493660`\spad{minimumDegree(l)} is the smallest \spad{k} such that \spad{a(k) ~= 0} if \indented{2}{\spad{l = sum(monomial(a(i),i), i = 0..n)}.}
493969`\spad{minimumDegree(p, lv)} gives the list of minimum degrees of the polynomial \spad{p} with respect to each of the variables in the list lv
494072`\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}
494163`\spad{minimumExponent()} returns the minimum exponent in the model
494218`\spad{minimumExponent(e)} sets the minimum exponent in the model to \spad{e}
494280`\spad{minordet(m)} computes the determinant of the matrix \spad{m} using minors. Error: if the matrix is not square.
494352`\spad{minordet(m)} computes the determinant of the matrix \spad{m} using minors. Error: if the matrix is not square.
494443`\spad{minordet(m)} computes the determinant of the matrix \spad{m} using minors.
494545`\spad{minrank(r)} returns the minimum rank in the list \spad{r} of regimes
494746`\spad{minset(sl)} returns the sublist of \spad{sl} consisting of the minimal lists (with respect to inclusion) in the list \spad{sl} of lists
494842`\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.
494932`\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.
495032`\spad{minusInfinity()} returns minusInfinity.
495100`\spad{minusInfinity()} returns -infinity.
495156`\axiom{mirror(\spad{g})} is the mirror of the internal representation of \axiom{\spad{g}}.
495218`\axiom{mirror(\spad{x})} returns the reversed word of \axiom{\spad{x}}. That is \axiom{\spad{x}} itself if \axiomOpFrom{retractable?}{Magma}(\axiom{\spad{x}}) is \spad{true} and \axiom{mirror(\spad{z}) * mirror(\spad{y})} if \axiom{\spad{x}} is \axiom{y*z}.
495262`\spad{mirror(x)} returns the reversed word of \spad{x}.
495313`\axiom{mirror(\spad{x})} returns \axiom{Sum(r_i mirror(w_i))} if \axiom{\spad{x}} is \axiom{Sum(r_i w_i)}.
495368`\spad{mirror(x)} returns \spad{Sum(r_i mirror(w_i))} if \spad{x} writes \spad{Sum(r_i w_i)}.
495417`\spad{mix(l)} \undocumented
495521`\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}.
495720`\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}.
495817`\spad{mkPrim(f, x)} makes the logs in \spad{f} which are linear in \spad{x} primitive with respect to \spad{x}.
495929`\spad{mkcomm(i)} \undocumented{}
495975`\spad{mkcomm(i,j)} \undocumented{}
496019`\spad{modTree(r,l)} \undocumented{}
496076`\spad{modifyPointData(v,ind,pt)} takes the viewport,{} \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport},{} and places the data point,{} \spad{pt} into the list of points database of \spad{v} at the index location given by \spad{ind}.
496180`\spad{modifyPointData(s,i,p)} changes the point at the indexed location \spad{i} in the \spadtype{ThreeSpace},{} \spad{s},{} to that of point \spad{p}. This is useful for making changes to a point which has been transformed.
496269`\spad{modifyPoint(s,li,i)} replaces an existing point in the 3 dimensional subspace,{} \spad{s},{} with the 4 dimensional point indicated by the index location,{} \spad{i}. The list of non negative integers,{} \spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component in which the existing point is to be modified. An error message occurs if \spad{s} is empty,{} otherw
496269`--ise the subspace \spad{s} is returned with the point modification.
496362`\spad{modifyPoint(s,li,p)} replaces an existing point in the 3 dimensional subspace,{} \spad{s},{} with the 4 dimensional point,{} \spad{p}. The list of non negative integers,{} \spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component in which the existing point is to be modified. An error message occurs if \spad{s} is empty,{} otherwise the subspace \spad{s} is returned with
496362`-- the point modification.
496445`\spad{modifyPoint(s,ind,p)} modifies the point referenced by the index location,{} \spad{ind},{} by replacing it with the point,{} \spad{p} in the 3 dimensional subspace,{} \spad{s}. An error message occurs if \spad{s} is empty,{} otherwise the subspace \spad{s} is returned with the point modification.
496522`\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})
496522`--\spad{=1}) and square free (\spadignore{i.e.} without repeated factors).
496621`\spad{modularGcdPrimitive(f1,f2)} computes the gcd of the two polynomials \spad{f1} and \spad{f2} by modular methods.
496705`\spad{modularGcd(listf)} computes the gcd of the list of polynomials \spad{listf} by modular methods.
496780`\spad{moduleSum(m1,m2)} returns the sum of two modules in the framed algebra \spad{F}. Each module \spad{mi} is represented as follows: \spad{F} is a framed algebra with \spad{R}-module basis \spad{w1,w2,...,wn} and \spad{mi} is a record \spad{[basis,basisDen,basisInv]}. If \spad{basis} is 
496780`--the matrix \spad{(aij, i = 1..n, j = 1..n)},{} then a basis \spad{v1,...,vn} for \spad{mi} is given by \spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of 'basis' contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix \spad{basisInv} contains the coordinates of \spad{wi} with respect to the basis \spad{v1,...,vn}: if \spad{basisInv} is the matrix \spad{(bij, i = 1..n, j = 1..n)},{} then \spad{wi = sum(bij
496780`-- * vj, j = 1..n)}.
496996`\spad{module(I)} returns \spad{I} viewed has a module over \spad{R}.
497102`\spad{module([f1,...,fn])} = the module generated by \spad{(f1,...,fn)} over \spad{R}.
497169`\spad{modulo(x)} returns a,{} where \spad{x = a + b p}.
497229`\spad{modulus()} \undocumented
497275`\spad{modulus()} returns the value of \spad{p}.
497333`\spad{modulus(x)} \undocumented
497420`\spad{modulus(x)} \undocumented
497497`\spad{modulus(x)} \undocumented
497573`\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.
497645`\spad{moebius(a,b,c,d)} returns \spad{matrix [[a,b],[c,d]]}.
497768`\spad{monic?(p)} tests if \spad{p} is monic (\spadignore{i.e.} leading coefficient equal to 1).
497840`\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.
497910`\spad{monicCompleteDecompose(f)} returns a list of factors of \spad{f} for the functional decomposition ([ \spad{f1},{} ...,{} fn ] means \spad{f} = \spad{f1} \spad{o} ... \spad{o} fn).
498009`\spad{monicDecomposeIfCan(f)} returns a functional decomposition of the monic polynomial \spad{f} of "failed" if it has not found any.
498137`\spad{monicDivide(p,q)} divide the polynomial \spad{p} by the monic polynomial \spad{q},{} returning the pair \spad{[quotient, remainder]}. Error: if \spad{q} isn't monic.
498337`\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}.
498443`\spad{monicLeftDivide(a,b)} returns the pair \spad{[q,r]} such that \spad{a = b*q + r} and the degree of \spad{r} is less than the degree of \spad{b}. \spad{b} must be monic. This process is called ``left division''.
498572`\spad{monicLeftDivide(a, b, sigma)} returns the pair \spad{[q,r]} such that \spad{a = b*q + r} and the degree of \spad{r} is less than the degree of \spad{b}. \spad{b} must be monic. This process is called ``left division''. \spad{\sigma} is the morphism to use.
498786`\axiom{monicModulo(a,{}\spad{b})} returns \axiom{\spad{r}} such that \axiom{\spad{r}} is reduced \spad{w}.\spad{r}.\spad{t}. \axiom{\spad{b}} and \axiom{\spad{b}} divides \axiom{a -r} where \axiom{\spad{b}} is monic.
498857`\axiom{monicModulo(a,{}\spad{b})} computes \axiom{a mod \spad{b}},{} if \axiom{\spad{b}} is monic as univariate polynomial in its main variable.
498930`\spad{monicRightDivide(a,b)} returns the pair \spad{[q,r]} such that \spad{a = q*b + r} and the degree of \spad{r} is less than the degree of \spad{b}. \spad{b} must be monic. This process is called ``right division''.
499060`\spad{monicRightDivide(a, b, sigma)} returns the pair \spad{[q,r]} such that \spad{a = q*b + r} and the degree of \spad{r} is less than the degree of \spad{b}. \spad{b} must be monic. This process is called ``right division''. \spad{\sigma} is the morphism to use.
499207`\spad{monicRightFactorIfCan(f,d)} returns a candidate to be the monic right factor (\spad{h} in \spad{f} = \spad{g} \spad{o} \spad{h}) of degree \spad{d} of a functional decomposition of the polynomial \spad{f} or \spad{"failed"} if no such candidate.
499334`\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.
499487`\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,
499487`--C2)} \spad{D} is the derivation to use.
499684`\spad{monom(deg,coef)} is a monomial of degree \spad{deg} with coefficient \spad{coef}.
499759`\spad{monom(b,r)} returns the element with the single monomial \indented{1}{\spad{b} and coefficient \spad{r}.}
499816`\spad{monom(w,r)} returns the product of the word \spad{w} by the coefficient \spad{r}.
499943`\spad{monomial?(f)} tests if \spad{f} is a single monomial.
500020`\spad{monomial?(x)} \undocumented
500082`\spad{monomial?(f)} tests if \spad{f} is a single monomial.
500136`\spad{monomial?(p)} tests if \spad{p} is a single monomial.
500197`\spad{monomial?(x)} returns \spad{true} if \spad{x} contains a single monomial.
500258`\spad{monomial?(x)} returns \spad{true} if \spad{x} is a monomial
500315`\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}.
500422`\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 '.
500728`\spad{monomial(x,n)} \undocumented
500791`\spad{monomial(r,m)} creates a scalar multiple of the basis element \spad{m}.
500840`\spad{monomial(r,x)} \undocumented
501014`\spad{monomial(a,s)} constructs a direct product element with the \spad{s} component set to \spad{a}
501081`\spad{monomial(c,[i1,i2,...,iN])} produces the value given by \spad{c*e(i1)*e(i2)*...*e(iN)}.
501157`\spad{monomial(r,e)} makes a term from a coefficient \spad{r} and an exponent \spad{e}.
501213`\spad{monomial(c,k)} produces \spad{c} times the \spad{k}-th power of the generating operator,{} \spad{monomial(1,1)}.
501290`\spad{monomial(c,k)} produces \spad{c} times the \spad{k}-th power of the generating operator,{} \spad{monomial(1,1)}.
501980`\spad{monomial(a,[x1,..,xk],[n1,..,nk])} computes \spad{a * x1**n1 * .. * xk**nk}.
502070`\spad{monomial(a,[x1,x2,...,xk],[n1,n2,...,nk])} returns \spad{a * x1^n1 * ... * xk^nk}.
502180`\spad{monomial(a,[v1..vn],[e1..en])} returns \spad{a*prod(vi**ei)}.
502281`\spad{monomial(a,x,n)} computes \spad{a*x**n}.
502359`\spad{monomial(a,x,n)} returns \spad{a*x^n}.
502457`\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.
502612`\spad{monomials(f)} gives the list of all monomials whose sum is \spad{f}.
502667`\spad{monomials(x)} returns the list of \spad{r_i*b_i} whose sum is \spad{x}.
502729`\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)]}.
502872`\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.
502954`\spad{more?(u,n)} tests if \spad{u} has greater than \spad{n} elements.
503026`\axiom{moreAlgebraic?(ts,{}us)} returns \spad{false} iff \axiom{ts} and \axiom{us} are both empty,{} or \axiom{ts} has less elements than \axiom{us},{} or some variable is algebraic \spad{w}.\spad{r}.\spad{t}. \axiom{us} and is not \spad{w}.\spad{r}.\spad{t}. \axiom{ts}.
503106`\axiom{moreAlgebraic?(ts,{}us)} returns \spad{false} iff \axiom{ts} and \axiom{us} are both empty,{} or \axiom{ts} has less elements than \axiom{us},{} or some variable is algebraic \spad{w}.\spad{r}.\spad{t}. \axiom{us} and is not \spad{w}.\spad{r}.\spad{t}. \axiom{ts}.
503196`\spad{morphism(f)} returns the non-invertible morphism given by \spad{f}.
503248`\spad{morphism(f)} returns the morphism given by \spad{f^n(x) = f(x,n)}.
503308`\spad{morphism(f, g)} returns the invertible morphism given by \spad{f},{} where \spad{g} is the inverse of \spad{f}..
503367`\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}.
503458`\spad{move(v,x,y)} displays the three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport},{} with the upper left-hand corner of the viewport window at the screen coordinate position \spad{x},{} \spad{y}.
503551`\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}.
503661`\spad{mr(t)} is an auxiliary function which finds the position of the maximum element of a tableau \spad{t} which is in the lowest row,{} producing a record of results
503802`\spad{mulmod(a,b,p)},{} \spad{0<=a,b<p>1},{} means \spad{a*b mod p}.
503858`\spad{multMonom(r,e,x)} \undocumented
503935`\spad{multiEuclideanTree(l,r)} \undocumented{}
504084`\spad{multiEuclidean([f1,...,fn],z)} returns a list of coefficients \spad{[a1, ..., an]} such that \spad{ z / prod fi = sum aj/fj}. If no such list of coefficients exists,{} "failed" is returned.
504169`\spad{multinomial(n,[m1,m2,...,mk])} returns the multinomial coefficient \spad{n!/(m1! m2! ... mk!)}.
504242`\spad{multiple?(p)} tests if \spad{p} is a single matching variable allowing list matching or multiple term matching in a sum or product.
504291`\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.
504350`\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.
504426`\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..)}.
504525`\spad{multiplyCoefficients(f,sum(n = n0..infinity,a[n] * x**n)) = sum(n = 0..infinity,f(n) * a[n] * x**n)}. This function is used when Puiseux series are represented by a Laurent series and an exponent.
504623`\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.
504720`\spad{multiplyExponents(f,r)} multiplies all exponents of the power series \spad{f} by the positive rational number \spad{r}.
504817`\spad{multiplyExponents(p,n)} returns a new polynomial resulting from multiplying all exponents of the polynomial \spad{p} by the non negative integer \spad{n}.
504909`\spad{multiplyExponents(f,n)} multiplies all exponents of the power series \spad{f} by the positive integer \spad{n}.
505008`\spad{multisect(a,b,st)} selects the coefficients of \spad{x**((a+b)*n+a)},{} and changes them to \spad{x**n}.
505103`\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}.}
505189`\spad{multiset()}\$\spad{D} creates an empty multiset of domain \spad{D}.
505231`\spad{multiset(ls)} creates a multiset with elements from \spad{ls}.
505280`\spad{multiset(s)} creates a multiset with singleton \spad{s}.
505323`\spad{multivariate(f, v)} applies both the numerator and denominator of \spad{f} to \spad{v}.
505444`\spad{multivariate(f, v)} applies both the numerator and denominator of \spad{f} to \spad{v}.
505587`\spad{multivariate(sup,v)} converts an anonymous univariable polynomial \spad{sup} to a polynomial in the variable \spad{v}.
505688`\spad{multivariate(sup,v)} converts an anonymous univariable polynomial \spad{sup} to a polynomial in the variable \spad{v}.
505790`\spad{multivariate(u,k,f)} \undocumented
505930`\spad{musserTrials()} returns the number of primes that are tried in \spadfun{modularFactor}.
506003`\spad{musserTrials(n)} sets to \spad{n} the number of primes to be tried in \spadfun{modularFactor} and returns the previous value.
506205`\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}}.
506267`\axiom{mvar(ps)} returns the main variable of the non constant polynomial with the greatest main variable,{} if any,{} else an error is returned.
506335`\spad{myDegree should} be local
506477`\spad{name(x)} returns the name of the overload set \spad{x}.
506525`\spad{name(x)} returns the symbol
506575`\spad{name(x)} returns the symbol
506621`\spad{name(b)} returns the name of binding \spad{b}
506665`\spad{name(h)} returns the name of the operation defined defined.
506709`\spad{name(p)} returns the name of property \spad{p}
506754`\spad{name(s)} returns the name of the signature `s'.
506803`\spad{name(f)} returns the external name of the file \spad{f}.
506854`\spad{name(op)} returns the externam name of \spad{op}.
506901`\spad{name(a)} returns the name of the attribute `a'. Note,{} this name may be domain name,{} not just an identifier.
506947`\spad{name(f)} returns the name part of the file name.
506996`\spad{name(s)} returns \spad{s} without its scripts.
507031`\spad{nan? x} holds if \spad{x} is a Not a Number floating point data in the IEEE 754 sense.
507116`\spad{nand(a,b)} returns the logical {\em nand} of bit aggregates \axiom{a} and \axiom{\spad{b}}.
507160`\spad{nand(a,b)} returns the logical negation of \spad{a} and \spad{b}.
507199`\spad{nary?(op)} tests if \spad{op} has arbitrary arity.
507247`\spad{nativeModuleExtension} is a string representation of a filename extension for native modules.
507384`\spad{ncols(m)} returns the number of columns in the matrix \spad{m}.
507470`\spad{ncols(m)} returns the number of columns in the array \spad{m}
507610`\spad{negative?(u)} returns \axiom{\spad{true}} if every element of \spad{u} is negative,{} \axiom{\spad{false}} otherwise.
507668`\spad{negative?(x)} holds when \spad{x} is less than \spad{0}.
507820`\axiom{negative?(pol,{}aRoot)} answers if \axiom{pol} interpreted as \axiom{aRoot} is negative
507917`\spad{neglist(l)} returns only the negative elements of the list \spad{l}
507990`\spad{newLine()} sends a new line command to output.
508038`\spad{newReduc()} \undocumented
508095`\spad{newSubProgram(f)} asserts that from now on type declarations are part of subprogram \spad{f}.
508153`\spad{newTypeLists(x)} \undocumented
508210`\spad{new()} returns a new empty match result.
508265`\spad{new()} returns a new empty match result.
508314`\spad{new()} \undocumented
508353`\spad{new()} \undocumented
508404`\spad{new()} returns a fresly allocated data buffer or length \spad{N}.
508444`\spad{new()} returns a new symbol whose name starts with \%.
508476`\spad{new()} create a new,{} empty object. Use \spadfun{setPrologue!},{} \spadfun{setTex!} and \spadfun{setEpilogue!} to set the various components of this object.
508511`\spad{new(c)} constructs a new \spadtype{SquareMatrix} object of dimension \spad{ndim} with initial entries equal to \spad{c}.
508558`\spad{new(s)} returns a new symbol whose name starts with \%\spad{s}.
508651`\spad{new(n,x)} returns \axiom{fill!(new \spad{n},{}\spad{x})}.
508715`\spad{new(m,n,r)} is an \spad{m}-by-\spad{n} array all of whose entries are \spad{r}
508818`\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.
508880`\spad{newline} designates the new line character.
508919`\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.
509044`\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
509044`-- 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}.
509431`\spad{nextItem(x)} returns the next item,{} or \spad{failed} if domain is exhausted.
509482`\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 ni
509482`--l} indicates that {\em lattP} has no successor.
509616`\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} o
509616`--f \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}.
509759`\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 
509759`--\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 t
509759`--he elements of {\em GF} given by {\em lookup}. This operation is equivalent to nextPrimitiveNormalPoly(\spad{f}).
509911`\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.
510032`\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.
510155`\spad{nextPrime(n)} returns the smallest prime strictly larger than \spad{n}
510210`\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 
510210`--\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 a
510210`--ccording 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}).
510362`\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 th
510362`--an 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}.
510508`\spad{nextSublist(n,k)} returns a list of \spad{k}-subsets of {1,{} ...,{} \spad{n}}.
510615`\spad{nextSubsetGray(ww,n)} returns a vector {\em vv} whose components have the following meanings:\begin{items} \item {\em vv.1}: a vector of length \spad{n} whose entries are 0 or 1. This \indented{3}{can be interpreted as a code for a subset of the set 1,{}...,{}\spad{n};} \indented{3}{{\em vv.1} differs from {\em ww.1} by exactly one entry;} \item {\em vv.2.1} is the number of the entry of {\em 
510615`--vv.1} which \indented{3}{will be changed next time;} \item {\em vv.2.1 = n+1} means that {\em vv.1} is the last subset; \indented{3}{trying to compute nextSubsetGray(vv) if {\em vv.2.1 = n+1}} \indented{3}{will produce an error!} \end{items} The other components of {\em vv.2} are needed to compute nextSubsetGray efficiently. Note: this is an implementation of [Williamson,{} Topic II,{} 3.54,{} \spad{p}. 112] for the special case {\em r1 = r2 = ... = rn = 2}; Note: nextSubsetGray produces a sid
510615`--e-effect,{} \spadignore{i.e.} {\em nextSubsetGray(vv)} and {\em vv := nextSubsetGray(vv)} will have the same effect.
510720`\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}}.
510773`\axiom{\spad{nextsousResultant2}(\spad{P},{} \spad{Q},{} \spad{Z},{} \spad{s})} returns the subresultant \axiom{S_{\spad{e}-1}} where \axiom{\spad{P} ~ S_d,{} \spad{Q} = S_{\spad{d}-1},{} \spad{Z} = S_e,{} \spad{s} = lc(S_d)}
510863`\axiom{\spad{nextsubResultant2}(\spad{p},{}\spad{q},{}\spad{z},{}\spad{s})} is the multivariate version of the operation \axiomOpFrom{\spad{next_sousResultant2}}{PseudoRemainderSequence} from the \axiomType{PseudoRemainderSequence} constructor.
510969`\spad{nil?(s)} is \spad{true} when `s' is a syntax for the constant nil.
511009`\spad{nilFactor(base,exponent)} creates a factored object with a single factor with no information about the kind of \spad{base} (flag = "nil").
511061`\spad{nil} is the empty list.
511094`\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))}.
511209`\spad{noKaratsuba(a,b)} returns \spad{a*b} without using Karatsuba's trick at all.
511291`\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.
511354`\spad{noValueMode} is a constant mode that indicates that the value of an expression is to be ignored.
511581`\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.).
511658`\axiom{nodeOf?(\spad{s},{}a)} returns \spad{true} iff some node of \axiom{a} is equal to \axiom{\spad{s}}
511732`\spad{node(left,v,right)} creates a binary tree with value \spad{v},{} a binary tree \spad{left},{} and a binary tree \spad{right}.
511958`\spad{nodes(u)} returns a list of all of the nodes of aggregate \spad{u}.
512015`\spad{nonLinearPart(l)} returns the list of non-linear functions of \axiom{\spad{l}}.
512123`\spad{nonQsign(r)} \undocumented
512191`\spad{nonSingularModel(u)} returns the equations in \spad{u1},{}...,{}un of an affine non-singular model for the curve.
512288`\spad{nonSingularModel(u)} returns the equations in \spad{u1},{}...,{}un of an affine non-singular model for the curve.
512394`\spad{noncommutativeJordanAlgebra?()} tests if the algebra is flexible and Jordan admissible.
512487`\spad{noncommutativeJordanAlgebra?()} tests if the algebra is flexible and Jordan admissible.
512616`\spad{nor(a,b)} returns the logical {\em nor} of bit aggregates \axiom{a} and \axiom{\spad{b}}.
512659`\spad{nor(a,b)} returns the logical negation of \spad{a} or \spad{b}.
512697`\spad{normDeriv2 should} be local
512826`\spad{normFactors(x)} \undocumented
512910`\axiom{normInvertible?(\spad{p},{}ts)} is an internal subroutine,{} exported only for developement.
513295`\spad{norm(p)} determines sum of absolute values of coefficients Note: this function depends on \spadfunFrom{abs}{Complex}.
513354`\spad{norm(I)} returns the norm of the ideal \spad{I}.
513407`\spad{norm(f)} returns the norm of the module \spad{f}.
513464`\spad{norm q} returns the norm of \spad{q},{} \spadignore{i.e.} the product of all the conjugates of \spad{q}.
513534`\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}.
513594`\spad{norm(x)} returns \spad{x} * conjugate(\spad{x})
513640`\spad{norm(a)} returns the determinant of the regular representation of \spad{a} with respect to any basis.
513691`\spad{norm(o)} returns the norm of an octonion,{} equal to the sum of the squares of its coefficients.
513738`\spad{norm(q)} computes the norm of \spad{q} (the sum of the squares of the components).
513787`\spad{norm x} returns the same as absolute value.
513905`\spad{norm(p,k)} computes the norm of the polynomial \spad{p} with respect to the extension generated by kernel \spad{k}
514021`\spad{norm(p,l)} computes the norm of the polynomial \spad{p} with respect to the extension generated by kernels \spad{l}
514143`\spad{norm(f,p)} returns the lp norm of the polynomial \spad{f}.
514228`\spad{norm(x,n)} \undocumented{} See \axiomFunFrom{norm}{FiniteAlgebraicExtensionField}
514323`\spad{norm(f,k)} computes the norm of the algebraic number \spad{f} with respect to the extension generated by kernel \spad{k}
514383`\spad{norm(f,l)} computes the norm of the algebraic number \spad{f} with respect to the extension generated by kernels \spad{l}
514449`\spad{norm(p,k)} computes the norm of the polynomial \spad{p} with respect to the extension generated by kernel \spad{k}
514560`\spad{norm(p,l)} computes the norm of the polynomial \spad{p} with respect to the extension generated by kernels \spad{l}
514677`\spad{norm(f,k)} computes the norm of the algebraic number \spad{f} with respect to the extension generated by kernel \spad{k}
514732`\spad{norm(f,l)} computes the norm of the algebraic number \spad{f} with respect to the extension generated by kernels \spad{l}
514793`\spad{norm(a,d)} computes the norm of \spad{a} with respect to the field of extension degree \spad{d} over the ground field of size. Error: if \spad{d} does not divide the extension degree of \spad{a}. Note: norm(a,{}\spad{d}) = reduce(*,{}[a**(q**(d*i)) for \spad{i} in 0..n/d])
514883`\spad{normal01()} \undocumented
515007`\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.
515104`\spad{normal?(x)} \undocumented{} See \axiomFunFrom{normal?}{FiniteAlgebraicExtensionField}
515183`\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.
515265`\spad{normalDenom(f, D)} returns the product of all the normal factors of \spad{denom(f)}. \spad{D} is the derivation to use.
515348`\spad{normalDeriv(poly,i)} computes the \spad{i}th derivative of \spad{poly} divided by i!.
515474`\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 varia
515474`--ble.
515555`\spad{normalElement(n)} \undocumented{} See \axiomFunFrom{normalElement}{FiniteAlgebraicExtensionField}
515648`\spad{normalForm(poly,gb)} reduces the polynomial \spad{poly} modulo the precomputed groebner basis \spad{gb} giving a canonical representative of the residue class.
515750`\spad{normalForm(M, sig, der)} returns \spad{[R, A, A^{-1}]} such that the pseudo-linear operator whose matrix in the basis \spad{y} is \spad{M} had matrix \spad{R} in the basis \spad{z = A y}. \spad{der} is a \spad{sig}-derivation.
515884`\spad{normal(f,g)} \undocumented
515955`\spad{normalise(v)} returns the column vector \spad{v} divided by its euclidean norm; when possible,{} the vector \spad{v} is expressed in terms of radicals.
516146`\spad{normalizeAtInfinity(v)} makes \spad{v} normal at infinity.
516238`\axiom{normalizeIfCan(ts)} returns \axiom{ts} in an normalized shape if \axiom{ts} is zero-dimensional.
516315`\spad{normalize(f)} rewrites \spad{f} using the least possible number of real algebraically independent kernels.
516386`\spad{normalize(x)} normalizes \spad{x} at current precision.
516425`\spad{normalize(f, x)} rewrites \spad{f} using the least possible number of real algebraically independent kernels involving \spad{x}.
516503`\axiom{normalize(\spad{p},{}ts)} normalizes \axiom{\spad{p}} \spad{w}.\spad{r}.\spad{t} \spad{ts}.
516665`\axiom{normalized?(ts)} returns \spad{true} iff for every axiom{\spad{p}} in axiom{ts} we have \axiom{normalized?(\spad{p},{}us)} where \axiom{us} is \axiom{collectUnder(ts,{}mvar(\spad{p}))}.
516960`\axiom{normalized?(\spad{p},{}ts)} returns \spad{true} iff \axiom{\spad{p}} and all its iterated initials have degree zero \spad{w}.\spad{r}.\spad{t}. the main variables of the polynomials of \axiom{ts}
517033`\axiom{normalized?(\spad{q},{}lp)} returns \spad{true} iff \axiom{normalized?(\spad{q},{}\spad{p})} holds for every \axiom{\spad{p}} in \axiom{lp}.
517117`\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}}
517195`\axiom{normalizedAssociate(\spad{p},{}ts)} returns a normalized polynomial \axiom{\spad{n}} \spad{w}.\spad{r}.\spad{t}. \spad{ts} such that \axiom{\spad{n}} and \axiom{\spad{p}} are associates \spad{w}.\spad{r}.\spad{t} \spad{ts} and assuming that \axiom{\spad{p}} is invertible \spad{w}.\spad{r}.\spad{t} \spad{ts}.
517272`\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
517373`\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
517543`\spad{not f} creates the equivalent prefix form.
517581`\spad{not x} returns the complement or negation of \spad{x}.
517621`\spad{notelem(ir)} returns the non-elementary part of an integration result
517705`\spad{nothing} represents failure or absence of value.
517743`\spad{npcoef }\undocumented
518055`\spad{nrows(m)} returns the number of rows in the matrix \spad{m}.
518141`\spad{nrows(m)} returns the number of rows in the array \spad{m}
518225`\spad{nsqfree should} be local
518430`\spad{nthCoef(x, n)} returns the coefficient of the n^th term of \spad{x}.
518499`\spad{nthExpon(l, n)} returns the exponent of the n^th monomial of \spad{l}.
518560`\spad{nthExpon(x, n)} returns the exponent of the n^th monomial of \spad{x}.
518618`\spad{nthExpon(x, n)} returns the exponent of the n^th monomial of \spad{x}.
518696`\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.
518756`\spad{nthFactor(x, n)} returns the factor of the n^th monomial of \spad{x}.
518818`\spad{nthFactor(x, n)} returns the factor of the n^th monomial of \spad{x}.
518871`\spad{nthFactor(l, n)} returns the factor of the n^th monomial of \spad{l}.
518933`\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.
518985`\spad{nthFactor(x, n)} returns the factor of the n^th term of \spad{x}.
519056`\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.
519140`\spad{nthFractionalTerm(p,n)} extracts the \spad{n}th fractional term from the partial fraction \spad{p}. This returns 0 if the index \spad{n} is out of range.
519208`\spad{nthRootIfCan(z,n)} returns the \spad{n}th root of \spad{z} if possible,{} and "failed" otherwise.
519311`\spad{nthRoot(f, n)} returns \spad{(p, r, [r1,...,rm])} such that the \spad{n}th-root of \spad{f} is equal to \spad{r * \spad{p}th-root(r1 * ... * rm)},{} where \spad{r1},{}...,{}rm are distinct factors of \spad{f},{} each of which has an exponent smaller than \spad{p} in \spad{f}.
519552`\spad{nthRoot(x,n)} returns the \spad{n}th root of \spad{x}.
519607`\spad{nthr(p,n)} should be local but conditional
519737`\spad{null?(s)} is \spad{true} if \spad{s} is the \spad{S}-expression ().
519813`\spad{nullSpace(m)} returns a basis for the null space of the matrix \spad{m}.
519935`\spad{nullSpace(m)} returns a basis for the null space of the matrix \spad{m}.
520074`\spad{nullSpace(m)} returns a basis for the null space of the matrix \spad{m}.
520176`\spad{nullSpace(m)} returns a basis for the null space of the matrix \spad{m}.
520263`\spad{nullSpace(m)}+ returns a basis for the null space of the matrix \spad{m}.
520365`\spad{null(u)} tests if list \spad{u} is the empty list.
520406`\spad{nullary?(op)} tests if \spad{op} is nullary.
520457`\spad{nullary A} changes its argument into a \indented{1}{nullary function.}
520509`\spad{nullity(m)} returns the mullity of the matrix \spad{m}. This is the dimension of the null space of the matrix \spad{m}.
520602`\spad{nullity(m)} returns the mullity of the matrix \spad{m}. This is the dimension of the null space of the matrix \spad{m}.
520711`\spad{nullity(m)} returns the nullity of the matrix \spad{m}. This is the dimension of the null space of the matrix \spad{m}.
520805`\spad{nullity(m)} returns the nullity of the matrix \spad{m}. This is the dimension of the null space of the matrix \spad{m}.
520914`\spad{numFunEvals3D()} returns the number of points computed.
520961`\spad{numFunEvals()} returns the number of points computed
521004`\spad{number?(f)} tests if \spad{f} is rational
521075`\spad{numberOfChildren(x)} \undocumented
521145`\spad{numberOfComponents()} returns the number of absolutely irreducible components.
521237`\spad{numberOfComponents()} returns the number of absolutely irreducible components.
521326`\spad{numberOfComponents(s)} returns the number of distinct object components in the indicated \spadtype{ThreeSpace},{} \spad{s},{} such as points,{} curves,{} polygons,{} and constructs.
521406`\spad{numberOfComposites(s)} returns the number of supercomponents,{} or composites,{} in the \spadtype{ThreeSpace},{} \spad{s}; Composites are arbitrary groupings of otherwise distinct and unrelated components; A \spadtype{ThreeSpace} need not have any composites defined at all and,{} outside of the requirement that no component can belong to more than one composite at a time,{} the definition and interpretation of composi
521406`--tes are unrestricted.
521486`\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.
521572`\spad{numberOfCycles(p)} returns the number of non-trivial cycles of the permutation \spad{p}.
521641`\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)}.
521720`\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}.
521837`\spad{numberOfFactors(u)} returns the number of factors in \spadvar{\spad{u}}.
521904`\spad{numberOfFractionalTerms(p)} computes the number of fractional terms in \spad{p}. This returns 0 if there is no fractional part.
521975`\spad{numberOfHues()} returns the number of total hues,{} set in totalHues.
522028`\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 recursiv
522028`--e implementation.
522132`\spad{numberOfIrreduciblePoly(n)}\$FFPOLY(GF) yields the number of monic irreducible univariate polynomials of degree \spad{n} over the finite field {\em GF}.
522238`\spad{numberOfMonomials(f)} is the number of non-zero coefficients with respect to the canonical basis.
522311`\spad{numberOfMonomials(p)} gives the number of non-zero monomials in polynomial \spad{p}.
522397`\spad{numberOfMonomials(x)} returns the number of monomials of \spad{x}.
522477`\spad{numberOfNormalPoly(n)}\$FFPOLY(GF) yields the number of normal polynomials of degree \spad{n} over the finite field {\em GF}.
522578`\spad{numberOfOperations(ode)} counts additions,{} multiplications,{} exponentiations and function calls in the input set of expressions.
522767`\spad{numberOfPrimitivePoly(n)}\$FFPOLY(GF) yields the number of primitive polynomials of degree \spad{n} over the finite field {\em GF}.
523099`\spad{numer x} returns the numerator of \spad{x}.
523147`\spad{numer x} returns the numerator of \spad{x}.
523191`\spad{numer(f)} returns the numerator of \spad{f} viewed as a polynomial in the kernels over \spad{Z}.
523287`\spad{numer(1/d * (f1,...,fn))} = the vector \spad{[f1,...,fn]}.
523349`\spad{numer(x)} returns the numerator of the fraction \spad{x}.
523402`\spad{numer(f)} returns the numerator of \spad{f} viewed as a polynomial in the kernels over \spad{Z}.
523493`\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}.
523690`\spad{numerator(f)} returns the numerator of \spad{f} converted to \%.
523751`\spad{numerator(x)} is the numerator of the fraction \spad{x} converted to \%.
523809`\spad{numerators(x)} returns the stream of numerators of the approximants of the continued fraction \spadvar{\spad{x}}. If the continued fraction is finite,{} then the stream will be finite.
523871`\spad{numericIfCan(x)} returns a real approximation of \spad{x},{} or "failed" if \axiom{\spad{x}} is not a constant.
523992`\spad{numericIfCan(x)} returns a real approximation of \spad{x},{} or "failed" if \axiom{\spad{x}} is not a constant.
524100`\spad{numericIfCan(x)} returns a real approximation of \spad{x},{} or "failed" if \axiom{\spad{x}} is not a constant.
524188`\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.
524325`\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.
524449`\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.
524553`\spad{numeric(x)} returns a real approximation of \spad{x}.
524653`\spad{numeric(x)} returns a real approximation of \spad{x}.
524740`\spad{numeric(x)} returns a real approximation of \spad{x}.
524807`\spad{numeric(x)} returns a real approximation of \spad{x}.
524851`\spad{numeric(x, n)} returns a real approximation of \spad{x} up to \spad{n} decimal places.
524967`\spad{numeric(x,n)} returns a real approximation of \spad{x} up to \spad{n} decimal places.
525070`\spad{numeric(x,n)} returns a real approximation of \spad{x} up to \spad{n} decimal places.
525153`\spad{numeric(x, n)} returns a real approximation of \spad{x} up to \spad{n} decimal places.
525213`\spad{numericalIntegration(args,hints)} performs the integration of the function given the strategy or method returned by \axiomFun{measure}.
525419`\spad{numericalIntegration(args,hints)} performs the integration of the function given the strategy or method returned by \axiomFun{measure}.
525630`\spad{numericalOptimization(args)} performs the optimization of the function given the strategy or method returned by \axiomFun{measure}.
525877`\spad{numericalOptimization(args)} performs the optimization of the function given the strategy or method returned by \axiomFun{measure}.
526018`\spad{obj(a)} essentially returns the original object that was converted to \spadtype{Any} except that the type is forced to be \spadtype{None}.
526051`\spad{objects(s)} returns the \spadtype{ThreeSpace},{} \spad{s},{} in the form of a 3D object record containing information on the number of points,{} curves,{} polygons and constructs comprising the \spadtype{ThreeSpace}..
526219`\spad{oblateSpheroidal(a)} transforms from oblate spheroidal coordinates to Cartesian coordinates: \spad{oblateSpheroidal(a)} is a function which will map the point \spad{(xi,eta,phi)} to \spad{x = a*sinh(xi)*sin(eta)*cos(phi)},{} \spad{y = a*sinh(xi)*sin(eta)*sin(phi)},{} \spad{z = a*cosh(xi)*cos(eta)}.
526297`\spad{ocf2ocdf(a)} is a function to convert an \axiomType{OrderedCompletion Float} to an \axiomType{OrderedCompletion DoubleFloat}
526404`\spad{octon(qe,qE)} constructs an octonion from two quaternions using the relation {\em O = Q + QE}.
526470`\spad{octon(re,ri,rj,rk,rE,rI,rJ,rK)} constructs an octonion from scalars.
526579`\spad{odd? x} is \spad{true} if \spad{x} is an odd integer.
526658`\spad{odd?(n)} returns \spad{true} if and only if \spad{n} is odd.
526711`\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}.
526759`\spad{oddInfiniteProduct(f(x))} computes \spad{product(n=1,3,5...,f(x**n))}. The series \spad{f(x)} should have constant coefficient 1.
526849`\spad{oddInfiniteProduct(f(x))} computes \spad{product(n=1,3,5...,f(x**n))}. The series \spad{f(x)} should have constant coefficient 1.
526937`\spad{oddInfiniteProduct(f(x))} computes \spad{product(n=1,3,5...,f(x**n))}. The series \spad{f(x)} should have constant coefficient 1.
527023`\spad{oddInfiniteProduct(f(x))} computes \spad{product(n=1,3,5...,f(x**n))}. The series \spad{f(x)} should have constant coefficient 1.
527103`\spad{oddintegers(n)} returns \spad{[n,n+2,n+4,...]}.
527188`\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))))}.
527268`\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))))}.}
527339`\spad{ode1(f,c)} is the solution to \spad{y' = f(y)} such that \spad{y(a) = c}.
527423`\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}.
527516`\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}.
527611`\spad{omError(k,l)} creates an instance of OpenMathError.
527819`\spad{one?(a)} tests whether \spad{a} is the unit 1.
527866`\spad{one?(x)} tests if \spad{x} is equal to 1.
527906`\spad{one? a} holds if \spad{a} is the arity of nullary function.
527945`\spad{one?(I)} tests whether the ideal \spad{I} is the unit ideal,{} \spadignore{i.e.} contains 1.
528017`\spad{oneDimensionalArray(l)} creates an array from a list of elements \spad{l}
528088`\spad{oneDimensionalArray(n,s)} creates an array from \spad{n} copies of element \spad{s}
528172`\spad{op(p)} creates a value in \$ equal to \spad{p} in \spad{P}.
528234`\spad{open?(t)} tests whether the given tube plot \spad{t} is open.
528284`\spad{open(s)} returns the file \spad{s} open for input.
528335`\spad{open(s,mode)} returns a file \spad{s} open for operation in the indicated mode: "input" or "output".
528393`\spad{operation(f)} returns the name of the operation represented by \spad{f}.
528791`\spad{operations(c)} returns the list of all operator exported by instantiations of constructor \spad{c}. The operators are partitioned into overload sets.
528860`\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.
528937`\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.
529018`\spad{operator(p)} returns an elementary operator with the same symbol as \spad{p}
529096`\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
529181`\spad{operator(op)} returns the Liouvillian operator based on \spad{op}
529260`\spad{operator(op)} returns a copy of \spad{op} with the domain-dependent properties appropriate for \%.
529403`\spad{operator(s)} returns an operator with name \spad{s},{} with the appropriate semantics if \spad{s} is known. If \spad{s} is not known,{} the result has no semantics.
529466`\spad{operator(op(a1,...,an))} returns the operator op.
529519`\spad{operator(e)} returns the magma operation being applied.
529566`\spad{operator(op)} returns a copy of \spad{op} with the domain-dependent properties appropriate for \%.
529636`\spad{operator(f)} makes \spad{f} into an operator with arbitrary arity.
529686`\spad{operator(n,a)} returns an operator named \spad{n} and with arity \spad{a}.
529746`\spad{operator(f, a)} makes \spad{f} into an operator of arity \spad{a}.
529802`\spad{operator(f, n)} makes \spad{f} into an \spad{n}-ary operator.
529935`\spad{operators(f)} returns all the basic operators appearing in \spad{f},{} no matter what their levels are.
530050`\spad{opeval should} be local but conditional
530112`\spad{optAttributes(o)} is a function for supplying a list of attributes of an optimization problem.
530424`\spad{optimize(prob)} is a top level ANNA function to minimize a function or a set of functions with any constraints as defined within \axiom{\spad{prob}}. \blankline It iterates over the \axiom{domains} of \axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \axiom{measure} and then optimize the function on that \axiom{domain}.
530519`\spad{optimize(f,start)} is a top level ANNA function to minimize a function,{} \axiom{\spad{f}},{} of one or more variables without constraints. \blankline The parameter \axiom{\spad{start}} is a list of the initial guesses of the values of the variables. \blankline It iterates over the \axiom{domains} of \axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \a
530519`--xiom{measure} and then optimize the function on that \axiom{domain}.
530615`\spad{optimize(lf,start)} is a top level ANNA function to minimize a set of functions,{} \axiom{\spad{lf}},{} of one or more variables without constraints \spadignore{i.e.} a least-squares problem. \blankline The parameter \axiom{\spad{start}} is a list of the initial guesses of the values of the variables. \blankline It iterates over the \axiom{domains} of \axiomType{NumericalOptimizationCategory} to 
530615`--get the name and other relevant information of the best \axiom{measure} and then optimize the function on that \axiom{domain}.
530717`\spad{optimize(prob,routines)} is a top level ANNA function to minimize a function or a set of functions with any constraints as defined within \axiom{\spad{prob}}. \blankline It iterates over the \axiom{domains} listed in \axiom{\spad{routines}} of \axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \axiom{measure} and then optimize the function 
530717`--on that \axiom{domain}.
530826`\spad{optimize(f,start,lower,upper)} is a top level ANNA function to minimize a function,{} \axiom{\spad{f}},{} of one or more variables with simple constraints. The bounds on the variables are defined in \axiom{\spad{lower}} and \axiom{\spad{upper}}. \blankline The parameter \axiom{\spad{start}} is a list of the initial guesses of the values of t
530826`--he variables. \blankline It iterates over the \axiom{domains} of \axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \axiom{measure} and then optimize the function on that \axiom{domain}.
530984`\spad{optimize(f,start,lower,cons,upper)} is a top level ANNA function to minimize a function,{} \axiom{\spad{f}},{} of one or more variables with the given constraints. \blankline These constraints may be simple constraints on the variables in which case \axiom{\spad{cons}} would be an empty list and the bounds on those va
530984`--riables defined in \axiom{\spad{lower}} and \axiom{\spad{upper}},{} or a mixture of simple,{} linear and non-linear constraints,{} where \axiom{\spad{cons}} contains the linear and non-linear constraints and the bounds on these are added to \axiom{\spad{upper}} and \axiom{\spad{lower}}. \blankline The parameter \axiom{\spad{start}} is a list of the initial guesses of the values of the variables. \blankline It iterates over the \axiom{domains} of \axiomType{NumericalOptimizationCategory} to get
530984`-- the name and other relevant information of the best \axiom{measure} and then optimize the function on that \axiom{domain}.
531166`\spad{option?()} is not to be used at the top level; option? internally returns \spad{true} for drawing options which are indicated in a draw command,{} or \spad{false} for those which are not.
531226`\spad{option(l,s)} determines whether the indicated drawing option,{} \spad{s},{} is contained in the list of drawing options,{} \spad{l},{} which is defined by the draw command.
531316`\spad{option()} is not to be used at the top level; option determines internally which drawing options are indicated in a draw command.
531387`\spad{optional?(p)} tests if \spad{p} is a single matching variable which can match an identity.
531436`\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.
531495`\spad{optional(x)} tells the pattern matcher that \spad{x} can match an identity (0 in a sum,{} 1 in a product or exponentiation)..
531571`\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}.
531639`\spad{options(v)} takes the viewport,{} \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport} and returns a list of all the draw options from the domain \spad{DrawOption} which are being used by \spad{v}.
531709`\spad{options(v,lopt)} takes the given two-dimensional viewport,{} \spad{v},{} of the domain \spadtype{TwoDimensionalViewport} and returns \spad{v} with it's draw options modified to be those which are indicated in the given list,{} \spad{lopt} of domain \spadtype{DrawOption}.
531780`\spad{options(v,lopt)} takes the viewport,{} \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport} and sets the draw options being used by \spad{v} to those indicated in the list,{} \spad{lopt},{} which is a list of options from the domain \spad{DrawOption}.
531853`\spad{optpair(l)} returns \spad{l} has the form \spad{[a, b]} and a is optional,{} and "failed" otherwise.
531923`\spad{f or g} creates the equivalent infix form.
531963`\spad{x or y} returns the disjunction of \spad{x} and \spad{y}.
532005`\spad{orbit(gp,ls)} returns the orbit of the ordered list {\em ls} under the group {\em gp}. Note: return type is \spad{L} \spad{L} \spad{S} temporarily because FSET \spad{L} \spad{S} has an error.
532072`\spad{orbit(p, el)} returns the orbit of {\em el} under the permutation \spad{p},{} \spadignore{i.e.} the set which is given by applications of the powers of \spad{p} to {\em el}.
532130`\spad{orbit(gp,el)} returns the orbit of the element {\em el} under the group {\em gp},{} \spadignore{i.e.} the set of all points gained by applying each group element to {\em el}.
532185`\spad{orbit(gp,els)} returns the orbit of the unordered set {\em els} under the group {\em gp}.
532250`\spad{orbits(gp)} returns the orbits of the group {\em gp},{} \spadignore{i.e.} it partitions the (finite) of all moved points.
532309`\spad{ord(c)} provides an integral code corresponding to the character \spad{c}. It is always \spad{true} that \spad{char ord c = c}.
532444`\spad{order(x)} \undocumented
532542`\spad{order(f)} \undocumented
532663`\spad{order(f)} \undocumented
532943`\spad{order(x)} \undocumented
533001`\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.}
533070`\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.
533144`\spad{order x} is the order of magnitude of \spad{x}. Note: \spad{base ** order x <= |x| < base ** (1 + order x)}.
533198`\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}.
533283`\spad{order(v)} returns \spad{n} if \spad{v} is the \spad{n}-th derivative of any differential indeterminate.
533360`\spad{order(x)} returns the exponent of the highest power of \spad{p} dividing \spad{x}.
533429`\spad{order(p)} returns the order of a permutation \spad{p} as a group element.
533489`\spad{order(gp)} returns the order of the group {\em gp}.
533554`\spad{order(a)} computes the order of an element in the multiplicative group of the field. Error: if \spad{a} is 0.
533643`\spad{order(b)} computes the order of an element \spad{b} in the multiplicative group of the field. Error: if \spad{b} equals 0.
533865`\spad{order(x,n)} returns the minimum of \spad{n} and the order of \spad{x}.
533953`\spad{order(f,n) = min(m,n)},{} where \spad{m} is the degree of the lowest order non-zero term in \spad{f}.
534033`\spad{order(p,s)} returns the order of the differential polynomial \spad{p} in differential indeterminate \spad{s}.
534120`\spad{order(f,x)} returns the order of \spad{f} viewed as a series in \spad{x} may result in an infinite loop if \spad{f} has no non-zero terms.
534212`\spad{order(p, q)} returns the largest \spad{n} such that \spad{q**n} divides polynomial \spad{p} \spadignore{i.e.} the order of \spad{p(x)} at \spad{q(x)=0}.
534313`\spad{order(f,u,g)} \undocumented
534429`\spad{order(f,x,n)} returns \spad{min(n,order(f,x))}.
534540`\spad{orthonormalBasis(m)} returns the orthogonal matrix \spad{b} such that \spad{b*m*(inverse b)} is diagonal. Error: if \spad{m} is not a symmetric matrix.
534726`\spad{outerProduct(u,v)} constructs the matrix whose (\spad{i},{}\spad{j})\spad{'}th element is \spad{u}(\spad{i})*v(\spad{j}).
534801`\spad{outlineRender(v,s)} displays the polygon outline showing either triangularized surface or a quadrilateral surface outline depending on the whether the \spadfun{diagonals} function has been set,{} for the given three-dimensional viewport \spad{v} which is of domain \spadtype{ThreeDimensionalViewport},{} if \spad{s} is "on",{} or does not display the polygon outline if \spad{s} is "off".
534872`\axiom{outputArgs(\spad{s1},{}\spad{s2},{}\spad{p},{}ts)} is an internal subroutine,{} exported only for developement.
534957`\spad{outputAsFortran()} generates the default code for \spadtype{ASP12}.
535008`\spad{outputAsFortran()} generates the default code for \spadtype{ASP29}.
535059`\spad{outputAsFortran()} generates the default code for \spadtype{ASP33}.
535110`\spad{outputAsFortran(fn)} \undocumented{}
535172`\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}.
535248`\spad{outputAsFortran(o)} sends output \spad{o} in FORTRAN format.
535318`\axiom{outputAsFortran(\spad{u})} translates \axiom{\spad{u}} into a legal FORTRAN subprogram.
535382`\spad{outputAsFortran(v,o)} sends output \spad{v} = \spad{o} in FORTRAN format to the destination defined by \spadsyscom{set output fortran}.
535459`\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}.
535534`\spad{outputAsScript(o)} sends output \spad{o} in Script Formula Formatter format to the destination defined by \spadsyscom{set output formula}.
535603`\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}.
535675`\spad{outputAsTex(o)} sends output \spad{o} in Tex format to the destination defined by \spadsyscom{set output tex}.
535741`\spad{outputBinaryFile(f)} returns an output conduit obtained by opening the file named by `f' as a binary file.
535804`\spad{outputBinaryFile(f)} returns an output conduit obtained by opening the file named by `f' as a binary file.
535865`\spad{outputFixed()} sets the output mode to fixed point notation; the output will contain a decimal point.
535906`\spad{outputFixed(n)} sets the output mode to fixed point notation,{} with \spad{n} digits displayed after the decimal point.
535965`\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}.
536009`\spad{outputFloating(n)} sets the output mode to floating (scientific) notation with \spad{n} significant digits displayed after the decimal point.
536071`\spad{outputForm(sf)} creates an form for small float \spad{sf}.
536125`\spad{outputForm(n)} creates an form for integer \spad{n}.
536175`\spad{outputForm(s)} creates an form for string \spad{s}.
536224`\spad{outputForm(s)} creates an form for symbol \spad{s}.
536273`\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.
536356`\spad{outputForm(p, x)} returns the output form of \spad{p} using \spad{x} for the otherwise anonymous variable.
536455`\spad{outputForm(l, fop, fexp, unit)} converts the monoid element represented by \spad{l} to an \spadtype{OutputForm}. Argument unit is the output form for the \spadignore{unit} of the monoid (\spadignore{e.g.} 0 or 1),{} \spad{fop(a, b)} is the output form for the monoid operation applied to \spad{a} and \spad{b} (\spadignore{e.g.} \spad{a + b},{} \spad{a * b}
536455`--,{} \spad{ab}),{} and \spad{fexp(a, n)} is the output form for the exponentiation operation applied to \spad{a} and \spad{n} (\spadignore{e.g.} \spad{n a},{} \spad{n * a},{} \spad{a ** n},{} \spad{a\^n}).
536599`\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.
536642`\spad{outputGeneral(n)} sets the output mode to general notation with \spad{n} significant digits displayed.
536703`\spad{outputList(l)} displays the concatenated components of the list \spad{l} on the ``algebra output'' stream,{} as defined by \spadsyscom{set output algebra}; quotes are stripped from strings.
536760`\spad{outputMeasure(n)} rounds \spad{n} to 3 decimal places and outputs it as a string
536829`\spad{outputSpacing(n)} inserts a space after \spad{n} (default 10) digits on output; outputSpacing(0) means no spaces are inserted.
536890`\spad{output} indicates that an IO conduit is for output
536925`\spad{output(x)} displays the output form \spad{x} on the ``algebra output'' stream,{} as defined by \spadsyscom{set output algebra}.
536979`\spad{output(s)} displays the string \spad{s} on the ``algebra output'' stream,{} as defined by \spadsyscom{set output algebra}.
537029`\spad{output(n,st)} computes and displays the first \spad{n} entries of \spad{st}.
537097`\spad{output(s,x)} displays the string \spad{s} followed by the form \spad{x} on the ``algebra output'' stream,{} as defined by \spadsyscom{set output algebra}.
537158`\spad{over(f,g)} creates a form for the vertical fraction of \spad{f} over \spad{g}.
537200`\spad{overbar(f)} creates the form \spad{f} with an overbar.
537242`\spad{overlabel(x,f)} creates the form \spad{f} with "x overbar" over the top.
537289`\spad{overlap(x, y)} returns \spad{[l, m, r]} such that \spad{x = l * m},{} \spad{y = m * r} and \spad{l} and \spad{r} have no overlap,{} \spadignore{i.e.} \spad{overlap(l, r) = [l, 1, r]}.
537368`\spad{overset?(s,sl)} returns \spad{true} if \spad{s} properly a sublist of a member of \spad{sl}; otherwise it returns \spad{false}
537468`\spad{pToDmp(p)} converts \spad{p} from a \spadtype{POLY} to a \spadtype{DMP}.
537561`\spad{pToHdmp(p)} converts \spad{p} from a \spadtype{POLY} to a \spadtype{HDMP}.
537666`\spad{pack!(f)} reorganizes the file \spad{f} on disk to recover unused space.
537718`\spad{pack!(f)} reorganizes the file \spad{f} on disk to recover unused space.
537755`\spad{packageCall(f)} returns the input form corresponding to \spad{f}\$\spad{R}.
537824``package' is the kind of package constructors.
537869`\spad{pade(nd,dd,s)} computes the quotient of polynomials (if it exists) with numerator degree at most \spad{nd} and denominator degree at most \spad{dd} which matches the series \spad{s} to order \spad{nd + dd}.
538043`\spad{pade(nd,dd,ns,ds)} computes the approximant as a quotient of polynomials (if it exists) for arguments \spad{nd} (numerator degree of approximant),{} \spad{dd} (denominator degree of approximant),{} \spad{ns} (numerator series of function),{} and \spad{ds} (denominator series of function).
538164`\spad{pade(nd,dd,ns,ds)} computes the approximant as a quotient of polynomials (if it exists) for arguments \spad{nd} (numerator degree of approximant),{} \spad{dd} (denominator degree of approximant),{} \spad{ns} (numerator series of function),{} and \spad{ds} (denominator series of function).
538369`\spad{padecf(nd,dd,ns,ds)} computes the approximant as a continued fraction of polynomials (if it exists) for arguments \spad{nd} (numerator degree of approximant),{} \spad{dd} (denominator degree of approximant),{} \spad{ns} (numerator series of function),{} and \spad{ds} (denominator series of function).
538501`\spad{padicFraction(q)} expands the fraction \spad{p}-adically in the primes \spad{p} in the denominator of \spad{q}. For example,{} \spad{padicFraction(3/(2**2)) = 1/2 + 1/(2**2)}. Use \spadfunFrom{compactFraction}{PartialFraction} to return to compact form.
538557`\spad{padicallyExpand(p,x)} is a utility function that expands the second argument \spad{x} ``p-adically'' in the first.
538643`\spad{pair?(s)} is \spad{true} if \spad{s} has is a non-null Lisp list.
538719`\spad{pair(s,t)} returns a pair object composed of `s' and `t'.
538758`\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)}.
538972`\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}.
539206`\spad{palgLODE(op, g, kx, y, x)} returns the solution of \spad{op f = g}. \spad{y} is an algebraic function of \spad{x}.
539398`\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 
539398`--solves \spad{du/dx + n * da/dx u(x) = u(x)} for an unknown \spad{u(x)} not involving \spad{y}.
539558`\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{
539558`--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}.
539738`\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 *
539738`-- df/dx}.
539871`\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.
540026`\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{
540026`--f(x,y)}. The operation returns "failed" if no such functions exist.
540201`\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.
540327`\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.
540423`\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)}.
540552`\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)}.
540701`\spad{palgint(f, x, y)} returns the integral of \spad{f(x,y)dx} where \spad{y} is an algebraic function of \spad{x}.
540801`\spad{palgintegrate(f, d)} integrates \spad{f} with respect to the derivation \spad{d}. Argument \spad{f} must be a pure algebraic function.
540899`\spad{palglimint0(f, x, y, [u1,...,un], d, p)} returns functions \spad{[h,[[ci, ui]]]} such that the \spad{ui}'s are among \spad{[u1,...,un]} and \spad{d(h + sum(ci log(ui)))/dx = f(x,y)} if such functions exist,{} and "failed" otherwise. Argument \spad{y} is an algebraic function of \spad{x} satisfying \spad
540899`--{d(x)\^2y(x)\^2 = P(x)}.
541096`\spad{palglimint0(f, x, y, [u1,...,un], z, t, c)} returns functions \spad{[h,[[ci, ui]]]} such that the \spad{ui}'s are among \spad{[u1,...,un]} and \spad{d(h + sum(ci log(ui)))/dx = f(x,y)} if such functions exist,{} and "failed" otherwise. Argument \spad{y} is an algebraic function of \s
541096`--pad{x} satisfying \spad{f(x,y)dx = c f(t,y) dy}; \spad{c} and \spad{t} are rational functions of \spad{y}.
541313`\spad{palglimint(f, x, y, [u1,...,un])} returns functions \spad{[h,[[ci, ui]]]} such that the \spad{ui}'s are among \spad{[u1,...,un]} and \spad{d(h + sum(ci log(ui)))/dx = f(x,y)} if such functions exist,{} "failed" otherwise; \spad{y} is an algebraic function of \spad{x}.
541481`\spad{parabolicCylindrical(pt)} transforms \spad{pt} from parabolic cylindrical coordinates to Cartesian coordinates: the function produced will map the point \spad{(u,v,z)} to \spad{x = 1/2*(u**2 - v**2)},{} \spad{y = u*v},{} \spad{z}.
541558`\spad{parabolic(pt)} transforms \spad{pt} from parabolic coordinates to Cartesian coordinates: the function produced will map the point \spad{(u,v)} to \spad{x = 1/2*(u**2 - v**2)},{} \spad{y = u*v}.
541624`\spad{paraboloidal(pt)} transforms \spad{pt} from paraboloidal coordinates to Cartesian coordinates: the function produced will map the point \spad{(u,v,phi)} to \spad{x = u*v*cos(phi)},{} \spad{y = u*v*sin(phi)},{} \spad{z = 1/2 * (u**2 - v**2)}.
541693`\spad{parametersOf(tab)} returns a list of all the symbols declared in \spad{tab}
541751`\spad{parameters(f)} returns the list of parameters bound by `f'.
541817`\spad{parameters(h)} gives the parameters specified in the definition header `h'.
541875`\spad{parametric? determines} whether it is a parametric plot?
541968`\spad{paren(lf)} creates the form separating the elements of \spad{lf} by commas and encloses the result in parentheses.
542056`\spad{paren(f)} creates the form enclosing \spad{f} in parentheses.
542096`\spad{paren([f1,...,fn])} returns \spad{(f1,...,fn)}. This prevents the \spad{fi} from being evaluated when operators are applied to them,{} and makes them applicable to a unary operator. For example,{} \spad{atan(paren [x, 2])} returns the formal kernel \spad{atan((x, 2))}.
542147`\spad{paren(f)} returns (\spad{f}). This prevents \spad{f} from being evaluated when operators are applied to it. For example,{} \spad{log(1)} returns 0,{} but \spad{log(paren 1)} returns the formal kernel log((1)).
542192`\spad{parent(s)} returns the subspace which is the parent of the indicated 3 dimensional subspace \spad{s}. If \spad{s} is the top level subspace an error message is returned.
542236`\spad{parents(c)} returns the list of all category forms directly extended by the category `c'.
542316`parseString is the inverse of unparse. It parses a string to InputForm.
542365`\spad{parse(f)} parses the source file \spad{f} (supposedly containing Spad algebras) and returns a List Syntax. The filename \spad{f} is supposed to have the proper extension. Note that this function has the side effect of executing any system command contained in the file \spad{f},{} even if it might not be meaningful.
542474`\spad{s} < \spad{t} returns \spad{true} if all elements of set aggregate \spad{s} are also elements of set aggregate \spad{t}.
542527`\spad{partialDenominators(x)} extracts the denominators in \spadvar{\spad{x}}. That is,{} if \spad{x = continuedFraction(b0, [a1,a2,a3,...], [b1,b2,b3,...])},{} then \spad{partialDenominators(x) = [b1,b2,b3,...]}.
542598`\spad{partialFraction(rf, var)} returns the partial fraction decomposition of the rational function \spad{rf} with respect to the variable var.
542692`\spad{partialFraction(numer,denom)} is the main function for constructing partial fractions. The second argument is the denominator and should be factored.
542761`\spad{partialFraction(num, facdenom, var)} returns the partial fraction decomposition of the rational function whose numerator is \spad{num} and whose factored denominator is \spad{facdenom} with respect to the variable var.
542869`\spad{partialNumerators(x)} extracts the numerators in \spadvar{\spad{x}}. That is,{} if \spad{x = continuedFraction(b0, [a1,a2,a3,...], [b1,b2,b3,...])},{} then \spad{partialNumerators(x) = [a1,a2,a3,...]}.
542938`\spad{partialQuotients(x)} extracts the partial quotients in \spadvar{\spad{x}}. That is,{} if \spad{x = continuedFraction(b0, [a1,a2,a3,...], [b1,b2,b3,...])},{} then \spad{partialQuotients(x) = [b0,b1,b2,b3,...]}.
543006`\spad{particularSolution(u)} \undocumented
543079`\spad{particularSolution(A,B)} finds a particular solution of the linear system \spad{AX = B}.
543180`\spad{particularSolution(A,B)} finds a particular solution of the linear system \spad{AX = B}.
543292`\spad{particularSolution(op, g, [f1,...,fm], I)} returns a particular solution \spad{h} of the equation \spad{op y = g} where \spad{[f1,...,fm]} are linearly independent and \spad{op(fi)=0}. The value "failed" is returned if no particular solution is found. Note: the method of variations of parameters is used.
543385`\spad{partition(n)} returns the number of partitions of the integer \spad{n}. This is the number of distinct ways that \spad{n} can be written as a sum of positive integers.
543448`\spad{partition(li)} converts a list of integers \spad{li} to a partition
543510`\spad{partitions n} returns the stream of all partitions of size \spad{n}.
543855`\spad{parts x} returns the list of decreasing integer sequence making up the partition \spad{x}.
543913`\spad{parts(m)} returns a list of the elements of \spad{m} in row major order
543986`\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})}.
544078`\spad{pascalTriangle(n,r)} returns the binomial coefficient \spad{C(n,r)=n!/(r! (n-r)!)} and stores it in a table to prevent recomputation.
544163`\spad{pastel(c)} sets the shade of a hue,{} \spad{c},{} above bright,{} but below light.
544204`\spad{patternMatchTimes(lsubj, lpat, res, match)} matches the product of patterns \spad{reduce(*,lpat)} to the product of subjects \spad{reduce(*,lsubj)}; \spad{r} contains the previous matches and match is a pattern-matching function on \spad{P}.
544659`\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}.
544778`\spad{patternMatch(cexpr, pat, res)} matches the pattern \spad{pat} to the complex expression \spad{cexpr}. res contains the variables of \spad{pat} which are already matched and their matches.
544938`\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.
545062`\spad{patternMatch(n, pat, res)} matches the pattern \spad{pat} to the integer \spad{n}; res contains the variables of \spad{pat} which are already matched and their matches.
545206`\spad{patternMatch(f(e1,...,en), pat, res)} matches the pattern \spad{pat} to \spad{f(e1,...,en)}; res contains the variables of \spad{pat} which are already matched and their matches.
545329`\spad{patternMatch(l, pat, res)} matches the pattern \spad{pat} to the list \spad{l}; res contains the variables of \spad{pat} which are already matched and their matches.
545465`\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.
545624`\spad{patternMatch(a/b, pat, res)} matches the pattern \spad{pat} to the quotient \spad{a/b}; res contains the variables of \spad{pat} which are already matched and their matches.
546519`\spad{patternMatch(expr, pat, res)} matches the pattern \spad{pat} to the expression \spad{expr}; res contains the variables of \spad{pat} which are already matched and their matches (necessary for recursion).
546647`\spad{patternMatch(expr, pat, res)} matches the pattern \spad{pat} to the expression \spad{expr}. res contains the variables of \spad{pat} which are already matched and their matches (necessary for recursion). Initially,{} res is just the result of \spadfun{new} which is an empty list of matches.
546761`\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.
546958`\spad{patternMatch(lsubj, lpat, op, res, match)} matches the list of patterns \spad{lpat} to the list of subjects \spad{lsubj},{} allowing for commutativity; \spad{op} is the operator such that \spad{op}(\spad{lpat}) should match \spad{op}(\spad{lsubj}) at the end,{} \spad{r} contains the previous mat
546958`--ches,{} and match is a pattern-matching function on \spad{P}.
547163`\spad{patternVariable(x, c?, o?, m?)} creates a pattern variable \spad{x},{} which is constant if \spad{c? = true},{} optional if \spad{o? = true},{} and multiple if \spad{m? = true}.
547241`\spad{pattern(r)} returns the pattern corresponding to the left hand side of the rule \spad{r}.
547305`\spad{pdct(a1**n1 a2**n2 ...)} returns \spad{n1! * a1**n1 * n2! * a2**n2 * ...}. This function is used in the package \spadtype{CycleIndicators}.
547356`\spad{pdf2df(p)} coerces a \axiomType{Polynomial DoubleFloat} to \axiomType{DoubleFloat}. It is an error if \axiom{\spad{p}} is not retractable to DoubleFloat.
547441`\spad{pdf2ef(p)} coerces a \axiomType{Polynomial DoubleFloat} to \axiomType{Expression Float}
547532`\spad{perfectNthPower?(n,r)} returns \spad{true} if \spad{n} is an \spad{r}th power and \spad{false} otherwise
547611`\spad{perfectNthRoot(n)} returns \spad{[x,r]},{} where \spad{n = x\^r} and \spad{r} is the largest integer such that \spad{n} is a perfect \spad{r}th power
547704`\spad{perfectNthRoot(n,r)} returns the \spad{r}th root of \spad{n} if \spad{n} is an \spad{r}th power and returns "failed" otherwise
547791`\spad{perfectSqrt(n)} returns the square root of \spad{n} if \spad{n} is a perfect square and returns "failed" otherwise
547856`\spad{perfectSquare?(n)} returns \spad{true} if \spad{n} is a perfect square and \spad{false} otherwise
547914`\spad{permanent(x)} computes the permanent of a square matrix \spad{x}. The {\em permanent} is equivalent to the \spadfun{determinant} except that coefficients have no change of sign. This function is much more difficult to compute than the {\em determinant}. The formula used is by \spad{H}.\spad{J}. Ryser,{} improved by [Nijenhuis and Wilf,{} Ch. 19]. Note: permanent(\spad{x}) choose one of three algorithms,{} depending on the underlying ri
547914`--ng \spad{R} and on \spad{n},{} the number of rows (and columns) of x:\begin{items} \item 1. if 2 has an inverse in \spad{R} we can use the algorithm of \indented{3}{[Nijenhuis and Wilf,{} ch.19,{}\spad{p}.158]; if 2 has no inverse,{}} \indented{3}{some modifications are necessary:} \item 2. if {\em n > 6} and \spad{R} is an integral domain with characteristic \indented{3}{different from 2 (the algorithm works if and only 2 is not a} \indented{3}{zero-divisor of \spad{R} and {\em characteristic
547914`--()\$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}
547976`\spad{permutationGroup(ls)} coerces a list of permutations {\em ls} to the group generated by this list.
548054`\spad{permutationRepresentation(pi,n)} returns the matrix {\em (deltai,pi(i))} (Kronecker delta) if the permutation {\em pi} is in list notation and permutes {\em {1,2,...,n}}.
548153`\spad{permutationRepresentation([pi1,...,pik],n)} returns the list of matrices {\em [(deltai,pi1(i)),...,(deltai,pik(i))]} if the permutations {\em pi1},{}...,{}{\em pik} are in list notation and are permuting {\em {1,2,...,n}}.
548264`\spad{permutationRepresentation([pi1,...,pik],n)} returns the list of matrices {\em [(deltai,pi1(i)),...,(deltai,pik(i))]} (Kronecker delta) for the permutations {\em pi1,...,pik} of {\em {1,2,...,n}}.
548390`\spad{permutationRepresentation(pi,n)} returns the matrix {\em (deltai,pi(i))} (Kronecker delta) for a permutation {\em pi} of {\em {1,2,...,n}}.
548504`\spad{permutation(n, r)} returns the number of permutations of \spad{n} objects taken \spad{r} at a time,{} \spadignore{i.e.} n!/(\spad{n}-\spad{r})!.
548620`\spad{permutation(n)} returns \spad{!P(n,r) = n!/(n-r)!}. This is the number of permutations of \spad{n} objects taken \spad{r} at a time.
548687`\spad{permutation(n, m)} returns the number of permutations of \spad{n} objects taken \spad{m} at a time. Note: \spad{permutation(n,m) = n!/(n-m)!}.
548755`\spad{permutations(n)} is the stream of permutations \indented{1}{formed from \spad{1,2,3,...,n}.}
548841`\spad{perspective(v,s)} displays the graph in perspective if \spad{s} is "on",{} or does not display perspective if \spad{s} is "off" for the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport}.
548910`\spad{phiCoord(pt)} returns the third element of the point,{} \spad{pt},{} although no assumptions are made as to the coordinate system being used. This function is defined for the convenience of the user dealing with a spherical coordinate system.
548963`\spad{physicalLength!(x,n)} changes the physical length of \spad{x} to be \spad{n} and returns the new array.
549096`\spad{physicalLength(x)} returns the number of elements \spad{x} can accomodate before growing
549243`\spad{pi()} returns the \spad{pi} operator
549383`\spad{pi()} returns the constant \spad{pi}.
549438`\spad{pi(x)} represents the NAG Library function X01AAF which returns \indented{1}{an approximation to the value of \spad{pi}}
549515`\spad{pi()} returns the symbolic \%\spad{pi}.
549542`\spad{pile(l)} creates the form consisting of the elements of \spad{l} which displays as a pile,{} \spadignore{i.e.} the elements begin on a new line and are indented right to the same margin.
549660`\spad{plenaryPower(a,n)} is recursively defined to be \spad{plenaryPower(a,n-1)*plenaryPower(a,n-1)} for \spad{n>1} and \spad{a} for \spad{n=1}.
549737`\spad{pleskenSplit(poly, eps)} determines a start polynomial {\em start}\\ by using "startPolynomial then it increases the exponent \spad{n} of {\em start ** n mod poly} to get an approximate factor of {\em poly},{} in general of degree "degree \spad{poly} -1". Then a divisor cascade is calculated and the best splitting is chosen,{} as soon as the error is small enough.
549817`\spad{pleskenSplit(poly,eps,info)} determines a start polynomial {\em start} by using "startPolynomial then it increases the exponent \spad{n} of {\em start ** n mod poly} to get an approximate factor of {\em poly},{} in general of degree "degree \spad{poly} -1". Then a divisor cascade is calculated and the best splitting is chosen,{} as soon as the error is small enough. If {\em info} is {\em true},{} then informat
549817`--ion messages are issued.
549905`\spad{plotPolar(f)} plots the polar curve \spad{r = f(theta)} as theta ranges over the interval \spad{[0,2*\%pi]}; this is the same as the parametric curve \spad{x = f(t) * cos(t)},{} \spad{y = f(t) * sin(t)}.
549967`\spad{plotPolar(f,a..b)} plots the polar curve \spad{r = f(theta)} as theta ranges over the interval \spad{[a,b]}; this is the same as the parametric curve \spad{x = f(t) * cos(t)},{} \spad{y = f(t) * sin(t)}.
550050`\spad{plotPolar(f,theta)} plots the graph of \spad{r = f(theta)} as \spad{theta} ranges from 0 to 2 \spad{pi}
550109`\spad{plotPolar(f,theta,seg)} plots the graph of \spad{r = f(theta)} as \spad{theta} ranges over an interval
550189`\spad{plot(f,a..b)} plots the function \spad{f(x)} on the interval \spad{[a,b]}.
550267`\spad{plot([f1,...,fm],a..b)} plots the functions \spad{y = f1(x)},{}...,{} \spad{y = fm(x)} on the interval \spad{a..b}.
550351`\spad{plot(x,r)} \undocumented
550407`\spad{plot(x,r)} \undocumented
550461`\spad{plot(f,g,a..b)} plots the parametric curve \spad{x = f(t)},{} \spad{y = g(t)} as \spad{t} ranges over the interval \spad{[a,b]}.
550566`\spad{plot(f,a..b,c..d)} plots the function \spad{f(x)} on the interval \spad{[a,b]}; \spad{y}-range of \spad{[c,d]} is noted in Plot object.
550665`\spad{plot([f1,...,fm],a..b,c..d)} plots the functions \spad{y = f1(x)},{}...,{} \spad{y = fm(x)} on the interval \spad{a..b}; \spad{y}-range of \spad{[c,d]} is noted in Plot object.
550770`\spad{plot(fcn,x,seg)} plots the graph of \spad{y = f(x)} on a interval
550845`\spad{plot(f,g,t,seg)} plots the graph of \spad{x = f(t)},{} \spad{y = g(t)} as \spad{t} ranges over an interval.
550922`\spad{plot(f,g,h,a..b)} plots {/emx = \spad{f}(\spad{t}),{} \spad{y} = \spad{g}(\spad{t}),{} \spad{z} = \spad{h}(\spad{t})} as \spad{t} ranges over {/em[a,{}\spad{b}]}.
551083`\spad{plot(f,g,a..b,c..d,e..f)} plots the parametric curve \spad{x = f(t)},{} \spad{y = g(t)} as \spad{t} ranges over the interval \spad{[a,b]}; \spad{x}-range of \spad{[c,d]} and \spad{y}-range of \spad{[e,f]} are noted in Plot object.
551230`\spad{plot(f1,f2,f3,f4,x,y,z,w)} \undocumented
551454`\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.
551553`\spad{plusInfinity()} returns plusIinfinity.
551620`\spad{plusInfinity()} returns +infinity.
551675`\spad{plus(x, y)} returns \spad{x + y} where \spad{+} is the monoid operation,{} which is assumed commutative.
551728`\spad{plus(x,y)} adds two matrices,{} term by term we note that they must be the same size
551796`\spad{plus(s, e, x)} returns \spad{e * s + x} where \spad{+} is the monoid operation,{} which is assumed commutative.
551850`\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.
552081`\spad{pmintegrate(f, x)} returns either "failed" or \spad{[g,h]} such that \spad{integrate(f,x) = g + integrate(h,x)}.
552305`\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.
552539`\spad{po(q)} creates a value in \spad{P} equal to \spad{q} in \$.
552601`\spad{point?(s)} queries whether the \spadtype{ThreeSpace},{} \spad{s},{} is composed of a single component which is a point and returns the boolean result.
552658`\spad{pointColorDefault()} returns the default color of points in a 2D viewport.
552722`\spad{pointColorDefault(p)} sets the default color of points in a 2D viewport to the palette \spad{p}.
552793`\spad{pointColorPalette(l,p)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{pointColorPalette}. If the option does not exist the value,{} \spad{p} is returned.
552882`\spad{pointColor(v)} specifies a color,{} \spad{v},{} for 2D graph points. This option is expressed in the form \spad{pointColor == v}.
552930`\spad{pointColor(p)} specifies a color index for 2D graph points from the spadcolors palette \spad{p}. This option is expressed in the form \spad{pointColor == p}.
552980`\spad{pointData(s)} returns the list of points from the point data field of the 3 dimensional subspace \spad{s}.
553039`\spad{pointLists(gi)} returns the list of lists of points which compose the given graph,{} \spad{gi},{} of the domain \spadtype{GraphImage}.
553112`\spad{pointPlot(f,g,h,a..b)} plots {/emx = \spad{f}(\spad{t}),{} \spad{y} = \spad{g}(\spad{t}),{} \spad{z} = \spad{h}(\spad{t})} as \spad{t} ranges over {/em[a,{}\spad{b}]}.
553204`\spad{pointPlot(t +-> (f(t),g(t)),a..b)} plots the parametric curve \spad{x = f(t)},{} \spad{y = g(t)} as \spad{t} ranges over the interval \spad{[a,b]}.
553294`\spad{pointPlot(t +-> (f(t),g(t)),a..b,c..d,e..f)} plots the parametric curve \spad{x = f(t)},{} \spad{y = g(t)} as \spad{t} ranges over the interval \spad{[a,b]}; \spad{x}-range of \spad{[c,d]} and \spad{y}-range of \spad{[e,f]} are noted in Plot object.
553426`\spad{pointPlot(f,x,y,z,w)} \undocumented
553581`\spad{pointSizeDefault()} returns the default size of the points in a 2D viewport.
553652`\spad{pointSizeDefault(i)} sets the default size of the points in a 2D viewport to \spad{i}.
553738`\spad{point(l)} returns a point category defined by a list \spad{l} of elements from the domain \spad{R}.
553789`\spad{point(p)} returns a \spadtype{ThreeSpace} object which is composed of one component,{} the point \spad{p}.
553846`\spad{point(s)} checks to see if the \spadtype{ThreeSpace},{} \spad{s},{} is composed of only a single point and if so,{} returns the point. An error is signaled otherwise.
553903`\spad{point(s,[x,y,z])} adds a point component defined by a list of elements which are from the \spad{PointDomain(R)} to the \spadtype{ThreeSpace},{} \spad{s},{} where \spad{R} is the \spadtype{Ring} over which the point elements are defined.
553962`\spad{point(s,i)} adds a point component which is placed into a component list of the \spadtype{ThreeSpace},{} \spad{s},{} at the index given by \spad{i}.
554032`\spad{point(s,p)} adds a point component defined by the point,{} \spad{p},{} specified as a list from \spad{List(R)},{} to the \spadtype{ThreeSpace},{} \spad{s},{} where \spad{R} is the \spadtype{Ring} over which the point is defined.
554092`\spad{point(gi,pt,pal)} modifies the graph \spad{gi} of the domain \spadtype{GraphImage} to contain one point component,{} \spad{pt} whose point color is set to be the palette color \spad{pal},{} and whose line color and point size are determined by the default functions \spadfun{lineColorDefault} and \spadfun{pointSizeDefault}.
554161`\spad{point(x1,x2,x3,c)} creates and returns a point from the three specified coordinates \spad{x1},{} \spad{x2},{} \spad{x3},{} and also a fourth coordinate,{} \spad{c},{} which is generally used to specify the color of the point.
554265`\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".
554343`\spad{poisson(f)} \undocumented
554422`\spad{polCase(contprod, numFacts, evallcs)},{} where \spad{contprod} is the product of the content of the leading coefficient of the polynomial to be factored with the content of the evaluated polynomial,{} \spad{numFacts} is the number of factors of the leadingCoefficient,{} and evallcs is the list of the evaluated factors of the leadingCoefficient,{} returns \spad{true} if the factors of the leading Coeff
554422`--icient can be distributed with this valuation.
554519`\spad{pol(v)} turns the vector \spad{[v0,...,vn]} into the polynomial \spad{v0+v1*x+ ... + vn*x**n}.
554688`\spad{polarCoordinates(x)} returns (\spad{r},{} phi) such that \spad{x} = \spad{r} * exp(\%\spad{i} * phi).
554828`\spad{polar(pt)} transforms \spad{pt} from polar coordinates to Cartesian coordinates: the function produced will map the point \spad{(r,theta)} to \spad{x = r * cos(theta)} ,{} \spad{y = r * sin(theta)}.
554890`\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.}
554948`\spad{pole?(f)} determines if the power series \spad{f} has a pole.
555018`\spad{polyPart(f)} returns the polynomial part of \spad{f}.
555085`\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' + B
555085`--Q = 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.
555252`\spad{polyRicDE(op, zeros)} returns \spad{[[p1, L1], [p2, L2], ... , [pk, Lk]]} such that the polynomial part of any rational solution of the associated Riccati equation of \spad{op y=0} must be one of the \spad{pi}'s (up to the constant coefficient),{} in which case the equation for \spad{z=y e^{-int p}} is \spad{Li z =0}. \spad{zeros} is a zero finder in \spad{UP}.
555351`\spad{polyRicDE(op, zeros)} returns \spad{[[p1, L1], [p2, L2], ... , [pk,Lk]]} such that the polynomial part of any rational solution of the associated Riccati equation of \spad{op y = 0} must be one of the \spad{pi}'s (up to the constant coefficient),{} in which case the equation for \spad{z = y e^{-int p}} is \s
555351`--pad{Li z = 0}. \spad{zeros} is a zero finder in \spad{UP}.
555543`\spad{polygamma(x,y)} returns the polygamma function applied to \spad{x} and \spad{y}
555607`\spad{polygamma(n, x)} is the \spad{n}-th derivative of \spad{digamma(x)}.
555723`\spad{polygamma(n, x)} is the \spad{n}-th derivative of \spad{digamma(x)}.
555821`\spad{polygamma(k,x)} is the \spad{k-th} derivative of \spad{digamma(x)},{} (often written \spad{psi(k,x)} in the literature).
555881`\spad{polygon?(s)} returns \spad{true} if the \spadtype{ThreeSpace} \spad{s} contains a single polygon component,{} or \spad{false} otherwise.
555940`\spad{polygon([p0,p1,...,pn])} creates a polygon defined by a list of points,{} \spad{p0} through pn,{} and returns a \spadtype{ThreeSpace} whose component is the polygon.
556005`\spad{polygon(s)} checks to see if the \spadtype{ThreeSpace},{} \spad{s},{} is composed of a single polygon component defined by a list of points,{} and if so,{} returns the list of points; An error is signaled otherwise.
556070`\spad{polygon(s,[[r0],[r1],...,[rn]])} adds a polygon component defined by a list of points \spad{r0} through \spad{rn},{} which are lists of elements from the domain \spad{PointDomain(m,R)} to the \spadtype{ThreeSpace} \spad{s},{} where \spad{m} is the dimension of the points and \spad{R} is the \spadtype{Ring} over which the points are defined.
556137`\spad{polygon(s,[p0,p1,...,pn])} adds a polygon component defined by a list of points,{} \spad{p0} throught pn,{} to the \spadtype{ThreeSpace} \spad{s}.
556205`\spad{polynomialZeros(fn,var,range)} calculates the real zeros of the polynomial which are contained in the given interval. It returns a list of points (\axiomType{Doublefloat}) for which the univariate polynomial \spad{fn} is zero.
556363`\spad{polynomial(f,k)} returns a polynomial consisting of the sum of all terms of \spad{f} of degree \spad{<= k}.
556473`\spad{polynomial(f,k)} returns a polynomial consisting of the sum of all terms of \spad{f} of degree \spad{<= k}.
556577`\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}.
556706`\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}.
556829`\spad{polyred(u)} \undocumented
556960`\spad{pomopo!(p1,r,e,p2)} returns \spad{p1 + monomial(e,r) * p2} and may use \spad{p1} as workspace. The constaant \spad{r} is assumed to be nonzero.
557027`\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.
557072`\spad{popFortranOutputStack()} pops the Fortran output stack
557143`\spad{port(n)} constructs a PortNumber from the integer `n'.
557193`position(\spad{f},{}\spad{p}) sets the current byte-position to `i'.
557267`\spad{position(x)} returns the integer \spad{n} associated to \spad{x}.
557327`\spad{position(f)} returns the current byte-position in the file `f'.
557783`\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}.
557858`\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}.
558146`\spad{position(cc,t,i)} returns the position \axiom{\spad{j} >= \spad{i}} in \spad{t} of the first character belonging to \spad{cc}.
558222`\spad{position(x,a,n)} returns the index \spad{i} of the first occurrence of \spad{x} in \axiom{a} where \axiom{\spad{i} >= \spad{n}},{} and \axiom{minIndex(a) - 1} if no such \spad{x} is found.
558312`\spad{position(s,t,i)} returns the position \spad{j} of the substring \spad{s} in string \spad{t},{} where \axiom{\spad{j} >= \spad{i}} is required.
558433`\spad{positive?(u)} returns \axiom{\spad{true}} if every element of \spad{u} is positive,{} \axiom{\spad{false}} otherwise.
558491`\spad{positive?(x)} holds when \spad{x} is greater than \spad{0}.
558644`\axiom{positive?(pol,{}aRoot)} answers if \axiom{pol} interpreted as \axiom{aRoot} is positive
558741`\spad{positiveRemainder(a,b)} (where \spad{b > 1}) yields \spad{r} where \spad{0 <= r < b} and \spad{r == a rem b}.
558805`\spad{positiveSolve(lp)} returns the same as \spad{positiveSolve(lp,false,false)}.
558931`\spad{positiveSolve(ts)} returns the points of the regular set of \spad{ts} with (real) strictly positive coordinates.
559056`\spad{positiveSolve(lp)} returns the same as \spad{positiveSolve(lp,info?,false)}.
559190`\spad{positiveSolve(lp,info?,lextri?)} returns the set of the points in the variety associated with \spad{lp} whose coordinates are (real) strictly positive. Moreover,{} if \spad{info?} is \spad{true} then some information is displayed during decomposition into regular chains. If \spad{lextri?} is \spad{true} then the lexTriangular algorithm is called from the \s
559190`--padtype{LexTriangularPackage} constructor (see \axiomOpFrom{zeroSetSplit}{LexTriangularPackage}(\spad{lp},{}\spad{false})). Otherwise,{} the triangular decomposition is computed directly from the input system by using the \axiomOpFrom{zeroSetSplit}{RegularChain} from \spadtype{RegularChain}. WARNING: For each set of coordinates given by \spad{positiveSolve(lp,info?,lextri?)} the ordering of the indeterminates is reversed \spad{w}.\spad{r}.\spad{t}. \spad{ls}.
559460`\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})}.
559525`\axiom{possiblyNewVariety?(newlp,{}llp)} returns \spad{true} iff for every \axiom{lp} in \axiom{llp} certainlySubVariety?(newlp,{}lp) does not hold.
559631`\spad{postfix(op, a)} creates a form which prints as: a \spad{op}.
559676`\spad{pow()} \undocumented
559733`\spad{power!(a,b,c,m,n)} computes \spad{m} ** \spad{n} and stores the result in \spad{a}. The matrices \spad{b} and \spad{c} are used to store intermediate results. Error: if \spad{a},{} \spad{b},{} \spad{c},{} and \spad{m} are not square and of the same dimensions.
559862`\spad{powerAssociative?()} tests if all subalgebras generated by a single element are associative.
559941`\spad{powerSum n} is the \spad{n} th power sum symmetric \indented{1}{function.}
560038`\spad{power(a,f)} returns the power series \spad{f} raised to the power \spad{a}.
560127`\spad{powern(r,f)} raises power series \spad{f} to the power \spad{r}.
560254`\spad{powers(x)} returns a list of pairs. The second component of each pair is the multiplicity with which the first component occurs in \spad{li}.
560386`\spad{powmod(a,b,p)},{} \spad{0<=a,b<p>1},{} means \spad{a**b mod p}.
560503`\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}}.
560632`\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}}.
560700`\spad{pr2dmp(p)} converts \spad{p} to target domain
560783`\spad{precision()} returns the precision in digits base.
560847`\spad{precision()} returns the number of digits in the model
560904`\spad{precision(n)} set the precision in the base to \spad{n} decimal digits.
561020`\spad{precision(p)} sets the number of digits in the model to \spad{p}
561092`\spad{predicate(p)} returns the predicate attached to \spad{p},{} the constant function \spad{true} if \spad{p} has no predicates attached to it.
561166`\spad{predicate(e)} returns the syntax object for the predicate in the filter iterator syntax `e'.
561216`\spad{predicates(p)} returns \spad{[p1,...,pn]} such that the predicate attached to \spad{p} is \spad{p1} and ... and pn.
561320`\spad{prefix?(s,t)} tests if the string \spad{s} is the initial substring of \spad{t}. Note: \axiom{prefix?(\spad{s},{}\spad{t}) == reduce(and,{}[\spad{s}.\spad{i} = \spad{t}.\spad{i} for \spad{i} in 0..maxIndex \spad{s}])}.
561375`\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]}.
561441`\spad{prefix(f,l)} creates a form depicting the \spad{n}-ary prefix application of \spad{f} to a tuple of arguments given by list \spad{l}.
561552`\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}}.
561681`\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}}.
561749`\axiom{prepareDecompose(lp,{}lts,{}\spad{b1},{}\spad{b2})} is an internal subroutine,{} exported only for developement.
561897`\axiom{prepareDecompose(lp,{}lts,{}\spad{b1},{}\spad{b2})} is an internal subroutine,{} exported only for developement.
562055`\axiom{prepareSubResAlgo(\spad{p1},{}\spad{p2},{}ts)} is an internal subroutine,{} exported only for developement.
562175`\axiom{pre_process(lp,{}\spad{b1},{}\spad{b2})} is an internal subroutine,{} exported only for developement.
562293`\axiom{pre_process(lp,{}\spad{b1},{}\spad{b2})} is an internal subroutine,{} exported only for developement.
562421`\spad{presub(f,n)} creates a form for \spad{f} presubscripted by \spad{n}.
562465`\spad{presuper(f,n)} creates a form for \spad{f} presuperscripted by \spad{n}.
562511`\spad{prevPrime(n)} returns the largest prime strictly smaller than \spad{n}
562566`\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}}.
562704`\axiom{primPartElseUnitCanonical!(\spad{p})} replaces \axiom{\spad{p}} by \axiom{primPartElseUnitCanonical(\spad{p})}.
562890`\axiom{primPartElseUnitCanonical(\spad{p})} returns \axiom{primitivePart(\spad{p})} if \axiom{\spad{R}} is a gcd-domain,{} otherwise \axiom{unitCanonical(\spad{p})}.
562995`\spad{primaryDecomp(I)} returns a list of primary ideals such that their intersection is the ideal \spad{I}.
563522`\spad{prime?(zi)} tests if the complex integer \spad{zi} is prime.
563600`\spad{prime?(n)} returns \spad{true} if \spad{n} is prime and \spad{false} if not. The algorithm used is Rabin's probabilistic primality test (reference: Knuth Volume 2 Semi Numerical Algorithms). If \spad{prime? n} returns \spad{false},{} \spad{n} is proven composite. If \spad{prime? n} returns \spad{true},{} prime? may be in error however,{} the probability of error is very low. and is zero below 25*10**9 (due to a result of Pomerance et al),{
563600`--} below 10**12 and 10**13 due to results of Pinch,{} and below 341550071728321 due to a result of Jaeschke. Specifically,{} this implementation does at least 10 pseudo prime tests and so the probability of error is \spad{< 4**(-10)}. The running time of this method is cubic in the length of the input \spad{n},{} that is \spad{O( (log n)**3 )},{} for \spad{n<10**20}. beyond that,{} the algorithm is quartic,{} \spad{O( (log n)**4 )}. Two improvements due to Davenport have been incorporated which
563600`-- catches some trivial strong pseudo-primes,{} such as [Jaeschke,{} 1991] 1377161253229053 * 413148375987157,{} which the original algorithm regards as prime
563658`\spad{prime?(I)} tests if the ideal \spad{I} is prime.
563876`\spad{prime?(x)} tests if \spad{x} can never be written as the product of two non-units of the ring,{} \spadignore{i.e.} \spad{x} is an irreducible element.
563937`\spad{primeFactor(base,exponent)} creates a factored object with a single factor whose \spad{base} is asserted to be prime (flag = "prime").
564053`\spad{primeFrobenius(a)} returns \spad{a ** p} where \spad{p} is the characteristic.
564199`\spad{primeFrobenius(a,s)} returns \spad{a**(p**s)} where \spad{p} is the characteristic.
564283`\spad{prime(f)} creates the form \spad{f} followed by a suffix prime (single quote).
564323`\spad{prime(f,n)} creates the form \spad{f} followed by \spad{n} primes.
564382`\spad{primes(a,b)} returns a list of all primes \spad{p} with \spad{a <= p <= b}
564442`\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. Arg
564442`--ument \spad{foo} is an extended integration function on \spad{F}.
564686`\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.
564849`\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}.
565033`\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.
565225`\spad{primitive?(f)} tests whether the polynomial \spad{f} over a finite field is primitive,{} \spadignore{i.e.} all its roots are primitive.
565325`\spad{primitive?(b)} tests whether the element \spad{b} is a generator of the (cyclic) multiplicative group of the field,{} \spadignore{i.e.} is a primitive element. Implementation Note: see ch.IX.1.3,{} th.2 in \spad{D}. Lipson.
565384`\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}.
565442`\spad{primitiveElement([a1,...,an])} returns \spad{[a, [q1,...,qn], q]} such that then \spad{k(a1,...,an) = k(a)},{} \spad{ai = qi(a)},{} and \spad{q(a) = 0}. This operation uses the technique of \spadglossSee{groebner bases}{Groebner basis}.
565613`\spad{primitiveElement([p1,...,pn], [a1,...,an])} returns \spad{[[c1,...,cn], [q1,...,qn], q]} such that then \spad{k(a1,...,an) = k(a)},{} where \spad{a = a1 c1 + ... + an cn},{} \spad{ai = qi(a)},{} and \spad{q(a) = 0}. The \spad{pi}'s are the defining polynomials for the \spad{ai}'s. This operation uses the techn
565613`--ique of \spadglossSee{groebner bases}{Groebner basis}.
565803`\spad{primitiveElement(a1, a2)} returns \spad{[a, q1, q2, q]} such that \spad{k(a1, a2) = k(a)},{} \spad{ai = qi(a)},{} and \spad{q(a) = 0}. The minimal polynomial for \spad{a2} may involve \spad{a1},{} but the minimal polynomial for \spad{a1} may not involve \spad{a2}; This oper
565803`--ations uses \spadfun{resultant}.
566030`\spad{primitiveElement([p1,...,pn], [a1,...,an], a)} returns \spad{[[c1,...,cn], [q1,...,qn], q]} such that then \spad{k(a1,...,an) = k(a)},{} where \spad{a = a1 c1 + ... + an cn},{} \spad{ai = qi(a)},{} and \spad{q(a) = 0}. The \spad{pi}'s are the defining polynomials for the \spad{ai}'s. This operation uses
566030`-- the technique of \spadglossSee{groebner bases}{Groebner basis}.
566227`\spad{primitiveElement(p1, a1, p2, a2)} returns \spad{[c1, c2, q]} such that \spad{k(a1, a2) = k(a)} where \spad{a = c1 a1 + c2 a2, and q(a) = 0}. The \spad{pi}'s are the defining polynomials for the \spad{ai}'s. The \spad{p2} may involve \spad{a1},{} but \spad{p1} must not involve \spad{a2}. This operation uses \spadfun{resultant}.
566469`\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)]}.
566617`\axiom{primitivePart!(\spad{p})} replaces \axiom{\spad{p}} by its primitive part.
566967`\spad{primitivePart(p)} returns the unit normalized form of polynomial \spad{p} divided by the content of \spad{p}.
567049`\spad{primitivePart(f)} removes the content of the denominator and the common content of the numerator of \spad{f}.
567119`\spad{primitivePart(p)} returns the unitCanonical associate of the polynomial \spad{p} with its content divided out.
567203`\spad{primitivePart(l)} returns \spad{l0} such that \spad{l = a * l0} for some a in \spad{R},{} and \spad{content(l0) = 1}.
567363`\spad{primitivePart(p, q)} reduces the coefficient of \spad{p} modulo \spad{q},{} takes the primitive part of the result,{} and ensures that the leading coefficient of that result is monic.
567450`\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.
567541`\spad{primlimintfrac(f, ', [u1,...,un])} returns \spad{[v, [c1,...,cn]]} such that \spad{ci' = 0} and \spad{f = v' + +/[ci * ui'/ui]}. Error: if \spad{degree numer f >= degree denom f}.
567757`\spad{primlimitedint(f, ', foo, [u1,...,un])} returns \spad{[v, [c1,...,cn], a]} such that \spad{ci' = 0},{} \spad{f = v' + a + reduce(+,[ci * ui'/ui])},{} and \spad{a = 0} or \spad{a} has no integral in UP. Returns "failed"
567757`-- if no such \spad{v},{} \spad{ci},{} a exist. Argument \spad{foo} is an extended integration function on \spad{F}.
568040`\spad{prinb }\undocumented
568194`\spad{principal?(D)} tests if the argument is the divisor of a function.
568268`\spad{principalAncestors(c)} returns the list of all category forms that are principal ancestors of the the category `c'.
568447`\spad{principalIdeal([f1,...,fn])} returns a record whose generator component is a generator of the ideal generated by \spad{[f1,...,fn]} whose coef component satisfies \spad{generator = sum (input.i * coef.i)}
568544`\spad{prindINFO }\undocumented
568727`\spad{prinpolINFO }\undocumented
568819`\spad{prinshINFO }\undocumented
568904`\spad{printCode(f)} prints out \spad{f} in FORTRAN notation.
568951`\spad{printHeader()} produces the FORTRAN header for the current subprogram in the global symbol table on the current FORTRAN output stream.
569001`\spad{printHeader(f)} produces the FORTRAN header for subprogram \spad{f} in the global symbol table on the current FORTRAN output stream.
569057`\spad{printHeader(f,tab)} produces the FORTRAN header for subprogram \spad{f} in symbol table \spad{tab} on the current FORTRAN output stream.
569116`\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.
569460`\spad{printStatement(l)} creates a representation of a PRINT statement.
569524`\axiom{printStats!()} prints the statistics.
569598`\spad{printTypes(tab)} produces FORTRAN type declarations from \spad{tab},{} on the current FORTRAN output stream
569653`\spad{printTypes(tab)} produces FORTRAN type declarations from \spad{tab},{} on the current FORTRAN output stream
569701`\spad{print(u)} prints the form \spad{u}.
569743`\spad{print(o)} writes the output form \spad{o} on standard output using the two-dimensional formatter.
569795`\axiom{printingInfo?()} returns \spad{true} iff messages are printed when manipulating items from the hash-table.
569874`\axiom{probablyZeroDim?(lp)} returns \spad{true} iff the number of polynomials in \axiom{lp} is not smaller than the number of variables occurring in these polynomials.
569963`\spad{problemPoints(f,var,range)} returns a list of possible problem points by looking at the zeros of the denominator of the function \spad{f} if it can be retracted to \axiomType{Polynomial(DoubleFloat)}.
570113`\spad{problemPoints(f,var,range)} returns a list of possible problem points by looking at the zeros of the denominator of the function if it can be retracted to \axiomType{Polynomial DoubleFloat}.
570250`\spad{processTemplate(tp)} processes the template \spad{tp},{} writing the result to the current FORTRAN output stream.
570317`\spad{processTemplate(tp,fn)} processes the template \spad{tp},{} writing the result out to \spad{fn}.
570393`\spad{prod(expr)} creates the form prefixing \spad{expr} by a capital \spad{pi}.
570432`\spad{prod(expr,lowerlimit)} creates the form prefixing \spad{expr} by a capital \spad{pi} with a \spad{lowerlimit}.
570474`\spad{prod(expr,lowerlimit,upperlimit)} creates the form prefixing \spad{expr} by a capital \spad{pi} with both a \spad{lowerlimit} and \spad{upperlimit}.
570519`\spad{product(f(n), n = a..b)} returns \spad{f}(a) * ... * \spad{f}(\spad{b}) as a formal product.
570593`\spad{product(f(n), n)} returns the formal product \spad{P}(\spad{n}) which verifies \spad{P}(\spad{n+1})/P(\spad{n}) = \spad{f}(\spad{n}).
570656`\spad{product(f(n), n = a..b)} returns \spad{f}(a) * ... * \spad{f}(\spad{b}) as a formal product.
570731`\spad{product(f(n), n)} returns the formal product \spad{P}(\spad{n}) which verifies \spad{P}(\spad{n+1})/P(\spad{n}) = \spad{f}(\spad{n}).
570794`\spad{product(a,b)} is the degree-preserving \spad{R}-linear product: \blankline \indented{2}{\spad{degree product(a,b) = degree a + degree b}} \indented{2}{\spad{product(a1+a2,b) = product(a1,b) + product(a2,b)}} \indented{2}{\spad{product(a,b1+b2) = product(a,b1) + product(a,b2)}} \indented{2}{\spad{product(r*a,b) = product(a,r*b) = r*product(a,b)}} \indented{2}{\spad{product(a,product(b,c)) = product(product(a,b),c)}}
570847`\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)}.}
570910`\axiom{product(a,{}\spad{b},{}\spad{n})} returns \axiom{a*b} (truncated up to order \axiom{\spad{n}}).
570988`\spad{prolateSpheroidal(a)} transforms from prolate spheroidal coordinates to Cartesian coordinates: \spad{prolateSpheroidal(a)} is a function which will map the point \spad{(xi,eta,phi)} to \spad{x = a*sinh(xi)*sin(eta)*cos(phi)},{} \spad{y = a*sinh(xi)*sin(eta)*sin(phi)},{} \spad{z = a*cosh(xi)*cos(eta)}.
571067`\spad{prologue(t)} extracts the prologue section of a TeX form \spad{t}.
571119`\spad{properties(op)} returns the list of all the properties currently attached to \spad{op}.
571193`\spad{properties(b)} returns the properties associated with binding \spad{b}.
571247`\spad{property(n,val)} constructs a property with name `n' and value `val'.
571308`\spad{property(op, p)} returns the value of property \spad{p} if it is attached to \spad{op},{} otherwise \spad{nothing}.
571374`\spad{property(op, s)} returns the value of property \spad{s} if it is attached to \spad{op},{} and "failed" otherwise.
571645`\axiom{pseudoDivide(\spad{P},{}\spad{Q})} computes the pseudoDivide of \axiom{\spad{P}} by \axiom{\spad{Q}}.
571761`\spad{pseudoDivide(p,q)} returns \spad{[c, q, r]},{} when \spad{p' := p*lc(q)**(deg p - deg q + 1) = c * p} is pseudo right-divided by \spad{q},{} \spadignore{i.e.} \spad{p' = s q + r}.
571890`\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.
572062`\spad{pseudoQuotient(p,q)} returns \spad{r},{} the quotient when \spad{p' := p*lc(q)**(deg p - deg q + 1)} is pseudo right-divided by \spad{q},{} \spadignore{i.e.} \spad{p' = s q + r}.
572156`\spad{pseudoRemainder(p,q)} = \spad{r},{} for polynomials \spad{p} and \spad{q},{} returns the remainder when \spad{p' := p*lc(q)**(deg p - deg q + 1)} is pseudo right-divided by \spad{q},{} \spadignore{i.e.} \spad{p' = s q + r}.
572230`\spad{psolve(c)} solves the homogeneous linear system \spad{c} \spad{z} = 0 for all possible ranks of the matrix \spad{c}
572476`\spad{psolve(c,w)} solves \spad{c} \spad{z} = \spad{w} for all possible ranks of the matrix \spad{c} and given right hand side vector \spad{w}
572731`\spad{psolve(c,w)} solves \spad{c} \spad{z} = \spad{w} for all possible ranks of the matrix \spad{c} and indeterminate right hand side \spad{w}
572990`\spad{psolve(c)} solves the homogeneous linear system \spad{c} \spad{z} = 0 for all possible ranks >= \spad{k} of the matrix \spad{c}
573252`\spad{psolve(c,s)} solves \spad{c} \spad{z} = 0 for all possible ranks of the matrix \spad{c} and given right hand side vector \spad{w},{} writes the results to a file named \spad{s},{} and returns the number of regimes
573344`\spad{psolve(c,w,k)} solves \spad{c} \spad{z} = \spad{w} for all possible ranks >= \spad{k} of the matrix \spad{c} and given right hand side vector \spad{w}
573615`\spad{psolve(c,w,s)} solves \spad{c} \spad{z} = \spad{w} for all possible ranks of the matrix \spad{c} and given right hand side vector \spad{w},{} writes the results to a file named \spad{s},{} and returns the number of regimes
573716`\spad{psolve(c,w,k)} solves \spad{c} \spad{z} = \spad{w} for all possible ranks >= \spad{k} of the matrix \spad{c} and indeterminate right hand side \spad{w}
573991`\spad{psolve(c,w,s)} solves \spad{c} \spad{z} = \spad{w} for all possible ranks of the matrix \spad{c} and indeterminate right hand side \spad{w},{} writes the results to a file named \spad{s},{} and returns the number of regimes
574096`\spad{psolve(c,k,s)} solves \spad{c} \spad{z} = 0 for all possible ranks >= \spad{k} of the matrix \spad{c},{} writes the results to a file named \spad{s},{} and returns the number of regimes
574204`\spad{psolve(c,w,k,s)} solves \spad{c} \spad{z} = \spad{w} for all possible ranks >= \spad{k} of the matrix \spad{c} and given right hand side \spad{w},{} writes the results to a file named \spad{s},{} and returns the number of regimes
574321`\spad{psolve(c,w,k,s)} solves \spad{c} \spad{z} = \spad{w} for all possible ranks >= \spad{k} of the matrix \spad{c} and indeterminate right hand side \spad{w},{} writes the results to a file named \spad{s},{} and returns the number of regimes
574442`\spad{ptFunc(a,b,c,d)} is an internal function exported in order to compile packages.
574719`\spad{ptree(s)} is a leaf? pendant tree
574762`\spad{ptree(x,y)} \undocumented
574809`\spad{puiseux(f)} returns a Puiseux expansion of the expression \spad{f}. Note: \spad{f} should have only one variable; the series will be expanded in powers of that variable.
574881`\spad{puiseux(x)} returns \spad{x} viewed as a Puiseux series.
574957`\spad{puiseux(f,x = a)} expands the expression \spad{f} as a Puiseux series in powers of \spad{(x - a)}.
575042`\spad{puiseux(f,n)} returns a Puiseux expansion of the expression \spad{f}. Note: \spad{f} should have only one variable; the series will be expanded in powers of that variable and terms will be computed up to order at least \spad{n}.
575132`\spad{puiseux(r,f(x))} returns \spad{f(x^r)}.
575235`\spad{puiseux(f,x = a,n)} expands the expression \spad{f} as a Puiseux series in powers of \spad{(x - a)}; terms will be computed up to order at least \spad{n}.
575338`\spad{puiseux(n +-> a(n),x = a,r0..,r)} returns \spad{sum(n = r0,r0 + r,r0 + 2*r..., a(n) * (x - a)**n)}; \spad{puiseux(n +-> a(n),x = a,r0..r1,r)} returns \spad{sum(n = r0 + k*r while n <= r1, a(n) * (x - a)**n)}.
575494`\spad{puiseux(a(n),n,x = a,r0..,r)} returns \spad{sum(n = r0,r0 + r,r0 + 2*r..., a(n) * (x - a)**n)}; \spad{puiseux(a(n),n,x = a,r0..r1,r)} returns \spad{sum(n = r0 + k*r while n <= r1, a(n) * (x - a)**n)}.
575636`\spad{pureLex(v1,v2)} return \spad{true} if the vector \spad{v1} is less than the vector \spad{v2} in the lexicographic ordering.
575794`\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}).
575959`\spad{purelyAlgebraic?(p,ts)} returns \spad{true} iff every variable of \spad{p} is algebraic \spad{w}.\spad{r}.\spad{t}. \spad{ts}.
576141`\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}.
576328`\spad{purelyTranscendental?(p,ts)} returns \spad{true} iff every variable of \spad{p} is not algebraic \spad{w}.\spad{r}.\spad{t}. \spad{ts}
576418`\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}.
576466`\spad{pushFortranOutputStack(f)} pushes \spad{f} onto the Fortran output stack
576546`\spad{pushFortranOutputStack(f)} pushes \spad{f} onto the Fortran output stack
576624`\spad{pushNewContour(b,s)} pushs a new contour with sole binding `b'.
576676`\spad{push(c,b)} augments the contour with binding `b'.
576720`\spad{pushdown(p,lv)} \undocumented{}
576789`\spad{pushdown(p,v)} \undocumented{}
576852`\spad{pushdown(prf,var)} pushes all top level occurences of the variable \spad{var} into the coefficient domain for the polynomial \spad{prf}.
576936`\spad{pushdterm(monom,var)} pushes all top level occurences of the variable \spad{var} into the coefficient domain for the monomial \spad{monom}.
577049`\spad{pushucoef(upoly,var)} converts the anonymous univariate polynomial \spad{upoly} to a polynomial in \spad{var} over rational functions.
577172`\spad{pushuconst(r,var)} takes a rational function and raises all occurances of the variable \spad{var} to the polynomial level.
577278`\spad{pushup(p,lv)} \undocumented{}
577345`\spad{pushup(p,v)} \undocumented{}
577406`\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.
577488`\spad{putColorInfo(llp,lpal)} takes a list of list of points,{} \spad{llp},{} and returns the points with their hue and shade components set according to the list of palette colors,{} \spad{lpal}.
577605`\spad{putGraph(v,gi,n)} sets the graph field indicated by \spad{n},{} of the indicated two-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{TwoDimensionalViewport},{} to be the graph,{} \spad{gi} of domain \spadtype{GraphImage}. The contents of viewport,{} \spad{v},{} will contain \spad{gi} when the function \spadfun{makeViewport2D} is called to create the an updated viewport \spad{v}.
577689`\spad{putProperties(n,props,e)} set the list of properties of \spad{n} to \spad{props} in \spad{e}.
577764`\spad{putProperty(n,p,v,e)} binds the property \spad{(p,v)} to \spad{n} in the topmost scope of \spad{e}.
577845`\spad{qPot(v,e)} computes \spad{v**(q**e)},{} interpreting \spad{v} as an element of normal basis field,{} \spad{q} the size of the ground field. This is done by a cyclic \spad{e}-shift of the vector \spad{v}.
577986`\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}.
578043`elt(\spad{b},{}\spad{i}) returns the \spad{i}th element in buffer `b'. Indexing is 0-based.
578104`\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.
578188`\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
578270`\spad{qfactor(p)} tries to factor \spad{p} over fractions of integers,{} returning "failed" if it cannot
578418`\spad{qinterval(inf,sup)} creates a new interval \axiom{[\spad{inf},{}\spad{sup}]},{} without checking the ordering on the elements.
578472`\spad{qqq(n,s,st)} is used internally.
578629`\spad{qroot(f, n)} returns \spad{[m,c,r]} such that \spad{f**(1/n) = c * r**(1/m)}.
578831`\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}.
578930`\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
579018`setelt(\spad{b},{}\spad{i},{}\spad{x}) sets the \spad{i}th entry of data buffer `b' to `x'. Indexing is 0-based.
579084`\spad{quadratic?(e)} tests if \axiom{\spad{e}} is a quadratic function.
579161`\spad{quadraticForm(m)} creates a quadratic form from a symmetric,{} square matrix \spad{m}.
579232`\spad{quadraticNorm(f)} returns the \spad{l2} norm of the polynomial \spad{f}.
579310`\spad{quadratic(u)} \undocumented
579380`\spad{quadratic(f,g,h)} \undocumented
579453`\spad{qualifier(e)} returns the qualifier of the expression `e'.
579500`\spad{quartic(u)} \undocumented
579568`\spad{quartic(f,g,h,i,j)} \undocumented
579643`\spad{quasiAlgebraicSet(pl,q)} returns the quasi-algebraic set with defining equations \spad{p} = 0 for \spad{p} belonging to the list \spad{pl},{} and defining inequation \spad{q} ~= 0.
579834`\axiom{quasiComponent(ts)} returns \axiom{[lp,{}lq]} where \axiom{lp} is the list of the members of \axiom{ts} and \axiom{lq}is \axiom{initials(ts)}.
580007`\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}}.
580082`\axiom{quasiMonicPolynomials(lp)} returns \axiom{qmps,{}nqmps} where \axiom{qmps} is a list of the quasi-monic polynomials in \axiom{lp} and \axiom{nqmps} are the other ones.
580209`\spad{quasiRegular?(x)} return \spad{true} if \spad{constant(p)} is zero.
580272`\spad{quasiRegular?(x)} return \spad{true} if \spad{constant(x)} is zero.
580333`\spad{quasiRegular(x)} return \spad{x} minus its constant term.
580390`\spad{quasiRegular(x)} return \spad{x} minus its constant term.
580445`\spad{quatern(r,i,j,k)} constructs a quaternion from scalars.
580503`\spad{queue([x,y,...,z])} creates a queue with first (top) element \spad{x},{} second element \spad{y},{}...,{}and last (bottom) element \spad{z}.
580546`\spad{quickSort(f, agg)} sorts the aggregate agg with the ordering function \spad{f} using the quicksort algorithm.
580623`\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.
580778`\spad{f quo g} creates the equivalent infix form.
580819`\spad{x quo y} is the same as \spad{divide(x,y).quotient}. See \spadfunFrom{divide}{EuclideanDomain}.
580865`\spad{a quo b} returns the quotient of \spad{a} and \spad{b},{} forgetting the remainder.
580914`\spad{quote} provides the string quote character,{} \spad{"}.
580951`\spad{quote(f)} creates the form \spad{f} with a prefix quote.
580991`\spad{quoted?(p)} tests if \spad{p} is of the form 's for a symbol \spad{s}.
581038`\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.
581109`\spad{quotientByP(x)} returns \spad{b},{} where \spad{x = a + b p}.
581168`\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))}.
581245`\spad{quotient(I,J)} computes the quotient of the ideals \spad{I} and \spad{J},{} \spad{(I:J)}.
581319`\spad{rCoord(pt)} returns the first element of the point,{} \spad{pt},{} although no assumptions are made as to the coordinate system being used. This function is defined for the convenience of the user dealing with a spherical or a cylindrical coordinate system.
581370`\spad{radPoly(p(x, y))} returns \spad{[c(x), n]} if \spad{p} is of the form \spad{y**n - c(x)},{} "failed" otherwise.
581497`\spad{radicalEigenvalues(m)} computes the eigenvalues of the matrix \spad{m}; when possible,{} the eigenvalues are expressed in terms of radicals.
581617`\spad{radicalEigenvector(c,m)} computes the eigenvector(\spad{s}) of the matrix \spad{m} corresponding to the eigenvalue \spad{c}; when possible,{} values are expressed in terms of radicals.
581765`\spad{radicalEigenvectors(m)} computes the eigenvalues and the corresponding eigenvectors of the matrix \spad{m}; when possible,{} values are expressed in terms of radicals.
581959`\spad{radicalOfLeftTraceForm()} returns basis for null space of \spad{leftTraceMatrix()},{} if the algebra is associative,{} alternative or a Jordan algebra,{} then this space equals the radical (maximal nil ideal) of the algebra.
582028`\spad{radicalRoots(rf,x)} finds the roots expressed in terms of radicals of the rational function \spad{rf} with respect to the symbol \spad{x}.
582132`\spad{radicalRoots(lrf,lvar)} finds the roots expressed in terms of radicals of the list of rational functions \spad{lrf} with respect to the list of symbols \spad{lvar}.
582254`\spad{radicalSimplify(s)} returns a different and presumably simpler representation of \spad{s} with the defining polynomials for the equati
582254`--ons forming a groebner basis,{} and the defining polynomial for the inequation reduced with respect to the basis,{} using using groebner basis of radical ideals
582621`\spad{radicalSolve(eq)} finds the solutions expressed in terms of radicals of the equation of rational functions \spad{eq} with respect to the unique symbol \spad{x} appearing in \spad{eq}.
582738`\spad{radicalSolve(rf)} finds the solutions expressed in terms of radicals of the equation \spad{rf} = 0,{} where \spad{rf} is a univariate rational function.
582845`\spad{radicalSolve(leq)} finds the solutions expressed in terms of radicals of the system of equations of rational functions \spad{leq} with respect to the unique symbol \spad{x} appearing in \spad{leq}.
582974`\spad{radicalSolve(lrf)} finds the solutions expressed in terms of radicals of the system of equations \spad{lrf} = 0,{} where \spad{lrf} is a system of univariate rational functions.
583093`\spad{radicalSolve(eq,x)} finds the solutions expressed in terms of radicals of the equation of rational functions \spad{eq} with respect to the symbol \spad{x}.
583217`\spad{radicalSolve(rf,x)} finds the solutions expressed in terms of radicals of the equation \spad{rf} = 0 with respect to the symbol \spad{x},{} where \spad{rf} is a rational function.
583331`\spad{radicalSolve(leq,lvar)} finds the solutions expressed in terms of radicals of the system of equations of rational functions \spad{leq} with respect to the list of symbols \spad{lvar}.
583473`\spad{radicalSolve(lrf,lvar)} finds the solutions expressed in terms of radicals of the system of equations \spad{lrf} = 0 with respect to the list of symbols \spad{lvar},{} where \spad{lrf} is a list of rational functions.
583605`\spad{radical(I)} returns the radical of the ideal \spad{I}.
583969`\spad{radix(x,b)} converts \spad{x} to a radix expansion in base \spad{b}.
584037`\spad{raisePolynomial(rpoly)} converts \spad{rpoly} from a univariate polynomial over \spad{r} to be a univariate polynomial with polynomial coefficients.
584159`\spad{ramified?(a)} tests whether \spad{x = a} is ramified.
584229`\spad{ramified?(p)} tests whether \spad{p(x) = 0} is ramified.
584300`\spad{ramifiedAtInfinity?()} tests if infinity is ramified.
584379`\spad{ran(k)} computes a random integer between -k and \spad{k} as a member of \spad{R}.
584439`\spad{randnum()} is a random number between 0 and size().
584492`\spad{randnum(n)} is a random number between 0 and \spad{n}.
584552`\spad{randomLC(n,x)} should be local but conditional.
584635`\spad{randomR()} should be local but conditional
584701`\spad{randomR produces} a random element of \spad{R}
584778`\spad{randomR()} produces a random element of \spad{R}
585001`\spad{random()} returns a random element from the set.
585036`\spad{random()} creates a random element.
585084`\spad{random()} returns a random fraction.
585163`\spad{random(n)}\$FFPOLY(GF) generates a random monic polynomial of degree \spad{n} over the finite field {\em GF}.
585267`\spad{random(n)} creates a vector over the ground field with random entries.
585353`\spad{random(gp)} returns a random product of maximal 20 generators of the group {\em gp}. Note: {\em random(gp)=random(gp,20)}.
585415`\spad{random(a)} creates a random element from 0 to \spad{a-1}.
585465`\spad{random(n)} returns a random integer from 0 to \spad{n-1}.
585514`\spad{random(m,n)}\$FFPOLY(GF) generates a random monic polynomial of degree \spad{d} over the finite field {\em GF},{} \spad{d} between \spad{m} and \spad{n}.
585634`\spad{random(gp,i)} returns a random product of maximal \spad{i} generators of the group {\em gp}.
585704`\spad{rangeIsFinite(args)} tests the endpoints of \spad{args.range} for infinite end points.
586105`\spad{rangePascalTriangle()} returns the maximal number of lines stored.
586186`\spad{rangePascalTriangle(n)} sets the maximal number of lines which are stored and returns the previous value.
586285`\spad{range([l])} provides a user-specified range \spad{l}. This option is expressed in the form \spad{range == [l]}.
586343`\spad{range([i])} provides a user-specified range \spad{i}. This option is expressed in the form \spad{range == [i]}.
586413`\spad{ranges(gi)} returns the list of ranges of the point components from the indicated graph,{} \spad{gi},{} of the domain \spadtype{GraphImage}.
586472`\spad{ranges(l)} provides a list of user-specified ranges \spad{l}. This option is expressed in the form \spad{ranges == l}.
586531`\spad{ranges(l,r)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{ranges}. If the option does not exist the value,{} \spad{r} is returned.
586635`\spad{ranges(gi,lr)} modifies the list of ranges for the given graph,{} \spad{gi} of the domain \spadtype{GraphImage},{} to be that of the list of range segments,{} \spad{lr},{} and returns the new range list for \spad{gi}.
586771`\spad{rank()} returns the rank of the algebra.
586834`\spad{rank()} returns the rank of the algebra as \spad{R}-module.
586908`\spad{rank(m)} returns the rank of the matrix \spad{m}.
586998`\spad{rank(m)} returns the rank of the matrix \spad{m}.
587104`\spad{rank(m)} returns the rank of the matrix \spad{m}.
587195`\spad{rank(m)} returns the rank of the matrix \spad{m}.
587301`\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.
587374`\spad{rank(A,B)} computes the rank of the complete matrix \spad{(A|B)} of the linear system \spad{AX = B}.
587460`\spad{rank(A,B)} computes the rank of the complete matrix \spad{(A|B)} of the linear system \spad{AX = B}.
587551`\spad{rarrow(f,g)} creates a form for the mapping \spad{f -> g}.
587595`\spad{ratDenom(f)} rationalizes the denominators appearing in \spad{f} by moving all the algebraic quantities into the numerators.
587653`\spad{ratDenom(f, a)} removes \spad{a} from the denominators in \spad{f} if \spad{a} is an algebraic kernel.
587713`\spad{ratDenom(f, [a1,...,an])} removes the \spad{ai}'s which are algebraic kernels from the denominators in \spad{f}.
587779`\spad{ratDenom(f, [a1,...,an])} removes the \spad{ai}'s which are algebraic from the denominators in \spad{f}.
587853`\spad{ratDsolve(op, g)} returns \spad{["failed", []]} if the equation \spad{op y = g} has no rational solution. Otherwise,{} it returns \spad{[f, [y1,...,ym]]} where \spad{f} is a particular rational solution and the \spad{yi}'s form a basis for the rational solutions of the homogeneous equation.
588035`\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}.
588197`\spad{ratDsolve(op, g)} returns \spad{["failed", []]} if the equation \spad{op y = g} has no rational solution. Otherwise,{} it returns \spad{[f, [y1,...,ym]]} where \spad{f} is a particular rational solution and the \spad{yi}'s form a basis for the rational solutions of the homogeneous equation.
588382`\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}.
588547`\spad{ratPoly(f)} returns a polynomial \spad{p} such that \spad{p} has no algebraic coefficients,{} and \spad{p(f) = 0}.
588854`\spad{rational?(x)} returns \spad{true} if \spad{x} is a rational number,{} \spad{false} otherwise.
588914`\spad{rational?(x)} tests if \spad{x} is a rational number.
588997`\spad{rational?(n)} tests if \spad{n} is a rational number (see \spadtype{Fraction Integer}).
589055`\spad{rational?(o)} tests if \spad{o} is rational,{} \spadignore{i.e.} that all seven imaginary parts are 0.
589139`\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.
589225`\spad{rational?(u)} tests if \spadvar{\spad{u}} is actually a rational number (see \spadtype{Fraction Integer}).
589301`\spad{rational?(x)} tests if \spad{x} is a finite rational number.
589387`\spad{rational?(x)} tests if \spad{x} is a finite rational number.
589472`\spad{rationalApproximation(f, n)} computes a rational approximation \spad{r} to \spad{f} with relative error \spad{< 10**(-n)}.
589563`\spad{rationalApproximation(f, n)} computes a rational approximation \spad{r} to \spad{f} with relative error \spad{< 10**(-n)}.
589648`\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)}).
589758`\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)}.
589862`\spad{rationalFunction(f,k)} returns a rational function consisting of the sum of all terms of \spad{f} of degree <= \spad{k}.
589996`\spad{rationalFunction(f,k1,k2)} returns a rational function consisting of the sum of all terms of \spad{f} of degree \spad{d} with \spad{k1 <= d <= k2}.
590480`\spad{rationalIfCan(x)} returns \spad{x} as a rational number,{} "failed" if \spad{x} is not a rational number.
590570`\spad{rationalIfCan(x)} returns \spad{x} as a rational number,{} or "failed" if \spad{x} is not a rational number.
590683`\spad{rationalIfCan(n)} creates a rational number,{} or returns "failed" if this is not possible.
590771`\spad{rationalIfCan(o)} returns the real part if all seven imaginary parts are 0,{} and "failed" otherwise.
590885`\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.
591001`\spad{rationalIfCan(u)} returns a rational number if \spad{u} really is one,{} and "failed" otherwise.
591107`\spad{rationalIfCan(x)} returns \spad{x} as a finite rational number if it is one,{} "failed" otherwise.
591223`\spad{rationalIfCan(x)} returns \spad{x} as a finite rational number if it is one and "failed" otherwise.
591338`\spad{rationalPoint?(a, b)} tests if \spad{(x=a,y=b)} is on the curve.
591418`\spad{rationalPoint?(a, b)} tests if \spad{(x=a,y=b)} is on the curve.
591495`\spad{rationalPoints()} returns the list of all the affine rational points.
591578`\spad{rationalPoints()} returns the list of all the affine rational points.
591671`\spad{rationalPower(f(x))} returns \spad{r} where the Puiseux series \spad{f(x) = g(x^r)}.
592034`\spad{rational(x)} returns \spad{x} as a rational number; error if \spad{x} is not a rational number.
592103`\spad{rational(x)} returns \spad{x} as a rational number. Error: if \spad{x} is not a rational number.
592195`\spad{rational(n)} creates a rational number (see \spadtype{Fraction Integer})..
592262`\spad{rational(o)} returns the real part if all seven imaginary parts are 0. Error: if \spad{o} is not rational.
592355`\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.
592450`\spad{rational(u)} assumes spadvar{\spad{u}} is actually a rational number and does the conversion to rational number (see \spadtype{Fraction Integer}).
592535`\spad{rational(x)} returns \spad{x} as a finite rational number. Error: if \spad{x} is not a rational number.
592630`\spad{rational(x)} returns \spad{x} as a finite rational number. Error: if \spad{x} cannot be so converted.
592724`\spad{ratpart(ir)} returns the rational part of an integration result
592775`\spad{ravel(t)} produces a list of components from a tensor such that \indented{2}{\spad{unravel(ravel(t)) = t}.}
592838`\spad{rdHack1(v,u,n)} \undocumented
592926`\spad{rdregime(s)} reads in a list from a file with name \spad{s}
593170`\spad{read!(f)} extracts a value from file \spad{f}. The state of \spad{f} is modified so a subsequent call to \spadfun{read!} will return the next element.
593219`\spad{readByte!(cond)} attempts to read a byte from the input conduit `cond'. Returns the read byte if successful,{} otherwise \spad{nothing}.
593354`\spad{readBytes!(c,b)} reads byte sequences from conduit `c' into the byte buffer `b'. The actual number of bytes written is returned,{} and the length of `b' is set to that amount.
593432`\spad{readIfCan!(f)} returns a value from the file \spad{f},{} if possible. If \spad{f} is not open for reading,{} or if \spad{f} is at the end of file then \spad{"failed"} is the result.
593489`\spad{readIfCan!(f)} returns a string of the contents of a line from file \spad{f},{} if possible. If \spad{f} is not readable or if it is positioned at the end of file,{} then \spad{"failed"} is returned.
593611`\spad{readInt16!(cond)} attempts to read an \spad{Int16} value from the input conduit `cond'. Returns the value if successful,{} otherwise \spad{nothing}.
593731`\spad{readInt32!(cond)} attempts to read an \spad{Int32} value from the input conduit `cond'. Returns the value if successful,{} otherwise \spad{nothing}.
593849`\spad{readInt8!(cond)} attempts to read an \spad{Int8} value from the input conduit `cond'. Returns the value if successful,{} otherwise \spad{nothing}.
593908`\spad{readLine!(f)} returns a string of the contents of a line from the file \spad{f}.
593954`\spad{readLineIfCan!(f)} returns a string of the contents of a line from file \spad{f},{} if possible. If \spad{f} is not readable or if it is positioned at the end of file,{} then \spad{"failed"} is returned.
594082`\spad{readUInt16!(cond)} attempts to read a \spad{UInt16} value from the input conduit `cond'. Returns the value if successful,{} otherwise \spad{nothing}.
594206`\spad{readUInt32!(cond)} attempts to read a \spad{UInt32} value from the input conduit `cond'. Returns the value if successful,{} otherwise \spad{nothing}.
594328`\spad{readUInt8!(cond)} attempts to read a \spad{UInt8} value from the input conduit `cond'. Returns the value if successful,{} otherwise \spad{nothing}.
594389`\spad{readable?(f)} tests if the named file exist and can it be opened for reading.
594444`\spad{real?(f)} returns \spad{true} if \spad{f = real f}.
594516`\spad{real?(f)} returns \spad{true} if \spad{f = real f}.
594581`\spad{real?(t)} tests whether \spad{t} is equivalent to the FORTRAN type REAL.
594633`\spad{realEigenvalues(m,eps)} computes the eigenvalues of the matrix \spad{m} to precision \spad{eps}. The eigenvalues are expressed as floats or rational numbers depending on the type of \spad{eps} (float or rational).
594735`\spad{realEigenvectors(m,eps)} returns a list of records each one containing a real eigenvalue,{} its algebraic multiplicity,{} and a list of associated eigenvectors. All these results are computed to precision \spad{eps} as floats or rational numbers depending on the type of \spad{eps} .
594895`\spad{realElementary(f)} rewrites \spad{f} in terms of the 4 fundamental real transcendental elementary functions: \spad{log, exp, tan, atan}.
594971`\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}.
595054`\spad{realRoots(rf, eps)} finds the real zeros of a univariate rational function with precision given by eps.
595150`\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}.
595271`\spad{realSolve(lp)} returns the same as \spad{realSolve(ts,false,false,false)}
595393`\spad{realSolve(ts)} returns the set of the points in the regular zero set of \spad{ts} whose coordinates are all real. WARNING: For each set of coordinates given by \spad{realSolve(ts)} the ordering of the indeterminates is reversed \spad{w}.\spad{r}.\spad{t}. \spad{ls}.
595514`\spad{realSolve(ts,info?)} returns the same as \spad{realSolve(ts,info?,false,false)}.
595644`\spad{realSolve(lp,lv,eps)} = compute the list of the real solutions of the list \spad{lp} of polynomials with integer coefficients with respect to the variables in \spad{lv},{} with precision \spad{eps}.
595751`\spad{realSolve(ts,info?,check?)} returns the same as \spad{realSolve(ts,info?,check?,false)}.
595889`\spad{realSolve(ts,info?,check?,lextri?)} returns the set of the points in the variety associated with \spad{lp} whose coordinates are all real. Moreover,{} if \spad{info?} is \spad{true} then some information is displayed during decomposition into regular chains. If \spad{check?} is \spad{true} then the result is checked. If \spad{lextri?} is \spad{true} the
595889`--n the lexTriangular algorithm is called from the \spadtype{LexTriangularPackage} constructor (see \axiomOpFrom{zeroSetSplit}{LexTriangularPackage}(lp,{}\spad{false})). Otherwise,{} the triangular decomposition is computed directly from the input system by using the \axiomOpFrom{zeroSetSplit}{RegularChain} from \spadtype{RegularChain}. WARNING: For each set of coordinates given by \spad{realSolve(ts,info?,check?,lextri?)} the ordering of the indeterminates is reversed \spad{w}.\spad{r}.\spad{t}
595889`--. \spad{ls}.
596035`\spad{realZeros(pol)} returns a list of isolating intervals for all the real zeros of the univariate polynomial \spad{pol}.
596148`\spad{realZeros(pol)} returns a list of isolating intervals for all the real zeros of the univariate polynomial \spad{pol}.
596262`\spad{realZeros(pol, eps)} returns a list of intervals of length less than the rational number eps for all the real roots of the polynomial \spad{pol}.
596393`\spad{realZeros(pol, eps)} returns a list of intervals of length less than the rational number eps for all the real roots of the polynomial \spad{pol}.
596525`\spad{realZeros(pol, range)} returns a list of isolating intervals for all the real zeros of the univariate polynomial \spad{pol} which lie in the interval expressed by the record range.
596693`\spad{realZeros(pol, range)} returns a list of isolating intervals for all the real zeros of the univariate polynomial \spad{pol} which lie in the interval expressed by the record range.
596862`\spad{realZeros(pol, int, eps)} returns a list of intervals of length less than the rational number eps for all the real roots of the polynomial \spad{pol} which lie in the interval expressed by the record \spad{int}.
597048`\spad{realZeros(pol, int, eps)} returns a list of intervals of length less than the rational number eps for all the real roots of the polynomial \spad{pol} which lie in the interval expressed by the record \spad{int}.
597235`\spad{real(f)} returns the real part of \spad{f} where \spad{f} is a complex function.
597312`\spad{real(f)} returns the real part of \spad{f} where \spad{f} is a complex function.
597370`\spad{real(x)} returns real part of \spad{x}.
597416`\spad{real(o)} extracts real part of octonion \spad{o}.
597463`\spad{real(q)} extracts the real part of quaternion \spad{q}.
597512`\spad{recip()} returns \spad{matrix [[0,1],[1,0]]} representing the map \spad{x -> 1 / x}.
597913`\spad{recip(a)} returns the power series reciprocal of \spad{a},{} or "failed" if not possible.
598004`\spad{recip(x)} \undocumented
598104`\spad{recip(x)} \undocumented
598193`\spad{recip(m)} = recip() * \spad{m}
598242`\spad{recip(a)} returns an element,{} which is both a left and a right inverse of \spad{a},{} or \spad{"failed"} if there is no unit element,{} if such an element doesn't exist or cannot be determined (see unitsKnown).
598343`\spad{recip(a)} returns an element,{} which is both a left and a right inverse of \spad{a},{} or \spad{"failed"} if such an element doesn't exist or cannot be determined (see unitsKnown).
598402`\spad{recip(x)} tries to compute the multiplicative inverse for \spad{x} or "failed" if it cannot find the inverse (see unitsKnown).
598454`\spad{recip(x)} computes the multiplicative inverse of \spad{x} or "failed" if \spad{x} is not invertible.
598628`\axiom{recip(\spad{p},{}ts)} returns the inverse of \axiom{\spad{p}} \spad{w}.\spad{r}.\spad{t} \spad{ts} assuming that \axiom{\spad{p}} is invertible \spad{w}.\spad{r}.\spad{t} \spad{ts}.
598709`\axiom{recip(pol,{}aRoot)} tries to inverse \axiom{pol} interpreted as \axiom{aRoot}
598818`\spad{reciprocalPolynomial(p)} calulates a polynomial which has exactly the inverses of the non-zero roots of \spad{p} as roots,{} and the same number of 0-roots.
598894`\spad{recolor()},{} uninteresting to top level user; exported in order to compile package.
599104`\spad{recoverAfterFail(routs,routineName,ifailValue)} acts on the instructions given by the ifail list
599193`\spad{rectangularMatrix(m)} converts a matrix of type \spadtype{Matrix} to a matrix of type \spad{RectangularMatrix}.
599266`\spad{recur(g)} is the function \spad{h} such that \indented{1}{\spad{h(n,x)= g(n,g(n-1,..g(1,x)..))}.}
599360`\spad{recur(n,g,x)} is \spad{g(n,g(n-1,..g(1,x)..))}.
599464`\spad{redPo }\undocumented
599577`\spad{redPol }\undocumented
599669`\spad{red()} returns the position of the red hue from total hues.
599700`\spad{red(c)} returns the `red' component of `c'.
599743`\spad{redmat(m,g)} returns a matrix whose entries are those of \spad{m} modulo the ideal generated by the groebner basis \spad{g}
599840`\spad{redpps(s,g)} returns the simplified form of \spad{s} after reducing modulo a groebner basis \spad{g}
600189`\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.
600354`\axiom{reduceByQuasiMonic(\spad{p},{}ts)} returns the same as \axiom{remainder(\spad{p},{}collectQuasiMonic(ts)).polnum}.
600428`\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}.
600521`\spad{reduce(f)} produces the equivalence class of \spad{f} in the residue ring
600767`\spad{reduce(x)} \undocumented
600887`\spad{reduce(p)} \undocumented{}
601085`\spad{reduce(f)} simplifies all the unreduced algebraic numbers present in \spad{f} by applying their defining relations.
601136`\spad{reduce(frac)} converts the fraction \spad{frac} to an algebra element.
601227`\spad{reduce(up)} converts the univariate polynomial \spad{up} to an algebra element,{} reducing by the \spad{definingPolynomial()} if necessary.
601280`\spad{reduce(D)} converts \spad{D} to some reduced form (the reduced forms can be differents in different implementations).
601345`\spad{reduce(f)} simplifies all the unreduced algebraic numbers present in \spad{f} by applying their defining relations.
601391`\spad{reduce(f)} simplifies all the unreduced algebraic quantities present in \spad{f} by applying their defining relations.
601690`\spad{reduce(r,m)} \undocumented
601778`\spad{reduce(r,m)} \undocumented
601856`\spad{reduce(r,m)} \undocumented
601933`\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.
602261`\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.
602352`\spad{reduce(fn,u,ident)} successively uses the binary function \spad{fn} on the elements of list \spad{u} and the result of previous applications. \spad{ident} is returned if the \spad{u} is empty. Note the order of application in the following examples: \spad{reduce(fn,[1,2,3],0) = fn(3,fn(2,fn(1,0)))} and \spad{reduce(*,[2,3],1) = 3 * (2 * 1)}.
602417`\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}.
602512`\spad{reduce(f,a,r)} applies function \spad{f} to each successive element of the primitive array \spad{a} and an accumulant initialized to \spad{r}. For example,{} \spad{reduce(_+\$Integer,[1,2,3],0)} does \spad{3+(2+(1+0))}. Note: third argument \spad{r} may be regarded as the identity element for the function \spad{f}.
602597`\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.
602666`\spad{reduce(f,m,r)} returns a matrix \spad{n} where \spad{n[i,j] = f(m[i,j],r)} for all indices \spad{i} and \spad{j}.
602769`\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}.
602887`\spad{reduce(f,a,r)} applies function \spad{f} to each successive element of the aggregate \spad{a} and an accumulant initialized to \spad{r}. For example,{} \spad{reduce(_+\$Integer,[1,2,3],0)} does \spad{3+(2+(1+0))}. Note: third argument \spad{r} may be regarded as the identity element for the function \spad{f}.
602967`\spad{reduce(f,a,r)} applies function \spad{f} to each successive element of the aggregate \spad{a} and an accumulant initialised to \spad{r}. For example,{} \spad{reduce(_+\$Integer,[1,2,3],0)} does a \spad{3+(2+(1+0))}. Note: third argument \spad{r} may be regarded as an identity element for the function.
603044`\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
603044`--}.
603132`\spad{reduce(b,f,u)},{} where \spad{u} is a finite stream \spad{[x0,x1,...,xn]},{} returns the value \spad{r(n)} computed as follows: \spad{r0 = f(x0,b), r1 = f(x1,r0),..., r(n) = f(xn,r(n-1))}.
603534`\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 wh
603534`--en \spad{u} is empty.
603648`\axiom{reduce(\spad{p},{}ts,{}redOp,{}redOp?)} returns a polynomial \axiom{\spad{r}} such that \axiom{redOp?(\spad{r},{}\spad{p})} holds for every \axiom{\spad{p}} of \axiom{ts} and there exists some product \axiom{\spad{h}} of the initials of the members of \axiom{ts} such that \axiom{h*p - \spad{r}} lies in the ideal generated by \axiom{ts}. The operation \axiom{redOp} must satisfy the following conditions. For ever
603648`--y \axiom{\spad{p}} and \axiom{\spad{q}} we have \axiom{redOp?(redOp(\spad{p},{}\spad{q}),{}\spad{q})} and there exists an integer \axiom{\spad{e}} and a polynomial \axiom{\spad{f}} such that \axiom{init(\spad{q})^e*p = f*q + redOp(\spad{p},{}\spad{q})}.
603882`\axiom{reduced?(\spad{q},{}lp)} returns \spad{true} iff \axiom{reduced?(\spad{q},{}\spad{p})} holds for every \axiom{\spad{p}} in \axiom{lp}.
603963`\axiom{reduced?(a,{}\spad{b})} returns \spad{true} iff \axiom{degree(a,{}mvar(\spad{b})) < mdeg(\spad{b})}.
604120`\axiom{reduced?(\spad{p},{}ts,{}redOp?)} returns \spad{true} iff \axiom{\spad{p}} is reduced \spad{w}.\spad{r}.\spad{t}. in the sense of the operation \axiom{redOp?},{} that is if for every \axiom{\spad{t}} in \axiom{ts} \axiom{redOp?(\spad{p},{}\spad{t})} holds.
604205`\spad{reducedContinuedFraction(b0,b)} constructs a continued fraction in the following way: if \spad{b = [b1,b2,...]} then the result is the continued fraction \spad{b0 + 1/(b1 + 1/(b2 + ...))}. That is,{} the result is the same as \spad{continuedFraction(b0,[1,1,1,...],[b1,b2,b3,...])}.
604283`\spad{reducedDiscriminant(up)} \undocumented
604371`\spad{reducedForm(x)} puts the continued fraction \spadvar{\spad{x}} in reduced form,{} \spadignore{i.e.} the function returns an equivalent continued fraction of the form \spad{continuedFraction(b0,[1,1,1,...],[b1,b2,b3,...])}.
604427`\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}.
605542`\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}.
607062`\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}.
607179`\spad{reduction(p,prime)} reduces the polynomial \spad{p} modulo \spad{prime} of \spad{R}. Note: this function is exported only because it's conditional.
607232`\spad{reduction(f,p)} reduces the coefficients of the polynomial \spad{f} modulo the prime \spad{p}.
607302`\spad{reduction(u,pol)} computes the symmetric reduction of \spad{u} mod \spad{pol}
607499`\spad{reductum(p)},{} where \spad{p} is an antisymmetric polynomial,{} returns \spad{p} minus the leading term of \spad{p} if \spad{p} has at least two terms,{} and 0 otherwise.
607548`\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.
607615`\spad{reductum(x)} \undocumented
607687`\spad{reductum(x)} \undocumented
607743`\spad{reductum(f)} is \spad{f} minus its leading monomial.
607808`\spad{reductum(p)} returns \spad{p} minus its leading term. An error is produced if \spad{p} is zero.
607861`\spad{reductum(u)} returns \spad{u} minus its leading monomial returns zero if handed the zero element.
607916`\spad{reductum(x)} returns \spad{x} minus its leading term.
607971`\spad{reductum(z)} returns a new element created by removing the leading coefficient/support pair from the element \spad{z}. Error: if \spad{z} has no support.
608037`\spad{reductum(l)} is \spad{l - monomial(a(n),n)} if \indented{2}{\spad{l = sum(monomial(a(i),i), i = 0..n)}.}
608096`\spad{reductum(l)} is \spad{l - monomial(a(n),n)} if \indented{2}{\spad{l = sum(monomial(a(i),i), i = 0..n)}.}
608229`\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}}.
608298`\spad{ref(n)} creates a pointer (reference) to the object \spad{n}.
608337`\spad{refine(x)} \undocumented
608374`\spad{refine(p)} performs a refinement on the plot \spad{p}
608409`\axiom{refine(rootChar)} shrinks isolating interval around \axiom{rootChar}
608497`\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)}.
608591`\spad{refine(p,x)} \undocumented{}
608657`\spad{refine(x,r)} \undocumented
608715`\spad{refine(x,r)} \undocumented
608771`\spad{refine(pol, int, eps)} refines the interval \spad{int} containing exactly one root of the univariate polynomial \spad{pol} to size less than the rational number eps.
608948`\spad{refine(pol, int, eps)} refines the interval \spad{int} containing exactly one root of the univariate polynomial \spad{pol} to size less than the rational number eps.
609126`\spad{refine(pol, int, range)} takes a univariate polynomial \spad{pol} and and isolating interval \spad{int} containing exactly one real root of \spad{pol}; the operation returns an isolating interval which is contained within range,{} or "failed" if no such isolating interva
609126`--l exists.
609356`\spad{refine(pol, int, range)} takes a univariate polynomial \spad{pol} and and isolating interval \spad{int} which must contain exactly one real root of \spad{pol},{} and returns an isolating interval which is contained within range,{} or "failed" if no such isolating interv
609356`--al exists.
609587`\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.
609657`\spad{regime(y,c, w, p, r, rm, m)} returns a regime,{} a list of polynomials specifying the consistency conditions,{} a par
609657`--ticular solution and basis representing the general solution of the parametric linear system \spad{c} \spad{z} = \spad{w} on that regime. The regime returned depends on the subdeterminant \spad{y}.det and the row and column indices. The solutions are simplified using the assumption that the system has rank \spad{r} and maximum rank \spad{rm}. The list \spad{p} represents a list of list of factors of polynomials in a groebner basis of the ideal generated by higher order subdeterminants,{} and i
609657`--us used for the simplification. The mode \spad{m} distinguishes the cases when the system is homogeneous,{} or the right hand side is arbitrary,{} or when there is no new right hand side variables.
610041`\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".
610188`\spad{regularRepresentation(a)} returns the matrix of the linear map defined by left multiplication by \spad{a} with respect to the fixed basis.
610422`\spad{regularRepresentation(a,basis)} returns the matrix of the linear map defined by left multiplication by \spad{a} with respect to the \spad{basis} \spad{basis}.
610509`\spad{reify(d)} returns the abstract syntax for the domain `x'.
610577`\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)}.}
610651`\spad{relationsIdeal(polyList)} returns the ideal of relations among the polynomials in \spad{polyList}.
610827`\axiom{relativeApprox(\spad{n},{}\spad{p})} gives a relative approximation of \axiom{\spad{n}} that has precision \axiom{\spad{p}}
610905`\axiom{relativeApprox(exp,{}\spad{c},{}\spad{p}) = a} is relatively close to exp as a polynomial in \spad{c} ip to precision \spad{p}
611026`\axiom{approximate(term,{}root,{}prec)} gives an approximation of \axiom{term} over \axiom{root} with precision \axiom{prec}
611138`\spad{relerror(x,y)} computes the absolute value of \spad{x - y} divided by \spad{y},{} when \spad{y \~= 0}.
611270`\spad{f rem g} creates the equivalent infix form.
611311`\spad{x rem y} is the same as \spad{divide(x,y).remainder}. See \spadfunFrom{divide}{EuclideanDomain}.
611357`\spad{a rem b} returns the remainder of \spad{a} and \spad{b}.
611501`\axiom{remainder(a,{}ps)} returns \axiom{[\spad{c},{}\spad{b},{}\spad{r}]} such that \axiom{\spad{b}} is fully reduced in the sense of Groebner bases \spad{w}.\spad{r}.\spad{t}. \axiom{ps},{} \axiom{r*a - c*b} lies in the ideal generated by \axiom{ps}. Furthermore,{} if \axiom{\spad{R}} is a gcd-domain,{} \axiom{\spad{b}} is primitive.
612197`\axiom{remove!(\spad{s},{}a)} replaces a by remove(\spad{s},{}a)
612266`\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}.
612368`\spad{remove!(p,u)} destructively removes all elements \spad{x} of \spad{u} such that \axiom{\spad{p}(\spad{x})} is \spad{true}.
612441`\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".
612522`\spad{remove!(x,d)} destructively changes dictionary \spad{d} by removing all entries \spad{y} such that \axiom{\spad{y} = \spad{x}}.
612613`\spad{remove!(x,u)} destructively removes all values \spad{x} from \spad{u}.
612693`\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.
612757`\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.
612810`\spad{removeConstantTerm(f, x)} returns \spad{f} minus any additive constant with respect to \spad{x}.
612900`\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.
612966`\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.
613087`\spad{removeDuplicates!(u)} destructively removes duplicates from \spad{u}.
613175`\spad{removeDuplicates!(d)} destructively removes any duplicate values in dictionary \spad{d}.
613350`\spad{removeDuplicates(u)} returns a copy of \spad{u} with all duplicates removed.
613462`\axiom{removeIrreducibleRedundantFactors(lp,{}lq)} returns the same as \axiom{irreducibleFactors(concat(lp,{}lq))} assuming that \axiom{irreducibleFactors(lp)} returns \axiom{lp} up to replacing some polynomial \axiom{pj} in \axiom{lp} by some polynomial \axiom{qj} associated to \axiom{pj}.
613629`\axiom{removeRedundantFactorsInContents(lp,{}lf)} returns \axiom{newlp} where \axiom{newlp} is obtained from \axiom{lp} by removing in the content of every polynomial of \axiom{lp} any non trivial factor of any polynomial \axiom{\spad{f}} in \axiom{lf}. Moreover,{} squares over \axiom{\spad{R}} are first removed in the content of every polynomial of \axiom{lp}.
613758`\axiom{removeRedundantFactorsInPols(lp,{}lf)} returns \axiom{newlp} where \axiom{newlp} is obtained from \axiom{lp} by removing in every polynomial \axiom{\spad{p}} of \axiom{lp} any non trivial factor of any polynomial \axiom{\spad{f}} in \axiom{lf}. Moreover,{} squares over \axiom{\spad{R}} are first removed in every polynomial \axiom{lp}.
613883`\axiom{removeRedundantFactors(lp)} returns \axiom{lq} such that if \axiom{lp = [\spad{p1},{}...,{}pn]} and \axiom{lq = [\spad{q1},{}...,{}qm]} then the product \axiom{p1*p2*...*pn} vanishes iff the product \axiom{q1*q2*...*qm} vanishes,{} and the product of degrees of the \axiom{\spad{qi}} is not greater than the one of the \axiom{pj},{} and no polynomial in \axiom{lq} divides another polynomial in \axiom{lq}
613883`--. In particular,{} polynomials lying in the base ring \axiom{\spad{R}} are removed. Moreover,{} \axiom{lq} is sorted \spad{w}.\spad{r}.\spad{t} \axiom{infRittWu?}. Furthermore,{} if \spad{R} is gcd-domain,{} the polynomials in \axiom{lq} are pairwise without common non trivial factor.
613978`\axiom{removeRedundantFactors(lp,{}lq)} returns the same as \axiom{removeRedundantFactors(concat(lp,{}lq))} assuming that \axiom{removeRedundantFactors(lp)} returns \axiom{lp} up to replacing some polynomial \axiom{pj} in \axiom{lp} by some polynomial \axiom{qj} associated to \axiom{pj}.
614081`\axiom{removeRedundantFactors(lp,{}\spad{q})} returns the same as \axiom{removeRedundantFactors(cons(\spad{q},{}lp))} assuming that \axiom{removeRedundantFactors(lp)} returns \axiom{lp} up to replacing some polynomial \axiom{pj} in \axiom{lp} by some some polynomial \axiom{qj} associated to \axiom{pj}.
614178`\axiom{removeRedundantFactors(\spad{p},{}\spad{q})} returns the same as \axiom{removeRedundantFactors([\spad{p},{}\spad{q}])}
614269`\axiom{removeRedundantFactors(lp,{}lq,{}remOp)} returns the same as \axiom{concat(remOp(removeRoughlyRedundantFactorsInPols(lp,{}lq)),{}lq)} assuming that \axiom{remOp(lq)} returns \axiom{lq} up to similarity.
614391`\axiom{removeRoughlyRedundantFactorsInContents(lp,{}lf)} returns \axiom{newlp}where \axiom{newlp} is obtained from \axiom{lp} by removing in the content of every polynomial of \axiom{lp} any occurence of a polynomial \axiom{\spad{f}} in \axiom{lf}. Moreover,{} squares over \axiom{\spad{R}} are first removed in the content of every polynomial of \axiom{lp}.
614527`\axiom{removeRoughlyRedundantFactorsInPol(\spad{p},{}lf)} returns the same as removeRoughlyRedundantFactorsInPols([\spad{p}],{}lf,{}\spad{true})
614630`\axiom{removeRoughlyRedundantFactorsInPols(lp,{}lf)} returns \axiom{newlp}where \axiom{newlp} is obtained from \axiom{lp} by removing in every polynomial \axiom{\spad{p}} of \axiom{lp} any occurence of a polynomial \axiom{\spad{f}} in \axiom{lf}. This may involve a lot of exact-quotients computations.
614746`\axiom{removeRoughlyRedundantFactorsInPols(lp,{}lf,{}opt)} returns the same as \axiom{removeRoughlyRedundantFactorsInPols(lp,{}lf)} if \axiom{opt} is \axiom{\spad{false}} and if the previous operation does not return any non null and constant polynomial,{} else return \axiom{[1]}.
614870`\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.
614936`\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.
615003`\axiom{removeSquaresIfCan(lp)} returns \axiom{removeDuplicates [squareFreePart(\spad{p})\$\spad{P} for \spad{p} in lp]} if \axiom{\spad{R}} is gcd-domain else returns \axiom{lp}.
615094`\axiom{removeSuperfluousCases(llpwt)} is an internal subroutine,{} exported only for developement.
615238`\axiom{removeSuperfluousCases(llpwt)} is an internal subroutine,{} exported only for developement.
615392`\axiom{removeSuperfluousQuasiComponents(lts)} removes from \axiom{lts} any \spad{ts} such that \axiom{subQuasiComponent?(ts,{}us)} holds for another \spad{us} in \axiom{lts}.
615494`\axiom{removeSuperfluousQuasiComponents(lts)} removes from \axiom{lts} any \spad{ts} such that \axiom{subQuasiComponent?(ts,{}us)} holds for another \spad{us} in \axiom{lts}.
615669`\axiom{removeZero(\spad{p},{}ts)} returns \axiom{0} if \axiom{\spad{p}} reduces to \axiom{0} by pseudo-division \spad{w}.\spad{r}.\spad{t} \axiom{ts} otherwise returns a polynomial \axiom{\spad{q}} computed from \axiom{\spad{p}} by removing any coefficient in \axiom{\spad{p}} reducing to \axiom{0}.
615839`\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 
615839`--the \spad{p}-adic integer by \spad{p}. Note: \spad{removeZeroes(f)} removes all leading zeroes from \spad{f}.
615909`\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 t
615909`--he Taylor series by its variable. Note: \spad{removeZeroes(f)} removes all leading zeroes from \spad{f}
616118`\spad{removeZeroes(n,x)} removes up to \spad{n} leading zeroes from the \spad{p}-adic rational \spad{x}.
616196`\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 dividin
616196`--g the Taylor series by its variable.
616513`\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.
616581`\spad{remove(p,u)} returns a copy of \spad{u} removing all elements \spad{x} such that \axiom{\spad{p}(\spad{x})} is \spad{true}. Note: \axiom{remove(\spad{p},{}\spad{u}) == [\spad{x} for \spad{x} in \spad{u} | not \spad{p}(\spad{x})]}.
616672`\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)]}.
616738`\spad{remove(x,u)} returns a copy of \spad{u} with all elements \axiom{\spad{y} = \spad{x}} removed. Note: \axiom{remove(\spad{y},{}\spad{c}) == [\spad{x} for \spad{x} in \spad{c} | \spad{x} ~= \spad{y}]}.
616842`\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.
616905`\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.
616957`\axiom{rename!(\spad{x},{}name)} changes the way \axiom{\spad{x}} is printed
617015`\axiom{rename(\spad{x},{}name)} gives a new number that prints as name
617072`\spad{reopen!(f,mode)} returns a file \spad{f} reopened for operation in the indicated mode: "input" or "output". \spad{reopen!(f,"input")} will reopen the file \spad{f} for input.
617131`\spad{reorder(p, perm)} applies the permutation perm to the variables in a polynomial and returns the new correctly ordered polynomial
617216`\spad{reorder(p, perm)} applies the permutation perm to the variables in a polynomial and returns the new correctly ordered polynomial
617310`\spad{reorder(p, perm)} applies the permutation perm to the variables in a polynomial and returns the new correctly ordered polynomial
617406`\spad{repSq(v,e)} computes \spad{v**e} by repeated squaring,{} interpreting \spad{v} as an element of a normal basis field.
617505`\spad{repeatUntilLoop(s,c)} creates a repeat ... until loop in FORTRAN.
617563`\spad{repeating?(l,s)} returns \spad{true} if a stream \spad{s} is periodic with period \spad{l},{} and \spad{false} otherwise.
617638`\spad{repeating(l)} is a repeating stream whose period is the list \spad{l}.
617686`\spad{replaceKthElement(S,k,p)} replaces the k^{th} element of \spad{S} by \spad{p},{} and returns "failed" if the result is not a set of \spad{M} integers in \spad{1..n} any more.
617803`\spad{replace(s,i..j,t)} replaces the substring \axiom{\spad{s}(\spad{i}..\spad{j})} of \spad{s} by string \spad{t}.
617879`\spad{representationType()} returns the type of the representation,{} one of: \spad{prime},{} \spad{polynomial},{} \spad{normal},{} or \spad{cyclic}.
618262`\spad{represents([a1,..,an])} returns \spad{a1*v1 + ... + an*vn},{} where \spad{v1},{}...,{}vn are the elements of the fixed basis.
618336`\spad{represents([a1,..,an])} returns \spad{a1*v1 + ... + an*vn},{} where \spad{v1},{} ...,{} vn are the elements of the fixed basis.
618397`\spad{represents([a1,...,an])} returns \spad{a1*v1 + ... + an*vn},{} where \spad{v1},{} ...,{} \spad{vn} are the elements of the fixed \spad{R}-module basis.
618938`\spad{represents([a1,..,an],[v1,..,vn])} returns \spad{a1*v1 + ... + an*vn}.
619014`\spad{represents([a1,...,am],[v1,...,vm])} returns the linear combination \spad{a1*vm + ... + an*vm}.
619101`\spad{represents([A0,...,A(n-1)],D)} returns \spad{(A0 + A1 y +...+ A(n-1)*y**(n-1))/D}.
619179`\spad{reseed(n)} restarts the random number generator at \spad{n}.
619235`\axiom{resetAttributeButtons()} resets the Attribute buttons to a neutral level.
619297`\spad{resetBadValues(p)} initializes the list of "bad values" for \spad{p} to \spad{[]}. Note: \spad{p} is not allowed to match any of its "bad values".
619346`\spad{resetNew()} resets the internals counters that new() and new(\spad{s}) use to return distinct symbols every time.
619385`\spad{resetVariableOrder()} cancels any previous use of setVariableOrder and returns to the default system ordering.
619455`\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.
619509`\spad{reset(v)} sets the current state of the graph characteristics of the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport},{} back to their initial settings.
619565`\spad{reshape(l,p)} \undocumented
619647`\spad{reshape(lt,ts)} organizes the list of components \spad{lt} into a tensor with the same shape as \spad{ts}.
619779`\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.
619866`\spad{resize(v,w,h)} displays the three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport},{} with a width of \spad{w} and a height of \spad{h},{} keeping the upper left-hand corner position unchanged.
619955`\spad{resolve(h)} returns the \spad{IP4} address of host `h'.
620179`\axiom{rest(\spad{x})} return \axiom{\spad{x}} without the first entry or error if \axiomOpFrom{retractable?}{Magma}(\axiom{\spad{x}}) is \spad{true}.
620221`\spad{rest(x)} returns \spad{x} except the first letter.
620270`\spad{rest([l1]*[l2]*...[ln])} returns the list \spad{l2, .... ln}.
620338`\axiom{rest(ts)} returns the polynomials of \axiom{ts} with smaller main variable than \axiom{mvar(ts)} if \axiom{ts} is not empty,{} otherwise returns "failed"
620413`\spad{rest(u)} returns an aggregate consisting of all but the first element of \spad{u} (equivalently,{} the next node of \spad{u}).
620604`\spad{rest(u,n)} returns the \axiom{\spad{n}}th (\spad{n} >= 0) node of \spad{u}. Note: \axiom{rest(\spad{u},{}0) = \spad{u}}.
620678`\spad{restorePrecision()} \undocumented{}
620740`\axiom{result(a)} where \axiom{ls} is the leaves list of \axiom{a} returns \axiom{[[value(\spad{s}),{}condition(\spad{s})]\$VT for \spad{s} in ls]} if the computations are terminated in \axiom{a} else an error is produced.
620814`\axiom{resultantEuclidean(\spad{P},{}\spad{Q})} carries out the equality \axiom{coef1*P + coef2*Q = resultant(\spad{P},{}\spad{Q})}
620934`\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.
621058`\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})}.
621206`\axiom{resultantReduit(\spad{P},{}\spad{Q})} returns the "reduce resultant" of \axiom{\spad{P}} and \axiom{\spad{Q}}.
621299`\axiom{resultant(\spad{P},{} \spad{Q})} returns the resultant of \axiom{\spad{P}} and \axiom{\spad{Q}}
621370`\spad{resultant(p,q)} returns the resultant of the polynomials \spad{p} and \spad{q}.
621459`\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}}.
621620`\spad{resultant(p,q,v)} returns the resultant of the polynomials \spad{p} and \spad{q} with respect to the variable \spad{v}.
621716`\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.
622884`\spad{retractIfCan(x)} \undocumented
627158`\spad{retractIfCan(a)} tries change \spad{a} into an object of type \spad{S}. If it can,{} then such an object is returned. Otherwise,{} "failed" is returned.
627227`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
627318`\spad{retractIfCan(e)} takes \spad{e} and tries to transform it into a \indented{1}{FortranExpression checking that it contains no non-Fortran} \indented{1}{functions,{} and that it only contains the given basic symbols} \indented{1}{and subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
627465`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
627558`\spad{retractIfCan(e)} takes \spad{e} and tries to transform it into a \indented{1}{FortranExpression checking that it contains no non-Fortran} \indented{1}{functions,{} and that it only contains the given basic symbols} \indented{1}{and subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
627709`\spad{retractIfCan(e)} takes \spad{e} and tries to transform it into a \indented{1}{FortranExpression checking that it contains no non-Fortran} \indented{1}{functions,{} and that it only contains the given basic symbols} \indented{1}{and subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
627825`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
627926`\spad{retractIfCan(e)} takes \spad{e} and tries to transform it into a \indented{1}{FortranExpression checking that it contains no non-Fortran} \indented{1}{functions,{} and that it only contains the given basic symbols} \indented{1}{and subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
628083`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
628186`\spad{retractIfCan(e)} takes \spad{e} and tries to transform it into a \indented{1}{FortranExpression checking that it contains no non-Fortran} \indented{1}{functions,{} and that it only contains the given basic symbols} \indented{1}{and subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
628347`\axiom{retractIfCan(lp)} returns an element of the domain whose elements are the members of \axiom{lp} if such an element exists,{} otherwise \axiom{"failed"} is returned.
628440`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
628545`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
628652`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
628767`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
628884`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
628989`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
629096`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
629187`\spad{retractIfCan(e)} takes \spad{e} and tries to transform it into a \indented{1}{FortranExpression checking that it contains no non-Fortran} \indented{1}{functions,{} and that it only contains the given basic symbols} \indented{1}{and subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
629334`\axiom{retractIfCan(\spad{p})} returns \axiom{\spad{p}} as an element of the current domain if all its variables belong to \axiom{\spad{V}}.
629515`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
629608`\axiom{retractIfCan(\spad{p})} returns \axiom{\spad{p}} as an element of the current domain if all its variables belong to \axiom{\spad{V}}.
629779`\axiom{retractIfCan(\spad{p})} returns \axiom{\spad{p}} as an element of the current domain if all its variables belong to \axiom{\spad{V}}.
629979`\spad{retractIfCan(e)} takes \spad{e} and tries to transform it into a \indented{1}{FortranExpression checking that it contains no non-Fortran} \indented{1}{functions,{} and that it only contains the given basic symbols} \indented{1}{and subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
630130`\axiom{retractIfCan(\spad{p})} returns \axiom{\spad{p}} as an element of the current domain if all its variables belong to \axiom{\spad{V}}.
630338`\axiom{retractIfCan(\spad{p})} returns \axiom{\spad{p}} as an element of the current domain if all its variables belong to \axiom{\spad{V}}.
630564`\axiom{retractIfCan(\spad{p})} returns \axiom{\spad{p}} as an element of the current domain if all its variables belong to \axiom{\spad{V}}.
630763`\spad{retractIfCan(e)} takes \spad{e} and tries to transform it into a FortranExpression \indented{1}{checking that it is one of the given basic symbols} \indented{1}{or subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
630872`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
630977`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
631084`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
631199`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
631316`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
631421`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
631528`\spad{retractIfCan(a)} transforms a into an element of \spad{S} if possible. Returns "failed" if a cannot be made into an element of \spad{S}.
634946`\spad{retract(a)} tries to convert \spad{a} into an object of type \spad{S}. If possible,{} it returns the object. Error: if no such retraction is possible.
634994`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
635064`\spad{retract(e)} takes \spad{e} and transforms it into a \indented{1}{FortranExpression checking that it contains no non-Fortran} \indented{1}{functions,{} and that it only contains the given basic symbols} \indented{1}{and subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
635190`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
635262`\spad{retract(e)} takes \spad{e} and transforms it into a \indented{1}{FortranExpression checking that it contains no non-Fortran} \indented{1}{functions,{} and that it only contains the given basic symbols} \indented{1}{and subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
635392`\spad{retract(e)} takes \spad{e} and transforms it into a \indented{1}{FortranExpression checking that it contains no non-Fortran} \indented{1}{functions,{} and that it only contains the given basic symbols} \indented{1}{and subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
635487`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
635567`\spad{retract(e)} takes \spad{e} and transforms it into a \indented{1}{FortranExpression checking that it contains no non-Fortran} \indented{1}{functions,{} and that it only contains the given basic symbols} \indented{1}{and subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
635703`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
635785`\spad{retract(e)} takes \spad{e} and transforms it into a \indented{1}{FortranExpression checking that it contains no non-Fortran} \indented{1}{functions,{} and that it only contains the given basic symbols} \indented{1}{and subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
635925`\axiom{retract(lp)} returns an element of the domain whose elements are the members of \axiom{lp} if such an element exists,{} otherwise an error is produced.
635997`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
636081`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
636167`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
636261`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
636357`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
636441`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
636527`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
636597`\spad{retract(e)} takes \spad{e} and transforms it into a \indented{1}{FortranExpression checking that it contains no non-Fortran} \indented{1}{functions,{} and that it only contains the given basic symbols} \indented{1}{and subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
636723`\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.
636883`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
636955`\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.
637105`\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.
637284`\spad{retract(e)} takes \spad{e} and transforms it into a \indented{1}{FortranExpression checking that it contains no non-Fortran} \indented{1}{functions,{} and that it only contains the given basic symbols} \indented{1}{and subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
637414`\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.
637601`\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.
637806`\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.
637984`\spad{retract(e)} takes \spad{e} and transforms it into a FortranExpression \indented{1}{checking that it is one of the given basic symbols} \indented{1}{or subscripted symbols which correspond to scalar and array} \indented{1}{parameters respectively.}
638072`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
638156`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
638242`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
638336`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
638432`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
638516`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
638602`\spad{retract(x)} \undocumented{}
638919`\spad{retract(x)} \undocumented{}
639159`\spad{retract(a)} transforms a into an element of \spad{S} if possible. Error: if a cannot be made into an element of \spad{S}.
639206`\spad{retract(x)} \undocumented{}
639534`\spad{retract(x)} \undocumented{}
639842`\spad{retractable?(p)} tests if \spad{p} is a 0-form,{} \spadignore{i.e.} if degree(\spad{p}) = 0.
639900`\spad{retractable?(df)} tests if differential form \spad{df} is a 0-form,{} \spadignore{i.e.} if degree(\spad{df}) = 0.
639976`\axiom{retractable?(\spad{x})} tests if \axiom{\spad{x}} is a tree with only one entry.
640036`\axiom{retractable?(\spad{x})} tests if \axiom{\spad{x}} is a tree with only one entry.
640091`\spad{retractable?([l1]*[l2]*...[ln])} returns \spad{true} iff \spad{n} equals \spad{1}.
640172`\spad{retractable?(a)} tests if \spad{a} can be converted into an object of type \spad{S}.
640231`\spad{returnType!(t)} declares that the return type of he current subprogram in the global symbol table is \spad{t}.
640321`\spad{returnType!(f,t)} declares that the return type of subprogram \spad{f} in the global symbol table is \spad{t}.
640418`\spad{returnType!(f,t,tab)} declares that the return type of subprogram \spad{f} in symbol table \spad{tab} is \spad{t}.
640518`\spad{returnTypeOf(f,tab)} returns the type of the object returned by \spad{f}
640614`\spad{returns()} creates a representation of a FORTRAN RETURN statement.
640655`\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.
640722`\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.
640780`\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.
640840`\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.
640907`\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.
640972`\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.
641144`\spad{reverse!(l)} reverses the list of monomials forming \spad{l},{} destroying the element \spad{l}.
641198`\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.
641250`\spad{reverse!(u)} returns \spad{u} with its elements in reverse order.
641342`\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.
641475`\spad{reverse(p)} returns the reverse polynomial of \spad{p}.
641543`\spad{reverse(l)} reverses the list of monomials forming \spad{l}. This has some effect if the monoid is non-abelian,{} \spadignore{i.e.} \spad{reverse(a1\^e1 ... an\^en) = an\^en ... a1\^e1} which is different.
641596`\spad{reverse(a)} returns a copy of \axiom{a} with elements in reverse order.
641652`\spad{revert(a)} computes the inverse of a power series \spad{a} with respect to composition. the series should have constant coefficient 0 and first order coefficient should be invertible.
641728`\spad{revert(f(x))} returns a Taylor series \spad{g(x)} such that \spad{f(g(x)) = g(f(x)) = x}. Series \spad{f(x)} should have constant coefficient 0 and invertible 1st order coefficient.
641894`\axiom{rewriteIdealWithHeadRemainder(lp,{}cs)} returns \axiom{lr} such that the leading monomial of every polynomial in \axiom{lr} is reduced in the sense of Groebner bases \spad{w}.\spad{r}.\spad{t}. \axiom{cs} and \axiom{(lp,{}cs)} and \axiom{(lr,{}cs)} generate the same ideal in \axiom{(\spad{R})^(\spad{-1}) \spad{P}}.
642017`\axiom{rewriteIdealWithQuasiMonicGenerators(lp,{}redOp?,{}redOp)} returns \axiom{lq} where \axiom{lq} and \axiom{lp} generate the same ideal in \axiom{R^(\spad{-1}) \spad{P}} and \axiom{lq} has rank not higher than the one of \axiom{lp}. Moreover,{} \axiom{lq} is computed by reducing \axiom{lp} \spad{w}.\spad{r}.\spad{t}. some basic set of the ideal generated by the quasi
642017`---monic polynomials in \axiom{lp}.
642245`\axiom{rewriteIdealWithRemainder(lp,{}cs)} returns \axiom{lr} such that every polynomial in \axiom{lr} is fully reduced in the sense of Groebner bases \spad{w}.\spad{r}.\spad{t}. \axiom{cs} and \axiom{(lp,{}cs)} and \axiom{(lr,{}cs)} generate the same ideal in \axiom{(\spad{R})^(\spad{-1}) \spad{P}}.
642364`\axiom{rewriteSetByReducingWithParticularGenerators(lp,{}pred?,{}redOp?,{}redOp)} returns \axiom{lq} where \axiom{lq} is computed by the following algorithm. Chose a basic set \spad{w}.\spad{r}.\spad{t}. the reduction-test \axiom{redOp?} among the polynomials satisfying property \axiom{pred?},{} if it is empty then leave,{} else reduce the other polyn
642364`--omials 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.
642630`\axiom{rewriteSetWithReduction(lp,{}ts,{}redOp,{}redOp?)} returns a list \axiom{lq} of polynomials such that \axiom{[reduce(\spad{p},{}ts,{}redOp,{}redOp?) for \spad{p} in lp]} and \axiom{lp} have the same zeros inside the regular zero set of \axiom{ts}. Moreover,{} for every polynomial \axiom{\spad{q}} in \axiom{lq} and every polynomial \axiom{\spad{t}} in \axiom{ts} \axiom{redOp?(\spad{q
642630`--},{}\spad{t})} holds and there exists a polynomial \axiom{\spad{p}} in the ideal generated by \axiom{lp} and a product \axiom{\spad{h}} of \axiom{initials(ts)} such that \axiom{h*p - \spad{r}} lies in the ideal generated by \axiom{ts}. The operation \axiom{redOp} must satisfy the following conditions. For every \axiom{\spad{p}} and \axiom{\spad{q}} we have \axiom{redOp?(redOp(\spad{p},{}\spad{q}),{}\spad{q})} and there exists an integer \axiom{\spad{e}} and a polynomial \axiom{\spad{f}} such t
642630`--hat \axiom{init(\spad{q})^e*p = f*q + redOp(\spad{p},{}\spad{q})}.
642745`\spad{rhs(f)} returns the right side of \spad{f}
642788`\spad{rhs(r)} returns the right hand side of the rule \spad{r}.
642836`\spad{rhs(eqn)} returns the right hand side of equation \spad{eqn}.
642874`\spad{rhs(e)} returns the right hand side of the case expression `e'.
642914`\spad{rhs(e)} returns the right hand side of the case expression `e'.
642953`\spad{rhs(e)} returns the right hand side of the is expression `e'.
642991`\spad{rhs(e)} returns the right hand side of the assignment expression `e'.
643030`\spad{rhs(e)} returns the right hand side of the colon expression `e'.
643071`\spad{ricDsolve(op)} returns the rational solutions of the associated Riccati equation of \spad{op y = 0}.
643218`\spad{ricDsolve(op)} returns the rational solutions of the associated Riccati equation of \spad{op y = 0}.
643368`\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.
643534`\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}.
643664`\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.
643833`\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}.
643966`\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.
644115`\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.
644267`\spad{ridHack1(i,j,k,l)} \undocumented
644360`\spad{rightAlternative?()} tests if \spad{2*associator(a,b,b) = 0} for all \spad{a},{} \spad{b} in the algebra. Note: we only can test this; in general we don't know whether \spad{2*a=0} implies \spad{a=0}.
644442`\spad{rightAlternative?()} tests if \spad{2*associator(a,b,b) = 0} for all \spad{a},{} \spad{b} in the algebra. Note: we only can test this; in general we don't know whether \spad{2*a=0} implies \spad{a=0}.
644633`\spad{rightCharacteristicPolynomial(a)} returns the characteristic polynomial of the right regular representation of \spad{a} with respect to any basis.
644748`\spad{rightDiscriminant()} returns the determinant of the \spad{n}-by-\spad{n} matrix whose element at the \spad{i}\spad{-}th row and \spad{j}\spad{-}th column is given by the right trace of the product \spad{vi*vj},{} where \spad{v1},{}...,{}\spad{vn} are the elements of the fixed \spad{R}-module basis. Note: the same as \spad{determinant(rightTraceMatrix())}.
644820`\spad{rightDiscriminant()} returns the determinant of the \spad{n}-by-\spad{n} matrix whose element at the \spad{i}\spad{-}th row and \spad{j}\spad{-}th column is given by the right trace of the product \spad{vi*vj},{} where \spad{v1},{}...,{}\spad{vn} are the elements of the fixed \spad{R}-module basis. Note: the same as \spad{determinant(rightTraceMatrix())}.
645045`\spad{rightDiscriminant([v1,...,vn])} returns the determinant of the \spad{n}-by-\spad{n} matrix whose element at the \spad{i}\spad{-}th row and \spad{j}\spad{-}th column is given by the right trace of the product \spad{vi*vj}. Note: the same as \spad{determinant(rightTraceMatrix([v1,...,vn]))}.
645128`\spad{rightDivide(a,b)} returns the pair \spad{[q,r]} such that \spad{a = q*b + r} and the degree of \spad{r} is less than the degree of \spad{b}. This process is called ``right division''.
645244`\spad{rightDivide(a, b, sigma)} returns the pair \spad{[q,r]} such that \spad{a = q*b + r} and the degree of \spad{r} is less than the degree of \spad{b}. This process is called ``right division''. \spad{\sigma} is the morphism to use.
645469`\spad{rightExactQuotient(a,b)} computes the value \spad{q},{} if it exists such that \spad{a = q*b}.
645686`\spad{rightExtendedGcd(a,b)} returns \spad{[c,d]} such that \spad{g = c * a + d * b = rightGcd(a, b)}.
645813`\spad{rightFactorCandidate(p,n)} \undocumented
645906`\spad{rightFactorIfCan(f,d,c)} returns a candidate to be the right factor (\spad{h} in \spad{f} = \spad{g} \spad{o} \spad{h}) of degree \spad{d} with leading coefficient \spad{c} of a functional decomposition of the polynomial \spad{f} or \spad{"failed"} if no such candidate.
646096`\spad{rightGcd(a,b)} computes the value \spad{g} of highest degree such that \indented{3}{\spad{a = aa*g}} \indented{3}{\spad{b = bb*g}} for some values \spad{aa} and \spad{bb}. The value \spad{g} is computed using right-division.
646245`\spad{rightLcm(a,b)} computes the value \spad{m} of lowest degree such that \spad{m = a*aa = b*bb} for some values \spad{aa} and \spad{bb}. The value \spad{m} is computed using left-division.
646433`\spad{rightMinimalPolynomial(a)} returns the polynomial determined by the smallest non-trivial linear combination of right powers of \spad{a}. Note: the polynomial never has a constant term as in general the algebra has no unit.
646562`\spad{rightMult(a, s)} returns \spad{a * s} where \spad{*} is the monoid operation,{} which is assumed non-commutative.
646683`\spad{rightNorm(a)} returns the determinant of the right regular representation of \spad{a}.
646750`\spad{rightOne(eq)} divides by the right hand side.
646822`\spad{rightOne(eq)} divides by the right hand side.
647073`\spad{rightPower(a,n)} returns the \spad{n}\spad{-}th right power of \spad{a},{} \spadignore{i.e.} \spad{rightPower(a,n) := rightPower(a,n-1) * a} and \spad{rightPower(a,0) := 1}.
647140`\spad{rightPower(a,n)} returns the \spad{n}\spad{-}th right power of \spad{a},{} \spadignore{i.e.} \spad{rightPower(a,n) := rightPower(a,n-1) * a} and \spad{rightPower(a,1) := a}.
647267`\spad{rightQuotient(a,b)} computes the pair \spad{[q,r]} such that \spad{a = q*b + r} and the degree of \spad{r} is less than the degree of \spad{b}. The value \spad{q} is returned.
647355`\spad{rightRankPolynomial()} returns the right minimimal polynomial of the generic element
647509`\spad{rightRankPolynomial()} calculates the right minimal polynomial of the generic element in the algebra,{} defined by the same structural constants over the polynomial ring in symbolic coefficients with respect to the fixed basis.
647623`\spad{rightRankPolynomial()} calculates the right minimal polynomial of the generic element in the algebra,{} defined by the same structural constants over the polynomial ring in symbolic coefficients with respect to the fixed basis.
647746`\spad{rightRank(x)} determines the number of linearly independent elements in \spad{b1*x},{}...,{}\spad{bn*x},{} where \spad{b=[b1,...,bn]} is a basis.
647895`\spad{rightRecip(a)} returns an element,{} which is a right inverse of \spad{a},{} or \spad{"failed"} if there is no unit element,{} if such an element doesn't exist or cannot be determined (see unitsKnown).
648001`\spad{rightRecip(a)} returns an element,{} which is a right inverse of \spad{a},{} or \spad{"failed"} if such an element doesn't exist or cannot be determined (see unitsKnown).
648150`\spad{rightRegularRepresentation(a)} returns the matrix of the linear map defined by right multiplication by \spad{a} with respect to the fixed \spad{R}-module basis.
648432`\spad{rightRegularRepresentation(a,[v1,...,vn])} returns the matrix of the linear map defined by right multiplication by \spad{a} with respect to the \spad{R}-module basis \spad{[v1,...,vn]}.
648607`\spad{rightRemainder(a,b)} computes the pair \spad{[q,r]} such that \spad{a = q*b + r} and the degree of \spad{r} is less than the degree of \spad{b}. The value \spad{r} is returned.
648696`\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.
648799`\spad{rightTraceMatrix()} is the \spad{n}-by-\spad{n} matrix whose element at the \spad{i}\spad{-}th row and \spad{j}\spad{-}th column is given by the right trace of the product \spad{vi*vj},{} where \spad{v1},{}...,{}\spad{vn} are the elements of the fixed \spad{R}-module basis.
648878`\spad{rightTraceMatrix()} is the \spad{n}-by-\spad{n} matrix whose element at the \spad{i}\spad{-}th row and \spad{j}\spad{-}th column is given by the right trace of the product \spad{vi*vj},{} where \spad{v1},{}...,{}\spad{vn} are the elements of the fixed \spad{R}-module basis.
649124`\spad{rightTraceMatrix([v1,...,vn])} is the \spad{n}-by-\spad{n} matrix whose element at the \spad{i}\spad{-}th row and \spad{j}\spad{-}th column is given by the right trace of the product \spad{vi*vj}.
649279`\spad{rightTrace(a)} returns the trace of the right regular representation of \spad{a}.
649347`\spad{rightTrim(s,c)} returns \spad{s} with all trailing occurrences of \spad{c} deleted. For example,{} \axiom{rightTrim(" abc ",{} char " ")} returns \axiom{" abc"}.
649406`\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"}.
649545`\spad{rightUnit()} returns a right unit of the algebra (not necessarily unique),{} or \spad{"failed"} if there is none.
649757`\spad{rightUnits()} returns the affine space of all right units of the algebra,{} or \spad{"failed"} if there is none
649882`\spad{rightUnits()} returns the affine space of all right units of the algebra,{} or \spad{"failed"} if there is none.
650020`\spad{rightZero(eq)} subtracts the right hand side.
650084`\axiom{right(\spad{x})} returns right subtree of \axiom{\spad{x}} or error if \axiomOpFrom{retractable?}{LyndonWord}(\axiom{\spad{x}}) is \spad{true}.
650132`\axiom{right(\spad{x})} returns right subtree of \axiom{\spad{x}} or error if \axiomOpFrom{retractable?}{Magma}(\axiom{\spad{x}}) is \spad{true}.
650175`\spad{right(f)} right-justifies form \spad{f} in total space.
650215`\axiom{right(rootChar)} is the right bound of the isolating interval
650308`\spad{right(a)} returns the right child.
650365`\spad{right(f,n)} right-justifies form \spad{f} within space of width \spad{n}.
650413`\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}
650413`-- is a limited integration function,{} and ext is an extended integration function.
650655`\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 ext
650655`--ended integration function.
650897`\spad{rischNormalize(f, x)} returns \spad{[g, [k1,...,kn], [h1,...,hn]]} such that \spad{g = normalize(f, x)} and each \spad{ki} was rewritten as \spad{hi} during the normalization.
651027`\spad{rk4(y,n,x1,h,derivs)} uses a 4-th order Runge-Kutta method to numerically integrate the ordinary differential equation {\em dy/dx = f(y,x)} of \spad{n} variables,{} where \spad{y} is an \spad{n}-vector. Argument \spad{y} is a vector of initial conditions of length \spad{n} which upon exit contains the solution at \spad{x1 + h},{} \spad{n} is the number of de
651027`--pendent variables,{} \spad{x1} is the initial point,{} \spad{h} is the step size,{} and \spad{derivs} is a function which computes the right hand side of the ordinary differential equation. For details,{} see \spadtype{NumericalOrdinaryDifferentialEquations}.
651168`\spad{rk4(y,n,x1,h,derivs,t1,t2,t3,t4)} is the same as \spad{rk4(y,n,x1,h,derivs)} except that you must provide 4 scratch arrays \spad{t1}-\spad{t4} of size \spad{n}. For details,{} see \con{NumericalOrdinaryDifferentialEquations}.
651366`\spad{rk4a(y,n,x1,x2,eps,h,ns,derivs)} is a driver function for the numerical integration of an ordinary differential equation {\em dy/dx = f(y,x)} of \spad{n} variables,{} where \spad{y} is an \spad{n}-vector using a 4-th order Runge-Kutta method. For details,{} see \con{NumericalOrdinaryDifferentialEquations}.
651529`\spad{rk4f(y,n,x1,x2,ns,derivs)} uses a 4-th order Runge-Kutta method to numerically integrate the ordinary differential equation {\em dy/dx = f(y,x)} of \spad{n} variables,{} where \spad{y} is an \spad{n}-vector. Starting with \spad{y} at \spad{x1},{} this function uses \spad{ns} fixed steps of a 4-th order Runge-Kutta integrator to advance the solution 
651529`--vector to \spad{x2} and return the values in \spad{y}. For details,{} see \con{NumericalOrdinaryDifferentialEquations}.
651680`\spad{rk4qc(y,n,x1,step,eps,yscal,derivs,t1,t2,t3,t4,t5,t6,t7)} is a subfunction for the numerical integration of an ordinary differential equation {\em dy/dx = f(y,x)} of \spad{n} variables,{} where \spad{y
651680`--} is an \spad{n}-vector using a 4-th order Runge-Kutta method. This function takes a 5-th order Runge-Kutta \spad{step} with monitoring of local truncation to ensure accuracy and adjust stepsize. For details,{} see \con{NumericalOrdinaryDifferentialEquations}.
651981`\spad{rk4qc(y,n,x1,step,eps,yscal,derivs)} is a subfunction for the numerical integration of an ordinary differential equation {\em dy/dx = f(y,x)} of \spad{n} variables,{} where \spad{y} is an \spad{n}-vector using a 4-th order Runge-Kutta method. This function takes a 5-th order Runge-Kutta \spad{step} 
651981`--with monitoring of local truncation to ensure accuracy and adjust stepsize. For details,{} see \con{NumericalOrdinaryDifferentialEquations}.
652183`\spad{roman(n)} creates a roman numeral for \spad{n}.
652231`\spad{roman(n)} creates a roman numeral for symbol \spad{n}.
652278`\spad{romberg(fn,a,b,epsrel,epsabs,nmin,nmax)} uses the romberg method to numerically integrate function \spadvar{\spad{fn}} over the closed interval \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin} to \spad{nmax}. Th
652278`--e value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
652444`\spad{rombergo(fn,a,b,epsrel,epsabs,nmin,nmax)} uses the romberg method to numerically integrate function \spad{fn} over the open interval from \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin} to \spad{nmax}. The val
652444`--ue returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
652611`\spad{root?(x)} \undocumented
652660`\spad{rootBound(p)} returns a bound on the largest norm of the complex roots of \spad{p}.
652741`\spad{rootDirectory()} returns the pathname of the root directory for the running OpenAxiom system.
652788`\spad{rootKerSimp(op,f,n)} should be local but conditional.
652957`\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}.
653043`\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}.
653522`\spad{rootOf(p)} returns \spad{y} such that \spad{p(y) = 0}. Error: if \spad{p} has more than one variable \spad{y}.
653590`\spad{rootOf(p)} returns \spad{y} such that \spad{p(y) = 0}.
653674`\spad{rootOf(p)} returns \spad{y} such that \spad{p(y) = 0}. Error: if \spad{p} has more than one variable \spad{y}.
653810`\spad{rootOf(p, y)} returns \spad{y} such that \spad{p(y) = 0}. The object returned displays as \spad{'y}.
654299`\axiom{rootOf(pol,{}\spad{n})} creates the \spad{n}th root for the order of \axiom{pol} and gives it unique name
654406`\spad{rootOf(p, y)} returns \spad{y} such that \spad{p(y) = 0}. The object returned displays as \spad{'y}.
654497`\axiom{rootOf(pol,{}\spad{n})} gives the \spad{n}th root for the order of the Real Closure
654616`\spad{rootOf(p,y)} returns \spad{y} such that \spad{p(y) = 0}. The object returned displays as \spad{'y}.
654804`\axiom{rootOf(pol,{}\spad{n},{}name)} creates the \spad{n}th root for the order of \axiom{pol} and names it \axiom{name}
654922`\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}.
655075`\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.
655209`\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.
655345`\spad{rootRadius(p)} calculates the root radius of \spad{p} with a maximal error quotient of {\em 1+globalEps},{} where {\em globalEps} is the internal error bound,{} which can be set by {\em setErrorBound}.
655411`\spad{rootRadius(p,errQuot)} calculates the root radius of \spad{p} with a maximal error quotient of {\em errQuot}.
655479`\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}.
655612`\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}.
655672`\spad{root(f)} creates a form for the square root of form \spad{f}.
655712`\spad{root(f,n)} creates a form for the \spad{n}th root of form \spad{f}.
655755`\spad{root(f,a)} returns a root of the polynomial \spad{f}. Argument \spad{a} must be a root of \spad{f} \spad{(mod p)}.
656254`\spad{rootsOf(p)} returns \spad{[y1,...,yn]} such that \spad{p(yi) = 0}. Note: the returned symbols \spad{y1},{}...,{}yn are bound in the interpreter to respective root values. Error: if \spad{p} has more than one variable \spad{y}.
656329`\spad{rootsOf(p)} returns \spad{[y1,...,yn]} such that \spad{p(yi) = 0}. Note: the returned symbols \spad{y1},{}...,{}yn are bound in the interpreter to respective root values.
656420`\spad{rootsOf(p, y)} returns \spad{[y1,...,yn]} such that \spad{p(yi) = 0}; Note: the returned symbols \spad{y1},{}...,{}yn are bound in the interpreter to respective root values. Error: if \spad{p} has more than one variable \spad{y}.
656768`\spad{rootsOf(p, y)} returns \spad{[y1,...,yn]} such that \spad{p(yi) = 0}; The returned roots display as \spad{'y1},{}...,{}\spad{'yn}. Note: the returned symbols \spad{y1},{}...,{}yn are bound in the interpreter to respective root values.
656866`\spad{rootsOf(p, y)} returns \spad{[y1,...,yn]} such that \spad{p(yi) = 0}; The returned roots display as \spad{'y1},{}...,{}\spad{'yn}. Note: the returned symbols \spad{y1},{}...,{}yn are bound in the interpreter to respective root values.
656947`\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})).
656997`\spad{rotate(v,th,phi)} rotates the graph to the longitudinal view angle \spad{th} radians and the latitudinal view angle \spad{phi} radians for the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport}.
657067`\spad{rotate(v,th,phi)} rotates the graph to the longitudinal view angle \spad{th} degrees and the latitudinal view angle \spad{phi} degrees for the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport}. The new rotation position is not displayed until the function \spadfun{makeViewport3D} is executed again for \spad{v}.
657141`\spad{rotatex(r)} returns a dhmatrix for rotation about axis \spad{X} for \spad{r} degrees
657199`\spad{rotatey(r)} returns a dhmatrix for rotation about axis \spad{Y} for \spad{r} degrees
657257`\spad{rotatez(r)} returns a dhmatrix for rotation about axis \spad{Z} for \spad{r} degrees
657387`\axiom{roughBase?(ps)} returns \spad{true} iff for every pair \axiom{{\spad{p},{}\spad{q}}} of polynomials in \axiom{ps} their leading monomials are relatively prime.
657484`\axiom{roughBasicSet(lp)} returns the smallest (with Ritt-Wu ordering) triangular set contained in \axiom{lp}.
657714`\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.
657899`\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.
658080`\axiom{roughUnitIdeal?(ps)} returns \spad{true} iff \axiom{ps} contains some non null element lying in the base ring \axiom{\spad{R}}.
658225`\spad{round x} computes the integer closest to \spad{x}.
658272`\spad{routines()} initialises a database of known NAG routines
658317`\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.
658401`\spad{rowEch(m)} computes a modular row-echelon form of \spad{m},{} finding an appropriate modulus.
658478`\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.
658568`\spad{rowEchelon(m)} returns the row echelon form of the matrix \spad{m}. the result will have entries in the quotient field.
658665`\spad{rowEchelon(m)} returns the row echelon form of the matrix \spad{m}.
658745`\spad{rowEchelon(m)} returns the row echelon form of the matrix \spad{m}.
658842`\spad{rowEchelon(m)} returns the row echelon form of the matrix \spad{m}.
658925`\spad{rowEchelon(m)} returns the row echelon form of the matrix \spad{m}.
659023`\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}.
659178`\spad{row(m,i)} returns the \spad{i}th row of the matrix \spad{m}. Error: if the index is outside the proper range.
659256`\spad{row(m,i)} returns the \spad{i}th row of \spad{m} error check to determine if index is in proper ranges
659332`\spad{rquo(x, s)} returns the exact right quotient of \spad{x} by \spad{s}.
659400`\spad{rquo(x, y)} returns the exact right quotient of \spad{x} by \spad{y} \spadignore{i.e.} \spad{q} such that \spad{x = q * y},{} "failed" if \spad{x} is not of the form \spad{q * y}.
659470`\axiom{rquo(\spad{x},{}\spad{y})} returns the right simplification of \axiom{\spad{x}} by \axiom{\spad{y}}.
659583`\spad{rquo(x,w)} returns the right simplification of \spad{x} by \spad{w}.
659653`\spad{rquo(x,y)} returns the right simplification of \spad{x} by \spad{y}.
659704`\spad{rquo(x,v)} returns the right simplification of \spad{x} by the variable \spad{v}.
659755`\spad{rroot(f, n)} returns \spad{[m,c,r]} such that \spad{f**(1/n) = c * r**(1/m)}.
659881`\spad{rspace(n,m)} creates rectangular white space,{} \spad{n} wide by \spad{m} high.
659936`\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.
659987`\spad{rubiksGroup constructs} the permutation group representing Rubic's Cube acting on integers {\em 10*i+j} for {\em 1 <= i <= 6},{} {\em 1 <= j <= 8}. The faces of Rubik's Cube are labelled in the obvious way Front,{} Right,{} Up,{} Down,{} Left,{} Back and numbered from 1 to 6 in this given ordering,{} the pieces on each face (except the unmoveable center piece) are clockwise numbered from 1 to 8 starting with the piec
659987`--e in the upper left corner. The moves of the cube are represented as permutations on these pieces,{} represented as a two digit integer {\em ij} where \spad{i} is the numer of theface (1 to 6) and \spad{j} is the number of the piece on this face. The remaining ambiguities are resolved by looking at the 6 generators,{} which represent a 90 degree turns of the faces,{} or from the following pictorial description. Permutation group representing Rubic's Cube acting on integers 10*i+j for 1 <= \spa
659987`--d{i} <= 6,{} 1 <= \spad{j} \spad{<=8}. \blankline\begin{verbatim}Rubik's Cube:   +
659987`--
659987`---+ +
659987`-- B   where: marks Side # :               / U   /|/              /     / |         F(ront)    <->    1      L 
659987`-->  +
659987`--
659987`---+ R|         R(ight)    <->    2             |     |  +         U(p)       <->    3             |  F  | /          D(own)     <->    4             |     |/           L(eft)     <->    5             +
659987`--
659987`---+            B(ack)     <->    6                ^                |    
659987`--            DThe Cube's surface:                               The pieces on each side            +
659987`---+              (except the unmoveable center            |567|              piece) are clockwise numbered            |4U8|              from 1 to 8 starting with the            |321|              piece in the upper left        +
659987`---+
659987`---+
659987`---+          corner (see figure on the        |781|123|345|          left).  The moves of the cube        |6L2|8F4|2R6|          are represented as 
659987`--       |543|765|187|          permutations on these pieces.        +
659987`---+
659987`---+
659987`---+          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            +
659987`---+              F to B (see table above ))            |567|              and j is the # of the piece.            |4B8|            |321|            +
659987`---+\end{verbatim}
660069`\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}.
660121`\spad{rule(f, g, [f1,...,fn])} creates the rewrite rule \spad{f == eval(eval(g, g is f), [f1,...,fn])},{} that is a rule with left-hand side \spad{f} and right-hand side \spad{g}; The symbols \spad{f1},{}...,{}fn are the operators that are considered quoted,{} that is they are not evaluated during any rewrite,{} but just applied formally to their arguments.
660186`\spad{rules(r)} returns the rules contained in \spad{r}.
660259`\spad{ruleset([r1,...,rn])} creates the rule set \spad{{r1,...,rn}}.
660334`\spad{rur(lp)} returns the same as \spad{rur(lp,true)}
660511`\spad{rur(lp,univ?)} returns a rational univariate representation of \spad{lp}. This assumes that \spad{lp} defines a regular triangular \spad{ts} whose associated variety is zero-dimensional over \spad{R}. \spad{rur(lp,univ?)} returns a list of items \spad{[u,lc]} where \spad{u} is an irreducible univariate polynomial an
660511`--d each \spad{c} in \spad{lc} involves two variables: one from \spad{ls},{} called the coordinate of \spad{c},{} and an extra variable which represents any root of \spad{u}. Every root of \spad{u} leads to a tuple of values for the coordinates of \spad{lc}. Moreover,{} a point \spad{x} belongs to the variety associated with \spad{lp} iff there exists an item \spad{[u,lc]} in \spad{rur(lp,univ?)} and a root \spad{r} of \spad{u} such that \spad{x} is given by the tuple of values for the coordinat
660511`--es of \spad{lc} evaluated at \spad{r}. If \spad{univ?} is \spad{true} then each polynomial \spad{c} will have a constant leading coefficient \spad{w}.\spad{r}.\spad{t}. its coordinate. See the example which illustrates the \spadtype{ZeroDimensionalSolvePackage} package constructor.
660696`\spad{rur(ts,univ?)} returns a rational univariate representation of \spad{ts}. This assumes that the lowest polynomial in \spad{ts} is a variable \spad{v} which does not occur in the other polynomials of \spad{ts}. This variable will be used to define the simple algebraic extension over which these other polynomials will be rewritten as univariate polynomials with degree one. If \spad{univ?} is \spad{t
660696`--rue} then these polynomials will have a constant initial.
660798`\spad{rur(lp,univ?,check?)} returns the same as \spad{rur(lp,true)}. Moreover,{} if \spad{check?} is \spad{true} then the result is checked.
660991`\spad{s01eaf(z,ifail)} S01EAF evaluates the exponential function exp(\spad{z}) ,{} for complex \spad{z}. See \downlink{Manual Page}{manpageXXs01eaf}.
661079`\spad{s13aaf(x,ifail)} returns the value of the exponential integral \indented{1}{\spad{E} (\spad{x}),{} via the routine name.} \indented{2}{1} See \downlink{Manual Page}{manpageXXs13aaf}.
661158`\spad{s13acf(x,ifail)} returns the value of the cosine integral See \downlink{Manual Page}{manpageXXs13acf}.
661237`\spad{s13adf(x,ifail)} returns the value of the sine integral See \downlink{Manual Page}{manpageXXs13adf}.
661316`\spad{s14aaf(x,ifail)} returns the value of the Gamma function (Gamma)(\spad{x}),{} via the routine name. See \downlink{Manual Page}{manpageXXs14aaf}.
661395`\spad{s14abf(x,ifail)} returns a value for the log,{} ln(Gamma(\spad{x})),{} via the routine name. See \downlink{Manual Page}{manpageXXs14abf}.
661474`\spad{s14baf(a,x,tol,ifail)} computes values for the incomplete gamma functions \spad{P}(a,{}\spad{x}) and \spad{Q}(a,{}\spad{x}). See \downlink{Manual Page}{manpageXXs14baf}.
661577`\spad{s15adf(x,ifail)} returns the value of the complementary error function,{} erfc(\spad{x}),{} via the routine name. See \downlink{Manual Page}{manpageXXs15adf}.
661656`\spad{s15aef(x,ifail)} returns the value of the error function erf(\spad{x}),{} via the routine name. See \downlink{Manual Page}{manpageXXs15aef}.
661735`\spad{s17acf(x,ifail)} returns the value of the Bessel Function \indented{1}{\spad{Y} (\spad{x}),{} via the routine name.} \indented{2}{0} See \downlink{Manual Page}{manpageXXs17acf}.
661814`\spad{s17adf(x,ifail)} returns the value of the Bessel Function \indented{1}{\spad{Y} (\spad{x}),{} via the routine name.} \indented{2}{1} See \downlink{Manual Page}{manpageXXs17adf}.
661893`\spad{s17aef(x,ifail)} returns the value of the Bessel Function \indented{1}{\spad{J} (\spad{x}),{} via the routine name.} \indented{2}{0} See \downlink{Manual Page}{manpageXXs17aef}.
661972`\spad{s17aff(x,ifail)} returns the value of the Bessel Function \indented{1}{\spad{J} (\spad{x}),{} via the routine name.} \indented{2}{1} See \downlink{Manual Page}{manpageXXs17aff}.
662051`\spad{s17agf(x,ifail)} returns a value for the Airy function,{} \spad{Ai}(\spad{x}),{} via the routine name. See \downlink{Manual Page}{manpageXXs17agf}.
662130`\spad{s17ahf(x,ifail)} returns a value of the Airy function,{} \spad{Bi}(\spad{x}),{} via the routine name. See \downlink{Manual Page}{manpageXXs17ahf}.
662209`\spad{s17ajf(x,ifail)} returns a value of the derivative of the Airy function \spad{Ai}(\spad{x}),{} via the routine name. See \downlink{Manual Page}{manpageXXs17ajf}.
662288`\spad{s17akf(x,ifail)} returns a value for the derivative of the Airy function \spad{Bi}(\spad{x}),{} via the routine name. See \downlink{Manual Page}{manpageXXs17akf}.
662367`\spad{s17dcf(fnu,z,n,scale,ifail)} returns a sequence of values for the Bessel functions \indented{1}{\spad{Y}\space{6}(\spad{z}) for complex \spad{z},{} non-negative (nu) and \spad{n=0},{}1,{}...,{}\spad{N}-1,{}} \indented{2}{(nu)+n} with an option for exponential scaling. See \downlink{Manual Page}{manpageXXs17dcf}.
662482`\spad{s17def(fnu,z,n,scale,ifail)} returns a sequence of values for the Bessel functions \indented{1}{\spad{J}\space{6}(\spad{z}) for complex \spad{z},{} non-negative (nu) and \spad{n=0},{}1,{}...,{}\spad{N}-1,{}} \indented{2}{(nu)+n} with an option for exponential scaling. See \downlink{Manual Page}{manpageXXs17def}.
662597`\spad{s17dgf(deriv,z,scale,ifail)} returns the value of the Airy function \spad{Ai}(\spad{z}) or its derivative Ai'(\spad{z}) for complex \spad{z},{} with an option for exponential scaling. See \downlink{Manual Page}{manpageXXs17dgf}.
662699`\spad{s17dhf(deriv,z,scale,ifail)} returns the value of the Airy function \spad{Bi}(\spad{z}) or its derivative Bi'(\spad{z}) for complex \spad{z},{} with an option for exponential scaling. See \downlink{Manual Page}{manpageXXs17dhf}.
662801`\spad{s17dlf(m,fnu,z,n,scale,ifail)} returns a sequence of values for the Hankel functions \indented{2}{(1)\space{11}(2)} \indented{1}{\spad{H}\space{6}(\spad{z}) or \spad{H}\space{6}(\spad{z}) for complex \spad{z},{} non-negative (nu) and} \indented{2}{(nu)+n\space{8}(nu)+n} \spad{n=0},{}1,{}...,{}\spad{N}-1,{} with an option for exponential scaling. See \downlink{Manual Page}{manp
662801`--ageXXs17dlf}.
662924`\spad{s18acf(x,ifail)} returns the value of the modified Bessel Function \indented{1}{\spad{K} (\spad{x}),{} via the routine name.} \indented{2}{0} See \downlink{Manual Page}{manpageXXs18acf}.
663003`\spad{s18adf(x,ifail)} returns the value of the modified Bessel Function \indented{1}{\spad{K} (\spad{x}),{} via the routine name.} \indented{2}{1} See \downlink{Manual Page}{manpageXXs18adf}.
663082`\spad{s18aef(x,ifail)} returns the value of the modified Bessel Function \indented{1}{\spad{I} (\spad{x}),{} via the routine name.} \indented{2}{0} See \downlink{Manual Page}{manpageXXs18aef}.
663161`\spad{s18aff(x,ifail)} returns a value for the modified Bessel Function \indented{1}{\spad{I} (\spad{x}),{} via the routine name.} \indented{2}{1} See \downlink{Manual Page}{manpageXXs18aff}.
663240`\spad{s18dcf(fnu,z,n,scale,ifail)} returns a sequence of values for the modified Bessel functions \indented{1}{\spad{K}\space{6}(\spad{z}) for complex \spad{z},{} non-negative (nu) and} \indented{2}{(nu)+n} \spad{n=0},{}1,{}...,{}\spad{N}-1,{} with an option for exponential scaling. See \downlink{Manual Page}{manpageXXs18dcf}.
663355`\spad{s18def(fnu,z,n,scale,ifail)} returns a sequence of values for the modified Bessel functions \indented{1}{\spad{I}\space{6}(\spad{z}) for complex \spad{z},{} non-negative (nu) and} \indented{2}{(nu)+n} \spad{n=0},{}1,{}...,{}\spad{N}-1,{} with an option for exponential scaling. See \downlink{Manual Page}{manpageXXs18def}.
663470`\spad{s19aaf(x,ifail)} returns a value for the Kelvin function ber(\spad{x}) via the routine name. See \downlink{Manual Page}{manpageXXs19aaf}.
663549`\spad{s19abf(x,ifail)} returns a value for the Kelvin function bei(\spad{x}) via the routine name. See \downlink{Manual Page}{manpageXXs19abf}.
663628`\spad{s19acf(x,ifail)} returns a value for the Kelvin function ker(\spad{x}),{} via the routine name. See \downlink{Manual Page}{manpageXXs19acf}.
663707`\spad{s19adf(x,ifail)} returns a value for the Kelvin function kei(\spad{x}) via the routine name. See \downlink{Manual Page}{manpageXXs19adf}.
663786`\spad{s20acf(x,ifail)} returns a value for the Fresnel Integral \spad{S}(\spad{x}),{} via the routine name. See \downlink{Manual Page}{manpageXXs20acf}.
663865`\spad{s20adf(x,ifail)} returns a value for the Fresnel Integral \spad{C}(\spad{x}),{} via the routine name. See \downlink{Manual Page}{manpageXXs20adf}.
663944`\spad{s21baf(x,y,ifail)} returns a value of an elementary integral,{} which occurs as a degenerate case of an elliptic integral of the first kind,{} via the routine name. See \downlink{Manual Page}{manpageXXs21baf}.
664035`\spad{s21bbf(x,y,z,ifail)} returns a value of the symmetrised elliptic integral of the first kind,{} via the routine name. See \downlink{Manual Page}{manpageXXs21bbf}.
664138`\spad{s21bcf(x,y,z,ifail)} returns a value of the symmetrised elliptic integral of the second kind,{} via the routine name. See \downlink{Manual Page}{manpageXXs21bcf}.
664241`\spad{s21bdf(x,y,z,r,ifail)} returns a value of the symmetrised elliptic integral of the third kind,{} via the routine name. See \downlink{Manual Page}{manpageXXs21bdf}.
664356`\spad{sPol }\undocumented
664498`\spad{safeCeiling(x)} returns the integer which is greater than any integer with the same floating point number representation.
664588`\spad{safeFloor(x)} returns the integer which is lower or equal to the largest integer which has the same floating point number representation.
664676`\spad{safetyMargin()} returns the number of low weight digits we do not trust in the floating point representation (used by \spadfun{safeCeiling}).
664777`\spad{safetyMargin(n)} sets to \spad{n} the number of low weight digits we do not trust in the floating point representation and returns the previous value (for use by \spadfun{safeCeiling}).
665120`\spad{sample} gives a sample datum of this type.
665166`\spad{sample} gives a sample datum of type Byte.
665342`\spad{sample yields} a value of type \%
665385`\spad{sample yields} a value of type \%
665424`\spad{sample yields} a value of type \%
665460`\spad{sample} gives a sample datum of type Byte.
665494`\spad{sample()} returns an object of type \%.
665552`\spad{sample()} returns a sample of \%
665588`\spad{satisfy?(v, p)} returns \spad{f}(\spad{v}) where \spad{f} is the predicate attached to \spad{p}.
665659`\spad{satisfy?([v1,...,vn], p)} returns \spad{f(v1,...,vn)} where \spad{f} is the top-level predicate attached to \spad{p}.
665736`\spad{satisfy?(r, p)} returns \spad{true} if the matches satisfy the top-level predicate of \spad{p},{} \spad{false} if they don't,{} and "failed" if not enough variables of \spad{p} are matched in \spad{r} to decide.
665825`\spad{saturate(I,f)} is the saturation of the ideal \spad{I} with respect to the multiplicative set generated by the polynomial \spad{f}.
665903`\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]}.
665994`\spad{save()} creates a representation of a SAVE statement.
666033`\spad{sayLength(l)} returns the length of a list of strings \spad{l} as an integer.
666097`\spad{sayLength(s)} returns the length of a string \spad{s} as an integer.
666155`\spad{say(l)} sends a list of strings \spad{l} to output.
666210`\spad{say(s)} sends a string \spad{s} to output.
666259`\spad{scalarMatrix(r)} returns an \spad{n}-by-\spad{n} matrix with \spad{r}'s on the diagonal and zeroes elsewhere.
666409`\spad{scalarMatrix(n,r)} returns an \spad{n}-by-\spad{n} matrix with \spad{r}'s on the diagonal and zeroes elsewhere.
666490`\spad{scalarTypeOf(t)} returns the FORTRAN data type of \spad{t}
666577`\spad{scaleRoots(p,c)} returns the polynomial which has \spad{c} times the roots of \spad{p}.
666651`\spad{scale(k)} returns \spad{matrix [[k,0],[0,1]]} representing the map \spad{x -> k * x}.
666700`\spad{scale(m,h)} returns \spad{scale(h) * m} (see \spadfunFrom{shift}{MoebiusTransform}).
666752`\spad{scale(sx,sy,sz)} returns a dhmatrix for scaling in the \spad{X},{} \spad{Y} and \spad{Z} directions
666812`\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.
666895`\spad{scanOneDimSubspaces(basis,n)} gives a canonical representative of the {\em n}\spad{-}th one-dimensional subspace of the vector space generated by the elements of {\em basis},{} all from {\em R**n}. The coefficients of the representative are of shape {\em (0,...,0,1,*,...,*)},{} {\em *} in \spad{R}. If the size of \spad{R} is \spad{q},{} then there are {\em (q**n-1)/(q-1)
666895`--} of them. We first reduce \spad{n} modulo this number,{} then find the largest \spad{i} such that {\em +/[q**i for i in 0..i-1] <= n}. Subtracting this sum of powers from \spad{n} results in an \spad{i}-digit number to \spad{basis} \spad{q}. This fills the positions of the stars.
667024`\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}.
667133`\spad{scan(fn,u,ident)} successively uses the binary function \spad{fn} to reduce more and more of list \spad{u}. \spad{ident} is returned if the \spad{u} is empty. The result is a list of the reductions at each step. See \spadfun{reduce} for more information. Examples: \spad{scan(fn,[1,2],0) = [fn(2,fn(1,0)),fn(1,0)]} and \spad{scan(*,[2,3],1) = [2 * 1, 3 * (2 * 1)]}.
667203`\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),...]}.
667318`\spad{scan(f,a,r)} successively applies \spad{reduce(f,x,r)} to more and more leading sub-arrays \spad{x} of primitive array \spad{a}. More precisely,{} if \spad{a} is \spad{[a1,a2,...]},{} then \spad{scan(f,a,r)} returns \spad{[reduce(f,[a1],r),reduce(f,[a1,a2],r),...]}.
667418`\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}.
667494`\spad{scan(f,a,r)} successively applies \spad{reduce(f,x,r)} to more and more leading sub-aggregates \spad{x} of aggregrate \spad{a}. More precisely,{} if \spad{a} is \spad{[a1,a2,...]},{} then \spad{scan(f,a,r)} returns \spad{[reduce(f,[a1],r),reduce(f,[a1,a2],r),...]}.
667573`\spad{scan(f,a,r)} successively applies \spad{reduce(f,x,r)} to more and more leading sub-aggregates \spad{x} of aggregate \spad{a}. More precisely,{} if \spad{a} is \spad{[a1,a2,...]},{} then \spad{scan(f,a,r)} returns \spad {[reduce(f,[a1],r),reduce(f,[a1,a2],r),...]}.
667649`\spad{scan(b,h,[x0,x1,x2,...])} returns \spad{[y0,y1,y2,...]},{} where \spad{y0 = h(x0,b)},{} \spad{y1 = h(x1,y0)},{}\spad{...} \spad{yn = h(xn,y(n-1))}.
667725`\axiom{schema(\spad{P},{}\spad{Q})} returns the list of degrees of non zero subresultants of \axiom{\spad{P}} and \axiom{\spad{Q}}.
667817`\spad{schwerpunkt(p)} determines the 'Schwerpunkt' of the roots of the polynomial \spad{p} of degree \spad{n},{} \spadignore{i.e.} the center of gravity,{} which is {\em coeffient of \spad{x**(n-1)}} divided by {\em n times coefficient of \spad{x**n}}.
667893`\spad{scopes(e)} returns the stack of scopes in environment \spad{e}.
667945`\spad{screenResolution3D()} returns the screen resolution for a 3d graph.
667998`\spad{screenResolution()} returns the screen resolution
668047`\spad{screenResolution()} returns the screen resolution \spad{n}.
668108`\spad{screenResolution(n)} sets the screen resolution to \spad{n}.
668176`\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,[],[]])}.
668237`\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}.
668395`\spad{scripted?(s)} is \spad{true} if \spad{s} has been given any scripts.
668441`\spad{scripts(s)} returns all the scripts of \spad{s}.
668597`\spad{scripts(f, [sub, super, presuper, presub])} \indented{1}{creates a form for \spad{f} with scripts on all 4 corners.}
668649`\spad{sdf2lst(ln)} coerces a Stream of \axiomType{DoubleFloat} to \axiomType{List}(\axiomType{String})
668738`\spad{sdf2lst(ln)} coerces a \axiomType{Stream DoubleFloat} to \axiomType{String}
668822`\spad{sdf2lst(ln)} coerces a Stream of \axiomType{DoubleFloat} to \axiomType{List String}
668898`\spad{se2rfi(l)} converts \spad{l} to target domain
669008`\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".
669089`\spad{sec2cos(f)} converts every \spad{sec(u)} appearing in \spad{f} into \spad{1/cos(u)}.
669152`\spad{secIfCan(z)} returns sec(\spad{z}) if possible,{} and "failed" otherwise.
669233`\spad{sec(x)} applies the secant operator to \spad{x}
669397`\spad{sec(st)} computes secant of a power series \spad{st}.
669481`\spad{sec(st)} computes secant of a power series \spad{st}.
669579`\spad{sec(z)} returns the secant of Laurent series \spad{z}.
669666`\spad{sec(z)} returns the secant of a Puiseux series \spad{z}.
669762`\spad{sec(x)} returns the secant of \spad{x}.
669820`\spad{sech2cosh(f)} converts every \spad{sech(u)} appearing in \spad{f} into \spad{1/cosh(u)}.
669885`\spad{sechIfCan(z)} returns sech(\spad{z}) if possible,{} and "failed" otherwise.
669967`\spad{sech(x)} applies the hyperbolic secant operator to \spad{x}
670131`\spad{sech(st)} computes the hyperbolic secant of a power series \spad{st}.
670216`\spad{sech(st)} computes the hyperbolic secant of a power series \spad{st}.
670315`\spad{sech(z)} returns the hyperbolic secant of Laurent series \spad{z}.
670403`\spad{sech(z)} returns the hyperbolic secant of a Puiseux series \spad{z}.
670500`\spad{sech(x)} returns the hyperbolic secant of \spad{x}.
670609`\spad{second(u)} returns the second element of \spad{u}. Note: \axiom{second(\spad{u}) = first(rest(\spad{u}))}.
670666`\spad{second(p)} extracts the second components of `p'.
670706`\spad{seed()} returns the current seed value.
670757`\spad{segment(l)} is an alternate way to construct the segment \spad{l..}.
670808`\spad{segment(x)} returns the segment from the right hand side of the \spadtype{RangeBinding}. For example,{} if \spad{x} is \spad{v=s},{} then \spad{segment(x)} returns \spad{s}.
670909`\spad{segment(i,j)} is an alternate way to create the segment \spad{i..j}.
671072`\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}.
671175`\spad{select!(p,u)} destructively changes \spad{u} by keeping only values \spad{x} such that \axiom{\spad{p}(\spad{x})}.
671249`\axiom{selectAndPolynomials(lpred?,{}ps)} returns \axiom{gps,{}bps} where \axiom{gps} is a list of the polynomial \axiom{\spad{p}} in \axiom{ps} such that \axiom{pred?(\spad{p})} holds for every \axiom{pred?} in \axiom{lpred?} and \axiom{bps} are the other ones.
671395`\spad{selectFiniteRoutines(R)} chooses only those routines from the database which are designed for use with finite expressions
671454`\spad{selectIntegrationRoutines(R)} chooses only those routines from the database which are for integration
671518`\spad{selectMultiDimensionalRoutines(R)} chooses only those routines from the database which are designed for use with multi-dimensional expressions
671587`\spad{selectNonFiniteRoutines(R)} chooses only those routines from the database which are designed for use with non-finite expressions.
671649`\spad{selectODEIVPRoutines(R)} chooses only those routines from the database which are for the solution of ODE's
671708`\spad{selectOptimizationRoutines(R)} chooses only those routines from the database which are for integration
671773`\axiom{selectOrPolynomials(lpred?,{}ps)} returns \axiom{gps,{}bps} where \axiom{gps} is a list of the polynomial \axiom{\spad{p}} in \axiom{ps} such that \axiom{pred?(\spad{p})} holds for some \axiom{pred?} in \axiom{lpred?} and \axiom{bps} are the other ones.
671918`\spad{selectPDERoutines(R)} chooses only those routines from the database which are for the solution of PDE's
671974`\axiom{selectPolynomials(pred?,{}ps)} returns \axiom{gps,{}bps} where \axiom{gps} is a list of the polynomial \axiom{\spad{p}} in \axiom{ps} such that \axiom{pred?(\spad{p})} holds and \axiom{bps} are the other ones.
672111`\spad{selectSumOfSquaresRoutines(R)} chooses only those routines from the database which are designed for use with sums of squares
672442`\spad{select(x,n)} returns the \spad{n}-th element of tuple \spad{x}. tuples are 0-based
672500`\spad{select(p,u)} returns a copy of \spad{u} containing only those elements such \axiom{\spad{p}(\spad{x})} is \spad{true}. Note: \axiom{select(\spad{p},{}\spad{u}) == [\spad{x} for \spad{x} in \spad{u} | \spad{p}(\spad{x})]}.
672592`\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)]}.
672659`\spad{select(p,t)} returns \spad{[x for x in t | p(x)]}.
672720`\axiom{select(ts,{}\spad{v})} returns the polynomial of \axiom{ts} with \axiom{\spad{v}} as main variable,{} if any.
672799`\spad{selectfirst(x)} \undocumented
672847`\spad{selectsecond(x)} \undocumented
672896`\axiom{indiceSubResultant(\spad{P},{} \spad{Q},{} \spad{i})} returns a subresultant \axiom{\spad{S}} of degree \axiom{\spad{d}} and carries out the equality \axiom{...\spad{P} + coef2*Q = S_i}. Warning: \axiom{degree(\spad{P}) >= degree(\spad{Q})}.
673044`\axiom{discriminantEuclidean(\spad{P})} carries out the equality \axiom{...\spad{P} + \spad{coef2} * \spad{D}(\spad{P}) = discriminant(\spad{P})}. Warning: \axiom{degree(\spad{P}) >= degree(\spad{Q})}.
673159`\axiom{semiIndiceSubResultantEuclidean(\spad{P},{} \spad{Q},{} \spad{i})} returns the subresultant \axiom{S_i(\spad{P},{}\spad{Q})} and carries out the equality \axiom{...\spad{P} + coef2*Q = S_i(\spad{P},{}\spad{Q})} Warning: \axiom{degree(\spad{P}) >= degree(\spad{Q})}.
673307`\axiom{semiLastSubResultantEuclidean(\spad{P},{} \spad{Q})} computes the last non zero subresultant \axiom{\spad{S}} and carries out the equality \axiom{...\spad{P} + coef2*Q = \spad{S}}. Warning: \axiom{degree(\spad{P}) >= degree(\spad{Q})}.
673434`\axiom{\spad{semiResultantEuclidean1}(\spad{P},{}\spad{Q})} carries out the equality \axiom{\spad{coef1}.\spad{P} + ? \spad{Q} = resultant(\spad{P},{}\spad{Q})}.
673549`\axiom{\spad{semiResultantEuclidean2}(\spad{P},{}\spad{Q})} carries out the equality \axiom{...\spad{P} + coef2*Q = resultant(\spad{P},{}\spad{Q})}. Warning: \axiom{degree(\spad{P}) >= degree(\spad{Q})}.
673664`\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.
673782`\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})}.
673924`\axiom{\spad{semiSubResultantGcdEuclidean1}(\spad{P},{}\spad{Q})} carries out the equality \axiom{coef1*P + ? \spad{Q} = +/- S_i(\spad{P},{}\spad{Q})} where the degree (not the indice) of the subresultant \axiom{S_i(\spad{P},{}\spad{Q})} is the smaller as possible.
674042`\axiom{\spad{semiSubResultantGcdEuclidean2}(\spad{P},{}\spad{Q})} carries out the equality \axiom{...\spad{P} + coef2*Q = +/- S_i(\spad{P},{}\spad{Q})} where the degree (not the indice) of the subresultant \axiom{S_i(\spad{P},{}\spad{Q})} is the smaller as possible. Warning: \axiom{degree(\spad{P}) >= degree(\spad{Q})}.
674160`\spad{semicolonSeparate(l)} creates the form separating the elements of \spad{l} by semicolons.
674287`\spad{separant(p)} returns the partial derivative of the differential polynomial \spad{p} with respect to its leader.
674360`\spad{separateDegrees(p)} splits the square free polynomial \spad{p} into factors each of which is a product of irreducibles of the same degree.
674472`\spad{separateFactors(lfact)} takes the list produced by \spadfunFrom{separateDegrees}{DistinctDegreeFactorization} and produces the complete list of factors.
674590`\spad{separateFactors(ddl, p)} refines the distinct degree factorization produced by \spadfunFrom{ddFact}{ModularDistinctDegreeFactorizer} to give a complete list of factors.
674713`\spad{separate(x)} \undocumented
674831`\spad{separate(s)} makes each of the components of the \spadtype{SubSpace},{} \spad{s},{} into a list of separate and distinct subspaces and returns the list.
674977`\spad{separate(p, q)} returns \spad{[a, b]} such that polynomial \spad{p = a b} and \spad{a} is relatively prime to \spad{q}.
675093`\spad{sequence(i)} returns the sequence expression being iterated over by `i'.
675137`\spad{sequences([l0,l1,l2,..,ln])} is the set of \indented{1}{all sequences formed from} \spad{l0} 0's,{}\spad{l1} 1's,{}\spad{l2} 2's,{}...,{}\spad{ln} \spad{n}'s.
675227`\spad{sequences(l1,l2)} is the stream of all sequences that \indented{1}{can be composed from the multiset defined from} \indented{1}{two lists of integers \spad{l1} and \spad{l2}.} \indented{1}{For example,{}the pair \spad{([1,2,4],[2,3,5])} represents} \indented{1}{multi-set with 1 \spad{2},{} 2 \spad{3}'s,{} and 4 \spad{5}'s.}
675331`\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)}.
675445`\spad{seriesSolve(eq,y, x=a, b)} is equivalent to \spad{seriesSolve(eq, y, x=a, y a = b)}.
675549`\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))}.
675659`\spad{seriesSolve(eq, y, x = a, y a = b)} is equivalent to \spad{seriesSolve(eq=0, y, x=a, y a = b)}.
675763`\spad{seriesSolve(eq, y, x = a, b)} is equivalent to \spad{seriesSolve(eq = 0, y, x = a, y a = b)}.
675857`\spad{seriesSolve(eq, y, x = a, [b0,...,bn])} is equivalent to \spad{seriesSolve(eq = 0, y, x = a, [b0,...,b(n-1)])}.
675957`\spad{seriesSolve([eq1,...,eqn],[y1,...,yn],x = a,[y1 a = b1,...,yn a = bn])} returns a taylor series solution of \spad{[eq1,...,eqn]} around \spad{x = a} with initial conditions \spad{yi(a) = bi}. Note: eqi must be of the form \spad{fi(x, y1 x, y2 x,..., yn x) y1'(x) + gi(x, y1 x, y2 x,..., yn x) = h(x, y1 x, y2 x,..., yn x)}.
676089`\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])}.
676211`\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])}.
676333`\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])}.
676445`\spad{seriesToOutputForm(st,refer,var,cen,r)} prints the series \spad{f((var - cen)^r)}.
676633`\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.}
676698`\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.
676798`\spad{series(f)} returns a series expansion of the expression \spad{f}. Note: \spad{f} should have only one variable; the series will be expanded in powers of that variable.
676870`\spad{series([a0,a1,a2,...])} is the Taylor series \spad{a0 + a1 x + a2 x**2 + ...}.
676948`\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.
677047`\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.
677156`\spad{series(x)} returns \spad{x} viewed as a series.
677232`\spad{series(n +-> a(n),x = a)} returns \spad{sum(n = 0..,a(n)*(x-a)**n)}.
677324`\spad{series(f,x = a)} expands the expression \spad{f} as a series in powers of (\spad{x} - a).
677409`\spad{series(f,n)} returns a series expansion of the expression \spad{f}. Note: \spad{f} should have only one variable; the series will be expanded in powers of that variable and terms will be computed up to order at least \spad{n}.
677499`\spad{series(n,st)} creates a series from a common denomiator and a stream of non-zero terms,{} where a term is an exponent-coefficient pair. The terms in the stream should be ordered by increasing order of exponents and \spad{n} should be a common denominator for the exponents in the stream of terms.
677627`\spad{series(n +-> a(n),x = a,n0..)} returns \spad{sum(n = n0..,a(n) * (x - a)**n)}; \spad{series(n +-> a(n),x = a,n0..n1)} returns \spad{sum(n = n0..n1,a(n) * (x - a)**n)}.
677745`\spad{series(f,x = a,n)} expands the expression \spad{f} as a series in powers of (\spad{x} - a); terms will be computed up to order at least \spad{n}.
677848`\spad{series(a(n),n,x = a)} returns \spad{sum(n = 0..,a(n)*(x-a)**n)}.
677936`\spad{series(n +-> a(n),x = a,r0..,r)} returns \spad{sum(n = r0,r0 + r,r0 + 2*r..., a(n) * (x - a)**n)}; \spad{series(n +-> a(n),x = a,r0..r1,r)} returns \spad{sum(n = r0 + k*r while n <= r1, a(n) * (x - a)**n)}.
678092`\spad{series(a(n),n,x=a,n0..)} returns \spad{sum(n = n0..,a(n) * (x - a)**n)}; \spad{series(a(n),n,x=a,n0..n1)} returns \spad{sum(n = n0..n1,a(n) * (x - a)**n)}.
678206`\spad{series(a(n),n,x = a,r0..,r)} returns \spad{sum(n = r0,r0 + r,r0 + 2*r..., a(n) * (x - a)**n)}; \spad{series(a(n),n,x = a,r0..r1,r)} returns \spad{sum(n = r0 + k*r while n <= r1, a(n) * (x - a)**n)}.
678348`\spad{setAdaptive3D(true)} turns adaptive plotting on; setAdaptive3D(\spad{false}) turns adaptive plotting off.
678403`\spad{setAdaptive(true)} turns adaptive plotting on \spad{setAdaptive(false)} turns adaptive plotting off
678454`\axiom{setAttributeButtonStep(\spad{n})} sets the value of the steps for increasing and decreasing the button values. \axiom{\spad{n}} must be greater than 0 and less than 1. The preset value is 0.5.
678524`\axiom{setButtonValue(attributeName,{}\spad{n})} sets the value of all buttons of attribute \spad{attributeName} to \spad{n}. \spad{n} must be in the range [0..1]. \blankline \axiom{attributeName} should be one of the values "stiffness",{} "stability",{} "accuracy",{} "expense" or "functionEvaluations".
678593`\axiom{setButtonValue(attributeName,{}routineName,{}\spad{n})} sets the value of the button of attribute \spad{attributeName} to routine \spad{routineName} to \spad{n}. \spad{n} must be in the range [0..1]. \blankline \axiom{attributeName} should be one of the values "stiffness",{} "stability",{} "accuracy",{} "expense" or "functionEvaluations".
678669`\spad{setClipValue(x)} sets to \spad{x} the maximum value to plot when drawing complex functions. Returns \spad{x}.
678736`\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.
678880`\spad{setColumn!(m,j,v)} sets to \spad{j}th column of \spad{m} to \spad{v}
678966`\axiom{setCondition!(\spad{n},{}\spad{t})} returns \spad{n} whose condition has been replaced by \spad{t} if it is not empty,{} else an error is produced.
679025`\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.
679092`\axiom{setEmpty!(\spad{n})} replaces \spad{n} by \axiom{empty()\$\%}.
679145`\spad{setEpilogue!(t,strings)} sets the epilogue section of a TeX form \spad{t} to \spad{strings}.
679215`\spad{setErrorBound(eps)} changes the internal error bound,{} by default being {\em 10 ** (-3)} to \spad{eps},{} if \spad{R} is a member in the category \spadtype{QuotientFieldCategory Integer}. The internal {\em globalDigits} is set to {\em ceiling(1/r)**2*10} being {\em 10**7} by default.
679283`\spad{setFieldInfo(m,p)} initializes the field arithmetic,{} where \spad{m} is the multiplication table and \spad{p} is the respective normal element of the ground field GF.
679408`\spad{setImagSteps(i)} sets to \spad{i} the number of steps to use in the imaginary direction when drawing complex functions. Returns \spad{i}.
679467`\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.
679536`\spad{setLabelValue(i)} resets the counter which produces labels to \spad{i}
679608`\spad{setLegalFortranSourceExtensions(l)} \undocumented{}
679699`\spad{setLength!(buf,n)} sets the number of active bytes in the `buf'. Error if `n' is more than the capacity.
679780`\spad{setMaxPoints3D(i)} sets the maximum number of points in a plot to \spad{i}.
679836`\spad{setMaxPoints(i)} sets the maximum number of points in a plot to \spad{i}
679888`\spad{setMinPoints3D(i)} sets the minimum number of points in a plot to \spad{i}.
679944`\spad{setMinPoints(i)} sets the minimum number of points in a plot to \spad{i}
679996`\spad{setOfMinN([a_1,...,a_m])} returns the set {\spad{a_1},{}...,{}a_m}. Error if {\spad{a_1},{}...,{}a_m} is not a set of \spad{M} integers in \spad{1..n}.
680077`\spad{setOrder([a1,...,an])} defines a partial ordering on \spad{S} given by: \indented{3}{(1)\space{2}\spad{a1 < a2 < ... < an}.} \indented{3}{(2)\space{2}\spad{b < ai\space{3}for i = 1..n} and \spad{b} not among the \spad{ai}'s.} \indented{3}{(3)\space{2}undefined on \spad{(b, c)} if neither is among the \spad{ai}'s.}
680147`\spad{setOrder([b1,...,bm], [a1,...,an])} defines a partial ordering on \spad{S} given by: \indented{3}{(1)\space{2}\spad{b1 < b2 < ... < bm < a1 < a2 < ... < an}.} \indented{3}{(2)\space{2}\spad{bj < c < ai}\space{2}for \spad{c} not among the \spad{ai}'s and bj's.} \indented{3}{(3)\space{2}undefined on \spad{(c,d)} if neither is among the \spad{ai}'s,{}bj's.}
680225`\spad{setPoly(x)} \undocumented
680275`\spad{setPosition(x, n)} associates the integer \spad{n} to \spad{x}.
680344`\spad{setPredicates(p, [p1,...,pn])} attaches the predicate \spad{p1} and ... and pn to \spad{p}.
680403`\spad{setPrologue!(t,strings)} sets the prologue section of a TeX form \spad{t} to \spad{strings}.
680473`\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.
680554`\spad{setProperty(op, p, v)} attaches property \spad{p} to \spad{op},{} and sets its value to \spad{v}. Argument \spad{op} is modified "in place",{} \spadignore{i.e.} no copy is made.
680620`\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.
680682`\spad{setRealSteps(i)} sets to \spad{i} the number of steps to use in the real direction when drawing complex functions. Returns \spad{i}.
680819`\spad{setRow!(m,i,v)} sets to \spad{i}th row of \spad{m} to \spad{v}
680902`\spad{setScreenResolution3D(i)} sets the screen resolution for a 3d graph to \spad{i}.
680965`\spad{setScreenResolution(i)} sets the screen resolution to \spad{i}
681024`\axiom{setStatus!(\spad{n},{}\spad{b})} returns \spad{n} whose status has been replaced by \spad{b} if it is not empty,{} else an error is produced.
681086`\spad{setStatus(s,t)} returns the same representation for \spad{s},{} but asserts the following: if \spad{t} is \spad{true},{} then \spad{s} is empty,{} if \spad{t} is \spad{false},{} then \spad{s} is non-empty,{} and if \spad{t} = "failed",{} then no assertion is made (that is,{} "don't know"). Note: for internal use only,{} with care.
681181`\spad{setTex!(t,strings)} sets the TeX section of a TeX form \spad{t} to \spad{strings}.
681246`\spad{setTopPredicate(x, [a1,...,an], f)} returns \spad{x} with the top-level predicate set to \spad{f(a1,...,an)}.
681314`\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.
681376`\axiom{setValue!(\spad{n},{}\spad{v})} returns \spad{n} whose value has been replaced by \spad{v} if it is not empty,{} else an error is produced.
681431`\spad{setVariableOrder([a1,...,an])} defines an ordering on the variables given by \spad{a1 > a2 > ... > an > other variables}.
681512`\spad{setVariableOrder([b1,...,bm], [a1,...,an])} defines an ordering on the variables given by \spad{b1 > b2 > ... > bm >} other variables \spad{> a1 > a2 > ... > an}.
681650`\spad{set()}\$\spad{D} creates an empty set aggregate of type \spad{D}.
681743`\spad{set([x,y,...,z])} creates a set aggregate containing items \spad{x},{}\spad{y},{}...,{}\spad{z}.
681859`\spad{setchildren!(u,v)} replaces the current children of node \spad{u} with the members of \spad{v} in left-to-right order.
681962`\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}
682078`\spad{setelt(n,m)} changes the value of the object \spad{n} to \spad{m}.
683122`\spad{setelt(u,"first",x)} (also written: \axiom{\spad{u}.first := \spad{x}}) is equivalent to \axiom{setfirst!(\spad{u},{}\spad{x})}.
683224`\spad{setelt(u,"last",x)} (also written: \axiom{\spad{u}.last := \spad{b}}) is equivalent to \axiom{setlast!(\spad{u},{}\spad{v})}.
683325`\spad{setelt(a,"left",b)} (also written \axiom{a . left := \spad{b}}) is equivalent to \axiom{setleft!(a,{}\spad{b})}.
683429`\spad{setelt(u,"rest",v)} (also written: \axiom{\spad{u}.rest := \spad{v}}) is equivalent to \axiom{setrest!(\spad{u},{}\spad{v})}.
683532`\spad{setelt(a,"right",b)} (also written \axiom{\spad{b} . right := \spad{b}}) is equivalent to \axiom{setright!(a,{}\spad{b})}.
683637`\spad{setelt(a,"value",x)} (also written \axiom{a . value := \spad{x}}) is equivalent to \axiom{setvalue!(a,{}\spad{x})}
683734`\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}.
683832`\spad{setelt(t,k,e)} (also written \axiom{\spad{t}.\spad{k} := \spad{e}}) is equivalent to \axiom{(insert([\spad{k},{}\spad{e}],{}\spad{t}); \spad{e})}.
683902`\spad{lib.k := v} saves the value \spad{v} in the library \spad{lib}. It can later be extracted using the key \spad{k}.
683953`\spad{setelt(u,i..j,x)} (also written: \axiom{\spad{u}(\spad{i}..\spad{j}) := \spad{x}}) destructively replaces each element in the segment \axiom{\spad{u}(\spad{i}..\spad{j})} by \spad{x}. The value \spad{x} is returned. Note: \spad{u} is destructively change so that \axiom{\spad{u}.\spad{k} := \spad{x} for \spad{k} in \spad{i}..\spad{j}}; its length remains unchanged.
684217`\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
684304`\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}.
684392`\spad{setfirst!(u,x)} destructively changes the first element of a to \spad{x}.
684546`\spad{setlast!(u,x)} destructively changes the last element of \spad{u} to \spad{x}.
684642`\spad{setleaves!(t, ls)} sets the leaves of \spad{t} in left-to-right order to the elements of ls.
684707`\spad{setleft!(a,b)} sets the left child of \axiom{a} to be \spad{b}.
684806`\spad{setnext!(u,v)} destructively sets the next node of doubly-linked aggregate \spad{u} to \spad{v},{} returning \spad{v}.
684902`\spad{setprevious!(u,v)} destructively sets the previous node of doubly-linked aggregate \spad{u} to \spad{v},{} returning \spad{v}.
685002`\spad{setref(n,m)} same as \spad{setelt(n,m)}.
685047`\spad{setrest!(u,v)} destructively changes the rest of \spad{u} to \spad{v}.
685145`\spad{setrest!(x,n,y)} sets rest(\spad{x},{}\spad{n}) to \spad{y}. The function will expand cycles if necessary.
685199`\spad{setright!(a,x)} sets the right child of \spad{t} to be \spad{x}.
685376`\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}.
685517`\spad{setvalue!(u,x)} sets the value of node \spad{u} to \spad{x}.
685609`\spad{sh(x,n)} returns the shuffle power of \spad{x} to the \spad{n}.
685696`\spad{sh(x,y)} returns the shuffle-product of \spad{x} by \spad{y}. This multiplication is associative and commutative.
685767`\spad{shade(pt)} returns the fourth element of the two dimensional point,{} \spad{pt},{} although no assumptions are made with regards as to how the components of higher dimensional points are interpreted. This function is defined for the convenience of the user using specifically,{} shade to express a fourth dimension.
685818`\spad{shade(p)} returns the shade index of the indicated palette \spad{p}.
685861`\spad{shallowCopy(x)} \undocumented
685911`\spad{shallowExpand(x)} \undocumented{}
685985`\spad{shanksDiscLogAlgorithm(b,a,p)} computes \spad{s} with \spad{b**s = a} for assuming that \spad{a} and \spad{b} are elements in a 'small' cyclic group of order \spad{p} by Shank's algorithm. Note: this is a subroutine of the function \spadfun{discreteLog}.
686112`\spad{shape x} returns the partition shaping \spad{x}.
686162`\spad{shellSort(f, agg)} sorts the aggregate agg with the ordering function \spad{f} using the shellSort algorithm.
686320`\spad{shiftLeft(p,n)} returns \spad{p * monomial(1,n)}
686486`\spad{shiftRight(p,n)} returns \spad{monicDivide(p,monomial(1,n)).quotient}
686572`\spad{shiftRoots(p,c)} returns the polynomial which has for roots \spad{c} added to the roots of \spad{p}.
686646`\spad{shift(k)} returns \spad{matrix [[1,k],[0,1]]} representing the map \spad{x -> x + k}.
686695`\spad{shift(m,h)} returns \spad{shift(h) * m} (see \spadfunFrom{shift}{MoebiusTransform}).
686747`\spad{shift(x,n)} adds \spad{n} to the exponent of float \spad{x}.
686791`\spad{shift(a,i)} shift \spad{a} by \spad{i} bits.
686848`\spad{shift(a,i)} shift \spad{a} by \spad{i} digits.
686901`\spad{showAll?()} returns \spad{true} if all computed entries of streams will be displayed.
686965`\spad{showAllElements(s)} creates an output form which displays all computed elements.
687041`\spad{showArrayValues(true)} forces the values of array components to be \indented{1}{displayed rather than just their types.}
687098`\spad{showAttributes(x)} \undocumented{}
687953`\spad{showClipRegion(v,s)} displays the clipping region of the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport},{} if \spad{s} is "on",{} or does not display the region if \spad{s} is "off".
688026`\spad{showFortranOutputStack()} returns the Fortran output stack
688108`\spad{showIntensityFunctions(k)} returns the entries in the table of intensity functions \spad{k}.
688479`\spad{showRegion(v,s)} displays the bounding box of the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport},{} if \spad{s} is "on",{} or does not display the box if \spad{s} is "off".
688548`\spad{showScalarValues(true)} forces the values of scalar components to be \indented{1}{displayed rather than just their types.}
688606`\spad{showSummary(d)} prints out implementation detail information of domain `d'.
688651`\spad{showTheFTable()} returns the current table of functions.
688713`\spad{showTheIFTable()} returns the current table of intensity functions.
688777`\spad{showTheRoutinesTable()} returns the current table of NAG routines.
688834`\spad{showTheSymbolTable()} returns the current symbol table.
688890`\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".
688967`\spad{shrinkable(b)} sets the shrinkable attribute of flexible arrays to \spad{b} and returns the previous value
689095`\spad{shuffle(l1,l2)} forms the stream of all shuffles of \spad{l1} \indented{1}{and \spad{l2},{} \spadignore{i.e.} all sequences that can be formed from} \indented{1}{merging \spad{l1} and \spad{l2}.}
689197`\spad{shufflein(l,st)} maps shuffle(\spad{l},{}\spad{u}) on to all \indented{1}{members \spad{u} of \spad{st},{} concatenating the results.}
689309`\spad{signAround(u,i,f)} \undocumented
689422`\spad{signAround(u,r,f)} \undocumented
689529`\spad{signAround(u,r,i,f)} \undocumented
689644`\spad{sign(r)} \undocumented
689760`\spad{sign(f)} returns the sign of \spad{f} if it is constant everywhere.
689837`\spad{sign f} returns the sign of \spad{f} if it is constant everywhere.
689932`\spad{sign(x)} is \spad{1} if \spad{x} is positive,{} \spad{-1} if \spad{x} is negative,{} and \spad{0} otherwise.
689986`\spad{sign(p)} returns the signum of the permutation \spad{p},{} \spad{+1} or \spad{-1}.
690035`\axiom{sign(pol,{}aRoot)} gives the sign of \axiom{pol} interpreted as \axiom{aRoot}
690128`\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.
690233`\spad{sign(f, x, a)} returns the sign of \spad{f} as \spad{x} approaches \spad{a},{} from both sides if \spad{a} is finite.
690378`\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".
690471`\spad{sign(f, x, a, s)} returns the sign of \spad{f} as \spad{x} nears \spad{a} from the left (below) if \spad{s} is the string \spad{"left"},{} or from the right (above) if \spad{s} is the string \spad{"right"}.
690604`\spad{signatureAst(n,s,t)} builds the signature AST n: \spad{s} -> \spad{t}
690672`\spad{signature(x)} returns the signature of function described by \spad{x}.
690732`\spad{signature(x)} returns the signature of `x'.
690791`\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.
690846`\spad{signature(s)} returns AST of the declared signature for `s'.
690900`\spad{signature(s,t)} constructs a Signature object with parameter types indicaded by `s',{} and return type indicated by `t'.
690961`\spad{simpleBounds?(l)} returns \spad{true} if the list of expressions \spad{l} are simple.
691048`\spad{simplifyExp(f)} converts every product \spad{exp(a)*exp(b)} appearing in \spad{f} into \spad{exp(a+b)}.
691115`\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)}.
691182`simplifyPower?(\spad{f},{}\spad{n}) \undocumented{}
691263`\spad{simplify f} returns a formula logically equivalent to \spad{f} where obvious tautologies have been removed.
691372`\spad{simplify(s)} returns a different and presumably simpler representation of \spad{s} with the defining polynomials for the equations forming a groebner basis,{} and the defining polynomial for the inequation reduced with respect to the basis,{} using a heuristic algorithm based on factoring.
691495`\spad{simplify(an)} applies simplifications to \spad{an}
691596`\spad{simplify(f)} performs the following simplifications on f:\begin{items} \item 1. rewrites trigs and hyperbolic trigs in terms of \spad{sin} ,{}\spad{cos},{} \spad{sinh},{} \spad{cosh}. \item 2. rewrites \spad{sin**2} and \spad{sinh**2} in terms of \spad{cos} and \spad{cosh},{} \item 3. rewrites \spad{exp(a)*exp(b)} as \spad{exp(a+b)}. \item 4. rewrites \spad{(a**(1/n))**m * (a**(1/s))**t} as a single power of a single radical of \spad{
691596`--a}. \end{items}
691660`\spad{simpson(fn,a,b,epsrel,epsabs,nmin,nmax)} uses the simpson method to numerically integrate function \spad{fn} over the closed interval \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin} to \spad{nmax}. The value re
691660`--turned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
691826`\spad{simpsono(fn,a,b,epsrel,epsabs,nmin,nmax)} uses the simpson method to numerically integrate function \spad{fn} over the open interval from \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin} to \spad{nmax}. The val
691826`--ue returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
691993`\spad{sin2csc(f)} converts every \spad{sin(u)} appearing in \spad{f} into \spad{1/csc(u)}.
692056`\spad{sin?(x)} returns \spad{true} if term is a sin,{} otherwise \spad{false}
692110`\spad{sinIfCan(z)} returns sin(\spad{z}) if possible,{} and "failed" otherwise.
692191`\spad{sin(x)} makes a sin kernel for use in Fourier series
692238`\spad{sin(x)} applies the sine operator to \spad{x}
692390`\spad{sin(st)} computes sine of a power series \spad{st}.
692474`\spad{sin(st)} computes sine of a power series \spad{st}.
692572`\spad{sin(z)} returns the sine of Laurent series \spad{z}.
692659`\spad{sin(z)} returns the sine of a Puiseux series \spad{z}.
692755`\spad{sin(x)} returns the sine of \spad{x}.
692813`\spad{sin(x)} represents the Fortran intrinsic function SIN
692894`\spad{sincos(st)} returns a record containing the sine and cosine of a power series \spad{st}.
693010`\spad{singRicDE(op, ezfactor)} returns \spad{[[f1,L1], [f2,L2],..., [fk,Lk]]} such that the singular ++ part of any rational solution of the associated Riccati equation of \spad{op y = 0} must be one of the \spad{fi}'s (up to the constant coefficient),{} in which case the equation for \spad{z = y e^
693010`--{-int ai}} is \spad{Li z = 0}. Argument \spad{ezfactor} is a factorisation in \spad{UP},{} not necessarily into irreducibles.
693218`\spad{singRicDE(op, zeros, ezfactor)} returns \spad{[[f1, L1], [f2, L2], ... , [fk, Lk]]} such that the singular part of any rational solution of the associated Riccati equation of \spad{op y=0} must be one of the \spad{fi}'s (up to the constant coefficient),{} in which case the equation for \spad{z=y e^{-int p}} is \spad{Li z=0}. \spad{zeros(C(
693218`--x),H(x,y))} returns all the \spad{P_i(x)}'s such that \spad{H(x,P_i(x)) = 0 modulo C(x)}. Argument \spad{ezfactor} is a factorisation in \spad{UP},{} not necessarily into irreducibles.
693379`\spad{singleFactorBound(p,r)} returns a bound on the infinite norm of the factor of \spad{p} with smallest Bombieri's norm. \spad{p} shall be of degree higher or equal to 2.
693468`\spad{singleFactorBound(p,r)} returns a bound on the infinite norm of the factor of \spad{p} with smallest Bombieri's norm. \spad{r} is a lower bound for the number of factors of \spad{p}. \spad{p} shall be of degree higher or equal to 2.
693576`\spad{singular?(a)} tests whether \spad{x = a} is singular.
693647`\spad{singular?(p)} tests whether \spad{p(x) = 0} is singular.
693719`\spad{singularAtInfinity?()} tests if there is a singularity at infinity.
693799`\spad{singularitiesOf(args)} returns a list of potential singularities of the function within the given range
694000`\spad{singularitiesOf(e,vars,range)} returns a list of points (\axiomType{Doublefloat}) at which a NAG fortran version of \spad{e} will most likely produce an error. This includes those points which evaluate to 0/0.
694161`\spad{singularitiesOf(v,vars,range)} returns a list of points (\axiomType{Doublefloat}) at which a NAG fortran version of \spad{v} will most likely produce an error. This includes those points which evaluate to 0/0.
694330`\spad{sinh2csch(f)} converts every \spad{sinh(u)} appearing in \spad{f} into \spad{1/csch(u)}.
694395`\spad{sinhIfCan(z)} returns sinh(\spad{z}) if possible,{} and "failed" otherwise.
694477`\spad{sinh(x)} applies the hyperbolic sine operator to \spad{x}
694684`\spad{sinh(st)} computes the hyperbolic sine of a power series \spad{st}.
694769`\spad{sinh(st)} computes the hyperbolic sine of a power series \spad{st}.
694868`\spad{sinh(z)} returns the hyperbolic sine of Laurent series \spad{z}.
694956`\spad{sinh(z)} returns the hyperbolic sine of a Puiseux series \spad{z}.
695053`\spad{sinh(x)} returns the hyperbolic sine of \spad{x}.
695109`\spad{sinh(x)} represents the Fortran intrinsic function SINH
695191`\spad{sinhcosh(st)} returns a record containing the hyperbolic sine and cosine of a power series \spad{st}.
695384`\spad{size?(u,n)} tests if \spad{u} has exactly \spad{n} elements.
695511`\spad{sizeLess?(x,y)} tests whether \spad{x} is strictly smaller than \spad{y} with respect to the \spadfunFrom{euclideanSize}{EuclideanDomain}.
695569`\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.
695669`\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.
695778`\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.
695868`\spad{sizeMultiplication(m)} returns the number of entries of the multiplication table {\em m}.
696000`\spad{sizePascalTriangle()} returns the number of entries currently stored in the table.
696348`\spad{size()} is the base of the random number generator
696399`\spad{size()} returns the number of elements in the set.
696449`\spad{size(x)} returns the number of monomials in \spad{x}.
696516`\spad{size(x)} returns the number of monomials in \spad{x}.
696574`\spad{size(l)} returns the number of monomials forming \spad{l}.
696641`\spad{size(x)} returns the number of terms in \spad{x}. mapGen(\spad{f},{} \spad{a1}\^\spad{e1} ... an\^en) returns \spad{f(a1)\^e1 ... f(an)\^en}.
696717`The size of the isolating interval
696810`\spad{skewSFunction(li1,li2)} is the \spad{S}-function \indented{1}{of the partition difference \spad{li1 - li2}} \indented{1}{expressed in terms of power sum symmetric functions.}
696925`\spad{slash(f,g)} creates a form for the horizontal fraction of \spad{f} over \spad{g}.
696969`\spad{slex(ls)} sorts the argument sequence \spad{ls},{} then zips (see \spadfunFrom{map}{\spad{ListFunctions3}}) the original argument sequence with the sorted result to a list of pairs
697033`\spad{smith(m)} returns the Smith Normal form of the matrix \spad{m}.
697090`\spad{sn(x,k)} expands the elliptic function sn as a Taylor \indented{1}{series.}
697174`\spad{sncndn(s,c)} is used internally.
697286`\spad{socf2socdf(a)} is a function to convert a \axiomType{Segment OrderedCompletion Float} to a \axiomType{Segment OrderedCompletion DoubleFloat}
697414`\spad{solid?(x)} \undocumented
697476`\spad{solid(x,b)} \undocumented
697545`\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.
697646`\spad{solveInField(lp)} finds the solution of the list \spad{lp} of rational functions with respect to all the symbols appearing in \spad{lp}.
697768`\spad{solveInField(lp,lv)} finds the solutions of the list \spad{lp} of rational functions with respect to the list of symbols \spad{lv}.
697903`\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} 
697903`--is a function for solving a single linear ordinary differential equation in \spad{F}.
698103`\spad{solveLinearPolynomialEquationByFractions([f1, ..., fn], g)} (where the \spad{fi} are relatively prime to each other) returns a list of \spad{ai} such that \spad{g/prod fi = sum ai/fi} or returns "failed" if no such exists.
698319`\spad{solveLinearPolynomialEquationByRecursion([p1,...,pn],p)} returns the list of polynomials \spad{[q1,...,qn]} such that \spad{sum qi/pi = p / prod pi},{} a recursion step for solveLinearPolynomialEquation as defined in \spadfun{PolynomialFactorizationExplicit} category (see \sp
698319`--adfun{solveLinearPolynomialEquation}). If no such list of \spad{qi} exists,{} then "failed" is returned.
698545`\spad{solveLinearPolynomialEquationByRecursion([p1,...,pn],p)} returns the list of polynomials \spad{[q1,...,qn]} such that \spad{sum qi/pi = p / prod pi},{} a recursion step for solveLinearPolynomialEquation as defined in \spadfun{PolynomialFactorizationExplicit} category (see \s
698545`--padfun{solveLinearPolynomialEquation}). If no such list of \spad{qi} exists,{} then "failed" is returned.
698772`\spad{solveLinearPolynomialEquation([f1, ..., fn], g)} (where the \spad{fi} are relatively prime to each other) returns a list of \spad{ai} such that \spad{g/prod fi = sum ai/fi} or returns "failed" if no such list of \spad{ai}'s exists.
698911`\spad{solveLinearPolynomialEquation([f1, ..., fn], g)} where (\spad{fi} relatively prime to each other) returns a list of \spad{ai} such that \spad{g} = sum \spad{ai} prod fj (\spad{j} \= \spad{i}) or equivalently g/prod fj = sum (ai/fi) or returns "failed" if no such list exists
699130`\spad{solveLinearPolynomialEquation([f1, ..., fn], g)} (where the \spad{fi} are relatively prime to each other) returns a list of \spad{ai} such that \spad{g/prod fi = sum ai/fi} or returns "failed" if no such list of \spad{ai}'s exists.
700118`\spad{solveLinearPolynomialEquation([f1, ..., fn], g)} (where the \spad{fi} are relatively prime to each other) returns a list of \spad{ai} such that \spad{g/prod fi = sum ai/fi} or returns "failed" if no such list of \spad{ai}'s exists.
700319`\spad{solveLinear([v1,...,vn], u)} returns \spad{[c1,...,cn]} such that \spad{c1*v1 + ... + cn*vn = u},{} "failed" if no such \spad{ci}'s exist in the quotient field of \spad{S}.
700436`\spad{solveLinear([v1,...,vn], u)} returns \spad{[c1,...,cn]} such that \spad{c1*v1 + ... + cn*vn = u},{} "failed" if no such \spad{ci}'s exist in \spad{S}.
700538`\spad{solveLinearlyOverQ([v1,...,vn], u)} returns \spad{[c1,...,cn]} such that \spad{c1*v1 + ... + cn*vn = u},{} "failed" if no such rational numbers \spad{ci}'s exist.
700656`\spad{solveRetract(lp,lv)} finds the solutions of the list \spad{lp} of rational functions with respect to the list of symbols \spad{lv}. The function tries to retract all the coefficients of the equations to \spad{Q} before solving if possible.
700791`\spad{solve(xmin,ymin,xmax,ymax,ngx,ngy,pde,bounds,st,tol)} is a top level ANNA function to solve numerically a system of partial differential equations. This is defined as a list of coefficients (\axiom{\spad{pde}}),{} a grid (\axiom{\spad{xmin}},{} \axiom{\spad{ymin}},{} \axiom{\spad{xmax}},{} \axio
700791`--m{\spad{ymax}},{} \axiom{\spad{ngx}},{} \axiom{\spad{ngy}}),{} the boundary values (\axiom{\spad{bounds}}) and a tolerance requirement (\axiom{\spad{tol}}). There is also a parameter (\axiom{\spad{st}}) which should contain the value "elliptic" if the PDE is known to be elliptic,{} or "unknown" if it is uncertain. This causes the routine to check whether the PDE is elliptic. \blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical L
700791`--ibrary. The function predicts the likely most effective routine by checking various attributes of the system of PDE's and calculating a measure of compatibility of each routine to these attributes. \blankline It then calls the resulting `best' routine. \blankline ** At the moment,{} only Second Order Elliptic Partial Differential Equations are solved **
700997`\spad{solve(lp)} finds the solution in the algebraic closure of \spad{R} of the list \spad{lp} of rational functions with respect to all the symbols appearing in \spad{lp}.
701112`\spad{solve(u)} \undocumented
701179`\spad{solve(eq)} finds the solutions of the equation \spad{eq} where \spad{eq} is an equation of functions of type Expression(\spad{R}) with respect to the unique symbol \spad{x} appearing in \spad{eq}.
701278`\spad{solve(eq)} finds the solutions of the equation \spad{eq} with respect to the unique variable appearing in \spad{eq}.
701398`\spad{solve(expr)} finds the solutions of the equation \spad{expr} = 0 where \spad{expr} is a function of type Expression(\spad{R}) with respect to the unique symbol \spad{x} appearing in eq.
701487`\spad{solve(p)} finds the solution of a rational function \spad{p} = 0 with respect to the unique variable appearing in \spad{p}.
701597`\spad{solve(le)} finds the solutions of the list \spad{le} of equations of rational functions with respect to all symbols appearing in \spad{le}.
701729`\spad{solve(lp)} finds the solutions of the list \spad{lp} of rational functions with respect to all symbols appearing in \spad{lp}.
701851`\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 accu
701851`--racy 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 fun
701851`--ction predicts the likely most effective routine by checking various attributes of the system of ODE's and calculating a measure of compatibility of each routine to these attributes. \blankline It then calls the resulting `best' routine.
701942`\spad{solve(PDEProblem)} is a top level ANNA function to solve numerically a system of partial differential equations. \blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of PDE's and calculating a measure of compatibility of each routine to
701942`-- these attributes. \blankline It then calls the resulting `best' routine. \blankline ** At the moment,{} only Second Order Elliptic Partial Differential Equations are solved **
702032`\spad{solve(lp,lv)} finds the solutions in the algebraic closure of \spad{R} of the list \spad{lp} of rational functions with respect to the list of symbols \spad{lv}.
702160`\spad{solve(p,eps)} finds the real zeroes of a univariate rational polynomial \spad{p} with precision \spad{eps}.
702249`\spad{solve(p,eps)} finds the real zeroes of a univariate integer polynomial \spad{p} with precision \spad{eps}.
702328`\spad{solve(eq,x)} finds the solutions of the equation \spad{eq} where \spad{eq} is an equation of functions of type Expression(\spad{R}) with respect to the symbol \spad{x}.
702434`\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}.
702559`\spad{solve(eq,v)} finds the solutions of the equation \spad{eq} with respect to the variable \spad{v}.
702686`\spad{solve(expr,x)} finds the solutions of the equation \spad{expr} = 0 with respect to the symbol \spad{x} where \spad{expr} is a function of type Expression(\spad{R}).
702782`\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}.
702897`\spad{solve(p,v)} solves the equation \spad{p=0},{} where \spad{p} is a rational function with respect to the variable \spad{v}.
703014`\spad{solve(leqs, lvar)} returns a list of solutions to the list of equations \spad{leqs} with respect to the list of symbols lvar.
703138`\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 lp,{} with precision \spad{eps}.
703275`\spad{solve(le,lv)} finds the solutions of the list \spad{le} of equations of rational functions with respect to the list of symbols \spad{lv}.
703420`\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}.
703547`\spad{solve(lp,lv)} finds the solutions of the list \spad{lp} of rational functions with respect to the list of symbols \spad{lv}.
703682`\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}.
703839`\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}.
703984`\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}.
704108`\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}.
704244`\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}.
704397`\spad{solve(m, x)} returns a basis for the solutions of \spad{D y = m y}. \spad{x} is the dependent variable.
704503`\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}.
704644`\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 \sp
704644`--ad{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
704644`-- one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE's and calculating a measure of compatibility of each routine to these attributes. \blankline It then calls the resulting `best' routine.
704749`\spad{solve(PDEProblem,routines)} is a top level ANNA function to solve numerically a system of partial differential equations. \blankline The method used to perform the numerical process will be one of the \spad{routines} contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of PDE's and calculating a measure of co
704749`--mpatibility of each routine to these attributes. \blankline It then calls the resulting `best' routine. \blankline ** At the moment,{} only Second Order Elliptic Partial Differential Equations are solved **
704853`\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
704853`-- for solving a single linear ordinary differential equation in \spad{F}.
705039`\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 
705039`--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.
705182`\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 equati
705182`--on \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}.
705315`\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}
705315`--. 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.
705437`\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 equati
705437`--ons do not form a first order linear system
705606`\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
705606`-- form a first order linear system
705765`\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.
705916`\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.
706017`\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)}.
706138`\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)}.
706249`\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 conditio
706249`--ns) 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 
706249`--of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE's and calculating a measure of compatibility of each routine to these attributes. \blankline It then calls the resulting `best' routine.
706370`\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.
706469`\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 
706469`--\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 
706469`--one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE's and calculating a measure of compatibility of each routine to these attributes. \blankline It then calls the resulting `best' routine.
706596`\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
706596`-- 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) nu
706596`--merical routine likely to be the most appropriate,{} \spadignore{i.e.} have the best \axiom{measure}. \blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE's and calculating a measure of compatibility of each routine to these attributes. \blankline It then calls the resulting `best' routine.
706741`\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
706741`-- 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 mo
706741`--st appropriate,{} \spadignore{i.e.} have the best \axiom{measure}. \blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE's and calculating a measure of compatibility of each routine to these attributes. \blankline It then calls the resulting `best' routine.
706880`\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{\
706880`--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{OrdinaryDifferentialEquationsSolverCat
706880`--egory} contained in the table of routines \axiom{\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \spadignore{i.e.} have the best \axiom{measure}. \blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE's and calculating a measu
706880`--re of compatibility of each routine to these attributes. \blankline It then calls the resulting `best' routine.
707037`\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{xSta
707037`--rt}} 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
707037`-- 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
707037`-- by checking various attributes of the system of ODE's and calculating a measure of compatibility of each routine to these attributes. \blankline It then calls the resulting `best' routine.
707200`\spad{solve(xmin,ymin,xmax,ymax,ngx,ngy,pde,bounds,st)} is a top level ANNA function to solve numerically a system of partial differential equations. This is defined as a list of coefficients (\axiom{\spad{pde}}),{} a grid (\axiom{\spad{xmin}},{} \axiom{\spad{ymin}},{} \axiom{\spad{xmax}},{} \axiom{\spad{ymax}},{}
707200`-- \axiom{\spad{ngx}},{} \axiom{\spad{ngy}}) and the boundary values (\axiom{\spad{bounds}}). A default value for tolerance is used. There is also a parameter (\axiom{\spad{st}}) which should contain the value "elliptic" if the PDE is known to be elliptic,{} or "unknown" if it is uncertain. This causes the routine to check whether the PDE is elliptic. \blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predi
707200`--cts the likely most effective routine by checking various attributes of the system of PDE's and calculating a measure of compatibility of each routine to these attributes. \blankline It then calls the resulting `best' routine. \blankline ** At the moment,{} only Second Order Elliptic Partial Differential Equations are solved **
707393`\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}.
707484`\spad{someBasis()} returns some \spad{R}-module basis.
707708`\spad{sort!(u)} returns \spad{u} with its elements in ascending order.
708015`\spad{sort!(p,u)} returns \spad{u} with its elements ordered by \spad{p}.
708120`\spad{sortConstraints(args)} uses a simple bubblesort on the list of constraints using the degree of the expression
708120`-- on which to sort. Of course,{} it must match the bounds to the constraints.
708562`\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.
708618`\spad{sort(u)} returns an \spad{u} with elements in ascending order. Note: \axiom{sort(\spad{u}) = sort(<=,{}\spad{u})}.
708850`\spad{sort(p,a)} returns a copy of \axiom{a} sorted using total ordering predicate \spad{p}.
708919`\axiom{sort(\spad{v},{}ps)} returns \axiom{us,{}vs,{}ws} such that \axiom{us} is \axiom{collectUnder(ps,{}\spad{v})},{} \axiom{vs} is \axiom{collect(ps,{}\spad{v})} and \axiom{ws} is \axiom{collectUpper(ps,{}\spad{v})}.
709196`\spad{sorted?(u)} tests if the elements of \spad{u} are in ascending order.
709493`\spad{sorted?(p,a)} tests if \axiom{a} is sorted according to predicate \spad{p}.
709570`\spad{source(s)} returns the list of parameter types of `s'.
709621`\spad{source(s)} returns the parameter type AST list of `s'.
709674`\spad{space} provides the blank character.
709712`\spad{space(l)} takes a list of draw options,{} \spad{l},{} and checks to see if it contains the option \spad{space}. If the the option doesn't exist,{} then an empty space is returned.
709798`\spad{space specifies} the space into which we will draw. If none is given then a new space is created.
709860`\spad{sparsityIF(m)} calculates the sparsity of a jacobian matrix
709944`\spad{specialTrigs(x,l)} should be local but conditional
710053`\spad{spherical(pt)} transforms \spad{pt} from spherical coordinates to Cartesian coordinates: the function produced will map the point \spad{(r,theta,phi)} to \spad{x = r*sin(phi)*cos(theta)},{} \spad{y = r*sin(phi)*sin(theta)},{} \spad{z = r*cos(phi)}.
710181`\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()}.
710282`\spad{splitConstant(f, x)} returns \spad{[c, g]} such that \spad{f = c * g} and \spad{c} does not involve \spad{t}.
710377`\spad{splitDenominator([q1,...,qn])} returns \spad{[[p1,...,pn], d]} such that \spad{qi = pi/d} and \spad{d} is a common denominator for the \spad{qi}'s.
710466`\spad{splitDenominator([q1,...,qn])} returns \spad{[[p1,...,pn], d]} such that \spad{qi = pi/d} and \spad{d} is a common denominator for the \spad{qi}'s.
710548`\spad{splitDenominator(q)} returns \spad{[p, d]} such that \spad{q = p/d} and \spad{d} is a common denominator for the elements of \spad{q}.
710650`\spad{splitDenominator(q)} returns \spad{[p, d]} such that \spad{q = p/d} and \spad{d} is a common denominator for the coefficients of \spad{q}.
710755`\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.
710873`\spad{splitLinear(f)} splits the linear part from an expression which it returns.
710968`\axiom{splitNodeOf!(\spad{l},{}a,{}ls)} returns \axiom{a} where the children list of \axiom{\spad{l}} has been set to \axiom{[[\spad{s}]\$\% for \spad{s} in ls | not nodeOf?(\spad{s},{}a)]}. Thus,{} if \axiom{\spad{l}} is not a node of \axiom{a},{} this latter splitting tree is unchanged.
711052`\axiom{splitNodeOf!(\spad{l},{}a,{}ls,{}sub?)} returns \axiom{a} where the children list of \axiom{\spad{l}} has been set to \axiom{[[\spad{s}]\$\% for \spad{s} in ls | not subNodeOf?(\spad{s},{}a,{}sub?)]}. Thus,{} if \axiom{\spad{l}} is not a node of \axiom{a},{} this latter splitting tree is unchanged.
711151`\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.
711275`\spad{split(u(x) + sum_{P(a)=0} Q(a,x))} returns \spad{u(x) + sum_{P1(a)=0} Q(a,x) + ... + sum_{Pn(a)=0} Q(a,x)} where \spad{P1},{}...,{}Pn are the factors of \spad{P}.
711374`\spad{split(u(x) + sum_{P(a)=0} Q(a,x))} returns \spad{u(x) + sum_{P1(a)=0} Q(a,x) + ... + sum_{Pn(a)=0} Q(a,x)} where \spad{P1},{}...,{}Pn are the factors of \spad{P}.
711517`\spad{split(p)} returns a prime factorisation of \spad{p} over its splitting field.
711571`\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.
711665`\spad{split(aG, vector)} returns a subalgebra \spad{A} of all square matrix of dimension \spad{n} as a list of list of matrices,{} generated by the list of matrices \spad{aG},{} where \spad{n} denotes both the size of vector as well as the dimension of each of the square matrices. {\em V R} is an A-module in the natural way. split(\spad{aG},{} vector) then checks whether the cyclic submodule gen
711665`--erated by {\em vector} is a proper submodule of {\em V R}. If successful,{} it returns a two-element list,{} which contains first the list of the representations of the submodule,{} then the list of the representations of the factor module. If the vector generates the whole module,{} a one-element list of the old representation is given. Note: a later version this should call the other split.
711775`\spad{split(aG,submodule)} uses a proper \spad{submodule} of {\em R**n} to create the representations of the \spad{submodule} and of the factor module.
711893`\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}.
711969`\spad{split(s,c)} returns a list of substrings delimited by character \spad{c}.
712031`\spad{split(s,cc)} returns a list of substrings delimited by characters in \spad{cc}.
712098`\spad{sqfrFactor(base,exponent)} creates a factored object with a single factor whose \spad{base} is asserted to be square-free (flag = "sqfr").
712152`\spad{sqfree(p)} returns the product of square free factors of \spad{p}
712411`\axiom{sqrt(\spad{x})} is \axiom{\spad{x} ** (1/2)}
712471`\axiom{sqrt(\spad{x})} is \axiom{\spad{x} ** (1/2)}
712521`\spad{sqrt(x)} returns the square root of \spad{x}.
712566`\axiom{sqrt(\spad{x})} is \axiom{\spad{x} ** (1/2)}
712611`\spad{sqrt(x)} represents the Fortran intrinsic function SQRT
712750`\spad{sqrt(b,a)} returns a square root of \spad{b}. Argument \spad{a} is a square root of \spad{b} \spad{(mod p)}.
712811`\axiom{sqrt(\spad{x},{}\spad{n})} is \axiom{\spad{x} ** (1/n)}
713005`\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.
713068`\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.
713146`\axiom{squareFreeFactors(\spad{p})} returns the square-free factors of \axiom{\spad{p}} over \axiom{\spad{R}}
713247`\axiom{squareFreeLexTriangular(base,{} norm?)} decomposes the variety associated with \axiom{base} into square-free regular chains. Thus a point belongs to this variety iff it is a regular zero of a re
713247`--gular set in in the output. Note that \axiom{base} needs to be a lexicographical Groebner basis of a zero-dimensional ideal. If \axiom{norm?} is \axiom{\spad{true}} then the regular sets are normalized.
713554`\spad{squareFreePart(p)} returns a polynomial which has the same irreducible factors as the univariate polynomial \spad{p},{} but each factor has multiplicity one.
713820`\spad{squareFreePart(p)} returns product of all the irreducible factors of polynomial \spad{p} each taken with multiplicity one.
713906`\spad{squareFreePart(x)} returns a product of prime factors of \spad{x} each taken with multiplicity one.
713971`\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
713971`-- such that if \spad{p} is added to \spad{ts},{} then the resulting set is a regular triangular set.
714214`\spad{squareFreePolynomial(p)} returns the square-free factorization of the univariate polynomial \spad{p}.
714357`\spad{squareFreePolynomial(p)} \undocumented{}
714525`\spad{squareFreePrim(p)} compute the square free decomposition of a primitive multivariate polynomial \spad{p}.
714605`\spad{squareFree(n)} returns the square free factorization of integer \spad{n}
714679`\spad{squareFree(p)} computes the square free decomposition of a multivariate polynomial \spad{p}.
714755`\spad{squareFree(p)} returns the square-free factorization of the polynomial \spad{p}. Each factor has no repeated roots,{} and the factors are pairwise relatively prime.
714834`\spad{squareFree(p)} computes the square-free factorization of the univariate polynomial \spad{p}. Each factor has no repeated roots,{} and the factors are pairwise relatively prime.
715165`\spad{squareFree(p)} returns the square-free factorization of the univariate polynomial \spad{p} with coefficients which are fractions of polynomials over \spad{R}. Each factor has no repeated roots and the factors are pairwise relatively prime.
715316`\spad{squareFree(p)} computes the square free decomposition of a multivariate polynomial \spad{p} presented as a univariate polynomial with multivariate coefficients.
715448`\spad{squareFree(ts)} returns the square-free factorization of \spad{ts}. Moreover,{} each factor is a Lazard triangular set and the decomposition is a Kalkbrener split of \spad{ts},{} which is enough here for the matter of solving zero-dimensional algeb
715448`--raic systems. WARNING: \spad{ts} is not checked to be zero-dimensional.
715702`\spad{squareFree(p)} returns the square free factorization of the polynomial \spad{p}.
715794`\spad{squareFree(x)} returns the square-free factorization of \spad{x} \spadignore{i.e.} such that the factors are pairwise relatively prime and each has multiple prime factors.
715865`\spad{squareMatrix(m)} converts a matrix of type \spadtype{Matrix} to a matrix of type \spadtype{SquareMatrix}.
715985`\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}.
716045`\spad{stFunc1(f)} is a local function exported due to compiler problem. This function is of no interest to the top-level user.
716153`\spad{stFunc2(f)} is a local function exported due to compiler problem. This function is of no interest to the top-level user.
716278`\spad{stFuncN(f)} is a local function xported due to compiler problem. This function is of no interest to the top-level user.
716398`\spad{stack([x,y,...,z])} creates a stack with first (top) element \spad{x},{} second element \spad{y},{}...,{}and last element \spad{z}.
716442`\spad{standardBasisOfCyclicSubmodule(lm,v)} returns a matrix as follows. It is assumed that the size \spad{n} of the vector equals the number of rows and columns of the matrices. Then the matrices generate a subalgebra,{} say \spad{A},{} of the algebra of all square matrices of dimension \spad{n}. {\em V R} is an \spad{A}-module in the natural way. standardBasisOfCyclicSub
716442`--module(\spad{lm},{}\spad{v}) calculates a matrix whose non-zero column vectors are the \spad{R}-Basis of {\em Av} achieved in the way as described in section 6 of \spad{R}. A. Parker's "The Meat-Axe". Note: in contrast to {\em cyclicSubmodule},{} the result is not in echelon form.
716575`\spad{startPolynomial(p)} uses the ideas of Schoenhage's variant of Graeffe's method to construct circles which separate roots to get a good start polynomial,{} \spadignore{i.e.} one whose image under the Chinese Remainder Isomorphism has both entries of norm smaller and greater or equal to 1. In case the roots are found during internal calculations. The corresponding factors are in {\em factors} w
716575`--hich are otherwise 1.
716682`\axiom{startStats!(\spad{x})} initializes the statisitics process and sets the comments to display when statistics are printed
716763`\axiom{startTableGcd!(\spad{s1},{}\spad{s2},{}\spad{s3})} is an internal subroutine,{} exported only for developement.
716853`\axiom{startTableGcd!(\spad{s1},{}\spad{s2},{}\spad{s3})} is an internal subroutine,{} exported only for developement.
716953`\axiom{startTableGcd!(\spad{s1},{}\spad{s2},{}\spad{s3})} is an internal subroutine,{} exported only for developement.
717161`\axiom{startTableInvSet!(\spad{s1},{}\spad{s2},{}\spad{s3})} is an internal subroutine,{} exported only for developement.
717375`\axiom{status(\spad{n})} returns the status of the node \spad{n}.
717430`\spad{status(s)} returns \spad{true} if the quasi-algebraic set is empty,{} \spad{false} if it is not,{} and "failed" if not yet known
717519`\spad{step(i)} returns the Spad AST denoting the step of the arithmetic progression represented by the iterator \spad{i}.
717561`\spad{stiffnessAndStabilityFactor(me)} calculates the stability and stiffness factor of a system of first-order differential equations (by evaluating the maximum difference in the real parts of the negative eigenvalues of the jacobian of the system for which \spad{O}(10) equates to mildly stiff wheras stiffness ratios of \spad{O}(10^6) are not uncommon) and w
717561`--hether the system is likely to show any oscillations (identified by the closeness to the imaginary axis of the complex eigenvalues of the jacobian).
717708`\spad{stiffnessAndStabilityOfODEIF(ode)} calculates the intensity values of stiffness of a system of first-order differential equations (by evaluating the maximum difference in the real parts of the n
717708`--egative eigenvalues of the jacobian of the system for which \spad{O}(10) equates to mildly stiff wheras stiffness ratios of \spad{O}(10^6) are not uncommon) and whether the system is likely to show any oscillations (identified by the closeness to the imaginary axis of the complex eigenvalues of the jacobian). \blankline It returns two values in the range [0,{}1].
718016`\spad{stirling1(n,m)} returns the Stirling number of the first kind denoted \spad{S[n,m]}.
718082`\spad{stirling2(n,m)} returns the Stirling number of the second kind denoted \spad{SS[n,m]}.
718148`\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.
718226`\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.
718319`\axiom{stopTableGcd!()} is an internal subroutine,{} exported only for developement.
718388`\axiom{stopTableGcd!()} is an internal subroutine,{} exported only for developement.
718467`\axiom{stopTableGcd!()} is an internal subroutine,{} exported only for developement.
718633`\axiom{stopTableInvSet!()} is an internal subroutine,{} exported only for developement.
718805`\spad{stop()} creates a representation of a STOP statement.
720436`\spad{string?(s)} is \spad{true} if \spad{s} is an atom and belong to Str.
720515`\spad{string(f)} creates \spad{f} with string quotes.
720557`\spad{string f} returns the decimal representation of \spad{f} in a string
720604`\spad{string i} returns the decimal representation of \spad{i} in a string
720647`\spad{string(s)} returns \spad{s} as an element of Str. Error: if \spad{s} is not an atom that also belongs to Str.
720721`\spad{string(s)} converts the symbol \spad{s} to a string. Error: if the symbol is subscripted.
720763`\spad{stripCommentsAndBlanks(s)} treats \spad{s} as a piece of AXIOM input,{} and removes comments,{} and leading and trailing blanks.
720836`\spad{strongGenerators(gp)} returns strong generators for the group {\em gp}.
720982`\axiom{stronglyReduce(\spad{p},{}ts)} returns a polynomial \axiom{\spad{r}} such that \axiom{stronglyReduced?(\spad{r},{}ts)} holds and there exists some product \axiom{\spad{h}} of \axiom{initials(ts)} such that \axiom{h*p - \spad{r}} lies in the ideal generated by \axiom{ts}.
721126`\axiom{stronglyReduced?(ts)} returns \spad{true} iff every element of \axiom{ts} is reduced \spad{w}.\spad{r}.\spad{t} to any other element of \axiom{ts}.
721278`\axiom{stronglyReduced?(\spad{p},{}ts)} returns \spad{true} iff \axiom{\spad{p}} is reduced \spad{w}.\spad{r}.\spad{t}. \axiom{ts}.
721357`\spad{structuralConstants()} calculates the structural constants \spad{[(gammaijk) for k in 1..rank()]} defined by \spad{vi * vj = gammaij1 * v1 + ... + gammaijn * vn},{} where \spad{v1},{}...,{}\spad{vn} is the fixed \spad{R}-module basis.
721448`\spad{structuralConstants()} calculates the structural constants \spad{[(gammaijk) for k in 1..rank()]} defined by \spad{vi * vj = gammaij1 * v1 + ... + gammaijn * vn},{} where \spad{v1},{}...,{}\spad{vn} is the fixed \spad{R}-module basis.
721728`\spad{structuralConstants(basis)} takes the \spad{basis} of a matrix algebra,{} \spadignore{e.g.} the result of \spadfun{basisOfCentroid} and calculates the structural constants. Note,{} that the it is not checked,{} whether \spad{basis} really is a \spad{basis} of a matrix algebra.
721830`\spad{structuralConstants([v1,v2,...,vm])} calculates the structural constants \spad{[(gammaijk) for k in 1..m]} defined by \spad{vi * vj = gammaij1 * v1 + ... + gammaijm * vm},{} where \spad{[v1,...,vm]} is an \spad{R}-module basis of a subalgebra.
721932`\spad{structuralConstants(ls,mt)} determines the structural constants of an algebra with generators \spad{ls} and multiplication table \spad{mt},{} the entries of which must be given as linear polynomials in the indeterminates given by \spad{ls}. The result is in particular useful \indented{1}{as fourth argument for \spadtype{AlgebraGivenByStructuralCon
721932`--stants}} \indented{1}{and \spadtype{GenericNonAssociativeAlgebra}.}
722085`\spad{structuralConstants(ls,mt)} determines the structural constants of an algebra with generators \spad{ls} and multiplication table \spad{mt},{} the entries of which must be given as linear polynomials in the indeterminates given by \spad{ls}. The result is in particular useful \indented{1}{as fourth argument for \spadtype{AlgebraGivenByStructuralConstants}} \indented{1
722085`--}{and \spadtype{GenericNonAssociativeAlgebra}.}
722218`\spad{sts2stst(v,s)} is used internally.
722330`\axiom{sturmSequence(\spad{p}) = sylvesterSequence(\spad{p},{}p')}
722433`\axiom{sturmVariationsOf(\spad{l})} is the number of sign variations in the list of numbers \spad{l},{} note that the first term counts as a sign
722577`\spad{style(s)} specifies the drawing style in which the graph will be plotted by the indicated string \spad{s}. This option is expressed in the form \spad{style == s}.
722622`\spad{style(l,s)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{style}. If the option does not exist the value,{} \spad{s} is returned.
722698`\axiom{subCase?(\spad{lpwt1},{}\spad{lpwt2})} is an internal subroutine,{} exported only for developement.
722825`\axiom{subCase?(\spad{lpwt1},{}\spad{lpwt2})} is an internal subroutine,{} exported only for developement.
722962`\spad{subHeight(f)} returns the height of form \spad{f} below the base line.
723099`\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}.
723191`\axiom{subNode?(\spad{n1},{}\spad{n2},{}\spad{o2})} returns \spad{true} iff \axiom{value(\spad{n1}) = value(\spad{n2})} and \axiom{\spad{o2}(condition(\spad{n1}),{}condition(\spad{n2}))}
723266`\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?)}.
723359`\axiom{subPolSet?(\spad{lp1},{}\spad{lp2})} returns \spad{true} iff \axiom{\spad{lp1}} is a sub-set of \axiom{\spad{lp2}}.
723446`\axiom{subPolSet?(\spad{lp1},{}\spad{lp2})} returns \spad{true} iff \axiom{\spad{lp1}} is a sub-set of \axiom{\spad{lp2}}.
723543`\axiom{subQuasiComponent?(ts,{}lus)} returns \spad{true} iff \axiom{subQuasiComponent?(ts,{}us)} holds for one \spad{us} in \spad{lus}.
723634`\axiom{subQuasiComponent?(ts,{}lus)} returns \spad{true} iff \axiom{subQuasiComponent?(ts,{}us)} holds for one \spad{us} in \spad{lus}.
723735`\axiom{subQuasiComponent?(ts,{}us)} returns \spad{true} iff \axiomOpFrom{internalSubQuasiComponent?}{QuasiComponentPackage} returs \spad{true}.
723820`\axiom{subQuasiComponent?(ts,{}us)} returns \spad{true} iff \axiomOpFrom{internalSubQuasiComponent?(ts,{}us)}{QuasiComponentPackage} returs \spad{true}.
723915`\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}}.
724022`\axiom{subResultantGcdEuclidean(\spad{P},{}\spad{Q})} carries out the equality \axiom{coef1*P + coef2*Q = +/- S_i(\spad{P},{}\spad{Q})} where the degree (not the indice) of the subresultant \axiom{S_i(\spad{P},{}\spad{Q})} is the smaller as possible.
724146`\axiom{subResultantGcd(\spad{P},{} \spad{Q})} returns the gcd of two primitive polynomials \axiom{\spad{P}} and \axiom{\spad{Q}}.
724227`\axiom{subResultantGcd(a,{}\spad{b})} computes a gcd of \axiom{a} and \axiom{\spad{b}} where \axiom{a} and \axiom{\spad{b}} are assumed to have the same main variable \axiom{\spad{v}} and are viewed as univariate polynomials in \axiom{\spad{v}} with coefficients in the fraction field of the polynomial ring generated by their other variables over \axiom{\spad{R}}.
724326`\spad{subResultantGcd(p,q)} computes the gcd of the polynomials \spad{p} and \spad{q} using the SubResultant GCD algorithm.
724422`\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.
724528`\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))}.
724627`\axiom{subTriSet?(ts,{}us)} returns \spad{true} iff \axiom{ts} is a sub-set of \axiom{us}.
724704`\axiom{subTriSet?(ts,{}us)} returns \spad{true} iff \axiom{ts} is a sub-set of \axiom{us}.
724791`\spad{sub(f,n)} creates a form for \spad{f} subscripted by \spad{n}.
724833`\spad{submod(a,b,p)},{} \spad{0<=a,b<p>1},{} means \spad{a-b mod p}.
724890`\spad{subresultantSequence(p1,p2)} computes the (standard) subresultant sequence of \spad{p1} and \spad{p2}
725038`\spad{subresultantVector(p, q)} returns \spad{[p0,...,pn]} where \spad{pi} is the \spad{i}-th subresultant of \spad{p} and \spad{q}. In particular,{} \spad{p0 = resultant(p, q)}.
725126`\spad{subscript(s, [a1,...,an])} returns \spad{s} subscripted by \spad{[a1,...,an]}.
725184`\spad{subscriptedVariables(e)} \undocumented{}
725345`\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})}.
725401`\spad{subspace()} \undocumented
725446`\spad{subspace(s)} returns the \spadtype{SubSpace} which holds all the point information in the \spadtype{ThreeSpace},{} \spad{s}.
725512`\spad{subspace(v)} returns the contents of the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport},{} as a subspace of the domain \spad{ThreeSpace}.
725591`\spad{subspace(v,sp)} places the contents of the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport},{} in the subspace \spad{sp},{} which is of the domain \spad{ThreeSpace}.
725901`\spad{subst(f, k = g)} replaces the kernel \spad{k} by \spad{g} formally in \spad{f}.
725960`\spad{subst(f, [k1 = g1,...,kn = gn])} replaces the kernels \spad{k1},{}...,{}kn by \spad{g1},{}...,{}gn formally in \spad{f}.
726025`\spad{subst(eq1,eq2)} substitutes \spad{eq2} into both sides of \spad{eq1} the lhs of \spad{eq2} should be a kernel
726224`\spad{subst(f, [k1...,kn], [g1,...,gn])} replaces the kernels \spad{k1},{}...,{}kn by \spad{g1},{}...,{}gn formally in \spad{f}.
726296`\spad{substitute(x,y,d)} replace \spad{x}'s with \spad{y}'s in dictionary \spad{d}.
726358`\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})}.
726490`\spad{subtractIfCan(x, y)} returns an element \spad{z} such that \spad{z+y=x} or "failed" if no such element exists.
726573`\spad{suchThat(p, f)} makes a copy of \spad{p} and adds the predicate \spad{f} to the copy,{} which is returned.
726658`\spad{suchThat(p, [f1,...,fn])} makes a copy of \spad{p} and adds the predicate \spad{f1} and ... and fn to the copy,{} which is returned.
726749`\spad{suchThat(x, foo)} attaches the predicate foo to \spad{x}; error if \spad{x} is not a symbol.
726830`\spad{suchThat(x, [f1, f2, ..., fn])} attaches the predicate \spad{f1} and \spad{f2} and ... and fn to \spad{x}. Error: if \spad{x} is not a symbol.
726917`\spad{suchThat(x, foo)} attaches the predicate foo to \spad{x}.
727004`\spad{suchThat(x, [f1, f2, ..., fn])} attaches the predicate \spad{f1} and \spad{f2} and ... and fn to \spad{x}.
727097`\spad{suchThat(p, [a1,...,an], f)} returns a copy of \spad{p} with the top-level predicate set to \spad{f(a1,...,an)}.
727201`\spad{suchThat(r, [a1,...,an], f)} returns the rewrite rule \spad{r} with the predicate \spad{f(a1,...,an)} attached to it.
727288`\spad{suffix?(s,t)} tests if the string \spad{s} is the final substring of \spad{t}. Note: \axiom{suffix?(\spad{s},{}\spad{t}) == reduce(and,{}[\spad{s}.\spad{i} = \spad{t}.(\spad{n} - \spad{m} + \spad{i}) for \spad{i} in 0..maxIndex \spad{s}])} where \spad{m} and \spad{n} denote the maxIndex of \spad{s} and \spad{t} respectively.
727344`\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)}.
727421`\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)}.
727525`\spad{sumOfSquares(f)} returns either an expression for which the square is the original function of "failed".
727637`\spad{sumSquares(p)} construct \spad{a} and \spad{b} such that \spad{a**2+b**2} is equal to the integer prime \spad{p},{} and otherwise returns an error. It will succeed if the prime number \spad{p} is 2 or congruent to 1 mod 4.
727717`\spad{sum(expr)} creates the form prefixing \spad{expr} by a capital sigma.
727756`\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)}.
727830`\spad{sum(expr,lowerlimit)} creates the form prefixing \spad{expr} by a capital sigma with a \spad{lowerlimit}.
727872`\spad{sum(f(n), n = a..b)} returns \spad{f}(a) + \spad{f}(\spad{a+1}) + ... + \spad{f}(\spad{b}).
727938`\spad{sum(a(n), n)} returns A(\spad{n}) such that A(\spad{n+1}) - A(\spad{n}) = a(\spad{n}).
727993`\spad{sum(f(n), n = a..b)} returns \spad{f(a) + f(a+1) + ... f(b)}.
728147`\spad{sum(a(n), n)} returns \spad{A} which is the indefinite sum of \spad{a} with respect to upward difference on \spad{n},{} \spadignore{i.e.} \spad{A(n+1) - A(n) = a(n)}.
728268`\spad{sum(f(n), n = a..b)} returns \spad{f(a) + f(a+1) + ... f(b)}.
728381`\spad{sum(a(n), n)} returns \spad{A} which is the indefinite sum of \spad{a} with respect to upward difference on \spad{n},{} \spadignore{i.e.} \spad{A(n+1) - A(n) = a(n)}.
728471`\spad{sum(p(n), n = a..b)} returns \spad{p(a) + p(a+1) + ... + p(b)}.
728556`\spad{sum(expr,lowerlimit,upperlimit)} creates the form prefixing \spad{expr} by a capital sigma with both a \spad{lowerlimit} and \spad{upperlimit}.
728601`\spad{summation(f(n), n = a..b)} returns \spad{f}(a) + ... + \spad{f}(\spad{b}) as a formal sum.
728678`\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}).
728744`\spad{summation(f(n), n = a..b)} returns \spad{f}(a) + ... + \spad{f}(\spad{b}) as a formal sum.
728822`\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}).
728888`\axiom{supDimElseRittWu(ts,{}us)} returns \spad{true} iff \axiom{ts} has less elements than \axiom{us} otherwise if \axiom{ts} has higher rank than \axiom{us} \spad{w}.\spad{r}.\spad{t}. Riit and Wu ordering.
728972`\axiom{supDimElseRittWu(ts,{}us)} returns \spad{true} iff \axiom{ts} has less elements than \axiom{us} otherwise if \axiom{ts} has higher rank than \axiom{us} \spad{w}.\spad{r}.\spad{t}. Riit and Wu ordering.
729139`\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.
729217`\spad{sup(u)} returns the supremum of \axiom{\spad{u}}.
729264`\spad{sup(x,y)} returns the least element from which both \spad{x} and \spad{y} can be subtracted.
729319`\spad{superHeight(f)} returns the height of form \spad{f} above the base line.
729371`\spad{super(f,n)} creates a form for \spad{f} superscripted by \spad{n}.
729415`\spad{superscript(s, [a1,...,an])} returns \spad{s} superscripted by \spad{[a1,...,an]}.
729475`\spad{supersub(a,[sub1,super1,sub2,super2,...])} creates a form with each subscript aligned under each superscript.
729528`\spad{support p} returns the set of points not fixed by the permutation \spad{p}.
729587`\spad{support(gp)} returns the points moved by the group {\em gp}.
729643`\spad{surface(c1,c2,c3)} creates a surface from 3 parametric component functions \spad{c1},{} \spad{c2},{} and \spad{c3}.
729833`\spad{swap!(u,i,j)} interchanges elements \spad{i} and \spad{j} of aggregate \spad{u}. No meaningful value is returned.
730016`\spad{swapColumns!(m,i,j)} interchanges the \spad{i}th and \spad{j}th columns of \spad{m}. This destructively alters the matrix.
730166`\spad{swapRows!(m,i,j)} interchanges the \spad{i}th and \spad{j}th rows of \spad{m}. This destructively alters the matrix.
730242`\spad{swap(p(x,y))} returns \spad{p}(\spad{y},{}\spad{x}).
730322`\spad{swap(eq)} interchanges left and right hand side of equation \spad{eq}.
730363`\spad{sylvesterMatrix(p,q)} returns the Sylvester matrix for the two polynomials \spad{p} and \spad{q}.
730434`\axiom{sylvesterSequence(\spad{p},{}\spad{q})} is the negated remainder sequence of \spad{p} and \spad{q} divided by the last computed term
730549`\spad{symFunc([r1,...,rn])} returns the vector of the elementary symmetric functions in the \spad{ri's}: \spad{[r1 + ... + rn, r1 r2 + ... + r(n-1) rn, ..., r1 r2 ... rn]}.
730615`\spad{symFunc(r, n)} returns the vector of the elementary symmetric functions in \spad{[r,r,...,r]} \spad{n} times.
730691`\spad{symbol?(p)} tests if \spad{p} is a symbol.
730739`\spad{symbol?(s)} is \spad{true} if \spad{s} is an atom and belong to Sym.
730818`\spad{symbolIfCan(k)} returns \spad{k} viewed as a symbol if \spad{k} is a symbol,{} and "failed" otherwise.
730884`\spad{symbolTableOf(f,tab)} returns the symbol table of \spad{f}
730953`\spad{symbolTable(l)} creates a symbol table from the elements of \spad{l}.
731041`\spad{symbol(s)} returns \spad{s} as an element of Sym. Error: if \spad{s} is not an atom that also belongs to Sym.
731254`\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.
731320`\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.
731521`\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}))}
731584`\spad{symmetricGroup(li)} constructs the symmetric group acting on the integers in the list {\em li},{} generators are the cycle given by {\em li} and the 2-cycle {\em (li.1,li.2)}. Note: duplicates in the list will be removed.
731682`\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)}.
731782`\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}.
731898`\spad{symmetricPower(a,n,D)} computes an operator \spad{c} of minimal order such that the nullspace of \spad{c} is generated by all the products of \spad{n} solutions of \spad{a}. \spad{D} is the derivation to use.
732005`\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}.
732107`\spad{symmetricProduct(a,b,D)} computes an operator \spad{c} of minimal order such that the nullspace of \spad{c} is generated by all the products of a solution of \spad{a} by a solution of \spad{b}. \spad{D} is the derivation to use.
732260`\spad{symmetricRemainder(a,b)} (where \spad{b > 1}) yields \spad{r} where \spad{ -b/2 <= r < b/2 }.
732407`\spad{symmetricSquare(a)} computes \spad{symmetricProduct(a,a)} using a more efficient method.
732505`\spad{symmetricTensors(la,n)} applies to each \spad{m}-by-\spad{m} square matrix in the list {\em la} the irreducible,{} polynomial representation of the general linear group {\em GLm} which corresponds to the partition {\em (n,0,...,0)} of \spad{n}. Error: if the matrices in {\em la} are not square matrices. Note: this corresponds to the symmetrization of the representation with the trivial repr
732505`--esentation of the symmetric group {\em Sn}. The carrier spaces of the representation are the symmetric tensors of the \spad{n}-fold tensor product.
732614`\spad{symmetricTensors(a,n)} applies to the \spad{m}-by-\spad{m} square matrix {\em a} the irreducible,{} polynomial representation of the general linear group {\em GLm} which corresponds to the partition {\em (n,0,...,0)} of \spad{n}. Error: if {\em a} is not a square matrix. Note: this corresponds to the symmetrization of the representation with the trivial representation of the symmetric group {\em Sn}. T
732614`--he carrier spaces of the representation are the symmetric tensors of the \spad{n}-fold tensor product.
732711`\spad{systemCommand(cmd)} takes the string \spadvar{\spad{cmd}} and passes it to the runtime environment for execution as a system command. Although various things may be printed,{} no usable value is returned.
732774`\spad{systemSizeIF(ode)} returns the intensity value of the size of the system of ODEs. 20 equations corresponds to the neutral value. It returns a value in the range [0,{}1].
733020`\spad{tRange(p)} returns the range of the parameter in a parametric plot \spad{p}.
733076`\spad{tRange(p)} returns the range of the parameter in a parametric plot \spad{p}
733130`\spad{tValues(p)} returns a list of lists of the values of the parameter for which a point is computed,{} one list for each curve in the plot \spad{p}.
733190`\spad{t(n)} \undocumented
733264`\spad{tab1(lp)} creates a tableau from a list of pairs \spad{lp}
733340`\spad{tab(ls)} creates a tableau from \spad{ls} by first creating a list of pairs using \spadfunFrom{slex}{TableauBumpers},{} then creating a tableau using \spadfunFrom{\spad{tab1}}{TableauBumpers}.
733406`\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.}
733520`\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}.
733678`\spad{table()}\$\spad{T} creates an empty table of type \spad{T}.
733815`\spad{table([x,y,...,z])} creates a table consisting of entries \axiom{\spad{x},{}\spad{y},{}...,{}\spad{z}}.
733902`\spad{tableau(ll)} converts a list of lists \spad{ll} to a tableau.
734113`\spad{tail(l)} returns the doubly-linked aggregate \spad{l} starting at its second element. Error: if \spad{l} is empty.
734167`\axiom{tail(\spad{p})} returns its reductum,{} where \axiom{\spad{p}} is viewed as a univariate polynomial in its main variable.
734231`\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})}.
734287`\spad{tan2cot(f)} converts every \spad{tan(u)} appearing in \spad{f} into \spad{1/cot(u)}.
734350`\spad{tan2trig(f)} converts every \spad{tan(u)} appearing in \spad{f} into \spad{sin(u)/cos(u)}.
734414`\spad{tanAn(a, n)} returns \spad{P(x)} such that if \spad{a = tan(u)} then \spad{P(tan(u/n)) = 0}.
734507`\spad{tanIfCan(z)} returns tan(\spad{z}) if possible,{} and "failed" otherwise.
734588`\spad{tanNa(a, n)} returns \spad{f(a)} such that if \spad{a = tan(u)} then \spad{f(a) = tan(n * u)}.
734645`\spad{tanQ(q,a)} is a local function with a conditional implementation.
734730`\spad{tanSum([a1,...,an])} returns \spad{f(a1,...,an)} such that if \spad{ai = tan(ui)} then \spad{f(a1,...,an) = tan(u1 + ... + un)}.
734786`\spad{tan(x)} applies the tangent operator to \spad{x}
734992`\spad{tan(st)} computes tangent of a power series \spad{st}.
735076`\spad{tan(st)} computes tangent of a power series \spad{st}.
735174`\spad{tan(z)} returns the tangent of Laurent series \spad{z}.
735261`\spad{tan(z)} returns the tangent of a Puiseux series \spad{z}.
735357`\spad{tan(x)} returns the tangent of \spad{x}.
735415`\spad{tan(x)} represents the Fortran intrinsic function TAN
735496`\spad{tanh2coth(f)} converts every \spad{tanh(u)} appearing in \spad{f} into \spad{1/coth(u)}.
735561`\spad{tanh2trigh(f)} converts every \spad{tanh(u)} appearing in \spad{f} into \spad{sinh(u)/cosh(u)}.
735627`\spad{tanhIfCan(z)} returns tanh(\spad{z}) if possible,{} and "failed" otherwise.
735709`\spad{tanh(x)} applies the hyperbolic tangent operator to \spad{x}
735916`\spad{tanh(st)} computes the hyperbolic tangent of a power series \spad{st}.
736001`\spad{tanh(st)} computes the hyperbolic tangent of a power series \spad{st}.
736100`\spad{tanh(z)} returns the hyperbolic tangent of Laurent series \spad{z}.
736188`\spad{tanh(z)} returns the hyperbolic tangent of a Puiseux series \spad{z}.
736285`\spad{tanh(x)} returns the hyperbolic tangent of \spad{x}.
736341`\spad{tanh(x)} represents the Fortran intrinsic function TANH
736423`\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}.
736599`\spad{target(s)} returns the target type of the signature `s'.
736644`\spad{target(e)} returns the target type of the conversion..
736690`\spad{target(s)} returns the result type AST for `s'.
736737`\spad{target(e)} returns the target type of the conversion..
736784`\spad{target(e)} returns the target type of the conversion..
736832`\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.
736938`\spad{taylorQuoByVar(a0 + a1 x + a2 x**2 + ...)} returns \spad{a1 + a2 x + a3 x**2 + ...}
737016`\spad{taylorRep(f(x))} returns \spad{g(x)},{} where \spad{f = x**n * g(x)} is represented by \spad{[n,g(x)]}.
737104`\spad{taylor(f)} returns a Taylor expansion of the expression \spad{f}. Note: \spad{f} should have only one variable; the series will be expanded in powers of that variable.
737176`\spad{taylor(x)} returns \spad{x} viewed as a Taylor series.
737252`\spad{taylor(f(x))} converts the Laurent series \spad{f}(\spad{x}) to a Taylor series,{} if possible. Error: if this is not possible.
737337`\spad{taylor(n +-> a(n),x = a)} returns \spad{sum(n = 0..,a(n)*(x-a)**n)}.
737429`\spad{taylor(f,x = a)} expands the expression \spad{f} as a Taylor series in powers of \spad{(x - a)}.
737514`\spad{taylor(f,n)} returns a Taylor expansion of the expression \spad{f}. Note: \spad{f} should have only one variable; the series will be expanded in powers of that variable and terms will be computed up to order at least \spad{n}.
737605`\spad{taylor(n +-> a(n),x = a,n0..)} returns \spad{sum(n=n0..,a(n)*(x-a)**n)}; \spad{taylor(n +-> a(n),x = a,n0..n1)} returns \spad{sum(n = n0..,a(n)*(x-a)**n)}.
737734`\spad{taylor(f,x = a)} expands the expression \spad{f} as a Taylor series in powers of \spad{(x - a)}; terms will be computed up to order at least \spad{n}.
737838`\spad{taylor(a(n),n,x = a)} returns \spad{sum(n = 0..,a(n)*(x-a)**n)}.
737926`\spad{taylor(a(n),n,x = a,n0..)} returns \spad{sum(n = n0..,a(n)*(x-a)**n)}; \spad{taylor(a(n),n,x = a,n0..n1)} returns \spad{sum(n = n0..,a(n)*(x-a)**n)}.
738051`\spad{tensorProduct([a1,...ak])} calculates the list of Kronecker products of each matrix {\em ai} with itself for {1 <= \spad{i} <= \spad{k}}. Note: If the list of matrices corresponds to a group representation (repr. of generators) of one group,{} then these matrices correspond to the tensor product of the representation with itself.
738141`\spad{tensorProduct(a)} calculates the Kronecker product of the matrix {\em a} with itself.
738219`\spad{tensorProduct([a1,...,ak],[b1,...,bk])} calculates the list of Kronecker products of the matrices {\em ai} and {\em bi} for {1 <= \spad{i} <= \spad{k}}. Note: If each list of matrices corresponds to a group representation (repr. of generators) of one group,{} then these matrices correspond to the tensor product of the two representations.
738325`\spad{tensorProduct(a,b)} calculates the Kronecker product of the matrices {\em a} and \spad{b}. Note: if each matrix corresponds to a group representation (repr. of generators) of one group,{} then these matrices correspond to the tensor product of the two representations.
738413`\spad{terms(f)} gives the list of non-zero coefficients combined with their corresponding basis element as records. This is the internal representation.
738485`\spad{terms x} returns the list of terms in \spad{x}. Each term is a pair of a support (the first component) and the corresponding value (the second component).
738562`\spad{terms(e1 a1 + ... + en an)} returns \spad{[[a1, e1],...,[an, en]]}.
738646`\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.
738746`\spad{testDim(lp,lv)} tests if the polynomial system \spad{lp} in variables \spad{lv} is zero dimensional.
738954`\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.
739021`\spad{test(b)} returns \spad{b} and is provided for compatibility with the new compiler.
739058`\spad{tex(t)} extracts the TeX section of a TeX form \spad{t}.
739106`\spad{thenBranch(e)} returns the `then-branch' of `e'.
739152`\spad{thetaCoord(pt)} returns the second element of the point,{} \spad{pt},{} although no assumptions are made as to the coordinate system being used. This function is defined for the convenience of the user dealing with a spherical or a cylindrical coordinate system.
739260`\spad{third(u)} returns the third element of \spad{u}. Note: \axiom{third(\spad{u}) = first(rest(rest(\spad{u})))}.
739316`\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.
739417`\spad{times(p, q, sigma, delta)} returns \spad{p * q}. \spad{\sigma} and \spad{\delta} are the maps to use.
739511`\spad{title(s)} specifies a title for a plot by the indicated string \spad{s}. This option is expressed in the form \spad{title == s}.
739556`\spad{title(l,s)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{title}. If the option does not exist the value,{} \spad{s} is returned.
739632`\spad{title(v,s)} changes the title which is shown in the two-dimensional viewport window,{} \spad{v} of domain \spadtype{TwoDimensionalViewport}.
739694`\spad{title(v,s)} changes the title which is shown in the three-dimensional viewport window,{} \spad{v} of domain \spadtype{ThreeDimensionalViewport}.
739758`\spad{toScale(b)} specifies whether or not a plot is to be drawn to scale; if \spad{b} is \spad{true} it is drawn to scale,{} if \spad{b} is \spad{false} it is not. This option is expressed in the form \spad{toScale == b}.
739806`\spad{toScale(l,b)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{toScale}. If the option does not exist the value,{} \spad{b} is returned.
739886`\spad{top!(d)} returns the element at the top (front) of the dequeue.
739934`\spad{topFortranOutputStack()} returns the top element of the Fortran output stack
740008`\spad{topPredicate(x)} returns \spad{[[a1,...,an], f]} where the top-level predicate of \spad{x} is \spad{f(a1,...,an)}. Note: \spad{n} is 0 if \spad{x} has no top-level predicate.
740087`\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}.
740132`\spad{toroidal(a)} transforms from toroidal coordinates to Cartesian coordinates: \spad{toroidal(a)} is a function which will map the point \spad{(u,v,phi)} to \spad{x = a*sinh(v)*cos(phi)/(cosh(v)-cos(u))},{} \spad{y = a*sinh(v)*sin(phi)/(cosh(v)-cos(u))},{} \spad{z = a*sin(u)/(cosh(v)-cos(u))}.
740203`\spad{torsion?(f)} \undocumented
740301`\spad{torsion?(f)} \undocumented
740418`\spad{torsionIfCan(f)}\\ undocumented
740572`\spad{torsionIfCan(f)} \undocumented
740745`\axiom{toseInvertible?(\spad{p1},{}\spad{p2},{}ts)} has the same specifications as \axiomOpFrom{invertible?}{RegularTriangularSetCategory}.
740835`\axiom{toseInvertible?(\spad{p1},{}\spad{p2},{}ts)} has the same specifications as \axiomOpFrom{invertible?}{RegularTriangularSetCategory}.
740952`\axiom{toseInvertibleSet(\spad{p1},{}\spad{p2},{}ts)} has the same specifications as \axiomOpFrom{invertibleSet}{RegularTriangularSetCategory}.
741045`\axiom{toseLastSubResultant(\spad{p1},{}\spad{p2},{}ts)} has the same specifications as \axiomOpFrom{lastSubResultant}{RegularTriangularSetCategory}.
741163`\axiom{toseSquareFreePart(\spad{p},{}ts)} has the same specifications as \axiomOpFrom{squareFreePart}{RegularTriangularSetCategory}.
741436`\spad{totalDegree(p)} returns the largest sum over all monomials of all exponents of a monomial.
741719`\spad{totalDegree(p, lv)} returns the maximum sum (over all monomials of polynomial \spad{p}) of the variables in the list lv.
741815`\spad{totalDifferential(x)} returns the total differential (gradient) form for element \spad{x}.
741910`\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}.
742011`\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.
742091`\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.
742215`\spad{totolex }\undocumented
742425`\spad{tower(f)} returns all the kernels appearing in \spad{f},{} no matter what their levels are.
742485`\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}.
742574`\spad{traceMatrix()} is the \spad{n}-by-\spad{n} matrix ( \spad{Tr(vi * vj)} ),{} where \spad{v1},{} ...,{} vn are the elements of the fixed basis.
742638`\spad{traceMatrix()} is the \spad{n}-by-\spad{n} matrix ( \spad{Tr(vi * vj)} ),{} where \spad{v1},{} ...,{} vn are the elements of the fixed basis.
742837`\spad{traceMatrix([v1,..,vn])} is the \spad{n}-by-\spad{n} matrix ( Tr(\spad{vi} * vj) )
742912`\spad{tracePowMod(u,k,v)} produces the sum of \spad{u**(q**i)} for \spad{i} running and q= size \spad{F}
743164`\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}.
743226`\spad{trace(a)} returns the trace of the regular representation of \spad{a} with respect to any basis.
743279`\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}.
743419`\spad{trace(x,n)} \undocumented{} See \axiomFunFrom{trace}{FiniteAlgebraicExtensionField}
743516`\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])}.
743608`\spad{trailingCoefficient }\undocumented
743763`\spad{transcendenceDegree()} returns the transcendence degree of the field extension,{} 0 if the extension is algebraic.
743968`\spad{transcendent?(a)} tests whether an element \spad{a} is transcendent with respect to the ground field \spad{F}.
744671`\spad{transform }\undocumented
744815`\spad{translate(X,Y,Z)} returns a dhmatrix for translation by \spad{X},{} \spad{Y},{} and \spad{Z}
744879`\spad{translate(v,dx,dy)} sets the horizontal viewport offset to \spad{dx} and the vertical viewport offset to \spad{dy},{} for the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport}.
744952`\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 th
744952`--e center of the viewport.
745151`\spad{transpose(r)} converts the row \spad{r} to a row matrix.
745212`\spad{transpose(m)} returns the transpose of the matrix \spad{m}.
745272`\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)}.}
745335`\spad{transpose(m)} returns the transpose of the matrix \spad{m}.
745390`\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)}.}
745469`\spad{trapezoidal(fn,a,b,epsrel,epsabs,nmin,nmax)} uses the trapezoidal method to numerically integrate function \spadvar{\spad{fn}} over the closed interval \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin} to \sp
745469`--ad{nmax}. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
745639`\spad{trapezoidalo(fn,a,b,epsrel,epsabs,nmin,nmax)} uses the trapezoidal method to numerically integrate function \spad{fn} over the open interval from \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin} to \spad{nm
745639`--ax}. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
745810`\spad{traverse(s,li)} follows the branch list of the 3 dimensional subspace,{} \spad{s},{} along the path dictated by the list of non negative integers,{} \spad{li},{} which points to the component which has been traversed to. The subspace,{} \spad{s},{} is returned,{} where \spad{s} is now the subspace pointed to by \spad{li}.
745882`\spad{tree(ls)} creates a tree from a list of elements of \spad{s}.
745924`\spad{tree(nd)} creates a tree with value \spad{nd},{} and no children
745960`\spad{tree(nd,ls)} creates a tree with value \spad{nd},{} and children \spad{ls}.
746005`\spad{triangSolve(lp)} returns the same as \spad{triangSolve(lp,false,false)}
746118`\spad{triangSolve(lp,info?)} returns the same as \spad{triangSolve(lp,false)}
746239`\spad{triangSolve(lp,info?,lextri?)} decomposes the variety associated with \axiom{\spad{lp}} into regular chains. Thus a point belongs to this variety iff it is a regular zero of a regular set in in the output. Note that \axiom{\spad{lp}} needs to generate a zero-dimensional ideal. If \axiom{\spad{lp}} is not zero-dimensional then the result is only a decomposition of its zer
746239`--o-set in the sense of the closure (\spad{w}.\spad{r}.\spad{t}. Zarisky topology). Moreover,{} if \spad{info?} is \spad{true} then some information is displayed during the computations. See \axiomOpFrom{zeroSetSplit}{RegularTriangularSetCategory}(\spad{lp},{}\spad{true},{}\spad{info?}). If \spad{lextri?} is \spad{true} then the lexTriangular algorithm is called from the \spadtype{LexTriangularPackage} constructor (see \axiomOpFrom{zeroSetSplit}{LexTriangularPackage}(\spad{lp},{}\spad{false})). 
746239`--Otherwise,{} the triangular decomposition is computed directly from the input system by using the \axiomOpFrom{zeroSetSplit}{RegularChain} from \spadtype{RegularChain}.
746441`\axiom{triangular?(ps)} returns \spad{true} iff \axiom{ps} is a triangular set,{} \spadignore{i.e.} two distinct polynomials have distinct main variables and no constant lies in \axiom{ps}.
746539`\spad{triangularSystems(lf,lv)} solves the system of equations defined by \spad{lf} with respect to the list of symbols \spad{lv}; the system of equations is obtaining by equating to zero the list of rational functions \spad{lf}. The output is a list of solutions where each solution is expressed as a "reduced" triangular system of polynomials.
746666`\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}.
746811`\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}.
746921`\spad{trigs2explogs(f, [k1,...,kn], [x1,...,xm])} rewrites all the trigonometric functions appearing in \spad{f} and involving one of the \spad{xi's} in terms of complex logarithms and exponentials. A kernel of the form \spad{tan(u)} is expressed using \spad{exp(u)**2} if it is one of the \spad{ki's},{} in terms of \spad{exp(2*u)} otherwise.
747029`\spad{trigs(f)} rewrites all the complex logs and exponentials appearing in \spad{f} in terms of trigonometric functions.
747096`\spad{trigs(f)} rewrites all the complex logs and exponentials appearing in \spad{f} in terms of trigonometric functions.
747263`\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"}.
747318`\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"}.
747453`\axiom{trivialIdeal?(ps)} returns \spad{true} iff \axiom{ps} does not contain non-zero elements.
747532`\spad{trueEqual(x,y)} tries to determine if the two numbers are equal
747595`\spad{true} is a logical constant.
747641`\axiom{trunc(\spad{p},{}\spad{n})} returns the polynomial \axiom{\spad{p}} truncated at order \axiom{\spad{n}}.
747715`\spad{trunc(p,n)} returns the polynomial \spad{p} truncated at order \spad{n}.
747832`\spad{truncate x} returns the integer between \spad{x} and 0 closest to \spad{x}.
747882`\spad{truncate(f,k)} returns a (finite) power series consisting of the sum of all terms of \spad{f} of degree \spad{<= k}.
747963`\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}.
748050`\spad{tryFunctionalDecomposition?()} returns \spad{true} if factorizers try functional decomposition of polynomials before factoring them.
748131`\spad{tryFunctionalDecomposition(b)} chooses whether factorizers have to look for functional decomposition of polynomials (\spad{true}) or not (\spad{false}). Returns the previous value.
748218`\spad{tubePlot(f,g,h,colorFcn,a..b,r,n)} puts a tube of radius \spad{r}(\spad{t}) with \spad{n} points on each circle about the curve \spad{x = f(t)},{} \spad{y = g(t)},{} \spad{z = h(t)} for \spad{t} in \spad{[a,b]}. The tube is considered to be open.
748424`\spad{tubePlot(f,g,h,colorFcn,a..b,r,n)} puts a tube of radius \spad{r} with \spad{n} points on each circle about the curve \spad{x = f(t)},{} \spad{y = g(t)},{} \spad{z = h(t)} for \spad{t} in \spad{[a,b]}. The tube is considered to be open.
748615`\spad{tubePlot(f,g,h,colorFcn,a..b,r,n,s)} puts a tube of radius \spad{r(t)} with \spad{n} points on each circle about the curve \spad{x = f(t)},{} \spad{y = g(t)},{} \spad{z = h(t)} for \spad{t} in \spad{[a,b]}. If \spad{s} = "closed",{} the tube is considered to be closed; if \spad{s} = "open
748615`--",{} the tube is considered to be open.
748828`\spad{tubePlot(f,g,h,colorFcn,a..b,r,n,s)} puts a tube of radius \spad{r} with \spad{n} points on each circle about the curve \spad{x = f(t)},{} \spad{y = g(t)},{} \spad{z = h(t)} for \spad{t} in \spad{[a,b]}. If \spad{s} = "closed",{} the tube is considered to be closed; if \spad{s} = "open",{} the tube is c
748828`--onsidered to be open.
749026`\spad{tubePointsDefault()} returns the number of points to be used when creating the circle to be used in creating a 3D tube plot.
749099`\spad{tubePointsDefault(i)} sets the number of points to use when creating the circle to be used in creating a 3D tube plot to \spad{i}.
749187`\spad{tubePoints(n)} specifies the number of points,{} \spad{n},{} defining the circle which creates the tube around a 3D curve,{} the default is 6. This option is expressed in the form \spad{tubePoints == n}.
749246`\spad{tubePoints(l,n)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{tubePoints}. If the option does not exist the value,{} \spad{n} is returned.
749345`\spad{tubeRadiusDefault()} returns the radius used for a 3D tube plot.
749414`\spad{tubeRadiusDefault(r)} sets the default radius for a 3D tube plot to \spad{r}.
749488`\spad{tubeRadius(r)} specifies a radius,{} \spad{r},{} for a tube plot around a 3D curve; is expressed in the form \spad{tubeRadius == 4}.
749537`\spad{tubeRadius(l,n)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{tubeRadius}. If the option does not exist the value,{} \spad{n} is returned.
749616`\spad{tube(c,r,n)} creates a tube of radius \spad{r} around the curve \spad{c}.
749704`\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.
749791`\spad{twist(f)} is the function \spad{g} \indented{1}{such that \spad{g (a,b)= f(b,a)}.}
749856`\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}).
750034`\spad{typeForm(x)} returns the type form of the elaboration \spad{x}.
750093`\spad{typeList(t,tab)} returns a list of all the objects of type \spad{t} in \spad{tab}
750229`\spad{typeLists(tab)} returns a list of lists of types of objects in \spad{tab}
750354`\spad{type(e)} returns the type of the expression as computed by the interpreter.
750408`\spad{unary?(op)} tests if \spad{op} is unary.
750458`\spad{unaryFunction(a)} is a local function
750537`\spad{uncouplingMatrices(M)} returns \spad{[A_1,...,A_n]} such that if \spad{y = [y_1,...,y_n]} is a solution of \spad{y' = M y},{} then \spad{[\$y_j',y_j'',...,y_j^{(n)}\$] = \$A_j y\$} for all \spad{j}'s.
750627`\spad{underscore} designates the underbar character.
750742`\spad{unexpand(p)} returns \spad{p} in recursive form.
750836`\spad{uniform01()} \undocumented
750896`\spad{uniform(s)} \undocumented
750978`\spad{uniform(s)} \undocumented
751040`\spad{uniform(f,g)} \undocumented
751297`\spad{union(l1, l2)} returns set-theoretic union of \spad{l1} and \spad{l2}.
751483`\spad{union(a, b)} makes the set-union of two match results.
751540`\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}.
751588`\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}.
751636`\spad{union(u,v)} returns the set aggregate of elements which are members of either set aggregate \spad{u} or \spad{v}.
751732`\spad{unit?(x)} tests whether \spad{x} is a unit,{} \spadignore{i.e.} is invertible.
751871`\spad{unitCanonical(x)} returns \spad{unitNormal(x).canonical}.
752167`\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}.
752256`\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.
752306`\spad{unitVector(x)} \undocumented
752381`\spad{unitVector(p)} creates the unit vector of the point \spad{p} and returns the result as a point. Note: \spad{unitVector(p) = p/|p|}.
752462`\spad{unitVector(n)} produces a vector with 1 in position \spad{n} and zero elsewhere.
752620`\spad{unit()} returns a unit of the algebra (necessarily unique),{} or \spad{"failed"} if there is none.
752719`\spad{unit(lf)} will mark off the units according to the indicated list \spad{lf}. This option is expressed in the form \spad{unit == [f1,f2]}.
752768`\spad{unit(u)} extracts the unit part of the factorization.
752808`\spad{unitsColorDefault()} returns the default color of the unit ticks in a 2D viewport.
752873`\spad{unitsColorDefault(p)} sets the default color of the unit ticks in a 2D viewport to the palette \spad{p}.
752945`\spad{units(gi)} returns the list of unit increments for the \spad{x} and \spad{y} axes of the indicated graph,{} \spad{gi},{} of the domain \spadtype{GraphImage}.
752995`\spad{units(l,u)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{unit}. If the option does not exist the value,{} \spad{u} is returned.
753081`\spad{units(gi,lu)} modifies the list of unit increments for the \spad{x} and \spad{y} axes of the given graph,{} \spad{gi} of the domain \spadtype{GraphImage},{} to be that of the list of unit increments,{} \spad{lu},{} and returns the new list of units for \spad{gi}.
753143`\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}.
753222`\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".
753300`\axiom{univariate?(\spad{p})} returns \spad{true} iff \axiom{\spad{p}} involves one and only one variable.
753379`\spad{univariatePolynomial(f,k)} returns a univariate polynomial \indented{1}{consisting of the sum of all terms of \spad{f} of degree \spad{<= k}.}
753514`\spad{univariatePolynomial(f,k)} returns a univariate polynomial \indented{1}{consisting of the sum of all terms of \spad{f} of degree \spad{<= k}.}
753643`\axiom{univariatePolynomialsGcds(lp)} returns \axiom{lg} where \axiom{lg} is a list of the gcds of every pair in \axiom{lp} of univariate polynomials in the same main variable.
753758`\axiom{univariatePolynomialsGcds(lp,{}opt)} returns the same as \axiom{univariatePolynomialsGcds(lp)} if \axiom{opt} is \axiom{\spad{false}} and if the previous operation does not return any non null and constant polynomial,{} else return \axiom{[1]}.
753881`\axiom{univariatePolynomials(lp)} returns \axiom{ups,{}nups} where \axiom{ups} is a list of the univariate polynomials,{} and \axiom{nups} are the other ones.
754009`\spad{univariateSolve(lp)} returns the same as \spad{univariateSolve(lp,false,false,false)}.
754190`\spad{univariateSolve(ts)} returns a univariate representation of \spad{ts}. See \axiomOpFrom{rur}{RationalUnivariateRepresentationPackage}(lp,{}\spad{true}).
754370`\spad{univariateSolve(lp,info?)} returns the same as \spad{univariateSolve(lp,info?,false,false)}.
754559`\spad{univariateSolve(lp,info?,check?)} returns the same as \spad{univariateSolve(lp,info?,check?,false)}.
754756`\spad{univariateSolve(lp,info?,check?,lextri?)} returns a univariate representation of the variety associated with \spad{lp}. Moreover,{} if \spad{info?} is \spad{true} then some information is displayed during the decomposition into regular chains. If \spad{check?} is \spad{true} then the result is ch
754756`--ecked. See \axiomOpFrom{rur}{RationalUnivariateRepresentationPackage}(\spad{lp},{}\spad{true}). If \spad{lextri?} is \spad{true} then the lexTriangular algorithm is called from the \spadtype{LexTriangularPackage} constructor (see \axiomOpFrom{zeroSetSplit}{LexTriangularPackage}(\spad{lp},{}\spad{false})). Otherwise,{} the triangular decomposition is computed directly from the input system by using the \axiomOpFrom{zeroSetSplit}{RegularChain} from \spadtype{RegularChain}.
754961`\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
755054`\spad{univariate(f, v)} returns \spad{f} viewed as a univariate rational function in \spad{v}.
755269`\spad{univariate(f, v)} returns \spad{f} viewed as a univariate rational function in \spad{v}.
755411`\spad{univariate(p, x)} converts the polynomial \spad{p} to a one of type \spad{UnivariatePolynomial(x,Polynomial(R))},{} ie. as a member of \spad{R[...][x]}.
755542`\spad{univariate(f, k)} returns \spad{f} viewed as a univariate fraction in \spad{k}.
755664`\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).
755765`\spad{univariate(f, x, p)} returns \spad{f} viewed as a univariate polynomial in \spad{x},{} using the side-condition \spad{p(x) = 0}.
755905`\spad{univariate(f,k,k,p)} \undocumented
756082`\spad{univcase should} be local
756208`\spad{universe()}\$\spad{D} returns the universal set for finite set aggregate \spad{D}.
756274`\spad{unknownEndian} for none of the above.
756320`the indefinite `unknown'
756460`\spad{unmakeSUP(sup)} converts \spad{sup} of type \spadtype{SparseUnivariatePolynomial(R)} to be a member of the given type. Note: converse of makeSUP.
756553`\spad{unparse(f)} returns a string \spad{s} such that the parser would transform \spad{s} to \spad{f}. Error: if \spad{f} is not the parsed form of a string.
756599`\axiom{unprotectedRemoveRedundantFactors(\spad{p},{}\spad{q})} returns the same as \axiom{removeRedundantFactors(\spad{p},{}\spad{q})} but does assume that neither \axiom{\spad{p}} nor \axiom{\spad{q}} lie in the base ring \axiom{\spad{R}} and assumes that \axiom{infRittWu?(\spad{p},{}\spad{q})} holds. Moreover,{} if \axiom{\spad{R}} is gcd-domain,{} then \axiom{\spad{p}} and \axiom{\spad{q}} are assum
756599`--ed to be square free.
756702`\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{numb
756702`--erOfImproperPartitions}{SymmetricGroupCombinatoricFunctions}.
756820`\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,
756820`--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}.
756938`\spad{unravel(t)} produces a tensor from a list of components such that \indented{2}{\spad{unravel(ravel(t)) = t}.}
757004`\spad{untab(lp,llp)} is an auxiliary function which unbumps a tableau \spad{llp},{} using \spad{lp} to accumulate pairs
757095`\spad{unvectorise(v)} returns the polynomial which has for coefficients the entries of \spad{v} in the increasing order.
757175`\spad{unvectorise(vect, var, n)} returns \spad{vect(1) + vect(2)*var + ... + vect(n+1)*var**(n)} where \spad{vect} is the vector of the coefficients of the polynomail ,{} \spad{var} the new variable and \spad{n} the degree.
757853`\spad{updatD }\undocumented
758144`\spad{updatF }\undocumented
758338`\axiom{updateStatus!(a)} returns a where the status of the vertices are updated to satisfy the "termination condition".
758395`\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.
758478`If the set of values assumed by the iteration variable is bounded from above,{} \spad{upperBound(i)} returns the upper bound. Otherwise,{} its returns \spad{nothing}.
758533`\spad{upperCase!(s)} destructively replaces the alphabetic characters in \spad{s} by upper case characters.
758584`\spad{upperCase?(c)} tests if \spad{c} is an upper case letter,{} \spadignore{i.e.} one of A..\spad{Z}.
758634`\spad{upperCase()} returns the class of all characters for which \spadfunFrom{upperCase?}{Character} is \spad{true}.
758727`\spad{upperCase(s)} returns the string with all characters in upper case.
758777`\spad{upperCase(c)} converts a lower case letter to the corresponding upper case letter. If \spad{c} is not a lower case letter,{} then it is returned unchanged.
758821`\spad{useEisensteinCriterion?()} returns \spad{true} if factorizers check Eisenstein's criterion before factoring.
758898`\spad{useEisensteinCriterion(b)} chooses whether factorizers check Eisenstein's criterion before factoring: \spad{true} for using it,{} \spad{false} else. Returns the previous value.
758981`\spad{useNagFunctions()} indicates whether NAG functions are being used \indented{1}{for mathematical and machine constants.}
759077`\spad{useNagFunctions(v)} sets the flag which controls whether NAG functions \indented{1}{are being used for mathematical and machine constants.\space{2}The previous} \indented{1}{value is returned.}
759180`\spad{useSingleFactorBound?()} returns \spad{true} if algorithm with single factor bound is used for factorization,{} \spad{false} for algorithm with overall bound.
759255`\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.
759336`\spad{userOrdered?()} tests if the partial ordering induced by \spadfunFrom{setOrder}{UserDefinedPartialOrdering} is not empty.
759406`\axiom{usingTable?()} returns \spad{true} iff the hash-table is used
759484`\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.
759702`\axiom{value(\spad{n})} returns the value of the node \spad{n}.
759750`\spad{value(x)} returns the integer associated with \spad{x}
759796`\spad{value(p)} returns value of property \spad{p}
759844`\spad{value(u)} returns the value of the node \spad{u}.
759895`\spad{value(q)} returns the value (\spadignore{i.e.} right hand side) of \axiom{\spad{q}}.
759943`\spad{var1StepsDefault()} is the current setting for the number of steps to take when creating a 3D mesh in the direction of the first defined free variable (a free variable is considered defined when its range is specified (\spadignore{e.g.} \spad{x=0}..10)).
760015`\spad{var1StepsDefault(i)} sets the number of steps to take when creating a 3D mesh in the direction of the first defined free variable to \spad{i} (a free variable is considered defined when its range is specified (\spadignore{e.g.} \spad{x=0}..10)).
760102`\spad{var1Steps(n)} indicates the number of subdivisions,{} \spad{n},{} of the first range variable. This option is expressed in the form \spad{var1Steps == n}.
760160`\spad{var1Steps(l,n)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{var1Steps}. If the option does not exist the value,{} \spad{n} is returned.
760258`\spad{var2StepsDefault()} is the current setting for the number of steps to take when creating a 3D mesh in the direction of the first defined free variable (a free variable is considered defined when its range is specified (\spadignore{e.g.} \spad{x=0}..10)).
760330`\spad{var2StepsDefault(i)} sets the number of steps to take when creating a 3D mesh in the direction of the first defined free variable to \spad{i} (a free variable is considered defined when its range is specified (\spadignore{e.g.} \spad{x=0}..10)).
760417`\spad{var2Steps(n)} indicates the number of subdivisions,{} \spad{n},{} of the second range variable. This option is expressed in the form \spad{var2Steps == n}.
760475`\spad{var2Steps(l,n)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{var2Steps}. If the option does not exist the value,{} \spad{n} is returned.
760573`\spad{varList(x)} returns the list of variables of \spad{x}.
760631`\axiom{varList(\spad{g})} returns the list of variables of \axiom{\spad{g}}.
760705`\axiom{varList(\spad{x})} returns the list of distinct entries of \axiom{\spad{x}}.
760766`\axiom{varList(\spad{x})} returns the list of distinct entries of \axiom{\spad{x}}.
760822`\spad{varList([l1]*[l2]*...[ln])} returns the list of variables in the word \spad{l1*l2*...*ln}.
760904`\axiom{varList(\spad{x})} returns the list of distinct entries of \axiom{\spad{x}}.
760971`\spad{varList(x)} returns the list of variables which appear in \spad{x}.
761028`\spad{varList(e,n)} returns a list of \axiom{\spad{n}} indexed variables with name as in \axiom{\spad{e}}.
761127`\spad{varList(s,n)} \undocumented{}
761209`\spad{variable?(e)} returns \spad{true} if `e' is a variable.
761269`\spad{variable()} returns the symbol
761318`\spad{variable(s)} returns a member of the variable set or failed
761405`\spad{variable(v)} returns \spad{s} if \spad{v} is any derivative of the differential indeterminate \spad{s}.
761469`\spad{variable(f)} returns the (unique) power series variable of the power series \spad{f}.
761548`\spad{variable(q)} returns the variable (\spadignore{i.e.} left hand side) of \axiom{\spad{q}}.
761599`\spad{variable(x)} returns the variable from the left hand side of the \spadtype{RangeBinding}. For example,{} if \spad{x} is \spad{v=s},{} then \spad{variable(x)} returns \spad{v}.
761703`\spad{variables(f)} returns the list of variables appearing in the numerator or the denominator of \spad{f}.
762105`\spad{variables(upoly)} returns the list of variables for the coefficients of \spad{upoly}.
762201`\spad{variables(p)} returns the list of matching variables appearing in \spad{p}.
762252`\spad{variables(f)} returns the list of variables appearing in the numerator or the denominator of \spad{f}.
762337`\spad{variables(args)} returns the list of variables in \axiom{\spad{args}.lfn}
762460`\spad{variables(f)} returns the list of all the variables of \spad{f}.
762521`\spad{variables(e)} return a list of all the variables in \spad{e}.
762618`\spad{variables(f)} returns a list of the variables occuring in the power series \spad{f}.
762695`\spad{variables(p)} returns the list of those variables actually appearing in the polynomial \spad{p}.
762770`\axiom{variables(ps)} returns the decreasingly sorted list of the variables which are variables of some polynomial in \axiom{ps}.
762850`\spad{variationOfParameters(op, g, [f1,...,fm])} returns \spad{[u1,...,um]} such that a particular solution of the equation \spad{op y = g} is \spad{f1 int(u1) + ... + fm int(um)} where \spad{[f1,...,fm]} are linearly independent and \spad{op(fi)=0}. The value "failed" is returned if \spad{m < n} and no particular solution is found.
762948`\spad{vark([f1,...,fn],x)} returns the set-theoretic union of \spad{(varselect(f1,x),...,varselect(fn,x))}.
763024`\spad{varselect([k1,...,kn], x)} returns the \spad{ki} which involve \spad{x}.
763113`\spad{vconcat(u)} vertically concatenates all forms in list \spad{u}.
763162`\spad{vconcat(f,g)} vertically concatenates forms \spad{f} and \spad{g}.
763208`\spad{vector(l)} converts the list \spad{l} to a vector.
763342`\spad{vectorise(p, n)} returns \spad{[a0,...,a(n-1)]} where \spad{p = a0 + a1*x + ... + a(n-1)*x**(n-1)} + higher order terms. The degree of polynomial \spad{p} can be different from \spad{n-1}.
763434`\spad{vedf2vef(v)} maps \axiomType{Vector Expression DoubleFloat} to \axiomType{Vector Expression Float}
763602`\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.
763666`\spad{verticalTab} designates vertical tab.
763710`\spad{viewDefaults()} resets all the default graphics settings.
763767`\spad{viewDeltaXDefault()} returns the current default horizontal offset from the center of the viewport window.
763835`\spad{viewDeltaXDefault(dx)} sets the current default horizontal offset from the center of the viewport window to be \spad{dx} and returns \spad{dx}.
763908`\spad{viewDeltaYDefault()} returns the current default vertical offset from the center of the viewport window.
763976`\spad{viewDeltaYDefault(dy)} sets the current default vertical offset from the center of the viewport window to be \spad{dy} and returns \spad{dy}.
764049`\spad{viewPhiDefault()} returns the current default latitudinal view angle in radians.
764114`\spad{viewPhiDefault(p)} sets the current default latitudinal view angle in radians to the value \spad{p} and returns \spad{p}.
764184`\spad{viewPosDefault()} returns the default \spad{X} and \spad{Y} position of a viewport window unless overriden explicityly,{} newly created viewports will have this \spad{X} and \spad{Y} coordinate.
764263`\spad{viewPosDefault([x,y])} sets the default \spad{X} and \spad{Y} position of a viewport window unless overriden explicityly,{} newly created viewports will have th \spad{X} and \spad{Y} coordinates \spad{x},{} \spad{y}.
764366`\spad{viewSizeDefault()} returns the default viewport width and height.
764443`\spad{viewSizeDefault([w,h])} sets the default viewport width to \spad{w} and height to \spad{h}.
764541`\spad{viewThetaDefault()} returns the current default longitudinal view angle in radians.
764608`\spad{viewThetaDefault(t)} sets the current default longitudinal view angle in radians to the value \spad{t} and returns \spad{t}.
764680`\spad{viewWriteAvailable()} returns a list of available methods for writing,{} such as BITMAP,{} POSTSCRIPT,{} etc.
764751`\spad{viewWriteDefault()} returns the list of things to write in a viewport data file; a viewAlone file is always generated.
764820`\spad{viewWriteDefault(l)} sets the default list of things to write in a viewport data file to the strings in \spad{l}; a viewAlone file is always genereated.
764901`\spad{viewZoomDefault()} returns the current default graph scaling value.
764967`\spad{viewZoomDefault(s)} sets the current default graph scaling value to \spad{s} and returns \spad{s}.
765038`\spad{viewpoint(vp)} creates a viewpoint data structure corresponding to the list of values. The values are interpreted as [theta,{} phi,{} scale,{} scaleX,{} scaleY,{} scaleZ,{} deltaX,{} deltaY]. This option is expressed in the form \spad{viewpoint == ls}.
765235`\spad{viewpoint(v)} returns the current viewpoint setting of the given viewport,{} \spad{v}. This function is useful in the situation where the user has created a viewport,{} proceeded to interact with it via the control panel and desires to save the values of the viewpoint as the default setting
765235`--s for another viewport to be created using the system.
765446`\spad{viewpoint(l,ls)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{view
765446`--point}. IF the option does not exist,{} the value \spad{ls} is returned.
765822`\spad{viewpoint(v,viewpt)} sets the viewpoint for the viewport. The viewport record consists of the latitudal and longitudal angles,{} the zoom factor,{} the \spad{X},{} \spad{Y},{} and \spad{Z} scales,{} and the \spad{X} and \spad{Y} displacements.
766038`\spad{viewpoint(v,th,phi)} sets the longitudinal view angle to \spad{th} radians and the latitudinal view angle to \spad{phi} radians for the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport}. The new viewpoint position is not displayed until the function \spadfun{makeViewport3D} is executed again for \spad{v}.
766111`\spad{viewpoint(v,rotx,roty,rotz)} sets the rotation about the \spad{x}-axis to be \spad{rotx} radians,{} sets the rotation about the \spad{y}-axis to be \spad{roty} radians,{} and sets the rotation about the \spad{z}-axis to be \spad{rotz} radians,{} for the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport} and displays \spad{v} with the new view position.
766190`\spad{viewpoint(v,th,phi,s,dx,dy)} sets the longitudinal view angle to \spad{th} radians,{} the latitudinal view angle to \spad{phi} radians,{} the scale factor to \spad{s},{} the horizontal viewport offset to \spad{dx},{} and the vertical viewport offset to \spad{dy} for the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport}. The new viewpoint position is not displayed until the funct
766190`--ion \spadfun{makeViewport3D} is executed again for \spad{v}.
766281`\spad{viewpoint(v,th,phi,s,dx,dy)} sets the longitudinal view angle to \spad{th} degrees,{} the latitudinal view angle to \spad{phi} degrees,{} the scale factor to \spad{s},{} the horizontal viewport offset to \spad{dx},{} and the vertical viewport offset to \spad{dy} for the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport}. The new viewpoint position is not displayed until the f
766281`--unction \spadfun{makeViewport3D} is executed again for \spad{v}.
766376`\spad{viewport2D()} returns an undefined two-dimensional viewport of the domain \spadtype{TwoDimensionalViewport} whose contents are empty.
766432`\spad{viewport3D()} returns an undefined three-dimensional viewport of the domain \spadtype{ThreeDimensionalViewport} whose contents are empty.
766490`\spad{virtualDegree }\undocumented
766593`\spad{voidMode} is a constant mode denoting Void.
766641`\spad{void()} produces a void object.
766673`\spad{vspace(n)} creates white space of height \spad{n}.
766720`\spad{weakBiRank(x)} determines the number of linearly independent elements in the \spad{bi*x*bj},{} \spad{i,j=1,...,n},{} where \spad{b=[b1,...,bn]} is a basis.
766790`\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.}
767049`\spad{weight(p)} returns the maximum weight of all differential monomials appearing in the differential polynomial \spad{p}.
767136`\spad{weight(v)} returns the weight of the derivative \spad{v}.
767215`\spad{weight(op)} returns the weight attached to \spad{op}.
767361`\spad{weight(op, n)} attaches the weight \spad{n} to \spad{op}.
767425`\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.
767514`\spad{weighted(l)} \undocumented
767697`\spad{weights(p)} returns a list of weights of differential monomials appearing in differential polynomial \spad{p}.
767883`\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.
767979`\spad{whatInfinity(x)} returns 0 if \spad{x} is finite,{} 1 if \spad{x} is +infinity,{} and \spad{-1} if \spad{x} is -infinity.
768048`\spad{whileLoop(s,c)} creates a while loop in FORTRAN.
768101`whitePoint is the contant indicating the white point of this color space.
768151`\spad{wholePart x} returns the integer part of \spad{x}.
768207`\spad{wholePart(x)} extracts the whole part of \spadvar{\spad{x}}. That is,{} if \spad{x = continuedFraction(b0, [a1,a2,a3,...], [b1,b2,b3,...])},{} then \spad{wholePart(x) = b0}.
768261`\spad{wholePart(p)} extracts the whole part of the partial fraction \spad{p}.
768313`\spad{wholePart(x)} returns the whole part of the fraction \spad{x} \spadignore{i.e.} the truncated quotient of the numerator by the denominator.
768393`\spad{wholeRadix(l)} creates an integral radix expansion from a list of ragits. For example,{} \spad{wholeRadix([1,3,4])} will return \spad{134}.
768458`\spad{wholeRagits(rx)} returns the ragits of the integer part of a radix expansion.
768524`\spad{width()} returns the width of the display area (an integer).
768568`\spad{width(f)} returns the width of form \spad{f} (an integer).
768614`\spad{width(u)} returns \axiom{sup(\spad{u}) - inf(\spad{u})}.
768663`\spad{withPredicates(p, [p1,...,pn])} makes a copy of \spad{p} and attaches the predicate \spad{p1} and ... and pn to the copy,{} which is returned.
768723`\spad{wordInGenerators(p,gp)} returns the word for the permutation \spad{p} in the original generators of the group {\em gp},{} represented by the indices of the list,{} given by {\em generators}.
768821`\spad{wordInStrongGenerators(p,gp)} returns the word for the permutation \spad{p} in the strong generators of the group {\em gp},{} represented by the indices of the list,{} given by {\em strongGenerators}.
768925`\spad{wordsForStrongGenerators(gp)} returns the words for the strong generators of the group {\em gp} in the original generators of {\em gp},{} represented by their indices in the list,{} given by {\em generators}.
769022`\spad{wreath(s1,s2)} is the cycle index of the wreath product \indented{1}{of the two groups whose cycle indices are \spad{s1} and} \indented{1}{\spad{s2}.}
769180`\spad{writable?(f)} tests if the named file be opened for writing. The named file need not already exist.
769236`\spad{write!(f,s)} puts the value \spad{s} into the file \spad{f}. The state of \spad{f} is modified so subsequents call to \spad{write!} will append one after another.
769289`\spad{writeByte!(c,b)} attempts to write the byte `b' on the conduit `c'. Returns the written byte if successful,{} otherwise,{} returns \spad{nothing}.
769434`\spad{writeBytes!(c,b)} write bytes from buffer `b' onto the conduit `c'. The actual number of written bytes is returned.
769579`\spad{writeInt8!(c,b)} attempts to write the 8-bit value `v' on the conduit `c'. Returns the written value if successful,{} otherwise,{} returns \spad{nothing}.
769646`\spad{writeLine!(f)} finishes the current line in the file \spad{f}. An empty string is returned. The call \spad{writeLine!(f)} is equivalent to \spad{writeLine!(f,"")}.
769694`\spad{writeLine!(f,s)} writes the contents of the string \spad{s} and finishes the current line in the file \spad{f}. The value of \spad{s} is returned.
769816`\spad{writeUInt8!(c,b)} attempts to write the unsigned 8-bit value `v' on the conduit `c'. Returns the written value if successful,{} otherwise,{} returns \spad{nothing}.
769886`\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}.
769950`\spad{write(v,s)} takes the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport},{} and creates a directory indicated by \spad{s},{} which contains the graph data file for \spad{v}.
770016`\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}.
770093`\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}.
770164`\spad{write(v,s,lf)} takes the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport},{} and creates a directory indicated by \spad{s},{} which contains the graph data file for \spad{v} and the optional file types indicated by the list \spad{lf}.
770243`\spad{write(v,s,f)} takes the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport},{} and creates a directory indicated by \spad{s},{} which contains the graph data file for \spad{v} and an optional file type \spad{f}.
770316`\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)]}.
770385`\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)]}.
770473`\spad{wrregime(l,s)} writes a list of regimes to a file named \spad{s} and returns the number of regimes written
770726`\spad{xCoord(pt)} returns the first element of the point,{} \spad{pt},{} although no assumptions are made as to the coordinate system being used. This function is defined for the convenience of the user dealing with a Cartesian coordinate system.
770778`\spad{xRange(c)} returns the range of the \spad{x}-coordinates of the points on the curve \spad{c}.
770855`\spad{xRange(c)} returns the range of the \spad{x}-coordinates of the points on the curve \spad{c}.
770932`\spad{xn(n)} returns the polynomial \spad{x**n-1}.
771038`\spad{xor(a,b)} returns the logical {\em exclusive-or} of bit aggregates \axiom{a} and \axiom{\spad{b}}.
771082`\spad{xor(a,b)} returns the logical exclusive {\em or} of Boolean \spad{a} and \spad{b}.
771121`\spad{xor(n,m)} returns the bit-by-bit logical {\em xor} of the single integers \spad{n} and \spad{m}.
771166`\spad{yCoord(pt)} returns the second element of the point,{} \spad{pt},{} although no assumptions are made as to the coordinate system being used. This function is defined for the convenience of the user dealing with a Cartesian coordinate system.
771311`\spad{yCoordinates(f)} returns \spad{[[A1,...,An], D]} such that \spad{f = (A1 + A2 y +...+ An y**(n-1)) / D}.
771408`\spad{yRange(c)} returns the range of the \spad{y}-coordinates of the points on the curve \spad{c}.
771485`\spad{yRange(c)} returns the range of the \spad{y}-coordinates of the points on the curve \spad{c}.
771562`\spad{yellow()} returns the position of the yellow hue from total hues.
771597`\spad{youngDiagram l} returns an object representing a Young diagram with shape given by the list of integers \spad{l}
771666`\spad{youngGroup([n1,...,nk])} constructs the direct product of the symmetric groups {\em Sn1},{}...,{}{\em Snk}.
771760`\spad{youngGroup(lambda)} constructs the direct product of the symmetric groups given by the parts of the partition {\em lambda}.
771850`\spad{zCoord(pt)} returns the third element of the point,{} \spad{pt},{} although no assumptions are made as to the coordinate system being used. This function is defined for the convenience of the user dealing with a Cartesian or a cylindrical coordinate system.
771902`\spad{zRange(c)} returns the range of the \spad{z}-coordinates of the points on the curve \spad{c}.
771979`\spad{zag(f,g)} creates a form for the continued fraction form for \spad{f} over \spad{g}.
772407`\spad{zero?(x)} tests if \spad{x} is equal to 0.
772456`\spad{zero? a} holds if \spad{a} is the arity of niladic function.
772497`\spad{zero?(I)} tests whether the ideal \spad{I} is the zero ideal
772661`\axiom{zero?(pol,{}aRoot)} answers if \axiom{pol} interpreted as \axiom{aRoot} is \axiom{0}
772755`\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}
772832`\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]}
772922`\spad{zeroDimPrimary?(I)} tests if the ideal \spad{I} is 0-dimensional primary.
773150`\spad{zeroDimPrime?(I)} tests if the ideal \spad{I} is a 0-dimensional prime.
773376`\axiom{zeroDimensional?(lp)} returns \spad{true} iff \axiom{lp} generates a zero-dimensional ideal \spad{w}.\spad{r}.\spad{t}. the variables involved in \axiom{lp}.
773511`\axiom{zeroDimensional?(\spad{lq1})} returns \spad{true} iff \axiom{\spad{lq1}} generates a zero-dimensional ideal \spad{w}.\spad{r}.\spad{t}. the variables of \axiom{ls}.
773597`\spad{zeroMatrix(i,j,k)} create a matrix with all zero terms
773723`\spad{zeroMatrix(s,p,q)} uses loop variables in the Fortran,{} \spad{I1} and \spad{I2}
773831`\spad{zeroMatrix(s,b,d)} in this version gives the user control over names of Fortran variables used in loops.
774341`\spad{zeroOf(p)} returns \spad{y} such that \spad{p(y) = 0}. If possible,{} \spad{y} is expressed in terms of radicals. Otherwise it is an implicit algebraic quantity. Error: if \spad{p} has more than one variable \spad{y}.
774409`\spad{zeroOf(p)} returns \spad{y} such that \spad{p(y) = 0}; if possible,{} \spad{y} is expressed in terms of radicals. Otherwise it is an implicit algebraic quantity.
774493`\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.
774813`\spad{zeroOf(p, y)} returns \spad{y} such that \spad{p(y) = 0}; if possible,{} \spad{y} is expressed in terms of radicals. Otherwise it is an implicit algebraic quantity which displays as \spad{'y}.
774904`\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}.
774978`\axiom{zeroSetSplitIntoTriangularSystems(lp)} returns a list of triangular systems \axiom{[[\spad{ts1},{}\spad{qs1}],{}...,{}[tsn,{}qsn]]} such that the zero set of \axiom{lp} is the union of the closures of the \axiom{W_i} where \axiom{W_i} consists of the zeros of \axiom{ts} which do not cancel any polynomial in \axiom{qsi}.
775105`\axiom{zeroSetSplit(lp)} returns a list \axiom{lts} of triangular sets such that the zero set of \axiom{lp} is the union of the closures of the regular zero sets of the members of \axiom{lts}.
775184`\axiom{zeroSetSplit(lp,{} norm?)} decomposes the variety associated with \axiom{lp} into regular chains. Thus a point belongs to this variety iff it is a regular zero of a regular set in in the output. Note that \axiom{lp} needs to generate a zero-dimensional ideal. If \axiom{norm?} is \axiom{\spad{true}} then the regular sets are normalized.
775340`\axiom{zeroSetSplit(lp,{} norm?)} decomposes the variety associated with \axiom{lp} into square-free regular chains. Thus a point belongs to this variety iff it is a regular zero of a regular set in in the output
775340`--. Note that \axiom{lp} needs to generate a zero-dimensional ideal. If \axiom{norm?} is \axiom{\spad{true}} then the regular sets are normalized.
775636`\axiom{zeroSetSplit(lp,{}clos?)} has the same specifications as \axiomOpFrom{zeroSetSplit(lp,{}clos?)}{RegularTriangularSetCategory}.
775731`\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} construct
775731`--or for more explanations about decompositions by means of regular triangular sets.
775825`\spad{zeroSetSplit(lp,clos?,info?)} returns a list \spad{lts} of regular chains such that the union of the closures of their regular zero sets equals the affine variety associated with \spad{lp}. Moreover,{} if \spad{clos?} is \spad{false} then the union of the regular zero set of the \spad{ts} (for \spad{ts} in \spad{lts}) equals this variety. If \spad{info?} is \s
775825`--pad{true} then some information is displayed during the computations. See \axiomOpFrom{zeroSetSplit}{RegularTriangularSet}.
775965`\axiom{zeroSetSplit(lp,{}clos?,{}info?)} has the same specifications as \axiomOpFrom{zeroSetSplit}{RegularTriangularSetCategory}. Moreover,{} if \axiom{clos?} then solves in the sense of the Zariski closure else solves in the sense of the regular zeros. If \axiom{info?} then do print messages during the computations.
776059`\axiom{zeroSetSplit(lp,{}clos?,{}info?)} has the same specifications as \axiomOpFrom{zeroSetSplit}{RegularTriangularSetCategory} from \spadtype{RegularTriangularSetCategory} Moreover,{} if \axiom{clos?} then solves in the sense of the Zariski closure else solves in the sense of the regular zeros. If \axiom{info?} then do print messages during the computations.
776163`\axiom{zeroSetSplit(lp,{}\spad{b1},{}\spad{b2}.\spad{b3},{}\spad{b4})} is an internal subroutine,{} exported only for developement.
776273`\axiom{zeroSetSplit(lp,{}\spad{b1},{}\spad{b2}.\spad{b3},{}\spad{b4})} is an internal subroutine,{} exported only for developement.
776393`\spad{zeroSquareMatrix(s,p)} \undocumented{}
776487`\spad{zeroVector(s,p)} \undocumented{}
776634`\spad{zero(n)} creates a zero vector of length \spad{n}.
776803`\spad{zero(m,n)} returns an \spad{m}-by-\spad{n} zero matrix.
777298`\spad{zerosOf(p)} returns \spad{[y1,...,yn]} such that \spad{p(yi) = 0}. The \spad{yi}'s are expressed in radicals if possible. Otherwise they are implicit algebraic quantities. The returned symbols \spad{y1},{}...,{}yn are bound in the interpreter to respective root values. Error: if \spad{p} has more than one variable \spad{y}.
777373`\spad{zerosOf(p)} returns \spad{[y1,...,yn]} such that \spad{p(yi) = 0}. The \spad{yi}'s are expressed in radicals if possible,{} and otherwise as implicit algebraic quantities. The returned symbols \spad{y1},{}...,{}yn are bound in the interpreter to respective root values.
777464`\spad{zerosOf(p)} returns \spad{[y1,...,yn]} such that \spad{p(yi) = 0}. The \spad{yi}'s are expressed in radicals if possible. The returned symbols \spad{y1},{}...,{}yn are bound in the interpreter to respective root values. Error: if \spad{p} has more than one variable.
777812`\spad{zerosOf(p, y)} returns \spad{[y1,...,yn]} such that \spad{p(yi) = 0}. The \spad{yi}'s are expressed in radicals if possible,{} and otherwise as implicit algebraic quantities which display as \spad{'yi}. The returned symbols \spad{y1},{}...,{}yn are bound in the interpreter to respective root values.
777910`\spad{zerosOf(p, y)} returns \spad{[y1,...,yn]} such that \spad{p(yi) = 0}. The \spad{yi}'s are expressed in radicals if possible,{} and otherwise as implicit algebraic quantities which display as \spad{'yi}. The returned symbols \spad{y1},{}...,{}yn are bound in the interpreter to respective root values.
777991`\spad{zerosOf(e,vars,range)} returns a list of points (\axiomType{Doublefloat}) at which a NAG fortran version of \spad{e} will most likely produce an error.
778144`\spad{zoom(x,r)} \undocumented
778199`\spad{zoom(v,s)} sets the graph scaling factor to \spad{s},{} for the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport}.
778261`\spad{zoom(x,r,s)} \undocumented
778337`\spad{zoom(x,r,s,t)} \undocumented
778436`\spad{zoom(v,sx,sy,sz)} sets the graph scaling factors for the \spad{x}-coordinate axis to \spad{sx},{} the \spad{y}-coordinate axis to \spad{sy} and the \spad{z}-coordinate axis to \spad{sz} for the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport}.
778551`\spad{f ~= g} creates the equivalent infix form.
778592`\spad{x~=y} tests if \spad{x} and \spad{y} are not equal.
778707`\spad{~(x)} returns the logical complement of \spad{x}.
778739`Factorization of univariate polynomials with coefficients in \spadtype{AlgebraicNumber}.
778828`AlgebraPackage assembles a variety of useful functions for general algebras.
778926`This package provides algebraic functions over an integral domain.
779009`algebraic Hermite redution.
779206`This package provides functions for integrating a function on an algebraic curve.
779452`This package provides functions for the integration of algebraic integrands over transcendental functions.
779559`AlgebraicManipulations provides functions to simplify and expand expressions involving algebraic operators.
779652`This package factors multivariate polynomials over the domain of \spadtype{AlgebraicNumber} by allowing the user to specify a list of algebraic numbers generating the particular extension to factor over.
780031`\spadtype{AnyFunctions1} implements several utility functions for working with \spadtype{Any}. These functions are used to go back and forth between objects of \spadtype{Any} and objects of other types.
780079`This package apply rewrite rules to expressions,{} calling the pattern matcher.
780192`\spad{ApplyUnivariateSkewPolynomial} (internal) allows univariate skew polynomials to be applied to appropriate modules.
780320`\spadtype{AssociatedEquations} provides functions to compute the associated equations needed for factoring operators
780439`Attaching predicates to symbols for pattern matching. Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990
780492`This package provides balanced factorisations of polynomials.
780606`This package exports functions to set some commonly used properties of operators,{} including properties which contain functions.
780671`\spadtype{BezoutMatrix} contains functions for computing resultants and discriminants using Bezout matrices.
780852`\spadtype{BoundIntegerRoots} provides functions to find lower bounds on the integer roots of a polynomial.
780959`\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 Brillh
780959`--art Irreducibility. To appear. [3] John Brillhart,{} On the Euler and Bernoulli polynomials,{} \spad{J}. Reine Angew. Math.,{} \spad{v}. 234,{} (1969),{} pp. 45-64
781043`This package \undocumented{}
781102`This package provides functions to enable conversion of tensors given conversion of the components.
781239`Tools to send a point to infinity on an algebraic curve.
781405`This package implements characteristicPolynomials for monogenic algebras using resultants
781569`This package provides a characteristicPolynomial function for any matrix over a commutative ring.
781649`\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: Keyword
781649`--s: function field,{} finite field,{} integral basis Examples: References: Description:
781815`CoerceVectorMatrixPackage: an unexposed,{} technical package for data conversions
781886`Provides combinatorial functions over an integral domain.
781976`CommonDenominator provides functions to compute the common denominator of a finite linear aggregate of elements of the quotient field of an integral domain.
782098`This package exports the elementary operators,{} with some semantics already attached to them. The semantics that is attached here is not dependent on the set in which the operators will be applied.
782145`A package for swapping the order of two variables in a tower of two UnivariatePolynomialCategory extensions.
782301`\indented{1}{Author:} Date Created: Date Last Updated: Basic Functions: Related Constructors: Complex,{} UnivariatePolynomial Also See: AMS Classifications: Keywords: complex,{} polynomial factorization,{} factor References:
782423`This package extends maps from underlying rings to maps between complex over those rings.
782510`This package provides the generalized euclidean algorithm which is needed as the basic step for factoring polynomials.
782634`This package supports matching patterns involving complex expressions
782759`This package supports converting complex expressions to patterns
782886`\spadtype{ComplexRootFindingPackage} provides functions to find all roots of a polynomial \spad{p} over the complex number by using Plesken's idea to calculate in the polynomial ring modulo \spad{f} and employing the Chinese Remainder Theorem. In this first version,{} the precision (see \spadfunFrom{digits}{Float}) is not increased when this is necessary to avoid rounding errors. Hence
782886`-- it is the user's responsibility to increase the precision if necessary. Note also,{} if this package is called with \spadignore{e.g.} \spadtype{Fraction Integer},{} the precise calculations could require a lot of time. Also note that evaluating the zeros is not necessarily a good check whether the result is correct: already evaluation can cause rounding errors.
783123`\spadtype{ComplexTrigonometricManipulations} provides function that compute the real and imaginary parts of complex functions.
783256`Solution of linear ordinary differential equations,{} constant coefficient case.
783430`CoordinateSystems provides coordinate transformation functions for plotting. Functions in this package return conversion functions which take points expressed in other coordinate systems and return points with the corresponding Cartesian coordinates.
783497`Enumeration by cycle indices.
783542`This package provides tools for working with cyclic streams.
783629`This package \undocumented{}
783688`\spadtype{DefiniteIntegrationTools} provides common tools used by the definite integration of both rational and elementary functions.
783813`This package \undocumented{}
783894`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 so
783894`--lutions} \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
783949`\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}.
784045`DiscreteLogarithmPackage implements help functions for discrete logarithms in monoids using small cyclic groups.
784117`DisplayPackage allows one to print strings in a nice manner,{} including highlighting substrings.
784162`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 .
784277`This package provides special functions for double precision real and complex floating point.
784334`This package provides functions for computing the residues of a function on an algebraic curve.
784560`Hack for the draw interface. DrawNumericHack provides a "coercion" from something of the form \spad{x = a..b} where \spad{a} and \spad{b} are formal expressions to a binding of the form \spad{x = c..d} where \spad{c} and \spad{d} are the numerical values of \spad{a} and \spad{b}. This "coercion" fails if \spad{a} and \spad{b} contains symbolic variables,{} but is meant for expressions involving \%\spad{pi}.
784630`This package \undocumented{}
784680`This package \undocumented{}
784737`This is a package for the exact computation of eigenvalues and eigenvectors. This package can be made to work for matrices with coefficients which are rational functions over a ring where we can factor polynomials. Rational eigenvalues are always explicitly computed while the non-rational ones are expressed in terms of their minimal polynomial.
784787`\spadtype{ElementaryFunctionDefiniteIntegration} provides functions to compute definite integrals of elementary functions.
784931`\spad{ElementaryFunctionLODESolver} provides the top-level functions for finding closed form solutions of linear ordinary differential equations and initial value problems.
785119`\spad{ElementaryFunctionODESolver} provides the top-level functions for finding closed form solutions of ordinary differential equations and initial value problems.
785255`This package provides functions to determine the sign of an elementary function around a point or infinity.
785375`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.
785508`Provides elementary functions over an integral domain.
785602`This package provides functions for integration,{} limited integration,{} extended integration and the risch differential equation for elemntary functions.
785715`\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.
785837`\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.
785952`The elliptic functions sn,{} sc and dn are expanded as Taylor series.
786082`This package provides operations for mapping the sides of equations.
786143`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
786143`-- 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 
786143`--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}{\
786143`--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
786186`\spadtype{EuclideanGroebnerBasisPackage} computes groebner bases for polynomial ideals over euclidean domains. The basic computation provides a distinguished set of generators for these ideals. This basis allows an easy test for membership: the operation \spadfun{euclideanNormalForm} returns zero on ideal members.
786186`-- The string "info" and "redcrit" can be given as additional args to provide incremental information during the computation. If "info" is given,{} \indented{1}{a computational summary is given for each \spad{s}-polynomial. If "redcrit"} is given,{} the reduced critical pairs are printed. The term ordering is determined by the polynomial type used. Suggested types include \spadtype{DistributedMultivariatePolynomial},{} \spadtype{HomogeneousDistributedMultivariatePolynomial},{} \spadtype{GeneralD
786186`--istributedMultivariatePolynomial}.
786379`This package is to be used in conjuction with \indented{12}{the CycleIndicators package. It provides an evaluation} \indented{12}{function for SymmetricPolynomials.}
786462`\spad{ExpertSystemContinuityPackage1} exports a function to check range inclusion
786551`ExpertSystemContinuityPackage is a package of functions for the use of domains belonging to the category \axiomType{NumericalIntegration}.
786610`\axiom{\spad{ExpertSystemToolsPackage1}} contains some useful functions for use by the computational agents of Ordinary Differential Equation solvers.
786682`\axiom{\spad{ExpertSystemToolsPackage2}} contains some useful functions for use by the computational agents of Ordinary Differential Equation solvers.
786758`\axiom{ExpertSystemToolsPackage} contains some useful functions for use by the computational agents of numerical solvers.
786813`Lifting of maps to Expressions. Date Created: 16 Jan 1989 Date Last Updated: 22 Jan 1990
786892`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.
786971`This package allows a mapping \spad{E} -> \spad{F} to be lifted to a kernel over \spad{E}; This lifting can fail if the operator of the kernel cannot be applied in \spad{F}; Do not use this package with \spad{E} = \spad{F},{} since this may drop some properties of the operators.
787061`Taylor series solutions of explicit ODE's.
787166`\spadtype{ExpressionToOpenMath} provides support for converting objects of type \spadtype{Expression} into OpenMath.
787237`This package provides functions to convert functional expressions to power series.
787367`\indented{1}{Author: Clifton \spad{J}. Williamson} Date Created: Bastille Day 1989 Date Last Updated: 5 June 1990 Keywords: Examples: Package for constructing tubes around 3-dimensional parametric curves.
787417`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).
787493`\spadtype{FactoredFunctionUtilities} implements some utility functions for manipulating factored objects.
787565`\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))}.
787646`computes various functions on factored arguments.
787712`This package provides utilities used by the factorizers which operate on polynomials represented as univariate polynomials with multivariate coefficients.
787846`\indented{1}{Finds the order of a divisor over a finite field} Author: Manuel Bronstein Date Created: 1988 Date Last Updated: 11 Jul 1990
788040`\indented{1}{Lift a map to finite divisors.} Author: Manuel Bronstein Date Created: 1988 Date Last Updated: 19 May 1993
788394`FiniteFieldFunctions(GF) is a package with functions concerning finite extension fields of the finite ground field {\em GF},{} \spadignore{e.g.} Zech logarithms.
788464`FiniteFieldHomomorphisms(\spad{F1},{}GF,{}\spad{F2}) exports coercion functions of elements between the fields {\em F1} and {\em F2},{} which both must be finite simple algebraic extensions of the finite ground field {\em GF}.
788620`\spad{FiniteFieldPolynomialPackage2}(\spad{F},{}GF) exports some functions concerning finite fields,{} which depend on a finite field {\em GF} and an algebraic extension \spad{F} of {\em GF},{} \spadignore{e.g.} a zero of a polynomial over {\em GF} in \spad{F}.
788747`This package provides a number of functions for generating,{} counting and testing irreducible,{} normal,{} primitive,{} random polynomials over finite fields.
788828`This package solves linear diophantine equations for Bivariate polynomials over finite fields
789001`\spad{FiniteLinearAggregateFunctions2} provides functions involving two FiniteLinearAggregates where the underlying domains might be different. An example of this might be creating a list of rational numbers by mapping a function across a list of integers where the function divides each integer by 1000.
789138`This package exports 3 sorting algorithms which work over FiniteLinearAggregates.
789242`\spad{FiniteSetAggregateFunctions2} provides functions involving two finite set aggregates where the underlying domains might be different. An example of this is to create a set of rational numbers by mapping a function across a set of integers,{} where the function divides each integer by 1000.
789384`\indented{3}{This is a package for the approximation of complex solutions for} systems of equations of rational functions with complex rational coefficients. The results are expressed as either complex rational numbers or complex floats depending on the type of the precision parameter which can be either a rational number or a floating point number.
789457`\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.
789533`\spadtype{FortranCodePackage1} provides some utilities for producing useful objects in FortranCode domain. The Package may be used with the FortranCode domain and its \spad{printCode} or possibly via an outputAsFortran. (The package provides items of use in connection with ASPs in the AXIOM-NAG link and,{} where appropriate,{} naming accords with that in IRENA.) The easy-to-use functions use Fortran loop variables \spad{I1},{} \spad{I2},{} and it is users
789533`--' responsibility to check that this is sensible. The advanced functions use SegmentBinding to allow users control over Fortran loop variable names.
789582`Code to manipulate Fortran Output Stack
789634`provides an interface to the boot code for calling Fortran
789676`This package extends a map between integral domains to a map between Fractions over those domains by applying the map to the numerators and denominators.
789759`\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.
790076`\spad{FramedNonAssociativeAlgebraFunctions2} implements functions between two framed non associative algebra domains defined over different rings. The function map is used to coerce between algebras over different domains having the same structural constants.
790255`Lifts a map from rings to function fields over them.
790658`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 func
790658`--tion field over \spad{R}.
790806`Attaching assertions to symbols for pattern matching; Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990
790897`Attaching predicates to symbols for pattern matching. Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990
791004`\spadtype{FunctionSpaceComplexIntegration} provides functions for the indefinite integration of complex-valued functions.
791140`This package allows a mapping \spad{R} -> \spad{S} to be lifted to a mapping from a function space over \spad{R} to a function space over \spad{S}.
791250`\spadtype{FunctionSpaceIntegration} provides functions for the indefinite integration of real-valued functions.
791378`FunctionsSpacePrimitiveElement provides functions to compute primitive elements in functions spaces.
791489`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().
791587`computes sums of top-level expressions.
791692`This package converts expressions in some function space to exponential expansions.
791846`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
791846`-- variable \spad{x}. The function \spadfun{exprToGenUPS} converts functional expressions to power series whose coefficients may involve functions of \spad{log(x)}.
792109`\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
792268`Provides some special functions over an integral domain.
792363`\spadtype{GaloisGroupFactorizationUtilities} provides functions that will be used by the factorizer.
792509`\spadtype{GaloisGroupFactorizer} provides functions to factor resolvents.
792602`\spadtype{GaloisGroupPolynomialUtilities} provides useful functions for univariate polynomials which should be added to \spadtype{UnivariatePolynomialCategory} or to \spadtype{Factored} (July 1994).
792711`\spadtype{GaloisGroupUtilities} provides several useful functions.
792769`Package for the factorization of complex or gaussian integers.
792829`\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 liftin
792829`--g 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]}.
792928`\indented{1}{Description} This package provides operations for the factorization of univariate polynomials with integer coefficients. The factorization is done by "lifting" the finite "berlekamp's" factorization
792991`\indented{1}{Author : \spad{P}.Gianni} General Hensel Lifting Used for Factorization of bivariate polynomials over a finite field.
793103`This package provides operations for GCD computations on polynomials
793273`\indented{2}{This is the top level package for doing multivariate factorization} over basic domains like \spadtype{Integer} or \spadtype{Fraction Integer}.
793459`\spadtype{GenerateUnivariatePowerSeries} provides functions that create power series from explicit formulas for their \spad{n}th coefficient.
793588`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.
793708`Gosper's summation algorithm.
793898`TwoDimensionalPlotSettings sets global flags and constants for 2-dimensional plotting.
793943`GrayCode provides a function for efficiently running through all subsets of a finite set,{} only changing one element by another one.
793979`\spadtype{GroebnerFactorizationPackage} provides the function groebnerFactor" which uses the factorization routines of \Language{} to factor each polynomial under consideration while doing the groebner basis algorithm. Then it writes the ideal as an intersection of ideals determined by the irreducible factors.
793979`-- Note that the whole ring may occur as well as other redundancies. We also use the fact,{} that from the second factor on we can assume that the preceding factors are not equal to 0 and we divide all polynomials under considerations by the elements of this list of "nonZeroRestrictions". The result is a list of groebner bases,{} whose union of solutions of the corresponding systems of equations is the solution of the system of equation corresponding to the input list. The term ordering is deter
793979`--mined by the polynomial type used. Suggested types include \spadtype{DistributedMultivariatePolynomial},{} \spadtype{HomogeneousDistributedMultivariatePolynomial},{} \spadtype{GeneralDistributedMultivariatePolynomial}.
794176`\indented{1}{Author:} Date Created: Date Last Updated: Keywords: Description This package provides low level tools for Groebner basis computations
794357`\spadtype{GroebnerPackage} computes groebner bases for polynomial ideals. The basic computation provides a distinguished set of generators for polynomial ideals over fields. This basis allows an easy test for membership: the operation \spadfun{normalForm} returns zero on ideal members. When the provided coefficient domain,{} Dom,{} is not 
794357`--a field,{} the result is equivalent to considering the extended ideal with \spadtype{Fraction(Dom)} as coefficients,{} but considerably more efficient since all calculations are performed in Dom. Additional argument "info" and "redcrit" can be given to provide incremental information during computation. Argument "info" produces a computational summary for each \spad{s}-polynomial. Argument "redcrit" prints out the reduced critical pairs. The term ordering is determined by the polynomial type u
794357`--sed. Suggested types include \spadtype{DistributedMultivariatePolynomial},{} \spadtype{HomogeneousDistributedMultivariatePolynomial},{} \spadtype{GeneralDistributedMultivariatePolynomial}.
794524`\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.
794611`\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
794611`--{P}. Hall as given in Serre's book Lie Groups 
794611`-- Lie Algebras
794646`This package provides the functions for the heuristic integer gcd. Geddes's algorithm,{}for univariate polynomials with integer coefficients
794723`\indented{2}{This package provides functions for the primary decomposition of} polynomial ideals over the rational numbers. The ideals are members of the \spadtype{PolynomialIdeals} domain,{} and the polynomial generators are required to be from the \spadtype{DistributedMultivariatePolynomial} domain.
794820`This package provides operations to create incrementing functions.
794887`This package computes infinite products of univariate Taylor series over an integral domain of characteristic 0.
795032`This package computes infinite products of univariate Taylor series over an arbitrary finite field.
795226`This package computes infinite products of univariate Taylor series over a field of prime order.
795354`Functions defined on streams with entries in two sets.
795432`Default infinity signatures for the interpreter; Date Created: 4 Oct 1989 Date Last Updated: 4 Oct 1989
795472`Factorization of univariate polynomials with coefficients in an algebraic extension of a field over which we can factor UP's.
795642`InnerCommonDenominator provides functions to compute the common denominator of a finite linear aggregate of elements of the quotient field of an integral domain.
795799`\spadtype{InnerMatrixLinearAlgebraFunctions} is an internal package which provides standard linear algebra functions on domains in \spad{MatrixCategory}
795969`\spadtype{InnerMatrixQuotientFieldFunctions} provides functions on matrices over an integral domain which involve the quotient field of that integral domain. The functions rowEchelon and inver
795969`--se return matrices with entries in the quotient field.
796425`\indented{2}{This is an inner package for factoring multivariate polynomials} over various coefficient domains in characteristic 0. The univariate factor operation is passed as a parameter. Multivariate hensel lifting is used to lift the univariate factorization
796576`InnerNormalBasisFieldFunctions(GF) (unexposed): This package has functions used by every normal basis finite field extension domain.
796658`This package is the inner package to be used by NumericRealEigenPackage and NumericComplexEigenPackage for the computation of numeric eigenvalues and eigenvectors.
796752`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)},{} \spa
796752`--d{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}.
796856`Find the sign of a polynomial around a point or infinity.
796947`tools for the summation packages.
797080`This package provides transformations from trigonometric functions to exponentials and logarithms,{} and back. \spad{F} and FG should be the same type of function space.
797235`Tools for manipulating input forms.
797292`This package provides functions to lookup bits in integers
797409`\indented{1}{This Package contains basic methods for integer factorization.} The factor operation employs trial division up to 10,{}000. It then tests to see if \spad{n} is a perfect power before using Pollards rho method. Because Pollards method may fail,{} the result of factor may contain composite factors. We should also employ Lenstra's eliptic curve method.
797489`Test for linear dependence over the integers.
797560`This package provides various number theoretic functions on the integers.
797620`The \spadtype{IntegerPrimesPackage} implements a modification of Rabin's probabilistic primality test and the utility functions \spadfun{nextPrime},{} \spadfun{prevPrime} and \spadfun{primes}.
797692`Provides integer testing and retraction functions. Date Created: March 1990 Date Last Updated: 9 April 1991
797765`The \spadtype{IntegerRoots} package computes square roots and \indented{2}{\spad{n}th roots of integers efficiently.}
797828`This package provides the implementation for the \spadfun{solveLinearPolynomialEquation} operation over the integers. It uses a lifting technique from the package GenExEuclid
797895`IntegralBasisPolynomialTools provides functions for \indented{1}{mapping functions on the coefficients of univariate and bivariate} \indented{1}{polynomials.}
798047`This package contains functions used in the packages FunctionFieldIntegralBasis and NumberFieldIntegralBasis.
798186`\indented{1}{Internally used by the integration packages} Author: Manuel Bronstein Date Created: 1987 Date Last Updated: 12 August 1992 Keywords: integration.
798258`\indented{2}{This package allows a sum of logs over the roots of a polynomial} \indented{2}{to be expressed as explicit logarithms and arc tangents,{} provided} \indented{2}{that the indexing polynomial can be factored into quadratics.} Date Created: 21 August 1988 Date Last Updated: 4 October 1993
798339`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.
798468`\indented{1}{Tools for the integrator} Author: Manuel Bronstein Date Created: 25 April 1990 Date Last Updated: 9 June 1993 Keywords: elementary,{} function,{} integration.
798553`A package to print strings without line-feed nor carriage-return.
798604`\indented{1}{An internal package for computing the rational univariate representation} \indented{1}{of a zero-dimensional algebraic variety given by a square-free} \indented{1}{triangular set.} \indented{1}{The main operation is \axiomOpFrom{rur}{InternalRationalUn
798604`--ivariateRepresentationPackage}.} \indented{1}{It is based on the {\em generic} algorithm description in [1]. \newline References:} [1] \spad{D}. LAZARD "Solving Zero-dimensional Algebraic Systems" \indented{4}{Journal of Symbolic Computation,{} 1992,{} 13,{} 117-131}
798847`This package computes the inverse Laplace Transform.
798977`IrrRepSymNatPackage contains functions for computing the ordinary irreducible representations of symmetric groups on \spad{n} letters {\em {1,2,...,n}} in Young's natural form and their dimensions. These representations can be labelled by number partitions of \spad{n},{} \spadignore{i.e.} a weakly decreasing sequence of integers summing up to \spad{n},{} \spadignore{e.g.} {\em [3,3,3,1]} labels an irreducible representation for \spad{n} equals 10. Note: whe
798977`--never a \spadtype{List Integer} appears in a signature,{} a partition required.
799024`This package exports the function generateIrredPoly that computes a monic irreducible polynomial of degree \spad{n} over a finite field.
799103`This package exports some auxiliary functions on kernels
799180`\spadtype{Kovacic} provides a modified Kovacic's algorithm for solving explicitely irreducible 2nd order linear ordinary differential equations.
799289`This package computes the forward Laplace Transform.
799411`A package for solving polynomial systems by means of Lazard triangular sets [1]. This package provides two operations. One for solving in the sense of the regular zeros,{} and the other for solving in the sense of the Zariski closure. Both produce square-free reg
799411`--ular sets. Moreover,{} the decompositions do not contain any redundant component. However,{} only zero-dimensional regular sets are normalized,{} since normalization may be time consumming in positive dimension. The decomposition process is that of [2].\newline References : \indented{1}{[1] \spad{D}. LAZARD "A new method for solving algebraic systems of} \indented{5}{positive dimension" Discr. App. Math. 33:147-160,{}1991} \indented{1}{[2] \spad{M}. MORENO MAZA "A new algorithm for computing t
799411`--riangular} \indented{5}{decomposition of algebraic varieties" NAG Tech. Rep. 4/98.}
799656`Package for leading coefficient determination in the lifting step. Package working for every \spad{R} euclidean with property "F".
799808`A package for solving polynomial systems with finitely many solutions. The decompositions are given by means of regular triangular sets. The computations use lexicographical Groebner bases. The main operations are \axiomOpFrom{lexTriangular}{LexTriangularPackage} and \axiomOpFrom{squareFreeLexTriangular}{LexTriangularPackage}. The second one provide decompositions by means of square-free regular triangular sets. Both are 
799808`--based on the {\em lexTriangular} method described in [1]. They differ from the algorithm described in [2] by the fact that multiciplities of the roots are not kept. With the \axiomOpFrom{squareFreeLexTriangular}{LexTriangularPackage} operation all multiciplities are removed. With the other operation some multiciplities may remain. Both operations admit an optional argument to produce normalized triangular sets. \newline
799891`\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.
799969`Test for linear dependence.
800053`\spadtype{LinearOrdinaryDifferentialOperatorFactorizer} provides a factorizer for linear ordinary differential operators whose coefficients are rational functions.
800184`\spad{LinearOrdinaryDifferentialOperatorsOps} provides symmetric products and sums for linear ordinary differential operators.
800313`Given a PolynomialFactorizationExplicit ring,{} this package provides a defaulting rule for the \spad{solveLinearPolynomialEquation} operation,{} by moving into the field of fractions,{} and solving it there via the \spad{multiEuclidean} operation.
800413`This package solves linear system in the matrix form \spad{AX = B}. It is essentially a particular instantiation of the package \spadtype{LinearSystemMatrixPackage} for Matrix and Vector. This package's existence makes it easier to use \spadfun{solve} in the AXIOM interpreter.
800476`This package solves linear system in the matrix form \spad{AX = B}.
800655`this package finds the solutions of linear systems presented as a list of polynomials.
800807`This package provides liouvillian functions over an integral domain.
800902`\spadtype{ListFunctions2} implements utility functions that operate on two kinds of lists,{} each with a possibly different type of element.
800961`\spadtype{ListFunctions3} implements utility functions that operate on three kinds of lists,{} each with a possibly different type of element.
801029`\spadtype{ListToMap} allows mappings to be described by a pair of lists of equal lengths. The image of an element \spad{x},{} which appears in position \spad{n} in the first list,{} is then the \spad{n}th element of the second list. A default value or default function can be specified to be used when \spad{x} does not appear in the first list. In the absence of defaults,{} an error will occur in that case.
801093`\indented{1}{Utilities for MPolyCat} Author: Manuel Bronstein Date Created: 1987 Date Last Updated: 28 March 1990 (PG)
801318`This package \undocumented
801557`\indented{3}{This package exports a factor operation for multivariate polynomials} with coefficients which are polynomials over some ring \spad{R} over which we can factor. It is used internally by packages such as the solve package which need to work with polynomials in a specific set of variables with coefficients which are polynom
801557`--ials in all the other variables.
801730`\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 coefficient
801730`--s,{} \spadignore{i.e.} themselves fractions of polynomials.
801924`\indented{1}{MRationalFactorize contains the factor function for multivariate} polynomials over the quotient field of a ring \spad{R} such that the package MultivariateFactorize can factor multivariate polynomials over \spad{R}.
802089`transforms top-level objects into compiled functions.
802205`MakeFloatCompiledFunction transforms top-level objects into compiled Lisp functions whose arguments are Lisp floats. This by-passes the \Language{} compiler and interpreter,{} thereby gaining several orders of magnitude.
802288`transforms top-level objects into interpreter functions.
802357`MakeRecord is used internally by the interpreter to create record types which are used for doing parallel iterations on streams.
802415`transforms top-level objects into compiled functions.
802517`various Currying operations.
802577`various Currying operations.
802653`various Currying operations.
802745`various Currying operations.
802819`various Currying operations.
802909`various Currying operations.
803015`\spadtype{MatrixCategoryFunctions2} provides functions between two matrix domains. The functions provided are \spadfun{map} and \spadfun{reduce}.
803306`MatrixCommonDenominator provides functions to compute the common denominator of a matrix of elements of the quotient field of an integral domain.
803406`\spadtype{MatrixLinearAlgebraFunctions} provides functions to compute inverses and canonical forms.
803580`This package exports tools for merging lists
803633`\indented{1}{<description of package>} Author: Jim Wen Date Created: ?? Date Last Updated: October 1991 by Jon Steinbach Keywords: Examples: References:
803699`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.
803801`\indented{1}{Modular hermitian row reduction.} Author: Manuel Bronstein Date Created: 22 February 1989 Date Last Updated: 24 November 1993 Keywords: matrix,{} reduction.
803879`\spad{MonoidRingFunctions2} implements functions between two monoid rings defined with the same monoid over different rings.
803954`Tools for handling monomial extensions.
804056`\spadtype{MoreSystemCommands} implements an interface with the system command facility. These are the commands that are issued from source files or the system interpreter and they start with a close parenthesis,{} \spadignore{e.g.} \spadsyscom{what} commands.
804105`Package for factorization of multivariate polynomials over finite fields.
804258`\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.
804446`Lifting of a map through 2 levels of polynomials.
804721`\indented{2}{This is the top level package for doing multivariate factorization} over basic domains like \spadtype{Integer} or \spadtype{Fraction Integer}.
804880`This package provides the functions for the multivariate "lifting",{} using an algorithm of Paul Wang. This package will work for every euclidean domain \spad{R} which has property \spad{F},{} \spadignore{i.e.} there exists a factor operation in \spad{R[x]}.
805024`Author : \spad{P}.Gianni This package provides the functions for the computation of the square free decomposition of a multivariate polynomial. It uses the package GenExEuclid for the resolution of the equation \spad{Af + Bg = h} and its generalization to \spad{n} polynomials over an integral domain and the package \spad{MultivariateLifting} for the "multi
805024`--variate" lifting.
805174`Support functions for the NAG Library Link functions
805224`Package for the determination of the coefficients in the lifting process. Used by \spadtype{MultivariateLifting}. This package will work for every euclidean domain \spad{R} which has property \spad{F},{} \spadignore{i.e.} there exists a factor operation in \spad{R[x]}.
805391`This package uses the NAG Library to compute \begin{items} \item eigenvalues and eigenvectors of a matrix \item eigenvalues and eigenvectors of generalized matrix eigenvalue problems \item singular values and singular vectors of a matrix. \end{items} See \downlink{Manual Page}{\spad{manpageXXf02}}.
805436`This package uses the NAG Library to find a function which approximates a set of data points. Typically the data contain random errors,{} as of experimental measurement,{} which need to be smoothed out. To seek an approximation to the data,{} it is first necessary to specify for the approximating function a mathematical form (a polynomial,{} for example) which contains a number of unspecified coefficients: the appropriate fitting routine then derives for th
805436`--e coefficients the values which provide the best fit of that particular form. The package deals mainly with curve and surface fitting (\spadignore{i.e.} fitting with functions of one and of two variables) when a polynomial or a cubic spline is used as the fitting function,{} since these cover the most common needs. However,{} fitting with other functions and/or more variables can be undertaken by means of general linear or nonlinear routines (some of which are contained in other packages) depe
805436`--nding on whether the coefficients in the function occur linearly or nonlinearly. Cases where a graph rather than a set of data points is given can be treated simply by first reading a suitable set of points from the graph. The package also contains routines for evaluating,{} differentiating and integrating polynomial and spline curves and surfaces,{} once the numerical values of their coefficients have been determined. See \downlink{Manual Page}{\spad{manpageXXe02}}.
805483`This package uses the NAG Library to calculate the numerical value of definite integrals in one or more dimensions and to evaluate weights and abscissae of integration rules. See \downlink{Manual Page}{\spad{manpageXXd01}}.
805534`This package uses the NAG Library to calculate the interpolation of a function of one or two variables. When provided with the value of the function (and possibly one or more of its lowest-order derivatives) at each of a number of values of the variable(\spad{s}),{} the routines provide either an interpolating function or an interpolated value. For some of the interpolating functions,{} there are supporting routines to evaluate,{} differentiate or int
805534`--egrate them. See \downlink{Manual Page}{\spad{manpageXXe01}}.
805587`This package uses the NAG Library to compute matrix factorizations,{} and to solve systems of linear equations following the matrix factorizations. See \downlink{Manual Page}{\spad{manpageXXf07}}.
805626`This package uses the NAG Library to solve the matrix equation \axiom{AX=B},{} where \axiom{\spad{B}} may be a single vector or a matrix of multiple right-hand sides. The matrix \axiom{A} may be real,{} complex,{} symmetric,{} Hermitian positive- definite,{} or sparse. It may also be rectangular,{} in which case a least-squares solution is obtained. See \downlink{Manual Page}{\spad{manpageXXf04}}.
805687`This package uses the NAG Library to provide facilities for matrix factorizations and associated transformations. See \downlink{Manual Page}{\spad{manpageXXf01}}.
805743`This package uses the NAG Library to perform optimization. An optimization problem involves minimizing a function (called the objective function) of several variables,{} possibly subject to restrictions on the values of the variables defined by a set of constraint functions. The routines in the NAG Foundation Library are concerned with function minimization only,{} since the problem of maximizing a given function can be transformed into a minimization 
805743`--problem simply by multiplying the function by \spad{-1}. See \downlink{Manual Page}{\spad{manpageXXe04}}.
805795`This package uses the NAG Library to calculate the numerical solution of ordinary differential equations. There are two main types of problem,{} those in which all boundary conditions are specified at one point (initial-value problems),{} and those in which the boundary conditions are distributed between two or more points (boundary- value problems and eigenvalue problems). Routines are available for initial-value problems,{} two-point
805795`-- boundary-value problems and Sturm-Liouville eigenvalue problems. See \downlink{Manual Page}{\spad{manpageXXd02}}.
805864`This package uses the NAG Library to solve partial differential equations. See \downlink{Manual Page}{\spad{manpageXXd03}}.
805932`This package uses the NAG Library to compute the zeros of a polynomial with real or complex coefficients. See \downlink{Manual Page}{\spad{manpageXXc02}}.
805987`This package uses the NAG Library to calculate real zeros of continuous real functions of one or more variables. (Complex equations must be expressed in terms of the equivalent larger system of real equations.) See \downlink{Manual Page}{\spad{manpageXXc05}}.
806038`This package uses the NAG Library to calculate the discrete Fourier transform of a sequence of real or complex data values,{} and applies it to calculate convolutions and correlations. See \downlink{Manual Page}{\spad{manpageXXc06}}.
806093`This package uses the NAG Library to compute some commonly occurring physical and mathematical functions. See \downlink{Manual Page}{manpageXXs}.
806147`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.
806231`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.
806328`NonLinearFirstOrderODESolver provides a function for finding closed form first integrals of nonlinear ordinary differential equations of order 1.
806465`NonLinearSolvePackage is an interface to \spadtype{SystemSolvePackage} that attempts to retract the coefficients of the equations before solving. The solutions are given in the algebraic closure of \spad{R} whenever possible.
806534`\spadtype{NoneFunctions1} implements functions on \spadtype{None}. It particular it includes a particulary dangerous coercion from any other type to \spadtype{None}.
806584`This package implements the norm of a polynomial with coefficients in a monogenic algebra (using resultants)
806763`This package \undocumented
806988`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}
806988`--{[2] \spad{M}. MORENO MAZA and \spad{R}. RIOBOO "Computations of gcd over} \indented{5}{algebraic towers of simple extensions" In proceedings of \spad{AAECC11}} \indented{5}{Paris,{} 1995.} \indented{1}{[3] \spad{M}. MORENO MAZA "Calculs de pgcd au-dessus des tours} \indented{5}{d'extensions simples et resolution des systemes d'equations} \indented{5}{algebriques" These,{} Universite \spad{P}.etM. Curie,{} Paris,{} 1997.}
807178`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}.
807306`NumberFormats provides function to format and read arabic and roman numbers,{} to convert numbers to strings and to read floating-point numbers.
807349`This package provides polynomials as functions on a ring.
807432`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.
807506`\spadtype{NumericContinuedFraction} provides functions \indented{2}{for converting floating point numbers to continued fractions.}
807584`This package computes explicitly eigenvalues and eigenvectors of matrices with entries over the Rational Numbers. The results are expressed as floating numbers or as rational numbers depending on the type of the parameter Par.
807655`\indented{1}{Author: Clifton \spad{J}. Williamson} Date Created: Bastille Day 1989 Date Last Updated: 5 June 1990 Keywords: Examples: Package for constructing tubes around 3-dimensional parametric curves.
807735`Numeric provides real and complex numerical evaluation functions for various symbolic types.
807796`This package is a suite of functions for the numerical integration of an ordinary differential equation of \spad{n} variables: \blankline \indented{8}{\center{dy/dx = \spad{f}(\spad{y},{}\spad{x})\space{5}\spad{y} is an \spad{n}-vector}} \blankline \par All the routines are based on a 4-th order Runge-Kutta kernel. These routines generally have as arguments: \spad{n},{} the number of dependent variables; \spad{x1},{} the initial point; 
807796`--\spad{h},{} the step size; \spad{y},{} a vector of initial conditions of length \spad{n} which upon exit contains the solution at \spad{x1 + h}; \spad{derivs},{} a function which computes the right hand side of the ordinary differential equation: \spad{derivs(dydx,y,x)} computes \spad{dydx},{} a vector which contains the derivative information. \blankline \par In order of increasing complexity:\begin{items} \blankline \item \spad{rk4(y,n,x1,h,derivs)} advances the solution vector to \spad{x1 +
807796`-- h} and return the values in \spad{y}. \blankline \item \spad{rk4(y,n,x1,h,derivs,t1,t2,t3,t4)} is the same as \spad{rk4(y,n,x1,h,derivs)} except that you must provide 4 scratch arrays \spad{t1}-\spad{t4} of size \spad{n}. \blankline \item Starting with \spad{y} at \spad{x1},{} \spad{rk4f(y,n,x1,x2,ns,derivs)} uses \spad{ns} fixed steps of a 4-th order Runge-Kutta integrator to advance the solution vector to \spad{x2} and return the values in \spad{y}. Argument \spad{x2},{} is the final point,
807796`--{} and \spad{ns},{} the number of steps to take. \blankline \item \spad{rk4qc(y,n,x1,step,eps,yscal,derivs)} takes a 5-th order Runge-Kutta step with monitoring of local truncation to ensure accuracy and adjust stepsize. The function takes two half steps and one full step and scales the difference in solutions at the final point. If the error is within \spad{eps},{} the step is taken and the result is returned. If the error is not within \spad{eps},{} the stepsize if decreased and the procedur
807796`--e is tried again until the desired accuracy is reached. Upon input,{} an trial step size must be given and upon return,{} an estimate of the next step size to use is returned as well as the step size which produced the desired accuracy. The scaled error is computed as \center{\spad{error = MAX(ABS((y2steps(i) - y1step(i))/yscal(i)))}} and this is compared against \spad{eps}. If this is greater than \spad{eps},{} the step size is reduced accordingly to \center{\spad{hnew = 0.9 * hdid * (error/e
807796`--ps)**(-1/4)}} If the error criterion is satisfied,{} then we check if the step size was too fine and return a more efficient one. If \spad{error > \spad{eps} * (6.0E-04)} then the next step size should be \center{\spad{hnext = 0.9 * hdid * (error/\spad{eps})**(\spad{-1/5})}} Otherwise \spad{hnext = 4.0 * hdid} is returned. A more detailed discussion of this and related topics can be found in the book "Numerical Recipies" by \spad{W}.Press,{} \spad{B}.\spad{P}. Flannery,{} \spad{S}.A. Teukolsky
807796`--,{} \spad{W}.\spad{T}. Vetterling published by Cambridge University Press. Argument \spad{step} is a record of 3 floating point numbers \spad{(try , did , next)},{} \spad{eps} is the required accuracy,{} \spad{yscal} is the scaling vector for the difference in solutions. On input,{} \spad{step.try} should be the guess at a step size to achieve the accuracy. On output,{} \spad{step.did} contains the step size which achieved the accuracy and \spad{step.next} is the next step size to use. \blankl
807796`--ine \item \spad{rk4qc(y,n,x1,step,eps,yscal,derivs,t1,t2,t3,t4,t5,t6,t7)} is the same as \spad{rk4qc(y,n,x1,step,eps,yscal,derivs)} except that the user must provide the 7 scratch arrays \spad{t1-t7} of size \spad{n}. \blankline \item \spad{rk4a(y,n,x1,x2,eps,h,ns,derivs)} is a driver program which uses \spad{rk4qc} to integrate \spad{n} ordinary differential equations starting at \spad{x1} to \spad{x2},{} keeping the local truncation error to within \spad{eps} by changing the local step size.
807796`-- The scaling vector is defined as \center{\spad{yscal(i) = abs(y(i)) + abs(h*dydx(i)) + tiny}} where \spad{y(i)} is the solution at location \spad{x},{} \spad{dydx} is the ordinary differential equation's right hand side,{} \spad{h} is the current step size and \spad{tiny} is 10 times the smallest positive number representable. The user must supply an estimate for a trial step size and the maximum number of calls to \spad{rk4qc} to use. Argument \spad{x2} is the final point,{} \spad{eps} is lo
807796`--cal truncation,{} \spad{ns} is the maximum number of call to \spad{rk4qc} to use. \end{items}
807864`This suite of routines performs numerical quadrature using algorithms derived from the basic trapezoidal rule. Because the error term of this rule contains only even powers of the step size (for open and closed versions),{} fast convergence can be obtained if the integrand is sufficiently smooth. \blankline Each routine returns a Record of type TrapAns,{} which contains\indent{3} \newline value (\spadtype{Float}):\tab{20} estimate of the integral \newlin
807864`--e error (\spadtype{Float}):\tab{20} estimate of the error in the computation \newline totalpts (\spadtype{Integer}):\tab{20} total number of function evaluations \newline success (\spadtype{Boolean}):\tab{20} if the integral was computed within the user specified error criterion \indent{0}\indent{0} To produce this estimate,{} each routine generates an internal sequence of sub-estimates,{} denoted by {\em S(i)},{} depending on the routine,{} to which the various convergence criteria are applie
807864`--d. The user must supply a relative accuracy,{} \spad{eps_r},{} and an absolute accuracy,{} \spad{eps_a}. Convergence is obtained when either \center{\spad{ABS(S(i) - S(i-1)) < eps_r * ABS(S(i-1))}} \center{or \spad{ABS(S(i) - S(i-1)) < eps_a}} are \spad{true} statements. \blankline The routines come in three families and three flavors: \newline\tab{3} closed:\tab{20}romberg,{}\tab{30}simpson,{}\tab{42}trapezoidal \newline\tab{3} open: \tab{20}rombergo,{}\tab{30}simpsono,{}\tab{42}trapezoidalo 
807864`--\newline\tab{3} adaptive closed:\tab{20}aromberg,{}\tab{30}asimpson,{}\tab{42}atrapezoidal \par The {\em S(i)} for the trapezoidal family is the value of the integral using an equally spaced absicca trapezoidal rule for that level of refinement. \par The {\em S(i)} for the simpson family is the value of the integral using an equally spaced absicca simpson rule for that level of refinement. \par The {\em S(i)} for the romberg family is the estimate of the integral using an equally spaced absicc
807864`--a romberg method. For the \spad{i}\spad{-}th level,{} this is an appropriate combination of all the previous trapezodial estimates so that the error term starts with the \spad{2*(i+1)} power only. \par The three families come in a closed version,{} where the formulas include the endpoints,{} an open version where the formulas do not include the endpoints and an adaptive version,{} where the user is required to input the number of subintervals over which the appropriate closed family integrator
807864`-- will apply with the usual convergence parmeters for each subinterval. This is useful where a large number of points are needed only in a small fraction of the entire domain. \par Each routine takes as arguments: \newline \spad{f}\tab{10} integrand \newline a\tab{10} starting point \newline \spad{b}\tab{10} ending point \newline \spad{eps_r}\tab{10} relative error \newline \spad{eps_a}\tab{10} absolute error \newline \spad{nmin} \tab{10} refinement level when to start checking for convergence 
807864`--(> 1) \newline \spad{nmax} \tab{10} maximum level of refinement \par The adaptive routines take as an additional parameter \newline \spad{nint}\tab{10} the number of independent intervals to apply a closed \indented{1}{family integrator of the same name.} \par Notes: \newline Closed family level \spad{i} uses \spad{1 + 2**i} points. \newline Open family level \spad{i} uses \spad{1 + 3**i} points.
807914`\spadtype{ODEIntegration} provides an interface to the integrator. This package is intended for use by the differential equations solver but not at top-level.
808038`\spad{ODETools} provides tools for the linear ODE solver.
808144`\spad{OctonionCategoryFunctions2} implements functions between two octonion domains defined over different rings. The function map is used to coerce between octonion types.
808289`\indented{1}{This package provides tools for operating on one-dimensional arrays} with unary and binary functions involving different underlying types
808365`Lifting of maps to one-point completions. Date Created: 4 Oct 1989 Date Last Updated: 4 Oct 1989
808455`\spadtype{OpenMathPackage} provides some simple utilities to make reading OpenMath objects easier.
808499`\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.
808552`This package exports tools to create AXIOM Library information databases.
808598`Lifting of maps to ordered completions. Date Created: 4 Oct 1989 Date Last Updated: 4 Oct 1989
808687`\indented{3}{This package provides ordering functions on vectors which} are suitable parameters for OrderedDirectProduct.
808783`This package provides orthogonal polynomials as functions on a ring.
808861`OutPackage allows pretty-printing from programs.
808901`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 polynom
808901`--ial \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.
809091`\indented{1}{This package computes reliable Pad&ea. approximants using} a generalized Viskovatov continued fraction algorithm. Authors: Trager,{}Burge,{} Hassner & Watt. Date Created: April 1987 Date Last Updated: 12 April 1990 Keywords: Pade,{} series Examples: References: \indented{2}{"Pade Approximants,{} Part I: Basic Theory",{} Baker & Graves-Morris.}
809173`\indented{1}{This package computes reliable Pad&ea. approximants using} a generalized Viskovatov continued fraction algorithm. Authors: Burge,{} Hassner & Watt. Date Created: April 1987 Date Last Updated: 12 April 1990 Keywords: Pade,{} series Examples: References: \indented{2}{"Pade Approximants,{} Part I: Basic Theory",{} Baker & Graves-Morris.}
809305`This package implements fixed-point computations on streams.
809375`Author: William Sit,{} spring 89
809562`This package \undocumented
809644`This package \undocumented
809726`This package \undocumented
809805`\indented{1}{This package provides a simple Spad script parser.} Related Constructors: Syntax. See Also: Syntax.
809841`The package \spadtype{PartialFractionPackage} gives an easier to use interfact the domain \spadtype{PartialFraction}. The user gives a fraction of polynomials,{} and a variable and the package converts it to the proper datatype for the \spadtype{PartialFraction} domain.
809921`PartitionsAndPermutations contains functions for generating streams of integer partitions,{} and streams of sequences of integers composed from a multi-set.
809978`Tools for patterns.
810050`Lifts maps to patterns.
810129`Attaching assertions to symbols for pattern matching. Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990
810180`This package provides pattern matching functions on function spaces.
810309`This package provides pattern matching functions on integers.
810391`\spadtype{PatternMatchIntegration} provides functions that use the pattern matcher to find some indefinite and definite integrals involving special functions and found in the litterature.
810519`This package provides pattern matching functions on kernels.
810611`This package provides pattern matching functions on lists.
810728`This package provides pattern matching functions on polynomials.
810907`This packages provides tools for matching recursively in type towers.
811023`This package provides pattern matching functions on quotients.
811161`Lifts maps to pattern matching results.
811266`This package provides pattern matching functions on symbols.
811327`This package provides tools for the pattern matcher.
811419`This package provides the top-level pattern macthing functions.
811561`Permanent implements the functions {\em permanent},{} the permanent for square matrices.
811637`PermutationGroupExamples provides permutation groups for some classes of groups: symmetric,{} alternating,{} dihedral,{} cyclic,{} direct products of cyclic,{} which are in fact the finite abelian groups of symmetric groups called Young subgroups. Furthermore,{} Rubik's group as permutation group of 48 integers and a list of sporadic simple groups derived from the atlas of finite groups.
811688`\indented{1}{Provides a coercion from the symbolic fractions in \%\spad{pi} with} integer coefficients to any Expression type. Date Created: 21 Feb 1990 Date Last Updated: 21 Feb 1990
811748`\spad{PlotFunctions1} provides facilities for plotting curves where functions SF -> SF are specified by giving an expression
811818`This package exports plotting tools
811859`This package \undocumented
811924`This package \undocumented
811973`This package provides function for testing whether a divisor on a curve is a torsion divisor.
812188`\indented{1}{Utilities for PFOQ and PFO} Author: Manuel Bronstein Date Created: 25 Aug 1988 Date Last Updated: 11 Jul 1990
812351`This package provides function for testing whether a divisor on a curve is a torsion divisor.
812578`Package with the conversion functions among different kind of polynomials
812643`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 orderi
812643`--ng among the variables is controlled by an explicit list of variables which is passed as a second argument. The coefficient domain is allowed to be any gcd domain,{} but the groebner basis is computed as if the polynomials were over a field.
812697`This package provides a coerce from polynomials over algebraic numbers to \spadtype{Expression AlgebraicNumber}.
812752`This package provides a very general map function,{} which given a set \spad{S} and polynomials over \spad{R} with maps from the variables into \spad{S} and the coefficients into \spad{S},{} maps polynomials into \spad{S}. \spad{S} is assumed to support \spad{+},{} \spad{*} and \spad{**}.
812926`This package transforms multivariate polynomials or fractions into univariate polynomials or fractions,{} and back.
813095`This package \undocumented
813187`This package \undocumented
813284`\indented{1}{PolynomialFactorizationByRecursionUnivariate} \spad{R} is a \spadfun{PolynomialFactorizationExplicit} domain,{} \spad{S} is univariate polynomials over \spad{R} We are interested in handling SparseUnivariatePolynomials over \spad{S},{} is a variable we shall call \spad{z}
813429`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}.
813615`\indented{2}{This package takes a mapping between coefficient rings,{} and lifts} it to a mapping between polynomials over those rings.
813818`This package exports interpolation algorithms
813929`This package exports interpolation algorithms
814003`This package provides various polynomial number theoretic functions over the integers.
814066`computes \spad{n}-th roots of quotients of multivariate polynomials
814225`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.
814385`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.
814497`This package computes square-free decomposition of multivariate polynomials over a coefficient ring which is an arbitrary gcd domain. The requirement on the coefficient domain guarantees that the \spadfun{content} can be removed so that factors will be primitive as well as square-free. Over an infinite ring of finite characteristic,{}it may not be poss
814497`--ible to guarantee that the factors are square-free.
814651`This package is primarily to help the interpreter do coercions. It allows you to view a polynomial as a univariate polynomial in one of its variables with coefficients which are again a polynomial in all the other variables.
814732`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.
814851`\spadtype{PrecomputedAssociatedEquations} stores some generic precomputations which speed up the computations of the associated equations needed for factoring operators.
814982`\indented{1}{This package provides tools for operating on primitive arrays} with unary and binary functions involving different underlying types
815054`PrimitiveElement provides functions to compute primitive elements in algebraic extensions.
815119`\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}.}
815336`In-field solution of Riccati equations,{} primitive case.
815554`PrintPackage provides a print function for output forms.
815595`PseudoLinearNormalForm provides a function for computing a block-companion form for pseudo-linear operators.
815657`This package contains some functions: \axiomOpFrom{discriminant}{PseudoRemainderSequence},{} \axiomOpFrom{resultant}{PseudoRemainderSequence},{} \axiomOpFrom{subResultantGcd}{PseudoRemainderSequence},{} \axiomOpFrom{chainSubResultants}{PseudoRemainderSequence},{} \axiomOpFrom{degreeSubResultant}{PseudoRemainderSequence},{} \axiomOpFrom{lastSubResultant}{PseudoRemainderSequence},{} \axiomOpFrom{
815657`--resultantEuclidean}{PseudoRemainderSequence},{} \axiomOpFrom{subResultantGcdEuclidean}{PseudoRemainderSequence},{} \axiomOpFrom{\spad{semiSubResultantGcdEuclidean1}}{PseudoRemainderSequence},{} \axiomOpFrom{\spad{semiSubResultantGcdEuclidean2}}{PseudoRemainderSequence},{} etc. This procedures are coming from improvements of the subresultants algorithm. \indented{2}{Version : 7} \indented{2}{References : Lionel Ducos "Optimizations of the subresultant algorithm"} \indented{2}{to appear in the J
815657`--ournal of Pure and Applied Algebra.} \indented{2}{Author : Ducos Lionel \axiom{Lionel.Ducos@mathlabo.univ-poitiers.fr}}
815768`This package provides functions for integration,{} limited integration,{} extended integration and the risch differential equation for pure algebraic integrands.
815893`In-field solution of an linear ordinary differential equation,{} pure algebraic case.
816088`This package \undocumented{}
816243`\spadtype{QuasiAlgebraicSet2} adds a function \spadfun{radicalSimplify} which uses \spadtype{IdealDecompositionPackage} to simplify the representation of a quasi-algebraic set. A quasi-algebraic set is the intersection of a Zariski closed set,{} defined as the common zeros of a given list of polynomials (the defining polynomials for equations),{} and a principal Zariski open set,{} defined as the complement of the
816243`-- common zeros of a polynomial \spad{f} (the defining polynomial for the inequation). Quasi-algebraic sets are implemented in the domain \spadtype{QuasiAlgebraicSet},{} where two simplification routines are provided: \spadfun{idealSimplify} and \spadfun{simplify}. The function \spadfun{radicalSimplify} is added for comparison study only. Because the domain \spadtype{IdealDecompositionPackage} provides facilities for computing with radical ideals,{} it is necessary to restrict the ground ring to
816243`-- the domain \spadtype{Fraction Integer},{} and the polynomial ring to be of type \spadtype{DistributedMultivariatePolynomial}. The routine \spadfun{radicalSimplify} uses these to compute groebner basis of radical ideals and is inefficient and restricted when compared to the two in \spadtype{QuasiAlgebraicSet}.
816334`A package for removing redundant quasi-components and redundant branches when decomposing a variety by means of quasi-components of regular triangular sets. \newline References : \indented{1}{[1] \spad{D}. LAZARD "A new method for solving algebraic systems of} \indented{5}{positive dimension" Discr. App. Math. 33:1
816334`--47-160,{}1991} \indented{1}{[2] \spad{M}. MORENO MAZA "Calculs de pgcd au-dessus des tours} \indented{5}{d'extensions simples et resolution des systemes d'equations} \indented{5}{algebriques" These,{} Universite \spad{P}.etM. Curie,{} Paris,{} 1997.} \indented{1}{[3] \spad{M}. MORENO MAZA "A new algorithm for computing triangular} \indented{5}{decomposition of algebraic varieties" NAG Tech. Rep. 4/98.}
816526`\spadtype{QuaternionCategoryFunctions2} implements functions between two quaternion domains. The function \spadfun{map} is used by the system interpreter to coerce between quaternion types.
816678`This package extends a function between integral domains to a mapping between their quotient fields.
816835`Package for the computation of eigenvalues and eigenvectors. This package works for matrices with coefficients which are rational functions over the integers. (see \spadtype{Fraction Polynomial Integer}). The eigenvalues and eigenvectors are expressed in terms of radicals.
816881`This package tries to find solutions expressed in terms of radicals for systems of equations of rational functions with coefficients in an integral domain \spad{R}.
816960`This package provides tools for creating radix expansions.
817005`This package exports random distributions
817115`This package exports integer distributions
817171`Random number generators \indented{2}{All random numbers used in the system should originate from} \indented{2}{the same generator.\space{2}This package is intended to be the source.}
817313`\spadtype{RationalFunctionDefiniteIntegration} provides functions to compute definite integrals of rational functions.
817408`Factorization of univariate polynomials with coefficients which are rational functions with integer coefficients.
817523`\spadtype{RationalFunctionFactorizer} contains the factor function (called factorFraction) which factors fractions of polynomials by factoring the numerator and denominator. Since any non zero fraction is a unit the usual factor operation will just return the original fraction.
817599`This package provides functions for the integration of rational functions.
817682`Computation of limits for rational functions.
817753`Find the sign of a rational function around a point or infinity.
817815`Computes sums of rational functions.
817890`Utilities that provide the same top-level manipulations on fractions than on polynomials.
817949`This package provides functions for the base case of the Risch algorithm.
818056`This package exports rational interpolation algorithms
818128`\spad{RationalLODE} provides functions for in-field solutions of linear \indented{1}{ordinary differential equations,{} in the rational case.}
818228`rational number testing and retraction functions. Date Created: March 1990 Date Last Updated: 9 April 1991
818312`In-field solution of Riccati equations,{} rational case.
818415`\indented{1}{A package for computing the rational univariate representation} \indented{1}{of a zero-dimensional algebraic variety given by a regular} \indented{1}{triangular set. This package is essentially an interface for the} \spadtype{InternalRationalUnivariateRepresentationPackage} constructor. It is used in the \spadtype{ZeroDimensionalSolvePackage} for solving polynomial systems with fi
818415`--nitely many solutions.
818527`\axiomType{RealPolynomialUtilitiesPackage} provides common functions used by interval coding.
818667`\indented{1}{This package provides numerical solutions of systems of polynomial} equations for use in ACPLOT.
818715`\indented{2}{This package provides functions for finding the real zeros} of univariate polynomials over the rational numbers to arbitrary user-specified precision. The results are returned as a list of isolating intervals,{} expressed as records with "left" and "right" rational number components.
818813`\indented{2}{This package provides functions for finding the real zeros} of univariate polynomials over the integers to arbitrary user-specified precision. The results are returned as a list of isolating intervals which are expressed as records with "left" and "right" rational number components.
818899`\spadtype{RectangularMatrixCategoryFunctions2} provides functions between two matrix domains. The functions provided are \
818899`--spadfun{map} and \spadfun{reduce}.
819285`Elimination of an algebraic from the coefficentss of a linear ordinary differential equation.
819502`\indented{1}{Finds the order of a divisor over a finite field} Author: Manuel Bronstein Date Created: 1988 Date Last Updated: 8 November 1994
819709`\spadtype{ReductionOfOrder} provides functions for reducing the order of linear ordinary differential equations once some solutions are known.
819817`A package providing a new algorithm for solving polynomial systems by means of regular chains. Two ways of solving are proposed: in the sense of Zariski closure (like in Kalkbrener's algorithm) or in the sense of the regular zeros (like in Wu,{} Wang or Lazard methods). This algorithm is valid for nay type
819817`-- of regular set. It does not care about the way a polynomial is added in an regular set,{} or how two quasi-components are compared (by an inclusion-test),{} or how the invertibility test is made in the tower of simple extensions associated with a regular set. These operations are realized respectively by the domain \spad{TS} and the packages \axiomType{QCMPACK}(\spad{R},{}\spad{E},{}\spad{V},{}\spad{P},{}TS) and \axiomType{RSETGCD}(\spad{R},{}\spad{E},{}\spad{V},{}\spad{P},{}TS). The same way
819817`-- it does not care about the way univariate polynomial gcd (with coefficients in the tower of simple extensions associated with a regular set) are computed. The only requirement is that these gcd need to have invertible initials (normalized or not). WARNING. There is no need for a user to call diectly any operation of this package since they can be accessed by the domain \axiom{TS}. Thus,{} the operations of this package are not documented.\newline References : \indented{1}{[1] \spad{M}. MORENO
819817`-- MAZA "A new algorithm for computing triangular} \indented{5}{decomposition of algebraic varieties" NAG Tech. Rep. 4/98.}
820018`An internal package for computing gcds and resultants of univariate polynomials with coefficients in a tower of simple extensions of a field.\newline References : \indented{1}{[1] \spad{M}. MORENO MAZA and \spad{R}. RIOBOO "Computations of gcd over} \indented{5}{algebraic towers of simple extensions" In pr
820018`--oceedings of \spad{AAECC11}} \indented{5}{Paris,{} 1995.} \indented{1}{[2] \spad{M}. MORENO MAZA "Calculs de pgcd au-dessus des tours} \indented{5}{d'extensions simples et resolution des systemes d'equations} \indented{5}{algebriques" These,{} Universite \spad{P}.etM. Curie,{} Paris,{} 1997.} \indented{1}{[3] \spad{M}. MORENO MAZA "A new algorithm for computing triangular} \indented{5}{decomposition of algebraic varieties" NAG Tech. Rep. 4/98.}
820219`Implements multiplication by repeated addition
820288`Implements exponentiation by repeated squaring
820357`\spad{RepresentationPackage1} provides functions for representation theory for finite groups and algebras. The package creates permutation representations and uses tensor products and its symmetric and antisymmetric components to create new representations of larger degree from given ones. Note: instead of having parameters from \spadtype{Permutation} this package allows list notation of permutations as well: \spadignore{e.g.} \spad{[1,4,3,2]} den
820357`--otes permutes 2 and 4 and fixes 1 and 3.
820414`\spad{RepresentationPackage2} provides functions for working with modular representations of finite groups and algebra. The routines in this package are created,{} using ideas of \spad{R}. Parker,{} (the meat-Axe) to get smaller representations from bigger ones,{} \spadignore{i.e.} finding sub- and factormodules,{} or to show,{} that such the representations are irreducible. Note: most functions are randomized functions of Las Vegas type \spadigno
820414`--re{i.e.} every answer is correct,{} but with small probability the algorithm fails to get an answer.
820471`This package provides coercions for the special types \spadtype{Exit} and \spadtype{Void}.
820533`RetractSolvePackage is an interface to \spadtype{SystemSolvePackage} that attempts to retract the coefficients of the equations before solving.
820630`Factorization of univariate polynomials with coefficients in an algebraic extension of \spadtype{Fraction Polynomial Integer}.
820821`This package provides operations for mapping functions onto \spadtype{SegmentBinding}\spad{s}.
820893`This package provides operations for mapping functions onto segments.
820954`Factorization of univariate polynomials with coefficients in an algebraic extension of the rational numbers (\spadtype{Fraction Integer}).
821138`\indented{1}{Package to allow simplify to be called on AlgebraicNumbers} by converting to EXPR(INT)
821205`\spadtype{SmithNormalForm} is a package which provides some standard canonical forms for matrices.
821365`This package exports sorting algorithnms
821458`\indented{1}{Cache of elements in a set} Author: Manuel Bronstein Date Created: 31 Oct 1988 Date Last Updated: 14 May 1991 \indented{2}{A sorted cache of a cachable set \spad{S} is a dynamic structure that} \indented{2}{keeps the elements of \spad{S} sorted and assigns an integer to each} \indented{2}{element of \spad{S} once it is in the cache. This way,{} equality and ordering} \indented{2}{on \spad{S} are tested directly on the integers associate
821458`--d with the elements} \indented{2}{of \spad{S},{} once they have been entered in the cache.}
821513`\indented{1}{This package provides a simple Spad algebra parser.} Related Constructors: Syntax. See Also: Syntax.
821555`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.
821635`SpecialOutputPackage allows FORTRAN,{} Tex and \indented{2}{Script Formula Formatter output from programs.}
821686`\indented{2}{A internal package for removing redundant quasi-components and redundant} \indented{2}{branches when decomposing a variety by means of quasi-components} \indented{2}{of regular triangular sets. \newline} References : \indented{1}{[1] \spad{D}. LAZARD "A new method for solving algebraic system
821686`--s of} \indented{5}{positive dimension" Discr. App. Math. 33:147-160,{}1991} \indented{5}{Tech. Report (PoSSo project)} \indented{1}{[2] \spad{M}. MORENO MAZA "Calculs de pgcd au-dessus des tours} \indented{5}{d'extensions simples et resolution des systemes d'equations} \indented{5}{algebriques" These,{} Universite \spad{P}.etM. Curie,{} Paris,{} 1997.} \indented{1}{[3] \spad{M}. MORENO MAZA "A new algorithm for computing triangular} \indented{5}{decomposition of algebraic varieties" NAG Tech. 
821686`--Rep. 4/98.}
821888`A package providing a new algorithm for solving polynomial systems by means of regular chains. Two ways of solving are provided: in the sense of Zariski closure (like in Kalkbrener's algorithm) or in the sense of the regular zeros (like in Wu,{} Wang or Lazard- Moreno methods). This alg
821888`--orithm 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 g
821888`--cds (with coefficients in the tower of simple extensions associated with a regular set) are computed. The only requirement is that these gcds need to have invertible initials (normalized or not). WARNING. There is no need for a user to call diectly any operation of this package since they can be accessed by the domain \axiomType{TS}. Thus,{} the operations of this package are not documented.\newline References : \indented{1}{[1] \spad{M}. MORENO MAZA "A new algorithm for computing triangular} 
821888`--\indented{5}{decomposition of algebraic varieties" NAG Tech. Rep. 4/98.}
822109`A internal package for computing gcds and resultants of univariate polynomials with coefficients in a tower of simple extensions of a field. There is no need to use directly this package since its main operations are available from \spad{TS}. \newline References : \indented{1}{[1] \spad{M}. MORENO
822109`-- MAZA and \spad{R}. RIOBOO "Computations of gcd over} \indented{5}{algebraic towers of simple extensions" In proceedings of \spad{AAECC11}} \indented{5}{Paris,{} 1995.} \indented{1}{[2] \spad{M}. MORENO MAZA "Calculs de pgcd au-dessus des tours} \indented{5}{d'extensions simples et resolution des systemes d'equations} \indented{5}{algebriques" These,{} Universite \spad{P}.etM. Curie,{} Paris,{} 1997.} \indented{1}{[3] \spad{M}. MORENO MAZA "A new algorithm for computing triangular} \indented{5
822109`--}{decomposition of algebraic varieties" NAG Tech. Rep. 4/98.}
822319`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.
822389`Functions defined on streams with entries in one set.
822443`Functions defined on streams with entries in two sets.
822506`Functions defined on streams with entries in three sets.
822578`This package computes infinite products of Taylor series over an integral domain of characteristic 0. Here Taylor series are represented by streams of Taylor coefficients.
822661`StreamTaylorSeriesOperations implements Taylor series arithmetic,{} where a Taylor series is represented by a stream of its coefficients.
822728`StreamTranscendentalFunctionsNonCommutative implements transcendental functions on Taylor series over a non-commutative ring,{} where a Taylor series is represented by a stream of its coefficients.
822833`StreamTranscendentalFunctions implements transcendental functions on Taylor series,{} where a Taylor series is represented by a stream of its coefficients.
822922`StructuralConstantsPackage provides functions creating structural constants from a multiplication tables or a basis of a matrix algebra and other useful functions in this context.
822985`This package produces functions for counting etc. real roots of univariate polynomials in \spad{x} over \spad{R},{} which must be an OrderedIntegralDomain
823066`This package computes the subresultants of two polynomials which is needed for the `Lazard Rioboo' enhancement to Tragers integrations formula For efficiency reasons this has been rewritten to call Lionel Ducos package which is currently the best one. \blankline
823173`\indented{1}{SupFractionFactorize} contains the factor function for univariate polynomials over the quotient field of a ring \spad{S} such that the package MultivariateFactorize works for \spad{S}
823316`Computes all the symmetric functions in \spad{n} variables.
823372`SymmetricGroupCombinatoricFunctions contains combinatoric functions concerning symmetric groups and representation theory: list young tableaus,{} improper partitions,{} subsets bijection of Coleman.
823435`SystemODESolver provides tools for triangulating and solving some systems of linear ordinary differential equations.
823602`TableauBumpers implements the Schenstead-Knuth correspondence between sequences and pairs of Young tableaux. The 2 Young tableaux are represented as a single tableau with pairs as components.
823662`\axiom{TabulatedComputationPackage(Key ,{}Entry)} provides some modest support for dealing with operations with type \axiom{Key -> Entry}. The result of such operations can be stored and retrieved with this package by using a hash-table. The user does not need to worry about the management of this hash-table. However,{} onnly one hash-table is built by calling \axiom{TabulatedComputationPackage(Key ,{}Entry
823662`--)}.
823760`Expands tangents of sums and scalar products.
823815`This package provides functions for template manipulation
823862`\spadtype{TexFormat1} provides a utility coercion for changing to TeX format anything that has a coercion to the standard output format.
823914`Tools for the sign finding utilities.
823965`TopLevelDrawFunctionsForAlgebraicCurves provides top level functions for drawing non-singular algebraic curves.
824088`TopLevelDrawFunctionsForCompiledFunctions provides top level functions for drawing graphics of expressions.
824161`TopLevelDrawFunctionsForPoints provides top level functions for drawing curves and surfaces described by sets of points.
824221`TopLevelDrawFunctions provides top level functions for drawing graphics of expressions.
824308`This package exports a function for making a \spadtype{ThreeSpace}
824355`This package finds the function \spad{func3} where \spad{func1} and \spad{func2} \indented{1}{are given and\space{2}\spad{func1} = \spad{func3}(\spad{func2}) .\space{2}If there is no solution then} \indented{1}{function \spad{func1} will be returned.} \indented{1}{An example would be\space{2}\spad{func1:= 8*X**3+32*X**2-14*X ::EXPR INT} and} \indented{1}{\spad{func2:=2*X ::EXPR INT} convert them via univariate} \indented{1}{to FRAC
824355`-- SUP EXPR INT and then the solution is \spad{func3:=X**3+X**2-X}} \indented{1}{of type FRAC SUP EXPR INT}
824428`This package tries to find solutions of equations of type Expression(\spad{R}). This means expressions involving transcendental,{} exponential,{} logarithmic and nthRoot functions. After trying to transform different kernels to one kernel by applying several rules,{} it calls zerosOf for the SparseUnivariatePolynomial in the remaining kernel. For example the expression \spad{sin(x)*cos(x)-2} will be transformed to \indented{3}{
824428`--\spad{-2 tan(x/2)**4 -2 tan(x/2)**3 -4 tan(x/2)**2 +2 tan(x/2) -2}} by using the function normalize and then to \indented{3}{\spad{-2 tan(x)**2 + tan(x) -2}} with help of subsTan. This function tries to express the given function in terms of \spad{tan(x/2)} to express in terms of \spad{tan(x)} . Other examples are the expressions \spad{sqrt(x+1)+sqrt(x+7)+1} or \indented{1}{\spad{sqrt(sin(x))+1} .}
824505`Hermite integration,{} transcendental case.
824617`This package provides functions for the transcendental case of the Risch algorithm.
824719`TranscendentalManipulations provides functions to simplify and expand expressions involving transcendental operators.
824822`\indented{1}{Risch differential equation system,{} transcendental case.} Author: Manuel Bronstein Date Created: 17 August 1992 Date Last Updated: 3 February 1994
824937`\indented{1}{Risch differential equation,{} transcendental case.} Author: Manuel Bronstein Date Created: Jan 1988 Date Last Updated: 2 November 1995
825045`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},{} w
825045`--e return \spad{d} * inv(\spad{B}). Thus,{} it is not necessary to pass to the quotient field in any of our computations.
825216`\spadtype{TrigonometricManipulations} provides transformations from trigonometric functions to complex exponentials and logarithms,{} and back.
825337`Tools for constructing tubes around 3-dimensional parametric curves.
825382`\indented{1}{The purpose of this package is to provide reasonable plots of} functions with singularities.
825436`A basic package for the factorization of bivariate polynomials over a finite field. The functions here represent the base step for the multivariate factorizer.
825501`\spad{RUTSodetools} provides tools to interface with the series \indented{1}{ODE solver when presented with linear ODEs.}
825684`Package for the factorization of univariate polynomials with integer coefficients. The factorization is done by "lifting" (HENSEL) the factorization over a finite field.
825775`Mapping package for univariate Laurent series \indented{2}{This package allows one to apply a function to the coefficients of} \indented{2}{a univariate Laurent series.}
825936`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.
826099`UnivariatePolynomialCommonDenominator provides functions to compute the common denominator of the coefficients of univariate polynomials over the quotient field of a gcd domain.
826252`UnivariatePolynomialDecompositionPackage implements functional decomposition of univariate polynomial with coefficients in an \spad{IntegralDomain} of \spad{CharacteristicZero}.
826391`UnivariatePolynomialDivisionPackage provides a division for non monic univarite polynomials with coefficients in an \spad{IntegralDomain}.
826513`This package lifts a mapping from coefficient rings \spad{R} to \spad{S} to a mapping from \spadtype{UnivariatePolynomial}(\spad{x},{}\spad{R}) to \spadtype{UnivariatePolynomial}(\spad{y},{}\spad{S}). Note that the mapping is assumed to send zero to zero,{} since it will only be applied to the non-zero coefficients of the polynomial.
826608`This package implements Karatsuba's trick for multiplying (large) univariate polynomials. It could be improved with a version doing the work on place and also with a special case for squares. We've done this in Basicmath,{} but we believe that this out of the scope of AXIOM.
826722`This package provides for square-free decomposition of univariate polynomials over arbitrary rings,{} \spadignore{i.e.} a partial factorization such that each factor is a product of irreducibles with multiplicity one and the factors are pairwise relatively prime. If the ring has characteristic zero,{} the result is guaranteed to satisfy this condition. If the ring is an infin
826722`--ite ring of finite characteristic,{} then it may not be possible to decide when polynomials contain factors which are \spad{p}th powers. In this case,{} the flag associated with that polynomial is set to "nil" (meaning that that polynomials are not guaranteed to be square-free).
826852`Mapping package for univariate Puiseux series. This package allows one to apply a function to the coefficients of a univariate Puiseux series.
827014`\spad{UnivariateSkewPolynomialCategoryOps} provides products and \indented{1}{divisions of univariate skew polynomials.}
827129`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.}
827319`\indented{1}{This package provides Taylor series solutions to regular} linear or non-linear ordinary differential equations of arbitrary order.
827462`This package provides operations for mapping functions onto segments.
827535`Provides functions to force a partial ordering on any set.
827603`This packages provides functions to allow the user to select the ordering on the variables and operators for displaying polynomials,{} fractions and expressions. The ordering affects the display only and not the computations.
827658`\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}.
827721`ViewportDefaultsPackage describes default and user definable values for graphics
827771`ViewportPackage provides functions for creating GraphImages and TwoDimensionalViewports from lists of lists of points.
827814`This package implements the Weierstrass preparation theorem \spad{f} or multivariate power series. weierstrass(\spad{v},{}\spad{p}) where \spad{v} is a variable,{} and \spad{p} is a TaylorSeries(\spad{R}) in which the terms of lowest degree \spad{s} must include c*v**s where \spad{c} is a constant,{}\spad{s>0},{} is a list of TaylorSeries coefficients A[\spad{i}] of the equivalent polynomial A = A[0] + A[1]*v + A[2]\spad{*v**2} + ... + A[\spad{s
827814`--}-1]*v**(\spad{s}-1) + v**s such that p=A*B ,{} \spad{B} being a TaylorSeries of minimum degree 0
827873`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
827873`-- a specific prime.
828055`This package provides computations of logarithms and exponentials for polynomials in non-commutative variables. \newline Author: Michel Petitot (petitot@lifl.fr).
828187`A package for computing symbolically the complex and real roots of zero-dimensional algebraic systems over the integer or rational numbers. Complex roots are given by means of univariate representations of irreducible regular chains. Real roots are given by means of tuples of coordinates lying in the \spadtype{RealClosure} of the coefficient ring. This constructor takes three argumen
828187`--ts. The first one \spad{R} is the coefficient ring. The second one \spad{ls} is the list of variables involved in the systems to solve. The third one must be \spad{concat(ls,s)} where \spad{s} is an additional symbol used for the univariate representations. WARNING: The third argument is not checked. All operations are based on triangular decompositions. The default is to compute these decompositions directly from the input system by using the \spadtype{RegularChain} domain constructor. The le
828187`--xTriangular algorithm can also be used for computing these decompositions (see the \spadtype{LexTriangularPackage} package constructor). For that purpose,{} the operations \axiomOpFrom{univariateSolve}{ZeroDimensionalSolvePackage},{} \axiomOpFrom{realSolve}{ZeroDimensionalSolvePackage} and \axiomOpFrom{positiveSolve}{ZeroDimensionalSolvePackage} admit an optional argument. \newline Author: Marc Moreno Maza.
828309`\axiomType{d01AgentsPackage} is a package of numerical agents to be used to investigate attributes of an input function so as to decide the \axiomFun{measure} of an appropriate numerical integration routine. It contains functions \axiomFun{rangeIsFinite} to test the input range and \axiomFun{functionIsContinuousAtEndPoints} to check for continuity at the end points of the range.
828356`\axiom{d01WeightsPackage} is a package for functions used to investigate whether a function can be divided into a simpler function and a weight function. The types of weights investigated are those giving rise to end-point singularities of the algebraico-logarithmic type,{} and trigonometric weights.
828404`\axiom{d02AgentsPackage} contains a set of computational agents for use with Ordinary Differential Equation solvers.
828533`The class of abelian groups,{} \spadignore{i.e.} additive monoids where each element has an additive inverse. \blankline
828593`The class of multiplicative monoids,{} \spadignore{i.e.} semigroups with an additive identity element. \blankline
828655`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} f
828655`--or 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.
828760`the class of all additive (commutative) semigroups,{} \spadignore{i.e.} a set with a commutative and associative operation \spadop{+}. \blankline
828827`This is the category of Spad abstract syntax trees.
828906`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 th
828906`--at a domain has a finite number of elements.
828956`The category of associative algebras (modules which are themselves rings). \blankline
829029`Model for algebraically closed fields.
829109`Model for algebraically closed function spaces.
829226`Category for the inverse trigonometric functions.
829324`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.
829394`\spadtype{BasicType} is the basic category for describing a collection of elements with \spadop{=} (equality).
829448`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
829542`\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.
829631`The bit aggregate category models aggregates representing large quantities of Boolean data.
829689`This is the category of Boolean logic structures.
829747`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.
829813`This category represents the extension of a ring by a square root of \spad{-1}.
829902`This category declares basic operations on all constructors.
829976`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.
830049`This category is a collection of operations common to both categories \spadtype{Dictionary} and \spadtype{MultiDictionary}
830142`This category captures the interface of domains with a distinguished operation named \spad{differentiate}. Usually,{} additional properties are wanted. For example,{} that it obeys the usual Leibniz identity of differentiation of product,{} in case of differential rings. One could also want \spad{differentiate} to obey the chain rule when considering differential manifolds. The lack of specific requirement in this catego
830142`--ry is an implicit admission that currently \Language{} is not expressive enough to express the most general notion of differentiation in an adequate manner,{} suitable for computational purposes.
830226`\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 e
830226`--xtended 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{ev
830226`--al}. 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
830419`This category is like \spadtype{DifferentialDomain} where the target of the differentiation operator is the same as its source.
830489`Extension of a base differential space with a derivation. \blankline
830587`\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''},{}...
830587`--,{} \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 
830587`--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 exa
830587`--mple,{} 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 d
830587`--ifferential 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.
830697`\indented{2}{This category represents a finite cartesian product of a given type.} Many categorical properties are preserved under this construction.
830814`A division ring (sometimes called a skew field),{} \spadignore{i.e.} a not necessarily commutative ring where all non-zero elements have multiplicative inverses.
830874`Category for the elementary functions.
830962`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}.
831068`A constructive euclidean domain,{} \spadignore{i.e.} one can divide producing a quotient and a remainder where the remainder is either zero or is smaller (\spadfun{euclideanSize}) than the divisor. \blankline Conditional attributes: \indented{2}{multiplicativeValuation\tab{25}\spad{Size(a*b)=Size(a)*Size(b)}} \indented{2}{additiveValuation\tab{25}\spad{Size(a*b)=Size(a)+Size(b)}}
831133`This category provides \spadfun{eval} operations. A domain may belong to this category if it is possible to make ``evaluation'' substitutions.
831203`An expression space is a set which is closed under certain operators.
831264`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.
831360`ExtensionField {\em F} is the category of fields which extend the field \spad{F}
831430`The category of commutative fields,{} \spadignore{i.e.} commutative rings where all non-zero elements have multiplicative inverses. The \spadfun{factor} operation while trivial is useful to have defined. \blankline
831474`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.
831558`This category is similar to AbelianMonoidRing,{} except that the sum is assumed to be finite. It is a useful model for polynomials,{} but is somewhat more general.
831676`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
831676`-- 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{linearAssociatedE
831676`--xp}(a,{}\spad{g}). Therefore \spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\em F[X]}: \spadfun{linearAssociatedExp}(a,{}monomial(1,{}\spad{k})\$SUP(\spad{F})) is defined to be \spadfun{Frobenius}(a,{}\spad{k}) which is {\em a**(q**k)} where {\em q=size()\$F}. The operations order and discreteLog associated with the multiplicative exponentiation have additive analogues associated to the operation \spadfun{linearAssociatedExp}. These are the functions \spad
831676`--fun{linearAssociatedOrder} and \spadfun{linearAssociatedLog},{} respectively.
831780`This category describes finite rational divisors on a curve,{} that is finite formal sums SUM(\spad{n} * \spad{P}) where the \spad{n}'s are integers and the \spad{P}'s are finite rational points on the curve.
832009`FiniteFieldCategory is the category of finite fields
832083`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.
832171`A FiniteRankAlgebra is an algebra over a commutative ring \spad{R} which is a free \spad{R}-module of finite rank.
832305`A FiniteRankNonAssociativeAlgebra is a non associative algebra over a commutative ring \spad{R} which is a free \spad{R}-module of finite rank.
832426`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.
832515`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
832515`--}{(actual implemenations are usually binary or decimal)} \indented{2}{2: \spadfunFrom{precision}{FloatingPointSystem} of the \spadfunFrom{mantissa}{FloatingPointSystem} (arbitrary or fixed)} \indented{2}{3: rounding error for operations} \blankline Because a Float is an approximation to the real numbers,{} even though it is defined to be a join of a Field and OrderedRing,{} some of the attributes do not hold. In particular associative("+") does not hold. Algorithms defined over a field need sp
832515`--ecial considerations when the field is a floating point system.
832585`A \spadtype{FramedAlgebra} is a \spadtype{FiniteRankAlgebra} together with a fixed \spad{R}-module basis.
832711`FramedNonAssociativeAlgebra(\spad{R}) is a \spadtype{FiniteRankNonAssociativeAlgebra} (\spadignore{i.e.} a non associative algebra over \spad{R} which is a free \spad{R}-module of finite rank) over a commutative ring \spad{R} together with a fixed \spad{R}-module basis.
832824`This category provides a selection of evaluation operations depending on what the argument type \spad{R} provides.
832913`\spad{S} is \spadtype{FullyLinearlyExplicitRingOver R} means that \spad{S} is a \spadtype{LinearlyExplicitRingOver R} and,{} in addition,{} if \spad{R} is a \spadtype{LinearlyExplicitRingOver Integer},{} then so is \spad{S}
833019`\indented{2}{A is fully retractable to \spad{B} means that A is retractable to \spad{B},{} and,{}} \indented{2}{in addition,{} if \spad{B} is retractable to the integers or rational} \indented{2}{numbers then so is A.} \indented{2}{In particular,{} what we are asserting is that there are no integers} \indented{2}{(rationals) in A which don't retract into \spad{B}.} Date Created: March 1990 Date Last Updated: 9 April 1991
833103`This category is a model for the function field of a plane algebraic curve.
833311`A space of formal functions with arguments in an arbitrary ordered set.
833387`This category describes domains where \spadfun{gcd} can be computed but where there is no guarantee of the existence of \spadfun{factor} operation for factorisation into irreducibles. However,{} if such a \spadfun{factor} operation exist,{} factorization will be unique up to order and units.
833440`GradedAlgebra(\spad{R},{}\spad{E}) denotes ``E-graded \spad{R}-algebra''. A graded algebra is a graded module together with a degree preserving \spad{R}-linear map,{} called the {\em product}. \blankline The name ``product'' is written out in full so inner and outer products with the same mapping type can be distinguished by name.
833543`GradedModule(\spad{R},{}\spad{E}) denotes ``E-graded \spad{R}-module'',{} \spadignore{i.e.} collection of \spad{R}-modules indexed by an abelian monoid \spad{E}. An element \spad{g} of \spad{G[s]} for some specific \spad{s} in \spad{E} is said to be an element of \spad{G} with {\em degree} \spad{s}. Sums are defined in each module \spad{G[s]} so two elements of \spad{G} have a sum if they have the same deg
833543`--ree. \blankline Morphisms can be defined and composed by degree to give the mathematical category of graded modules.
833642`The class of multiplicative groups,{} \spadignore{i.e.} monoids with multiplicative inverses. \blankline
833686`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.
833772`Category for the hyperbolic trigonometric functions.
833859`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.
833979`This category provides \spadfun{eval} operations. A domain may belong to this category if it is possible to make ``evaluation'' substitutions. The difference between this and \spadtype{Evalable} is that the operations in this category specify the substitution as a pair of arguments rather than as an equation.
834071`This category describes input byte stream conduits.
834138`An \spad{IntegerNumberSystem} is a model for the integers.
834208`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}
834271`A keyed dictionary is a dictionary of key-entry pairs for which there is a unique entry for each key.
834390`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.
834476`The category of all left algebras over an arbitrary ring.
834543`\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.
834621`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 
834621`--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}.
834697`\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}}
834827`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.
834899``Logic' provides the basic operations for lattices,{} \spadignore{e.g.} boolean algebra.
834943`\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 
834943`--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.
835092`The category of modules over a commutative ring. \blankline
835162`Monad is the class of all multiplicative monads,{} \spadignore{i.e.} sets with a binary operation.
835206`\indented{1}{MonadWithUnit is the class of multiplicative monads with unit,{}} \indented{1}{\spadignore{i.e.} sets with a binary operation and a unit element.} Axioms \indented{3}{leftIdentity("*":(\%,{}\%)->\%,{}1)\space{3}\tab{30} 1*x=x} \indented{3}{rightIdentity("*":(\%,{}\%)->\%,{}1)\space{2}\tab{30} x*1=x} Common Additional Axioms \indented{3}{unitsKnown
835206`---if "recip" says "failed",{} that PROVES input wasn't a unit}
835268`A \spadtype{MonogenicAlgebra} is an algebra of finite rank which can be generated by a single element.
835400`The class of multiplicative monoids,{} \spadignore{i.e.} semigroups with a multiplicative identity element. \blankline
835447`NonAssociativeAlgebra is the category of non associative algebras (modules which are themselves non associative rngs). Axioms \indented{3}{r*(a*b) = (r*a)*b = a*(r*b)}
835544`A NonAssociativeRing is a non associative rng which has a unit,{} the multiplication is not necessarily commutative or associative.
835616`NonAssociativeRng is a basic ring-type structure,{} not necessarily commutative or associative,{} and not necessarily with unit. Axioms \indented{2}{x*(y+z) = x*y + x*z} \indented{2}{(x+y)*z = x*z + y*z} Common Additional Axioms \indented{2}{noZeroDivisors\space{2}ab = 0 => \spad{a=0} or \spad{b=0}}
835684`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.
835770`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 gro
835770`--w 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.
835872`This category specifies the interface for operators used to build terms,{} in the sense of Universal Algebra. The domain parameter \spad{S} provides representation for the `external name' of an operator.
835959`Ordered sets which are also abelian groups,{} such that the addition preserves the ordering.
836033`Ordered sets which are also abelian monoids,{} such that the addition preserves the ordering.
836107`Category of types equipped with a total ordering.
836165`This category describes output byte stream conduits.
836235`\indented{2}{This category captures the interface of domains with a distinguished} \indented{2}{operation named \spad{differentiate} for partial differentiation with} \indented{2}{respect to some domain of variables.} See Also: \indented{2}{DifferentialDomain,{} PartialDifferentialSpace}
836342`\indented{2}{This category captures the interface of domains stable by partial} \indented{2}{differentiation with respect to variables from some domain.} See Also: \indented{2}{PartialDifferentialDomain}
836443`The category for general multi-variate polynomials over a ring \spad{R},{} in variables from VarSet,{} with exponents from the \spadtype{OrderedAbelianMonoidSup}.
836589`This is the category of domains that know "enough" about themselves in order to factor univariate polynomials over themselves. This will be used in future releases for supporting factorization over finitely generated coefficient fields,{} it is not yet available in the current release of axiom.
836686`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 representa
836686`--tion 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.
836884`\spadtype{PowerSeriesCategory} is the most general power series category with exponents in an ordered abelian monoid.
837039`\spadtype{QuaternionCategory} describes the category of quaternions and implements functions that are not representation specific.
837134`QuotientField(\spad{S}) is the category of fractions of an Integral Domain \spad{S}.
837232`The \spad{RadicalCategory} is a model for the rational numbers.
837297`\axiomType{RealClosedField} provides common acces functions for all real closed fields.
837363`The real number system category is intended as a model for the real numbers. The real numbers form an ordered normed field. Note that we have purposely not included \spadtype{DifferentialRing} or the elementary functions (see \spadtype{TranscendentalFunctionCategory}) in the definition.
837427`\axiomType{RealRootCharacterizationCategory} provides common acces functions for all real root codings.
837637`\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.
837863`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 infini
837863`--te loop.
837945`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 
837945`--the ordered set,{} so that some operations usually defined for univariate polynomials make sense here.
838094`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 polyno
838094`--mial ring \spad{k[x1,...,xn]} where \spad{k} is the fraction field of \spad{R}. The triangular set \spad{[t1,...,tm]} is regular iff for every \spad{i} the initial of \spad{ti+1} is invertible in the tower of simple extensions associated with \spad{[t1,...,ti]}. A family \spad{[T1,...,Ts]} of regular triangular sets is a split of Kalkbrener of a given ideal \spad{I} iff the radical of \spad{I} is equal to the intersection of the radical ideals generated by the saturated ideals of the \spad{[T1
838094`--,...,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 triangu
838094`--lar sets is a split of Lazard of a given subset \spad{S} of \spad{A} iff the union of the \spad{W(Ti)} contains \spad{S} and is contained in the closure of \spad{S} (\spad{w}.\spad{r}.\spad{t}. Zariski topology). A family \spad{[T1,...,Ts]} of regular triangular sets is a split of Lazard of a given triangular set \spad{T} if it is a split of Lazard of \spad{W(T)}. Note that if \spad{[T1,...,Ts]} is a split of Lazard of \spad{T} then it is also a split of Kalkbrener of \spad{T}. The converse is
838094`-- \spad{false}. This category provides operations related to both kinds of splits,{} the former being related to ideals decomposition whereas the latter deals with varieties decomposition. See the example illustrating the \spadtype{RegularTriangularSet} constructor for more explanations about decompositions by means of regular triangular sets. \newline References : \indented{1}{[1] \spad{M}. KALKBRENER "Three contributions to elimination theory"} \indented{5}{Phd Thesis,{} University of Linz,{}
838094`-- 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.}
838291`A is retractable to \spad{B} means that some elementsif A can be converted into elements of \spad{B} and any element of \spad{B} can be converted into an element of A.
838365`The category of rings with unity,{} always associative,{} but not necessarily commutative.
838406`the class of all multiplicative semigroups,{} \spadignore{i.e.} a set with an associative operation \spadop{*}. \blankline
838459`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.
838537`\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{=}}
838594`\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.
838800`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}.
838876`A string aggregate is a category for strings,{} that is,{} one dimensional arrays of characters.
838940`A table aggregate is a model of a table,{} \spadignore{i.e.} a discrete many-to-one mapping from keys to entries.
839057`Category for the transcendental elementary functions.
839153`The category of triangular sets of multivariate polynomials with coefficients in an integral domain. Let \axiom{\spad{R}} be an integral domain and \axiom{\spad{V}} a finite ordered set of variables,{} say \axiom{\spad{X1} < \spad{X2} < ... < Xn}. A set \axiom{\spad{S}} of polynomials in \axiom{\spad{R}[\spad{X1},{}\sp
839153`--ad{X2},{}...,{}Xn]} is triangular if no elements of \axiom{\spad{S}} lies in \axiom{\spad{R}},{} and if two distinct elements of \axiom{\spad{S}} have distinct main variables. Note that the empty set is a triangular set. A triangular set is not necessarily a (lexicographical) Groebner basis and the notion of reduction related to triangular sets is based on the recursive view of polynomials. We recall this notion here and refer to [1] for more details. A polynomial \axiom{\spad{P}} is reduced \
839153`--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} 
839153`--\indented{5}{of Triangular Sets" Journal of Symbol. Comp. (to appear)}
839341`Category for the trigonometric functions.
839435`\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 'minRowInde
839435`--x'. 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.
839611`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 chil
839611`--d then designates the empty list. Since these aggregates are recursive aggregates,{} they may be cyclic.
839703`A constructive unique factorization domain,{} \spadignore{i.e.} where we can constructively factor members into a product of a finite number of irreducible elements.
839785`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)}.
839975`The category of univariate polynomials over a ring \spad{R}. No particular model is assumed - implementations can be either sparse or dense.
840078`\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.
840231`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)}.
840422`This is the category of univariate skew polynomials over an Ore coefficient ring. The multiplication is given by \spad{x a = \sigma(a) x + \delta a}. This category is an evolution of the types \indented{2}{MonogenicLinearOperator,{} OppositeMonogenicLinearOperator,{} and} \indented{2}{NonCommutativeOperatorDivision} developped by Jean Della Dora and Stephen \spad{M}. Watt.
840534`\spadtype{UnivariateTaylorSeriesCategory} is the category of Taylor series in one variable.
840650`\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.
840726`Vector Spaces (not necessarily finite dimensional) over a field.
