0`
0`The class of abelian groups,{} \spadignore{i.e.} additive monoids where each element has an additive inverse. \blankline
42`The class of additive (commutative) monoids,{} \spadignore{i.e.} semigroups with an additive identity element. \blankline
87`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 coefficients and the e_i,{} elements of the ordered abelian monoid,{} are thought of as exponents or monomials. The monomials commute with each other,{} but in general do not commute with the coefficients (which themselves may or may not be commutative). See \spadtype{FiniteAbelianMonoidRing} for the case of finite support. A useful common model for polynomials and power series. Conceptually at least,{} only the non-zero terms are ever operated on.
175`This category represents products with coordinatewise additive operations.
235`the class of all additive (commutative) semigroups,{} \spadignore{i.e.} a set with a commutative and associative operation \spadop{+}. \blankline
282`The class of all euclidean domains such that \spad{euclideanSize(a*b)=euclideanSize(a)+euclideanSize(b)}.
332`The notion of aggregate serves to model any data structure aggregate,{} designating any collection of objects,{} with heterogeneous 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 \spadtype{finiteAggregate} is used to assert that a domain has a finite number of elements.
370`The category of associative algebras (modules which are themselves rings). \blankline
428`Model for algebraically closed fields.
481`Model for algebraically closed function spaces.
566`An approximation to the real numbers.
610`Approximate numbers with arbitrarily large exponents
660`Approximate numbers for which the user can set the precision for subsequent calculations.
711`Category for the inverse hyperbolic trigonometric functions.
770`Category for the inverse trigonometric functions.
833`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.
915`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.
965`\spadtype{BasicType} is the basic category for describing a collection of elements with \spadop{=} (equality).
1007`A bialgebra is a coalgebra which at the same time is an algebra such that the comultiplication is also an algebra homomorphism. MxM: Module(\spad{R}) should be replaced by a more restricted category,{} but it is not clear at this point which one.
1081`Complete partial Order,{} partial order that is guaranteed to have both a join and a meet of any two elements. For more documentation see: \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
1131`A \spadtype{BiModule} is both a left and right module with respect to potentially different rings. \blankline
1192`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
1254`\spadtype{BinaryTreeCategory(S)} is the category of binary trees: a tree which is either empty or has a \spadfun{node} consisting of a value and a \spadfun{left} and \spadfun{right} which are both binary trees.
1317`The bit aggregate category models aggregates representing large quantities of Boolean data.
1360`not every lattice is distributive so treat this \indented{13}{as a separate case} \indented{2}{for more documentation see:} \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
1418`join semilattice with bottom \indented{2}{Different from exterior Grassmann product operator as} \indented{2}{that anticommutes.} \indented{2}{need to check precedence when used as an infix operator} \indented{2}{for more documentation see:} \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
1471`lattice with top and bottom \indented{2}{for more documentation see:} \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
1515`meet semilattice with top \indented{2}{Implementations in set,{} logic and orders} \indented{2}{for more documentation see:} \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
1568`A cachable set is a set whose elements keep an integer as part of their structure.
1612`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
1669`The class of all domains which have canonical representation,{} that is if mathematically equal elements have the same data structures.
1711`The class of all integral domains such that \spad{unitCanonical(a)*unitCanonical(b) = unitCanonical(a*b)}.
1760`The class of all integral domains such that 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)}.
1812`Rings of Characteristic Non Zero
1865`Rings of Characteristic Zero.
1914`A coalgebra A over a ring is an \spad{R}-module with a coassociative comultiplication from A to the tensor product of A with itself and which possesses a counit.
1988`Directed-complete Order,{} partial order that is guaranteed to have a meet of any two elements. For more documentation see: \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
2040`A is coercible to \spad{B} means any element of A can automatically be converted into an element of \spad{B} by the interpreter.
2093`A is coercible to \spad{B} means any element of A can automatically be converted into an element of \spad{B} by the interpreter.
2143`A collection is a homogeneous aggregate which can be built from a 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.
2191`Category for the usual combinatorial functions.
2251`CombinatorialOpsCategory is the category obtaining by adjoining summations and products to the usual combinatorial operations.
2308`The category of commutative rings with unity,{} \spadignore{i.e.} rings where \spadop{*} is commutative,{} and which have a multiplicative identity. element.
2356`The class of all commutative semigroups in multiplicative notation. In other words domains \spad{D} with \spad{"*": (D,{} D) -> D} which is commutative. Typically applied to rings.
2401`The class of sets equipped with possibly unnatural linear order (needed for technical reasons).
2443`This category represents the extension of a ring by a square root of \spad{-1}.
2509`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.
2564`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.
2617`Directed-complete partial order,{} partial order that is guaranteed to have a join of any two elements. For more documentation see: \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
2665`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.
2719`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.
2767`This category is a collection of operations common to both categories \spadtype{Dictionary} and \spadtype{MultiDictionary}
2825`Differential extensions of a ring \spad{R}. Given a differentiation on \spad{R},{} extend it to a differentiation on \%.
2885`\spadtype{DifferentialPolynomialCategory} is a category constructor specifying basic functions in an ordinary differential polynomial ring with a given ordered set of differential indeterminates. In addition,{} it implements defaults for the basic functions. The functions \spadfun{order} and \spadfun{weight} are extended from the set of derivatives of differential indeterminates to the set of differential polynomials. Other operations provided on differential polynomials are \spadfun{leader},{} \spadfun{initial},{} \spadfun{separant},{} \spadfun{differentialVariables},{} and \spadfun{isobaric?}. Furthermore,{} if the ground ring is a differential ring,{} then evaluation (substitution of differential indeterminates by elements of the ground ring or by differential polynomials) is provided by \spadfun{eval}. A convenient way of referencing derivatives is provided by the functions \spadfun{makeVariable}. \blankline To construct a domain using this constructor,{} one needs to provide a ground ring \spad{R},{} an ordered set \spad{S} of differential indeterminates,{} a ranking \spad{V} on the set of derivatives of the differential indeterminates,{} and a set \spad{E} of exponents in bijection with the set of differential monomials in the given differential indeterminates. \blankline
3030`An ordinary differential ring,{} that is,{} a ring with an operation \spadfun{differentiate}. \blankline
3080`\spadtype{DifferentialVariableCategory} constructs the set of derivatives of a given set of (ordinary) differential indeterminates. If \spad{x},{} ...,{} \spad{y} is an ordered set of differential indeterminates,{} and the prime notation is used for differentiation,{} then the set of derivatives (including zero-th order) of the differential indeterminates is \spad{x},{} \spad{x'},{} \spad{x''},{} ...,{} \spad{y},{} \spad{y'},{} \spad{y''},{} ... (Note: in the interpreter,{} the \spad{n}-th derivative of \spad{y} is displayed as \spad{y} with a subscript \spad{n}.) This set is viewed as a set of algebraic indeterminates,{} totally ordered in a way compatible with differentiation and the given order on the differential indeterminates. Such a total order is called a ranking of the differential indeterminates. \blankline A domain in this category is needed to construct a differential polynomial domain. Differential polynomials are ordered by a ranking on the derivatives,{} and by an order (extending the ranking) on on the set of differential monomials. One may thus associate a domain in this category with a ranking of the differential indeterminates,{} just as one associates a domain in the category \spadtype{OrderedAbelianMonoidSup} with an ordering of the set of monomials in a set of algebraic indeterminates. The ranking is specified through the binary relation \spadfun{<}. For example,{} one may define one derivative to be less than another by lexicographically comparing first the \spadfun{order},{} then the given order of the differential indeterminates appearing in the derivatives. This is the default implementation. \blankline The notion of weight generalizes that of degree. A polynomial domain may be made into a graded ring if a weight function is given on the set of indeterminates,{} Very often,{} a grading is the first step in ordering the set of monomials. For differential polynomial domains,{} this constructor provides a function \spadfun{weight},{} which allows the assignment of a non-negative number to each derivative of a differential indeterminate. For example,{} one may define the weight of a derivative to be simply its \spadfun{order} (this is the default assignment). This weight function can then be extended to the set of all differential polynomials,{} providing a graded ring structure.
3155`\indented{2}{This category represents a finite cartesian product of a given type.} Many categorical properties are preserved under this construction.
3240`Category of distributions formally given by moments.
3312`not every lattice is distributive so treat this \indented{13}{as a separate case} \indented{2}{for more documentation see:} \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
3365`A division ring (sometimes called a skew field),{} \spadignore{i.e.} a not necessarily commutative ring where all non-zero elements have multiplicative inverses.
3411`A doubly-linked aggregate serves as a model for a doubly-linked list,{} that is,{} a list which has links to both next and previous nodes and thus can be efficiently traversed in both directions.
3471`Category for the elementary functions.
3531`An eltable over domains \spad{D} and \spad{I} is a structure which can be viewed as a function from \spad{D} to \spad{I}. Examples of eltable structures range from data structures,{} \spadignore{e.g.} those of type \spadtype{List},{} to algebraic structures,{} \spadignore{e.g.} \spadtype{Polynomial}.
3584`An eltable aggregate is one which can be viewed as a function. For example,{} the list \spad{[1,{} 7,{} 4]} can be applied to 1,{} 2,{} and 3 respectively and will return the integers 1,{} 7,{} and 4; thus this list may be viewed as mapping 1 to 1,{} 2 to 7 and 3 to 4. In general,{} an aggregate can map members of a domain {\em Dom} to an image domain {\em Im}.
3650`Entire Rings (non-commutative Integral Domains),{} \spadignore{i.e.} a ring not necessarily commutative which has no zero divisors. \blankline
3694`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)}}
3742`This category provides \spadfun{eval} operations. A domain may belong to this category if it is possible to make ``evaluation\spad{''} substitutions.
3837`An expression space is a set which is closed under certain operators.
3904`An extensible aggregate is one which allows insertion and deletion of entries. These aggregates are models of lists 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.
3968`ExtensionField {\em F} is the category of fields which extend the field \spad{F}
4019`This is a category to represent different types of facet,{} such as,{} (1) A single simplex (2) A single cubical simplex (3) The product of two facets \blankline
4066`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
4103`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.
4159`This category provides an interface to operate on files in the computer\spad{'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}.
4236`This category provides an interface to names in the file system.
4284`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
4323`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.
4420`The class of all aggregates with a finite number of elements.
4469`FiniteAlgebraicExtensionField {\em F} is the category of fields which are finite algebraic extensions of the field {\em F}. If {\em F} is finite then any finite algebraic extension of {\em F} is finite,{} too. Let {\em K} be a finite algebraic extension of the finite field {\em F}. The exponentiation of elements of {\em K} defines a \spad{Z}-module structure on the multiplicative group of {\em K}. The additive group of {\em K} becomes a module over the ring of polynomials over {\em F} via the operation \spadfun{linearAssociatedExp}(a: \spad{K},{} \spad{f:} SparseUnivariatePolynomial \spad{F}) which is linear over {\em F},{} \spadignore{i.e.} for elements {\em a} from {\em K},{} {\em c,{} d} from {\em F} and {\em f,{} g} univariate polynomials over {\em F} we have \spadfun{linearAssociatedExp}(a,{} cf+dg) equals {\em c} times \spadfun{linearAssociatedExp}(a,{} \spad{f}) plus {\em d} times \spadfun{linearAssociatedExp}(a,{} \spad{g}). Therefore \spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\em F[X]}: \spadfun{linearAssociatedExp}(a,{} monomial(1,{} \spad{k})\spad{\$}SUP(\spad{F})) is defined to be \spadfun{Frobenius}(a,{} \spad{k}) which is {\em a^(q^k)} where {\em q=size()\$F}. The operations order and discreteLog associated with the multiplicative exponentiation have additive analogues associated to the operation \spadfun{linearAssociatedExp}. These are the functions \spadfun{linearAssociatedOrder} and \spadfun{linearAssociatedLog},{} respectively.
4537`This category describes finite rational divisors on a curve,{} that is finite formal sums SUM(\spad{n} * \spad{P}) where the \spad{n}\spad{'s} are integers and the \spad{P}\spad{'s} are finite rational points on the curve.
4728`FiniteFieldCategory is the category of finite fields
4781`Category of finite graphs,{} allows us to model graph theory \blankline
4838`The category of finite groups.
4882`A finite linear aggregate is a linear aggregate of finite length.
4942`A category for finitely generated structures. Exports a list of generators.
4992`A FiniteRankAlgebra is an algebra over a commutative ring \spad{R} which is a free \spad{R}-module of finite rank.
5098`A FiniteRankNonAssociativeAlgebra is a non associative algebra over a commutative ring \spad{R} which is a free \spad{R}-module of finite rank.
5181`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.
5245`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 implementations are usually binary or decimal)} \indented{2}{2: \spadfunFrom{precision}{FloatingPointSystem} of the \spadfunFrom{mantissa}{FloatingPointSystem} (arbitrary or fixed)} \indented{2}{3: rounding error for operations} \blankline Because a Float is an approximation to the real numbers,{} even though it is defined to be a join of a Field and OrderedRing,{} some of the attributes do not hold. In particular associative(\spad{"+"}) does not hold. Algorithms defined over a field need special considerations when the field is a floating point system.
5340`\spadtype{FortranFunctionCategory} is the category of arguments to NAG Library routines which return (sets of) function values.
5396`A category of domains which model machine arithmetic used by machines in the AXIOM-NAG link.
5453`\spadtype{FortranMatrixCategory} provides support for producing Functions and Subroutines when the input to these is a FriCAS object of type \spadtype{Matrix} or in domains involving \spadtype{FortranCode}.
5504`\spadtype{FortranMatrixFunctionCategory} provides support for producing Functions and Subroutines representing matrices of expressions.
5565`\spadtype{FortranProgramCategory} provides various models of FORTRAN subprograms. These can be transformed into actual FORTRAN code.
5621`\spadtype{FortranVectorCategory} provides support for producing Functions and Subroutines when the input to these is a FriCAS object of type \spadtype{Vector} or in domains involving \spadtype{FortranCode}.
5672`\spadtype{FortranVectorFunctionCategory} is the category of arguments to NAG Library routines which return the values of vectors of functions.
5733`A \spadtype{FramedAlgebra} is a \spadtype{FiniteRankAlgebra} together with a fixed \spad{R}-module basis.
5835`A \spadtype{FramedModule} is a finite rank free module with fixed \spad{R}-module basis.
5899`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.
5978`The category of free Lie algebras. It is used by domains of non-commutative algebra: \spadtype{LiePolynomial} and \spadtype{XPBWPolynomial}. \newline Author: Michel Petitot (petitot@lifl.\spad{fr})
6060`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{FreeModuleCategory} category constructor. Author: Michel Petitot (petitot@lifl.\spad{fr}) \blankline Note (Franz Lehner,{} June 2009): \spad{FreeModule} originally was not of FreeModuleCategory. Some functions (like \spad{support},{} \spad{coefficients},{} \spad{monomials},{} ...) from here could be moved to \spad{IndexedDirectProductCategory} but at the moment there is no need for this.
6144`This category provides a selection of evaluation operations depending on what the argument type \spad{R} provides.
6209`\spad{S} is \spadtype{FullyLinearlyExplicitOver R} means that \spad{S} is a \spadtype{LinearlyExplicitOver R} and,{} in addition,{} if \spad{R} is a \spadtype{LinearlyExplicitOver Integer},{} then so is \spad{S}
6275`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).
6337`\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\spad{'t} retract into \spad{B}.} Date Created: March 1990
6396`This category is a model for the function field of a plane algebraic curve.
6616`A space of formal functions with arguments in an arbitrary ordered set.
6694`This category describes domains where \spadfun{\spad{gcd}} can be computed but where there is no guarantee of the existence of \spadfun{factor} operation for factorization into irreducibles. However,{} if such a \spadfun{factor} operation exist,{} factorization will be unique up to order and units.
6736`GradedAlgebra(\spad{R},{} \spad{E}) denotes ``E-graded \spad{R}-algebra\spad{''}. A graded algebra is a graded module together with a degree preserving \spad{R}-linear map,{} called the {\em product}. \blankline The name ``product\spad{''} is written out in full so inner and outer products with the same mapping type can be distinguished by name.
6815`GradedModule(\spad{R},{} \spad{E}) denotes ``E-graded \spad{R}-module\spad{''},{} \spadignore{i.e.} collection of \spad{R}-modules indexed by an abelian monoid \spad{E}. An element \spad{g} of \spad{G[s]} for some specific \spad{s} in \spad{E} is said to be an element of \spad{G} with {\em degree} \spad{s}. Sums are defined in each module \spad{G[s]} so two elements of \spad{G} have a sum if they have the same degree. \blankline Morphisms can be defined and composed by degree to give the mathematical category of graded modules.
6893`The class of multiplicative groups,{} \spadignore{i.e.} monoids with multiplicative inverses. \blankline
6930`All domains for which we can compute hash function \indented{1}{compatible with equality.}
6972`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 \spadtype{finiteAggregate} have a finite number of members. Of course,{} such a domain may have an infinite number of elements,{} like,{} for example \spadtype{List}. Those domains with attribute \spadtype{shallowlyMutable} allow an element to be modified or updated without changing its overall value.
7031`A Hopf algebra is a bialgebra with antipode.
7110`Category for the hyperbolic trigonometric functions.
7169`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.
7239`This category represents the direct product of some set with respect to an ordered indexing set. The ordered set \spad{S} is considered as the ``basis elements\spad{''} and the elements from \spad{A} as ``coefficients\spad{''}.
7326`This category represents the product of some set with respect to an indexing set. The set \spad{S} is considered as the ``basis elements\spad{''} and the elements from \spad{A} as ``coefficients\spad{''}. Elements may have infinite support. For \spad{Comparable} (ordered) \spad{S} we assume that support of each element is well-orderd.
7406`This category provides \spadfun{eval} operations. A domain may belong to this category if it is possible to make ``evaluation\spad{''} 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.
7474`An \spad{IntegerNumberSystem} is a model for the integers.
7523`The category of commutative integral domains,{} \spadignore{i.e.} commutative rings with no zero divisors. \blankline
7570`\indented{1}{+ Author: Mike Dewar} + Date Created: November 1996 + Basic Functions: + Related Constructors: + Also See: + AMS Classifications: + Keywords: + References: + Description: This category implements of interval arithmetic and + transcendental functions over intervals.
7651`\spadtype{JetBundleBaseFunctionCategory} defines the category of functions (local sections) of the base space of a jet bundle,{} \spadignore{i.e.} functions depending only on the independent variables. Such a category is needed \spadignore{e.g.} for the representation of solutions.
7733`\spadtype{JetBundleCategory} provides basic data structures and procedures for jet bundles. Nearly all necessary functions are implemented already here. Only the representation and functions which directly access it must be implemented in a domain. Two notations of derivatives are supported. Default is multi-index notation,{} where the \spad{i}-th entry of the index denotes the number of differentiations taken with respect to \spad{x^i}. In repeated index notation each entry \spad{i} in the index denotes a differentiation with respect to \spad{x^i}. The choice affects,{} however,{} only in- and output. Internally,{} multi-index notation is used throughout.
7780`\spadtype{JetBundleFunctionCategory} defines the category of functions (local sections) over a jet bundle. The formal derivative is defined already here. It uses the Jacobi matrix of the functions. The columns of the matrices are enumerated by jet variables. Thus they are represented as a \spadtype{Record} of the matrix and a list of the jet variables. Several simplification routines are implemented already here.
7857`join semilattice \indented{2}{Different from exterior Grassmann product operator as} \indented{2}{that anticommutes.} \indented{2}{need to check precedence when used as an infix operator} \indented{2}{for more documentation see:} \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
7906`A kernel over a set \spad{S} is an operator applied to a given list of arguments from \spad{S}.
7966`A keyed dictionary is a dictionary of key-entry pairs for which there is a unique entry for each key.
8033`lattice \indented{2}{for more documentation see:} \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
8070`The class of all domains which have have lazy representation.
8119`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. Elements of LazyStreamAggregate are computed only when strictly needed. Lazy computation means that potential errors are delayed,{} so errors are detected later than in case of normal (eager) evaluation used by other aggregates. In some cases computation that would signal error when using eager evaluation can succeed when using lazy evaluation.
8179`The category of all left algebras over an arbitrary ring.
8228`The category of left modules over an \spad{rng} (ring not necessarily with unit). This is an abelian group which supports left multiplication by elements of the \spad{rng}. \blankline
8282`This is category of left ore rings,{} that is noncommutaive rings without zero divisors where we can compute least left common multiple
8325`The category of Lie Algebras. It is used by the following domains of non-commutative algebra: \spadtype{LiePolynomial} and \spadtype{XPBWPolynomial}. \newline Author : Michel Petitot (petitot@lifl.\spad{fr}).
8386`A linear aggregate is an aggregate whose elements are indexed by integers. Examples of linear aggregates are strings,{} lists,{} and arrays. Most of the exported operations for linear aggregates are non-destructive but are not always efficient for a particular aggregate. For example,{} \spadfun{concat} of two lists needs only to copy its first argument,{} whereas \spadfun{concat} of two arrays needs to copy both arguments. Most of the operations exported here apply to infinite objects (\spadignore{e.g.} streams) as well to finite ones. If the aggregate is a finite aggregate then it has several additional exports such as \spadfun{reverse},{} \spadfun{sort},{} and so on.
8440`An extension ring with an explicit linear dependence test.
8500`\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}}
8583`Category for the transcendental Liouvillian functions.
8642`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.
8694`'Logic' adds 'not' operation to lattices,{} Implements De Morgan\spad{'s} laws.
8731`Magma is the class of all multiplicative magmas,{} \spadignore{i.e.} sets with a binary operation.
8768`\indented{1}{MagmaWithUnit 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("*":(\%,{}\%)\spad{->}\%,{}1)\space{3}\tab{30} 1*x=x} \indented{3}{rightIdentity("*":(\%,{}\%)\spad{->}\%,{}1)\space{2}\tab{30} x*1=x} Common Additional Axioms \indented{3}{unitsKnown---if "recip" says "failed",{} that PROVES input wasn\spad{'t} a unit}
8815`\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 columns returned as objects of type Col. A domain belonging to this category will be shallowly mutable. The index of the 'first' row may be obtained by calling the function \spadfun{minRowIndex}. The index of the 'first' column may be obtained by calling the function \spadfun{minColIndex}. The index of the first element of a Row is the same as the index of the first column in a matrix and vice versa.
8938`The category for general multi-variate possibly skew polynomials over a ring \spad{R},{} in variables from VarSet,{} with exponents from the \spadtype{OrderedAbelianMonoidSup}.
9063`meet semilattice \indented{2}{Implementations in set,{} logic and orders} \indented{2}{for more documentation see:} \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
9112`This category specifies operations needed by \indented{1}{ModularAlgebraicGcd package.\space{2}Since we have multiple} \indented{1}{implementations we specify interface here and put} \indented{1}{implementations in separate packages.\space{2}Most operations} \indented{1}{are done using special purpose abstract representation.} \indented{1}{Appropriate types are passed as parameters: \spad{MPT} is type} \indented{1}{of modular polynomials in one variable with coefficients} \indented{1}{in some algebraic extension.\space{2}\spad{MD} is type of modulus.} \indented{1}{Final results are converted to packed representation,{}} \indented{1}{with coefficients (from prime field) stored in one} \indented{1}{array and exponents (in main variable and in auxiliary} \indented{1}{variables representing generators of algebrac extension)} \indented{1}{stored in parallel array.}
9200`ModularEvaluationCategory(\spad{PT},{} \spad{MP}) defines interface \indented{1}{to evaluation functions for \spad{ModularAlgebraicGcd2}.}
9274`This category specifies operations needed by \indented{1}{univariate factorization over finite fields}
9370`The category of modules over a commutative ring. \blankline
9427`A \spadtype{MonogenicAlgebra} is an algebra of finite rank which can be generated by a single element.
9532`The class of multiplicative monoids,{} \spadignore{i.e.} semigroups with a multiplicative identity element. \blankline
9571`\spadtype{MonoidRingCategory}(\spad{R},{} \spad{M}) defines the algebra of all maps from the monoid \spad{M} to the commutative ring \spad{R} with finite support.
9637`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.
9698`The class of all euclidean domains such that \spad{euclideanSize(a*b)=euclideanSize(a)*euclideanSize(b)}.
9755`A multi-set aggregate is a set which keeps track of the multiplicity of its elements.
9932`\spadtype{MultivariateTaylorSeriesCategory} is the most general multivariate Taylor series category.
10022`NonAssociativeAlgebra is the category of non associative algebras (modules which are themselves non associative rngs). Axioms \indented{3}{\spad{r*}(a*b) = (r*a)\spad{*b} = a*(\spad{r*b})}
10093`A NonAssociativeRing is a non associative \spad{rng} which has a unit,{} the multiplication is not necessarily commutative or associative.
10144`NonAssociativeRng is a basic ring-type structure,{} not necessarily commutative or associative,{} and not necessarily with unit. Axioms \indented{2}{\spad{x*}(\spad{y+z}) = x*y + \spad{x*z}} \indented{2}{(x+y)\spad{*z} = \spad{x*z} + \spad{y*z}} Common Additional Axioms \indented{2}{noZeroDivisors\space{2}ab = 0 \spad{=>} \spad{a=0} or \spad{b=0}}
10193`The category of semirings,{} not necessarily associative,{} not necessarily commutative,{} with 0 and 1.
10249`The category of semirings,{} not necessarily associative,{} not necessarily commutative,{} and not necessarily with a 1.
10303`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 with respect to every polynomial in \spad{collectUnder(ts,{} v)}. A polynomial \spad{p} is said normalized with respect to a non-constant polynomial \spad{q} if \spad{p} is constant or \spad{degree(p,{} mdeg(q)) = 0} and \spad{init(p)} is normalized with respect to \spad{q}. One of the important features of normalized triangular sets is that they are regular sets.
10461`The class of all semirings such that \spad{x * y \~~= 0} implies both \spad{x} and \spad{y} are non-zero
10509`OctonionCategory gives the categorial frame for the octonions,{} and eight-dimensional non-associative algebra,{} doubling the quaternions in the same way as doubling the Complex numbers to get the quaternions.
10572`One-dimensional-array aggregates serves as models for one-dimensional arrays. Categorically,{} these aggregates are finite linear aggregates with the \spadtype{shallowlyMutable} property,{} that is,{} any component of the array may be changed without affecting the identity of the overall array. Array data structures are typically represented by a fixed area in storage and therefore cannot efficiently grow or shrink on demand as can list structures (see however \spadtype{FlexibleArray} for a data structure which is a cross between a list and an array). Iteration over,{} and access to,{} elements of arrays is extremely fast (and often can be optimized to open-code). Insertion and deletion however is generally slow since an entirely new data structure must be created for the result.
10639`\spadtype{OpenMath} provides operations for exporting an object in OpenMath format.
10676`Ordered sets which are also abelian groups,{} such that the addition preserves the ordering.
10729`Ordered sets which are also abelian monoids,{} such that the addition preserves the ordering.
10781`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
10837`Ordered sets which are also abelian semigroups,{} such that the addition preserves the ordering. \indented{2}{\spad{ x < y => x+z < y+z}}
10892`Ordered sets which are also abelian cancellation monoids,{} such that the addition preserves the ordering.
10957`Ordered finite sets.
11003`The category of ordered commutative integral domains,{} where ordering and the arithmetic operations are compatible.
11058`Ordered sets which are also monoids,{} such that multiplication preserves the ordering. \blankline
11104`An ordered-multiset aggregate is a multiset built over an ordered set \spad{S} so that the relative sizes of its entries can be assessed. These aggregates serve as models for priority queues.
11174`Ordered sets which are also rings,{} that is,{} domains where the ring operations are compatible with the ordering. \blankline
11219`Semigroups with compatible ordering.
11269`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}. This order should be the natural order on given structure.
11312`This is category specifying required interface \indented{1}{to output formatters.}
11369`This is the category of stream-based representations of \indented{2}{the \spad{p}-adic integers.}
11433`A partial differential ring with differentiations indexed by a parameter type \spad{S}. \blankline
11503`The class of partially ordered sets,{} that is sets equipped with transitive and reflexive relation \spad{<=}.
11548`This is the description of any package which provides partial functions on a domain belonging to TranscendentalFunctionCategory.
11619`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.
11669`A set \spad{R} is PatternMatchable over \spad{S} if elements of \spad{R} can be matched to patterns over \spad{S}.
11732`PermutationCategory provides a categorical environment \indented{1}{for subgroups of bijections of a set (\spadignore{i.e.} permutations)}
11799`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.
11860`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 \spad{x-},{} \spad{y-},{} and \spad{z}-coordinates of the points on the curve.
11921`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.
11973`The category for general multi-variate polynomials over a ring \spad{R},{} in variables from VarSet,{} with exponents from the \spadtype{OrderedAbelianMonoidSup}. Here variables commute with the coefficients.
12089`This is the category of domains that know "enough" about themselves in order to factor univariate polynomials over their fraction field.
12153`A category for finite subsets of a polynomial ring. Such a set is only regarded as a set of polynomials and not identified to the ideal it generates. So two distinct sets may generate the same the ideal. Furthermore,{} for \spad{R} being an integral domain,{} a set of polynomials may be viewed as a representation of the ideal it generates in the polynomial ring \spad{(R)^(-1) P},{} or the set of its zeros (described for instance by the radical of the previous ideal,{} or a split of the associated affine variety) and so on. So this category provides operations about those different notions.
12312`holds a complete set together with a structure to codify \indented{2}{the partial order.} \indented{2}{for more documentation see:} \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
12363`\spadtype{PowerSeriesCategory} is the most general power series category with exponents in an ordered abelian monoid.
12466`implies operation with reflexivity and transitivity \indented{2}{for more documentation see:} \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
12521`Category for the functions defined by integrals.
12580`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.
12630`A priority queue is a bag of items from an ordered set where the item extracted is always the maximum element.
12698`\spadtype{QuaternionCategory} describes the category of quaternions and implements functions that are not representation specific.
12768`A queue is a bag where the first item inserted is the first item extracted.
12821`QuotientField(\spad{S}) is the category of fractions of an Integral Domain \spad{S}.
12891`The \spad{RadicalCategory} is a model for the rational numbers.
12939`\spadtype{RealClosedField} provides common access functions for all real closed fields.
12988`The category of real numeric domains,{} \spadignore{i.e.} convertible to floats.
13031`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.
13077`\spadtype{RealRootCharacterizationCategory} provides common access functions for all real root codings.
13227`\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.
13416`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 either empty or a {\em node} consisting of a \spadfun{value} from \spad{S} and 0 or more \spadfun{children} which are also nodes. 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.
13473`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 \spadfun{sup} operation. When not constant,{} such a polynomial is viewed as a univariate polynomial in its main variable \spad{w}. \spad{r}. \spad{t}. to the total ordering on the elements in the ordered set,{} so that some operations usually defined for univariate polynomials make sense here.
13580`The category of regular triangular sets,{} introduced under the name regular chains in [1] (and other papers). In [3] it is proved that regular triangular sets and towers of simple extensions of a field are equivalent notions. In the following definitions,{} all polynomials and ideals are taken from the polynomial ring \spad{k[x1,{} ...,{} xn]} where \spad{k} is the fraction field of \spad{R}. The triangular set \spad{[t1,{} ...,{} tm]} is regular iff for every \spad{i} the initial of \spad{ti+1} is invertible in the tower of simple extensions associated with \spad{[t1,{} ...,{} \spad{ti}]}. A family \spad{[T1,{} ...,{} Ts]} of regular triangular sets is a split of Kalkbrener of a given ideal \spad{I} iff the radical of \spad{I} is equal to the intersection of the radical ideals generated by the saturated ideals of the \spad{[T1,{} ...,{} \spad{Ti}]}. A family \spad{[T1,{} ...,{} Ts]} of regular triangular sets is a split of Kalkbrener of a given triangular set \spad{T} iff it is a split of Kalkbrener of the saturated ideal of \spad{T}. Let \spad{K} be an algebraic closure of \spad{k}. Assume that \spad{V} is finite with cardinality \spad{n} and let \spad{A} be the affine space \spad{K^n}. For a regular triangular set \spad{T} let denote by \spad{W(T)} the set of regular zeros of \spad{T}. A family \spad{[T1,{} ...,{} Ts]} of regular triangular sets is a split of Lazard of a given subset \spad{S} of \spad{A} iff the union of the \spad{W(\spad{Ti})} contains \spad{S} and is contained in the closure of \spad{S} (with respect to Zariski topology). A family \spad{[T1,{} ...,{} Ts]} of regular triangular sets is a split of Lazard of a given triangular set \spad{T} if it is a split of Lazard of \spad{W(T)}. Note that if \spad{[T1,{} ...,{} Ts]} is a split of Lazard of \spad{T} then it is also a split of Kalkbrener of \spad{T}. The converse is \spad{false}. This category provides operations related to both kinds of splits,{} the former being related to ideals decomposition whereas the latter deals with varieties decomposition. See the example illustrating the \spadtype{RegularTriangularSet} constructor for more explanations about decompositions by means of regular triangular sets. \newline
13736`\spad{B} is retractable from A means that some elements in A can be converted into elements of \spad{B} and any element of \spad{B} can be converted into an element of A.
13792`A is retractable to \spad{B} means that some elements of A can be converted into elements of \spad{B} and any element of \spad{B} can be converted into an element of A.
13846`The category of right modules over an \spad{rng} (ring not necessarily with unit). This is an abelian group which supports right multiplation by elements of the \spad{rng}. \blankline
13901`The category of rings with unity,{} always associative,{} but not necessarily commutative.
13936`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
13969`This category provides operations on ranges,{} or {\em segments} as they are called.
14024`This category provides an interface for expanding segments to a stream of elements.
14119`the class of all multiplicative semigroups,{} \spadignore{i.e.} a set with an associative operation \spadop{*}. \blankline
14161`The category of associative semirings,{} not necessarily commutative,{} with 0 and 1.
14201`The category of associative semirings,{} not necessarily commutative,{} and not necessarily with a 1.
14239`A category for infinite sequences over a commutative ring. It is a stream with arithmetics.
14307`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.
14366`\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{=}}
14410`This category allows the manipulation of Lisp values while keeping the grunge fairly localized.
14526`The class of all domains which have have immediate components that are updateable (mutable).
14576`This is the category of polynomials in noncommutative variables over noncommutative rings. We do not assume that variables and elements of the base ring commute. We assume that the polynomial ring is of solvable type,{} so noncommutative version of Buchberger algorithm works.
14677`Category for the other special functions.
14733`PointCategory is the category of points and vectors in space. Points may be used to represent shapes in a scenegraph such as: the vertices of a cube or points along a line. Shapes such as these may be defined explicitly or may be plotted. We implement SetCategory to allow us to curry transforms from one point to another.
14780`The category of square-free and normalized triangular sets. Thus,{} up to the primitivity axiom of [1],{} these sets are Lazard triangular sets.\newline
14949`The category of square-free regular triangular sets. A regular triangular set \spad{ts} is square-free if the \spad{gcd} of any polynomial \spad{p} in \spad{ts} and \spad{differentiate(p,{} mvar(p))} with respect to \spadopFrom{collectUnder}{TriangularSetCategory}(\spad{ts},{} \spadopFrom{mvar}{RecursivePolynomialCategory}(\spad{p})) has degree zero with respect to \spad{mvar(p)}. Thus any square-free regular set defines a tower of square-free simple extensions.\newline
15115`\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 columns returned as objects of type Col.
15288`A stack is a bag where the last item inserted is the first item extracted.
15341`A class of objects which can be 'stepped through'. Repeated applications of \spadfun{nextItem} is guaranteed never to return duplicate items and only return "failed" after exhausting all elements of the domain. This assumes that the sequence starts with \spad{init()}. For infinite domains,{} repeated application of \spadfun{nextItem} is not required to reach all possible domain elements starting from any initial element. \blankline Conditional attributes: \indented{2}{infinite\tab{15}repeated \spad{nextItem}\spad{'s} are never "failed".}
15383`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 as power series can be built.
15437`A string aggregate is a category for strings,{} that is,{} one dimensional arrays of characters.
15484`A category for string-like objects
15532`A table aggregate is a model of a table,{} \spadignore{i.e.} a discrete many-to-one mapping from keys to entries.
15598`Category for operations needed by Taylor expansions.
15822`Category of tensor powers of modules over commutative rings.
15927`Category of tensor products of modules over commutative rings.
16026`Universal property of tensor products.
16174`The category ThreeSpaceCategory is used for creating three dimensional objects using functions for defining points,{} curves,{} polygons,{} constructs and the subspaces containing them.
16232`Category for the transcendental elementary functions.
16296`The category of triangular sets of multivariate polynomials with coefficients in an integral domain. Let \spad{R} be an integral domain and \spad{V} a finite ordered set of variables,{} say \spad{X1 < X2 < ... < Xn}. A set \spad{S} of polynomials in \spad{R[X1,{} X2,{} ...,{} Xn]} is triangular if no elements of \spad{S} lies in \spad{R},{} and if two distinct elements of \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 \spad{P} is reduced with respect to a non-constant polynomial \spad{Q} if the degree of \spad{P} in the main variable of \spad{Q} is less than the main degree of \spad{Q}. A polynomial \spad{P} is reduced with respect to a triangular set \spad{T} if it is reduced with respect to every polynomial of \spad{T}. \newline
16450`Category for the trigonometric functions.
16513`\indented{1}{TwoDimensionalArrayCategory is a general array category which} allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and columns returned as objects of type Col. The index of the 'first' row may be obtained by calling the function 'minRowIndex'. The index of the 'first' column may be obtained by calling the function 'minColIndex'. The index of the first element of a 'Row' is the same as the index of the first column in an array and vice versa.
16647`The class of all magmas where \spad{leftRecip} and \spad{rightRecip} are the same as \spad{recip}.
16693`The fundamental Type.
16728`A unary-recursive aggregate is an aggregate 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. Since these aggregates are recursive aggregates,{} they may be cyclic.
16790`A constructive unique factorization domain,{} \spadignore{i.e.} where we can constructively factor members into a product of a finite number of irreducible elements.
16845`The class of all monoids (multiplicative semigroups with a 1) such that the operation \spadfun{recip} can only return "failed" if its argument is not a unit.
16889`\spadtype{UnivariateLaurentSeriesCategory} is the category of Laurent series in one variable.
16963`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)}.
17095`The category of univariate polynomials over a ring \spad{R}. No particular model is assumed - implementations can be either sparse or dense.
17176`\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.
17275`\spadtype{UnivariatePuiseuxSeriesCategory} is the category of Puiseux series in one variable.
17350`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)}.
17587`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} developed by Jean Della Dora and Stephen \spad{M}. Watt.
17660`\spadtype{UnivariateTaylorSeriesCategory} is the category of Taylor series in one variable.
17733`VarCat represents a variable in Lambda and Ski domains. Since we are working in terms of functions then a variable will be a function (possibly a constant function) a variable has a name represented by a String. If the Lambda or Ski calculus is typed then the variable will also have a type.
17772`The class of all polynomial domains such that variables commute with coefficients.
17837`\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.
17892`This is the category of algebras over non-commutative rings. It is used by constructors of non-commutative algebras such as: \indented{4}{\spadtype{XPolynomialRing}.} \indented{4}{\spadtype{XFreeAlgebra}} Author: Michel Petitot (petitot@lifl.\spad{fr})
17938`This category specifies operations for polynomials and formal series with non-commutative variables.
18003`The Category of polynomial rings with non-commutative variables. The coefficient ring may be non-commutative too. However coefficients commute with variables.
18072`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{\spad{ai} * aj = gammaij1 * a1 + ... + gammaijn * an}. The symbols for the fixed basis have to be given as a list of symbols.
18252`Function field defined by \spad{f}(\spad{x},{} \spad{y}) = 0.
18454`Algebraic closure of the rational numbers.
18515`This domain implements anonymous functions
18566`The domain of antisymmetric polynomials.
18649`\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}.
18695`A stack represented as a flexible array.
18771`\indented{1}{AssociatedJordanAlgebra takes an algebra \spad{A} and uses \spadfun{*\$A}} \indented{1}{to define the new multiplications \spad{a*b := (a *\$A b + b *\$A a)/2}} \indented{1}{(anticommutator).} \indented{1}{The usual notation \spad{{a,{} b}_+} cannot be used due to} \indented{1}{restrictions in the current language.} \indented{1}{This domain only gives a Jordan algebra if the} \indented{1}{Jordan-identity \spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} holds} \indented{1}{for all \spad{a},{} \spad{b},{} \spad{c} in \spad{A}.} \indented{1}{This relation can be checked by} \indented{1}{\spadfun{jordanAdmissible?()\$A}.} \blankline If the underlying algebra is of type \spadtype{FramedNonAssociativeAlgebra(R)} (\spadignore{i.e.} a non associative algebra over \spad{R} which is a free \spad{R}-module of finite rank,{} together with a fixed \spad{R}-module basis),{} then the same is \spad{true} for the associated Jordan algebra. Moreover,{} if the underlying algebra is of type \spadtype{FiniteRankNonAssociativeAlgebra(R)} (\spadignore{i.e.} a non associative algebra over \spad{R} which is a free \spad{R}-module of finite rank),{} then the same \spad{true} for the associated Jordan algebra.
18902`AssociatedLieAlgebra takes an algebra \spad{A} and uses \spadfun{*\$A} to define the Lie bracket \spad{a*b := (a *\$A b - b *\$A a)} (commutator). Note that the notation \spad{[a,{} b]} cannot be used due to restrictions of the current compiler. This domain only gives a Lie algebra if the Jacobi-identity \spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} holds for all \spad{a},{} \spad{b},{} \spad{c} in \spad{A}. This relation can be checked by \spad{lieAdmissible?()\$A}. \blankline If the underlying algebra is of type \spadtype{FramedNonAssociativeAlgebra(R)} (\spadignore{i.e.} a non associative algebra over \spad{R} which is a free \spad{R}-module of finite rank,{} together with a fixed \spad{R}-module basis),{} then the same is \spad{true} for the associated Lie algebra. Also,{} if the underlying algebra is of type \spadtype{FiniteRankNonAssociativeAlgebra(R)} (\spadignore{i.e.} a non associative algebra over \spad{R} which is a free \spad{R}-module of finite rank),{} then the same is \spad{true} for the associated Lie algebra.
19027`\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.
19134`Automorphism \spad{R} is the multiplicative group of automorphisms of \spad{R}.
19194`\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 one leaf node.
19282`Stream-based implementation of \spad{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}.
19360`Stream-based implementation of \spad{Qp:} numbers are represented as sum(\spad{i} = \spad{k}..,{} a[\spad{i}] * p^i),{} where the a[\spad{i}] lie in -(\spad{p} - 1)\spad{/2},{} ...,{} (\spad{p} - 1)\spad{/2}.
19474`This is domain for storing and reading Spad values in files.
19557`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.
19612`This domain allows rational numbers to be presented as repeating binary expansions.
19692`BinarySearchTree(\spad{S}) is the domain of 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 left and a right which are both BinarySearchTree(\spad{S}).
19777`\spadtype{BinaryTournament(S)} is the domain of binary trees where elements are ordered down the tree. A binary tournament is either empty or is a node containing a \spadfun{value} of type \spad{S},{} and a \spadfun{left} and a \spadfun{right} which are both \spadtype{BinaryTree(S)}
19862`\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 BinaryTree(\spad{S}).
19941`\spadtype{Bits} provides logical functions for Indexed Bits.
19990`An example of a frame taken from Vickers section 3.7 Date Created: Aug 2015
20045`\indented{1}{\spadtype{Boolean} is the elementary logic with 2 values:} \spad{true} and \spad{false}
20098`Members of the domain CardinalNumber are values indicating the cardinality of sets,{} both finite and infinite. Arithmetic operations are defined on cardinal numbers as follows. \blankline If \spad{x = \#X} and \spad{y = \#Y} then \indented{2}{\spad{x+y\space{2}= \#(X+Y)}\space{3}\tab{30}disjoint union} \indented{2}{\spad{x-y\space{2}= \#(X-Y)}\space{3}\tab{30}relative complement} \indented{2}{\spad{x*y\space{2}= \#(X*Y)}\space{3}\tab{30}cartesian product} \indented{2}{\spad{x^y = \#(X^Y)}\space{2}\tab{30}\spad{X^Y = \{g| g: Y->X\}}} \blankline The non-negative integers have a natural construction as cardinals \indented{2}{\spad{0 = \#\{\}},{} \spad{1 = \{0\}},{} \spad{2 = \{0,{} 1\}},{} ...,{} \spad{n = \{i| 0 <= i < n\}}.} \blankline That \spad{0} acts as a zero for the multiplication of cardinals is equivalent to the axiom of choice. \blankline The generalized continuum hypothesis asserts \centerline{\spad{2^Aleph i = Aleph(i+1)}} and is independent of the axioms of set theory [Goedel 1940]. \blankline Three commonly encountered cardinal numbers are \indented{3}{\spad{a = \#Z}\space{7}\tab{30}countable infinity} \indented{3}{\spad{c = \#R}\space{7}\tab{30}the continuum} \indented{3}{\spad{f = \#\{g| g: [0,{} 1]->R\}}} \blankline In this domain,{} these values are obtained using \indented{3}{\spad{a := Aleph 0},{} \spad{c := 2^a},{} \spad{f := 2^c}.} \blankline
20155`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}.
20382`\indented{2}{Delta Complexes are defined by a sequence of 'face maps',{} These} \indented{2}{can be represented by a list of matrices.} \indented{2}{for more documentation see:} \indented{2}{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/chain/} Date Created: March 2016 Basic Operations: Related packages: Related categories: Related Domains: CoChainComplex Also See: AMS Classifications:
20440`This domain provides the basic character data type.
20495`This domain allows classes of characters to be defined and manipulated efficiently.
20555`CliffordAlgebra(\spad{n},{} \spad{K},{} bLin) defines a module of dimension \spad{2^n} over \spad{K},{} given a bilinear form bLin on \spad{K^n}. \blankline Examples of Clifford Algebras are: gaussians,{} quaternions,{} exterior algebras and spin algebras.
20660`\indented{2}{Delta Complexes are defined by a sequence of 'face maps',{} These can} \indented{2}{be represented by a list of matrices.} \indented{2}{for more documentation see:} \indented{2}{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/chain/cochain/} Date Created: Jan 2016 Basic Operations: Related packages: Related categories: Related Domains: ChainComplex Also See: AMS Classifications:
20736`Color() specifies a domain of 27 colors provided in the \Language{} system (the colors mix additively).
20791`A type for basic commutators.
20845`\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}.
20924`This is a low-level domain which implements matrices (two dimensional arrays) of complex double precision floating point numbers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
21059`This is a low-level domain which implements vectors (one dimensional arrays) of complex double precision floating point numbers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
21154`\spadtype{ContinuedFraction} implements general \indented{1}{continued fractions.\space{2}This version is not restricted to simple,{}} \indented{1}{finite fractions and uses the \spadtype{Stream} as a} \indented{1}{representation.\space{2}The arithmetic functions assume that the} \indented{1}{approximants alternate below/above the convergence point.} \indented{1}{This is enforced by ensuring the partial numerators and partial} \indented{1}{denominators are greater than 0 in the Euclidean domain view of \spad{R}} \indented{1}{(\spadignore{i.e.} \spad{sizeLess?(0,{} x)}).}
21236`\indented{2}{A single vertex,{} edge,{} square,{} cube...} \indented{2}{for more documentation see:} \indented{2}{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/cubical/} Date Created: April 2016 Basic Operations: Related packages: Related categories: FacetCategory Related Domains: Also See: AMS Classifications:
21296`A domain for finite cyclic groups.
21380`\indented{1}{This domain implements a simple view of a database whose fields are} indexed by symbols
21456`This domain provides some nice functions on lists
21527`This domain allows rational numbers to be presented as repeating decimal expansions.
21609`\indented{2}{Similar to Simplicial Complex but faces (edges,{} triangles,{} etc.)} \indented{2}{are indexed by 'face maps' into the next lower face map until} \indented{2}{we get down to the vertices.} \indented{2}{for more documentation see:} \indented{2}{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/delta/} Date Created: Feb 2016 Basic Operations: Related packages: Related categories: Related Domains: FiniteSimplicialComplex is a simpler and more \indented{3}{compact representation which can be used if edges,{} triangles,{}} \indented{3}{etc. don\spad{'t} need to be indexed.} Also See: AMS Classifications:
21683`\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)
21798`Linked list implementation of a Dequeue
21874`The deRham complex of Euclidean space,{} that is,{} the class of differential forms of arbitrary degree over a coefficient ring. See Flanders,{} Harley,{} Differential Forms,{} With Applications to the Physical Sciences,{} New York,{} Academic Press,{} 1963.
22003`\spadtype{DifferentialSparseMultivariatePolynomial} implements an ordinary differential polynomial ring by combining a domain belonging to the category \spadtype{DifferentialVariableCategory} with the domain \spadtype{SparseMultivariatePolynomial}. \blankline
22191`\spad{DihedralGroup(n,{} a,{} b)} is the dihedral group generated by a rotation a of order \spad{n} and a reflection \spad{b}.
22286`Category of directed graphs,{} allows us to model graph theory \blankline
22361`\indented{2}{This type represents the finite direct or cartesian product of an} underlying component type. This contrasts with simple vectors in that the members can be viewed as having constant length. Thus many categorical properties can by lifted from the underlying component type. Component extraction operations are provided but no updating operations. Thus new direct product elements can either be created by converting vector elements using the \spadfun{directProduct} function or by taking appropriate linear combinations of basis vectors provided by the \spad{unitVector} operation.
22470`This constructor provides a direct product type with a left matrix-module view.
22669`This constructor provides a direct product of \spad{R}-modules with an \spad{R}-module view.
22795`DirichletRing is the ring of arithmetical functions with Dirichlet convolution as multiplication
22858`\spadtype{DistributedJetBundlePolynomial} implements polynomials in a distributed representation. The unknowns come from a finite list of jet variables. The implementation is basically a copy of the one of \spadtype{GeneralDistributedMultivariatePolynomial}.
23048`\indented{2}{This type supports distributed multivariate polynomials} whose variables are from a user specified list of symbols. The coefficient ring may be non commutative,{} but the variables are assumed to commute. The term ordering is lexicographic specified by the variable list parameter with the most significant variable first in the list.
23223`Domain for distributions formally given by moments. moments and different kinds of cumulants are stored in streams and computed on demand.
23311`\indented{1}{\spadtype{DoubleFloat} is intended to make accessible} hardware floating point arithmetic in \Language{},{} either native double precision,{} or IEEE. On most machines,{} there will be hardware support for the arithmetic operations: \spadfunFrom{+}{DoubleFloat},{} \spadfunFrom{*}{DoubleFloat},{} \spadfunFrom{/}{DoubleFloat} and possibly also the \spadfunFrom{sqrt}{DoubleFloat} operation. The operations \spadfunFrom{exp}{DoubleFloat},{} \spadfunFrom{log}{DoubleFloat},{} \spadfunFrom{sin}{DoubleFloat},{} \spadfunFrom{cos}{DoubleFloat},{} \spadfunFrom{atan}{DoubleFloat} are normally coded in software based on minimax polynomial/rational approximations. Some general comments about the accuracy of the operations: the operations \spadfunFrom{+}{DoubleFloat},{} \spadfunFrom{*}{DoubleFloat},{} \spadfunFrom{/}{DoubleFloat} and \spadfunFrom{sqrt}{DoubleFloat} are expected to be fully accurate. The operations \spadfunFrom{exp}{DoubleFloat},{} \spadfunFrom{log}{DoubleFloat},{} \spadfunFrom{sin}{DoubleFloat},{} \spadfunFrom{cos}{DoubleFloat} and \spadfunFrom{atan}{DoubleFloat} are not expected to be fully accurate. In particular,{} \spadfunFrom{sin}{DoubleFloat} and \spadfunFrom{cos}{DoubleFloat} will lose all precision for large arguments. \blankline The \spadtype{Float} domain provides an alternative to the \spad{DoubleFloat} domain. It provides an arbitrary precision model of floating point arithmetic. This means that accuracy problems like those above are eliminated by increasing the working precision where necessary. \spadtype{Float} provides some special functions such as \spadfunFrom{erf}{\spad{DoubleFloatSpecialFunctions2}},{} 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.
23376`This is a low-level domain which implements matrices (two dimensional arrays) of double precision floating point numbers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
23480`This is a low-level domain which implements vectors (one dimensional arrays) of double precision floating point numbers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
23558`DrawOption allows the user to specify defaults for the creation and rendering of plots.
23613`This package implements elementary functions on general \indented{1}{univariate power series.}
23862`\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 also provide 'partial functions' which compute transcendental functions of Laurent series when possible and return "failed" when this is not possible.
24116`\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 also provide 'partial functions' which compute transcendental functions of Laurent series when possible and return "failed" when this is not possible.
24417`\spad{Enumeration(a,b,...,c)} is a primitive type in FriCAS used to represent the object composed of the symbols \spad{a},\spad{b},..., and \spad{c}.
24465`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.
24564`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.
24614`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}
24855`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}.
24893`UnivariatePuiseuxSeriesWithExponentialSingularity is a domain used to represent essential singularities of functions. Objects in this domain are quotients of sums,{} where each term in the sum is a univariate Puiseux series times the exponential of a univariate Puiseux series.
25128`ExponentialOfUnivariatePuiseuxSeries is a domain used to represent essential singularities of functions. An object in this domain is a function of the form \spad{exp(f(x))},{} where \spad{f(x)} is a Puiseux series with no terms of non-negative degree. Objects are ordered according to order of singularity,{} with functions which tend more rapidly to zero or infinity considered to be larger. Thus,{} if \spad{order(f(x)) < order(g(x))},{} \spadignore{i.e.} the first non-zero term of \spad{f(x)} has lower degree than the first non-zero term of \spad{g(x)},{} then \spad{exp(f(x)) > exp(g(x))}. If \spad{order(f(x)) = order(g(x))},{} then the ordering is essentially random. This domain is used in computing limits involving functions with essential singularities.
25283`Expressions involving symbolic functions.
25355`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 correspondence with {1,{} 2,{} 3,{} ...}. The ordered subsets are themselves ordered lexicographically and are in bijective correspondence with an ordered basis of the exterior algebra. In this domain we are dealing strictly with the exponents of basis elements which can only be 0 or 1. \blankline The multiplicative identity element of the exterior algebra corresponds to the empty subset of \spad{X}. A coerce from List Integer to an ordered basis element is provided to allow the convenient input of expressions. Another exported function forgets the ordered structure and simply returns the list corresponding to an ordered subset.
25408`\spadtype{Factored} creates a domain whose objects are kept in factored form as long as possible. Thus certain operations like multiplication and \spad{gcd} are relatively easy to do. Others,{} like addition require somewhat more work,{} and unless the argument domain provides a factor function,{} the result may not be completely factored. Each object consists of a unit and a list of factors,{} where a factor has a member of \spad{R} (the "base"),{} and exponent and a flag indicating what is known about the base. A flag may be one of "nil",{} "sqfr",{} "irred" or "prime",{} which respectively mean that nothing is known about the base,{} it is square-free,{} it is irreducible,{} or it is prime. The current restriction to integral domains allows simplification to be performed without worrying about multiplication order.
25478`FakePolynomial is a domain of univariate polynomials \indented{1}{with coefficients being fractions of multivariate integer} \indented{1}{polynomials.\space{2}Coefficients are kept in unsimplified form.} \indented{1}{This domain exists to avoid cost of recursive \spad{GCD} calls} \indented{1}{during polynomial evaluation.}
25551`This domain provides a basic model of files to save arbitrary values. The operations provide sequential access to the contents.
25626`This domain provides an interface to names in the file system.
25674`Holds a complete set together with a structure to codify the partial order. For more documentation see: \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
25732`holds a complete set together with a structure to codify \indented{2}{the partial order.} \indented{2}{for more documentation see:} \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
25792`\indented{2}{A Finite Cubical Complex} \indented{2}{for more documentation see:} \indented{2}{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/cubical/} Date Created: April 2016 Basic Operations: Related packages: Related categories: Related Domains: Also See: AMS Classifications:
25873`holds a complete set together with a structure to codify \indented{2}{the partial order.} \indented{2}{for more documentation see:} \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
25928`This domains implements finite rational divisors on a curve,{} that is finite formal sums SUM(\spad{n} * \spad{P}) where the \spad{n}\spad{'s} are integers and the \spad{P}\spad{'s} are finite rational points on the curve.
26146`FiniteField(\spad{p},{} \spad{n}) implements finite fields with \spad{p^n} elements. This packages checks that \spad{p} is prime. For a non-checking version,{} see \spadtype{InnerFiniteField}.
26258`FiniteFieldCyclicGroup(\spad{p},{} \spad{n}) implements a finite field extension of degee \spad{n} over the prime field with \spad{p} elements. Its elements are represented by powers of a primitive element,{} \spadignore{i.e.} a generator of the multiplicative (cyclic) group. As primitive element we choose the root of the extension polynomial,{} which is created by {\em createPrimitivePoly} from \spadtype{FiniteFieldPolynomialPackage}. The Zech logarithms are stored in a table of size half of the field size,{} and use \spadtype{SingleInteger} for representing field elements,{} hence,{} there are restrictions on the size of the field.
26398`FiniteFieldCyclicGroupExtension(\spad{GF},{} \spad{n}) implements a extension of degree \spad{n} over the ground field {\em GF}. Its elements are represented by powers of a primitive element,{} \spadignore{i.e.} a generator of the multiplicative (cyclic) group. As primitive element we choose the root of the extension polynomial,{} which is created by {\em createPrimitivePoly} from \spadtype{FiniteFieldPolynomialPackage}. Zech logarithms are stored in a table of size half of the field size,{} and use \spadtype{SingleInteger} for representing field elements,{} hence,{} there are restrictions on the size of the field.
26542`FiniteFieldCyclicGroupExtensionByPolynomial(\spad{GF},{} defpol) implements a finite extension field of the ground field {\em GF}. Its elements are represented by powers of a primitive element,{} \spadignore{i.e.} a generator of the multiplicative (cyclic) group. As primitive element we choose the root of the extension polynomial {\em defpol},{} which MUST be primitive (user responsibility). Zech logarithms are stored in a table of size half of the field size,{} and use \spadtype{SingleInteger} for representing field elements,{} hence,{} there are restrictions on the size of the field.
26716`FiniteFieldExtensionByPolynomial(\spad{GF},{} \spad{n}) implements an extension of the finite field {\em GF} of degree \spad{n} generated by the extension polynomial constructed by \spadfunFrom{createIrreduciblePoly}{FiniteFieldPolynomialPackage} from \spadtype{FiniteFieldPolynomialPackage}.
26832`FiniteFieldExtensionByPolynomial(\spad{GF},{} defpol) implements the extension of the finite field {\em GF} generated by the extension polynomial {\em defpol} which MUST be irreducible. Note: the user has the responsibility to ensure that {\em defpol} is irreducible.
26983`FiniteFieldNormalBasis(\spad{p},{} \spad{n}) implements a finite extension field of degree \spad{n} over the prime field with \spad{p} elements. The elements are represented by coordinate vectors with respect to a normal basis,{} \spadignore{i.e.} a basis consisting of the conjugates (\spad{q}-powers) of an element,{} in this case called normal element. This is chosen as a root of the extension polynomial created by \spadfunFrom{createNormalPoly}{FiniteFieldPolynomialPackage}.
27123`FiniteFieldNormalBasisExtensionByPolynomial(\spad{GF},{} \spad{n}) implements a finite extension field of degree \spad{n} over the ground field {\em GF}. The elements are represented by coordinate vectors with respect to a normal basis,{} \spadignore{i.e.} a basis consisting of the conjugates (\spad{q}-powers) of an element,{} in this case called normal element. This is chosen as a root of the extension polynomial,{} created by {\em createNormalPoly} from \spadtype{FiniteFieldPolynomialPackage}
27267`FiniteFieldNormalBasisExtensionByPolynomial(\spad{GF},{} uni) implements a finite extension of the ground field {\em GF}. The elements are represented by coordinate vectors with respect to. a normal basis,{} \spadignore{i.e.} a basis consisting of the conjugates (\spad{q}-powers) of an element,{} in this case called normal element,{} where \spad{q} is the size of {\em GF}. The normal element is chosen as a root of the extension polynomial,{} which MUST be normal over {\em GF} (user responsibility)
27496`This is the algebration of poset. A big difference between \indented{3}{this lattice domain and the poset domain is that,{} in this domain,{} the} \indented{3}{REP holds a single node whereas in poset REP holds the whole poset.} Date Created: Aug 2015
27584`A domain for Moebius functions of explicit subposets of infinite posets.
27676`holds a complete set together with a structure to codify \indented{2}{the partial order.} \indented{2}{for more documentation see:} \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
27734`\indented{2}{A Finite Simplicial Complex} \indented{2}{for more documentation see:} \indented{2}{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/simplex/} Date Created: Dec 2015 Basic Operations: star,{} link,{} cone,{} product Related packages: Related categories: Related Domains: DeltaComplex is an alternative representation \indented{3}{which is less compact but allows edges,{} triangles,{} etc to be indexed.} Also See: AMS Classifications:
27818`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{concat!(a,{} x)} meaning append item \spad{x} at the end of the array \spad{a}} \indented{2}{\spad{delete!(a,{} n)} meaning delete the last item from the array \spad{a}} Flexible arrays support the other operations inherited from \spadtype{ExtensibleLinearAggregate}. However,{} these are not efficient. Flexible arrays combine the \spad{O(1)} access time property of arrays with growing and shrinking at the end in \spad{O(1)} (average) time. This is done by using an ordinary array which may have zero or more empty slots at the end. When the array becomes full it is copied into a new larger (50\% larger) array. Conversely,{} when the array becomes less than 1/2 full,{} it is copied into a smaller array. Flexible arrays provide for an efficient implementation of many data structures in particular heaps,{} stacks and sets.
27904`\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 \spadfunFrom{float}{FloatingPointSystem}(mantissa,{} exponent,{} \spadfunFrom{base}{FloatingPointSystem}) for integer \spad{mantissa},{} \spad{exponent} specifies the number \spad{mantissa} * \spadfunFrom{base}{FloatingPointSystem} ^ \spad{exponent} The underlying representation for floats is binary not decimal. The implications of this are described below. \blankline The model adopted is that arithmetic operations are rounded to to nearest unit in the last place,{} that is,{} accurate to within 2^(-\spadfunFrom{bits}{FloatingPointSystem}). Also,{} the elementary functions and constants are accurate to one unit in the last place. A float is represented as a record of two integers,{} the mantissa and the exponent. The \spadfunFrom{base}{FloatingPointSystem} of the representation is binary,{} hence a \spad{Record(m: mantissa,{} e: exponent)} represents the number \spad{m * 2 ^ e}. Though it is not assumed that the underlying integers are represented with a binary \spadfunFrom{base}{FloatingPointSystem},{} the code will be most efficient when this is the the case (this is \spad{true} in most implementations of Lisp). The decision to choose the \spadfunFrom{base}{FloatingPointSystem} to be binary has some unfortunate consequences. First,{} decimal numbers like 0.3 cannot be represented exactly. Second,{} there is a further loss of accuracy during conversion to decimal for output. To compensate for this,{} if \spad{d} digits of precision are specified,{} \spad{1 + ceiling(log2(10^d))} bits are used. Two numbers that are displayed identically may therefore be not equal. On the other hand,{} a significant efficiency loss would be incurred if we chose to use a decimal \spadfunFrom{base}{FloatingPointSystem} when the underlying integer base is binary. \blankline Algorithms used: For the elementary functions,{} the general approach is to apply identities so that the taylor series can be used,{} and,{} so that it will converge within \spad{O( sqrt n )} steps. For example,{} using the identity \spad{exp(x) = exp(x/2)^2},{} we can compute \spad{exp(1/3)} to \spad{n} digits of precision as follows. We have \spad{exp(1/3) = exp(2 ^ (-sqrt s) / 3) ^ (2 ^ sqrt s)}. The taylor series will converge in less than sqrt \spad{n} steps and the exponentiation requires sqrt \spad{n} multiplications for a total of \spad{2 sqrt n} multiplications. Assuming integer multiplication costs \spad{O( n^2 )} the overall running time is \spad{O( sqrt(n) n^2 )}. This approach is the best known approach for precisions up to about 10,{} 000 digits at which point the methods of Brent which are \spad{O( log(n) n^2 )} become competitive. Note also that summing the terms of the taylor series for the elementary functions is done using integer operations. This avoids the overhead of floating point operations and results in efficient code at low precisions. This implementation makes no attempt to reuse storage,{} relying on the underlying system to do \spadgloss{garbage collection}. \spad{I} estimate that the efficiency of this package at low precisions could be improved by a factor of 2 if in-place operations were available. \blankline Running times: in the following,{} \spad{n} is the number of bits of precision \indented{5}{\spad{*},{} \spad{/},{} \spad{sqrt},{} \spad{\spad{pi}},{} \spad{exp1},{} \spad{log2},{} \spad{log10}: \spad{ O( n^2 )}} \indented{5}{\spad{exp},{} \spad{log},{} \spad{sin},{} \spad{atan}:\space{2}\spad{ O( sqrt(n) n^2 )}} The other elementary functions are coded in terms of the ones above.
27962`\indented{1}{\spadtype{Format1D} provides a coercion from \spadtype{OutputForm}} to a one-dimensional format such that the output can be pasted back as input,{}
28011`\indented{1}{\spadtype{Format2D} provides a coercion from} \spadtype{OutputForm} to two-dimensional format.
28060`\indented{1}{\spadtype{FormatLaTeX} provides a coercion from} \spadtype{OutputForm} to \LaTeX{} format. The particular dialect of \TeX{} used is \LaTeX{},{} but for flexibility reasons \spadtype{FormatLaTeX} outputs everything into a fricasmath environment in which certain additional commands are available. These commands are defined in a .sty file that is distributed with the source code of FriCAS.
28125`\indented{1}{\spadtype{FormatMathJax} provides a coercion from} \spadtype{OutputForm} to a \LaTeX{} format in a variant that can be understood by MahtJax (https://www.mathjax.org).
28191`\indented{1}{The domain \spad{FormattedOutput} is used when} ")set output formatted on" is issued on the command line. Then for each formatter that is stored in the internal data structure of \spad{FormattedOutput}
28347`This domain builds representations of program code segments for use with the FortranProgram domain.
28400`A domain of expressions involving functions which can be translated into standard Fortran-77,{} with some extra extensions from the NAG Fortran Library.
28614`\spadtype{FortranProgram} allows the user to build and manipulate simple models of FORTRAN subprograms. These can then be transformed into actual FORTRAN notation.
28793`Creates and manipulates objects which correspond to the basic FORTRAN data types: REAL,{} INTEGER,{} COMPLEX,{} LOGICAL and CHARACTER
28865`Code to manipulate Fortran templates
28942`Creates and manipulates objects which correspond to FORTRAN data types,{} including array dimensions.
28995`Domain representing components of Fourier series.
29068`Domain of Fourier series.
29180`Fraction takes an IntegralDomain \spad{S} and produces the domain of Fractions with numerators and denominators from \spad{S}. If \spad{S} is also a GcdDomain,{} then \spad{gcd}\spad{'s} between numerator and denominator will be cancelled during all operations.
29262`Fractional ideals in a framed algebra.
29439`Module representation of fractional ideals.
29631`The elements of the Free Field are represented by Admissible Linear Systems (ALS) in standard form ...
29721`The free group on a set \spad{S} is the group of finite products of the form \spad{reduce(*,{} [\spad{si} ^ \spad{ni}])} where the \spad{si}\spad{'s} are in \spad{S},{} and the \spad{ni}\spad{'s} are integers. The multiplication is not commutative.
29784`This type is the basic representation of parenthesized words (binary trees over arbitrary symbols) useful in \spadtype{LiePolynomial}. \newline Author: Michel Petitot (petitot@lifl.\spad{fr}).
29856`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. old domain \spad{FreeModule1} was merged to it in May 2009 The description of the latter: \indented{2}{This domain implements linear combinations} \indented{2}{of elements from the domain \spad{S} with coefficients} \indented{2}{in the domain \spad{R} where \spad{S} is an ordered set} \indented{2}{and \spad{R} is a ring (which may be non-commutative).} \indented{2}{This domain is used by domains of non-commutative algebra such as:} \indented{6}{\spadtype{XDistributedPolynomial},{}} \indented{6}{\spadtype{XRecursivePolynomial}.} \indented{2}{Author: Michel Petitot (petitot@lifl.\spad{fr})}
29946`The free monoid on a set \spad{S} is the monoid of finite products of the form \spad{reduce(*,{} [\spad{si} ^ \spad{ni}])} where the \spad{si}\spad{'s} are in \spad{S},{} and the \spad{ni}\spad{'s} are nonnegative integers. The multiplication is not commutative. When \spad{S} is an OrderedSet,{} then FreeMonoid(\spad{S}) has order: for two elements \spad{x} and \spad{y} the relation \spad{x < y} holds if either \spad{length(x) < length(y)} holds or if these lengths are equal and if \spad{x} is smaller than \spad{y} with respect to the lexicographical ordering induced by \spad{S}.
30012`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.
30151`Full partial fraction expansion of rational functions.
30285`This domain implements named functions
30356`allows us to model graph theory \blankline
30432`\indented{2}{This type supports distributed multivariate polynomials} whose variables are from a user specified list of symbols. The coefficient ring may be non commutative,{} but the variables are assumed to commute. The term ordering is specified by its third parameter. Suggested types which define term orderings include: \spadtype{DirectProduct},{} \spadtype{HomogeneousDirectProduct},{} \spadtype{SplitHomogeneousDirectProduct} and finally \spadtype{OrderedDirectProduct} which accepts an arbitrary user function to define a term ordering.
30632`A domain for generalized Moebius functions of explicit subposets.
30729`Domain for univariate power series with variable \indented{1}{coefficients.}
30916`This package \undocumented
31217`A domain for polynomial sets.
31414`\spadtype{GeneralQuaternion} implements general quaternions \indented{2}{over a commutative ring. The main constructor function is} \indented{2}{\spadfun{quatern} which takes 4 arguments: the real part,{}} \indented{2}{the \spad{i} imaginary part,{} the \spad{j} imaginary part and the \spad{k} imaginary part.}
31504`A sparse table has a default entry,{} which is returned if no other value has been explicitly stored for a key.
31654`A domain constructor of the category \spadtype{TriangularSetCategory}. The only requirement for a list of polynomials to be a member of such a domain is the following: no polynomial is constant and two distinct polynomials have distinct main variables. Such a triangular set may not be auto-reduced or consistent. Triangular sets are stored as sorted lists with respect to the main variables of their members but they are displayed in reverse order.\newline
31829`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)}.
31973`AlgebraGenericElementPackage allows you to create generic elements of an algebra,{} \spadignore{i.e.} the scalars are extended to include symbolic coefficients
32169`TwoDimensionalGraph creates virtual two dimensional graphs (to be displayed on TwoDimensionalViewports).
32226`\indented{2}{Group represented by its generators and relations.} \indented{2}{Here we use it to hold homotopy group such as fundamental group.} \indented{2}{for more documentation see:} \indented{2}{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/finiteGroup/presentation/} Date Created: Jan 2016 Basic Operations: Related packages: Related categories: Related Domains: PermutationGroup Also See: AMS Classifications:
32289`GuessOption is a domain whose elements are various options used by \spadtype{Guess}.
32345`\spad{GuessOptionFunctions0} provides operations that extract the values of options for \spadtype{Guess}.
32412`This domain supports incremental computation of hash values.
32452`This domain provides access to the underlying Lisp hash tables. By varying the hashfn parameter,{} tables suited for different purposes can be obtained.
32570`Heap implemented in a flexible array to allow for insertions
32646`This domain allows rational numbers to be presented as repeating hexadecimal expansions.
32733`\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}.
32856`\indented{2}{This type supports distributed multivariate polynomials} whose variables are from a user specified list of symbols. The coefficient ring may be non commutative,{} but the variables are assumed to commute. The term ordering is total degree ordering refined by reverse lexicographic ordering with respect to the position that the variables appear in the list of variables parameter.
33055`\indented{2}{Intended to hold homology which is calculated using SmithNormalForm:} \indented{2}{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/homology/} Date Created: June 2016 Basic Operations: Related packages: Related categories: Related Domains: FreeModule,{} FiniteSimplicialComplex Also See: AMS Classifications:
33109`\spadtype{HtmlFormat} provides a coercion from \spadtype{OutputForm} to html.
33168`This domains implements finite rational divisors on an hyperelliptic curve,{} that is finite formal sums SUM(\spad{n} * \spad{P}) where the \spad{n}\spad{'s} are integers and the \spad{P}\spad{'s} are finite rational points on the curve. The equation of the curve must be \spad{y^2} = \spad{f}(\spad{x}) and \spad{f} must have odd degree.
33394`This is a low-level domain which implements matrices (two dimensional arrays) of 16-bit signed integers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
33472`This is a low-level domain which implements vectors (one dimensional arrays) of signed 16-bit numbers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
33544`This is a low-level domain which implements matrices (two dimensional arrays) of signed 32-bit integers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
33622`This is a low-level domain which implements vectors (one dimensional arrays) of signed 32-bit numbers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
33694`This is a low-level domain which implements matrices (two dimensional arrays) of 8-bit signed integers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
33768`This is a low-level domain which implements vectors (one dimensional arrays) of signed 8-bit numbers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
33838`ILogic is an algebra with \spad{true},{} \spad{false} and other 'unproven' values
33894`A domain for incidence matrices of finite posets.
33980`\indented{1}{This domain implements a container of information} about the FriCAS library
34034`\spadtype{IndexedBits} is a domain to compactly represent large quantities of Boolean data.
34103`Indexed direct products of objects over a set \spad{A} of generators indexed by an ordered set \spad{S}. It currently provides the ground for,{} \spadignore{e.g.} \spadtype{FreeModule} which lies at the basis of polynomials of all sorts. All items have finite support. If A is a monoid,{} then only non-zero terms are stored. If A has additive structure,{} it is propagated coordinatewise to the product. Similarly,{} comparisons are propagated using lexicographic ordering.
34226`\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
34317`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{concat!(a,{} x)} meaning append item \spad{x} at the end of the array \spad{a}} \indented{2}{\spad{delete!(a,{} n)} meaning delete the last item from the array \spad{a}} Flexible arrays support the other operations inherited from \spadtype{ExtensibleLinearAggregate}. However,{} these are not efficient. Flexible arrays combine the \spad{O(1)} access time property of arrays with growing and shrinking at the end in \spad{O(1)} (average) time. This is done by using an ordinary array which may have zero or more empty slots at the end. When the array becomes full it is copied into a new larger (50\% larger) array. Conversely,{} when the array becomes less than 1/2 full,{} it is copied into a smaller array. Flexible arrays provide for an efficient implementation of many data structures in particular heaps,{} stacks and sets.
34423`\spadtype{JetBundle} provides the standard implementation for a jet bundle with a given number of dependent and independent variables.
34542`\spadtype{IndexedList} is an implementation of \spadtype{ListAggregate},{} the beginning index of the list is the second parameter to the constructor (\spad{mn}). That is,{} if \spad{l} is a list,{} then \spad{elt(l,{} mn)} is the first value.
34612`An \spad{IndexedMatrix} is a matrix where the minimal row and column indices are parameters of the type. The domains Row and Col are both IndexedVectors. The index of the 'first' row may be obtained by calling the function \spadfun{minRowIndex}. The index of the 'first' column may be obtained by calling the function \spadfun{minColIndex}. The index of the first element of a 'Row' is the same as the index of the first column in a matrix and vice versa.
34771`This is the basic one dimensional array data type.
34873`This domain implements low-level strings
34939`\indented{1}{An IndexedTwoDimensionalArray is a 2-dimensional array where} the minimal row and column indices are parameters of the type. Rows and columns are returned as IndexedOneDimensionalArray\spad{'s} with minimal indices matching those of the IndexedTwoDimensionalArray. The index of the 'first' row may be obtained by calling the function 'minRowIndex'. The index of the 'first' column may be obtained by calling the function 'minColIndex'. The index of the first element of a 'Row' is the same as the index of the first column in an array and vice versa.
35141`\indented{2}{This type represents vector like objects with varying lengths} and a user-specified initial index.
35216`Infinite cyclic groups.
35284`\indented{1}{This package implements 'infinite tuples' for the interpreter.} The representation is a stream.
35363`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}.
35487`\indented{1}{This is an internal type which provides an implementation of} 2-dimensional arrays as PrimitiveArray\spad{'s} of PrimitiveArray\spad{'s}.
35687`This domain implements \spad{Zp},{} the \spad{p}-adic completion of the integers. This is an internal domain.
35783`InnerPrimeField(\spad{p}) implements the field with \spad{p} elements by using IntegerMod \spad{p}. Note: argument \spad{p} MUST be a prime (this domain does not check). See \spadtype{PrimeField} for a domain that does check. In addition to the inherited operations of IntegerMod \spad{p},{} the domain provides exploits the structure of the cyclic group of its invertible elements. It stores a primitive element \spad{w},{} \spad{i}.a. generator of this group and it stores a logarithm table for \spad{w} as soon as this is required. sqrt was added in 2018.
35868`InnerSparseUnivariatePowerSeries is an internal domain \indented{2}{used for creating sparse Taylor and Laurent series.}
35988`This domain is used to provide a conditional "add" domain for the implementation of \spadtype{Table}.
36139`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.
36207`Domain of parsed forms which can be passed to the interpreter. This is also the interface between algebra code and facilities in the interpreter.
36306`\spadtype{Integer} provides the domain of arbitrary precision integers.
36365`IntegerLocalizedAtPrime(\spad{p}) represents the Euclidean domain of integers localized at a prime \spad{p},{} \spadignore{i.e.} the set of rational numbers whose denominator is not divisible by \spad{p}.
36458`IntegerMod(\spad{n}) creates the ring of integers reduced modulo the integer \spad{n}.
36535`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 as \spad{f},{} is called the rational part of the integral,{} and \spad{c1 log(u1) + ... cn log(un)} is called the logarithmic part of the integral. This domain manipulates integrals represented in that form,{} by keeping both parts separately. The logs are not explicitly computed.
36617`\indented{1}{+ Author: Mike Dewar} + Date Created: November 1996 + Basic Functions: + Related Constructors: + Also See: + AMS Classifications: + Keywords: + References: + Description: + This domain is an implementation of interval arithmetic and transcendental + functions over intervals.
36702`\spad{JetBundle} implements a jet bundle of arbitrary order with given names for the independent and dependent variables. It supports only repeated index notation.
36801`\spadtype{JetBundleExpression} defines expressions over a jet bundle based on \spadtype{Expression Integer}. It allows all kind of algebraic operations. \spad{simplify} is implemented using Groebner bases in polynomials over kernels. Thus it might not work correctly for general expressions. This also affects \spad{dimension}.
36903`\spadtype{JetBundleLinearFunction} implements linear functions over a jet bundle. The coefficients are functions of the independent variables only.
37051`\spadtype{JetBundlePolynomial} implements polynomial sections over a jet bundle. The order is not fixed,{} thus jet variables of any order can appear.
37163`\spad{JetBundleSymAna} is only necessary to have a valid return type for some procedures in \spad{SymmetryAnalysis}. It is essentially identical with \spad{JetBundle} but computes its parameters in a more complicated way.
37312`\spadtype{JetBundleXExpression} implements arbitrary functions in a jet bundle which depend only on the independent variables \spad{x}. Otherwise it is identical with \spadtype{JetBundleExpression}. Such a domain is needed for \spadtype{JetLinearFunction}.
37415`\spad{JetDifferential(JB,{} D)} implements differentials (one-forms) \indented{1}{over the jet bundle \spad{JB} with coefficients from \spad{D}.} \indented{1}{The differentials operate on \spad{JetVectorField(JB,{} D)}.}
37532`\spadtype{JetDifferentialEquation} provides the basic data structures and procedures for differential equations as needed in the geometric theory. Differential equation means here always a submanifold in the jet bundle. The concrete equations which define this submanifold are called system. In an object of the type \spadtype{JetDifferentialEquation} much more than only the system is stored. \spad{D} denotes the class of functions allowed as equations. It is assumed that the \spad{simplify} procedure of \spad{D} returns only independent equations and a system with symbol in row echelon form.
37639`\spadtype{JetLazyFunction} takes as argument a domain in \spadtype{JetBundleFunctionCategory} and returns another domain in the same category. This domain has basically the same properties as the argument domain,{} but there is a lazy evaluation mechanism for derivatives. This means that differentiations are not immediately performed. Instead a pointer is established to the function to be differentiated. Only when the exact value of the derivative is needed,{} the differentiation is executed. Special care is taken for leading derivatives and jet variables to avoid as much as possible the need to evaluate expressions. This entails that the result of \spad{jetVariables} may contain spurious variables. Furthermore many functions in \spadtype{JetLazyFunction} destructively change their arguments. This affects,{} however,{} only their internal representation,{} not the value obtained after full evaluation.
37774`\spad{JetVectorField(JB,{} D)} implements vector fields over the jet bundle \spad{JB} with coefficients from \spad{D}. The fields operate on functions from \spad{D}.
37888`A kernel over a set \spad{S} is an operator applied to a given list of arguments from \spad{S}.
37954`This domain allows a random access file to be viewed both as a table and as a file object.
38076`An implementation of untyped lambda-calculus
38151`Infinite Lattice which is distributive. \indented{2}{Representation held as join of meets.}
38232`Infinite Lattice which is distributive. \indented{2}{Representation held as meet of joins.}
38313`Univariate polynomials with negative and positive exponents.
38448`This domain provides a simple way to save values in files.
38514`Management of the Lie Group associated with a free nilpotent Lie algebra. Every Lie bracket with length greater than \spad{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.\spad{fr}).
38638`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.\spad{fr}).
38748`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.
38865`Linear matrix pencil with multivariate coefficients.
38931`\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}}
39055`\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}}
39219`\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}}
39343`\spad{LinearOrdinaryDifferentialOperator3} is a ring \indented{1}{differential operators with coefficients in a differential ring \spad{R}.} \indented{1}{Basic derivative is derivative in \spad{R} times variable (monomial} \indented{1}{of degree 1).}
39544`\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{ListAggregate},{} this constructor provides some LISP-like functions such as \spadfun{cons} and \spadfun{append}.
39605`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.
39701`The \spadtype{ListMultiDictionary} domain implements a dictionary with duplicates allowed. The representation is a list with duplicates represented explicitly. Hence most operations will be relatively inefficient when the number of entries in the dictionary becomes large. If the objects in the dictionary belong to an ordered set,{} the entries are maintained in ascending order.
39788`LocalAlgebra produces the localization of an algebra,{} \spadignore{i.e.} fractions whose numerators come from some \spad{R} algebra.
39875`Localize(\spad{M},{} \spad{R}) produces fractions with numerators from an \spad{R} module \spad{M} and denominators being the nonzero elements of \spad{R}.
39956`This is used with graph theory code (FiniteGraph,{} DirectedGraph. FunctionGraph,{} and so on) to represent a loop as either a sequence of vertex or arrow indexes depending on context. The main benefit is that the loop is stored in a canonical way so that loops can be quickly compared using \spad{'='}.
40005`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 with respect to the pure lexicographical ordering. If \spad{a} and \spad{b} are two Lyndon words such that \spad{a < b} holds with respect to lexicographical ordering then \spad{a*b} is a Lyndon word. Parenthesized Lyndon words can be generated from symbols by using the following rule: \spad{[[a,{} b],{} c]} is a Lyndon word iff \spad{a*b < c <= b} holds. Lyndon words are internally represented by binary trees using the \spadtype{FreeMagma} domain constructor. Two ordering are provided: lexicographic and length-lexicographic. \newline Author : Michel Petitot (petitot@lifl.\spad{fr}).
40078`A domain which models the complex number representation used by machines in the AXIOM-NAG link.
40154`A domain which models the floating point representation used by machines in the AXIOM-NAG link.
40221`A domain which models the integer representation used by machines in the AXIOM-NAG link.
40295`MakeCachableSet(\spad{S}) returns a cachable set which is equal to \spad{S} as a set.
40372`\spad{Mapping(T,S)} is a primitive type in FriCAS 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}.
40414`\spadtype{MathMLFormat} provides a coercion from \spadtype{OutputForm} to MathML format.
40474`\spadtype{Matrix} is a matrix domain where 1-based indexing is used for both rows and columns.
40569`This domain implements quotient of ring of univariate polynomials by ideal generated by modulus polynomial. Modulus must be monic. Before performing any operations you need to set modulus,{} subsequent operations use this modulus.
41993`\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}
42186`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}
42376`This package \undocumented
42541`Algebra of ADDITIVE operators on a module.
42621`\indented{1}{MoebiusTransform(\spad{F}) is the domain of fractional linear (Moebius)} transformations over \spad{F}.
42687`\spadtype{MonoidRing}(\spad{R},{} \spad{M}),{} implements the algebra of all maps from the monoid \spad{M} to the commutative ring \spad{R} with finite support. Multiplication of two maps \spad{f} and \spad{g} is defined to map an element \spad{c} of \spad{M} to the (convolution) sum over {\em f(a)g(b)} such that {\em ab = c}. Thus \spad{M} can be identified with a canonical basis and the maps can also be considered as formal linear combinations of the elements in \spad{M}. Scalar multiples of a basis element are called monomials. A prominent example is the class of polynomials where the monoid is a direct product of the natural numbers with pointwise addition. When \spad{M} is \spadtype{FreeMonoid Symbol},{} one gets polynomials in infinitely many non-commuting variables. Another application area is representation theory of finite groups \spad{G},{} where modules over \spadtype{MonoidRing}(\spad{R},{} \spad{G}) are studied.
42763`allows us to model graph theory \blankline
42845`A multiset is a set with multiplicities.
42921`\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.
43080`A post-facto extension for \spadtype{SMP} in order to speed up operations related to pseudo-division and \spad{gcd}. This domain is based on the \spadtype{NSUP} constructor which is itself a post-facto extension of the \spadtype{SUP} constructor.
43239`A post-facto extension for \spadtype{SUP} in order to speed up operations related to pseudo-division and \spad{gcd} for both \spadtype{SUP} and,{} consequently,{} \spadtype{NSMP}.
43340`\spadtype{None} implements an universal type,{} that is type which can represent values of any normal type. 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).
43379`\spadtype{NonNegativeInteger} provides functions for non \indented{2}{negative integers.}
43453`\spadtype{NonNegativeRational} is domain of \indented{1}{nonnegative rational numbers.}
43530`Octonion implements octonions (Cayley-Dixon algebra) over a commutative ring,{} an eight-dimensional non-associative algebra,{} doubling the quaternions in the same way as doubling the complex numbers to get the quaternions the main constructor function is {\em octon} which takes 8 arguments: the real part,{} the \spad{i} imaginary part,{} the \spad{j} imaginary part,{} the \spad{k} imaginary part,{} (as with quaternions) and in addition the imaginary parts \spad{E},{} \spad{I},{} \spad{J},{} \spad{K}.
43608`This is the domain of 1-based one dimensional arrays.
43701`Adjunction of a complex infinity to a set. Date Created: 4 Oct 1989
43781`\spadtype{OpenMathConnection} provides low-level functions for handling connections to and from \spadtype{OpenMathDevice}\spad{s}.
43828`\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.
43870`\spadtype{OpenMathEncoding} is the set of valid OpenMath encodings.
43932`\spadtype{OpenMathError} is the domain of OpenMath errors.
43991`\spadtype{OpenMathErrorKind} represents different kinds of OpenMath errors: specifically parse errors,{} unknown \spad{CD} or symbol errors,{} and read errors.
44055`Algebra of ADDITIVE operators over a ring.
44106`\indented{1}{OperatorHandlers is an auxiliary domain. It is used holds functions} for each operator of \spad{OutputForm},{} classified by the arity and the name of that operator.
44165`Adjunction of two real infinites quantities to a set. Date Created: 4 Oct 1989
44244`\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}.
44454`This domain implements ordered variables
44546`\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
44747`\spadtype{OrderlyDifferentialVariable} adds a commonly used orderly ranking to the set of derivatives of an ordered list of differential indeterminates. An orderly ranking is a ranking \spadfun{<} of the derivatives with the property that for two derivatives \spad{u} and \spad{v},{} \spad{u} \spadfun{<} \spad{v} if the \spadfun{order} of \spad{u} is less than that of \spad{v}. This domain belongs to \spadtype{DifferentialVariableCategory}. It defines \spadfun{weight} to be just \spadfun{order},{} and it defines an orderly ranking \spadfun{<} on derivatives \spad{u} via the lexicographic order on the pair (\spadfun{order}(\spad{u}),{} \spadfun{variable}(\spad{u})).
44843`This constructor produces an ordinary differential ring from a partial differential ring by specifying a variable.
44990`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.
45132`A domain used in order to take the free \spad{R}-module on the \indented{1}{Integers \spad{I}.\space{2}This is actually the forgetful functor from OrderedRings} \indented{1}{to OrderedSets applied to \spad{I}.}
45185`\indented{2}{A single vertex,{} edge,{} triangle...} \indented{2}{for more documentation see:} \indented{2}{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/simplex/} Date Created: March 2016 Basic Operations: Related packages: Related categories: FacetCategory Related Domains: Also See: AMS Classifications:
45247`\indented{1}{The domain \spad{OutputBox} represents the two-dimensional form of} an expression by a number of strings (lines). Such a box has a baseline (at which such boxes will be horizontally aligned,{} a height (size above and including the baseline),{} a depth (size below the baseline),{} and a width (horizontal size).
45315`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.
45373`Stream-based implementation of \spad{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).
45443`Stream-based implementation of \spad{Qp:} numbers are represented as sum(\spad{i} = \spad{k}..,{} a[\spad{i}] * p^i) where the a[\spad{i}] lie in 0,{} 1,{} ...,{} (\spad{p} - 1).
45542`This is the category of stream-based representations of \spad{Qp}.
45679`This domain describes four groups of color shades (palettes).
45734`ParametricComplexCurve is used for drawing complex \indented{1}{curves on the plane.\space{2}Its main effect is on function selection,{}} \indented{1}{namely introducing \spad{complex_curve} in the middle} \indented{1}{disambiguates between expression defining real function} \indented{1}{(default) and expression defining complex function.}
45795`ParametricPlaneCurve is used for plotting parametric plane curves in the affine plane.
45869`ParametricSpaceCurve is used for plotting parametric space curves in affine 3-space.
45943`ParametricSurface is used for plotting parametric surfaces in affine 3-space.
46013`PartialDifferentialOperator(\spad{R},{} \spad{V}) defines a ring of partial differential operators in variables from \spad{V} and with coefficients in a partial differential ring \spad{R}. Multiplication of operators corresponds to composition of operators. \blankline
46186`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\spad{''} form has only one fractional term per prime in the denominator,{} while the \spad{``p}-adic\spad{''} form expands each numerator \spad{p}-adically via the prime \spad{p} in the denominator. For computational efficiency,{} the compact form is used,{} though the \spad{p}-adic form may be gotten by calling the function \spadfunFrom{padicFraction}{PartialFraction}. For a general euclidean domain,{} it is not known how to factor the denominator. Thus the function \spadfunFrom{partialFraction}{PartialFraction} takes an element of \spadtype{Factored(R)} as its second argument.
46257`\indented{1}{Partition is an OrderedCancellationAbelianMonoid which is used} as the basis for symmetric polynomial representation of the sums of powers in SymmetricPolynomial. Thus,{} \spad{(5 2 2 1)} will represent \spad{s5 * s2^2 * s1}.
46336`Patterns for use by the pattern matcher.
46405`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.
46526`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.
46621`\indented{1}{A PendantTree(\spad{S}) is either a leaf? and is an \spad{S} or has} a left and a right are both PendantTree(\spad{S}).
46711`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 permutations are two lists} \indented{2}{of equal length representing preimages and images.}
46792`PermutationGroup implements permutation groups acting on a set \spad{S},{} \spadignore{i.e.} all subgroups of the symmetric group of \spad{S},{} represented as a list of permutations (generators). Note that therefore the objects are not members of the \Language category \spadtype{Group}. Using the idea of base and strong generators by Sims,{} basic routines and algorithms are implemented so that the word problem for permutation groups can be solved.
46870`\indented{1}{Symbolic fractions in \%\spad{pi} with integer coefficients;} \indented{1}{The point for using PiDomain as the default domain for those fractions} \indented{1}{is that PiDomain is coercible to the float types,{} and not Expression.} Date Created: 21 Feb 1990
46919`Plot a NON-SINGULAR plane algebraic curve \spad{p(x,{} y) = 0}.
47005`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.
47070`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.
47139`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.\spad{fr}).
47233`This domain implements points in coordinate space
47286`\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.
47390`This domain represents polynomial ideals with coefficients in any field and supports the basic ideal operations,{} including intersection,{} sum and quotient. An ideal is represented by a list of polynomials (the generators of the ideal) and a boolean that is \spad{true} if the generators are a Groebner basis. The algorithms used are based on Groebner basis computations. The ordering is determined by the datatype of the input polynomials. Users may use refinements of total degree orderings.
47569`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.
47688`\spadtype{PositiveInteger} provides functions for \indented{2}{positive integers.}
47758`PrimeField(\spad{p}) implements the field with \spad{p} elements if \spad{p} is a prime number. Error: if \spad{p} is not prime.
47837`This provides a fast array type with no bound checking on elt\spad{'s}. Minimum index is 0 in this type,{} cannot be changed.
47916`This is a low-level domain which implements matrices \indented{1}{(two dimensional arrays) of general values.} \indented{1}{Indexing is 0 based,{} there is no bound checking (unless} \indented{1}{provided by lower level).}
48055`This domain implements cartesian product. If the underlying domains are both Finite then the resulting Product is also Finite and can be enumerated via size(),{} index(),{} location(),{} etc. The index of the second component (\spad{B}) varies most quickly.
48140`\indented{2}{Holds the product of two simplexes} \indented{2}{for more documentation see:} \indented{2}{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/simplex/product/} Date Created: April 2016 Basic Operations: Related packages: Related categories: FacetCategory Related Domains: Also See: AMS Classifications:
48201`This domain provides modest support for quadratic forms.
48289`\spadtype{QuasiAlgebraicSet} constructs a domain representing quasi-algebraic sets,{} which is the intersection of a Zariski closed set,{} defined as the common zeros of a given list of polynomials (the defining polynomials for equations),{} and a principal Zariski open set,{} defined as the complement of the common zeros of a polynomial \spad{f} (the defining polynomial for the inequation). This domain provides simplification of a user-given representation using groebner basis computations. There are two simplification routines: the first function \spadfun{idealSimplify} uses groebner basis of ideals alone,{} while the second,{} \spadfun{simplify} uses both groebner basis and factorization. The resulting defining equations \spad{L} always form a groebner basis,{} and the resulting defining inequation \spad{f} is always reduced. The function \spadfun{simplify} may be applied several times if desired. A third simplification routine \spadfun{radicalSimplify} is provided in \spadtype{QuasiAlgebraicSet2} for comparison study only,{} as it is inefficient compared to the other two,{} as well as is restricted to only certain coefficient domains. For detail analysis and a comparison of the three methods,{} please consult the reference cited. \blankline A polynomial function \spad{q} defined on the quasi-algebraic set is equivalent to its reduced form with respect to \spad{L}. While this may be obtained using the usual normal form algorithm,{} there is no canonical form for \spad{q}. \blankline The ordering in groebner basis computation is determined by the data type of the input polynomials. If it is possible we suggest to use refinements of total degree orderings.
48467`\spadtype{Quaternion} implements Hamilton quaternions \indented{2}{over a commutative ring.}
48540`This domain implements simple database queries
48612`Linked List implementation of a Queue
48683`Function field defined by \spad{y^n} = \spad{f}(\spad{x}).
48923`This domain allows rational numbers to be presented as repeating decimal expansions or more generally as repeating expansions in any base.
49013`This domain implements the real closure of an ordered field.
49106`\spad{Record(a:A,b:B,...,c:C)} is a primitive type in FriCAS 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}.
49158`\spadtype{RectangularMatrix} is a matrix domain where the number of rows and the number of columns are parameters of the domain.
49348`\indented{1}{\spadtype{Reference} is for making a changeable instance} of something.
49401`A domain for regular chains (\spadignore{i.e.} regular triangular sets) over a \spad{Gcd}-Domain and with a fix list of variables. This is just a front-end for the \spadtype{RegularTriangularSet} domain constructor.
49637`This domain provides an implementation of regular chains. Moreover,{} the operation \spadopFrom{zeroSetSplit}{RegularTriangularSetCategory} is an implementation of a new algorithm for solving polynomial systems by means of regular chains.\newline
49826`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
50022`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.
50090`Rules for the pattern matcher.
50218`\spadtype{RightOpenIntervalRootCharacterization} provides work with interval root coding.
50441`\spadtype{RomanNumeral} provides functions for converting \indented{1}{integers to roman numerals.}
50507`This domain implements named rules
50575`A ruleset is a set of pattern matching rules grouped together.
50702`\indented{1}{Domain for representing points,{} vectors,{} subspaces and properties} of components in a subspace as complex numbers
50759`\indented{1}{SBoundary implements boundaries for use in scene graph} This defines the outer extent of the scene,{} or of an element in the scene,{} or of some branch in the scene. The difference between this boundary and an \spad{n}-dimensional surface,{} such as IFS,{} is that boundary must always have a well defined inside and an outside. SBoundary does not necessarily follow the exact outer contours of the shape but just constructs a simple boundary shape where all points of the shape are guaranteed to be inside the boundary. Currently there are the following boundary forms: \indented{1}{Simple types:} \indented{2}{"box"::Symbol which is a \spad{n}-dimensional axis-aligned rectangle.} \indented{2}{"ellipoid"::Symbol which is a \spad{n}-dimensional axis-aligned ellipse.} \indented{1}{Compound types:} \indented{2}{This is a combination of simple and other compound types such} \indented{2}{as union or intersection.} \indented{3}{"union"::Symbol represents union of supplied list} \indented{3}{"intersection"::Symbol represents intersection of supplied list} \indented{1}{Null types:} \indented{2}{"none" is used for a node which does not have a boundary in} \indented{6}{space,{} for example,{} when the boundary of a material node} \indented{6}{is requested.} The uses of SBoundary are: 1) So we know how much to scale a given scene to fit in a \indented{3}{given size.} 2) So that we know where to terminate arrows going in out out of \indented{3}{of the shape.} 3) To detect if objects intersect (collision detect),{} or if one \indented{3}{object is contained completely inside another.}
50815`an implementation of PointCategory to represent points and vectors in three dimensional coordinate space
50881`\indented{1}{these are the parameters that can be set for nodes of} various types
50932`Generates various surfaces (2 dimensional subsets of 3D space). When 1 dimensional subspace (a line) needs to be represented in a 3D editor then we convert the line into a tube. Many of the functions here are from NumericTubePlot and related packages. However \spad{I} needed them to be defined over SPointCategory so \spad{I} adapted them here.
50986`Associates points or nodes in Scene structure with names (or a hierarchy of names). The aim is,{} where a point or node is used in several different constructions,{} it only needs to be specified once.
51065`\indented{1}{number of base dimensions (excluding point at infinity and point} at origin)
51142`This type is used to specify a range of values from type \spad{S}.
51207`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.
51269`A domain for infinite sequences over a commutative ring. It is implemented as stream with arithmetics.
51338`\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
51548`\spadtype{OrderlyDifferentialVariable} adds a commonly used sequential ranking to the set of derivatives of an ordered list of differential indeterminates. A sequential ranking is a ranking \spadfun{<} of the derivatives with the property that for any derivative \spad{v},{} there are only a finite number of derivatives \spad{u} with \spad{u} \spadfun{<} \spad{v}. This domain belongs to \spadtype{DifferentialVariableCategory}. It defines \spadfun{weight} to be just \spadfun{order},{} and it defines a sequential ranking \spadfun{<} on derivatives \spad{u} by the lexicographic order on the pair (\spadfun{variable}(\spad{u}),{} \spadfun{order}(\spad{u})).
51647`A set over a domain \spad{S} models the usual mathematical notion of a finite set of elements from \spad{S}. 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. If \spad{S} has OrderdSet,{} \Language{} maintains the entries in sorted order. Specifically,{} the parts function returns the entries as a list in ascending order and the \spadfun{extract!} operation returns the maximum entry. Given two sets \spad{s} and \spad{t} where \spad{\#s = m} and \spad{\#t = n},{} the complexity of \indented{2}{\spad{s = t} is \spad{O(min(n,{} m))}} \indented{2}{\spad{s < t} is \spad{O(max(n,{} m))}} \indented{2}{\spad{union(s,{} t)},{} \spad{intersect(s,{} t)},{} \spad{minus(s,{} t)},{} \spad{symmetricDifference(s,{} t)} is \spad{O(max(n,{} m))}} \indented{2}{\spad{member?(x,{} t)} is \spad{O(n log n)}} \indented{2}{\spad{insert!(x,{} t)} and \spad{remove!(x,{} t)} is \spad{O(n)}}
51708`\spadtype{SetOfMIntegersInOneToN} implements the subsets of \spad{M} integers in the interval \spad{[1..n]}
51807`This domain allows the manipulation of the usual Lisp values.
51895`This domain allows the manipulation of Lisp values over arbitrary atomic types.
52045`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{R},{} while the last argument specifies the defining minimal polynomial. The elements of the domain are canonically represented as polynomials of degree less than that of the minimal polynomial with coefficients in \spad{R}. The second argument is both the type of the third argument and the underlying representation used by \spadtype{SAE} itself.
52339`\spadtype{SimpleFortranProgram} provides a simple model of some FORTRAN subprograms,{} making it possible to coerce objects of various domains into a FORTRAN subprogram called \spad{f}. These can then be translated into legal FORTRAN code.
52454`SingleInteger is intended to support machine integer arithmetic.
52520`\indented{1}{This trivial domain let us build Univariate Polynomials} in an anonymous variable.
52585`This domain implements SKI combinators. Ski combinators were introduced by Moses Schoenfinkel and Haskell Curry with the aim of eliminating the need for variables in mathematical logic. It is equivalent to lambda calculus but it can be used for doing,{} without variables,{} anything that would require variables in other systems.
52657`SmallOrdinal implements ordinal numbers up to \spad{epsilon_0}. \spad{+} and \spad{*} are "natural" addition and multiplication of ordinals. Available separately are "ordered" operataions.
52723`\indented{1}{Domain for storing information about structure of polynomials} as vectors of exponents
52807`\spad{SparseEchelonMatrix(C,{} D)} implements sparse matrices whose columns are enumerated by the \spadtype{OrderedSet} \spad{C} and whose entries belong to the \spadtype{GcdDomain} \spad{D}. The basic operation of this domain is the computation of an row echelon form. The algorithm used tries to maintain the sparsity and is especially adapted to matrices which are already close to a row echelon form.
52904`\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.
53208`SparseMultivariateSkewPolynomial(\spad{R},{} Var,{} sigma,{} delta) defines a mutivariate Ore ring over \spad{R} in variables from \spad{V}. \spad{sigma(v)} gives automorphism of \spad{R} corresponding to variable \spad{v} and \spad{delta(v)} gives corresponding derivative. \blankline
53415`This domain provides multivariate Taylor series with variables from an arbitrary ordered set. A Taylor series is represented by a stream of polynomials from the polynomial domain \spad{SMP}. The \spad{n}th element of the stream is a form of degree \spad{n}. SMTS is an internal domain.
53614`A sparse table has a default entry,{} which is returned if no other value has been explicitly stored for a key.
53715`Sparse Laurent series in one variable \indented{2}{\spadtype{SparseUnivariateLaurentSeries} is a domain representing Laurent} \indented{2}{series in one variable with coefficients in an arbitrary ring.\space{2}The} \indented{2}{parameters of the type specify the coefficient ring,{} the power series} \indented{2}{variable,{} and the center of the power series expansion.\space{2}For example,{}} \indented{2}{\spad{SparseUnivariateLaurentSeries(Integer,{} x,{} 3)} represents Laurent} \indented{2}{series in \spad{(x - 3)} with integer coefficients.}
53912`This domain represents univariate polynomials over arbitrary (not necessarily commutative) coefficient rings. The variable is unspecified so that the variable displays as \spad{?} in 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.
54022`Sparse Puiseux series in one variable \indented{2}{\spadtype{SparseUnivariatePuiseuxSeries} is a domain representing Puiseux} \indented{2}{series in one variable with coefficients in an arbitrary ring.\space{2}The} \indented{2}{parameters of the type specify the coefficient ring,{} the power series} \indented{2}{variable,{} and the center of the power series expansion.\space{2}For example,{}} \indented{2}{\spad{SparseUnivariatePuiseuxSeries(Integer,{} x,{} 3)} represents Puiseux} \indented{2}{series in \spad{(x - 3)} with \spadtype{Integer} coefficients.}
54221`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}.
54366`Sparse Taylor series in one variable \indented{2}{\spadtype{SparseUnivariateTaylorSeries} is a domain representing Taylor} \indented{2}{series in one variable with coefficients in an arbitrary ring.\space{2}The} \indented{2}{parameters of the type specify the coefficient ring,{} the power series} \indented{2}{variable,{} and the center of the power series expansion.\space{2}For example,{}} \indented{2}{\spadtype{SparseUnivariateTaylorSeries}(Integer,{} \spad{x},{} 3) represents Taylor} \indented{2}{series in \spad{(x - 3)} with \spadtype{Integer} coefficients.}
54503`\indented{2}{This type represents the finite direct or cartesian product of an} underlying ordered component type. The vectors are ordered as if they were split into two blocks. The \spad{dim1} parameter specifies the length of the first block. The ordering is lexicographic between the blocks but acts like \spadtype{HomogeneousDirectProduct} within each block. This type is a suitable third argument for \spadtype{GeneralDistributedMultivariatePolynomial}.
54662`This domain exports a modest implementation for the vertices of splitting trees. These vertices are called here splitting nodes. Every of these nodes store 3 informations. The first one is its value,{} that is the current expression to evaluate. The second one is its condition,{} that is the hypothesis under which the value has to be evaluated. The last one is its status,{} that is a boolean flag which is \spad{true} iff the value is the result of its evaluation under its condition. Two splitting vertices are equal iff they have the sane values and the same conditions (so their status do not matter).
54773`This domain exports a modest implementation of splitting trees. Splitting 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 for a splitting tree \spad{a} when \spad{status(value(a))} is \spad{true}. Thus,{} if for the splitting tree \spad{a} the flag \spad{status(value(a))} is \spad{true},{} then \spad{status(value(d))} is \spad{true} for any subtree \spad{d} of \spad{a}. This property of splitting trees is called the termination condition. If no vertex in a splitting tree \spad{a} is equal to another,{} \spad{a} is said to satisfy the no-duplicates condition. The splitting tree \spad{a} will satisfy this condition if nodes are added to \spad{a} by means of \spad{splitNodeOf!} and if \spad{construct} is only used to create the root of \spad{a} with no children.
54911`This domain provides an implementation of square-free regular chains. Moreover,{} the operation \spadopFrom{zeroSetSplit}{SquareFreeRegularTriangularSetCategory} is an implementation of a new algorithm for solving polynomial systems by means of regular chains.\newline
55121`\spadtype{SquareMatrix} is a matrix domain of square matrices,{} where the number of rows (= number of columns) is a parameter of the type.
55289`Linked List implementation of a Stack
55360`\indented{1}{Domains for transform from SPoint to SPoint} STransform transform domain can by used to represent linear transforms for instance when working with SCartesian where its Representation is a matrix of DoubleFloat Other transform domains may not necessarily be linear and will have different representations
55414`A stream is an implementation of a possibly infinite sequence using a list of terms that have been computed and a function closure to compute additional terms when needed.
55485`This is the domain of character strings.
55541`This domain provides tables where the keys are strings. A specialized hash function for strings is used.
55627`Implementation of subset logic. \indented{3}{implements pseudo complement} \indented{3}{subset of powerset} \indented{3}{related to 'containment order'} \indented{3}{REP holds a single node and complete set (representing 'top')} Date Created: Oct 2015
55711`This domain \undocumented
55795`This domain implements some global properties of subspaces.
55869`This domain implements "such that" forms
55955`This domain builds representations of boolean expressions for use with the \spadtype{FortranCode} domain.
56020`Basic and scripted symbols.
56072`Create and manipulate a symbol table for generated FORTRAN code
56142`This domain implements symmetric polynomial
56241`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}
56339`The tableau domain is for printing Young tableaux,{} and coercions to and from List List \spad{S} where \spad{S} is a set.
56420`\spadtype{TaylorSeries} is a general multivariate Taylor series domain over the ring Coef and with variables of type Symbol.
57609`Tensor powers of a free module over a commutative ring. It is represented as a free module over the cartesian power of the basis.
57767`Tensor product of free modules over a commutative ring. It is represented as a free module over the direct product of the respective bases. The factor domains must provide operations \spad{listOfTerms},{} whose result is assumed to be stored in reverse order.
57962`\spadtype{TexFormat} provides a coercion from \spadtype{OutputForm} to \TeX{} format. The particular dialect of \TeX{} used is \LaTeX{}. The basic object consists of three parts: a prologue,{} a tex part and an epilogue. The functions \spadfun{prologue},{} \spadfun{tex} and \spadfun{epilogue} extract these parts,{} respectively. The main guts of the expression go into the tex part. The other parts can be set (\spadfun{setPrologue!},{} \spadfun{setEpilogue!}) so that contain the appropriate tags for printing. For example,{} the prologue and epilogue might simply contain \spad{``}\verb+\spad{\[}+\spad{''} and \spad{``}\verb+\spad{\]}+\spad{''},{} respectively,{} so that the TeX section will be printed in LaTeX display math mode.
58015`\spadtype{TexmacsFormat} provides a coercion from \spadtype{OutputForm} to TeXmacs format.
58075`This domain provides an implementation of text files. Text is stored in these files using the native character set of the computer.
58150`Creates and manipulates one global symbol table for FORTRAN code generation,{} containing details of types,{} dimensions,{} and argument lists.
58221`This domain represents three dimensional matrices over a general object type
58313`ThreeDimensionalViewport creates viewports to display graphs
58384`The domain ThreeSpace is used for creating three dimensional objects using functions for defining points,{} curves,{} polygons,{} constructs and the subspaces containing them.
58448`\spadtype{Tree(S)} is a basic domain of tree structures. Each tree is either empty or has a {\it node} consisting of a value and a list of (sub)trees.
58521`\indented{2}{Package for constructing tubes around 3-dimensional parametric curves.} Domain of tubes around 3-dimensional parametric curves.
58590`This domain is used to interface with the interpreter\spad{'s} notion of comma-delimited sequences of values.
58667`\indented{1}{A TwoDimensionalArray is a two dimensional array with} 1-based indexing for both rows and columns.
58795`TwoDimensionalViewport creates viewports to display graphs.
58864`Typed represents an typed variable in Lambda and Ski domains,{} a variable has a name represented by a String and a type represented by intutionistic logic.
58900`This is a low-level domain which implements matrices (two dimensional arrays) of unsigned 16-bit integers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
58978`This is a low-level domain which implements vectors (one dimensional arrays) of unsigned 16-bit numbers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
59050`This is a low-level domain which implements matrices (two dimensional arrays) of unsigned 32-bit integers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
59128`This is a low-level domain which implements vectors (one dimensional arrays) of unsigned 32-bit numbers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
59200`Domain of unsigned 64-bit integers. It is used \indented{1}{to declare that values of local variables fit into 64 bits.}
59246`This is a low-level domain which implements matrices (two dimensional arrays) of unsigned 8-bit integers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
59320`This is a low-level domain which implements vectors (one dimensional arrays) of unsigned 8-bit numbers. Indexing is 0 based,{} there is no bound checking (unless provided by lower level).
59390`allows us to model graph theory \blankline
59469`\spad{Union(A,B,...,C)} is a primitive type in FriCAS used to represent objects of type \spad{A} or of type \spad{B} or...or of type \spad{C}.
59615`Dense Laurent series in one variable \indented{2}{\spadtype{UnivariateLaurentSeries} is a domain representing Laurent} \indented{2}{series in one variable with coefficients in an arbitrary ring.\space{2}The} \indented{2}{parameters of the type specify the coefficient ring,{} the power series} \indented{2}{variable,{} and the center of the power series expansion.\space{2}For example,{}} \indented{2}{\spad{UnivariateLaurentSeries(Integer,{} x,{} 3)} represents Laurent series in} \indented{2}{\spad{(x - 3)} with integer coefficients.}
59799`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)}.
59972`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.
60073`Dense Puiseux series in one variable \indented{2}{\spadtype{UnivariatePuiseuxSeries} is a domain representing Puiseux} \indented{2}{series in one variable with coefficients in an arbitrary ring.\space{2}The} \indented{2}{parameters of the type specify the coefficient ring,{} the power series} \indented{2}{variable,{} and the center of the power series expansion.\space{2}For example,{}} \indented{2}{\spad{UnivariatePuiseuxSeries(Integer,{} x,{} 3)} represents Puiseux series in} \indented{2}{\spad{(x - 3)} with \spadtype{Integer} coefficients.}
60259`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)}.
60434`UnivariatePuiseuxSeriesWithExponentialSingularity is a domain used to represent functions with essential singularities. Objects in this domain are sums,{} where each term in the sum is a univariate Puiseux series times the exponential of a univariate Puiseux series. Thus,{} the elements of this domain are sums of expressions of the form \spad{g(x) * exp(f(x))},{} where \spad{g}(\spad{x}) is a univariate Puiseux series and \spad{f}(\spad{x}) is a univariate Puiseux series with no terms of non-negative degree.
60722`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}.
60869`Dense Taylor series in one variable \spadtype{UnivariateTaylorSeries} is a domain representing Taylor series in one variable with coefficients in an arbitrary ring. The parameters of the type specify the coefficient ring,{} the power series variable,{} and the center of the power series expansion. For example,{} \spadtype{UnivariateTaylorSeries}(Integer,{} \spad{x},{} 3) represents Taylor series in \spad{(x - 3)} with \spadtype{Integer} coefficients.
60999`This domain provides segments which may be half open. That is,{} ranges of the form \spad{a..} or \spad{a..b}.
61076`Untyped represents an untyped variable in Lambda and Ski domains,{} a variable has a name represented by a String.
61116`This domain implements variables
61184`This type represents vector like objects with varying lengths and indexed by a finite segment of integers starting at 1.
61250`This domain supports modular methods based on \indented{1}{evaluation and rational reconstruction.\space{2}Each evaluation} \indented{1}{is done modulo machine sized prime \spad{p}.\space{2}Both Chinese} \indented{1}{remaindering and (linear) Hensel lift are supported.} \indented{1}{Once enough evaluations are known rational reconstruction} \indented{1}{produces vector of rational numbers or integers.}
61306`This domain supports modular methods based on \indented{1}{evaluation and rational reconstruction.\space{2}All computation} \indented{1}{are done on polynomials modulo machine sized prime \spad{p} \spad{--} \spad{p} must} \indented{1}{be chosen small enough to avoid overflow in intermediate} \indented{1}{calculations. Each evaluation is supposed to produce vector of} \indented{1}{values. Once enough evaluations are known rational reconstruction} \indented{1}{produces vector of rational functions or multivariate polynomials.}
61362`The domain \spad{VectorSpaceBasis F} implements subspaces of finite dimensional vector spaces over a field \spad{F}. A subspace is represented by a list of linearly independent coordinate vectors which constitute a basis. The empty list represents the space of dimension 0.
61432`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.
61463`allows us to model weighted graphs This graph assigns a weight to each arrow. This is used when calculating say,{} lowest 'cost' routes. An arrow with a higher weight is more 'costly' in some way and therefore we try to choose the minimum weight. For arrows in series the overall weight is the sum of the individual weights. For arrows in parallel the overall weight is the minimum of the individual weights. \spad{I} may change this in future to allow different cost metrics to be plugged in. \blankline
61564`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.
61787`A domain constructor of the category \spadtype{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 \spadopFrom{construct}{WuWenTsunTriangularSet} operation does not check the previous requirement. Triangular sets are stored as sorted lists with respect to 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
61976`\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.
62078`An implementation of a hash table that uses equality of the key domain to decide upon equality of keys.
62181`This package provides support for \spad{XML} files \spad{XML} attributes are inside the opening tag: <tagname attributes> and usually have the form: name=value
62221`This package provides support for \spad{XML} files an \spad{XML} element is something which either has the form: <tagname attributes> content </tagname> or <tagname attributes/> where content may be a sequence of sub-elements or unstructured text
62259`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.\spad{fr}).
62374`\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.
62452`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.
62536`\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.
62882`bottom (\spad{false} in logic).
63525`The complement or inverse of a graph is a graph on the same vertices such that there is an arrow if and only if there is not an arrow in its compliment. That is,{} it is the compliment of the arrows but is not the set complement. for more information see: http://en.wikipedia.org/wiki/Complement_graph
63565`\spad{~(x)} returns the logical complement of \spad{x}. TODO not sure if complement should be included here? intuitionistic logic can have complement but has different axioms to complement in Boolean algebra. Equivalent capability can be provided by implication.
63595`The complement or inverse of a graph is a graph on the same vertices such that there is an arrow if and only if there is not an arrow in its compliment. That is,{} it is the compliment of the arrows but is not the set complement. for more information see: http://en.wikipedia.org/wiki/Complement_graph
63640`\spad{- f} creates the equivalent prefix form.
63674`\spad{\#(x)} returns the number of elements in tuple \spad{x}
63723`\spad{\# p} returns the number of terms in \spad{p}.
64237`\spad{- a} returns the power series negative of \spad{a}: \spad{- [a0,{} a1,{} ...] = [- a0,{} - a1,{} ...]}
64308`\spad{-x} is the additive inverse of \spad{x}.
64344`\spad{-g} is the additive inverse of \spad{g} in the module of elements of the same grade as \spad{g}.
64385`\spad{~(x)} returns the logical complement of \spad{x}.
64414`\spad{-x} returns the negative of the matrix \spad{x}.
64482`\spad{-x} negates all components of the vector \spad{x}.
64542`reverse,{} complement,{} canonical dual basis
64649`\spad{~ n} returns the bit-by-bit logical {\em not} of the single integer \spad{n}.
64686`\spad{\#((a1,{} ...,{} an))} returns \spad{n}.
64752`\spad{\#(u)} returns the number of elements in \spad{u}.
65749`\spad{a / d} divides the element \spad{a} by \spad{d}.
65792`\spad{r * a} returns the power series scalar multiplication of \spad{r} by \spad{a}: \spad{r * [a0,{} a1,{} ...] = [r * a0,{} r * a1,{} ...]}
65865`\spad{jv1 > jv2} checks whether \spad{jv1} is greater than \spad{jv2} in the internal ordering.
65914`return \spad{true} if equal,{} that is names are equal and if there is a type then they must also be equal
65952`\spad{x=y} tests for equality
66001`returns \spad{true} (boolean \spad{true}) if Intuitionistic Logic values are the same. Translates from Intuitionistic Logic to Boolean Logic
66039`return \spad{true} if equal (deep search) that is: all terms at all levels in tree must be alpha-equivalent to return \spad{true} That is the names,{} but not the deBruijn index,{} of the bound variables can be different. beta-equivalence is not implemented because it is not decidable.
66081`returns \spad{true} (boolean \spad{true}) if intuitionisticLogic values are the same. Translates from Intuitionistic Logic to Boolean Logic
66131`returns \spad{true} (boolean \spad{true}) if intuitionisticLogic values are the same. Translates from Intuitionistic Logic to Boolean Logic
66181`\spad{p = q} entrywise equality.
66246`\spad{a=b} tests if \spad{a} and \spad{b} are the same pointer/reference.
66290`return \spad{true} if equal (deep search) that is: all terms at all levels in tree must be equal to return \spad{true} all terms must be exactly equal,{} not just equivalent,{} that is SKK=I will return \spad{false} even though 'SKK' and 'I' have the same effect
66340`\spad{x+y} computes sum of \spad{x} and \spad{y},{} that is disjoint union of nodes with arrows from appropriate input
66380`returns the logical 'join',{} \spadignore{e.g.} 'or'.
66422`returns the logical 'meet',{} \spadignore{e.g.} 'and'.
66464`\spad{c*x} returns the product of \spad{c} and the series \spad{x}.
66516`\spad{x*c} returns the product of \spad{c} and the series \spad{x}.
66630`+(\spad{x},{} \spad{y}) gives addition add the corresponding elements of the vector or point. The type (vector or point) depends on the following table: vector + vector = vector point + vector = point point + point = invalid (but interpret as vector) Although,{} adding two points is not strictly a valid operation,{} we allow it here by interpreting the point as a vector relative to the origin. We do that because there are some useful short cuts,{} for instance,{} to find the central point between two points we can add them together and scalar multiply by 0.5.
66670`\spad{-(x,{} y)} gives subtraction subtract the corresponding elements of the vector or point. The type (vector or point) depends on the following table: vector - vector = vector point - vector = point vector - point = invalid (but interpret as point) point - point = invalid (but interpret as vector) Although,{} subtracting two points is not strictly a valid operation,{} we allow it here by interpreting the result as the vector distance between the two points.
66710`\spad{d*exp} is provided mainly for internal use,{} as basically all calculations should be performed within \spadtype{JetLazyFunction}.
66757`\spad{f / g} computes \spad{f} * \spad{g^}-1 for nonzero element \spad{g}.
66809`\spad{x*y} returns the tree \spad{[x,{} y]}.
66852`\spad{x * y} is the product of the matrices \spad{x} and \spad{y}. Error: if the dimensions are incompatible.
66899`\spad{x + y} is the sum of the matrices \spad{x} and \spad{y}. Error: if the dimensions are incompatible.
66946`\spad{a * b} returns the input form corresponding to \spad{a * b}.
66981`\spad{a + b} returns the input form corresponding to \spad{a + b}.
67016`\spad{a / b} returns the input form corresponding to \spad{a / b}.
67051`\spad{"*"}(a,{}\spad{b}) returns a tensor product : the tensor product \spad{G*H} of graphs \spad{G} and \spad{H} is a graph such that the vertex set of \spad{G*H} is the Cartesian product \spad{V}(\spad{G}) \times \spad{V}(\spad{H}); and any two vertices (\spad{u},{} u') and (\spad{v},{} \spad{v'}) are adjacent in \spad{G} \times \spad{H} if and only if u' is adjacent with \spad{v'} and \spad{u} is adjacent with \spad{v}.
67119`*(\spad{s},{} \spad{x}) gives scalar multiplication Although,{} scalar multiplication is strictly only a valid operation for vectors and not points,{} we allow it here because there are some useful short cuts,{} for instance,{} to find the central point between two points we can add them together and scalar multiply by 0.5.
67169`\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}.
67252`\spad{f * g} creates the equivalent infix form.
67288`\spad{f + g} creates the equivalent infix form.
67324`\spad{f - g} creates the equivalent infix form.
67360`\spad{f / g} creates the equivalent infix form.
67396`\spad{f <= g} creates the equivalent infix form.
67433`\spad{f < g} creates the equivalent infix form.
67469`\spad{f = g} creates the equivalent infix form.
67505`\spad{f >= g} creates the equivalent infix form.
67542`\spad{f > g} creates the equivalent infix form.
67578`\spad{f ^ g} creates the equivalent infix form.
67614`\spad{f ~= g} creates the equivalent infix form.
67651`\spad{a * b} returns the pattern \spad{a * b}.
67687`\spad{a + b} returns the pattern \spad{a + b}.
67723`\spad{a / b} returns the pattern \spad{a / b}.
67759`\spad{a ^ b} returns the pattern \spad{a ^ b}.
67795`\spad{o1^o2} returns \spad{o1} to power \spad{o2},{} where power is inductively defined using successive natural multiplication from the left
67833`\spad{b1*b2} computes a basis of the intersection of two subspaces.
67878`\spad{B1+B2} computes a basis of the sum of two subspaces.
67923`\spad{alpha + f} adds the scalar alpha to \spad{f}.
67975`\spad{alpha - f} adds the scalar alpha to \spad{-f}.
68027`\spad{alpha / f} computes alpha / \spad{f} for nonzero \spad{f}.
68079`\spad{f + alpha} adds the scalar alpha to \spad{f}.
68131`\spad{f / alpha} computes \spad{f} / alpha for nonzero alpha.
68183`\spad{f - alpha} subtracts the scalar alpha from \spad{f}.
68235`\spad{a ^ b} returns the formal exponential a^b.
68287`\spad{x ^ q} is \spad{x} raised to the rational power \spad{q}.
68823`tensor product : the tensor product \spad{G*H} of graphs \spad{G} and \spad{H} is a graph such that the vertex set of \spad{G*H} is the Cartesian product \spad{V}(\spad{G}) \times \spad{V}(\spad{H}); and any two vertices (\spad{u},{} u') and (\spad{v},{} \spad{v'}) are adjacent in \spad{G} \times \spad{H} if and only if u' is adjacent with \spad{v'} and \spad{u} is adjacent with \spad{v}. Cartesian product does apply to function graph produces two arrows out of every node
68891`\spad{f^n} returns \spad{f^n}.
68949`\spad{x*i} returns the product of integer \spad{i} and the series \spad{x}.
69004`\spad{a ^ b} returns the input form corresponding to \spad{a ^ b}.
69747`\spad{L*A} implements left multiplication with a usual matrix.
69805`\spad{f * U} column transformation
69865`\spad{T * f} row transformation
69925`\spad{L*A} implements left multiplication with a usual matrix over the quotient field of \spad{D}.
70014`\spad{p * U} column transformation ...
70081`\spad{T * P} row transformation ...
70148`\spad{x ^ n} computes the \spad{n}-th power of a square matrix. The power \spad{n} is assumed greater than 1.
70242`\spad{m / d} divides the element \spad{m} by \spad{d}.
70281`tensor product : the tensor product \spad{G*H} of graphs \spad{G} and \spad{H} is a graph such that the vertex set of \spad{G*H} is the Cartesian product \spad{V}(\spad{G}) \times \spad{V}(\spad{H}); and any two vertices (\spad{u},{} u') and (\spad{v},{} \spad{v'}) are adjacent in \spad{G} \times \spad{H} if and only if u' is adjacent with \spad{v'} and \spad{u} is adjacent with \spad{v}.
70359`\spad{x ^ n} computes a non-negative integral power of the matrix \spad{x}. Error: if the matrix is not square.
70423`\spad{a ^ b} returns the input form corresponding to \spad{a ^ b}.
70475`\spad{a ^ n} returns the pattern \spad{a ^ n}.
71266`\spad{p*x} \undocumented
71331`\spad{\pi * A} permutes the indices and the matrix according to the permutation \spad{\pi}.
71397`\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}.
71487`\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}.
71577`\spad{x^k} constructs the distribution of the \spad{k}th power of the random variable with distribution \spad{X} by picking every \spad{k}-th moment.
71640`\spad{f^n} returns \spad{f^n}.
72463`\spad{r*x} is the left scalar multiple of the scalar \spad{r} and the matrix \spad{x}.
72510`\spad{r*x} is the left scalar multiple of the scalar \spad{r} and the matrix \spad{x}.
72557`\spad{x / d} divides the element \spad{x} by \spad{d}.
72600`\spad{x / d} divides the element \spad{x} by \spad{d}.
72639`\spad{p/r} returns \spad{p*(1/r)}.
72697`\spad{p*r} returns the product of \spad{p} by \spad{r}.
72796`\spad{r*b} returns the product of \spad{r} by \spad{b}.
73520`\spad{s * x} returns the product of \spad{x} by \spad{s} on the left.
73558`\spad{x * s} returns the product of \spad{x} by \spad{s} on the right.
73596`\spad{s * x} returns the product of \spad{x} by \spad{s} on the left.
73635`\spad{x * s} returns the product of \spad{x} by \spad{s} on the right.
74307`\spad{s ^ n} returns the product of \spad{s} by itself \spad{n} times.
74916`\spad{smp*ts} multiplies a TaylorSeries \spad{ts} by a monomial \spad{smp}.
74988`\spad{s ^ n} returns the product of \spad{s} by itself \spad{n} times.
75985`\spad{s*r} returns the product \spad{r*s} used by \spadtype{XRecursivePolynomial}
78884`\spad{a * r} returns the power series scalar multiplication of \spad{a} by \spad{r:} \spad{[a0,{} a1,{} ...] * r = [a0 * r,{} a1 * r,{} ...]}
78957`\spad{a * b} returns the power series (Cauchy) product of \spad{a} and \spad{b:} \spad{[a0,{} a1,{} ...] * [b0,{} b1,{} ...] = [c0,{} c1,{} ...]} where \spad{ck = sum(i + j = k,{} \spad{ai} * bk)}.
79038`\spad{a - b} returns the power series difference of \spad{a} and \spad{b}: \spad{[a0,{} a1,{} ..] - [b0,{} b1,{} ..] = [a0 - b0,{} a1 - b1,{} ..]}
79119`\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.
79200`\spad{a + b} returns the power series sum of \spad{a} and \spad{b}: \spad{[a0,{} a1,{} ..] + [b0,{} b1,{} ..] = [a0 + b0,{} a1 + b1,{} ..]}
79281`\spad{a * b} returns the power series (Cauchy) product of \spad{a} and \spad{b:} \spad{[a0,{} a1,{} ...] * [b0,{} b1,{} ...] = [c0,{} c1,{} ...]} where \spad{ck = sum(i + j = k,{} binomial(k,{} i) * \spad{ai} * bj)}.
79379`\spad{st1 ^ st2} computes the power of a power series \spad{st1} by another power series \spad{st2}.
79473`\spad{st1 ^ st2} computes the power of a power series \spad{st1} by another power series \spad{st2}.
79581`\spad{s ^ r} raises a Laurent series \spad{s} to a rational power \spad{r}
79698`tensor product : the tensor product \spad{G*H} of graphs \spad{G} and \spad{H} is a graph such that the vertex set of \spad{G*H} is the Cartesian product \spad{V}(\spad{G}) \times \spad{V}(\spad{H}); and any two vertices (\spad{u},{} u') and (\spad{v},{} \spad{v'}) are adjacent in \spad{G} \times \spad{H} if and only if u' is adjacent with \spad{v'} and \spad{u} is adjacent with \spad{v}.
79863`\spad{x/y} division (only works if minimum weight of divisor is zero,{} and if \spad{R} is a Field)
79964`\spad{z ^ r} raises a Puiseaux series \spad{z} to a rational power \spad{r}
80090`\spad{x^n} \undocumented{} See \spadfunFrom{^}{DivisionRing}
80174`\spad{x/y} \undocumented{} See \spadfunFrom{/}{Field}
80261`\spad{x*y} \undocumented{} See \spadfunFrom{*}{SemiGroup}
80348`tensor product : the tensor product \spad{G*H} of graphs \spad{G} and \spad{H} is a graph such that the vertex set of \spad{G*H} is the Cartesian product \spad{V}(\spad{G}) \times \spad{V}(\spad{H}); and any two vertices (\spad{u},{} u') and (\spad{v},{} \spad{v'}) are adjacent in \spad{G} \times \spad{H} if and only if u' is adjacent with \spad{v'} and \spad{u} is adjacent with \spad{v}.
80420`\spad{f^n} is the function which is the \spad{n}-fold application \indented{1}{of \spad{f}.}
80491`\spad{f*g} is the function \spad{h} \indented{1}{such that \spad{h x= f(g x)}.}
80554`\spad{x = y} tests if \spad{x} and \spad{y} are equal.
80595`\spad{x~=y} tests if \spad{x} and \spad{y} are not equal.
80637`\spad{x >= y} is a greater than or equal test.
80682`\spad{x > y} is a greater than test.
80726`\spad{x <= y} is a less than or equal test.
80771`\spad{x < y} is a less than test.
80815`\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.
80869`\spad{gp1 < gp2} returns \spad{true} if and only if {\em gp1} is a proper subgroup of {\em gp2}.
80920`\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}.
80972`\spad{x-y} is the difference of \spad{x} and \spad{y} \spadignore{i.e.} \spad{x + (-y)}.
81010`\spad{x+y} computes the sum of \spad{x} and \spad{y}.
81052`\spad{x^y} returns \spad{x} to the power \spad{y}.
81104`\spad{x/y} divides the element \spad{x} by the element \spad{y}. Error: if \spad{y} is 0.
81135`\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.
81178`\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.
81221`\spad{x/y} is the same as \spad{x} times the inverse of \spad{y}.
81252`\spad{a*b} is the product of \spad{a} and \spad{b} in a set with a binary operation.
81283`\spad{x - y} is the difference of the matrices \spad{x} and \spad{y}. Error: if the dimensions are incompatible.
81353`\spad{x * y} is the product of the matrices \spad{x} and \spad{y}. Error: if the dimensions are incompatible.
81418`\spad{x + y} is the sum of the matrices \spad{x} and \spad{y}. Error: if the dimensions are incompatible.
81469`\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.
81549`\spad{x * c} is the product of the matrix \spad{x} and the column vector \spad{c}. Error: if the dimensions are incompatible.
81618`\spad{x * c} is the product of the matrix \spad{x} and the column vector \spad{c}. Error: if the dimensions are incompatible.
81684`\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.
81746`\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.
81812`\spad{x^y} returns \spad{\#(X^Y)} where \spad{X^Y} is defined \indented{1}{as \spad{\{g| g: Y->X\}}.}
81852`\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.
81906`Implement exterior grassmann product operator need to check precedence when used as an infix operator
81958`Implement regressive inner,{} meet product operator need to check precedence when used as an infix operator
82010`\spad{c1 + c2} additively mixes the two colors \spad{c1} and \spad{c2}.
82041`\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}
82078`\spad{db1+db2} returns the merge of databases \spad{db1} and \spad{db2}
82115`\spad{e1/e2} produces a new equation by dividing the left and right hand sides of equations \spad{e1} and \spad{e2}.
82225`\spad{s * c},{} returns the color \spad{c},{} whose weighted shade has been scaled by \spad{s}.
82266`\spad{I+J} computes the ideal generated by the union of \spad{I} and \spad{J}.
82329`\spad{I*J} computes the product of the ideal \spad{I} and \spad{J}.
82392`\spad{n} \spad{/\} \spad{m} returns the bit-by-bit logical {\em and} of the single integers \spad{n} and \spad{m}.
82432`\spad{n} \spad{\/} \spad{m} returns the bit-by-bit logical {\em or} of the single integers \spad{n} and \spad{m}.
82472`\spad{x/y} divides \spad{x} by the scalar \spad{y}.
82515`\spad{x ^ y} is the rational exponentiation of \spad{x} by the power \spad{y}.
82572`\spad{n*x} is the product of \spad{x} by the integer \spad{n}.
82616`\spad{x^n} returns \spad{x} raised to the integer power \spad{n}.
82660`\spad{x / i} computes the division from \spad{x} by an integer \spad{i}.
82711`\spad{x^n} returns \spad{x} raised to the integer power \spad{n}.
82748`\spad{n * x} is an integer multiple.
82824`\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.
82893`\spad{m^n} computes an integral power of the matrix \spad{m}. Error: if the matrix is not invertible.
82973`\spad{n * y} multiplies each component of the vector \spad{y} by the integer \spad{n}.
83041`\spad{op^n} \undocumented
83092`\spad{n * x} is left-multiplication by a non negative integer
83148`\spad{a^n} returns the \spad{n}\spad{-}th power of \spad{a},{} defined by repeated squaring.
83204`\spad{x ^ n} computes a non-negative integral power of the matrix \spad{x}. Error: if the matrix is not square.
83305`\spad{I^n} computes the \spad{n}th power of the ideal \spad{I}.
83385`\spad{t*p} applies the dhmatrix \spad{t} to point \spad{p}
83451`\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.
83507`\spad{a^n} returns the \spad{n}\spad{-}th power of \spad{a},{} defined by repeated squaring.
83552`\spad{s * c},{} returns the color \spad{c},{} whose weighted shade has been scaled by \spad{s}.
83597`\spad{p/c} divides \spad{p} by the coefficient \spad{c}.
83657`\spad{r * y} multiplies the element \spad{r} times each component of the vector \spad{y}.
83727`\spad{y * r} multiplies each component of the vector \spad{y} by the element \spad{r}.
83797`\spad{g*r} is right module multiplication.
83840`\spad{r*g} is left module multiplication.
83883`\spad{r*x} returns the left multiplication of the module element \spad{x} by the ring element \spad{r}.
83922`\spad{x/r} returns the division of \spad{x} by \spad{r}.
83973`\spad{m/r} divides the elements of \spad{m} by \spad{r}. Error: if \spad{r = 0}.
84036`\spad{r*x} is the left scalar multiple of the scalar \spad{r} and the matrix \spad{x}.
84101`\spad{x * r} is the right scalar multiple of the scalar \spad{r} and the matrix \spad{x}.
84166`\spad{m/r} divides the elements of \spad{m} by \spad{r}. Error: if \spad{r = 0}.
84244`\spad{x*r} returns the right multiplication of the module element \spad{x} by the ring element \spad{r}.
84284`\spad{r * y} multiplies the element \spad{r} times each component of the vector \spad{y}.
84343`\spad{y * r} multiplies each component of the vector \spad{y} by the element \spad{r}.
84402`\spad{x * r} returns the product of \spad{x} by \spad{r}. Useful if \spad{R} is a non-commutative Ring.
84446`\spad{r * x} is the product of the row vector \spad{r} and the matrix \spad{x}. Error: if the dimensions are incompatible.
84515`\spad{r * x} is the product of the row vector \spad{r} and the matrix \spad{x}. Error: if the dimensions are incompatible.
84581`\spad{(l..h)\spad{-i}} returns segment \spad{l-i .. h-i}.
84644`\spad{i+(l..h)} returns segment \spad{i+l .. i+h}.
84711`\spad{(l..h)\spad{+i}} returns segment \spad{l+i .. h+i}.
84778`\spad{eqn-x} produces a new equation by subtracting \spad{x} from both sides of equation eqn.
84834`\spad{x-eqn} produces a new equation by subtracting both sides of equation eqn from \spad{x}.
84890`\spad{eqn+x} produces a new equation by adding \spad{x} to both sides of equation eqn.
84950`\spad{x+eqn} produces a new equation by adding \spad{x} to both sides of equation eqn.
85010`\spad{eqn*x} produces a new equation by multiplying both sides of equation eqn by \spad{x}.
85063`\spad{x*eqn} produces a new equation by multiplying both sides of equation eqn by \spad{x}.
85116`\spad{p1/p2} returns the quotient of \spad{p1} and \spad{p2} as an element of \%.
85246`\spad{d1 / d2} returns the fraction \spad{d1} divided by \spad{d2}.
85296`\spad{a=b} creates an equation.
85333`\spad{x - y} returns an element \spad{z} such that \spad{z+y=x} or "failed" if no such element exists.
85389`\spad{p + x} returns the sum of \spad{p} and \spad{x}
85450`\spad{v * x} returns the product of a variable \spad{x} by \spad{x}.
85495`\spad{abelianGroup([n1,{} ...,{} nk])} constructs the abelian group that is the direct product of cyclic groups with order {\em \spad{ni}}.
85598`\spad{abs(x)} represents the Fortran intrinsic function ABS
85676`\spad{abs(f)} returns the absolute value operator applied to \spad{f}.
85898`\spad{abs(x)} returns the absolute value of \spad{x} = sqrt(norm(\spad{x})).
85965`\spad{abs(x)} returns the absolute value of \spad{x}.
86002`\spad{abs(x)} returns the absolute value of \spad{x}.
86051`\spad{abs(o)} computes the absolute value of an octonion,{} equal to the square root of the \spadfunFrom{norm}{Octonion}.
86119`\spad{abs(q)} computes the absolute value of quaternion \spad{q} (sqrt of norm).
86189`\spad{absolutelyIrreducible?()} tests if the curve absolutely irreducible?
86274`\spad{absolutelyIrreducible?()} tests if the curve absolutely irreducible?
86356`\spad{acos(x)} represents the Fortran intrinsic function ACOS
86435`\spad{acos(x)} applies the inverse cosine operator to \spad{x}
86645`\spad{acos(st)} computes arccosine of a power series \spad{st}.
86729`\spad{acos(st)} computes arccosine of a power series \spad{st}.
86827`\spad{acos(z)} returns the arc-cosine of Laurent series \spad{z}.
86914`\spad{acos(z)} returns the arc-cosine of a Puiseux series \spad{z}.
87010`\spad{acos(x)} returns the arc-cosine of \spad{x}. When evaluated into some subset of the complex numbers,{} one branch cut for acos lies along the negative real axis to the left of \spad{-1} (inclusive),{} continuous with the upper half plane,{} the other along the positive real axis to the right of 1 (inclusive),{} continuous with the lower half plane.
87069`\spad{acosh(x)} applies the inverse hyperbolic cosine operator to \spad{x}
87283`\spad{acosh(st)} computes the inverse hyperbolic cosine of a power series \spad{st}.
87368`\spad{acosh(st)} computes the inverse hyperbolic cosine of a power series \spad{st}.
87467`\spad{acosh(z)} returns the inverse hyperbolic cosine of Laurent series \spad{z}.
87555`\spad{acosh(z)} returns the inverse hyperbolic cosine of a Puiseux series \spad{z}.
87652`\spad{acosh(x)} returns the hyperbolic arc-cosine of \spad{x}.
87709`\spad{acoshIfCan(z)} returns acosh(\spad{z}) if possible,{} and "failed" otherwise.
87791`\spad{acosIfCan(z)} returns acos(\spad{z}) if possible,{} and "failed" otherwise.
87872`\spad{acot(x)} applies the inverse cotangent operator to \spad{x}
88039`\spad{acot(st)} computes arccotangent of a power series \spad{st}.
88123`\spad{acot(st)} computes arccotangent of a power series \spad{st}.
88221`\spad{acot(z)} returns the arc-cotangent of Laurent series \spad{z}.
88308`\spad{acot(z)} returns the arc-cotangent of a Puiseux series \spad{z}.
88404`\spad{acot(x)} returns the arc-cotangent of \spad{x}.
88463`\spad{acoth(x)} applies the inverse hyperbolic cotangent operator to \spad{x}
88633`\spad{acoth(st)} computes the inverse hyperbolic cotangent of a power series \spad{st}.
88718`\spad{acoth(st)} computes the inverse hyperbolic cotangent of a power series \spad{st}.
88817`\spad{acoth(z)} returns the inverse hyperbolic cotangent of Laurent series \spad{z}.
88905`\spad{acoth(z)} returns the inverse hyperbolic cotangent of a Puiseux series \spad{z}.
89002`\spad{acoth(x)} returns the hyperbolic arc-cotangent of \spad{x}.
89059`\spad{acothIfCan(z)} returns acoth(\spad{z}) if possible,{} and "failed" otherwise.
89141`\spad{acotIfCan(z)} returns acot(\spad{z}) if possible,{} and "failed" otherwise.
89222`\spad{acsc(x)} applies the inverse cosecant operator to \spad{x}
89391`\spad{acsc(st)} computes arccosecant of a power series \spad{st}.
89475`\spad{acsc(st)} computes arccosecant of a power series \spad{st}.
89573`\spad{acsc(z)} returns the arc-cosecant of Laurent series \spad{z}.
89660`\spad{acsc(z)} returns the arc-cosecant of a Puiseux series \spad{z}.
89756`\spad{acsc(x)} returns the arc-cosecant of \spad{x}.
89815`\spad{acsch(x)} applies the inverse hyperbolic cosecant operator to \spad{x}
89985`\spad{acsch(st)} computes the inverse hyperbolic cosecant of a power series \spad{st}.
90070`\spad{acsch(st)} computes the inverse hyperbolic cosecant of a power series \spad{st}.
90169`\spad{acsch(z)} returns the inverse hyperbolic cosecant of Laurent series \spad{z}.
90257`\spad{acsch(z)} returns the inverse hyperbolic cosecant of a Puiseux series \spad{z}.
90354`\spad{acsch(x)} returns the hyperbolic arc-cosecant of \spad{x}.
90411`\spad{acschIfCan(z)} returns acsch(\spad{z}) if possible,{} and "failed" otherwise.
90493`\spad{acscIfCan(z)} returns acsc(\spad{z}) if possible,{} and "failed" otherwise.
90574`\spad{aCubic(f,{} g,{} h,{} j)} \undocumented
90643`\spad{adaptive?()} determines whether plotting be done adaptively
90684`\spad{adaptive()} determines whether plotting will be done adaptively.
90736`\spad{adaptive(true)} turns adaptive plotting on; \spad{adaptive(false)} turns adaptive plotting off.
90795`\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}.
90842`\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.
90922`\spad{adaptive3D?()} determines whether plotting be done adaptively.
90967`\spad{addALS(f,{}g)} computes \spad{f+g} in terms of the admissible linear systems for \spad{f} and \spad{g} (without minimization).
91422`\spad{addArrow!(s,{} ar)} adds an arrow ar to the graph \spad{s}
91667`\spad{addArrow(s,{} nm,{} n1,{} n2)} constructs new poset by adding to the poset \spad{s} arrow from \spad{n1} to \spad{n2}.
91986`\spad{addArrow!(s,{} nm,{} n1,{} n2)} adds an arrow to the graph \spad{s},{} where: \spad{nm} is the name of the arrow \spad{n1} is the index of the start object \spad{n2} is the index of the end object
92077`\spad{addArrow!(s,{} nm,{} o1,{} o2)} adds an arrow to the graph \spad{s},{} where: \spad{nm} is the name of the arrow \spad{o1} is the start object \spad{o2} is the end object
92356`\spad{addArrow!(s,{} nm,{} n1,{} n2,{} mp)} adds an arrow to the graph \spad{s},{} where: \spad{nm} is the name of the arrow \spad{n1} is the index of the start object \spad{n2} is the index of the end object \spad{mp} is a map represented by this arrow
92472`\spad{addArrows2Din2D(n,{} ptFun,{} uSeg,{} vSeg,{} numPts)} is a convenience function which combines createArrows2Din2D with addChild!
92589`\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".
92637`\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".
92713`\spad{addChild!(n,{} c)} adds the specified child node \spad{'c'} below node \spad{'n'}
92759`\spad{addColumns!(f,{} i,{} j,{} alpha)} adds alpha*column(\spad{i}) to column(\spad{j}) in A and subtracts row(\spad{j}) from row(\spad{i}) in \spad{s} (in the ALS of \spad{f}),{} \spadignore{i.e.} (A*U)(U^-1*s) = \spad{v}.
92859`\spad{addColumns!(p,{} i,{} j,{} alpha)} adds alpha*column(\spad{i}) to column(\spad{j}) in all matrices of the linear pencil \spad{p}.
92966`\spad{addColumnsRows!(f,{} i,{} j,{} alpha)} adds alpha*column(\spad{i}) to column(\spad{j}) and subtracts alpha*row(\spad{j}) from row(\spad{i}) in the ALS of \spad{f}.
93070`Add a facet to this simplex If the facet is also in the list then,{} do not append,{} instead change the multiplier.
93137`\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>)}.
93221`a function to take a set of faces and add those that are implied by the cubicalComplex conventions (if they don\spad{'t} already exist). For example,{} if the input is a square [1..2,{} 1..2] then we would add its edges [1..1,{} 1..2],{} [2..2,{} 1..2],{} [1..2,{} 1..1],{} and [1..2,{} 2..2].
93306`a function to take a set of faces and add those that are implied by the simplecicalComplex conventions (if they don\spad{'t} already exist). For example,{} if the input is a triangle ((1,{} 2,{} 3)) then we would add: its points ((1),{} (2),{} (3)). and its edges ((1,{} 2),{} (1,{} 3),{} (2,{} 3)).
93395`\spad{additive?(a,{} n)} returns \spad{true} if the first \spad{n} coefficients of a are additive
93468`\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.
93535`\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).
93614`\spad{addMIN(f,{}g)} uses addALS(\spad{f},{}\spad{g}) with minimization.
93671`\spad{addmod(a,{} b,{} p)},{} \spad{0<=a,{} b<p>1},{} means \spad{a+b mod p}.
93723`\spad{addNode!(n,{} ptName,{} sc)} adds a scene node.
93975`\spad{addObject!(s,{} n)} adds object with coordinates \spad{n} to the graph \spad{s}.
94086`\spad{addObject!(s,{} n)} adds object \spad{n} to the graph \spad{s}. Use this version if you don\spad{'t} intend to create diagrams and therefore don\spad{'t} care about \spad{x},{} \spad{y} coordinates.
94135`\spad{addObject(s,{} n)} constructs new poset by adding object \spad{n} to the poset \spad{s}.
94177`\spad{addPlot1Din2D(n,{} f,{} tRange,{} numPts)} is a convenience function which combines createPlot1Din2D with addChild!
94289`\spad{addPlot1Din2D(n,{} f,{} tRange,{} numPts)} is a convenience function which combines createPlot1Din2D with addChild!
94392`\spad{addPlot1Din2Dparametric(n,{} ppc,{} tRange,{} numPts)} is a convenience function which combines createPlot1Din2Dparametric with addChild!
94536`\spad{addPlot1Din3Dparametric(n,{} pcfun,{} tRange,{} numPts)} is a convenience function which combines createPlot1Din3Dparametric with addChild!
94649`\spad{addPlot1Din3Dparametric(n,{} psc,{} tRange,{} numPts)} is a convenience function which combines createPlot1Din3Dparametric with addChild!
94793`\spad{addPlot2Din3D(n,{} f,{} uSeg,{} vSeg,{} numPts)} is a convenience function which combines createPlot2Din3D with addChild!
94938`\spad{addPlot2Din3Dparametric(n,{} f,{} uSeg,{} vSeg,{} numPts)} is a convenience function which combines createPlot2Din3Dparametric with addChild!
95084`\spad{addPlot2Din3Dparametric(n,{} f,{} uSeg,{} vSeg,{} numPts)} is a convenience function which combines createPlot2Din3Dparametric with addChild!
95258`\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.
95312`\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}.
95382`\spad{addPoint(s,{} \spad{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\spad{'s} length should range from 0 to \spad{n - 1} where \spad{n} is the dimension of the subspace. If the length is \spad{n - 1},{} then a specific lowest level component is being referenced. If it is less than \spad{n - 1},{} then some higher level component (0 indicates top level component) is being referenced and a component of that level with the desired point is created. The subspace \spad{s} is returned with the additional point.
95470`\spad{addPoint(s,{} \spad{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\spad{'s} length should range from 0 to \spad{n - 1} where \spad{n} is the dimension of the subspace. If the length is \spad{n - 1},{} then a specific lowest level component is being referenced. If it is less than \spad{n - 1},{} then some higher level component (0 indicates top level component) is being referenced and a component of that level with the desired point is created. The subspace \spad{s} is returned with the additional point.
95548`\spad{addPointLast(s,{} s2,{} \spad{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.
95626`\spad{addPoints!(n,{} ptName,{} pts)} adds a points node.
95688`\spad{add_poly(pol1,{} pol2,{} md)} add polynomials \spad{pol1} and \spad{pol2}.
95772`\spad{addRows!(f,{} i,{} j,{} alpha)} adds alpha*row(\spad{i}) to row(\spad{j}) in the ALS of \spad{f}.
95869`\spad{addRows!(p,{} i,{} j,{} alpha)} adds alpha*row(\spad{i}) to row(\spad{j}) in all matrices of the linear pencil \spad{p}.
95973`\spad{addRowsColumns!(f,{} i,{} j,{} alpha)} adds alpha*row(\spad{i}) to row(\spad{j}) and subtracts alpha*column(\spad{j}) from column(\spad{i}) in the ALS of \spad{f}.
96077`\spad{addSceneArrow(n,{} st,{} en,{} offset,{} mode,{} size)} is a convenience function which combines createSceneArrow with addChild!
96158`\spad{addSceneArrow(n,{} st,{} en,{} offset,{} mode,{} size,{} fontScale)} is a convenience function which combines createSceneArrow with addChild!
96241`\spad{addSceneArrows(n,{} line,{} mode,{} size)} is a convenience function which combines createSceneArrows with addChild!
96321`\spad{addSceneBox(n,{} size)} is a convenience function which combines createSceneBox with addChild!
96376`\spad{addSceneClip(n,{} bb)} is a convenience function which combines createSceneClip with addChild!
96434`\spad{addSceneDef(n,{} nam,{} nde)} is a convenience function which combines createSceneDef with addChild!
96486`\spad{addSceneGraph(n,{} g,{} x,{} y,{} dispArrowName)} is a convenience function which combines createSceneGraph with addChild!
96599`\spad{addSceneGrid(n,{} bb)} is a convenience function which combines createSceneGrid with addChild!
96657`\spad{addSceneGrid(n,{} stepSize,{} bb)} is a convenience function which combines createSceneGrid with addChild!
96727`\spad{addSceneGroup(n)} is a convenience function which combines createSceneGroup with addChild!
96772`\spad{addSceneIFS(n,{} in1)} is a convenience function which combines createSceneIFS with addChild!
96828`\spad{addSceneIFS(n,{} inx,{} pts)} is a convenience function which combines createSceneIFS with addChild!
96911`\spad{addSceneLine(n,{} line)} is a convenience function which combines createSceneLine with addChild!
96964`\spad{addSceneLine(n,{} st,{} en,{} fontScale)} is a convenience function which combines createSceneLine with addChild!
97024`\spad{addSceneLine(n,{} st,{} en,{} fontScale)} is a convenience function which combines createSceneLine with addChild!
97092`\spad{addSceneLines(n,{} line)} is a convenience function which combines createSceneLines with addChild!
97152`\spad{addSceneMaterial(n,{} mat)} is a convenience function which combines createSceneMaterial with addChild!
97283`\spad{addSceneMaterial(n,{} lineW,{} lineC,{} fillC)} is a convenience function which combines createSceneMaterial with addChild!
97357`\spad{addSceneNamedPoints(n,{} np)} is a convenience function which combines createSceneNamedPoints with addChild!
97429`\spad{addScenePattern(n,{} ptype,{} step,{} bb)} is a convenience function which combines createScenePattern with addChild!
97516`\spad{addSceneRuler(n,{} ptype,{} offset,{} bb)} is a convenience function which combines createSceneRuler with addChild!
97585`\spad{addSceneShape(n,{} shape)} is a convenience function which combines createSceneShape with addChild!
97684`\spad{addSceneShape(n,{} shape)} is a convenience function which combines createSceneShape with addChild!
97743`\spad{addSceneText(n,{} text)} is a convenience function which combines createSceneText with addChild!
97852`\spad{addSceneText(n,{} str,{} sz,{} pz)} is a convenience function which combines createSceneText with addChild!
97931`\spad{addSceneText(n,{} str,{} sz,{} pz)} is a convenience function which combines createSceneText with addChild!
98004`\spad{addSceneTransform(n,{} tran)} is a convenience function which combines createSceneTransform with addChild!
98068`\spad{addSceneUse(n,{} nam)} is a convenience function which combines createSceneUse with addChild!
98118`Add a facet to this simplex If the facet is also in the list then,{} do not append,{} instead change the multiplier. Used by boundary function
98192`\spad{add_slots(\spad{li})} extend reconstructor adding zeros at positions in \spad{li}.
98267`used by cone. Adds a vertex to face.
98369`used by cone. Adds a vertex to face.
98433`\spad{addWarning s} is an internal function that adds \spad{s},{} together with an indication of the current testcase and the current testsuite to the list of warnings.
98491`\spad{addWArrow!(s,{} name,{} n1,{} n2,{} w)} adds a weighted arrow to the graph \spad{s},{} where \spad{name} is \spad{name} of the arrow,{} \spad{w} is weight of the arrow,{} \spad{n1} is starting point of the arrow,{} \spad{n2} is endpoint of the arrow.
98664`\spad{adjacencyMatrix(s)} returns an \spad{n} by \spad{n} matrix A,{} where \spad{n} is the number of vertices in the graph. If there is an edge from a vertex \spad{x} to a vertex \spad{y},{} then the element ax,{} \spad{y} is 1 (or in general the number of xy edges),{} otherwise it is 0. In computing,{} this matrix makes it easy to find subgraphs,{} and to reverse a directed graph.
98799`\spad{adjoint(p)} returns the adjoint of operator \spad{p}.
98936`\spad{adjoint(a)} returns the adjoint operator of a.
99011`\spad{adjoint(op)} returns the adjoint of the operator \spad{op}.
99082`\spad{adjoint(m)} returns the ajoint matrix of \spad{m} (\spadignore{i.e.} the matrix \spad{n} such that \spad{m*n} = determinant(\spad{m})*id) and the detrminant of \spad{m}.
99258`\spad{adjoint(op1,{} op2)} sets the adjoint of \spad{op1} to be \spad{op2}. \spad{op1} must be a basic operator
99331`\spad{admissibleLinearSystem(f)} output as ALS.
99411`\spad{airyAi(x)} returns the Airy \spad{Ai} function applied to \spad{x}.
99560`\spad{airyAi(x)} is the Airy function \spad{\spad{Ai}(x)}.
99684`\spad{airyAiPrime(x)} returns the derivative of Airy \spad{Ai} function applied to \spad{x}.
99843`\spad{airyAiPrime(x)} is the derivative of the Airy function \spad{\spad{Ai}(x)}.
99977`\spad{airyBi(x)} returns the Airy \spad{Bi} function applied to \spad{x}.
100126`\spad{airyBi(x)} is the Airy function \spad{\spad{Bi}(x)}.
100250`\spad{airyBiPrime(x)} returns the derivative of Airy \spad{Bi} function applied to \spad{x}.
100409`\spad{airyBiPrime(x)} is the derivative of the Airy function \spad{\spad{Bi}(x)}.
100543`\spad{Aleph(n)} provides the named (infinite) cardinal number.
102626`\spad{algDepHP(list,{} options)} returns a specification for Hermite-Pade approximation looking for algebraic dependencies
106928`\spad{algDsolve(op,{} lg)} is a parametric version of algDsolve(\spad{op},{} \spad{g})
107107`\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.
107380`\spad{algebraic?(a)} tests whether an element \spad{a} is algebraic with respect to the ground field \spad{F}.
107505`\spad{algebraic?(v,{} ts)} returns \spad{true} iff \spad{v} is the main variable of some polynomial in \spad{ts}.
107664`\spad{algebraicCoefficients?(p,{} ts)} returns \spad{true} iff every variable of \spad{p} which is not the main one of \spad{p} is algebraic with respect to \spad{ts}.
108229`\spad{algebraicGcd(x,{} y,{} lm,{} lp,{} v,{} la)} computes \spad{gcd} of \spad{x} and \spad{y} modulo polynomials in \spad{lm}. la is list of algebraic parameters,{} \spad{lp} is a list of transcendental parameters,{} \spad{v} is main variable.
108368`\spad{algebraicOf(char)} is the external number
108503`\spad{algebraicSort(lts)} sorts \spad{lts} with respect to \spadopFrom{supDimElseRittWu?}{QuasiComponentPackage}.
108586`\spad{algebraicSort(lts)} sorts \spad{lts} with respect to \spadopFrom{supDimElseRittWu?}{QuasiComponentPackage}.
108754`\spad{algebraicVariables(ts)} returns the decreasingly sorted list of the main variables of the polynomials of \spad{ts}.
108831`\spad{algextint(der,{} ext,{} rde,{} csolve,{} [g1,{} ...,{} gn])} returns a basis of solutions of the homogeneous system \spad{h' + c1*g1 + ... + cn*gn = 0}. Argument \spad{ext} is an extended integration function on \spad{F},{} \spad{rde} is RDE solver,{} \spad{csolve} is linear solver over constants.
109142`\spad{algextint(x,{} y,{} d,{} ext,{} rde,{} csolve,{} [g1,{} ...,{} gn])} returns \spad{[h,{} [c1,{} ...,{} cn]]} such that \spad{f = dh/dx + sum(\spad{ci} \spad{gi})} and dci/dx = 0,{} if such \spad{[h,{} [c1,{} ...,{} cn]]} exist,{} "failed" otherwise.
109652`\spad{algextint_base(der,{} csolve,{} [g1,{} ...,{} gn])} is like algextint(\spad{der},{} ext,{} rde,{} \spad{csolve},{} [\spad{g1},{} ...,{} \spad{gn}]),{} but assumes that field is algebraic extension of rational functions and that \spad{gi}-\spad{s} have no poles at infinity.
109807`\spad{algextint_base(x,{} y,{} d,{} csolve,{} [g1,{} ...,{} gn])} is like algextint but assumes that \spad{y} and \spad{gi}-\spad{s} are purely algebraic
110026`\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]}.
110208`\spad{algintegrate(f,{} d,{} rec)} integrates \spad{f} with respect to the derivation \spad{d}.
110331`\spad{alg_reduce0(x,{} m,{} lv,{} z)} performs single reduction step.
110523`\spad{alg_reduce(x,{} lm,{} lv,{} lz)} reduces \spad{x} modulo elements of \spad{lm}.
110726`\spad{alg_split_root0(f,{} r,{} n)} returns \spad{[a1,{} ...,{} an]} such that \spad{f = a1 + a2*r + ... an*r^(n - 1)}. \spad{r} must be a root and \spad{n} must be its degree.
110804`\spad{alg_split_roots(lf,{} r1,{} r2)} splits each \spad{f} in \spad{lf} into linear combination of product of powers of \spad{r1} and \spad{r2} which must be independent roots.
111058`\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 with respect to \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.
111287`\spad{algtower(f)} is algtower([\spad{f}])
111364`\spad{algtower([f1,{} ...,{} fn])} returns list of kernels \spad{[ak1,{} ...,{} akl]} such that each toplevel algebraic kernel in one of \spad{f1},{} ...,{} \spad{fn} or in arguments of \spad{ak1},{} ...,{} akl is one of \spad{ak1},{} ...,{} akl.
111447`\spad{alg_trial_division(x,{} y,{} lm,{} lv,{} lz)} checks if \spad{x} is divisible by \spad{y} in algebraic extension defined by \spad{lm}. \spad{lz} is list of algebraic variables,{} \spad{lv} is list of independent (polynomial) variables. Other variables serve as parameters.
111666`\spad{aLinear(f,{} g)} \undocumented
111732`\spad{allDegrees returns} whether all possibilities of the degree vector should be tried,{} the default being \spad{false}.
111808`\spad{allDegrees(d)} specifies whether all possibilities of the degree vector - taking into account maxDegree - should be tried. This is mainly interesting for rational interpolation. This option is expressed in the form \spad{allDegrees == d}.
111858`\spad{allIndices(A)} returns all indices used for enumerating the columns of the matrix \spad{A}.
111921`\spad{allRepeated(ind)} returns a list of all possible realizations of a given multi-index as repeated index.
112021`\spad{allRepeated(ind)} returns a list of all possible realizations of a given multi-index as repeated index.
112607`\spad{allRootsOf(pol)} creates all the roots of \spad{pol} naming each uniquely
112689`\spad{allRootsOf(pol)} creates all the roots of \spad{pol} naming each uniquely
112761`\spad{allRootsOf(pol)} creates all the roots of \spad{pol} naming each uniquely
112827`\spad{allRootsOf(pol)} creates all the roots of \spad{pol} naming each uniquely
112925`\spad{allRootsOf(pol)} creates all the roots of \spad{pol} naming each uniquely
113013`\spad{allRootsOf(pol)} creates all the roots of \spad{pol} naming each uniquely
113095`\spad{allRootsOf(pol)} creates all the roots of \spad{pol} in the Real Closure,{} assumed in order.
113190`\spad{allSimpleCells(lp,{} sym)} returns decomposition into cells such that each \spad{p} in \spad{lp} has constant sign on each member of decomposition
113280`\spad{allSimpleCells(p,{} sym)} is allSimpleCells([\spad{p}],{} \spad{sym})
113364`\spad{allSubsets of} a given facet returned in reverse order subsets returned are not oriented
113434`\spad{allSubsets of} a given facet returned in reverse order subsets returned are not oriented
113505`\spad{allSubsets of} a given length returned in reverse order subsets returned are not oriented
113594`\spad{allSubsets of} a given length returned in reverse order subsets returned are not oriented
113684`\spad{Alpha()} returns symbol for capital greek letter alpha.
113735`\spad{alpha()} returns symbol for small greek letter alpha.
113786`\spad{alpha(q,{} beta)} computes the Cartan characters for a differential equation of order \spad{q} and with characters \spad{beta}.
113900`\spad{alphabetic()} returns the class of all characters for which \spadfunFrom{alphabetic?}{Character} is \spad{true}.
113946`\spad{alphabetic?(c)} tests if \spad{c} is a letter,{} \spadignore{i.e.} one of a..\spad{z} or A..\spad{Z}.
113995`\spad{alphaHilbert(hp)} computes the Cartan characters for the Hilbert polynomial \spad{hp}.
114118`\spad{alphanumeric()} returns the class of all characters for which \spadfunFrom{alphanumeric?}{Character} is \spad{true}.
114166`\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}.
114217`\spad{alternating n} is the cycle index of the \indented{1}{alternating group of degree \spad{n}.}
114309`\spad{alternatingGroup(\spad{li})} constructs the alternating group acting on the integers in the list {\em \spad{li}},{} generators are in general the {\em n-2}-cycle {\em (\spad{li}.3,{} ...,{} \spad{li}.n)} and the 3-cycle {\em (\spad{li}.1,{} \spad{li}.2,{} \spad{li}.3)},{} if \spad{n} is odd and product of the 2-cycle {\em (\spad{li}.1,{} \spad{li}.2)} with {\em n-2}-cycle {\em (\spad{li}.3,{} ...,{} \spad{li}.n)} and the 3-cycle {\em (\spad{li}.1,{} \spad{li}.2,{} \spad{li}.3)},{} if \spad{n} is even. Note: duplicates in the list will be removed.
114408`\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.
114509`\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\spad{'t} know whether \spad{2*a=0} implies \spad{a=0}.
114586`\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\spad{'t} know whether \spad{2*a=0} implies \spad{a=0}.
114660`\spad{altsupersub(p)} returns a handler such that \spad{altsupersub(p)(prec,{} args)} formats the first argument with respect to the precedence \spad{p}. The remaining arguments are formatted without parentheses and interpreted as subscript,{} superscript,{} subscript,{} superscript,{} etc. where the subscripts and superscripts are pairwise aligned. Outer parentheses are added if \spad{p < prec}.
114753`\spad{analyseSymbol(symb)} computes the multiplicative variables of the symbol \spad{symb}.
114933`\spad{And(n,{} m)} returns the bit-by-bit logical {\em And} of \spad{n} and \spad{m}.
114976`\spad{f and g} creates the equivalent infix form.
115014`\spad{AND(x,{} y)} returns the \spadtype{Switch} expression representing \spad{x and y}.
115220`\spad{a and b} returns the logical {\em and} of bit aggregates \spad{a} and \spad{b}.
115260`\spad{a and b} returns the logical {\em and} of Boolean \spad{a} and \spad{b}.
115295`\spad{And(n,{} m)} returns the bit-by-bit logical {\em and} of the single integers \spad{n} and \spad{m}.
115336`\spad{angerJ(v,{} z)} is the Anger \spad{J} function.
115397`\spad{angerJ(v,{} z)} is the Anger \spad{J} function.
115546`\spad{annihilate?(x,{}y)} holds when the product of \spad{x} and \spad{y} is \spad{0}.
115591`\spad{ansatz()} returns a general ansatz for a symmetry generator.
115690`\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.
115771`\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.
115849`\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}.
115930`\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}.
116008`\spad{antiCommutator(a,{} b)} returns \spad{a*b+b*a}.
116127`\spad{anticoord }\undocumented
116313`\spad{antipode(x)} computes the antipode of an element \spad{x}.
116509`\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.
116596`\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.
116698`\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.
116781`\spad{antisymmetricTensors(la,{} n)} applies to each \spad{m}-by-\spad{m} square matrix in the list {\em la} the irreducible,{} polynomial representation of the general linear group {\em GLm} which corresponds to the partition {\em (1,{} 1,{} ...,{} 1,{} 0,{} 0,{} ...,{} 0)} of \spad{n}. Error: if \spad{n} is greater than \spad{m}. Note: this corresponds to the symmetrization of the representation with the sign representation of the symmetric group {\em Sn}. The carrier spaces of the representation are the antisymmetric tensors of the \spad{n}-fold tensor product.
116915`\spad{antisymmetricTensors(a,{} n)} applies to the square matrix {\em a} the irreducible,{} polynomial representation of the general linear group {\em GLm},{} where \spad{m} is the number of rows of {\em a},{} which corresponds to the partition {\em (1,{} 1,{} ...,{} 1,{} 0,{} 0,{} ...,{} 0)} of \spad{n}. Error: if \spad{n} is greater than \spad{m}. Note: this corresponds to the symmetrization of the representation with the sign representation of the symmetric group {\em Sn}. The carrier spaces of the representation are the antisymmetric tensors of the \spad{n}-fold tensor product.
117495`\spad{any?(p,{} u)} tests if \spad{p(x)} is \spad{true} for any element \spad{x} of \spad{u}. Note: for collections,{} \spad{any?(p,{} u) = reduce(or,{} map(p,{} u),{} false,{} true)}. However,{} \spad{any?(p,{} u)} returns as soon as it finds an element for which \spad{p} gives \spad{true}.
117586`\spad{any(type,{} object)} is a technical function for creating an object of \spadtype{Any}. Argument \spad{type} is a \spadgloss{LISP} form for the \spad{type} of \spad{object}.
117630`\spad{append!(p,{} l)} appends \spad{l} matrices to the linear pencil.
117712`\spad{append(p,{} l)} appends \spad{l} matrices to the linear pencil.
117793`\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.
117831`\spad{appendPoint(\spad{gi},{} pt)} appends the point \spad{pt} to the end of the list of points component for the graph,{} \spad{\spad{gi}},{} which is of the domain \spadtype{GraphImage}.
117897`\spad{appendRow!(A,{} r)} appends the row \spad{r} at the end of the matrix \spad{A}.
117997`\spad{appendSupport! (f,{} lst)} appends variables not in the support.
118148`\spad{apply '}function' represented by this graph to vertex index 'a'
118228`\spad{elt(mm,{} \spad{pi})} returns the product of the entries indexed by the integer partition \spad{pi} (as in partitionend moments)
118285`\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\spad{'t} fit.
118353`\spad{apply(p,{} d)} computes the distribution of the random variable \spad{p(X)}\$ where \spad{X} has distribution \spad{d}.
118451`\spad{A(i,{} j)} returns \$A_{\spad{i},{} \spad{j}}\$
118516`\spad{apply '}function' represented by this graph to vertex index 'a'
118620`\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}.
118693`\spad{mf(\spad{pi},{} \spad{si})} evaluates the Moebius function \spad{mf} at \spad{pi} and \spad{si}
118755`\spad{mf(\spad{pi},{} \spad{si})} evaluates the Moebius function \spad{mf} at \spad{pi} and \spad{si}
118824`\spad{A(s,{} t)} returns \$A_{\spad{i},{} \spad{j}}\$,{} where \$\spad{i}\$,{} \$\spad{j}\$ are the positions of \$\spad{s}\$ and \$\spad{t}\$ in the index list.
118877`\spad{apply(p,{} c,{} m)} returns \spad{p(m)} where the action is given by \spad{x m = c sigma(m) + delta(m)}.
118944`\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)}.
119159`\spad{applyQuote(foo,{} x)} returns \spad{'foo(x)}.
119218`\spad{applyQuote(foo,{} [x1,{} ...,{} xn])} returns \spad{'foo(x1,{} ...,{} xn)}.
119342`\spad{applyQuote(foo,{} x,{} y)} returns \spad{'foo(x,{} y)}.
119464`\spad{applyQuote(foo,{} x,{} y,{} z)} returns \spad{'foo(x,{} y,{} z)}.
119590`\spad{applyQuote(foo,{} x,{} y,{} z,{} t)} returns \spad{'foo(x,{} y,{} z,{} t)}.
119655`\spad{applyRules([r1,{} ...,{} rn],{} expr)} applies the rules \spad{r1},{} ...,{} \spad{rn} to \spad{f} an unlimited number of times,{} \spadignore{i.e.} until none of \spad{r1},{} ...,{} \spad{rn} is applicable to the expression.
119736`\spad{applyRules([r1,{} ...,{} rn],{} expr,{} n)} applies the rules \spad{r1},{} ...,{} \spad{rn} to \spad{f} a most \spad{n} times.
119833`\spad{apply_taylor(ts,{} s)} applies Taylor series with coefficients \spad{ts} to \spad{s},{} that is computes infinite sum \spad{ts}(0) + \spad{ts}(1)\spad{*s} + \spad{ts}(2)\spad{*s^2} + ... Note: \spad{s} must be of positive order
119933`\spad{apply_taylor(g,{} f)} applies \spad{g} to \spad{f}
120018`\spad{applyTaylor(g,{} f)} applies \spad{g} to \spad{f}
120109`\spad{approximants(x)} returns the stream of approximants of the continued fraction \spad{x}. If the continued fraction is finite,{} then the stream will be infinite and periodic with period 1.
120259`\spad{approximate(x,{} n)} returns a rational number \spad{y} such that \spad{y = x (mod p^n)}.
120419`\spad{approximate(f)} returns a truncated power series with the series variable viewed as an element of the coefficient domain.
120588`\spad{approximate(n,{} p)} gives an approximation of \spad{n} that has precision \spad{p}
120655`\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.
120726`\spad{approximate(term,{} root,{} prec)} gives an approximation of \spad{term} over \spad{root} with precision \spad{prec}
120834`\spad{approxRoot(n,{} r)} returns an approximation \spad{x} to \spad{n^(1/r)} such that \spad{-1 < x - n^(1/r) < 1}
120904`\spad{approxSqrt(n)} returns an approximation \spad{x} to \spad{sqrt(n)} such that \spad{-1 < x - sqrt(n) < 1}. Returns 0 if \spad{n} is negative. A variable precision Newton iteration is used. The running time is \spad{O( log(n)^2 )}.
120952`\spad{aQuadratic(f,{} g,{} h)} \undocumented
121023`\spad{aQuartic(f,{} g,{} h,{} i,{} k)} \undocumented
121096`\spad{arbFunctions(q,{} j,{} cc)} uses the Cartan characters \spad{cc} to compute the number of arbitrary functions of differentiation order \spad{j} in the general solution of a differential equation of order \spad{q}.
121214`\spad{arcsineDistribution(a)} produces the arcsine distribution of variance \spad{a}.
121325`\spad{areEquivalent?(aG0,{} aG1)} calls {\em areEquivalent?(aG0,{} aG1,{} true,{} 25)}. Note: the choice of 25 was rather arbitrary.
121437`\spad{areEquivalent?(aG0,{} aG1,{} numberOfTries)} calls {\em areEquivalent?(aG0,{} aG1,{} true,{} 25)}. Note: the choice of 25 was rather arbitrary.
121557`\spad{areEquivalent?(aG0,{} aG1,{} randomelements,{} numberOfTries)} tests whether the two lists of matrices,{} all assumed of same square shape,{} can be simultaneously conjugated by a non-singular matrix. If these matrices represent the same group generators,{} the representations are equivalent. The algorithm tries {\em numberOfTries} times to create elements in the generated algebras in the same fashion. If their ranks differ,{} they are not equivalent. If an isomorphism is assumed,{} then the kernel of an element of the first algebra is mapped to the kernel of the corresponding element in the second algebra. Now consider the one-dimensional ones. If they generate the whole space (\spadignore{e.g.} irreducibility !) we use {\em standardBasisOfCyclicSubmodule} to create the only possible transition matrix. The method checks whether the matrix conjugates all corresponding matrices from {\em aGi}. The way to choose the singular matrices is as in {\em meatAxe}. If the two representations are equivalent,{} this routine returns the transformation matrix {\em TM} with {\em aG0.i * TM = TM * aG1.i} for all \spad{i}. If the representations are not equivalent,{} a small 0-matrix is returned. Note: the case with different sets of group generators cannot be handled.
121685`\spad{arg1(a,{} c)} selects its first argument.
121747`\spad{arg2(a,{} c)} selects its second argument.
121809`\spad{argscript(s,{} [a1,{} ...,{} an])} returns \spad{s} arg-scripted by \spad{[a1,{} ...,{} an]}.
121864`\spad{argument(x)} returns the argument of a given sin/cos expressions
121914`\spad{argument(op(a1,{} ...,{} an))} returns \spad{[a1,{} ...,{} an]}.
122015`\spad{argument(x)} returns the angle made by (1,{} 0) and \spad{x}.
122101`\spad{argumentList!(l)} declares that the argument list for the current subprogram in the global symbol table is \spad{l}.
122165`\spad{argumentList!(f,{} l)} declares that the argument list for subprogram \spad{f} in the global symbol table is \spad{l}.
122236`\spad{argumentList!(f,{} l,{} tab)} declares that the argument list for subprogram \spad{f} in symbol table tab is \spad{l}.
122309`\spad{argumentListOf(f,{} tab)} returns the argument list of \spad{f}
122378`\spad{arguments(f)} gives arguments of form \spad{f}. Valid only when atom?(\spad{f}) is \spad{false}
122449`\spad{arity(op)} returns \spad{n} if \spad{op} is \spad{n}-ary,{} and "failed" if \spad{op} has arbitrary arity.
122523`\spad{aromberg(fn,{} a,{} b,{} epsrel,{} epsabs,{} nmin,{} nmax,{} nint)} uses the adaptive romberg method to numerically integrate function \spad{fn} over the closed interval from \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin} to \spad{nmax},{} and where \spad{nint} is the number of independent intervals to apply the integrator. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
122745`\spad{array2(ll)} constructs a 2-dimensional array,{} the inner list being the rows.
122824`\spad{arrayStack([x,{} y,{} ...,{} z])} creates an array stack with first (top) element \spad{x},{} second element \spad{y},{} ...,{} and last element \spad{z}.
123044`\spad{arrowName(s,{} a,{} b)} retrieves the name of arrow a-\spad{>b} if it does not exist then return \spad{"?"}
123311`index of all arrows leading to a given arrow
123581`\spad{arrowsFromNode(s,{} a)} gives list of all arrows leading to a given node
123848`\spad{arrowsToArrow(s,{} a)} returns index of all arrows leading from a given arrow
124112`\spad{arrowsToNode(s,{} a)} gives list of all arrows leading from a given node
124203`\spad{asec(x)} applies the inverse secant operator to \spad{x}
124372`\spad{asec(st)} computes arcsecant of a power series \spad{st}.
124456`\spad{asec(st)} computes arcsecant of a power series \spad{st}.
124554`\spad{asec(z)} returns the arc-secant of Laurent series \spad{z}.
124641`\spad{asec(z)} returns the arc-secant of a Puiseux series \spad{z}.
124737`\spad{asec(x)} returns the arc-secant of \spad{x}.
124796`\spad{asech(x)} applies the inverse hyperbolic secant operator to \spad{x}
124966`\spad{asech(st)} computes the inverse hyperbolic secant of a power series \spad{st}.
125051`\spad{asech(st)} computes the inverse hyperbolic secant of a power series \spad{st}.
125150`\spad{asech(z)} returns the inverse hyperbolic secant of Laurent series \spad{z}.
125238`\spad{asech(z)} returns the inverse hyperbolic secant of a Puiseux series \spad{z}.
125335`\spad{asech(x)} returns the hyperbolic arc-secant of \spad{x}.
125392`\spad{asechIfCan(z)} returns asech(\spad{z}) if possible,{} and "failed" otherwise.
125474`\spad{asecIfCan(z)} returns asec(\spad{z}) if possible,{} and "failed" otherwise.
125555`\spad{asimpson(fn,{} a,{} b,{} epsrel,{} epsabs,{} nmin,{} nmax,{} nint)} uses the adaptive simpson method to numerically integrate function \spad{fn} over the closed interval from \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin} to \spad{nmax},{} and where \spad{nint} is the number of independent intervals to apply the integrator. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
125700`\spad{asin(x)} represents the Fortran intrinsic function ASIN
125779`\spad{asin(x)} applies the inverse sine operator to \spad{x}
125989`\spad{asin(st)} computes arcsine of a power series \spad{st}.
126073`\spad{asin(st)} computes arcsine of a power series \spad{st}.
126171`\spad{asin(z)} returns the arc-sine of Laurent series \spad{z}.
126258`\spad{asin(z)} returns the arc-sine of a Puiseux series \spad{z}.
126354`\spad{asin(x)} returns the arc-sine of \spad{x}. When evaluated into some subset of the complex numbers,{} one branch cut for asin lies along the negative real axis to the left of \spad{-1} (inclusive),{} continuous with the upper half plane,{} the other along the positive real axis to the right of 1 (inclusive),{} continuous with the lower half plane.
126413`\spad{asinh(x)} applies the inverse hyperbolic sine operator to \spad{x}
126627`\spad{asinh(st)} computes the inverse hyperbolic sine of a power series \spad{st}.
126712`\spad{asinh(st)} computes the inverse hyperbolic sine of a power series \spad{st}.
126811`\spad{asinh(z)} returns the inverse hyperbolic sine of Laurent series \spad{z}.
126899`\spad{asinh(z)} returns the inverse hyperbolic sine of a Puiseux series \spad{z}.
126996`\spad{asinh(x)} returns the hyperbolic arc-sine of \spad{x}.
127053`\spad{asinhIfCan(z)} returns asinh(\spad{z}) if possible,{} and "failed" otherwise.
127135`\spad{asinIfCan(z)} returns asin(\spad{z}) if possible,{} and "failed" otherwise.
127216`\spad{assert(op,{} s)} attaches property \spad{s} to \spad{op}. Argument \spad{op} is modified "in place",{} \spadignore{i.e.} no copy is made.
127265`\spad{assign(f,{} g)} creates a form for the assignment \spad{f := g}.
127306`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
127378`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
127441`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
127506`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
127578`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
127648`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
127720`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
127800`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
127871`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
127944`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
128024`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
128102`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
128182`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
128250`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
128316`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
128384`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
128436`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
128516`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
128587`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
128660`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
128740`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
128818`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
128898`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
128966`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
129032`\spad{assign(x,{} y)} creates a representation of the FORTRAN expression x=y.
129100`\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).
129198`\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).
129287`\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).
129378`\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).
129476`\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).
129572`\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).
129670`\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}.
129779`\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.
129959`\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}.
130189`\spad{associates?(x,{} y)} tests whether \spad{x} and \spad{y} are associates,{} \spadignore{i.e.} differ by a unit factor.
130241`\spad{associative?()} tests if multiplication in algebra is associative.
130318`\spad{associative?()} tests if multiplication in algebra is associative.
130445`\spad{associator(a,{} b,{} c)} returns \spad{(a*b)*c-a*(b*c)}.
130499`\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}.
130592`\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}.
130703`\spad{atan1 should} be local but conditional
130814`\spad{atan(x)} represents the Fortran intrinsic function ATAN
130893`\spad{atan(x)} applies the inverse tangent operator to \spad{x}
131047`\spad{atan(st)} computes arctangent of a power series \spad{st}.
131131`\spad{atan(st)} computes arctangent of a power series \spad{st}.
131229`\spad{atan(z)} returns the arc-tangent of Laurent series \spad{z}.
131316`\spad{atan(z)} returns the arc-tangent of a Puiseux series \spad{z}.
131412`\spad{atan(x)} returns the arc-tangent of \spad{x}. When evaluated into some subset of the complex numbers,{} one branch cut for atan lies along the positive imaginary axis above \%\spad{i} (exclusive),{} continuous with the left half plane,{} the other along the negative imaginary axis below -\%\spad{i} (exclusive) continuous with the right half plane. The domain does not contain \%\spad{i} and -\%\spad{i}.
131471`\spad{atan(x,{} y)} computes the arc tangent from \spad{x} with phase \spad{y}.
131511`\spad{atan(x,{} y)} computes the arc tangent from \spad{x} with phase \spad{y}.
131545`\spad{atanh(x)} computes \spad{atanh}.
131641`\spad{atanh(x)} applies the inverse hyperbolic tangent operator to \spad{x}
131855`\spad{atanh(st)} computes the inverse hyperbolic tangent of a power series \spad{st}.
131940`\spad{atanh(st)} computes the inverse hyperbolic tangent of a power series \spad{st}.
132039`\spad{atanh(z)} returns the inverse hyperbolic tangent of Laurent series \spad{z}.
132127`\spad{atanh(z)} returns the inverse hyperbolic tangent of a Puiseux series \spad{z}.
132224`\spad{atanh(x)} returns the hyperbolic arc-tangent of \spad{x}.
132281`\spad{atanhIfCan(z)} returns atanh(\spad{z}) if possible,{} and "failed" otherwise.
132363`\spad{atanIfCan(z)} returns atan(\spad{z}) if possible,{} and "failed" otherwise.
132444`returns \spad{true} if this is an atom,{} that is a leaf node otherwise return \spad{false} if this is a compound term
132484`returns \spad{true} if this is an atom,{} that is free or bound variable otherwise return \spad{false} if this is a compound or lambda definition
132528`returns \spad{true} if this is an atom,{} that is a leaf node otherwise return \spad{false} if this is a compound term
132580`returns \spad{true} if this is an atom,{} that is a leaf node otherwise return \spad{false} if this is a compound term
132632`returns \spad{true} if this is an atom,{} that is a leaf node otherwise return \spad{false} if this is a compound term
132684`\spad{atom?(f)} checks if form \spad{f} is atomic,{} \spad{false} means composite
132742`\spad{atom?(s)} is \spad{true} if \spad{s} is a Lisp atom.
132812`\spad{atoms(r)} returns the list of matches that match atoms (elements of the lists).
132891`\spad{atom_to_string(f)} converts \spad{f} to string form.
132957`\spad{atrapezoidal(fn,{} a,{} b,{} epsrel,{} epsabs,{} nmin,{} nmax,{} nint)} uses the adaptive trapezoidal method to numerically integrate function \spad{fn} over the closed interval from \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin} to \spad{nmax},{} and where \spad{nint} is the number of independent intervals to apply the integrator. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
133106`\spad{atType(f)} returns the input form corresponding to \spad{f@R}
133489`\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))}
133570`\spad{augment(lp,{} lts)} returns the same as \spad{concat([augment(lp,{} ts) for ts in lts])}
133657`\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.
133732`\spad{augment(p,{} lts)} returns the same as \spad{concat([augment(p,{} ts) for ts in lts])}
133813`\spad{autoReduce(sys)} tries to simplify a system by solving each equation for its leading term and substituting it into the other equations.
134049`\spad{autoReduced?(ts,{} redOp?)} returns \spad{true} iff every element of \spad{ts} is reduced with respect to every other in the sense of \spad{redOp?}.
134141`\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".
134202`\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}.
134278`\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".
134353`\spad{axesColorDefault()} returns the default color of the axes in a 2D viewport.
134416`\spad{axesColorDefault(p)} sets the default color of the axes in a 2D viewport to the palette \spad{p}.
134486`\spad{B1solve(s)} solves the system (\spad{s}.mat) \spad{z} = \spad{s}.vec for the variables given by the column indices of \spad{s}.cols in terms of the other variables and the right hand side \spad{s}.vec by assuming that the rank is \spad{s}.rank,{} that the system is consistent,{} with the linearly independent equations indexed by the given row indices \spad{s}.rows; the coefficients in \spad{s}.mat involving parameters are treated as polynomials. B1solve(\spad{s}) returns a particular solution to the system and a basis of the homogeneous system (\spad{s}.mat) \spad{z} = 0.
134785`\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.
134829`\spad{backOldPos(genPos)} takes the result produced by \spadfunFrom{generalPosition}{PolynomialIdeal} and performs the inverse transformation,{} returning the original ideal \spad{backOldPos(generalPosition(I,{} listvar))} = \spad{I}.
134949`\spad{badNum(p)} \undocumented
135045`\spad{badNum(u)} \undocumented
135116`\spad{badValues(p)} returns the list of "bad values" for \spad{p}; \spad{p} is not allowed to match any of its "bad values".
135185`\spad{balancedBinaryTree(n,{} s)} creates a balanced binary tree with \spad{n} nodes each with value \spad{s}.
135266`\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]}.
135358`\spad{balancedFactorisation(a,{} b)} returns a factorisation \spad{a = p1^e1 ... pm^em} such that each \spad{\spad{pi}} is balanced with respect to \spad{b}.
135444`Generate a cubical complex of the surface of a cylinder without ends
135519`Generate a minimal triangulation of the surface of a cylinder without ends
135599`\spad{bandedHessian(v,{} xlist,{} k)} computes the hessian,{} the matrix of second partial derivatives,{} of the scalar field \spad{v},{} \spad{v} a function of the variables listed in \spad{xlist},{} \spad{k} is the semi-bandwidth,{} the number of nonzero subdiagonals,{} 2*k+1 being actual bandwidth. Stores the nonzero band in lower triangle in a matrix,{} dimensions \spad{k+1} by \#xlist,{} whose rows are the vectors formed by diagonal,{} subdiagonal,{} etc. of the real,{} full-matrix,{} hessian. (The notation conforms to LAPACK/NAG-\spad{F07} conventions.)
135712`\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,{} ku is the number of nonzero superdiagonals,{} \spad{kl+ku+1} being actual bandwidth. Stores the nonzero band in a matrix,{} dimensions \spad{kl+ku+1} by \#xlist. The upper triangle is in the top 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.)
135848`\spad{bandMatrix} returns multiple diagonals out of a matrix. The diagonals are put into a matrix of same shape as the original one. Positive integer arguments select upper off-diagonals,{} negative ones lower off-diagonals.
135946`\spad{bandMatrix} returns multiple diagonals out of a matrix. The diagonals are put into a matrix of same shape as the original one. Positive integer arguments select upper off-diagonals,{} negative ones lower off-diagonals.
136047`\spad{base()} returns the base of the model
136099`\spad{base()} returns the base for the operations of \spad{IntegerNumberSystem}.
136144`\spad{base()} returns the base of the \spadfunFrom{exponent}{FloatingPointSystem}.
136203`\spad{base(b)} sets the base of the model to \spad{b}
136270`\spad{base(gp)} returns a base for the group {\em gp}.
136322`\spad{BasicMethod(n)} returns the factorization of integer \spad{n} by trial division
136516`\spad{basicSet(ps,{} redOp?)} returns \spad{[bs,{} ts]} where \spad{concat(bs,{} ts)} is \spad{ps} and \spad{bs} is a basic set in Wu Wen Tsun sense of \spad{ps} with respect to the reduction-test \spad{redOp?},{} if no non-zero constant polynomial lie in \spad{ps},{} otherwise \spad{"failed"} is returned.
136771`\spad{basicSet(ps,{} pred?,{} redOp?)} returns the same as \spad{basicSet(qs,{} redOp?)} where \spad{qs} consists of the polynomials of \spad{ps} satisfying property \spad{pred?}.
136906`\spad{basis()} returns the fixed \spad{R}-module basis.
137063`\spad{basis LV} extracts a basis of the subspace spanned by the list of vectors \spad{LV}.
137124`\spad{basis(n)} \undocumented{} See \spadfunFrom{basis}{FiniteAlgebraicExtensionField}
137217`\spad{basis((f1,{} ...,{} fn))} = the vector \spad{[f1,{} ...,{} fn]}.
137293`\spad{basis((f1,{} ...,{} fn))} returns the vector \spad{[f1,{} ...,{} fn]}.
137354`\spad{basis(n)} returns a fixed basis of a subfield of \% as \spad{F}-vector space.
137449`\spad{basis(va)} selects a basis from the elements of \spad{va}.
137534`\spad{basis(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
137627`\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}.
137687`\spad{basisOfCentroid()} returns a basis of the centroid,{} \spadignore{i.e.} the endomorphism ring of \spad{A} considered as \spad{(A,{} A)}-bimodule.
137757`\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}.
137828`\spad{basisOfLeftAnnihilator(a)} returns a basis of the space of all \spad{x} of \spad{A} satisfying \spad{0 = x*a}.
137898`\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}.
137963`\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.
138036`\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}.
138103`\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}.
138164`\spad{basisOfRightAnnihilator(a)} returns a basis of the space of all \spad{x} of \spad{A} satisfying \spad{0 = a*x}.
138235`\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}.
138301`\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.
138375`\spad{bat1(llp)} unbumps a tableau \spad{llp}. Operation \spad{bat1} is the inverse of \spad{tab1}.
138450`\spad{bat(ls)} unbumps a tableau \spad{ls}
138521`\spad{beauzamyBound(p)} returns a bound on the larger coefficient of any factor of \spad{p}.
138605`\spad{belong?(op)} is \spad{true} if \spad{op} is an algebraic operator,{} that is,{} an \spad{n}th root or implicit algebraic operator.
138675`\spad{belong?(op)} returns \spad{true} if \spad{op} is a combinatorial operator.
138749`\spad{belong?(p)} returns \spad{true} if operator \spad{p} is elementary
138820`\spad{belong?(op)} returns \spad{true} if \spad{op} is a special function operator.
138898`\spad{belong?(op)} checks if \spad{op} is Liouvillian
138970`\spad{belong?(op)} tests if \% accepts \spad{op} as applicable to its elements.
139105`\spad{belong?(op)} tests if \% accepts \spad{op} as applicable to its elements.
139172`\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)}.
139285`\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.
139367`\spad{bernoulliB(n,{} r)} returns value of the \spad{n}th Bernoulli polynomial at \spad{r}.
139489`\spad{bernoulliDistribution01(a)} produces the distribution of a projection of trace a
139571`\spad{besselI(x,{} y)} returns the Bessel \spad{I} function applied to \spad{x} and \spad{y}.
139633`\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}.}
139749`\spad{besselI(v,{} z)} is the modified Bessel function of the first kind.
139804`\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}.}
139893`\spad{besselJ(x,{} y)} returns the Bessel \spad{J} function applied to \spad{x} and \spad{y}.
139955`\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}.}
140071`\spad{besselJ(v,{} z)} is the Bessel function of the first kind.
140126`\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}.}
140215`\spad{besselK(x,{} y)} returns the Bessel \spad{K} function applied to \spad{x} and \spad{y}.
140277`\spad{besselK(v,{} x)} is the modified Bessel function of the second 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 implementation uses the relation \indented{2}{\spad{K(v,{} x) = \%pi/2*(I(-v,{} x) - I(v,{} x))/sin(v*\%\spad{pi})}} so is not valid for integer values of \spad{v}.
140393`\spad{besselK(v,{} z)} is the modified Bessel function of the second kind.
140448`\spad{besselK(v,{} x)} is the modified Bessel function of the second 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 implementation uses the relation \indented{2}{\spad{K(v,{} x) = \%pi/2*(I(-v,{} x) - I(v,{} x))/sin(v*\%\spad{pi})}.} so is not valid for integer values of \spad{v}.
140537`\spad{besselY(x,{} y)} returns the Bessel \spad{Y} function applied to \spad{x} and \spad{y}.
140599`\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 implementation uses the relation \indented{2}{\spad{Y(v,{} x) = (J(v,{} x) cos(v*\%\spad{pi}) - J(-v,{} x))/sin(v*\%\spad{pi})}} so is not valid for integer values of \spad{v}.
140715`\spad{besselY(v,{} z)} is the Bessel function of the second kind.
140770`\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 implementation uses the relation \indented{2}{\spad{Y(v,{} x) = (J(v,{} x) cos(v*\%\spad{pi}) - J(-v,{} x))/sin(v*\%\spad{pi})}} so is not valid for integer values of \spad{v}.
140859`\spad{Beta()} returns symbol for capital greek letter beta.
140909`\spad{beta()} returns symbol for small greek letter beta.
140959`\spad{Beta(x,{} y)} returns the beta function applied to \spad{x} and \spad{y}.
141018`\spad{Beta(n,{} m)} \undocumented
141222`\spad{Beta(x,{} y)} is the Euler Beta function.
141311`\spad{Beta(x,{} y)} is \spad{Gamma(x) * Gamma(y)/Gamma(x+y)}.
141445`\spad{Beta(x,{} y)} is the Euler Beta function.
141507`\spad{Beta(x,{} a,{} b)} is incomplete Beta function applied to \spad{x},{} a and \spad{b}.
141568`\spad{Beta(x,{} a,{} b)} is the incomplete Beta function.
141622`\spad{bezoutDiscriminant(p)} computes the discriminant of a polynomial \spad{p} by computing the determinant of a Bezout matrix.
141865`\spad{bezoutMatrix(p,{} q)} returns the Bezout matrix for the two polynomials \spad{p} and \spad{q}.
141932`\spad{bezoutResultant(p,{} q)} computes the resultant of the two polynomials \spad{p} and \spad{q} by computing the determinant of a Bezout matrix.
142108`\spad{binary(r)} converts a rational number to a binary expansion.
142168`\spad{binary(h1,{} h2)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats the first argument according to \spad{h1} and the second argument by \spad{h2}. Both boxes will be horizontally concatenated. binary(\spad{h1},{} \spad{h2}) is equal to infix(\spad{""},{} maxPrecedence(),{} \spad{h1},{} \spad{h2})
142324`\spad{binary(h1,{} h2)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats the first argument according to \spad{h1} and the second argument by \spad{h2}. Both boxes will be horizontally concatenated. binary(\spad{h1},{} \spad{h2}) is equal to infix(\spad{""},{} maxPrecedence(),{} \spad{h1},{} \spad{h2})
142484`\spad{binary(op,{} [a1,{} ...,{} an])} returns the input form corresponding to \spad{a1 op a2 op ... op an}.
142530`\spad{binaryFunction(s)} is a local function
142618`\spad{binarySearch(x,{} f)} searches \spad{x} in the cache,{} calling \spad{f(x,{} y)} to determine order. It returns \spad{y} from cache if \spad{f}(\spad{x},{} \spad{y}) is 0 or "failed" if no such \spad{y} exists.
142698`\spad{binarySearchTree(l)} constructs a binary search tree with elements from list \spad{l}.
142762`\spad{binaryTournament(ls)} creates a binary tournament with the elements of \spad{ls} as values of the nodes.
142826`\spad{binaryTree(v)} is an non-empty binary tree with value \spad{v},{} and left and right empty.
142872`\spad{binaryTree(l,{} v,{} r)} creates a binary tree with value \spad{v} and left subtree \spad{l} and right subtree \spad{r}.
142922`if this is a lambda term then replace string name in sub-nodes with De Bruijn index
142959`\spad{binomial(n,{} m)} creates a form for the binomial coefficient of \spad{n} and \spad{m}.
143002`\spad{binomial(n,{} r)} returns the number of subsets of \spad{r} objects taken among \spad{n} objects,{} \spadignore{i.e.} \spad{n!/}(\spad{r!} * (\spad{n}-\spad{r})!).
143061`\spad{binomial(n,{} f)} \undocumented
143152`\spad{binomial} is a handler such that \spad{binomial(prec,{}args)} formats a binomial expression of the first two arguments.
143282`\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}.
143344`\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.
143490`\spad{binomThmExpt(p,{} q,{} n)} returns \spad{(p+q)^n} by means of the binomial theorem trick.
143596`\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))}.
143665`\spad{bipolarCylindrical(a)} transforms from bipolar cylindrical coordinates to Cartesian coordinates: \spad{bipolarCylindrical(a)} is a function which \spad{++} 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}.
143745`\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.
143810`\spad{birth(x)} \undocumented
143904`\spad{bit?(n,{} i)} returns \spad{true} if and only if \spad{i}-th bit of \spad{n} is a 1.
143958`\spad{bitCoef(n,{} m)} returns the coefficient of 2^m in two complement representation of \spad{n}.
144030`\spad{bits()} returns ceiling\spad{'s} precision in bits.
144089`\spad{bits(n)} set the \spadfunFrom{precision}{FloatingPointSystem} to \spad{n} bits.
144188`\spad{bits(n,{} b)} creates bits with \spad{n} values of \spad{b}
144244`\spad{bitTruth(n,{} m)} returns \spad{true} if coefficient of 2^m in two complement representation of \spad{n} is 1.
144317`\spad{bivariate?(p)} returns \spad{true} iff \spad{p} involves two and only two variables.
144394`\spad{bivariatePolynomials(lp)} returns \spad{bps,{} nbps} where \spad{bps} is a list of the bivariate polynomials,{} and \spad{nbps} are the other ones.
144520`\spad{bivariateSLPEBR(lp,{} p,{} v)} implements the bivariate case of \spadfun{solveLinearPolynomialEquationByRecursion}; its implementation depends on \spad{R}
144727`\spad{blankSeparate(l)} creates the form separating the elements of \spad{l} by blanks.
144779`\spad{block(l)} creates a representation of the statements in \spad{l} as a block.
144906`\spad{blockConcat(ll)} concatenates arrays row and column wise,{} building a array from blocks. The order is row major as in \spad{matrix}.
144990`\spad{blockElimination(f,{} rsrc,{} rdst,{} csrc,{} cdst)} flg_u = \spad{true},{} flg_v = \spad{true}
145169`\spad{blockElimination(f,{} rsrc,{} rdst,{} flg_u,{} csrc,{} cdst,{} flg_v)} returns transformation matrices if it is possible to eliminate all entries in \spad{rdst} \spad{x} \spad{cdst} (including columns in \spad{u} if \spad{flg_u} = \spad{true},{} including rows in \spad{v} if flg_v = \spad{true}) by using rows in \spad{rsrc} and columns in \spad{csrc}. Otherwise an empty list.
145364`\spad{blockElimination(p,{} rsrc,{} rdst,{} rext,{} csrc,{} cdst,{} cext)} r___ rows,{} c___ columns _src source,{} _dst destination,{} _ext extra (zeros) Uses a linear system of equations to determine row and column transformation matrices to eliminate the entries in rdst+rext \times cdst+cext and returns an empty list if there is no solution.
145612`\spad{blockSplit} splits a matrix into multiple submatrices row and column wise,{} dividing a matrix into blocks.
145729`\spad{blockSplit} splits a matrix into multiple submatrices row and column wise,{} dividing a matrix into blocks.
146090`\spad{blockSplit(a,{} [n1,{}...,{}\spad{ni}],{} [m1,{}...,{}\spad{mi}])} splits a into multiple subarraus row and column wise,{} such that element at position \spad{k},{} \spad{l} has \spad{nk} rows and \spad{ml} columns. Error: if number of rows of a is different than \spad{n1} + ... + \spad{ni} or number of columns of a is different than \spad{m1} + ... + \spad{mj}
146223`\spad{blockSplit(a,{} n,{} m)} splits a into \spad{n*m} subarrays of equal size row and column wise,{} dividing a into blocks. Error: if number of rows of a is not divisible by \spad{n} or number of columns of a is not divisible by \spad{m}.
146338`\spad{blockStructure(f)} analyzes the structure of the ALS of \spad{f} and detects blocks with respect to an upper triangular structure. Entry (\spad{i},{}1) contains the first row,{} (\spad{i},{}2) the last row,{} (\spad{i},{}3) the size and (\spad{i},{}4) if block \spad{i} is refined.
146426`\spad{blue()} returns the position of the blue hue from total hues.
146457`\spad{bombieriNorm(p)} returns quadratic Bombieri\spad{'s} norm of \spad{p}.
146534`\spad{bombieriNorm(p,{} n)} returns the \spad{n}th Bombieri\spad{'s} norm of \spad{p}.
146627`\spad{booleanConvolution(x,{} y)} returns the boolean convolution of the distributions \spad{x} and \spad{y}
146693`\spad{booleanCumulant2moment(cc)} computes the sequence of moments from the sequence of boolean cumulants \spad{cc}
146774`\spad{booleanCumulant(x,{} n)} returns the \spad{n}-th boolean cumulant of the distribution \spad{x}
146851`\spad{booleanCumulantFromJacobi(n,{} aa,{} bb)} computes the \spad{n}th Boolean cumulant from the given Jacobiparameters \spad{aa} and \spad{bb}.
146944`\spad{booleanCumulants(x)} returns the sequence of boolean cumulants of the distribution \spad{x}.
147016`boolean word permutation find all permutations of numZeros and numOnes used by product to calculate all paths through lattice
147121`recursive part of boolWordPermute
147246`\spad{bottom(x)} returns the bottom entry of each column.
147316`\spad{bottom(d)} returns the element at the bottom (back) of the dequeue.
147364`\spad{bound(n,{} m,{} q)} computes an upper bound for the number of prolongations needed to make the symbol of an equation of order \spad{q} with \spad{n} independent and \spad{m} dependent variables involutive.
147485`Boundary operator. Step down to the next lower dimension,{} this is like hollowing out the complex. It takes the highest dimension entries and replaces them with their boundaries,{} cancelling out where it can.
147540`Step down to the next lower dimension,{} this is like hollowing out the complex. It takes the highest dimension entries and replaces them with their boundaries,{} cancelling out where it can.
147598`construct the boundary. This is like hollowing out the facet.
147647`construct the boundary. This is like hollowing out the facet.
147697`\spad{boundary(n,{} fontScale)} returns the boundary of a given node,{} so if this is called on the root node,{} it will return the boundary of the whole scene. There is a difficulty involving text nodes,{} that is they have a fixed font size. But we want to calculate the boundary in local coordinates,{} to do this conversion we need to know the total boundary size but that is what we are trying to calculate! To get round this contradiction the parameter fontScale is required since fonts are rendered at a fixed size we need a scaling factor so that we can give the boundary in our coordinate system. fontScale should be set to the full width of the diagram (not just the width of this node). If this is not known then choose an approximate value. This only affects text nodes,{} if this node,{} or its subnodes,{} do not contain a text node then its value is not significant.
147761`\spad{boundOfCauchy(p)} bounds the roots of \spad{p}
147883`\spad{box(f)} encloses \spad{f} in a box.
147919`\spad{box(hh)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats the arguments via \spad{hh(prec,{} args)} and then draws a box frame around the resulting box.
148077`\spad{box(s)} creates a box that contains the string \spad{s}.
148117`\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).
148162`\spad{boxBoundary(c1,{} c2)} constructs a box boundary (\spad{n}-dimensional axis-aligned rectangle) with given parameters \spad{c1:} \spad{PT} holds minimum coordinates \spad{c2:} \spad{PT} holds maximum coordinates
148213`\spad{brace(f)} creates the form enclosing \spad{f} in braces (curly brackets).
148251`\spad{brace(lf)} creates the form separating the elements of \spad{lf} by commas and encloses the result in curly brackets.
148295`\spad{bracket(f)} creates the form enclosing \spad{f} in square brackets.
148335`\spad{bracket(lf)} creates the form separating the elements of \spad{lf} by commas and encloses the result in square brackets.
148381`\spad{bracket(lb,{} rb,{} hh)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats its first argument according to \spad{hh} and then put left and right brackets given by \spad{lb} and \spad{rb} around the resulting box.
148514`\spad{bracket(lb,{} rb,{} hh)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats its first argument according to \spad{hh} and then put left and right brackets given by \spad{lb} and \spad{rb} around the resulting box.
148651`\spad{branchIfCan(leq,{} ts,{} lineq,{} b1,{} b2,{} b3,{} b4,{} b5)} is an internal subroutine,{} exported only for development.
148830`\spad{branchIfCan(leq,{} ts,{} lineq,{} b1,{} b2,{} b3,{} b4,{} b5)} is an internal subroutine,{} exported only for development.
149019`\spad{branchPoint?(a)} tests whether \spad{x = a} is a branch point.
149092`\spad{branchPoint?(p)} tests whether \spad{p(x) = 0} is a branch point.
149166`\spad{branchPointAtInfinity?()} tests if there is a branch point at infinity.
149248`\spad{bright(c)} sets the shade of a hue,{} \spad{c},{} above dim,{} but below pastel.
149288`\spad{bright(l)} sets the font property of a list of strings,{} \spad{l},{} to bold-face type.
149353`\spad{bright(s)} sets the font property of the string \spad{s} to bold-face type.
149412`\spad{brillhartIrreducible?(p)} returns \spad{true} if \spad{p} can be shown to be irreducible by a remark of Brillhart,{} \spad{false} is inconclusive.
149481`\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 noLinears is \spad{true},{} we are being told \spad{p} has no linear factors \spad{false} does not mean that \spad{p} is reducible.
149558`\spad{brillhartTrials()} returns the number of tests in \spadfun{brillhartIrreducible?}.
149630`\spad{brillhartTrials(n)} sets to \spad{n} the number of tests in \spadfun{brillhartIrreducible?} and returns the previous value.
149720`\spad{bringDown(f)} replaces transcendental kernels in \spad{f} by random integers. Error if \spad{f} contains algebraic kernel.
149792`\spad{bringDown(f,{} k)} is like bringDown(\spad{f}) but \spad{k} is algebraic kernel and the result is reduced modulo minimal polynomial of \spad{k}.
149902`\spad{bsolve(c,{} w,{} r,{} s,{} m)} returns a list of regimes and solutions of the system \spad{c} \spad{z} = \spad{w} for ranks at least \spad{r}; depending on the mode \spad{m} chosen,{} it writes the output to a file given by the string \spad{s}.
150237`\spad{btwFact(p,{} sqf,{} pd,{} r)} returns the factorization of \spad{p},{} the result is a Record such that \spad{contp=}content \spad{p},{} \spad{factors=}List of irreducible factors of \spad{p} with exponent. If \spad{sqf=true} the polynomial is assumed to be square free (\spadignore{i.e.} without repeated factors). \spad{pd} is the \spadtype{Set} of possible degrees. \spad{r} is a lower bound for the number of factors of \spad{p}. Please do not use this function in your code because its design may change.
150416`\spad{bubbleSort!(a)} \undocumented
150483`\spad{bubbleSort!(a,{} f)} \undocumented
150548`\spad{build(r,{} i,{} e)} \undocumented
150620`\spad{BumInSepFFE(f)} is a local function,{} exported only because it has multiple conditional definitions.
150858`\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
150986`\spad{bumptab1(pr,{} t)} bumps a tableau \spad{t} with a pair \spad{pr} using comparison function \spadfun{<},{} returning a new tableau
151079`\spad{bumptab(cf,{} pr,{} t)} bumps a tableau \spad{t} with a pair \spad{pr} using comparison function \spad{cf},{} returning a new tableau
151186`\spad{s by n} creates a new segment in which only every \spad{n}\spad{-}th element is used.
151237`\spad{cAcos(f)} computes the arccosine of the power series \spad{f}. For use when the coefficient ring is commutative.
151339`\spad{cAcosh(f)} computes the inverse hyperbolic cosine of the power series \spad{f}. For use when the coefficient ring is commutative.
151442`\spad{cAcot(f)} computes the arccotangent of the power series \spad{f}. For use when the coefficient ring is commutative.
151544`\spad{cAcoth(f)} computes the inverse hyperbolic cotangent of the power series \spad{f}. For use when the coefficient ring is commutative.
151647`\spad{cAcsc(f)} computes the arccosecant of the power series \spad{f}. For use when the coefficient ring is commutative.
151749`\spad{cAcsch(f)} computes the inverse hyperbolic cosecant of the power series \spad{f}. For use when the coefficient ring is commutative.
151852`\spad{calcRanges(l)} \undocumented
151948`\spad{call(s)} creates a representation of a FORTRAN CALL statement
151991`\spad{canonicalBasis n} builds the canonical basis of the vector space of dimension \spad{n}.
152064`\spad{canonicalIfCan(x,{} m)} tries to divide \spad{x} by its leading coefficient modulo \spad{m}.
152164`\spad{canonicalMoebiusFunction(pp)} inverts the canonical zeta function
152254`\spad{cap(s1,{} s2)},{} introduced by Redfield,{} \indented{1}{is the scalar product of two cycle indices.}
152387`\spad{car((a1,{} ...,{} an))} returns \spad{a1}.
152519`\spad{cardinality(u)} returns the number of elements of \spad{u}. Note: \spad{cardinality(u) = \#u}.
152591`\spad{carmichaelLambda(n)} returns exponent of the multiplicative group of integers modulo \spad{n},{} that is smallest positive integer \spad{k} such that \spad{i^k rem n = 1} for all \spad{i} relatively prime to \spad{n}.
152670`\spad{cartesian([S1,{} S2,{} ...])} returns the set of lists [\spad{s1},{} \spad{s2},{} ...] with \spad{si} in \spad{Si}
152740`\spad{cartesian(pt)} returns the Cartesian coordinates of point \spad{pt}.
152806`\spad{cartesian(a,{} b)} returns a Cartesian product: the vertex set of \spad{G} \spad{o} \spad{H} is the Cartesian product \spad{V}(\spad{G}) \times \spad{V}(\spad{H}) and any two vertices (\spad{u},{} u') and (\spad{v},{} \spad{v'}) \indented{1}{are adjacent in \spad{G} \spad{o} \spad{H} if and only if either} \spad{u} = \spad{v} and u' is adjacent with \spad{v'} in \spad{H},{} or u' = \spad{v'} and \spad{u} is adjacent with \spad{v} in \spad{G}.
152882`Cartesian product doubles the size of next list in each object,{} that is it produces two arrows out of every node
152968`Cartesian product: the vertex set of \spad{G} \spad{o} \spad{H} is the Cartesian product \spad{V}(\spad{G}) \times \spad{V}(\spad{H}) and any two vertices (\spad{u},{} u') and (\spad{v},{} \spad{v'}) \indented{1}{are adjacent in \spad{G} \spad{o} \spad{H} if and only if either} \spad{u} = \spad{v} and u' is adjacent with \spad{v'} in \spad{H},{} or u' = \spad{v'} and \spad{u} is adjacent with \spad{v} in \spad{G}.
153048`Cartesian product: the vertex set of \spad{G} \spad{o} \spad{H} is the Cartesian product \spad{V}(\spad{G}) \times \spad{V}(\spad{H}) and any two vertices (\spad{u},{} u') and (\spad{v},{} \spad{v'}) \indented{1}{are adjacent in \spad{G} \spad{o} \spad{H} if and only if either} \spad{u} = \spad{v} and u' is adjacent with \spad{v'} in \spad{H},{} or u' = \spad{v'} and \spad{u} is adjacent with \spad{v} in \spad{G}.
153128`\spad{cartesianPower(S,{} n)} returns the \spad{n}-th cartesian power of the list \spad{S}
153216`\spad{cAsec(f)} computes the arcsecant of the power series \spad{f}. For use when the coefficient ring is commutative.
153318`\spad{cAsech(f)} computes the inverse hyperbolic secant of the power series \spad{f}. For use when the coefficient ring is commutative.
153421`\spad{cAsin(f)} computes the arcsine of the power series \spad{f}. For use when the coefficient ring is commutative.
153523`\spad{cAsinh(f)} computes the inverse hyperbolic sine of the power series \spad{f}. For use when the coefficient ring is commutative.
153626`\spad{catalan(n)} returns the \spad{n}-th Catalan number
153687`\spad{cAtan(f)} computes the arctangent of the power series \spad{f}. For use when the coefficient ring is commutative.
153789`\spad{cAtanh(f)} computes the inverse hyperbolic tangent of the power series \spad{f}. For use when the coefficient ring is commutative.
153892`\spad{cCos(f)} computes the cosine of the power series \spad{f}. For use when the coefficient ring is commutative.
153993`\spad{cCosh(f)} computes the hyperbolic cosine of the power series \spad{f}. For use when the coefficient ring is commutative.
154095`\spad{cCot(f)} computes the cotangent of the power series \spad{f}. For use when the coefficient ring is commutative.
154196`\spad{cCoth(f)} computes the hyperbolic cotangent of the power series \spad{f}. For use when the coefficient ring is commutative.
154298`\spad{cCsc(f)} computes the cosecant of the power series \spad{f}. For use when the coefficient ring is commutative.
154399`\spad{cCsch(f)} computes the hyperbolic cosecant of the power series \spad{f}. For use when the coefficient ring is commutative.
154501`\spad{cdr((a1,{} ...,{} an))} returns \spad{(a2,{} ...,{} an)}.
154563`\spad{ceiling(x)} returns the smallest integer above or equal \spad{x}.
154668`\spad{ceiling x} returns the small integer \spad{>= x}.
154714`\spad{ceiling(x)} returns the smallest integer above or equal \spad{x}.
154767`\spad{ceiling(x)} returns the smallest integral element above \spad{x}.
154847`\spad{center(f)} centers form \spad{f} in total space.
154886`\spad{center(f)} returns the point about which the series \spad{f} is expanded.
154959`\spad{center(f,{} n)} centers form \spad{f} within space of width \spad{n}.
155006`\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}.
155086`\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.
155154`\spad{certainlySubVariety?(newlp,{} lp)} returns \spad{true} iff for every \spad{p} in \spad{lp} the remainder of \spad{p} by \spad{newlp} using the division algorithm of Groebner techniques is zero.
155255`\spad{cExp(f)} computes the exponential of the power series \spad{f}. For use when the coefficient ring is commutative.
155356`returns a matrix sequence representing the face maps in linear algebra form
155411`returns a matrix sequence representing the face maps in linear algebra form
155474`returns a matrix sequence representing the face maps in linear algebra form For more information: \url{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/chain/index.\spad{htm}}
155540`constructor
155607`\spad{chainSubResultants(P,{} Q)} computes the list of non zero subresultants of \spad{P} and \spad{Q}.
155696`\spad{changeBase(exp,{} man,{} base)} \undocumented{}
155771`\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
155878`\spad{changeExprLength(i)} changes limit on expression length by \spad{i}.
155942`\spad{changeVar(+/[\spad{ai} D^i],{} a)} returns the operator \spad{+/[\spad{ai} (D+a)\spad{^i}]}.
156015`\spad{changeVar(+/[\spad{ai} D^i],{} a)} returns the operator \spad{+/[\spad{ai} (D+a)\spad{^i}]}.
156177`\spad{changeWeightLevel(n)} changes the weight level to the new value given: \spad{NB:} previously calculated terms are not affected
156284`\spad{char(i)} provides a character corresponding to the integer code \spad{i}. It is always \spad{true} that \spad{ord char i = i}.
156326`\spad{char(s)} provides a character from a string \spad{s} of length one.
156367`\spad{character?(t)} tests whether \spad{t} is equivalent to the FORTRAN type CHARACTER.
157144`\spad{characteristic()} returns the characteristic of the ring.
157215`\spad{characteristicPolynomial(e)} returns the characteristic polynomial of \spad{e} using resultants
157319`\spad{characteristicPolynomial(m)} returns the characteristic polynomial of the matrix \spad{m}
157422`\spad{characteristicPolynomial(m)} computes the characteristic polynomial of the matrix \spad{m}.
157756`\spad{characteristicPolynomial(m)} returns the characteristic polynomial of the matrix \spad{m} expressed as polynomial over complex rationals with a new symbol as variable.
157904`\spad{characteristicPolynomial(m)} returns the characteristic polynomial of the matrix \spad{m} expressed as polynomial over \spad{RN} with a new symbol as variable.
158031`\spad{characteristicPolynomial(m)} returns the characteristicPolynomial of the matrix \spad{m} using a new generated symbol symbol as the main variable.
158135`\spad{characteristicPolynomial(a)} returns the characteristic polynomial of the regular representation of \spad{a} with respect to any basis.
158206`\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 \spad{'x},{} then it returns the characteristic polynomial expressed as a polynomial in \spad{'x}.
158290`\spad{characteristicPolynomial(m,{} x)} returns the characteristic polynomial of the matrix \spad{m} expressed as polynomial over Complex Rationals with variable \spad{x}.
158445`\spad{characteristicPolynomial(m,{} x)} returns the characteristic polynomial of the matrix \spad{m} expressed as polynomial over \spad{RN} with variable \spad{x}.
158579`\spad{characteristicPolynomial(m,{} var)} returns the characteristicPolynomial of the matrix \spad{m} using the symbol var as the main variable.
158690`\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 \spad{'x},{} then it returns the characteristic polynomial expressed as a polynomial in \spad{'x}.
158781`\spad{characteristicSerie(ps)} returns the same as \spad{characteristicSerie(ps,{} initiallyReduced?,{} initiallyReduce)}.
158866`\spad{characteristicSerie(ps,{} redOp?,{} redOp)} returns a list \spad{lts} of triangular sets such that the zero set of \spad{ps} is the union of the regular zero sets of the members of \spad{lts}. This is made by the Ritt and Wu Wen Tsun process applying the operation \spad{characteristicSet(ps,{} redOp?,{} redOp)} to compute characteristic sets in Wu Wen Tsun sense.
158975`\spad{characteristicSet(ps)} returns the same as \spad{characteristicSet(ps,{} initiallyReduced?,{} initiallyReduce)}.
159068`\spad{characteristicSet(ps,{} redOp?,{} redOp)} returns a non-contradictory characteristic set of \spad{ps} in Wu Wen Tsun sense with respect to the reduction-test \spad{redOp?} (using \spad{redOp} to reduce polynomials with respect to a \spad{redOp?} basic set),{} if no non-zero constant polynomial appear during those reductions,{} else \spad{"failed"} is returned. The operations \spad{redOp} and \spad{redOp?} must satisfy the following conditions: \spad{redOp?(redOp(p,{} q),{} q)} holds for every polynomials \spad{p,{} q} and there exists an integer \spad{e} and a polynomial \spad{f} such that we have \spad{init(q)^e*p = f*q + redOp(p,{} q)}.
159185`\spad{charClass(l)} creates a character class which contains exactly the characters given in the list \spad{l}.
159245`\spad{charClass(s)} creates a character class which contains exactly the characters given in the string \spad{s}.
159296`\spad{charlierC(n,{} a,{} z)} is the Charlier polynomial.
159362`\spad{charlierC(n,{} a,{} z)} is the Charlier polynomial.
159421`\spad{char_pol(m)} computes characteristic polynomial of \spad{m}.
159516`\spad{charpol(m)} computes the characteristic polynomial of a matrix \spad{m} with entries in \spad{K}.
159615`\spad{char_pol_via_berkovitz(m)} computes characteristic polynomial of \spad{m}.
159724`\spad{char_pol_via_den_interpolation(m)} computes characteristic polynomial of \spad{m}.
159877`\spad{char_pol_via_interpolation(m)} computes characteristic polynomial of \spad{m}.
160406`\spad{charthRoot(a)} takes the characteristic'th root of {\em a}. Note: such a root is always defined in finite fields.
160458`\spad{charthRoot(x)} returns the \spad{p}th root of \spad{x} where \spad{p} is the characteristic of the ring.
160528`\spad{charthRoot(r)} returns the \spad{p}\spad{-}th root of \spad{r},{} or "failed" if none exists in the domain.
160636`\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)}.
160740`\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..)}.
160824`\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)}.
160928`\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..)}.
161012`\spad{check(d)} specifies how we want to check the solution. If the value is "skip",{} we return the solutions found by the interpolation routine without checking. If the value is "MonteCarlo",{} we use a probabilistic check. The default is "deterministic".
161118`\spad{check(s)} returns lllpt,{} list of lists of lists of point information about the \spadtype{ThreeSpace} \spad{s}.
161167`\spad{check(d)} specifies how we want to check the solution. If the value is "skip",{} we return the solutions found by the interpolation routine without checking. If the value is "MonteCarlo",{} we use a probabilistic check. This option is expressed in the form \spad{check == d}
161247`\spad{check should} be local
161469`\spad{checkExtraValues(d)} specifies whether we want to check the solution beyond the order given by the degree bounds. The default is \spad{true}.
161551`\spad{checkExtraValues(d)} specifies whether we want to check the solution beyond the order given by the degree bounds. This option is expressed in the form \spad{checkExtraValues == d}
161607`\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.
161771`\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.
161926`\spad{checkOptions checks} whether the given options are consistent,{} and yields an error otherwise
162001`\spad{checkRur(ts,{} lus)} returns \spad{true} if \spad{lus} is a rational univariate representation of \spad{ts}.
162107`\spad{check_sol1a performs} one round of modular Monte Carlo check for solutions.
162276`\spad{checkType(t)}
162334`\spad{Chi()} returns symbol for capital greek letter chi.
162383`\spad{chi()} returns symbol for small greek letter chi.
162432`\spad{Chi(f)} denotes the hyperbolic cosine integral
162482`\spad{Chi(x)} returns the hyperbolic cosine integral of \spad{x},{} \spadignore{i.e.} the integral of \spad{cosh(x) / x dx}.
162535`\spad{Chi(f)} denotes the hyperbolic cosine integral
162680`\spad{Chi(f)} denotes the hyperbolic cosine integral
162851`\spad{child(x,{} n)} \undocumented
162911`\spad{child?(u,{} v)} tests if node \spad{u} is a child of node \spad{v}.
163165`\spad{children(x)} \undocumented
163215`\spad{children(u)} returns a list of the children of aggregate \spad{u}. Error: if \spad{u} is empty.
163273`\spad{chineseRemainder(llv,{} lm)} returns a list of values,{} each of which corresponds to the Chinese remainder of the associated element of \spad{llv} and \spad{lm}. This is more efficient than applying chineseRemainder several times.
163351`\spad{chineseRemainder(lv,{} lm)} returns a value \spad{v} such that,{} if \spad{x} is \spad{lv.i} modulo \spad{lm.i} for all \spad{i},{} then \spad{x} is \spad{v} modulo \spad{lm(1)*lm(2)*...*lm(n)}.
163417`\spad{chineseRemainder(lu,{} lr,{} n)} \undocumented
163639`\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.
163742`\spad{chinese_update(v,{} p,{} r)} informs \spad{r} about evaluation at \spad{p}
163826`\spad{chinese_update(v,{} pt,{} r)} informs \spad{r} that evaluation at \spad{pt} gave vector of values \spad{v}
163910`\spad{chiSquare1(n)} \undocumented
163988`\spad{chiSquare(n)} \undocumented
164069`\spad{choosemon }\undocumented
164247`\spad{chvar(lf,{} p)} is like chvar(\spad{f},{} \spad{p}) but handles list of functions
164403`\spad{chvar(f(x,{} y),{} p(x,{} y))} returns \spad{[g(z,{} t),{} q(z,{} t),{} c1(x),{} c2(x),{} n]} such that under the change of variable \spad{z = c1(x)},{} \spad{t = y * c2(x)},{} one gets \spad{f(x,{} y) = c1'(x)g(c1(x),{} c2(x)y)} 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}.
164547`\spad{\spad{Ci}(f)} denotes the cosine integral
164596`\spad{\spad{Ci}(x)} returns the cosine integral of \spad{x},{} \spadignore{i.e.} the integral of \spad{cos(x) / x dx}.
164648`\spad{\spad{Ci}(f)} denotes the cosine integral
164791`\spad{\spad{Ci}(f)} denotes the cosine integral
164848`Generate a minimal circle from an edge from vertex A to A.
164914`\spad{class(ind)} yields the class of the multi-index \spad{ind} (Position for first non-vanishing entry).
164999`\spad{class(ind)} yields the class of the multi-index \spad{ind} (Position for first non-vanishing entry).
165088`\spad{class(jv)} yields the class of the jet variable \spad{jv} (Class of multi-index for derivative,{} 0 else).
165150`\spad{class(f)} is defined as the highest class of the jet variables effectively occurring in \spad{f}.
165357`\spad{classicalConvolution(x,{} y)} returns the classical convolution of the distributions \spad{x} and \spad{y}
165425`\spad{classicalCumulant(x,{} n)} returns the \spad{n}-th classical cumulant of the distribution \spad{x}
165504`\spad{classicalCumulants(x)} returns sequence of classical cumulants of the distribution \spad{x}
165578`\spad{clearCache()} empties the cache.
165627`\spad{clearDenominator([q1,{} ...,{} qn])} returns \spad{[p1,{} ...,{} pn]} such that \spad{\spad{qi} = pi/d} where \spad{d} is a common denominator for the \spad{qi}\spad{'s}.
165697`\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}.
165779`\spad{clearDenominator([q1,{} ...,{} qn])} returns \spad{[p1,{} ...,{} pn]} such that \spad{\spad{qi} = pi/d} where \spad{d} is a common denominator for the \spad{qi}\spad{'s}.
165842`\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}.
166006`\spad{clearFortranOutputStack()} clears the Fortran output stack
166088`\spad{clearTable!()} clears the hash-table and assumes that it will no longer be used.
166162`\spad{clearTheSymbolTable()} clears the current symbol table.
166220`\spad{clearTheSymbolTable(x)} removes the symbol \spad{x} from the table
166284`\spad{clear_used_intrinsics()} clear list of used intrinsics
166346`\spad{clexSmaller?(f,{} g)} compares monic \spad{f} and \spad{g} of the same degree in the following order. Error: if \spad{f} or \spad{g} is not monic or if \spad{f} and \spad{g} have different degrees or if common degree is 0. \spad{f < g} if the constant term of \spad{f} is zero and constant term of \spad{g} is nonzero. If both constant term of \spad{f} and \spad{g} are nonzero then \spad{f < g} if the {\em lookup} of the constant term of \spad{f} is less than this number for \spad{g}. If these values are equal,{} then \spad{lexSmaller?} is used as ordering predicate.
166479`\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 \pspadfun{iClipParametric} subroutine,{} which is called by this function.
166662`\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 \pspadfun{iClipParametric} subroutine,{} which is called by this function.
166839`\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.
166996`\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}.
167039`\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]}.
167095`\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.
167288`\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.
167371`\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 \pspadfun{iClipParametric} subroutine,{} which is called by this function.
167538`\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 \pspadfun{iClipParametric} subroutine,{} which is called by this function.
167741`\spad{clipPointsDefault()} determines whether or not automatic clipping is to be done.
167802`\spad{clipPointsDefault(true)} turns on automatic clipping; \spad{clipPointsDefault(false)} turns off automatic clipping. The default setting is \spad{true}.
167870`\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}.
167938`\spad{clipWithRanges(pointLists,{} xMin,{} xMax,{} yMin,{} yMax)} performs clipping on a list of lists of points,{} \spad{pointLists}. Clipping is done within the specified ranges of \spad{xMin},{} \spad{xMax} and \spad{yMin},{} \spad{yMax}. This function is used internally by the \pspadfun{iClipParametric} subroutine in this package.
168179`\spad{cLog(f)} computes the logarithm of the power series \spad{f}. For use when the coefficient ring is commutative.
168280`clos! closes the file.
168321`\spad{close! closes} the keyed access file.
168373`\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.
168426`\spad{close!(f)} returns the file \spad{f} closed to input and output.
168475`\spad{close!(f)} returns the library \spad{f} closed to input and output.
168511`\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.
168566`\spad{close(x,{} b)} \undocumented
168633`\spad{closeComponent(s,{} \spad{li},{} b)} sets the property of the component in the 3 dimensional subspace,{} \spad{s},{} to be closed if \spad{b} is \spad{true},{} or open if \spad{b} is \spad{false}. The list of non negative integers,{} \spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component whose closed property is to be set. The subspace,{} \spad{s},{} is returned with the component property modification.
168716`\spad{closed?(x)} \undocumented
168777`\spad{closed?(t)} tests whether the given tube plot \spad{t} is closed.
168828`\spad{closedCartesian(a,{} b,{} f)} builds Cartesian product of a and \spad{b} and then maps it back to \% using \spad{f}.
168893`Cartesian product doubles the size of next list in each object,{} that is it produces two arrows out of every node
168963`as Cartesian product but returns \%.
169030`as Cartesian product but returns \%.
169097`\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.
169159`\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 element again and returns a \spadtype{ThreeSpace} whose component is the closed curve defined by \spad{lp}.
169227`\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.
169295`\spad{closedCurve(s,{} [[lr0],{} [lr1],{} ...,{} [lrn],{} [lr0]])} adds a closed curve component defined by a list of points \spad{lr0} through \spad{lrn},{} which are lists of elements from the domain \spad{PointDomain(m,{} R)},{} where \spad{R} is the \spadtype{Ring} over which the point elements are defined and \spad{m} is the dimension of the points,{} in which the last element of the list of points contains a copy of the first element list,{} \spad{lr0}. The closed curve is added to the \spadtype{ThreeSpace},{} \spad{s}.
169364`\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}.
169434`\spad{closedTensor(a,{} b,{} f)} builds tensor product of a and \spad{b} and then maps it back to \% using \spad{f}.
169496`as tensor product but returns \%. Cartesian product does apply to function graph produces two arrows out of every node
169558`as tensor product but returns \%.
169625`as tensor product but returns \%.
169689`as tensor product but returns \%.
169753`\spad{cmult(x)} should be local but conditional
169904`\spad{cnlexSmaller?(f,{} g)} compares monic \spad{f} and \spad{g} of the same degree \spad{n} in the following order. Error: if \spad{f} or \spad{g} is not monic or if \spad{f} and \spad{g} have different degrees or if common degree is 0. \spad{f < g} if the constant term of \spad{f} is zero and constant term of \spad{g} is nonzero. If both constant term of \spad{f} and \spad{g} are nonzero then \spad{f < g} if the {\em lookup} of the constant term of \spad{f} is less than this number for \spad{g}. If constant terms are equal then \spad{nlexSmaller?} is used as ordering predicate.
170038`given a mapping from this graph this function tries to calculate a unique reverse mapping back to this graph
170150`given a mapping from this graph this function tries to calculate a unique reverse mapping back to this graph
170267`calculate coboundary at dimension \spad{n} for a given input
170353`returns a matrix sequence representing the face maps in linear algebra form
170416`returns a matrix sequence representing the face maps in linear algebra form For more information: \url{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/chain/cochain/index.\spad{htm}}
170490`constructor from \spad{ChainComplex}
170556`constructor
170631`\spad{cocyclotomic_decomposition(n)} computes list of irreducible factors of \spad{x^n + 1} over integers.
170745`\spad{code(f)} returns the internal representation of the object represented by \spad{f}.
171467`\spad{coef(p,{} e)} extracts the coefficient of the monomial \spad{e}. Returns zero if \spad{e} is not present.
171516`\spad{coef(x,{} w)} returns the coefficient of the word \spad{w} in \spad{x}.
171576`\spad{coef(x,{} y)} returns scalar product of \spad{x} by \spad{y},{} the set of words being regarded as an orthogonal basis.
171623`\spad{coef(x,{} y)} returns the scalar product of \spad{x} by \spad{y},{} the set of words being regarded as an orthogonal basis.
171705`\spad{coefChoose should} be local
171829`\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.
171918`\spad{coefficient(x,{} n)} \undocumented
171983`\spad{coefficient(om,{} jb)} returns the coefficient of \spad{om} for the differential of \spad{jb}.
172041`\spad{coefficient(v,{} jb)} returns the coefficient of \spad{v} in direction \spad{jb}.
172098`\spad{coefficient(s,{} n)} gives the terms of total degree \spad{n}.
172197`\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.
172412`\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.
172470`\spad{coefficient(x,{} [i1,{} i2,{} ...,{} iN])} extracts the coefficient of \spad{e(i1)*e(i2)*...*e(iN)} in \spad{x}.
172551`\spad{coefficient(s,{} n)} gives the terms of total degree \spad{n}.
172637`\spad{coefficient(x,{} s)} returns the coefficient of the basis element \spad{s}
172696`\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)}.
173201`\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.
173300`\spad{coefficient(f,{} [x1,{} x2,{} ...,{} xk],{} [n1,{} n2,{} ...,{} nk])} returns the coefficient of \spad{x1^n1 * ... * xk^nk} in \spad{f}.
173411`\spad{coefficient(f,{} x,{} n)} returns the coefficient of \spad{x^n} in \spad{f}.
173572`\spad{coefficients(om)} yields the coefficients of \spad{om}.
173634`\spad{coefficients(v)} yields the coefficients of \spad{v}.
173836`\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.}
173905`\spad{coefficients(s)} gives stream of coefficients of \spad{s},{} \spadignore{i.e.} [coefficient(\spad{s},{}0),{} coefficient(\spad{s},{}1),{} ...]
173994`\spad{coefficients(x)} returns the list of coefficients of \spad{x}.
174058`\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.
174294`\spad{coeffs0(x,{} lv,{} lp)} is used by \spad{coeffs1}
174487`\spad{coeffs1(x,{} lv)} computes list of coefficients of \spad{x} with respect to variables in \spad{lv}. Variables in \spad{lv} must be decreasing and bigger than all other variables of \spad{x}.
175347`\spad{coerce(r)} converts a ring element \spad{r} to a stream with one element.
175686`\spad{coerce(u)} transforms \spad{u} into a COmplex Float
175742`\spad{coerce(u)} transforms \spad{u} into a MachineComplex
175798`\spad{coerce(u)} transforms \spad{u} into a MachineComplex
175856`\spad{coerce(u)} transforms \spad{u} into a MachineComplex
175919`\spad{coerce(u)} transforms \spad{u} into a MachineComplex
176037`\spad{coerce(d)} coerces an element of \spad{D} into the new domain. This includes the calculation of its leading derivative and its jet variables.
176087`\spad{coerce(exp)} retracts an element to the base domain \spad{D}. This looses all information about its leading derivative and its jet variables and requires complete evaluation of the expression.
176137`\spad{coerce CubicalComplex} to DeltaComplex
176205`\spad{coerce SimplicialComplex} to DeltaComplex
176276`\spad{coerce(e)} returns \spad{1*e}
176325`\spad{coerce(eq)} \undocumented{}
176438`\spad{coerce(eq)} \undocumented{}
176542`\spad{coerce(eq)} \undocumented{}
176648`\spad{coerce(eq)} \undocumented{}
176761`\spad{coerce(eq)} \undocumented{}
176872`\spad{coerce(eq)} \undocumented{}
176985`\spad{coerce(e)} \undocumented{}
177088`\spad{coerce(e)} \undocumented{}
177182`\spad{coerce(e)} \undocumented{}
177540`\spad{coerce(x)} returns \spad{x} with coefficients in the domain
177613`\spad{coerce(e)} \undocumented{}
177716`\spad{coerce(e)} \undocumented{}
177817`\spad{coerce(e)} \undocumented{}
177920`\spad{coerce(x)} \undocumented{}
178013`\spad{coerce(c)} converts the constant \spad{c} into an element of the free field represented by an ALS in minimal refined form.
178068`\spad{coerce FinitePoset} to graph
178126`\spad{coerce FinitePoset} to graph
178186`\spad{coerce FinitePoset} to graph
178246`\spad{coerce DeltaComplex} to FiniteSimplicialComplex
178317`\spad{coerce(u)} transforms a MachineFloat to a standard Float
178362`\spad{coerce(e)} takes an object from \spadtype{FortranCode} and \indented{1}{uses it as the body of an ASP.}
178424`\spad{coerce(e)} takes an object from \spadtype{FortranCode} and \indented{1}{uses it as the body of an ASP.}
178484`\spad{coerce(e)} takes an object from \spadtype{FortranCode} and \indented{1}{uses it as the body of an ASP.}
178552`\spad{coerce(e)} takes an object from \spadtype{FortranCode} and \indented{1}{uses it as the body of an ASP.}
178612`\spad{coerce(e)} takes an object from \spadtype{FortranCode} and \indented{1}{uses it as the body of an ASP.}
178680`\spad{coerce(fc)} \undocumented{}
178768`\spad{coerce(t)} creates an element from a scalar type
178824`\spad{coerce(f)} produces the equivalence class of \spad{f} in the residue ring
180136`\spad{coerce(x)} returns the element of \spadtype{FreeMagma}(VarSet) corresponding to \spad{x}.
180199`\spad{coerce(m)} converts the monoid \spad{m} into an element of the free field represented by an ALS in minimal refined form.
180268`\spad{coerce(x)} returns the element of \spadtype{FreeMonoid}(VarSet) corresponding to \spad{x} by removing parentheses.
180331`\spad{coerce(x)} returns the element of \spadtype{FreeMonoid}(VarSet) corresponding to \spad{x}.
180395`\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}.
180480`\spad{coerce(\spad{gi})} converts the indicated \spadtype{GraphImage},{} \spad{gi},{} into the \spadtype{TwoDimensionalViewport} form.
181586`\spad{coerce(jv)} coerces the jet variable \spad{jv} into a local section.
181691`\spad{coerce Lambda} term to SKI combinators. this process is known as abstraction elimination. it is done by applying the following rules until all lambda terms have been eliminated. rule LS1: Lam[\spad{x}] \spad{=>} \spad{x} rule LS2: Lam[(\spad{E1} \spad{E2})] \spad{=>} (Lam[\spad{E1}] Lam[\spad{E2}]) rule LS3: Lam[\spad{x}.\spad{E}] \spad{=>} (\spad{K} Lam[\spad{E}]) (if \spad{x} does not occur free in \spad{E}) rule LS4: Lam[\spad{x}.\spad{x}] \spad{=>} \spad{I} rule LS5: Lam[\spad{x}.\spad{y}.\spad{E}] \spad{=>} Lam[\spad{x}.Lam[\spad{y}.\spad{E}]] (if \spad{x} occurs free in \spad{E}) rule LS6: Lam[\spad{x}.(\spad{E1} \spad{E2})] \spad{=>} (\spad{S} Lam[\spad{x}.\spad{E1}] Lam[\spad{x}.\spad{E2}])
181758`convert lattice from join-of-meets to meet-of-joins
181822`convert lattice from meet-of-joins to join-of-meets
181886`\spad{coerce(p)} returns \spad{p}.
181961`\spad{coerce(e)} takes an object from \spadtype{List FortranCode} and \indented{1}{uses it as the body of an ASP.}
182029`\spad{coerce(e)} takes an object from \spadtype{List FortranCode} and \indented{1}{uses it as the body of an ASP.}
182095`\spad{coerce(e)} takes an object from \spadtype{List FortranCode} and \indented{1}{uses it as the body of an ASP.}
182169`\spad{coerce(e)} takes an object from \spadtype{List FortranCode} and \indented{1}{uses it as the body of an ASP.}
182235`\spad{coerce(e)} takes an object from \spadtype{List FortranCode} and \indented{1}{uses it as the body of an ASP.}
182309`\spad{coerce(lfc)} \undocumented{}
182403`\spad{coerce(l)} converts a list of 0\spad{'s} and 1\spad{'s} into a basis element,{} where 1 (respectively 0) designates that the variable of the corresponding index of \spad{l} is (respectively,{} is not) present. Error: if an element of \spad{l} is not 0 or 1.
182455`\spad{coerce(p)} coerces a partition into a list of integers
182505`\spad{coerce(llp)} 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 be included in a two-dimensional viewport window.
182573`\spad{coerce List} to graph
182707`\spad{coerce(x)} outputs \spad{x} as a list of strings. Each element in the list represents a new line. This is an alternative to creating a long single string with 'newline' embedded in it.
182757`\spad{coerce b} returns the basis as a list of vectors.
182819`\spad{coerce(u)} transforms a MachineInteger into a MachineFloat
182873`\spad{coerce(A)} yields the matrix \spad{A} in the usual matrix type.
182934`\spad{coerce(v)} produces an ASP which returns the value of \spad{v}.
183003`\spad{coerce(m)} converts a matrix of type \spadtype{RectangularMatrix} to a matrix of type \spad{Matrix}.
183064`\spad{coerce(m)} converts a matrix of type \spadtype{SquareMatrix} to a matrix of type \spadtype{Matrix}.
183121`output
183173`\spad{coerce(f)} returns an object of type OutputForm.
183222`\spad{coerce(x)} provides a printable form for \spad{x}
183271`\spad{coerce(f)} prints the ALS of \spad{f} if the debug flag is set and a rational expression if the alternative output flag is set.
183335`\spad{coerce(\spad{gi})} returns the indicated graph,{} \spad{\spad{gi}},{} of domain \spadtype{GraphImage} as output of the domain \spadtype{OutputForm}.
183383`\spad{coerce(de)} transforms the differential equation \spad{de} to \spadtype{OutputForm}.
183450`\spad{coerce(p)} prints the linear pencil \spad{p} in list form.
183521`\spad{coerce(bd)} outputs description of \spad{bd} as formatted text
183572`\spad{coerce(me)} list this instance to the command line
183622`output a full scenegraph could contain a lot of data and so we have to be careful to restrict the output to what is reasonable on the command line. Therefore we do not display all subnodes or the full information from nodes such as IFS.
183669`\spad{coerce(tr)} output
183721`\spad{coerce(o)} changes \spad{o} in the standard output format to TeX format.
183768`\spad{coerce(v)} returns the given two-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{TwoDimensionalViewport} as output of the domain \spadtype{OutputForm}.
183828`\spad{coerce(o)} changes \spad{o} in the standard output format to html format.
183881`\spad{coerce(o)} changes \spad{o} in the standard output format to MathML format.
183936`\spad{coerce(o)} changes \spad{o} in the standard output format to Texmacs format.
183992`convert back into a \spad{"P"},{} ignoring weights
184068`\spad{coerce(p)} coerces \spad{p} into Weighted form,{} applying weights and ignoring terms
184144`\spad{coerce PermutationGroup} to graph
184207`\spad{coerce PermutationGroup} to graph which represents the generators of the group
184691`\spad{coerce(p)} moves from the representation type (PrimitiveArray PrimitiveArray PrimitiveArray \spad{R}) to the domain
184793`\spad{coerce(x)} moves from the domain to the representation type
184895`\spad{coerce(a)} makes a tuple from primitive array a
185014`\spad{coerce(x)} \undocumented
185097`\spad{coerce(x)} \undocumented
185170`\spad{coerce(x)} \undocumented
185242`\spad{coerce(x)} \undocumented
185320`\spad{coerce(x)} \undocumented
185398`\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.
185504`\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.
185608`\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.
185720`\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.
185824`\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.
185936`\spad{coerce(r)} \undocumented{}
186853`\spad{coerce(a)} transforms a into an element of \%.
186898`\spad{coerce(s)} returns \spad{s} viewed as an element of \%.
186945`\spad{coerce(x)} returns the \spad{s}-expression associated with \spad{x}
187142`\spad{coerce combinators} to intuitionistic logic this is known as the Curry-Howard isomorphism it uses the following rules: rule SI1: Ski[Kab] \spad{=>} a \spad{->} (\spad{b} \spad{->} a),{} rule SI2: Ski[Sabc] \spad{=>} (a \spad{->} (\spad{b} \spad{->} \spad{c})) \spad{->} ((a \spad{->} \spad{b}) \spad{->} (a \spad{->} \spad{c})),{} rule SI3: Ski[a a-\spad{>b}] \spad{=>} \spad{b} the last rule is function application (modus ponens)
187205`\spad{coerce SKI} combinators to Lambda term. this conversion is done by applying the following rules rule SL1: Ski[\spad{I}] = \spad{x}.0 rule SL2: Ski[\spad{K}] = \spad{x}.\spad{y}.1 rule SL3: Ski[\spad{S}] = \spad{x}.\spad{y}.\spad{z}.(2 0 (1 0)) rule SL4: Ski[(\spad{E1} \spad{E2})] = (Ski[\spad{E1}] Ski[\spad{E2}])
187398`\spad{coerce(poly)} regroups the terms by total degree and forms a series.
188753`coercion to matrices over ground domain.
189725`\spad{coerce(x)} creation of elements
189781`\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"
189832`\spad{coerce(x)} returns the uppercase string associated with \spad{x}
189883`\spad{coerce(x)} outputs \spad{x} as a string
190048`\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
190099`\spad{coerce(x)} returns the symbol associated with \spad{x}
190150`\spad{coerce(sy)} allows for the input of jet variables as symbols. Yields an error,{} if the symbol is not contained in \spad{IVar} or \spad{DVar}.
190204`\spad{coerce(s)} allows for the input of jet variables as symbols.
190265`\spad{coerce(s)} \undocumented{}
190305`\spad{coerce(x)} returns the symbol
190403`\spad{coerce(x)} returns a table view of \spad{x}
190467`\spad{coerce(p)} converts a univariate polynomial \spad{p} in the variable \spad{var} to a univariate Taylor series in \spad{var}.
190567`\spad{coerce(p)} converts a univariate polynomial \spad{p} in the variable \spad{var} to a univariate Taylor series in \spad{var}.
190746`\spad{coerce(f)} converts a \spadtype{UnivariatePuiseuxSeries} to an \spadtype{ExponentialExpansion}.
190843`\spad{coerce(var)} converts a variable to a Taylor series
190918`\spad{coerce(var)} converts the series variable \spad{var} into a Laurent series.
191002`\spad{coerce(var)} converts the series variable \spad{var} into a Puiseux series.
191086`\spad{coerce(var)} converts the series variable \spad{var} into a \indented{1}{Taylor series.}
191169`\spad{coerce(var)} converts the series variable \spad{var} into a Laurent series.
191247`\spad{coerce(var)} converts the series variable \spad{var} into a Puiseux series.
191325`\spad{coerce(var)} converts the series variable \spad{var} into a \indented{1}{Taylor series.}
191470`\spad{coerce(x)} returns \spad{x} as a skew-polynomial.
191550`\spad{coerce(v)} return \spad{v}
191689`\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
191790`\spad{coerce(v)} produces an ASP which returns the value of \spad{v}.
191859`\spad{coerce(v)} coerces a vector \spad{v} with entries in \spadtype{Matrix R} as vector over \spadtype{Matrix Fraction Polynomial R}
192031`\spad{coerce(f)} converts the element to XDPOLY (if possible).
192114`\spad{coerce(p)} converts the polynomial \spad{p} to an element in the free field represented by an minimal admissible linear system.
192197`\spad{coerce(g)} returns the internal representation of \spad{g}.
192288`\spad{coerce(p)} returns \spad{p} as a distributed polynomial.
192372`\spad{coerce(g)} returns the internal representation of \spad{g}.
192455`\spad{coerce(p)} returns \spad{p} as a recursive polynomial.
192537`\spad{coerce A} changes its argument into a \indented{1}{nullary function.}
192588`\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).
192645`\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).
192699`\spad{coerce(c)} returns \spad{c} as a string \spad{s} with the character \spad{c}.
192751`\spad{coerce(col)} converts the column \spad{col} to a column matrix.
192807`\spad{coerce(c)} sets the average shade for the palette to that of the indicated color \spad{c}.
192847`\spad{coerce(v)} views a vector as a rank 1 tensor.
192923`\spad{coerce(x)} coerces a distribution from the ring \spad{R1} to \spad{R2}.
193011`\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.
193070`\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\spad{'t} divide the extension degree of {\em F2}. Note that the other coercion function in the \spadtype{FiniteFieldHomomorphisms} is a left inverse.
193135`\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\spad{'t} divide the extension degree of {\em F1}. Note that the other coercion function in the \spadtype{FiniteFieldHomomorphisms} is a left inverse.
193200`\spad{coerce(c)} converts sin/cos terms into Fourier Series
193265`\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.
193332`\spad{coerce(b)} converts a binary expansion to a rational number.
193392`\spad{coerce(d)} converts a decimal expansion to a rational number.
193453`\spad{coerce(h)} converts a hexadecimal expansion to a rational number.
193518`\spad{coerce(rx)} converts a radix expansion to a rational number.
193581`\spad{coerce(rf)} converts \spad{rf},{} a fraction of polynomial \spad{p} with algebraic number coefficients to \spadtype{Expression Integer}.
193687`\spad{coerce(f)} returns \spad{f} as an element of \%.
193788`\spad{coerce(q)} returns \spad{q} as an element of \%.
193867`\spad{coerce(p)} sums up the components of the partial fraction and returns a single fraction.
193924`\spad{coerce(n)} coerces the integer \spad{n} to an element of the ring.
193977`\spad{coerce(i)} returns the element corresponding to \spad{i}
194022`\spad{coerce([t_1,{} ...,{} t_dim])} allows tensors to be constructed using lists.
194085`\spad{coerce(polyList)} converts the list of polynomials \spad{polyList} to an ideal.
194161`\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 multiplied. Error: if repetitions occur in one cycle.
194216`\spad{coerce(gp)} returns the generators of the group {\em gp}.
194283`\spad{coerce(ls)} coerces a list of permutations {\em ls} to the group generated by this list.
194350`\spad{coerce([r_1,{} ...,{} r_dim])} allows tensors to be constructed using lists.
194413`\spad{coerce(lt)} converts a list of terms and coefficients to a member of the domain.
194485`\spad{coerce(l)} makes a database out of a list
194531`\spad{coerce(l)} creates a datalist from \spad{l}
194577`\spad{coerce(x)} returns the list of elements in \spad{x}
194623`\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.
194672`\spad{coerce(l)} converts a list \spad{l} to a stream.
194716`\spad{coerce(s)} returns the \spadtype{ThreeSpace} \spad{s} to Output format.
194775`\spad{coerce(v)} coerces void object to OutputForm.
194817`\spad{coerce(f)} returns \spad{f} as an Expression(\spad{R}).
194879`\spad{coerce(p)} converts the polynomial \spad{p} with algebraic number coefficients to \spadtype{Expression Integer}.
194975`\spad{coerce(s)} regroups terms of \spad{s} by total degree \indented{1}{and forms a series.}
195037`\spad{coerce(p)} returns \spad{p} as an element of \%.
195128`\spad{coerce(d)} converts a decimal expansion to a radix expansion with base 10.
195190`\spad{coerce(h)} converts a hexadecimal expansion to a radix expansion with base 16.
195256`\spad{coerce(b)} converts a binary expansion to a radix expansion with base 2.
195316`\spad{coerce(r)} maps the ring element \spad{r} to a member of the algebra.
195355`\spad{coerce(r)} returns \spad{r} * 1 where 1 is the identity of the left algebra.
195398`\spad{coerce(r)} equals \spad{r*1}.
195438`\spad{coerce(r)} converts coefficients into Fourier Series
195485`\spad{coerce(p)} views \spad{p} as a valie in the partial differential ring.
195553`\spad{coerce(r)} views \spad{r} as a value in the ordinary differential ring.
195621`\spad{coerce(r)} returns \spad{r} viewed as a rational function over \spad{R}.
195691`\spad{coerce(s)} creates an object of \spadtype{Any} from the object \spad{s} of type \spad{S}.
195738`\spad{coerce(a)} transforms a into an element of \spad{S}.
195781`\spad{coerce(s)} returns \spad{s},{} viewed as the zero-th order derivative of \spad{s}.
195841`\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}.
195936`\spad{coerce(x)} allows \spadtype{Segment} values to be used as \%.
195993`\spad{coerce(x)} changes \spad{x} into an object of type \spadtype{None}.
196042`\spad{coerce(p)} returns \spad{p} viewed as an algebraic number.
196132`\spad{coerce(p)} returns \spad{p} as an element of \%.
196223`\spad{coerce(m)} views a matrix as a rank 2 tensor.
196298`\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.
196348`\spad{coerce(fn)} produces a string for a file name according to operating system-dependent conventions.
196398`\spad{coerce(s)} converts a string to a file name according to operating system-dependent conventions.
196448`\spad{coerce(s)} converts \spad{s} into an \spad{IndexCard}. Warning: if \spad{s} is not of the right format then an error will occur when using it.
196491`\spad{coerce(s)} converts the string \spad{s} to a symbol.
196531`\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.
196590`\spad{coerce(u)} creates an OpenMath error object of an appropriate type if \spad{u} is one of \spad{OMParseError},{} \spad{OMReadError},{} \spad{OMUnknownCD} or \spad{OMUnknownSymbol},{} otherwise it raises a runtime error.
196641`\spad{coerce(s)} converts a variable to a Taylor series
196693`\spad{coerce(x)} \undocumented
196742`\spad{coerce(f(x))} converts the Laurent series \spad{f(x)} to a Puiseux series.
196825`\spad{coerce(f)} converts a Puiseux series to a general power series.
196932`\spad{coerce(f(x))} converts the Taylor series \spad{f(x)} to a Laurent series.
197015`\spad{coerce(var)} converts the series variable \spad{var} into a Puiseux series.
197098`\spad{coerce(x)} converts the variable \spad{x} to a univariate polynomial.
197162`\spad{coerce(x)} returns \spad{x} as a Lie polynomial.
197220`\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.
197304`\spad{coerce(v)} returns \spad{v}.
197352`\spad{coerce(x)} returns \spad{x} as distributed polynomial.
197436`\spad{coerce(x)} returns \spad{x} as a recursive polynomial.
197518`\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.
197623`\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.
197704`\spad{coerceL(o)} changes \spad{o} in the standard output format to html format and displays result as one long string.
197758`\spad{coerceL(o)} changes \spad{o} in the standard output format to MathML format and displays result as one long string.
197814`\spad{coerceL(o)} changes \spad{o} in the standard output format to Texmacs format and displays result as one long string.
197871`\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.
197937`\spad{coerceP(v)} coerces a vector \spad{v} with entries in \spadtype{Matrix R} as vector over \spadtype{Matrix Polynomial R}
198039`\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.
198109`\spad{coerce_Q(x)} should be local but conditional
198186`\spad{coerceS(o)} changes \spad{o} in the standard output format to html format and displays formatted result.
198240`\spad{coerceS(o)} changes \spad{o} in the standard output format to MathML format and displays formatted result.
198296`\spad{coerceToType(f)} returns the input form corresponding to f::R
198445`\spad{coHeight(ts)} returns \spad{size()\$V} minus \spad{\#ts}.
198536`calculate homology using SmithNormalForm
198600`calculate cohomology using SmithNormalForm
198662`calculate cohomology using SmithNormalForm \url{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/homology/cohomol/index.\spad{htm}}
198735`\spad{coleman(alpha,{} beta,{} \spad{pi})}: there is a bijection from the set of matrices having nonnegative entries and row sums {\em alpha},{} column sums {\em beta} to the set of {\em Salpha - Sbeta} double cosets of the symmetric group {\em Sn}. ({\em Salpha} is the Young subgroup corresponding to the improper partition {\em alpha}). For a representing element {\em \spad{pi}} of such a double coset,{} coleman(\spad{alpha},{} \spad{beta},{} \spad{pi}) generates the Coleman-matrix corresponding to {\em alpha,{} beta,{} \spad{pi}}. Note: The permutation {\em \spad{pi}} of {\em {1,{} 2,{} ...,{} n}} has to be given in list form. Note: the inverse of this map is {\em inverseColeman} (if {\em \spad{pi}} is the lexicographical smallest permutation in the coset). For details see James/Kerber.
198854`\spad{colinearity(x,{} y)} returns a measure of how parallel two vectors are independent of the length of the vectors: 1.0 is completely parallel 0.0 is completely perpendicular returned value will be between these
198973`\spad{collect(exp)} "collects" former lazy terms which have been meanwhile evaluated.
199094`\spad{collect(ps,{} v)} returns the set consisting of the polynomials of \spad{ps} with \spad{v} as main variable.
199234`\spad{collectQuasiMonic(ts)} returns the subset of \spad{ts} consisting of the polynomials with initial in \spad{R}.
199444`\spad{collectUnder(ps,{} v)} returns the set consisting of the polynomials of \spad{ps} with main variable less than \spad{v}.
199661`\spad{collectUpper(ps,{} v)} returns the set consisting of the polynomials of \spad{ps} with main variable greater than \spad{v}.
199738`\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.
199788`\spad{color(i)} returns a color of the indicated hue \spad{i}.
199827`\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}.
199897`\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)}.
199968`\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)}.
200051`\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)}.
200228`\spad{colSlice(m)} returns a segment \spad{s} such that for \spad{m} the access \spad{m}(\spad{i},{} \spad{s}) gives the \spad{i}-th row.
200387`\spad{column(m,{} j)} returns the \spad{j}th column of the matrix \spad{m}. Error: if the index outside the proper range.
200466`\spad{column(m,{} j)} returns the \spad{j}th column of \spad{m} error check to determine if index is in proper ranges
200543`\spad{columnMatrix} returns a single column out of a matrix. The column is put into a one by \spad{N} matrix.
200617`\spad{columns} returns several columns out of a matrix. The columns are stacked into a matrix.
200692`\spad{columns} returns several columns out of a matrix. The columns are stacked into a matrix.
200770`\spad{columnSpace M} builds a basis of the image space of the linear transformation defined by the matrix \spad{M}. This function calls the \spad{columnSpace} from the \spad{Matrix} domain. Only the signature changes.
200896`\spad{columnSpace(m)} returns a sublist of columns of the matrix \spad{m} forming a basis of its column space
200985`\spad{columnSpace(m)} returns a sublist of columns of the matrix \spad{m} forming a basis of its column space.
201089`\spad{columnSpan(f)} computes the column span for a regular element,{} that is (\spad{v'},{} \spad{Mv'},{} M^2v',{} ...) where PAs=Pv=v' with PA = \spad{I}-\spad{M}.
201192`\spad{commaSeparate(l)} creates the form separating the elements of \spad{l} by commas.
201244`\spad{comment(s)} creates a representation of the Strings \spad{s} as a multi-line FORTRAN comment.
201296`\spad{comment(s)} creates a representation of the String \spad{s} as a single FORTRAN comment.
201342`\spad{common(name,{} contents)} creates a representation a named common block.
201400`\spad{commonDenominator([q1,{} ...,{} qn])} returns a common denominator \spad{d} for \spad{q1},{} ...,{} \spad{qn}.
201471`\spad{commonDenominator(q)} returns a common denominator \spad{d} for the coefficients of \spad{q}.
201554`\spad{commonDenominator([q1,{} ...,{} qn])} returns a common denominator \spad{d} for \spad{q1},{} ...,{} \spad{qn}.
201618`\spad{commonDenominator(q)} returns a common denominator \spad{d} for the elements of \spad{q}.
201775`\spad{commutative?()} tests if multiplication in the algebra is commutative.
201852`\spad{commutative?()} tests if multiplication in the algebra is commutative.
201926`\spad{commutator(v,{} w)} calculates the commutator of two vector fields.
202071`\spad{commutator(p,{} q)} computes \spad{inv(p) * inv(q) * p * q}.
202111`\spad{commutator(a,{} b)} returns \spad{a*b-b*a}.
202163`\spad{comp(f,{} g,{} x)} is \spad{f(g x)}.
202239`\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.
202295`\spad{companionBlocks(m,{} lv)} returns \spad{[[C_1,{} lg_1],{} ...,{} [C_k,{} lg_k]]} such that each \spad{C_i} is a companion block and \spad{m = diagonal(C_1,{} ...,{} C_k)}.
202425`\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}.
202486`\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.
202562`\spad{compdegd should} be local
202708`\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}\spad{'s} are not valid types,{} or if the compiler fails.
202765`\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}.
202848`\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)}
202999`pseudo complement
203052`\spad{complement(u)} returns the complement of the set \spad{u},{} \spadignore{i.e.} the set of all values not in \spad{u}.
203119`pseudo complement
203267`\spad{complementaryBasis(b1,{} ...,{} bn)} returns the complementary basis \spad{(b1',{} ...,{} bn')} of \spad{(b1,{} ...,{} bn)}.
203356`\spad{complementSpace B} builds a complement space of the basis \spad{B} from some vectors of the canonical basis. This function fails with the empty basis.
203413`\spad{complementSpace Lv} builds a complement space of the subspace spanned by the list of vectors \spad{LV}. This function fails with the empty basis.
203484`\spad{complementSpace(Lv,{} n)} builds a complement space of the subspace spanned by the list of vectors \spad{LV}. The integer \spad{n} provides the length of the vectors in the case of the empty basis.
203574`\spad{complementSpace(B,{} n)} builds a complement space of the basis \spad{B} from some vectors of the canonical basis \spad{B}. The integer \spad{n} provides the length of the vectors in the case of the empty basis.
203701`\spad{complete(de)} completes \spad{de} to an involutive equation. No result is returned; the display depends of the setting of the output flags with \spadfun{setOutput}.
203784`\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.
203837`\spad{complete(x)} forces the computation of all digits.
203891`\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.
203957`\spad{complete(x)} causes all entries in \spad{x} to be computed. Normally entries are only computed as needed. If \spad{x} is an infinite continued fraction,{} a user-initiated interrupt is necessary to stop the computation.
204008`\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}.}
204097`\spad{complete2(de)} is like \spadfun{complete} but returns the involutive equation \spad{IDe},{} a basis \spad{ISys} for the involutive system without prolongations,{} its order \spad{Order},{} the number \spad{NumProj} of needed projections and the Cartan characters \spad{CarChar}.
204339`\spad{completeDecompose(f)} returns a list of factors of \spad{f} for the functional decomposition of \spad{f}. [\spad{f1},{} ...,{} \spad{fn}] means \spad{f} = \spad{f1} \spad{o} ... \spad{o} \spad{fn}.
204445`\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.
204537`\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}.
204673`\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.
204773`\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}
204863`generates a completely ordered set
204940`\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}
205043`\spad{completeSmith(m,{} full)} computes record containing Smith normal form of \spad{m} and the left and right equivalence matrices. It first reduces \spad{m} to smaller matrix and then uses full to finish.
205298`\spad{complex?(t)} tests whether \spad{t} is equivalent to the FORTRAN type COMPLEX.
205352`\spad{complex(x,{} y)} constructs \spad{x} + \%i*y.
205460`\spad{complexEigenvalues(m,{} eps)} computes the eigenvalues of the matrix \spad{m} to precision eps. The eigenvalues are expressed as complex floats or complex rational numbers depending on the type of eps (float or rational).
205586`\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 eps and are expressed as complex floats or complex rational numbers depending on the type of eps (float or rational).
205779`\spad{complexElementary(f)} rewrites \spad{f} in terms of the 2 fundamental complex transcendental elementary functions: \spad{log,{} exp}.
205857`\spad{complexElementary(f)} rewrites \spad{f} in terms of the 2 fundamental complex transcendental elementary functions: \spad{log,{} exp}.
205928`\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}.
206013`\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}.
206091`\spad{complexExpand(i)} returns the expanded complex function corresponding to \spad{i}.
206178`\spad{complexExpand(i)} returns the expanded complex function corresponding to \spad{i}.
206299`\spad{complexForm(f)} returns \spad{[real f,{} imag f]}.
206392`\spad{complexForm(f)} returns \spad{[real f,{} imag f]}.
206466`\spad{complexIntegrate(f,{} x)} returns the integral of \spad{f(x)dx} where \spad{x} is viewed as a complex variable.
206603`\spad{complexIntegrate(f,{} x)} returns the integral of \spad{f(x)dx} where \spad{x} is viewed as a complex variable.
206685`\spad{complexLimit(f(x),{} x = a)} computes the complex limit \spad{lim(x -> a,{} f(x))}.
206820`\spad{complexLimit(f(x),{} x = a)} computes the complex limit of \spad{f} as its argument \spad{x} approaches \spad{a}.
206984`\spad{complexLimit(f(x),{} x = a)} computes the complex limit of \spad{f} as its argument \spad{x} approaches \spad{a}.
207158`\spad{complexNormalize(f)} rewrites \spad{f} using the least possible number of complex independent kernels.
207235`\spad{complexNormalize(f)} rewrites \spad{f} using the least possible number of complex independent kernels.
207305`\spad{complexNormalize(f,{} x)} rewrites \spad{f} using the least possible number of complex independent kernels involving \spad{x}.
207389`\spad{complexNormalize(f,{} x)} rewrites \spad{f} using the least possible number of complex independent kernels involving \spad{x}.
207466`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
207557`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
207682`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
207798`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
207910`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
208013`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
208116`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
208199`\spad{complexNumeric(x)} returns a complex approximation of \spad{x}.
208259`\spad{complexNumeric(x,{} n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places.
208366`\spad{complexNumeric(x,{} n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places.
208507`\spad{complexNumeric(x,{} n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places.
208639`\spad{complexNumeric(x,{} n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places.
208767`\spad{complexNumeric(x,{} n)} returns a complex approximation of \spad{x}
208886`\spad{complexNumeric(x,{} n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places.
209005`\spad{complexNumeric(x,{} n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places.
209104`\spad{complexNumeric(x,{} n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places.
209180`\spad{complexNumericIfCan(x)} returns a complex approximation of \spad{x},{} or "failed" if \spad{x} is not a constant.
209326`\spad{complexNumericIfCan(x)} returns a complex approximation of \spad{x},{} or "failed" if \spad{x} is not a constant.
209463`\spad{complexNumericIfCan(x)} returns a complex approximation of \spad{x},{} or "failed" if \spad{x} is not a constant.
209596`\spad{complexNumericIfCan(x)} returns a complex approximation of \spad{x},{} or "failed" if \spad{x} is not a constant.
209720`\spad{complexNumericIfCan(x)} returns a complex approximation of \spad{x},{} or "failed" if \spad{x} is not constant.
209844`\spad{complexNumericIfCan(x)} returns a complex approximation of \spad{x},{} or "failed" if \spad{x} is not a constant.
209948`\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places,{} or "failed" if \spad{x} is not a constant.
210110`\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places,{} or "failed" if \spad{x} is not a constant.
210263`\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places,{} or "failed" if \spad{x} is not a constant.
210412`\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \spad{x},{} or "failed" if \spad{x} is not a constant.
210552`\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places,{} or "failed" if \spad{x} is not a constant.
210692`\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \spad{x} up to \spad{n} decimal places,{} or "failed" if \spad{x} is not a constant.
210812`\spad{complex_roots(p)} computes roots of \spad{p} in terms of radicals separating real and complex roots. Returns "failed" when unsuccessful.
210968`\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.
211088`\spad{complexRoots(lrf,{} lv,{} eps)} finds all the complex solutions of a list of rational functions with rational number coefficients with respect 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}.
211233`\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 eps.
211385`\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 eps.
211527`\spad{complexSolve(leq,{} eps)} finds all the complex solutions to precision eps of the system \spad{leq} of equations of rational functions over complex rationals with respect to all the variables appearing in \spad{lp}.
211691`\spad{complexSolve(lp,{} eps)} finds all the complex solutions to precision eps of the system \spad{lp} of rational functions over the complex rationals with respect to all the variables appearing in \spad{lp}.
211845`\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}.
211927`\spad{complexZeros(p,{} eps)} tries to determine all complex zeros of the polynomial \spad{p} with accuracy given by {\em eps}.
212011`\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.
212094`\spad{component(\spad{gi},{} pt)} modifies the graph \spad{\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}.
212158`\spad{component(\spad{gi},{} lp,{} pal1,{} pal2,{} p)} sets the components of the graph,{} \spad{\spad{gi}} of the domain \spadtype{GraphImage},{} to the values given. The point list for \spad{\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 points in \spad{lp} is given by the integer \spad{p}.
212260`\spad{component(\spad{gi},{} pt,{} pal1,{} pal2,{} ps)} modifies the graph \spad{\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}.
212356`\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.
212416`\spad{compose(a,{} b)} composes the power series \spad{a} with the power series \spad{b}.
212503`\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.
212740`\spad{composite(f,{} q)} returns \spad{h} if \spad{f} = \spad{h}(\spad{q}),{} and "failed" is no such \spad{h} exists.
212862`\spad{composite(p,{} q)} returns \spad{h} if \spad{p = h(q)},{} and "failed" no such \spad{h} exists.
212964`\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.
213024`\spad{compound(tr,{} inpt)} combine two transforms
213071`\spad{computeBasis(l)} is a helper function which computes a basis of a linear space which contains a lexicographic Groebner basis. It expects a basis (ordered by total degree,{} reverse lexicographic) of a zero dimensional ideal.
213240`\spad{computeCycleEntry(x,{} cycElt)},{} where 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
213308`\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}.
213390`\spad{computeInt(x,{} g,{} a,{} b,{} eval?)} returns the integral of \spad{f} for \spad{x} between a and \spad{b},{} assuming that \spad{g} is an indefinite integral of \spad{f} and \spad{f} has no pole between a and \spad{b}. If \spad{eval?} is \spad{true},{} then \spad{g} can be evaluated safely at \spad{a} and \spad{b},{} provided that they are finite values. Otherwise,{} limits must be computed.
213886`\spad{concat(u)},{} where \spad{u} is a list of aggregates \spad{[a,{} b,{} ...,{} c]},{} returns a single aggregate consisting of the elements of \spad{a} followed by those of \spad{b} followed ... by the elements of \spad{c}. Note: \spad{concat([a,{} b,{} ...,{} c]) = concat(a,{} concat([b,{} ...,{} c]))}.
213939`\spad{concat!(lu)},{} where \spad{lu} is a list of aggregates \spad{[a,{} b,{} ...,{} c]},{} returns a single aggregate consisting of the elements of \spad{a} followed by those of \spad{b} followed ... by the elements of \spad{c}. This function may destructively modify the aggregates in \spad{lu}.
214024`\spad{concat(u)} returns the left-to-right concatenation of the streams in \spad{u}. Note: \spad{concat(u) = reduce(concat,{} u)}.
215163`\spad{concat!(u,{} v)} destructively concatenates doubly-linked aggregate \spad{v} to the end of doubly-linked aggregate \spad{u}.
215242`\spad{concat!(u,{} v)} destructively appends \spad{v} to the end of \spad{u}. \spad{v} is unchanged
215302`\spad{concat(u,{} v)} returns an aggregate consisting of the elements of \spad{u} followed by the elements of \spad{v}. Note: if \spad{w = concat(u,{} v)} then \spad{w.i = u.i for i in indices u} and \spad{w.(j + maxIndex u) = v.j for j in indices v}.
215351`\spad{concat!(u,{} v)} destructively concatenates \spad{v} to the end of \spad{u}.
215432`\spad{concat(u,{} v)} returns an aggregate \spad{w} consisting of the elements of \spad{u} followed by the elements of \spad{v}. Note: \spad{v = rest(w,{} \#u)}.
215489`\spad{concat!(u,{} x)} destructively adds element \spad{x} to the end of \spad{u}.
215549`\spad{concat(u,{} x)} returns aggregate \spad{u} with additional element \spad{x} at the end. Note: for lists,{} \spad{concat(u,{} x) = concat(u,{} [x])}.
215598`\spad{concat(x,{} u)} returns aggregate \spad{u} with additional element \spad{x} at the front. Note: for lists: \spad{concat(x,{} u) = concat([x],{} u)}.
215647`\spad{concat!(u,{} x)} destructively adds element \spad{x} to the end of \spad{u}. Note: \spad{concat!(a,{} x) = concat!(a,{} [x])}.
215728`\spad{concat(x,{} u)} returns aggregate consisting of \spad{x} followed by the elements of \spad{u}. Note: if \spad{v = concat(x,{} u)} then \spad{x = first v} and \spad{u = rest v}.
215785`\spad{cond(s,{} e)} creates a representation of the FORTRAN expression IF (\spad{s}) THEN \spad{e}.
215830`\spad{cond(s,{} e,{} f)} creates a representation of the FORTRAN expression IF (\spad{s}) THEN \spad{e} ELSE \spad{f}.
215877`\spad{condition(n)} returns the condition of the node \spad{n}.
216103`\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 homogeneous linear system represented by \spad{m},{} or "failed" is there is no such vector.
216227`\spad{conditions(a)} returns the list of the conditions of the leaves of a
216284`\spad{conditionsForIdempotents()} determines a complete list of polynomial equations for the coefficients of idempotents with respect to the fixed \spad{R}-module basis
216411`\spad{conditionsForIdempotents()} determines a complete list of polynomial equations for the coefficients of idempotents with respect to the fixed \spad{R}-module basis.
216508`\spad{conditionsForIdempotents()} determines a complete list of polynomial equations for the coefficients of idempotents with respect to the fixed \spad{R}-module basis.
216602`\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}
216944`\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}.
217051`The 'cone' of a simplicial complex is formed by adding the vertex to every facet. 'vertex' should not already be included in existing faces,{} this is not checked and so will lead to simplexes with duplicate vertices.
217124`\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))}.
217195`implements Clifford conjugate for a multivector by involution and reverse of each term separately using: grade: 0 1 2 3... multi: 1 \spad{-1} \spad{-1} 1...
217304`\spad{conjug(x)}should be local but conditional
217374`\spad{conjugate(p)} returns the conjugate partition of a partition \spad{p}
217415`\spad{conjugate(f)} returns the conjugate value operator applied to \spad{f}.
217625`\spad{conjugate(x + \%i y)} returns \spad{x} - \%\spad{i} \spad{y}.
217675`\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}.
217726`\spad{conjugate(q)} negates the imaginary parts of quaternion \spad{q}.
217779`\spad{conjugate(x)} returns the conjugate of \spad{x}.
217834`\spad{conjugate(pt)} is the conjugate of the partition \spad{pt}.
217953`\spad{conjugate(p,{} q)} computes \spad{inv(q) * p * q}; this is 'right action by conjugation'.
217992`\spad{conjugates(lp)} is the stream of conjugates of a stream \indented{1}{of partitions \spad{lp}.}
218090`\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".
218168`\spad{cons(r,{} s)} prepends \spad{r} to the stream \spad{s}
218216`\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.
218252`\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)}.
218290`\spad{consnewpol should} be local
218498`\spad{consRow!(A,{} r)} inserts the row \spad{r} at the top of the matrix \spad{A}.
218596`\spad{const?(f)} checks whether \spad{f} depends of jet variables.
218660`\spad{const(p)} coerces a polynomial into an element of the coefficient ring,{} if it is constant. Otherwise an error occurs.
218792`\spad{const c} is a function which produces \spad{c} when \indented{1}{applied to its argument.}
218845`\spad{constant?(p)} tests if \spad{p} contains no matching variables.
218893`\spad{constant?(p)} tests whether the polynomial \spad{p} belongs to the coefficient ring.
218951`\spad{constant(p)} return the constant term of \spad{p}.
219002`\spad{constant?(x)} returns \spad{true} if \spad{x} is constant.
219058`\spad{constant(f)} is the function \spad{g} \indented{1}{such that \spad{g a= f ()}.}
219118`\spad{constant(x)} tells the pattern matcher that \spad{x} should match only the symbol \spad{'x} and no other quantity. Error: if \spad{x} is not a symbol.
219177`\spad{constant(x)} returns the constant term of \spad{x}.
219226`\spad{constant(x)} tells the pattern matcher that \spad{x} should match only the symbol \spad{'x} and no other quantity.
219302`\spad{constantCoefficientRicDE(op,{} ric)} returns \spad{[[a1,{} L1],{} [a2,{} L2],{} ... ,{} [ak,{} Lk]]} such that any rational solution with no polynomial part of the associated Riccati equation of \spad{op y = 0} must be one of the \spad{ai}\spad{'s} in which case the equation for \spad{z = y e^{-int \spad{ai}}} is \spad{\spad{Li} z = 0}. \spad{ric} is a Riccati equation solver over \spad{F},{} whose input is the associated linear equation.
219419`\spad{constantIfCan(k)} \undocumented
219500`\spad{constantKernel(r)} \undocumented
219566`\spad{constantLeft(f)} is the function \spad{g} \indented{1}{such that \spad{g (a,{} b)= f b}.}
219635`\spad{constantOperator(a)} returns a nullary operator op such that \spad{op()} always evaluate to \spad{a}.
219712`\spad{constantOpIfCan(op)} returns \spad{a} if \spad{op} is the constant nullary operator always returning \spad{a},{} "failed" otherwise.
219804`\spad{constantRight(f)} is the function \spad{g} \indented{1}{such that \spad{g (a,{} b)= f a}.}
219874`\spad{constant_subspace(b,{} ld)} returns [\spad{M},{} \spad{nb}] such that \spad{nb} is basis of subspace spanned by \spad{b} over \spad{F} consistng of vectors with constant coordinates. \spad{M} is the transformation matrix,{} \spadignore{i.e.} \spad{mnb} = \spad{M} \spad{mb} where \spad{mb} (\spad{mnb} respectively) is matrix having \spad{b} (\spad{nb} respectively) as rows.
220018`\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}.
220117`\spad{constDsolve(op,{} g,{} x)} returns \spad{[f,{} [y1,{} ...,{} ym]]} where \spad{f} is a particular solution of the equation \spad{op y = g},{} and the \spad{\spad{yi}}\spad{'s} form a basis for the solutions of \spad{op y = 0}.
220212`\spad{construct(lll)} creates a 3-\spad{D} matrix from a List List List \spad{R} \spad{lll}
220353`\spad{construct([v1,{} e1],{} ...,{} [vn,{} en])} returns the match result containing the matches (\spad{v1},{} \spad{e1}),{} ...,{} (\spad{vn},{} en).
220439`\spad{construct(l)} takes a list of terms and creates the object with these components. First components of elements of \spad{l} should be different.
220518`\spad{construct(lvt)} returns the same as \spad{[construct(vt.val,{} vt.tower) for vt in lvt]}
220892`\spad{construct(vt)} returns the same as \spad{construct(vt.val,{} vt.tower)}
220962`\spad{construct(s)} creates a splitting tree with value (\spadignore{i.e.} root vertex) given by \spad{s} and no children. Thus,{} if the status of \spad{s} is \spad{false},{} \spad{[s]} represents the starting point of the evaluation \spad{value(s)} under the hypothesis \spad{condition(s)}.
221029`\spad{construct(l)} is the inverse of fracPart.
221152`\spad{construct([x,{} y,{} ...,{} z])} returns the collection of elements \spad{x,{} y,{} ...,{} z} ordered as given. Equivalently written as \spad{[x,{} y,{} ...,{} z]\$D},{} where \spad{D} is the domain. \spad{D} may be omitted for those of type List.
221203`\spad{construct(t)} converts an infinite tuple to a stream.
221259`\spad{construct(a,{} b)} creates element of the product with components a and \spad{b}.
221305`\spad{construct(i,{} e)} \undocumented
221363`\spad{construct(x,{} y)} returns the Lie bracket \spad{[x,{} y]}.
221437`\spad{construct(x,{} y)} returns the Lie bracket \spad{[x,{} y]}.
221511`\spad{construct(x,{} y)} returns the Lie bracket \spad{[x,{} y]}.
221602`\spad{construct(op,{} la)} creates OutputForm with operator \spad{op} and arguments la
221684`\spad{construct(s,{} t)} makes a form \spad{s:} \spad{t}
221735`\spad{construct(v,{} t)} returns the same as \spad{construct(v,{} t,{} false)}
221787`\spad{construct(v,{} lt)} returns the same as \spad{[construct(v,{} t) for t in lt]}
221851`\spad{construct(x,{} y)} returns the Lie bracket of \spad{x} and \spad{y}.
221898`\spad{construct(type,{} dims)} creates an element of FortranType
222014`\spad{construct(type,{} dims)} creates an element of FortranType
222117`\spad{construct(v,{} t,{} b)} returns the non-empty node with value \spad{v},{} condition \spad{t} and flag \spad{b}
222177`\spad{construct(v,{} t,{} la)} creates a splitting tree with value (\spadignore{i.e.} root vertex) given by \spad{[v,{} t]\$S} and with \spad{la} as children list.
222237`\spad{construct(v,{} t,{} ls)} creates a splitting tree with value (\spadignore{i.e.} root vertex) given by \spad{[v,{} t]\$S} and with children list given by \spad{[[s]\$\% for s in ls]}.
222314`\spad{construct(v1,{} t,{} v2,{} lt)} creates a splitting tree with value (\spadignore{i.e.} root vertex) given by \spad{[v,{} t]\$S} and with children list given by \spad{[[[v,{} t]\$S]\$\% for s in ls]}.
222376`\spad{construct(mom,{} ccum,{} fcum,{} bcum)} constructs a distribution with moments \spad{mom},{} classical cumulants \spad{ccum},{} free cumulants \spad{fcum} and boolean cumulants \spad{bcum}. The user must make sure that these are consistent,{} otherwise the results are unpredictable!
222469`\spad{constructOrdered(l)} takes a list of terms and creates the object with these components. The list is assumed to be sorted (in reverse order) with respect to the ordering of \spad{S}. If \spad{R} is a monoid,{} then the list is assumed to contain no zero elements. Caution: No checking is performed,{} so this should only be used in cases where those conditions are assured. If in doubt use \spad{construct}.
222572`\spad{contains?(i,{} f)} returns \spad{true} if \spad{f} is contained within the interval \spad{i},{} \spad{false} otherwise.
222631`\spad{containsPoint?(n,{} p)} returns \spad{true} if the point is inside \indented{2}{the boundary.} \spad{n} is the boundary \spad{p} is the point
222690`\spad{content([f1,{} ..,{} fk])} = content of a list of univariate polynonials
222985`\spad{content(p)} gives the \spad{gcd} of the coefficients of polynomial \spad{p}.
223205`\spad{content(p,{} v)} is the \spad{gcd} of the coefficients of the polynomial \spad{p} when \spad{p} is viewed as a univariate polynomial with respect to the variable \spad{v}. Thus,{} for polynomial 7*x^2*y + 14*x*y^2,{} the \spad{gcd} of the coefficients with respect to \spad{x} is 7*y.
223288`\spad{continue(l)} creates a representation of a FORTRAN CONTINUE labelled with \spad{l}
223436`\spad{continuedFraction(x)} converts the \spad{p}-adic rational number \spad{x} to a continued fraction.
223630`\spad{continuedFraction(f)} converts the floating point number \spad{f} to a reduced continued fraction.
223722`\spad{continuedFraction(r)} converts the fraction \spad{r} with components of type \spad{R} to a continued fraction over \spad{R}.
223792`\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 + ...))}.
223872`given a mapping from this graph this function tries to calculate a unique reverse mapping back to this graph
223988`given a mapping from this graph this function tries to calculate a unique reverse mapping back to this graph
224109`\spad{contract(v,{} om)} computes the interior derivative of \spad{om} with respect to \spad{v}.
224182`\spad{contract(I,{} lvar)} contracts the ideal \spad{I} to the polynomial ring \spad{F[lvar]}.
224578`\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))}.}
224653`\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))}.}
224730`\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.
224885`\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.
225030`\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".
225097`\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".
225166`\spad{convergents(x)} returns the stream of the convergents of the continued fraction \spad{x}. If the continued fraction is finite,{} then the stream will be finite.
225597`\spad{convert(cs)} converts the complex expression \spad{cs} to a pattern
225716`\spad{convert(p)} converts a polynomial \spad{p} in distributive representation into a polynomial in recursive representation.
225812`\spad{convert(p)} converts a polynomial \spad{p} in recursive representation into a polynomial in distributive representation.
225908`\spad{convert(l1)} converts an operator \spad{l1} from \spadtype{LinearOrdinaryDifferentialOperator1} to \spadtype{LinearOrdinaryDifferentialOperator3} such that the resultant operator gives the same result as the original one on application to an element of domain \spad{R}.
226048`\spad{convert(l3)} converts an operator \spad{l3} from \spadtype{LinearOrdinaryDifferentialOperator3} to \spadtype{LinearOrdinaryDifferentialOperator1} such that the resultant operator gives the same result as the original one on application to an element of domain \spad{R}.
226188`\spad{convert([a1,{} ...,{} an])} returns the pattern \spad{[a1,{} ...,{} an]}.
226234`\spad{convert(lp)} returns the polynomial set whose members are the polynomials of \spad{lp}.
226548`\spad{convert(a)} transforms a into element of \%.
226833`\spad{convert(s)} makes \spad{s} into an input form.
228921`\spad{convert([a1,{} ..,{} an])} returns \spad{a1*v1 + ... + an*vn},{} where \spad{v1},{} ...,{} \spad{vn} are the elements of the fixed basis.
228974`\spad{convert(a)} returns the coordinates of \spad{a} with respect to the fixed \spad{R}-module basis.
229245`\spad{convert(x)} converts a \spadtype{DoubleFloat} \spad{x} to a \spadtype{Float}.
229290`\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}.
229370`\spad{convert(x)} returns the Lisp atom \spad{x}.
229438`\spad{convert(x)} returns the Lisp atom \spad{x}.
229506`\spad{convert([a1,{} ...,{} an])} returns the \spad{S}-expression \spad{(a1,{} ...,{} an)}.
229578`\spad{convert(l)} takes a list of elements,{} \spad{l},{} from the domain Ring and returns the form of point category.
229630`\spad{convert(q)} converts \spad{q}.
229790`\spad{convert(q)} converts \spad{q}.
229972`\spad{convert(p)} returns the same as \spad{retract(p)}.
230131`\spad{convert(p)} returns the same as \spad{retract(p)}.
230270`\spad{convert(p)} returns the same as \spad{retract(p)}.
230374`\spad{convert(p)} converts \spad{p}.
230696`\spad{convert(a)} transforms a into an element of \spad{S}.
230742`\spad{convert(i)} creates the segment \spad{i..i}.
230790`\spad{convert(u)} converts \spad{u}.
230936`\spad{convert(st)} returns the members of \spad{st}.
231227`converts a SquareMatrix to a LieSquareMatrix
231293`\spad{convert(x)} returns the Lisp atom \spad{x}.
231361`\spad{convert(n)} creates a roman numeral for symbol \spad{n}.
231408`\spad{convert(x)} returns the Lisp atom \spad{x}.
231476`\spad{convert(up)} converts the univariate polynomial \spad{up} to an algebra element,{} reducing by the \spad{definingPolynomial()} if necessary.
231529`\spad{convert(lg,{} lr)} builds group presentation from list of generators \spad{lg} and list of relations \spad{lr}.
231630`\spad{convert(o,{} step)} changes \spad{o} in standard output format to given format and also adds the given step number.
231700`\spad{convert(o,{} step)} changes \spad{o} in standard output format to TeX format and also adds the given step number. This is useful if you want to create equations with given numbers or have the equation numbers correspond to the interpreter step numbers.
231756`\spad{convert(o,{} step,{} type)} changes \spad{o} in standard output format to TeX format and also adds the given \spad{step} number and 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.
232180`\spad{coord(p)} specifies a change of coordinates of point \spad{p}. This option is expressed in the form \spad{coord == p}.
232257`\spad{coord }\undocumented
232423`\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.
232566`\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.
232673`\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.
232780`\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.
233257`\spad{coordinates([v1,{} ...,{} vm])} returns the coordinates of the \spad{vi}\spad{'s} with to the fixed basis. The coordinates of \spad{vi} are contained in the \spad{i}th row of the matrix returned by this function.
233322`\spad{coordinates(a)} returns the coordinates of \spad{a} with respect to the fixed \spad{R}-module basis.
233800`\spad{coordinates(p)} specifies a change of coordinate systems of point \spad{p}. This option is expressed in the form \spad{coordinates == p}.
234408`\spad{coordinates(v,{} B)} computes the coordinates of the vector \spad{v} in the basis \spad{B} if possible and produces an error otherwise.
235060`\spad{coordinates(a,{} [v1,{} ...,{} vn])} returns the coordinates of \spad{a} with respect to the \spad{R}-module basis \spad{v1},{} ...,{} \spad{vn}.
235155`\spad{coordinates([v1,{} ...,{} vm],{} basis)} returns the coordinates of the \spad{vi}\spad{'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.
235238`\spad{coordinates([a1,{} ...,{} am],{} [v1,{} ...,{} vn])} returns a matrix whose \spad{i}-th row is formed by the coordinates of \spad{\spad{ai}} with respect to the \spad{R}-module basis \spad{v1},{} ...,{} \spad{vn}.
235332`\spad{coordinates(a,{} basis)} returns the coordinates of \spad{a} with respect to the basis \spad{basis}.
235407`\spad{coordinates(a,{} [v1,{} ...,{} vn])} returns the coordinates of \spad{a} with respect to the \spad{R}-module basis \spad{v1},{} ...,{} \spad{vn}.
235493`\spad{coordinatesIfCan(v,{} B)} computes the coordinates of the vector \spad{v} in the basis \spad{B} if possible and returns \spad{"failed"} otherwise.
235585`\spad{copies(i,{} s)} will take a string \spad{s} and create a new string composed of \spad{i} copies of \spad{s}.
235646`\spad{coproduct(x)} computes the coproduct of an element \spad{x}
235887`\spad{copy(f)} gives a copy of the element \spad{f}.
235940`\spad{copy(De)} returns a copy of the equation \spad{De}.
235996`\spad{copy(om)} returns a copy of the differential \spad{om}.
236044`\spad{copy(v)} returns a copy of the vector field \spad{v}.
236091`\spad{copy(p)} returns a copy of the linear pencil \spad{p}.
236151`\spad{copy(p)} returns a recursive copy of \spad{p}.
236188`\spad{copy(A)} returns a copy of the matrix \spad{A}.
236239`\spad{copy(n)} returns a copy of \spad{n}.
236284`\spad{copy(x)} \undocumented
236444`\spad{copy(u)} returns a top-level (non-recursive) copy of \spad{u}. Note: for collections,{} \spad{copy(u) = [x for x in u]}.
236480`\spad{copy(n)} gives a copy of \spad{n}.
236526`\spad{copy(s)} returns a new \spadtype{ThreeSpace} that is an exact copy of \spad{s}.
236574`\spad{copy(op)} returns a copy of \spad{op}.
236614`\spad{copy(f,{} alpha)} gives a copy of element \spad{f} multiplied by alpha.
236669`\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.
236758`\spad{copy_first(v1,{} v2,{} n)} copies first \spad{n} elements of \spad{v2} into \spad{n} first positions in \spad{v1}.
236976`\spad{copyInto!(u,{} v,{} i)} returns aggregate \spad{u} containing a copy of \spad{v} inserted at element \spad{i}.
237087`\spad{copy_mat_part(man,{} nr)} creates copy of modular composition matrix stored in first \spad{nr} rows of mat.
237180`\spad{copy_poly(pol,{} d,{} m)} creates copy of \spad{pol} with enough space to represent polynomials of degree smaller than \spad{d}. Error if degree of \spad{pol} is bigger or equal than \spad{d}.
237270`\spad{copy_slice(v1,{} v2,{} m,{} n)} copies the slice of \spad{v2} starting at \spad{m} elements and having \spad{n} elements into corresponding positions in \spad{v1}.
237369`\spad{corrPoly(u,{} lv,{} lr,{} ln,{} lu,{} bsolv)} solves polynomial equation system u/f = sum(ai/lu(\spad{i})) where \spad{f} is product of \spad{lu}(\spad{i}) and deg(\spad{ai}) < deg(\spad{lu}(\spad{i})) using modular method. corrPoly returns "failed" if there are no solution. \spad{lv} is list of variables,{} \spad{lr} is list of corresponding evaluation points,{} bsolv is solver over \spad{R} specialized for modular images of \spad{lu}.
237670`\spad{cos(x)} represents the Fortran intrinsic function COS
237748`\spad{cos(x)} makes a cos kernel for use in Fourier series
237793`\spad{cos(x)} applies the cosine operator to \spad{x}
237944`\spad{cos(st)} computes cosine of a power series \spad{st}.
238027`\spad{cos(st)} computes cosine of a power series \spad{st}.
238124`\spad{cos(z)} returns the cosine of Laurent series \spad{z}.
238210`\spad{cos(z)} returns the cosine of a Puiseux series \spad{z}.
238305`\spad{cos(x)} returns the cosine of \spad{x}.
238360`\spad{cos2sec(f)} converts every \spad{cos(u)} appearing in \spad{f} into \spad{1/sec(u)}.
238422`\spad{cosh(x)} represents the Fortran intrinsic function COSH
238501`\spad{cosh(x)} applies the hyperbolic cosine operator to \spad{x}
238707`\spad{cosh(st)} computes the hyperbolic cosine of a power series \spad{st}.
238791`\spad{cosh(st)} computes the hyperbolic cosine of a power series \spad{st}.
238889`\spad{cosh(z)} returns the hyperbolic cosine of Laurent series \spad{z}.
238976`\spad{cosh(z)} returns the hyperbolic cosine of a Puiseux series \spad{z}.
239072`\spad{cosh(x)} returns the hyperbolic cosine of \spad{x}.
239125`\spad{cosh2sech(f)} converts every \spad{cosh(u)} appearing in \spad{f} into \spad{1/sech(u)}.
239189`\spad{coshIfCan(z)} returns cosh(\spad{z}) if possible,{} and "failed" otherwise.
239270`\spad{cosIfCan(z)} returns cos(\spad{z}) if possible,{} and "failed" otherwise.
239350`\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.
239424`\spad{cot(x)} applies the cotangent operator to \spad{x}
239587`\spad{cot(st)} computes cotangent of a power series \spad{st}.
239670`\spad{cot(st)} computes cotangent of a power series \spad{st}.
239767`\spad{cot(z)} returns the cotangent of Laurent series \spad{z}.
239853`\spad{cot(z)} returns the cotangent of a Puiseux series \spad{z}.
239948`\spad{cot(x)} returns the cotangent of \spad{x}.
240003`\spad{cot2tan(f)} converts every \spad{cot(u)} appearing in \spad{f} into \spad{1/tan(u)}.
240065`\spad{cot2trig(f)} converts every \spad{cot(u)} appearing in \spad{f} into \spad{cos(u)/sin(u)}.
240128`\spad{coth(x)} applies the hyperbolic cotangent operator to \spad{x}
240291`\spad{coth(st)} computes the hyperbolic cotangent of a power series \spad{st}.
240375`\spad{coth(st)} computes the hyperbolic cotangent of a power series \spad{st}.
240473`\spad{coth(z)} returns the hyperbolic cotangent of Laurent series \spad{z}.
240560`\spad{coth(z)} returns the hyperbolic cotangent of a Puiseux series \spad{z}.
240656`\spad{coth(x)} returns the hyperbolic cotangent of \spad{x}.
240709`\spad{coth2tanh(f)} converts every \spad{coth(u)} appearing in \spad{f} into \spad{1/tanh(u)}.
240773`\spad{coth2trigh(f)} converts every \spad{coth(u)} appearing in \spad{f} into \spad{cosh(u)/sinh(u)}.
240838`\spad{cothIfCan(z)} returns coth(\spad{z}) if possible,{} and "failed" otherwise.
240919`\spad{cotIfCan(z)} returns cot(\spad{z}) if possible,{} and "failed" otherwise.
240999`\spad{counit(x)} evaluates the counit at an element \spad{x}
242036`\spad{count(p,{} u)} returns the number of elements \spad{x} in \spad{u} such that \spad{p(x)} is \spad{true}. For collections,{} \spad{count(p,{} u) = reduce(+,{} [1 for x in u | p(x)],{} 0)}.
242139`\spad{count(x,{} u)} returns the number of occurrences of \spad{x} in \spad{u}. For collections,{} \spad{count(x,{} u) = reduce(+,{} [1 for y in u | x = y],{} 0)}.
242253`\spad{countable?(\spad{a})} determines whether \spad{a} is a countable cardinal,{} \spadignore{i.e.} an integer or \spad{Aleph 0}.
242306`\spad{countRealRoots(p)} says how many real roots \spad{p} has
242375`\spad{countRealRootsMultiple(p)} says how many real roots \spad{p} has,{} counted with multiplicity
242534`the covering matrix of a list of elements from a comparison function the list is assumed to be topologically sorted,{} \spadignore{i.e.} \spad{w}.\spad{r}. to a linear extension of the comparison function \spad{f} This function is based on code by Franz Lehner. Notes by Martin Baker on the webpage here: \url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/moebius/}
242602`\spad{cPower(f,{} r)} computes \spad{f^r},{} where \spad{f} has constant coefficient 1. For use when the coefficient ring is commutative.
242710`\spad{cRationalPower(f,{} r)} computes \spad{f^r}. For use when the coefficient ring is commutative.
242839`\spad{create()} returns the only element of \spad{\%}.
242888`\spad{create3Space()} creates a \spadtype{ThreeSpace} object capable of holding point,{} curve,{} mesh components and any combination.
242943`\spad{create3Space(s)} creates a \spadtype{ThreeSpace} object containing objects pre-defined within some \spadtype{SubSpace} \spad{s}.
243011`\spad{createArrows2Din2D(ptFun,{} uSeg,{} vSeg,{} numPts)} creates arrows to represent output for each input point in other words this represents a two dimensional force field with the arrows showing the direction of the field
243129`\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).
243233`\spad{createIrreduciblePoly(n)}\$FFPOLY(\spad{GF}) generates a monic irreducible univariate polynomial of degree \spad{n} over the finite field {\em GF}.
243352`\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 \spadfunFrom{createNormalPoly}{FiniteFieldPolynomialPackage}(\spad{n}) to produce a normal polynomial of degree {\em n} over {\em GF}
243530`\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
243680`\spad{createMultiplicationMatrix(m)} forms the multiplication table {\em m} into a matrix over the ground field.
243811`\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}.
244032`\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.
244118`\spad{createNormalPoly(n)}\$FFPOLY(\spad{GF}) generates a normal polynomial of degree \spad{n} over the finite field {\em GF}.
244232`\spad{createNormalPrimitivePoly(n)}\$FFPOLY(\spad{GF}) generates a normal and primitive polynomial of degree \spad{n} over the field {\em GF}. Note: this function is equivalent to createPrimitiveNormalPoly(\spad{n})
244355`\spad{createPlot1Din2D(f,{} tRange,{} numPts)} creates two dimensional function plot. Draws the graph of \spad{y} = \spad{f}(\spad{x}) as \spad{x} ranges from min(a,{} \spad{b}) to max(a,{} \spad{b}). \spad{tRange} is a..\spad{b}
244468`\spad{createPlot1Din2D(f,{} tRange,{} numPts)} creates a two dimensional function plot draws the graph from a mapping of float to point as \spad{x} ranges from min(a,{} \spad{b}) to max(a,{} \spad{b}). \spad{tRange} is a..\spad{b}
244572`\spad{createPlot1Din2Dparametric(ppc,{} tRange,{} numPts)} creates a node from plot using Parametric Plane Curve. This represents 1 dimension (line - possibly curved) in 2 dimensions (plane) In theory a line has no width but in that case we would not see it so we give it a width given by the material node that is applicable in this part of the scene graph \spad{PPC} is ParametricPlaneCurve(\spad{DF} \spad{->} \spad{DF}) which is created with curve(\spad{f1},{} \spad{f2}) where \spad{f1} and \spad{f2} are functions of type ComponentFunction,{} in this case \spad{DF} \spad{->} \spad{DF}
244717`\spad{createPlot1Din3Dparametric(pcfun,{} tRange,{} numPts)} create a line (1D subspace) in 3D space. This represents 1 dimension (line - possibly curved) in 3 dimensions In theory a line has no width but in that case we would not see it so we give it a width given by the material node that is applicable in this part of the scene graph PCFUN is a function from float to point: \spad{DF} \spad{->} \spad{PT}
244831`\spad{createPlot1Din3Dparametric(psc,{} tRange,{} numPts)} create a line (1D subspace) in 3D space. This represents 1 dimension (line - possibly curved) in 3 dimensions In theory a line has no width but in that case we would not see it so we give it a width given by the material node that is applicable in this part of the scene graph \spad{PSC} ParametricSpaceCurve(\spad{DF} \spad{->} \spad{DF}) is created with curve(\spad{f1},{} \spad{f2},{} \spad{f3}) where \spad{f1},{} \spad{f2} and \spad{f3} are functions of type ComponentFunction,{} in this case \spad{DF} \spad{->} \spad{DF}
244976`\spad{createPlot2Din3D(f,{} a..b,{} c..d)} returns a scene node which contains the graph of \spad{z} = \spad{f}(\spad{x},{} \spad{y}) as \spad{x} ranges from min(a,{} \spad{b}) to max(a,{} \spad{b}) and \spad{y} ranges from min(\spad{c},{} \spad{d}) to max(\spad{c},{} \spad{d}). create a surface (2D subspace) in 3D space The surface is approximated by polygons which are represented by in indexed face set (IFS) node
245122`\spad{createPlot2Din3D(ptFun,{} uSeg,{} vSeg,{} numPts)} create a surface (2D subspace) in 3D space. The surface is approximated by polygons which are represented by in indexed face set (IFS) node
245259`\spad{createPlot2Din3Dparametric(f,{} a..b,{} c..d,{} l)} returns a scene node which contains the graph of the parametric surface \spad{f}(\spad{u},{} \spad{v}) as \spad{u} ranges from min(a,{} \spad{b}) to max(a,{} \spad{b}) and \spad{v} ranges from min(\spad{c},{} \spad{d}) to max(\spad{c},{} \spad{d}). This creates a surface (2D subspace) in 3D space The surface is approximated by polygons which are represented by in indexed face set (IFS) node
245406`\spad{createPlot2Din3Dparametric(surface(f,{} g,{} h),{} a..b,{} c..d,{} l)} returns a scene node which contains the graph of the parametric surface \spad{x} = \spad{f}(\spad{u},{} \spad{v}),{} \spad{y} = \spad{g}(\spad{u},{} \spad{v}),{} \spad{z} = \spad{h}(\spad{u},{} \spad{v}) as \spad{u} ranges from min(a,{} \spad{b}) to max(a,{} \spad{b}) and \spad{v} ranges from min(\spad{c},{} \spad{d}) to max(\spad{c},{} \spad{d}). This creates a surface (2D subspace) in 3D space The surface is approximated by polygons which are represented by in indexed face set (IFS) node
245643`\spad{createPrimitiveElement()} computes a generator of the (cyclic) multiplicative group of the field.
245706`\spad{createPrimitiveNormalPoly(n)}\$FFPOLY(\spad{GF}) generates a normal and primitive polynomial of degree \spad{n} over the field {\em GF}.
245829`\spad{createPrimitivePoly(n)}\$FFPOLY(\spad{GF}) generates a primitive polynomial of degree \spad{n} over the finite field {\em GF}.
245946`\spad{createRandomElement(aG,{} x)} creates a random element of the group algebra generated by {\em aG}.
246045`\spad{createSceneArrow(st,{} en,{} offset,{} mode,{} size)} constructs an arrow node,{} in \spad{n}-dimensional space,{} going from \spad{st} to \spad{en}. 'st' and 'en' are determined from a list of points from named points node. \spad{st} is the start of the arrow \spad{en} is the end of the arrow 'mode' and 'size' parameters determine the size of the arrowhead. \spad{mode} can have the following values: \indented{2}{"fixed"::Symbol \spad{--} fixed size line width given by 'size' parameter} \indented{2}{"proportional"::Symbol \spad{--} size as a proportion of the overall bounds} \indented{2}{"variable"::Symbol \spad{--} size as a proportion of the arrow length} So "proportional" would typically be used when drawing a graph (in graph theory) where it looks better if each arrow head is the same. "variable" would typically be used when drawing a force field where a bigger arrow head might indicate a stronger force.
246127`\spad{createSceneArrow(st,{} en,{} offset,{} mode,{} size,{} fontScale)} constructs an arrow node,{} in \spad{n}-dimensional space,{} going from \spad{st} to \spad{en}. 'st' and 'en' are nodes in the scene and the arrows will be drawn upto their boundary. \spad{st} is the node at the start of the arrow \spad{en} is the node at the end of the arrow 'mode' and 'size' parameters determine the \spad{size} of the arrowhead. \spad{mode} can have the following values: \indented{2}{"fixed"::Symbol \spad{--} fixed \spad{size} line width given by 'size' parameter} \indented{2}{"proportional"::Symbol \spad{--} \spad{size} as a proportion of the overall bounds} \indented{2}{"variable"::Symbol \spad{--} \spad{size} as a proportion of the arrow length} So "proportional" would typically be used when drawing a graph (in graph theory) where it looks better if each arrow head is the same. "variable" would typically be used when drawing a force field where a bigger arrow head might indicate a stronger force. fontScale should be set to the full width of the diagram (not just the width of this node). If this is not known then choose an approximate value. This only affects text nodes,{} if \spad{st} or \spad{en},{} or its subnodes,{} do not contain a text node then its value is not significant.
246211`\spad{createSceneArrows(line,{} mode,{} size)} constructs an arrow node,{} this contains arrows (represented by a list of points) in \spad{n}-dimensional space. The space is implicit in the \spad{PT} and \spad{TR} parameters supplied when this Scene was created. 'mode' and 'size' parameters determine the size of the arrowhead. \spad{mode} can have the following values: \indented{2}{"fixed"::Symbol \spad{--} fixed size \spad{line} width given by 'size' parameter} \indented{2}{"proportional"::Symbol \spad{--} size as a proportion of the overall bounds} \indented{2}{"variable"::Symbol \spad{--} size as a proportion of the arrow length} So "proportional" would typically be used when drawing a graph (in graph theory) where it looks better if each arrow head is the same. "variable" would typically be used when drawing a force field where a bigger arrow head might indicate a stronger force.
246292`\spad{createSceneBox(size)} constructs an indexed face set node which is a 3D box of a given \spad{size}
246348`\spad{createSceneClip(bb)} constructs a clip node,{} clips its sub nodes in the coordinate system in force at the clip node.
246407`\spad{createSceneDef(nam,{} nde)} defines a point in the scenegraph so that it can be used elsewhere.
246460`\spad{createSceneGraph(g,{} x,{} y,{} dispArrowName)} creates a graph theory diagram
246574`\spad{createSceneGrid(bb)} constructs a grid with narrow blue lines every 20 units wide blue lines every 100 units wide red lines every 200 units
246633`\spad{createSceneGrid(stepSize,{} bb)} constructs a grid,{} consists of a group,{} under which are vertical and horizontal lines. The spacing between lines is given by step.
246704`\spad{createSceneGroup()} constructs a group node,{} this node does not do anything itself but contains other nodes
246751`\spad{createSceneIFS(in1)} constructs an indexed face set node,{} this defines a surface represented by a set of polygons in \spad{n}-dimensional space.
246808`\spad{createSceneIFS(inx,{} pts)} constructs an indexed face set node,{} this defines a surface represented by a set of polygons in \spad{n}-dimensional space.
246892`\spad{createSceneLine(line)} constructs a \spad{line} node,{} this contains a \spad{line} (represented by a list of points) in \spad{n}-dimensional space. The space is implicit in the \spad{PT} and \spad{TR} parameters supplied when this Scene was created.
246946`\spad{createSceneLine(st,{} en,{} fontScale)} constructs a line node,{} that contains a line,{} in \spad{n}-dimensions,{} from \spad{st} to \spad{en}. 'st' and 'en' are nodes in the scene and the line will be drawn upto their boundary. \spad{st} is the node at the start of the line \spad{en} is the node at the end of the line fontScale should be set to the full width of the diagram (not just the width of this node). If this is not known then choose an approximate value. This only affects text nodes,{} if \spad{st} or \spad{en},{} or its subnodes,{} do not contain a text node then its value is not significant.
247007`\spad{createSceneLine(st,{} en,{} fontScale,{} shortenLine)} constructs a line node,{} that contains a line,{} in \spad{n}-dimensions,{} from \spad{st} to \spad{en}. 'st' and 'en' are nodes in the scene and the line will be drawn upto their boundary. \spad{st} is the node at the start of the line \spad{en} is the node at the end of the line \spad{fontScale} should be set to the full width of the diagram (not just the width of this node). If this is not known then choose an approximate value. This only affects text nodes,{} if \spad{st} or \spad{en},{} or its subnodes,{} do not contain a text node then its value is not significant. shortenLine if \spad{true} line drawn upto boundary rather than \indented{12}{centre of destination.}
247076`\spad{createSceneLines(line)} constructs a \spad{line} node,{} this contains lines (represented by a list of points) in \spad{n}-dimensional space. The space is implicit in the \spad{PT} and \spad{TR} parameters supplied when this Scene was created.
247137`\spad{createSceneMaterial(mat)} constructs a material node This sets the lineWidth,{} lineCol and fillCol for all nodes under this,{} unless overridden by another material node. That is the material parameters that apply to a given node are those of the closest material node above it in the hierarchy line width is expressed relative to the width of current boundary
247269`\spad{createSceneMaterial(lineW,{} lineC,{} fillC)} constructs a material node This sets the lineWidth,{} lineCol and fillCol for all nodes under this,{} unless overridden by another material node. That is the material parameters that apply to a given node are those of the closest material node above it in the hierarchy
247344`\spad{createSceneNamedPoints(np)} constructs a named points node,{} this allows us to define a set of points which can be used multiple times in the scenegraph.
247417`\spad{createScenePattern(ptype,{} step,{} bb)} creates a test pattern suitable for showing the effect of transforms. The pattern depends on \spad{ptype} parameter as follows: ptype="GRID"::Symbol : construct a set of horizontal and vertical lines in the current clip boundary and current material with a spacing between lines given by the \spad{step} parameter. ptype="SIERPINSKI"::Symbol: constructs a Sierpinski fractal. \spad{step} parameter gives the level of subdivision. ptype="HOUSE"::Symbol: constructs a house shape.
247505`\spad{createSceneRoot()} constructs the root node,{} all other nodes are contained in a tree structure under this node
247551`\spad{createSceneRoot(bb)} constructs the root node,{} all other nodes are contained in a tree structure under this node
247610`\spad{createSceneRoot(minx,{} miny,{} maxx,{} maxy)} constructs the root node,{} all other nodes are contained in a tree structure under this node
247687`\spad{createSceneRuler(ptype,{} offset,{} bb)} creates a scale that can be used to provide numeric values for an axis: ptype= "HORIZONTAL"::Symbol : horizontal axis. ptype= "VERTICAL"::Symbol: vertical axis. ptype= "DEBTH"::Symbol: depth axis.
247757`\spad{createSceneShape(shape)} constructs a \spad{shape} node,{} this contains a \spad{shape} such as a rectangle or an ellipse.
247857`\spad{createSceneShape(shape)} constructs a \spad{shape} node from a boundary,{} this contains a \spad{shape} such as a rectangle or an ellipse.
247917`\spad{createSceneText(text)} constructs a \spad{text} node,{} \spad{text} can be used for labelling anything such as graphs,{} axes and so on.
248027`\spad{createSceneText(str,{} sz,{} pz)} constructs a text node using information from named points node.
248107`\spad{createSceneText(str,{} sz,{} pz)} constructs a text node,{} text can be used for labelling anything such as graphs,{} axes and so on.
248181`\spad{createSceneTransform(tran)} constructs a transform node This transforms the points and vectors below this node If a given node has more than one transform node above it in the hierarchy then the transforms are compound
248246`\spad{createSceneUse(nam)} uses another point in the scenegraph.
248297`\spad{createThreeSpace()} creates a \spadtype{ThreeSpace(DoubleFloat)} object capable of holding point,{} curve,{} mesh components and any combination.
248375`\spad{createWidth(x)} can be used by domains which extend graph to help in creating coordinates for objects in a graph
248457`\spad{createWidth(x)} can be used by domains which extend graph to help in creating coordinates for objects in a graph
248616`\spad{createX(x,{} n)} can be used by domains which extend graph to help in creating the \spad{x} coordinate for objects in a graph
248713`\spad{createX(x,{} n)} can be used by domains which extend graph to help in creating the \spad{x} coordinate for objects in a graph
248902`\spad{createY(x,{} n)} can be used by domains which extend graph to help in creating the \spad{y} coordinate for objects in a graph
248999`\spad{createY(x,{} n)} can be used by domains which extend graph to help in creating the \spad{y} coordinate for objects in a graph
249188`\spad{createZechTable(f)} generates a Zech logarithm table for the cyclic group representation of a extension of the ground field by the primitive polynomial {\em f(x)},{} \spadignore{i.e.} \spad{Z(i)},{} defined by {\em x^Z(i) = 1+x^i} is stored at index \spad{i}. This is needed in particular to perform addition of field elements in finite fields represented in this way. See \spadtype{FFCGP},{} \spadtype{FFCGX}.
249307`\spad{credPol }\undocumented
249393`\spad{critB }\undocumented
249488`\spad{critBonD }\undocumented
249705`\spad{critM }\undocumented
249788`\spad{critMonD1 }\undocumented
250007`\spad{critMTonD1 }\undocumented
250221`\spad{critpOrder }\undocumented
250431`\spad{critT }\undocumented
250569`\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.
250708`\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
250754`\spad{cross(u,{} v)} constructs the cross product of \spad{u} and \spad{v}. Error: if \spad{u} and \spad{v} are not of length 3.
250812`\spad{crushedSet(lp)} returns \spad{lq} such that \spad{lp} and and \spad{lq} generate the same ideal and no rough basic sets reduce (in the sense of Groebner bases) the other polynomials in \spad{lq}.
250895`\spad{csc(x)} applies the cosecant operator to \spad{x}
251058`\spad{csc(st)} computes cosecant of a power series \spad{st}.
251141`\spad{csc(st)} computes cosecant of a power series \spad{st}.
251238`\spad{csc(z)} returns the cosecant of Laurent series \spad{z}.
251324`\spad{csc(z)} returns the cosecant of a Puiseux series \spad{z}.
251419`\spad{csc(x)} returns the cosecant of \spad{x}.
251474`\spad{csc2sin(f)} converts every \spad{csc(u)} appearing in \spad{f} into \spad{1/sin(u)}.
251536`\spad{csch(x)} applies the hyperbolic cosecant operator to \spad{x}
251699`\spad{csch(st)} computes the hyperbolic cosecant of a power series \spad{st}.
251783`\spad{csch(st)} computes the hyperbolic cosecant of a power series \spad{st}.
251881`\spad{csch(z)} returns the hyperbolic cosecant of Laurent series \spad{z}.
251968`\spad{csch(z)} returns the hyperbolic cosecant of a Puiseux series \spad{z}.
252064`\spad{csch(x)} returns the hyperbolic cosecant of \spad{x}.
252117`\spad{csch2sinh(f)} converts every \spad{csch(u)} appearing in \spad{f} into \spad{1/sinh(u)}.
252181`\spad{cschIfCan(z)} returns csch(\spad{z}) if possible,{} and "failed" otherwise.
252262`\spad{cscIfCan(z)} returns \spad{csc}(\spad{z}) if possible,{} and "failed" otherwise.
252342`\spad{cSec(f)} computes the secant of the power series \spad{f}. For use when the coefficient ring is commutative.
252443`\spad{cSech(f)} computes the hyperbolic secant of the power series \spad{f}. For use when the coefficient ring is commutative.
252545`\spad{cSin(f)} computes the sine of the power series \spad{f}. For use when the coefficient ring is commutative.
252646`\spad{cSinh(f)} computes the hyperbolic sine of the power series \spad{f}. For use when the coefficient ring is commutative.
252748`\spad{csolve_pol(solf,{} lp)} uses \spad{solf} to solve linear dependence for univariate polynomials.
252859`\spad{csolve_rf(solf,{} lrf)} uses \spad{solf} to solve linear dependence for univariate rational functions.
252979`\spad{csolve_rmat(solf,{} mrf)} uses \spad{solf} to solve linear dependence for univariate rational functions.
253103`\spad{csubst(a,{} b)} is for internal use only
253219`\spad{cTan(f)} computes the tangent of the power series \spad{f}. For use when the coefficient ring is commutative.
253320`\spad{cTanh(f)} computes the hyperbolic tangent of the power series \spad{f}. For use when the coefficient ring is commutative.
253422`\spad{cubic(u)} \undocumented
253491`\spad{cubic(f,{} g,{} h,{} i)} \undocumented
253565`construct empty cubical complex
253633`constructor where the cubes are supplied
253720`constructor where the cubes are supplied
253814`constructor where the cubes are supplied
253911`Copy constructor which can change mul
253977`Constructor for cubical facet
254050`Constructor for cubical facet intervals are always stored in low..high order orientation is calculated by the number of intervals that have to be flipped to put it in order.
254126`\spad{cumulant2moment(cc)} computes the sequence of moments from the sequence of classical cumulants \spad{cc}
254200`\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.}
254354`\spad{currentSubProgram()} returns the name of the current subprogram being processed
254412`\spad{curry(f,{} a)} is the function \spad{g} \indented{1}{such that \spad{g ()= f a}.}
254471`\spad{curryLeft(f,{} a)} is the function \spad{g} \indented{1}{such that \spad{g b = f(a,{} b)}.}
254539`\spad{curryRight(f,{} b)} is the function \spad{g} such that \indented{1}{\spad{g a = f(a,{} b)}.}
254608`\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.
254664`\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.
254726`\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.
254788`\spad{curve(c1,{} c2)} creates a plane curve from 2 component functions \spad{c1} and \spad{c2}.
254889`\spad{curve(s,{} [[p0],{} [p1],{} ...,{} [pn]])} adds a space curve which is a list of points \spad{p0} through \spad{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}.
254952`\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}.
255016`\spad{curve(c1,{} c2,{} c3)} creates a space curve from 3 component functions \spad{c1},{} \spad{c2},{} and \spad{c3}.
255135`\spad{curveColor(v)} specifies a color,{} \spad{v},{} for 2D graph curves. This option is expressed in the form \spad{curveColor == v}.
255182`\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}.
255231`\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.
255320`\spad{curveLoops(pts1,{} r,{} nn)} generates ifs from line given by \spad{pts1}
255405`\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.
255514`\spad{cycleClosed(objs,{} arrowName)} constructs a graph with vertices (from \spad{objs}) connected in a cycle. arrowName is a prefix for all arrow names,{} this will be followed by a number starting at 1 and incremented for each arrow
255575`\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
255757`\spad{cycleEntry(u)} returns the head of a top-level cycle contained in aggregate \spad{u},{} or \spad{empty()} if none exists.
255962`\spad{cycleLength(u)} returns the length of a top-level cycle contained in aggregate \spad{u},{} or 0 if \spad{u} has no such cycle.
256090`\spad{cycleOpen(objs,{} arrowName)} constructs a graph with vertices (from \spad{objs}) connected in a cycle but with one gap. The last vertex in the sequence loops back to itself so all vertices have one outgoing arrow. arrowName is a prefix for all arrow names,{} this will be followed by a number starting at 1 and incremented for each arrow
256149`\spad{cyclePartition(p)} returns the cycle structure of a permutation \spad{p} including cycles of length 1 only if \spad{S} is finite.
256208`\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]}.
256272`\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 multiplied. Error: if repetitions occur in one cycle.
256393`\spad{cycleSplit!(u)} splits the aggregate by dropping off the cycle. The value returned is the cycle entry,{} or empty() if none exists. For example,{} if \spad{w = concat(u,{} v)} is the cyclic list where \spad{v} is the head of the cycle,{} \spad{cycleSplit!(w)} will drop \spad{v} off \spad{w} thus destructively changing \spad{w} to \spad{u},{} and returning \spad{v}.
256584`\spad{cycleTail(u)} returns the last node in the cycle,{} or empty() if none exists.
256819`\spad{cyclic?(u)} tests if \spad{u} has a cycle.
256876`\spad{cyclic n} is the cycle index of the \indented{1}{cyclic group of degree \spad{n}.}
256963`\spad{cyclicGroup(n)} constructs the cyclic group of order \spad{n} acting on the integers 1,{} ...,{} \spad{n}.
257028`\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.
257122`\spad{cyclicGroup(n)} constructs the cyclic group of order \spad{n} acting on the integers 1,{} ...,{} \spad{n}.
257218`\spad{cyclicSubmodule(lm,{} v)} generates a basis as follows. It is assumed that the size \spad{n} of the vector equals the number of rows and columns of the matrices. Then the matrices generate a subalgebra,{} say \spad{A},{} of the algebra of all square matrices of dimension \spad{n}. {\em V R} is an \spad{A}-module in the natural way. cyclicSubmodule(\spad{lm},{} \spad{v}) generates the \spad{R}-Basis of {\em Av} as described in section 6 of \spad{R}. A. Parker\spad{'s} "The Meat-Axe". Note: in contrast to the description in "The Meat-Axe" and to {\em standardBasisOfCyclicSubmodule} the result is in echelon form.
257343`\spad{cyclotomic(n)} computes \spad{n}-th cyclotomic polynomial.
257435`\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.
257539`\spad{cyclotomic?(p)} checks if \spad{p} is a cyclotomic polynomial. If yes returns \spad{n} such that \spad{p = cyclotomic(n)}. Otherwise returns "failed".
257648`\spad{cyclotomic(n,{} r)} returns value of the \spad{n}th cyclotomic polynomial at \spad{r}.
257737`\spad{cyclotomic_array(n)} computes pa containing lower half of coefficients of \spad{n}-th cyclotomic polynomial. maximal index in \spad{pa} is \spad{eulerPhi(n)/2}. Due to symmetry this is enough to reconstruct cyclotomic polynomial from computed coefficients.
257823`\spad{cyclotomic_case?(u)} should be local but conditional
257946`\spad{cyclotomic_decomposition(n)} computes list of irreducible factors of \spad{x^n - 1} over integers.
258058`\spad{cyclotomic_roots(n)} returns list of roots of \spad{n}-th cyclotomic polynomial.
258159`\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}.
258227`\spad{cylindricalDecomposition(lp)} is cylindricalDecomposition(\spad{lp},{} \spad{lv}) where \spad{lv} is list of variables in \spad{lp}.
258368`\spad{cylindricalDecomposition(lp,{} lv)} computes cylindrical decomposition of \spad{lp} in using variable order given by \spad{lv}
258588`\spad{D()} provides the operator corresponding to a derivation in the ring \spad{A}.
258656`\spad{d(f)} computes the differential of \spad{f}.
258701`\spad{d(jb)} returns the differential of \spad{jb}.
258832`\spad{D(v)} returns the operator corresponding to derivative with respect to \spad{v} in \spad{R}.
258892`\spad{D(v)} returns operator corresponding to derivative with respect to \spad{v} in \spad{R}.
258969`\spad{D(x)} returns the derivative of \spad{x}. This function is a simple differential operator where no variable needs to be specified.
259009`\spad{D(f)} returns the derivative of \spad{f}.
259461`\spad{D(U,{} [X1,{} ...,{} Xq])} generates a derivative. \spad{U} must be in \spad{DVar}; all other symbols in \spad{IVar}.
259523`\spad{D(u,{} der)} generates a derivative.
259592`\spad{D(x,{} [s1,{} ...sn])} computes successive partial derivatives,{} \spadignore{i.e.} \spad{D(...D(x,{} s1)...,{} sn)}.
259650`\spad{D(x,{} n)} returns the \spad{n}-th derivative of \spad{x}.
259709`\spad{D(f,{} n)} returns the \spad{n}-th derivative of \spad{f}.
259786`\spad{D(x,{} deriv)} differentiates \spad{x} extending the derivation deriv on \spad{R}.
259841`\spad{D(x,{} v)} computes the partial derivative of \spad{x} with respect to \spad{v}.
260271`\spad{D(x,{} [s1,{} ...,{} sn],{} [n1,{} ...,{} nn])} computes multiple partial derivatives,{} \spadignore{i.e.} \spad{D(...D(x,{} s1,{} n1)...,{} sn,{} nn)}.
260354`\spad{D(x,{} deriv,{} n)} differentiate \spad{x} \spad{n} times using a derivation which extends \spad{deriv} on \spad{R}.
260428`\spad{D(x,{} s,{} n)} computes multiple partial derivatives,{} \spadignore{i.e.} \spad{n}-th derivative of \spad{x} with respect to \spad{s}.
260499`\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 \spad{GF}(2^n)",{} Siam \spad{J}. Computation,{} Vol.19,{} No.4,{} \spad{pp}.711-717,{} August 1990 is used. Argument \spad{k} is a parameter of this algorithm.
260615`\spad{danilewski(m)} converts \spad{m} to block form where each block represents transposition of multiplication by a polynomial.
260732`\spad{dark(c)} sets the shade of the indicated hue of \spad{c} to it\spad{'s} lowest value.
260770`\spad{datalist(l)} creates a datalist from \spad{l}
260818`\spad{ddfact(pv,{} md)} computes distinct degree factorization of \spad{pv}. \spad{pv} is assumed square-free and monic,{} \spad{md} is info representing finite field.
261326`\spad{debug(true)} turns debug mode on \spad{debug(false)} turns debug mode off
261370`\spad{debug returns} whether we want additional output on the progress,{} default being \spad{false}
261441`\spad{debug(d)} specifies whether we want additional output on the progress. This option is expressed in the form \spad{debug == d}.
261486`\spad{debug3D(true)} turns debug mode on; debug3D(\spad{false}) turns debug mode off.
261534`\spad{dec(x)} returns \spad{x - 1}.
261579`\spad{decimal(r)} converts a rational number to a decimal expansion.
261641`\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).
261691`\spad{declare!(u,{} t)} declares the parameter \spad{u} to have type \spad{t} in the current level of the symbol table.
261763`\spad{declare!(l,{} t,{} tab)} creates new entries in tab,{} declaring each of \spad{l} to be of type \spad{t}
261840`\spad{declare!(u,{} t,{} tab)} creates a new entry in tab,{} declaring \spad{u} to be of type \spad{t}
261911`\spad{declare!(u,{} t,{} asp)} declares the parameter \spad{u} to have type \spad{t} in asp.
261990`\spad{declare!(u,{} t,{} asp,{} tab)} declares the parameters \spad{u} of subprogram \spad{asp} to have type \spad{t} in symbol table tab.
262077`\spad{declare!(u,{} t,{} asp,{} tab)} declares the parameter \spad{u} of subprogram \spad{asp} to have type \spad{t} in symbol table tab.
262158`\spad{decompose(d)} returns \spad{[id,{} f]} where \spad{d = (id) + div(f)}.
262289`\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 with respect to \spad{D},{} \spad{denom(s)} is special with respect to \spad{D},{} and \spad{n} and \spad{s} are proper fractions (no pole at infinity). \spad{D} is the derivation to use.
262424`\spad{decompose(n,{} [p1,{} ...,{} pn])} returns numerators of partial fraction decomposition of \spad{n} divided by product of \spad{pi}-\spad{s} Note: decomposition is assumed to have no whole part.
262999`\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.
263266`\spad{decomposeIfCan(f)} returns a functional decomposition of the polynomial \spad{f} or "failed" if it has not found any.
263401`\spad{decreasePrecision(n)} decreases the current \spadfunFrom{precision}{FloatingPointSystem} precision by \spad{n} decimal digits.
263505`assumes \spad{ln} contains a list of factors which must be \spad{true} for the whole to be \spad{true} (such as the list produced by factor). From this deductions attempts to produce a list of other proposition that must also be \spad{true} by using modus ponens. This is used to determine the returned type when converting ILogic to types by using the Curry-Howard isomorphism.
263556`assumes \spad{ln} contains a list of factors which must be \spad{true} for the whole to be \spad{true} (such as the list produced by factor). From this deductions attempts to produce a list of other proposition that must also be \spad{true} by using modus ponens. This is used to determine the returned type when converting ILogic to types by using the Curry-Howard isomorphism.
263619`assumes \spad{ln} contains a list of factors which must be \spad{true} for the whole to be \spad{true} (such as the list produced by factor). From this deductions attempts to produce a list of other proposition that must also be \spad{true} by using modus ponens. This is used to determine the returned type when converting ILogic to types by using the Curry-Howard isomorphism.
263682`\spad{deepCopy(x)} \undocumented
263926`\spad{deepestInitial(p)} returns an error if \spad{p} belongs to \spad{R},{} otherwise returns the last term of \spad{iteratedInitials(p)}.
264063`\spad{deepestTail(p)} returns \spad{0} if \spad{p} belongs to \spad{R},{} otherwise returns tail(\spad{p}),{} if \spad{tail(p)} belongs to \spad{R} or \spad{mvar(tail(p)) < mvar(p)},{} otherwise returns \spad{deepestTail(tail(p))}.
264131`\spad{deepExpand(x)} rewrites all terms of \spad{x} as commutators of generators.
264200`\spad{defaultEpilogue(label)} returns a box that is used at the end of every format.
264268`\spad{defaultPrologue(label)} returns a box that is used at the beginning of every format.
264336`\spad{defineProperty(s,{} \spad{li},{} p)} defines the component property in the 3 dimensional subspace,{} \spad{s},{} to be that of \spad{p},{} where \spad{p} is of the domain \spadtype{SubSpaceComponentProperty}. The list of non negative integers,{} \spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component whose property is being defined. The subspace,{} \spad{s},{} is returned with the component property definition.
264437`\spad{definingEquations(s)} returns a list of defining polynomials for equations,{} that is,{} for the Zariski closed part of \spad{s}.
264523`\spad{definingInequation(s)} returns a single defining polynomial for the inequation,{} that is,{} the Zariski open part of \spad{s}.
264688`\spad{definingPolynomial()} returns the polynomial used to define the field extension.
264788`\spad{definingPolynomial()} returns the minimal polynomial which \spad{generator()} satisfies.
264851`\spad{definingPolynomial(f)} returns the defining polynomial of \spad{f} as an element of \spad{F}. Error: if \spad{f} is not a kernel.
264943`\spad{definingPolynomial(x)} returns an expression \spad{p} such that \spad{p(x) = 0}.
265014`\spad{definingPolynomial(aRoot)} gives a polynomial such that \spad{definingPolynomial(aRoot).aRoot = 0}
265177`\spad{degree(p)} returns the maximum of the exponents of the terms of \spad{p}.
265249`\spad{degree(x)} \undocumented
265307`\spad{degree(x)} gives degree of \spad{x}.
265384`\spad{degree(p)} returns the homogeneous degree of \spad{p}.
265446`\spad{degree(df)} returns the homogeneous degree of differential form \spad{df}.
265526`\spad{degree(x)} gives the numbers of 1\spad{'s} in \spad{x},{} \spadignore{i.e.} the number of non-zero exponents in the basis element that \spad{x} represents.
265583`\spad{degree(pol)} returns degree of the polynomial \spad{pol}.
265664`\spad{degree(v)} is degree of \spad{v} treated as polynomial
265745`\spad{degree(v)} is degree of \spad{v} treated as polynomial
266225`\spad{degree(v)} is degree of \spad{v} treated as polynomial
266297`\spad{degree(p)} returns the maximum of the exponents of the terms of \spad{p}.
266348`\spad{degree(g)} names the degree of \spad{g}. The set of all elements of a given degree form an \spad{R}-module.
266394`\spad{degree(f)} returns the exponent of the lowest order term of \spad{f}.
266462`\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.
266559`\spad{degree(f(x))} returns the degree of the lowest order term of \spad{f(x)},{} which may have zero as a coefficient.
266646`\spad{degree(x)} returns the greatest length of a word in the support of \spad{x}.
266716`\spad{degree(ts)} returns the product of main degrees of the members of \spad{ts}.
266792`\spad{degree(p)} returns the degree of \spad{p}. \indented{1}{Note that the degree of a word is its length.}
266859`\spad{degree(gp)} returns the number of points moved by all permutations of the group {\em gp}.
266924`\spad{degree(p)} returns the number of points moved by the permutation \spad{p}.
266984`\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.
267064`\spad{degree(a)} returns the degree of the minimal polynomial of an element \spad{a} over the ground field \spad{F}.
267406`\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}.
267510`\spad{degree(p,{} v)} computes degree of \spad{p} with respect to \spad{v}.
267705`\spad{degree(upoly,{} lvar)} returns a list containing the maximum degree for each variable in lvar.
267981`\spad{degree(p,{} v)} gives the degree of polynomial \spad{p} with respect to the variable \spad{v}.
268073`\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.
268160`\spad{degreePartition(f)} returns the degree partition (\spadignore{i.e.} the multiset of the degrees of the irreducible factors) of the polynomial \spad{f}.
268272`\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 \spad{ddfact} from modular factorization package for some prime \spad{p}.
268399`\spad{degreeSubResultant(P,{} Q,{} d)} computes a subresultant of degree \spad{d}.
268501`\spad{degreeSubResultantEuclidean(P,{} Q,{} d)} returns a subresultant \spad{S_i} of degree \spad{d} and carries out the equality \spad{coef1*P + coef2*Q = S_i}.
268655`\spad{dehomogenize(ls)} converts list of solutions (a,{} [\spad{c0},{} \spad{c1},{} ...,{} \spad{cn}]) to homogeneous equation \spad{L}(a) + \spad{c0} \spad{f} + \spad{c1} \spad{g1} + ... + \spad{cn} \spad{gn} = 0 into list of solutions of inhomogeneous equation \spad{L}(a) + \spad{f} + \spad{c1} \spad{g1} + ... + \spad{cn} \spad{gn} = 0. This transformation works the same for all equations,{} so we only need list of solutions as argument
268876`\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.
269465`\spad{delete!(u,{} i)} destructively deletes the \spad{i}th element of \spad{u}.
269531`\spad{delete(u,{} i)} returns a copy of \spad{u} with the \spad{i}th element deleted. Note: \spad{delete(u,{} i) = concat(u(minIndex(u)..i - 1),{} u(i + 1..))}.
269586`\spad{delete!(u,{} i..j)} destructively deletes elements \spad{u}.\spad{i} through \spad{u}.\spad{j}.
269670`\spad{delete(u,{} i..j)} returns a copy of \spad{u} with the \spad{i}th through \spad{j}th element deleted. Note: \spad{delete(u,{} i..j) = concat(u(minIndex(u)..i-1),{} u(j+1..))}.
269743`\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.
269801`\spad{deleteRow(A,{} i)} deletes the \spad{i}\spad{-}th row of the matrix \spad{A}.
269869`\spad{Delta()} returns symbol for capital greek letter delta.
269920`\spad{delta()} returns symbol for small greek letter delta.
269971`\spad{Delta(s)} returns operator corresponding to derivative with respect to \spad{s} in \spad{R}.
270095`\spad{delta(S,{} k,{} p)} returns the number of elements of \spad{S} which are strictly between \spad{p} and the \spad{k^}{th} element of \spad{S}.
270199`construct from FiniteCubicalComplex. This builds indexes of edges,{} squares and so on.
270273`construct from FiniteSimplicialComplex. This builds indexes of edges,{} triangles and so on.
270430`constructor where the simplices are supplied
270533`\spad{delta_deriv(f)} is x*f' where \spad{x} is variable in A
270616`\spad{denom(1/d * (f1,{} ...,{} fn))} returns \spad{d}.
270669`\spad{denom x} returns the denominator of \spad{x}.
270714`\spad{denom x} returns the denominator of \spad{x}.
270755`\spad{denom(x)} returns the denominator of the fraction \spad{x}.
270807`\spad{denom(f)} returns the denominator of \spad{f} viewed as a polynomial in the kernels over \spad{Z}.
270896`\spad{denom(f)} returns the denominator of \spad{f} viewed as a polynomial in the kernels over \spad{R}.
271052`\spad{denominator(f)} yields the denominator of \spad{f}.
271166`\spad{denominator(f)} returns the denominator of \spad{f} converted to \%.
271240`\spad{denominator(x)} is the denominator of the fraction \spad{x} converted to \%.
271298`\spad{denominators(x)} returns the stream of denominators of the approximants of the continued fraction \spad{x}. If the continued fraction is finite,{} then the stream will be finite.
271361`\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.
271448`\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}.
271525`\spad{denomRicDE(op)} returns a polynomial \spad{d} such that any rational solution of the associated Riccati equation of \spad{op y = 0} is of the form \spad{p/d + q'/q + r} for some polynomials \spad{p} and \spad{q} and a reduced \spad{r}. Also,{} \spad{deg(p) < deg(d)} and {\spad{gcd}(\spad{d},{} \spad{q}) = 1}.
271587`\spad{depth(box)} returns the height of the \spad{box} below the baseline.
271641`\spad{depth(p)} returns the nesting level of \spad{p}.
271696`\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}.
271742`\spad{dequeue!(q)} 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.
271790`\spad{deref(n)} is equivalent to \spad{elt(n)}.
271830`\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,{} ...]}.
271905`\spad{deriv(f)} is the derivative,{} which simply coincides with left shift
272081`\spad{derivationCoordinates(b,{} ')} returns \spad{M} such that \spad{b' = M b}.
272182`\spad{derivative(op)} returns the value of the "\%diff" property of \spad{op} if it has one,{} and "failed" otherwise.
272286`\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.
272376`\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)}.
272478`\spad{derivativeOf?(jv1,{} jv2)} checks whether \spad{jv1} is a derivative of \spad{jv2}. In this case,{} the difference of their multi-indices is returned. Otherwise,{} an empty list is returned.
272633`\spad{deserialize(d)} reconstructs \spad{o} from \spad{d := serialize(o)}.
272690`\spad{destruct(r)} returns the list of matches (var,{} expr) in \spad{r}. Error: if \spad{r} is a failed match.
272775`\spad{destruct((a1,{} ...,{} an))} returns the list [\spad{a1},{} ...,{} an].
272848`\spad{determinant(m)} returns the determinant of the matrix \spad{m}. an error message is returned if the matrix is not square.
272940`\spad{determinant(m)} returns the determinant of the matrix \spad{m}. an error message is returned if the matrix is not square.
273015`\spad{determinant(m)} returns the determinant of the matrix \spad{m}. Error: if the matrix is not square.
273096`\spad{determinant(m)} returns the determinant of the matrix \spad{m}.
273188`\spad{detSys(sys)} computes the determining system for symmetry generators of the system \spad{sys}. It is assumed that each equation can be solved for its leading derivative.
273327`\spad{detSys(sys,{} vf)} computes the determining system for symmetry generators of the system \spad{sys} with a given ansatz for the generators. It is assumed that each equation can be solved for its leading derivative.
273487`\spad{detSys(sys,{} sjb,{} vf)} computes the determining system for symmetry generators of the system \spad{sys} with a given ansatz for the generators. \spad{sjb} contains jet variables for which the individual equations can be solved.
273657`\spad{detSysNS(sys,{} vf)} computes the determining system for symmetry generators without assuming solvability of the equations for some derivatives.
273798`\spad{detSysNS(sys,{} vf)} computes the determining system for symmetry generators without assuming solvability of the equations for some derivatives.
273960`\spad{det_via_common_denominator(m)} computes determinant of \spad{m}.
274081`\spad{diag(f)} is the function \spad{g} \indented{1}{such that \spad{g a = f(a,{} a)}.}
274344`\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.
274407`\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.
274485`\spad{diagonal(m)} returns a row consisting of the elements on the diagonal of the matrix \spad{m}.
274554`\spad{diagonal?(p,{} l)} is the matrix \spad{l} diagonal?
274644`\spad{diagonal(p,{} l)} returns the entries along the diagonal in a list.
274865`\spad{diagonalMatrix} returns the main diagonal out of a matrix. The diagonal is put into a matrix of same shape as the original one.
274953`\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 precisely: if \spad{\spad{ri} := nrows \spad{mi}},{} \spad{\spad{ci} := ncols \spad{mi}},{} then \spad{m} is an (\spad{r1+}..\spad{+rk}) by (\spad{c1+}..\spad{+ck}) - matrix with entries \spad{m.i.j = ml.(i-r1-..-r(l-1)).(j-n1-..-n(l-1))},{} if \spad{(r1+..+r(l-1)) < i <= r1+..+rl} and \spad{(c1+..+c(l-1)) < i <= c1+..+cl},{} \spad{m.i.j} = 0 otherwise.
275021`\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \spad{l} on the diagonal.
275089`\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \spad{l} on the diagonal.
275168`\spad{diagonalMatrix(v)} returns a diagonal matrix where the elements of \spad{v} appear on the diagonal.
275222`\spad{diagonalMatrix} returns a diagonal out of a matrix. The diagonal is put into a matrix of same shape as the original one. Positive integer arguments select upper off-diagonals,{} negative ones lower off-diagonals.
275318`\spad{diagonalProduct(m)} returns the product of the elements on the diagonal of the matrix \spad{m}
275462`\spad{diagonalProduct(m)} returns the product of the elements on the diagonal of the matrix \spad{m}.
275536`\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".
275667`\spad{diagramHeight(s)} returns the height of the diagram that will be generated by diagramSvg. This is the maximum posY of all vertices in graph \spad{s}
275804`creates \spad{SVG} diagram containing multiple graphs fileName: String is the name of the \spad{SVG} file that will be created \spad{ln:} List \% is list of graphs that will be written dispArrowName: Boolean is \spad{true} to include the name of each arrow
275876`diagramSvg(fileName,{} \spad{n},{} dispArrowName) creates an \spad{SVG} diagram. This is an alternative version which does not shorten lines. fileName: String is the name of the \spad{SVG} file that will be created \spad{n:} \% is the graph that will be written dispArrowName: Boolean is \spad{true} to include the name of each arrow
276009`\spad{diagramSvg(fileName,{} n,{} dispArrowName)} creates an \spad{SVG} diagram fileName: String is the name of the \spad{SVG} file that will be created \spad{n:} \% is the graph that will be written dispArrowName: Boolean is \spad{true} to include the name of each arrow
276138`\spad{diagramWidth(s)} returns the width of the diagram that will be generated by diagramSvg. This is the maximum posX of all vertices in graph \spad{s}
276300`\spad{dictionary()}\$\spad{D} creates an empty dictionary of type \spad{D}.
276465`\spad{dictionary([x,{} y,{} ...,{} z])} creates a dictionary consisting of entries \spad{x,{} y,{} ...,{} z}.
276527`\spad{diff(jb)} returns the base vector field in direction \spad{jb}.
276575`\spad{diff(x)} returns the derivation with respect to \spad{x}.
276631`\spad{DiffAction(k,{} l,{} g)} gives the coefficient of \spad{x^k} in \spad{z^l} \spad{g}(\spad{x}),{} where \spad{z*}(a+b*x+c*x^2+d*x^3+...) = (a*x+b*x^2+c*x^3+...),{} \spadignore{i.e.} multiplication with \spad{x}.
276731`\spad{DiffC} gives the coefficients \spad{c_}{\spad{k},{} \spad{k}} in the expansion <x^k> \spad{z} \spad{g}(\spad{x}) = sum_{\spad{i=0}}\spad{^k} \spad{c_}{\spad{k},{} \spad{i}} <x^i> \spad{g}(\spad{x}),{} where \spad{z} acts on \spad{g}(\spad{x}) by shifting. In fact,{} the result is [0,{} 0,{} 0,{} ...]
277015`\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,{} \spad{difference(u,{} v)} returns a copy of \spad{u}. Note: equivalent to the notation (not currently supported) \spad{[x for x in u | not member?(x,{} v)]}.
277065`\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: \spad{difference(s,{} x) = difference(s,{} set [x])}.
277115`\spad{directions(om)} yields the differentials where \spad{om} has non-vanishing coefficients.
277266`\spad{differentialVariables(p)} returns a list of differential indeterminates occurring in a differential polynomial \spad{p}.
278194`\spad{differentiate(x)} returns the derivative of \spad{x}. This function is a simple differential operator where no variable needs to be specified.
278246`\spad{differentiate(v)} returns the derivative of \spad{v}.
278313`\spad{differentiate(f)} returns the derivative of \spad{f}.
279369`\spad{differentiate(ir,{} D)} differentiates \spad{ir} with respect to the derivation \spad{D}.
279432`\spad{differentiate(f,{} jv)} differentiates the function \spad{f} \spad{wrt} the jet variable \spad{jv}.
279500`\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'''},{} \spad{"f} super \spad{iv}".
279565`\spad{differentiate(jv,{} i)} differentiates \spad{jv} \spad{wrt} the \spad{i}\spad{-}th independent variable.
282647`\spad{differentiate(ir,{} x)} differentiates \spad{ir} with respect to \spad{x}
282748`Polynomial differentiation.
282837`\spad{differentiate(f(x),{} x)} returns the derivative of \spad{f(x)} with respect to \spad{x}.
282930`\spad{differentiate(f(x),{} x)} returns the derivative of \spad{f(x)} with respect to \spad{x}.
283023`\spad{differentiate(f(x),{} x)} computes the derivative of \spad{f(x)} with respect to \spad{x}.
283115`\spad{differentiate(f(x),{} x)} returns the derivative of \spad{f(x)} with respect to \spad{x}.
283202`\spad{differentiate(f(x),{} x)} returns the derivative of \spad{f(x)} with respect to \spad{x}.
283289`\spad{differentiate(f(x),{} x)} computes the derivative of \spad{f(x)} with respect to \spad{x}.
283452`\spad{differentiate(x,{} [s1,{} ...sn])} computes successive partial derivatives,{} \spadignore{i.e.} \spad{differentiate(...differentiate(x,{} s1)...,{} sn)}.
283522`\spad{differentiate(x,{} n)} returns the \spad{n}-th derivative of \spad{x}.
283593`\spad{differentiate(v,{} n)} returns the \spad{n}-th derivative of \spad{v}.
283679`\spad{differentiate(f,{} n)} returns the \spad{n}-th derivative of \spad{f}.
283768`\spad{differentiate(x,{} deriv)} differentiates \spad{x} extending the derivation deriv on \spad{R}.
283835`\spad{differentiate(x,{} v)} computes the partial derivative of \spad{x} with respect to \spad{v}.
283899`\spad{differentiate(x,{} d)} extends the derivation \spad{d} from UP to \$ and applies it to \spad{x}.
283976`\spad{differentiate(f(x),{} x)} returns the derivative of \spad{f(x)} with respect to \spad{x}.
287677`Polynomial differentiation.
287785`\spad{differentiate(x,{} [s1,{} ...,{} sn],{} [n1,{} ...,{} nn])} computes multiple partial derivatives,{} \spadignore{i.e.}
287880`\spad{differentiate(p,{} d,{} x')} extends the \spad{R}-derivation \spad{d} to an extension \spad{D} in \spad{R[x]} where \spad{Dx} is given by \spad{x'},{} and returns \spad{Dp}.
287967`\spad{differentiate(x,{} deriv,{} n)} differentiate \spad{x} \spad{n} times using a derivation which extends \spad{deriv} on \spad{R}.
288053`\spad{differentiate(x,{} s,{} n)} computes multiple partial derivatives,{} \spadignore{i.e.} \spad{n}-th derivative of \spad{x} with respect to \spad{s}.
288136`\spad{diffextint(ext,{} csolve,{} [g1,{} ...,{} gn])} is like primextint and expextint but for differentialy transcendental extensions.
294716`\spad{diffHP options} returns a specification for Hermite-Pade approximation with the differential operator
300167`\spad{diffHP options} returns a specification for Hermite-Pade approximation with the \$\spad{q}\$-dilation operator
301201`\spad{diffP(i,{} mu)} returns the base vector field in direction \spad{P(i,{} mu)}.
301288`\spad{diffU(i)} returns the base vector field in direction \spad{U(i)}.
301350`\spad{diffX(i)} returns the base vector field in direction \spad{X(i)}.
301412`\spad{digamma(x)} returns the digamma function applied to \spad{x}.
301563`\spad{digamma(z)} is the logarithmic derivative of \spad{Gamma(x)}.
301640`\spad{digamma(x)} is the logarithmic derivative of \spad{Gamma(x)} (often written \spad{psi(x)} in the literature).
301766`\spad{digamma(z)} is the logarithmic derivative of \spad{Gamma(x)}.
301825`\spad{digit()} returns the class of all characters for which \spadfunFrom{digit?}{Character} is \spad{true}.
301866`\spad{digit?(c)} tests if \spad{c} is a digit character,{} \spadignore{i.e.} one of 0..9.
301910`\spad{digits()} returns ceiling\spad{'s} precision in decimal digits.
301975`\spad{digits()} returns ceiling\spad{'s} precision in decimal digits.
302036`\spad{digits(d)} set the \spadfunFrom{precision}{FloatingPointSystem} to \spad{d} digits.
302116`\spad{digits(d)} set the \spadfunFrom{precision}{FloatingPointSystem} to \spad{d} digits.
302217`\spad{digits(x)} returns a stream of \spad{p}-adic digits of \spad{x}.
302283`\spad{dihedral n} is the cycle index of the \indented{1}{dihedral group of degree \spad{n}.}
302372`\spad{dihedralGroup(n)} constructs the dihedral group of order 2n acting on integers 1,{} ...,{} \spad{N}.
302439`\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.
302535`\spad{dihedralGroup(n)} constructs the dihedral group of order 2n acting on integers 1,{} ...,{} \spad{N}.
302633`\spad{dilate(a,{} x)} returns the sequence \$a^n \spad{x_n}\$ (starting at \$\spad{n=1}\$)
302683`\spad{dilog(f)} denotes the dilogarithm
302735`\spad{dilog(x)} returns the dilogarithm of \spad{x},{} \spadignore{i.e.} the integral of \spad{log(x) / (1 - x) dx}.
302790`\spad{dilog(z)} is the dilogarithm
302865`\spad{dim(c)} sets the shade of a hue,{} \spad{c},{} above dark,{} but below bright.
302902`\spad{dimension()} is the rank of this Lie algebra
302977`\spad{dimension(c)} returns dimension of \spad{c}
303040`\spad{dimension(f)} returns the dimension of the ALS.
303115`\spad{dimension(p)} returns the number of dimensions that make up the point category \spad{p}.
303175`\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}
303250`\spad{dimension(s)} returns the dimension of the point category \spad{s}.
303312`\spad{dimension(de,{} q)} computes the dimension of the differential equation \spad{de} as a submanifold of the \spad{q}\spad{-}th order jet bundle. The result is correct only,{} if \spad{de} is simplified.
303409`\spad{dimension(I,{} lvar)} gives the dimension of the ideal \spad{I},{} in the ring \spad{F[lvar]}
303497`\spad{dimension(sys,{} jm,{} q)} computes the dimension of the manifold described by the system \spad{sys} with Jacobi matrix \spad{jm} in the jet bundle of order \spad{q}.
303753`\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.
303860`\spad{dimensions(v,{} x,{} y,{} width,{} height)} sets the position of the upper left-hand corner of the two-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{TwoDimensionalViewport},{} to the window coordinate \spad{x},{} \spad{y},{} and sets the dimensions of the window to that of \spad{width},{} \spad{height}. The new dimensions are not displayed until the function \spadfun{makeViewport2D} is executed again for \spad{v}.
303988`\spad{dimensions(v,{} x,{} y,{} width,{} height)} sets the position of the upper left-hand corner of the three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport},{} to the window coordinate \spad{x},{} \spad{y},{} and sets the dimensions of the window to that of \spad{width},{} \spad{height}. The new dimensions are not displayed until the function \spadfun{makeViewport3D} is executed again for \spad{v}.
304118`\spad{dimensionsOf(t)} returns the dimensions of \spad{t}
304188`\spad{dimJ(q)} computes the (fibre) dimension of the \spad{q}\spad{-}th order jet bundle.
304266`\spad{dimJ(q)} computes the (fibre) dimension of the \spad{q}\spad{-}th order jet bundle.
304348`\spad{dimS(q)} computes dimension of \spad{SqT} \spad{x} VE (= number of derivatives of order \spad{q}).
304426`\spad{dimS(q)} computes dimension of \spad{SqT} \spad{x} VE (= number of derivatives of order \spad{q}).
304508`\spad{diophantineSystem(A,{} B)} returns a particular integer solution and an integer basis of the equation \spad{A X = B}.
304633`\spad{dioSolve(u)} computes a basis of all minimal solutions for linear homogeneous Diophantine equation \spad{u},{} then all minimal solutions of inhomogeneous equation
304838`\spad{diracDelta(x)} is unit mass at zeros of \spad{x}.
304901`\spad{diracDelta(x)} is unit mass at zeros of \spad{x}.
304957`\spad{directedGraph(poset)} constructs graph from a partially ordered set. This will be a graph with,{} at most,{} one arrow between any two nodes.
305022`\spad{directedGraph(perms)} constructs graph from a list of permutations: \spad{perms}.
305093`\spad{directedGraph(ob)} is a constructor for graph with given objects \spad{ob},{} more objects and arrows can be added later if required.
305213`\spad{directedGraph(ob)} is a constructor for graph with given list of object names and no arrows. Use this version of the constructor if you don\spad{'t} want to create specific \spad{x},{} \spad{y} coordinates. more objects and arrows can be added later if required.
305271`\spad{directedGraph(ob,{} ar)} constructs graph with objects \spad{ob} and arrows ar,{} more objects and arrows can be added later if required.
305555`\spad{directedGraph(ob,{} am)} constructs graph with objects \spad{ob} and adjacency matrix am.
305644`\spad{directedGraph(obs,{} ars)} constructs graph with objects \spad{obs} and arrows ars. This constructor just has pure abstract graph information without decoration information.
305766`\spad{direction(s)} \undocumented
305824`\spad{directions(v)} yields the directions of the base vectors where \spad{v} has non-vanishing coefficients.
305884`\spad{directory(f)} returns the directory part of the file name.
305937`\spad{directProduct(v)} converts the vector \spad{v} to a direct product. Error: if the length of \spad{v} is different from dim.
306009`\spad{directProduct of} two groups
306064`\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}.
306155`\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.
306239`\spad{disableAlternativeOutput(f)} disable output as rational expression.
306312`\spad{disableDebugOutput(f)} disable displaying the ALS.
306448`\spad{discreteLog(a)} computes the discrete logarithm of \spad{a} with respect to \spad{primitiveElement()} of the field.
306605`\spad{discreteLog(b,{} a)} computes \spad{s} with \spad{b^s = a} if such an \spad{s} exists.
306700`\spad{discriminant()} returns the discriminant of the integral closure of \spad{Z} in the quotient field of the framed algebra \spad{F}.
306820`\spad{discriminant()} = determinant(traceMatrix()).
306876`\spad{discriminant()} = determinant(traceMatrix()).
306929`\spad{discriminant(P)} returns the discriminant of \spad{P}.
307181`\spad{discriminant(p)} returns the discriminant of the polynomial \spad{p}.
307269`\spad{discriminant([v1,{} ..,{} vn])} returns \spad{determinant(traceMatrix([v1,{} ..,{} vn]))}.
307405`\spad{discriminant(p,{} v)} returns the disriminant of the polynomial \spad{p} with respect to the variable \spad{v}.
307499`\spad{discriminantEuclidean(P)} carries out the equality \spad{coef1 * P + coef2 * D(P) = discriminant(P)}.
307781`more detailed output with generators
307835`\spad{display(sys)} prints the Hankel matrix in an extended form with row-indices as column 0 and column-indices as row 0.
307984`\spad{display(o)} prints the string returned by coerce.
308032`prints the string returned by coerce,{} adding <math ...> tags.
308082`prints the string returned by coerce,{} adding <math ...> tags.
308133`\spad{display(t)} outputs the formatted code
308189`\spad{display(de)} prints all information stored about the differential equation \spad{de}. This comprises the system ordered by the order of the equations,{} the Jacobi matrices separately for each order and the index of the independent variable with respect to which the equation was lastly differentiated (1 for not prolonged equations).
308251`\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 \spadsys{)set output length}.
308293`\spad{display(op)} returns the "\%display" property of \spad{op} if it has one attached,{} and "failed" otherwise.
308381`\spad{display(db)} prints a summary line for each entry in \spad{db}.
308425`\spad{display(ic)} prints a summary of the information contained in \spad{ic}.
308467`\spad{display(t,{} width)} outputs the TeX formatted code \spad{t} so that each line has length less than or equal to \spad{width}.
308517`\spad{display(f,{}[s])} prints the element \spad{f} as A*(\spad{s_1},{}\spad{s_2},{}...,{}\spad{s_n})' = \spad{v}.
308595`\spad{display(f,{}sol)} prints the element \spad{f} as A*sol = \spad{v}.
308671`\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)}.
308745`\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.
308813`\spad{displayKind(d)} specifies kind of the result: generating function,{} recurrence or equation. This option should not be set by the user,{} but rather by the \spad{HP}-specification.
308889`\spad{displayKind(d)} specifies kind of the result: generating function,{} recurrence or equation. This option should not be set by the user,{} but rather by the \spad{HP}-specification.
308939`\spad{displayLines(l)}
309004`\spad{dispStatement(of)}
309185`\spad{distance(p1,{} p2)} returns the distance between the points \spad{p1} is the first point. \spad{p2} is the second point. There are 2 metrics associated with any SPointCategory the underlying space and the space that it is embedded in this is the distance in the underlying space.
309298`\spad{distance(u,{} v)} returns the path length (an integer) from node \spad{u} to \spad{v}.
309526`\spad{distance(s,{} a,{} b)} gives the shortest distance between nodes 'a' and \spad{'b'} as a number of hops. 0 if 'a' = \spad{'b'},{} \spad{-1} if it is not possible to go from 'a' to \spad{'b'}
309678`\spad{distanceMatrix(s)} gives matrix of distances between vertices. Element a_{\spad{i},{} \spad{j}} is the distance from \spad{i} to \spad{j}. Distance matrices are related to adjacency matrices,{} with the differences that: a. the latter only provides the information which vertices are connected \indented{3}{but does not tell about costs or distances between the vertices} \spad{b}. adjacency matrix only tells us about directly connected \indented{3}{vertices while distance matrix also considers indirect connections.}
309743`\spad{distanceSquared(p1,{} p2)} returns the distance between the points \spad{p1} and \spad{p2}. There are 2 metrics associated with any SPointCategory the underlying space and the space that it is embedded in this is the distance in the underlying space.
309807`the shortest distance between 'a' and \spad{'b'} in terms of weight.
309920`\spad{distFact(contm,{} unilist,{} plead,{} vl,{} lvar,{} lval)},{} where \spad{contm} is the content of the evaluated polynomial,{} \spad{unilist} is the list of factors of the evaluated polynomial,{} \spad{plead} is the complete factorization of the leading coefficient,{} \spad{vl} is the list of factors of the leading coefficient evaluated,{} \spad{lvar} is the list of variables,{} lval is the list of values,{} returns a record giving the list of leading coefficients to impose on the univariate factors,{}
310205`\spad{distinct_partition(n)} returns the number of partitions of the integer \spad{n} with distinct members. This is the number of ways that \spad{n} can be written as a sum of distinct positive integers. For \spad{n > 0} this is the same as number of ways that \spad{n} can be written as a sum of odd positive integers.
310277`\spad{distinct_partitions(n)} is the stream of all partitions \indented{1}{of \spad{n} into distinct numbers.}
310370`\spad{distinct_partitions(p,{} l,{} n)} is the stream of partitions \indented{1}{of \spad{n} into distinct numbers whose number of parts is no greater than \spad{p}} \indented{1}{and whose largest part is no greater than \spad{l}.}
310529`\spad{distribute(f)} expands all the kernels in \spad{f} that are formally enclosed by a \spadfunFrom{box}{ExpressionSpace} or \spadfunFrom{paren}{ExpressionSpace} expression.
310633`\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.
310687`\spad{distributionByBooleanCumulants(bb)} initiates a distribution with given Boolean cumulants \spad{bb}.
310765`\spad{distributionByBooleanCumulants(bb)} initiates a distribution with given Boolean cumulants \spad{bb}.
310841`\spad{distributionByEvenMoments(kk)} initiates a distribution with given classical cumulants \spad{kk}.
310921`\spad{distributionByEvenMoments(kk)} initiates a distribution with given classical cumulants \spad{kk}.
310999`\spad{distributionByEvenMoments(mm)} initiates a distribution with given even moments \spad{mm} and odd moments zero.
311072`\spad{distributionByEvenMoments(mm)} initiates a distribution with given even moments \spad{mm} and odd moments zero.
311143`\spad{distributionByFreeCumulants(cc)} initiates a distribution with given free cumulants \spad{cc}.
311218`\spad{distributionByFreeCumulants(cc)} initiates a distribution with given free cumulants \spad{cc}.
311291`\spad{distributionByJacobiParameters(aa,{} bb)} initiates a distribution with given Jacobi parameters \spad{[aa,{} bb]}.
311381`\spad{distributionByJacobiParameters(aa,{} bb)} initiates a distribution with given Jacobi parameters \spad{[aa,{} bb]}.
311467`\spad{distributionByMoments(mm)} initiates a distribution with given moments \spad{mm}.
311536`\spad{distributionByMoments(mm)} initiates a distribution with given moments \spad{mm}.
311603`\spad{distributionByMonotoneCumulants(hh)} initiates a distribution with given monotone cumulants \spad{hh}.
311715`\spad{distributionByMonotoneCumulants(hh)} initiates a distribution with given monotone cumulants \spad{hh}.
311825`\spad{distributionBySTransform(series)} initiates a distribution with given \spad{S}-transform \spad{series}.
311995`\spad{distributionBySTransform(x)} returns the distribution with \spad{S}-transform \spad{x}.
312094`\spad{distributionBySTransform(series)} initiates a distribution with given \spad{S}-transform \spad{series}.
312235`\spad{divergence(vf,{} xlist)} computes the divergence of the vector field \spad{vf},{} \spad{vf} a vector function of the variables listed in xlist.
312321`\spad{divide(F,{} G)} computes quotient and rest of the exact euclidean division of \spad{F} by \spad{G}.
312653`\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}.
312729`\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}.
312804`\spad{divide(a,{} b)} returns a record containing both remainder and quotient.
312882`\spad{divide!(pol1,{} pol2,{} md)} performs division with remainder of \spad{pol1} by \spad{pol2}. \spad{pol1} is modified in place to contain remainder. Quotient is return value.
312965`Polynomial division.
313063`\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}.
313167`\spad{divideIfCan(f,{} g)} returns quotient and remainder of the division of \spad{f} by \spad{g} or "failed" if it has not succeeded.
313293`\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.
313544`\spad{divisor(I)} makes a divisor \spad{D} from an ideal \spad{I}.
313646`\spad{divisor(g)} returns the divisor of the function \spad{g}.
313774`\spad{divisor(a,{} b)} makes the divisor \spad{P:} \spad{(x = a,{} y = b)}. Error: if \spad{P} is singular.
313980`\spad{divisor(a,{} b,{} n)} makes the divisor \spad{nP} where \spad{P:} \spad{(x = a,{} y = b)}. \spad{P} is allowed to be singular if \spad{n} is a multiple of the rank.
314054`\spad{divisor(h,{} d,{} g)} returns \spad{gcd} of divisor of zeros of \spad{h} and divisor of zeros of \spad{d}. \spad{d} must be squarefree. All ramified zeros of \spad{d} must be contained in zeros of \spad{g}.
314197`\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}
314272`\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.
314381`\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 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},{} then information messages are issued.
314498`\spad{divisors(n)} returns a list of the divisors of \spad{n}.
314575`\spad{dmp2rfi(p)} converts \spad{p} to target domain
314669`\spad{dmp2rfi(l)} converts \spad{l} to target domain
314775`\spad{dmp2rfi(m)} converts \spad{m} to target domain
314885`\spad{dmpToHdmp(p)} converts \spad{p} from a \spadtype{DMP} to a \spadtype{HDMP}.
315018`\spad{dmpToP(p)} converts \spad{p} from a \spadtype{DMP} to a \spadtype{POLY}.
315111`\spad{doFactor(p,{} n,{} ext?)} returns the factorisation of polynomial \spad{p},{} \spad{p} is assumed to be primitive and squarefree,{} \spad{n} is degree in auxiliary variable,{} ext? if \spad{false} inhibits use of extension field.
315295`\spad{do_liou(op,{} lf)} should be local but conditional.
315402`\spad{dom(a)} returns a \spadgloss{LISP} form of the type of the original object that was converted to \spadtype{Any}.
315441`\spad{domainOf(a)} returns a printable form of the type of the original object that was converted to \spadtype{Any}.
315484`\spad{dominantTerm(f(var))} returns the term that dominates the limiting behavior of \spad{f(var)} as \spad{var -> cen+} together with a \spadtype{String} which briefly describes that behavior. The value of the \spadtype{String} will be \spad{"zero"} (resp. \spad{"infinity"}) if the term tends to zero (resp. infinity) exponentially and will \spad{"series"} if the term is a Puiseux series.
316021`\spad{do_param_RDE(f,{} h,{} lg,{} x,{} lk)} solves parametric Risch differential equation,{} that is returns \spad{[y,{} [c1,{} ...,{} ck]]} such that dy/dx + \spad{n} df/dx \spad{y} + \spad{c1} \spad{g1} + ... \spad{cn} \spad{gn} = \spad{h} where \spad{y} is in the is in field generated by \spad{lk} and \spad{ci} are constants or "failed" if there is no solution.
316682`\spad{do_risch_DE(f,{} g,{} x,{} lk)} returns \spad{[y,{} h,{} 0,{} b]} such that \spad{dy/dx + df/dx y = h} and \spad{b := h = g}. The equation \spad{dy/dx + df/dx y = g} has no solution in the field generated by \spad{lk} if \spad{h \~~= g} (\spad{y} is a partial solution in that case).
316809`\spad{dot(f)} creates the form with one dot overhead.
316845`\spad{dot(f,{} n)} creates the form \spad{f} with \spad{n} dots overhead.
316900`\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}.
317028`\spad{dot(x,{} y)} computes the inner product of the vectors \spad{x} and \spad{y}.
317124`\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.
317209`\spad{double?(t)} tests whether \spad{t} is equivalent to the FORTRAN type DOUBLE PRECISION
317262`\spad{double(i,{} r)} multiplies \spad{r} by \spad{i} using repeated doubling.
317326`\spad{doubleComplex?(t)} tests whether \spad{t} is equivalent to the (non-standard) FORTRAN type DOUBLE COMPLEX.
317386`\spad{doubleDisc(u)} \undocumented
317461`change the output format for doublefloats using lisp format strings
317522`\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.
317591`\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.
317674`\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}.
317734`\spad{do_with_error_env1(f)}
317817`\spad{do_with_error_env2(int_to_floats?,{} f)}
317908`\spad{do_with_error_env3(int_to_floats?,{} f)}
317999`\spad{dP(i,{} mu)} returns the differential of \spad{P(i,{} mu)}.
318084`\spad{draw(lp)} plots the curve constructed from the list of points \spad{lp}.
318185`\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)}.
318314`\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)}.
318452`\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.
318548`\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}.
318660`\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.
318778`\spad{draw(c,{} b)} is like version for plane curves,{} but uses complex curve.
318898`\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)}.
319049`\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.
319167`\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)}.
319320`\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.
319440`\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)}.
319598`\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.
319763`\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.
319909`\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.
320064`\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.
320177`\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.
320297`\spad{draw(lx,{} ly,{} lz)} draws the surface constructed by projecting the values in the \spad{lz} list onto the rectangular grid formed by the \spad{lx X ly}.
320429`\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.
320558`\spad{draw(c,{} b,{} l)} is like version for plane curves,{} but uses complex curve.
320695`\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.
320863`\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.
320998`\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.
321168`\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.
321305`\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)}.
321482`\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.
321621`\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.
321796`\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.
321978`\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.
322113`\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.
322250`\spad{draw(lx,{} ly,{} lz,{} l)} draws the surface constructed by projecting the values in the \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.
322399`\spad{draw(surface(f,{} g,{} h),{} a..b,{} c..d)} draws the graph of the parametric surface \spad{x = f(u,{} v)},{} \spad{y = g(u,{} v)},{} \spad{z = h(u,{} v)} as \spad{u} ranges from \spad{min(a,{} b)} to \spad{max(a,{} b)} and \spad{v} ranges from \spad{min(c,{} d)} to \spad{max(c,{} d)}; The options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
322593`\spad{draw(surface(f(u,{} v),{} g(u,{} v),{} h(u,{} v)),{} u = a..b,{} v = c..d,{} l)} draws the graph of the parametric surface \spad{x = f(u,{} v)},{} \spad{y = g(u,{} v)},{} \spad{z = h(u,{} v)} as \spad{u} ranges from \spad{min(a,{} b)} to \spad{max(a,{} b)} and \spad{v} ranges from \spad{min(c,{} d)} to \spad{max(c,{} d)}; \spad{h(t)} is the default title,{} and the options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
322749`\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{drawComplex(f,{} 0.3..3,{} 0..2*\%\spad{pi},{} false)}} Parameter descriptions: \indented{2}{\spad{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}{arrows? : a flag indicating whether to draw the phase arrows for \spad{f}} Call the functions \spadfunFrom{setRealSteps}{DrawComplex} and \spadfunFrom{setImagSteps}{DrawComplex} to change the number of steps used in each direction.
322910`\spad{drawComplexVectorField(f,{} rRange,{} iRange)} draws a complex vector field using arrows on the \spad{x--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,{} -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}{iRange : the range of the imaginary values} Call the functions \spadfunFrom{setRealSteps}{DrawComplex} and \spadfunFrom{setImagSteps}{DrawComplex} to change the number of steps used in each direction.
323074`\spad{drawCurves([[p0],{} [p1],{} ...,{} [pn]],{} [options])} creates a \spadtype{TwoDimensionalViewport} from the list of lists of points,{} \spad{p0} through \spad{pn},{} using the options specified in the list \spad{options}.
323189`\spad{drawCurves([[p0],{} [p1],{} ...,{} [pn]],{} ptColor,{} lineColor,{} ptSize,{} [options])} creates a \spadtype{TwoDimensionalViewport} from the list of lists of points,{} \spad{p0} through \spad{pn},{} using the options specified in the list \spad{options}. The point color is specified by \spad{ptColor},{} the line color is specified by \spad{lineColor},{} and the point size is specified by \spad{ptSize}.
323336`\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"}.
323402`\spad{drawToScale()} determines whether or not plots are to be drawn to scale.
323457`\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}.
323519`\spad{droot(l)} should be a non-exported function.
323584`\spad{dSubst(f,{} jv,{} exp)} is like \spad{subst(f,{} jv,{} exp)}. But additionally for all derivatives of \spad{jv} the corresponding substitutions are performed.
323708`\spad{dU(i)} returns the differential of \spad{U(i)}.
323768`generate a minimal dunceHat from 3 edges.
323836`Generate a minimal triangulation of dunce hat.
323920`\spad{duplicates?(d)} tests if dictionary \spad{d} has duplicate entries.
323982`\spad{duplicates(d)} returns a list of values which have duplicates in \spad{d}
324078`\spad{dX(i)} returns the differential of \spad{X(i)}.
324138`\spad{e(n)} produces phi(e_i) where e_i is \spad{i}-th basis vector in \spad{K^n} and phi is canonical embedding of \spad{K^n} into Clifford algebra.
324201`to allow entries like: ee[1,{} 2]
324271`\spad{eFromBinaryMap(n)} sets the appropriate Grassmann basis,{} for example: eFromBinaryMap(0) = 1 (scalar) eFromBinaryMap(1) = \spad{e1} eFromBinaryMap(2) = \spad{e2} eFromBinaryMap(3) = e1/\e2
324350`\spad{\spad{Ei}(f)} denotes the exponential integral
324399`\spad{\spad{Ei}(x)} returns the exponential integral of \spad{x},{} \spadignore{i.e.} the integral of \spad{exp(x)/x dx}.
324451`\spad{\spad{Ei}(f)} denotes the exponential integral
324594`\spad{\spad{Ei}(f)} denotes the exponential integral
324651`\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.
324782`\spad{eigenvalues(m)} returns the eigenvalues of the matrix \spad{m}.
324925`\spad{eigenvalues(m)} returns the eigenvalues of the matrix \spad{m}.
325108`\spad{eigenvalues(m,{} fac)} returns the eigenvalues of the matrix \spad{m}. Eigenvalues in base field are given explicitly,{} other are represented by minimal polynomial. fac is a factorizer for polynomials over \spad{F}.
325286`\spad{eigenvector(eigval,{} m)} returns the eigenvectors belonging to the eigenvalue \spad{eigval} for the matrix \spad{m}.
325429`\spad{eigenvector(eigval,{} m)} returns the eigenvectors belonging to the eigenvalue \spad{eigval} for the matrix \spad{m}.
325606`\spad{eigenvectors(m)} returns the eigenvalues and eigenvectors for the matrix \spad{m}. The eigenvalues in base field and corresponding eigenvectors are explicitly computed,{} while the non rational ones are given via their minimal polynomial and the corresponding eigenvectors are expressed in terms of a "generic" root of such a polynomial.
325843`\spad{eigenvectors(m)} returns the eigenvalues and eigenvectors for the matrix \spad{m}. The eigenvalues in base field and the corresponding eigenvectors are explicitly computed,{} while the other ones are given via their minimal polynomial and the corresponding eigenvectors are expressed in terms of a "generic" root of such a polynomial.
326114`\spad{eigenvectors(m,{} fac)} returns the eigenvalues and eigenvectors for the matrix \spad{m}. The eigenvalues in base field and corresponding eigenvectors are explicitly computed,{} while the other eigenvalues are given via their minimal polynomial and the corresponding eigenvectors are expressed in terms of a "generic" root of such a polynomial. fac is a factorizer for polynomials over \spad{F}.
326386`\spad{ei_int(n,{} f,{} g,{} x)} returns \spad{[h,{} u,{} t,{} s]} such that \spad{u*exp(n*f) = (h*exp(n*f))' + t'} where \spad{t} involves special functions. When \spad{s} is \spad{true} then \spad{g = u},{} otherwise ei_int returns partial answer,{}
326499`\spad{eisensteinIrreducible?(p)} returns \spad{true} if \spad{p} can be shown to be irreducible by Eisenstein\spad{'s} criterion,{} \spad{false} is inconclusive.
326576`\spad{elColumn2!(m,{} a,{} i,{} j)} adds to column \spad{i} a*column(\spad{m},{} \spad{j}) : elementary operation of second kind. (\spad{i} \spad{~=j})
326668`\spad{elem?(ir)} tests if an integration result is elementary over \spad{F?}
326722`\spad{element?(f,{} I)} tests whether the polynomial \spad{f} belongs to the ideal \spad{I}.
326802`\spad{element} returns a single element out of a matrix. The element is put into a one by one matrix.
326879`\spad{elementary n} is the \spad{n} th elementary symmetric \indented{1}{function expressed in terms of power sums.}
326970`\spad{elements(S)} returns the list of the elements of \spad{S} in increasing order.
327048`\spad{eliminationEquations(p,{} row_P,{} col_P,{} row_Q,{} col_Q,{} rdst,{} cdst,{} rex1,{} cex1,{} rex2,{} cex2)} returns a list of matrices with equations to eliminate the entries in rows/columns rdst/cdst,{} \spad{rex1/cex1} and \spad{rex2/cex2}.
327413`\spad{eliminationEquations(p,{} row_P,{} col_P,{} row_Q,{} col_Q,{} rdst,{} cdst,{} rex1,{} cex1,{} rex2,{} cex2)} returns a list of equations with equations to eliminate the entries in rows/columns rdst/cdst,{} \spad{rex1/cex1} and \spad{rex2/cex2},{} including det(\spad{P})\spad{-1} and det(\spad{Q})\spad{-1}.
327770`\spad{eliminationEquations(p,{} row_P,{} col_P,{} row_Q,{} col_Q,{} rdst,{} cdst)} returns a list of matrices with equations to eliminate the entries in rows/columns rdst/cdst.
328034`\spad{eliminationGroebner(p,{} row_P,{} col_P,{} row_Q,{} col_Q,{} rdst,{} cdst,{} rex1,{} cex1,{} rex2,{} cex2)} computes a Groebner--Shirshov basis for the ideal generated by the equations from eliminationEquations(...) using the domain DistributedMultivariatePolynomial.
328390`\spad{eliminationSolve(lst_eqn)} calls eliminationSolve(\spad{lst_eqn},{} [0,{}1],{} []).
328526`\spad{eliminationSolve(eqn,{} lst_val)} computes all solutions of equation \spad{eqn} by trying the values of lst_val for undetermined variables.
328664`\spad{eliminationSolve(lst_eqn,{} lst_val,{} lst_sub)} computes all solutions of the first equation of \spad{lst_eqn} by trying the values of \spad{lst_val} for undetermined variables with respect to given subsolutions lst_sub and return those which fulfill all other equations in \spad{lst_eqn}.
328844`\spad{eliminationSolve(eqn,{} lst_val,{} sub)} computes all solutions of equation \spad{eqn} by trying the values of \spad{lst_val} for undetermined variables with respect to given subsolution sub.
329012`\spad{eliminationSolve(eqn,{} lst_val,{} lst_sub)} computes all solutions of equation \spad{eqn} by trying the values of \spad{lst_val} for undetermined variables with respect to given subsolutions lst_sub.
329186`\spad{eliminationTransformations(p,{} row_P,{} col_P,{} row_Q,{} col_Q)} returns a pair of transformation matrices with commutative variables 'a[\spad{i}] in rows/columns row_P/col_P respectively \spad{'b}[\spad{i}] in rows/columns row_Q/col_Q.
329406`\spad{eliminationTransformations(p,{} row_P,{} col_P,{} row_Q,{} col_Q,{} sol)} Uses eval to set the values in sol into the variables in the transformation matrices.
329644`\spad{eliminationTransformations(p,{} row_P,{} col_P,{} sym_P,{} row_Q,{} col_Q,{} sym_Q)} returns a pair of transformation matrices with commutative variables \spad{sym_P}[\spad{i}] in rows/columns row_P/col_P respectively sym_Q[\spad{i}] in rows/columns row_Q/col_Q.
329878`\spad{elimZeroCols!(A)} removes columns which contain only zeros. This affects basically only the value of \spad{allIndices(A)}.
329941`\spad{ellipseBoundary(c1,{} c2)} constructs an ellipse boundary \spad{n}-dimensional axis-aligned ellipoid with given parameters \spad{c1:} \spad{PT} holds centre point \spad{c2:} \spad{PT} holds extent (radius for each coordinate)
329996`\spad{elliptic()} returns \spad{p(x)} if the curve is the elliptic defined by \spad{y^2 = p(x)},{} "failed" otherwise.
330078`\spad{elliptic()} returns \spad{p(x)} if the curve is the elliptic defined by \spad{y^2 = p(x)},{} "failed" otherwise.
330157`\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)}.
330227`\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}.
330308`\spad{ellipticE(m)} is the complete elliptic integral of the second kind: \spad{ellipticE(m) = integrate(sqrt(1-m*t^2)/sqrt(1-t^2),{} t = 0..1)}.
330370`\spad{ellipticE(m)} is the complete elliptic integral of the second kind
330468`\spad{ellipticE(m)} is the complete elliptic integral of the second kind.
330548`\spad{ellipticE(m)} is the complete elliptic integral of the second kind: \spad{ellipticE(m) = integrate(sqrt(1-m*t^2)/sqrt(1-t^2),{} t = 0..1)}.
330603`\spad{ellipticE(m)} is the complete elliptic integral of the second kind
330683`\spad{ellipticE(m)} is the complete elliptic integral of the second kind.
330745`\spad{ellipticE(z,{} m)} is the incomplete elliptic integral of the second kind: \spad{ellipticE(z,{} m) = integrate(sqrt(1-m*t^2)/sqrt(1-t^2),{} t = 0..z)}.
330809`\spad{ellipticE(z,{} m)} expands the elliptic integral \spad{E} as a Taylor series in \spad{z}.
330935`\spad{ellipticE(z,{} m)} is the incomplete elliptic integral of the second kind.
331054`\spad{ellipticE(z,{} m)} is the incomplete elliptic integral of the second kind.
331149`\spad{ellipticE(z,{} m)} is the incomplete elliptic integral of the second kind: \spad{ellipticE(z,{} m) = integrate(sqrt(1-m*t^2)/sqrt(1-t^2),{} t = 0..z)}.
331206`\spad{ellipticE(z,{} m)} is the incomplete elliptic integral of the second kind.
331298`\spad{ellipticE(z,{} m)} is the incomplete elliptic integral of the second kind.
331366`\spad{ellipticF(z,{} m)} is the incomplete elliptic integral of the first kind : \spad{ellipticF(z,{} m) = integrate(1/sqrt((1-t^2)*(1-m*t^2)),{} t = 0..z)}.
331430`\spad{ellipticF(z,{} m)} expands the elliptic integral \spad{F} as a Taylor series in \spad{z}.
331556`\spad{ellipticF(z,{} m)} is the incomplete elliptic integral of the first kind.
331675`\spad{ellipticF(z,{} m)} is the incomplete elliptic integral of the first kind.
331770`\spad{ellipticF(z,{} m)} is the incomplete elliptic integral of the first kind : \spad{ellipticF(z,{} m) = integrate(1/sqrt((1-t^2)*(1-m*t^2)),{} t = 0..z)}.
331827`\spad{ellipticF(z,{} m)} is the incomplete elliptic integral of the first kind.
331919`\spad{ellipticF(z,{} m)} is the incomplete elliptic integral of the first kind.
331987`\spad{ellipticK(m)} is the complete elliptic integral of the first kind: \spad{ellipticK(m) = integrate(1/sqrt((1-t^2)*(1-m*t^2)),{} t = 0..1)}.
332049`\spad{ellipticK(z,{} m)} is the incomplete elliptic integral of the first kind.
332147`\spad{ellipticK(m)} is the complete elliptic integral of the first kind.
332227`\spad{ellipticK(m)} is the complete elliptic integral of the first kind: \spad{ellipticK(m) = integrate(1/sqrt((1-t^2)*(1-m*t^2)),{} t = 0..1)}.
332282`\spad{ellipticK(z,{} m)} is the complete elliptic integral of the first kind.
332362`\spad{ellipticK(m)} is the complete elliptic integral of the first kind.
332424`\spad{ellipticPi(z,{} n,{} m)} is the incomplete elliptic integral of the third kind: \spad{ellipticPi(z,{} n,{} m) = integrate(1/((1-n*t^2)*sqrt((1-t^2)*(1-m*t^2))),{} t = 0..z)}.
332491`\spad{ellipticPi(z,{} n,{} m)} expands the elliptic integral \spad{Pi} as a Taylor series in \spad{z}.
332623`\spad{ellipticPi(z,{} n,{} m)} is the incomplete elliptic integral of the third kind.
332764`\spad{ellipticPi(z,{} n,{} m)} is the incomplete elliptic integral of the third kind.
332875`\spad{ellipticPi(z,{} n,{} m)} is the incomplete elliptic integral of the third kind: \spad{ellipticPi(z,{} n,{} m) = integrate(1/((1-n*t^2)*sqrt((1-t^2)*(1-m*t^2))),{} t = 0..z)}.
332935`\spad{ellipticPi(z,{} n,{} m)} is the incomplete elliptic integral of the third kind.
333040`\spad{ellipticPi(z,{} n,{} m)} is the incomplete elliptic integral of the third kind.
333115`\spad{ellipticRC(x,{} y)} computes integral from 0 to infinity of \spad{(1/2)*(t+x)^(-1/2)*(t+y)^(-1)dt}.
333235`\spad{ellipticRC(x,{} y)} computes integral from 0 to infinity of \spad{(1/2)*(t+x)^(-1/2)*(t+y)^(-1)dt}.
333328`\spad{ellipticRD(x,{} y,{} z)} computes integral from 0 to infinity of \spad{(3/2)*(t+x)^(-1/2)*(t+y)^(-1/2)*(t+Z)^(-3/2)dt}.
333469`\spad{ellipticRD(x,{} y,{} z)} computes integral from 0 to infinity of \spad{(3/2)*(t+x)^(-1/2)*(t+y)^(-1/2)*(t+Z)^(-3/2)dt}.
333574`\spad{ellipticRF(x,{} y,{} z)} computes integral from 0 to infinity of \spad{(1/2)*(t+x)^(-1/2)*(t+y)^(-1/2)*(t+Z)^(-1/2)dt}.
333715`\spad{ellipticRF(x,{} y,{} z)} computes integral from 0 to infinity of \spad{(1/2)*(t+x)^(-1/2)*(t+y)^(-1/2)*(t+Z)^(-1/2)dt}.
333820`ellipticRF(\spad{x},{} \spad{y},{} \spad{z},{} \spad{p}) computes integral from 0 to infinity of \spad{(3/2)*(t+x)^(-1/2)*(t+y)^(-1/2)*(t+Z)^(-1/2)*(t+p)^(-1)dt}.
333982`\spad{ellipticRJ(x,{} y,{} z,{} p)} computes integral from 0 to infinity of \spad{(3/2)*(t+x)^(-1/2)*(t+y)^(-1/2)*(t+Z)^(-1/2)*(t+p)^(-1)dt}.
334099`\spad{elRow1!(m,{} i,{} j)} swaps rows \spad{i} and \spad{j} of matrix \spad{m} : elementary operation of first kind
334186`\spad{elRow2!(m,{} a,{} i,{} j)} adds to row \spad{i} a*row(\spad{m},{} \spad{j}) : elementary operation of second kind. (\spad{i} \spad{~=j})
334423`\spad{elt(op,{} x,{} y,{} z,{} t,{} s,{} r,{} q,{} p,{} o)} applies the 9-ary operator \spad{op} to \spad{x},{} \spad{y},{} \spad{z},{} \spad{t},{} \spad{s},{} \spad{r},{} \spad{q},{} \spad{p} and \spad{o}
334499`\spad{elt(n)} returns the object \spad{n}.
334537`\spad{elt(t)} gives the component of a rank 0 tensor.
336154`\spad{elt(op,{} [a1,{} ...,{} an])} returns \spad{op(a1,{} ...,{} an)}.
336604`\spad{elt(mm,{} n)} returns the \spad{n}th element of a sequence.
336657`\spad{elt(op,{} l)} creates a form for application of \spad{op} to list of arguments \spad{l}.
336701`\spad{elt(f,{} i)} returns \spad{v}(\spad{i}) from the ALS of \spad{f}.
336772`\spad{elt(x,{} r)} or \spad{x}.\spad{r} \undocumented
337375`\spad{elt(op,{} x)} or \spad{op}(\spad{x}) applies the unary operator \spad{op} to \spad{x}.
337434`\spad{elt(op,{} [x1,{} ...,{} xn])} or \spad{op}([\spad{x1},{} ...,{} \spad{xn}]) applies the \spad{n}-ary operator \spad{op} to \spad{x1},{} ...,{} \spad{xn}.
337499`\spad{l."count"} returns the number of elements in \spad{l}.
337561`\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,{} \spad{"smoo" "shed"} returns \spad{"smooshed"}.
337604`\spad{elt(u,{} i)} (also written: \spad{u}.\spad{i}) returns the element of \spad{u} indexed by \spad{i}. Error: if \spad{i} is not an index of \spad{u}.
337644`\spad{elt(qf,{} v)} evaluates the quadratic form \spad{qf} on the vector \spad{v},{} producing a scalar.
337707`\spad{elt(f(x),{} r)} returns the coefficient of the term of degree \spad{r} in \spad{f(x)}. This is the same as the function \spadfun{coefficient}.
337783`\spad{elt(u,{} "first")} (also written: \spad{u.first}) is equivalent to first(\spad{u}).
337843`\spad{elt(a,{} b)} evaluates the fraction of univariate polynomials \spad{a} with the distinguished variable replaced by \spad{b}.
337953`\spad{elt(a,{} r)} evaluates the fraction of univariate polynomials \spad{a} with the distinguished variable replaced by the constant \spad{r}.
338034`\spad{elt((a1,{} ...,{} an),{} i)} returns \spad{\spad{ai}}.
338104`\spad{elt(a,{} i)} returns the \spad{i}-th coefficient of \spad{a} with respect to the fixed \spad{R}-module basis.
338168`\spad{elt(t,{} i)} gives a component of a rank 1 tensor.
338230`\spad{elt(u,{} "last")} (also written: \spad{u.last}) is equivalent to last(\spad{u}).
338289`\spad{elt(a,{} "left")} (also written: \spad{a.left}) is equivalent to \spad{left(a)}.
338349`\spad{elt(s,{} [i1,{} ...,{} im])} recursively selects subexpression,{} that is elt(\spad{s},{} []) is just \spad{s} and elt(\spad{s},{} [\spad{i1},{} ...,{} im]) is the same as elt(elt(\spad{s},{} \spad{i1}),{} [\spad{i2},{} ...,{} im]).
338425`\spad{elt(t,{} [i1,{} ...,{} iN])} gives a component of a rank \spad{N} tensor.
338493`\spad{elt(s,{} [a1,{} ...,{} an])} or \spad{s}([\spad{a1},{} ...,{} an]) returns \spad{s} subscripted by \spad{[a1,{} ...,{} an]}.
338542`\spad{elt(gp,{} i)} returns the \spad{i}-th generator of the group {\em gp}.
338619`\spad{elt(db,{} q)} returns all elements of \spad{db} which satisfy \spad{q}.
338670`\spad{elt(\%,{} "rest")} (also written: \spad{u.rest}) is equivalent to \spad{rest u}.
338729`\spad{elt(a,{} "right")} (also written: \spad{a.right}) is equivalent to \spad{right(a)}.
338790`\spad{l.sort} returns \spad{l} with elements sorted. Note: \spad{l.sort = sort(l)}
338834`\spad{elt(p,{} el)} returns the image of {\em el} under the permutation \spad{p}.
338884`\spad{elt(lib,{} k)} or \spad{lib}.\spad{k} extracts the value corresponding to the key \spad{k} from the library \spad{lib}.
338926`\spad{elt(db,{} s)} returns the \spad{s} field of each element of \spad{db}.
338985`\spad{elt(ic,{} s)} selects a particular field from \spad{ic}. Valid fields are \spad{name,{} nargs,{} exposed,{} type,{} abbreviation,{} kind,{} origin,{} params,{} condition,{} doc}.
339032`\spad{l.unique} returns \spad{l} with duplicates removed. Note: \spad{l.unique = removeDuplicates(l)}.
339078`\spad{elt(u,{} "value")} (also written: \spad{u.value}) is equivalent to \spad{value(u)}.
339474`\spad{elt(A,{} i,{} c)} returns the entry of the matrix \spad{A} in row \spad{i} and in the column with index \spad{c}.
339534`\spad{elt(p,{} i,{} j)} returns the elements (\spad{i},{}\spad{j}) from the linear pencil \spad{p} as a list.
339637`\spad{elt(f,{} i,{} j)} returns A(\spad{i},{}\spad{j}) from the ALS of \spad{f}.
341129`\spad{elt(op,{} x,{} y)} or \spad{op}(\spad{x},{} \spad{y}) applies the binary operator \spad{op} to \spad{x} and \spad{y}.
341190`\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.
341248`\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.
341310`\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.
341375`\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.
341436`\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.
341518`\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
341598`\spad{elt(t,{} i,{} j)} gives a component of a rank 2 tensor.
341668`\spad{elt(x,{} row,{} colList)} returns an 1-by-\spad{n} array consisting of elements of \spad{x},{} where \spad{n = \# colList}. If \spad{colList = [j<1>,{} j<2>,{} ...,{} j<n>]},{} then the \spad{(k,{} l)}th entry of \spad{elt(x,{} row,{} colList)} is \spad{x(row,{} j<l>)}.
341754`\spad{elt(x,{} row,{} ls2)} is equivalent to \spad{elt(x,{} row,{} l2)} where \spad{l2} is obtained appending expansions of elements of \spad{ls2},{} but should be more convenient and more efficient.
341849`\spad{elt(x,{} rowList,{} col)} returns an \spad{m}-by-1 array consisting of elements of \spad{x},{} where \spad{m = \# rowList}. If \spad{rowList = [i<1>,{} i<2>,{} ...,{} i<m>]},{} then the \spad{(k,{} l)}th entry of \spad{elt(x,{} rowList,{} col)} is \spad{x(i<k>,{} col)}.
341935`\spad{elt(x,{} rowList,{} colList)} returns an \spad{m}-by-\spad{n} array 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>)}.
342027`\spad{elt(x,{} rowList,{} s)} is equivalent to \spad{elt(x,{} rowList,{} expand(s))} but should be more convenient and more efficient.
342122`\spad{elt(x,{} ls1,{} col)} is equivalent to \spad{elt(x,{} l1,{} col)} where \spad{l1} is obtained appending expansions of elements of \spad{ls1},{} but should be more convenient and more efficient.
342217`\spad{elt(x,{} ls1,{} ls2)} is equivalent to \spad{elt(x,{} l1,{} l2)} where \spad{li} is obtained appending expansions of elements of lsi,{} but should be more convenient and more efficient.
342327`\spad{elt(x,{} ls1,{} s2)} is equivalent to \spad{elt(x,{} l1,{} l2)} where \spad{li} is obtained appending expansions of elements of lsi,{} but should be more convenient and more efficient.
342431`\spad{elt(x,{} s,{} colList)} is equivalent to \spad{elt(x,{} expand(s),{} colList)} but should be more convenient and more efficient.
342526`\spad{elt(x,{} s1,{} ls2)} is equivalent to \spad{elt(x,{} l1,{} l2)} where \spad{li} is obtained appending expansions of elements of lsi,{} but should be more convenient and more efficient.
342630`\spad{elt(x,{} s1,{} s2)} is equivalent to \spad{elt(x,{} expand(s1),{} expand(s2))} but should be more convenient and more efficient.
342850`\spad{elt(p,{} i,{} j,{} l)} returns the element (\spad{i},{}\spad{j}) in matrix \spad{l} of the linear pencil \spad{p}.
342966`\spad{elt(x,{} i,{} j,{} k)} extract an element from the matrix \spad{x}
343154`\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}.
343217`\spad{elt(t,{} i,{} j,{} k)} gives a component of a rank 3 tensor.
343295`\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.
343379`\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
343587`\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}.
343652`\spad{elt(t,{} i,{} j,{} k,{} l)} gives a component of a rank 4 tensor.
343868`\spad{elt(op,{} x,{} y,{} z,{} t,{} s)} applies the 5-ary operator \spad{op} to \spad{x},{} \spad{y},{} \spad{z},{} \spad{t} and \spad{s}
344069`\spad{elt(op,{} x,{} y,{} z,{} t,{} s,{} r)} applies the 6-ary operator \spad{op} to \spad{x},{} \spad{y},{} \spad{z},{} \spad{t},{} \spad{s} and \spad{r}
344276`\spad{elt(op,{} x,{} y,{} z,{} t,{} s,{} r,{} q)} applies the 7-ary operator \spad{op} to \spad{x},{} \spad{y},{} \spad{z},{} \spad{t},{} \spad{s},{} \spad{r} and \spad{q}
344489`\spad{elt(op,{} x,{} y,{} z,{} t,{} s,{} r,{} q,{} p)} applies the 8-ary operator \spad{op} to \spad{x},{} \spad{y},{} \spad{z},{} \spad{t},{} \spad{s},{} \spad{r},{} \spad{q} and \spad{p}
344562`\spad{eltable? r} returns whether the operator determines (most likely) the sequence completely.
344622`Create an empty box of size 0.
344658`\spad{empty()} creates an empty form.
344695`\spad{empty()} returns the empty quasi-algebraic set
344758`\spad{empty()} returns the same as \spad{[empty()\$V,{} empty()\$C,{} false]\$\%}
344803`\spad{empty()} returns a new,{} empty symbol table
344841`\spad{empty()} creates a new,{} empty symbol table.
344882`\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.} \spad{u: D := empty()}.
344918`is empty if it contains no vertices or if multiplier is zero
344966`\spad{true} if empty
345019`\spad{true} if empty
345072`\spad{empty?(b)} returns \spad{true} of the box has height and depth equal to 0.
345116`\spad{empty?(s)} returns \spad{true} if the quasialgebraic set \spad{s} has no points,{} and \spad{false} otherwise.
345187`\spad{empty?(n)} returns \spad{true} iff the node \spad{n} is \spad{empty()\$\%}.
345240`\spad{empty?(el)} returns \spad{true} is this element does not contain anything
345285`\spad{empty(n)} produces reconstructor with \spad{n} slots
345345`\spad{empty?(f)} checks if form \spad{f} is empty.
345494`\spad{empty?(u)} tests if \spad{u} has 0 elements.
345538`\spad{empty(n,{} p)} initializes reconstructor with \spad{n} slots working modulo \spad{p}
345606`construct an empty lattice
345658`construct an empty lattice
345710`\spad{empty_mat()} returns empty (that is of dimensions 0) matrix.
345788`\spad{empty_mat?(mat)} returns \spad{true} if matrix is empty,{} \spad{false} otherwise.
345874`\spad{empty_poly()} returns empty (that is 0) polynomial.
345952`\spad{enableAlternativeOutput(f)} enable output as rational expression.
346024`\spad{enableDebugOutput(f)} enable displaying the ALS.
346090`\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}.
346137`\spad{endSubProgram()} asserts that we are no longer processing the current subprogram.
346191`\spad{enqueue!(x,{} q)} inserts \spad{x} into the queue \spad{q} at the back end.
346241`\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.
346303`\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.
346367`\spad{enterPointData(s,{} [p0,{} p1,{} ...,{} pn])} adds a list of points from \spad{p0} through \spad{pn} to the \spadtype{ThreeSpace},{} \spad{s},{} and returns the index,{} to the starting point of the list.
346513`\spad{entries(lp)} returns list of indexes that make this loop
346700`\spad{entries(u)} returns a list of all the entries of aggregate \spad{u} in no assumed order.
346837`\spad{entry?(x,{} u)} tests if \spad{x} equals \spad{u . i} for some index \spad{i}.
346997`\spad{enumerate()} returns a vector of all the sets of \spad{M} integers in \spad{1..n}.
347063`\spad{enumerate()} returns list of elements of the set.
347106`\spad{environmnt(env,{} x,{} sep)} returns a handler that typesets its arguments (without parentheses) in a \LaTeX{} environment with name \spad{env}. The string \spad{x} is put right after the start of the environment. The arguments are separated by the string \spad{sep}.
347244`\spad{environmnt(env,{} x,{} sep)} returns a handler that typesets its arguments (without parentheses) in a \LaTeX{} environment with name \spad{env}. The string \spad{x} is put right after the start of the environment. The arguments are separated by the string \spad{sep}.
347384`\spad{epilogue(t)} extracts the epilogue section of a TeX form \spad{t}.
347435`\spad{epilogue(t)} extracts the epilogue section of the form \spad{t}. This is a function \spad{f} such that \spad{f}(\spad{l}) returns a box with label \spad{l}.
347486`unit pseudoscalar
347546`\spad{Epsilon()} returns symbol for capital greek letter epsilon.
347599`\spad{epsilon()} returns symbol for small greek letter epsilon.
347694`\spad{EQ(x,{} y)} returns the \spadtype{Switch} expression representing \spad{x = y}.
347899`\spad{eq?(u,{} v)} tests if \spad{u} and \spad{v} are same objects.
347942`\spad{eq(s,{} t)} is \spad{true} if EQ(\spad{s},{} \spad{t}) is \spad{true} in Lisp.
348011`\spad{eqRep?(x,{} y)} compares the representations of \spad{x} and \spad{y} without any evaluation. Thus it is much weaker than \spad{=} and cannot decide equality of the evaluated expressions.
348069`\spad{equal?(p,{} pos_p,{} q,{} pos_q)} checks,{} if the matrices \spad{pos_p} in \spad{p} are equal to the pos_q in \spad{q}. Not specified matrices have to be zero.
348189`\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.
348248`\spad{equation(a,{} b)} creates an equation.
348292`\spad{equation(v,{} a..b)} creates a segment binding value with variable \spad{v} and segment \spad{a..b}. Note that the interpreter parses \spad{v=a..b} to this form.
348356`\spad{equation(s,{}"a")} creates a new equation.
348412`\spad{erf(f)} denotes the error function
348462`\spad{erf(x)} returns the error function of \spad{x},{} \spadignore{i.e.} \spad{2 / sqrt(\%\spad{pi})} times the integral of \spad{exp(-x^2) dx}.
348515`\spad{erf(f)} denotes the error function
348660`\spad{erf(f)} denotes the error function
348718`\spad{erfi(f)} denotes \spad{-\%i*erf(\%i*z)}
348769`\spad{erfi(x)} denotes \spad{-\%i*erf(\%i*x)}
348823`\spad{erfi(f)} denotes \spad{-\%i*erf(\%i*f)}
348970`\spad{erfi(f)} denotes \spad{-\%i*erf(\%i*f)}
349029`\spad{error(lmsg)} displays error message \spad{lmsg} and terminates.
349085`\spad{error(msg)} displays error message \spad{msg} and terminates.
349135`\spad{error(nam,{} lmsg)} displays error messages lmsg preceded by a message containing the name \spad{nam} of the function in which the error is contained.
349198`\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.
349255`\spad{errorInfo(u)} returns information about the error \spad{u}.
349311`\spad{errorKind(u)} returns the type of error which \spad{u} represents.
349372`\spad{Eta()} returns symbol for capital greek letter eta.
349421`\spad{eta()} returns symbol for small greek letter eta.
349470`\spad{euclideanGroebner(lp)} computes a groebner basis for a polynomial ideal over a euclidean domain generated by the list of polynomials \spad{lp}.
349580`\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)
349697`\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.
349821`\spad{euclideanNormalForm(poly,{} gb)} reduces the polynomial \spad{poly} modulo the precomputed groebner basis \spad{gb} giving a canonical representative of the residue class.
350211`\spad{euclideanSize(x)} returns the euclidean size of the element \spad{x}. Error: if \spad{x} is zero.
350279`\spad{euler(n)} returns the \spad{n}th Euler polynomial \spad{E[n](x)}. Note: Euler polynomials denoted \spad{E(n,{} x)} are 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)}.
350388`\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.
350456`\spad{eulerE(n,{} r)} returns value of the \spad{n}th Euler polynomial at \spad{r}.
350574`\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.
350645`\spad{eval1(exp)} explicitly evaluates the next term in \spad{exp}. \spad{exp} is destructively altered.
350694`\spad{eval1(p,{} v,{} r,{} pss)} evaluates \spad{p} with respect to single variable \spad{v} at \spad{r}. \spad{pss} is global state.
350866`\spad{eval1(pol,{} v,{} pt,{} pss)} evaluates \spad{pol} in variable \spad{v} at \spad{pt},{} using global state form \spad{pss}. Computations are done modulo a prime contained in \spad{pss}.
351053`\spad{eval1(pq,{} v,{} pt,{} pss)} evaluates fraction of polynomial \spad{pq} in variable \spad{v} at \spad{pt},{} using global state form \spad{pss}. Computations are done modulo a prime contained in \spad{pss}.
351336`\spad{eval1a(pol,{} pt,{} pss)} evaluates polynomial \spad{pol} at point \spad{pt} using global state form \spad{pss}. Computations are done modulo a prime contained in \spad{pss}. Note: \spad{pol} must have at most one variable.
351505`\spad{eval(exp)} explicitly evaluates all terms in \spad{exp}. \spad{exp} is destructively altered.
351553`\spad{eval s} is the sum of the coefficients of a cycle index.
351932`\spad{eval(v,{} f)} applies the vector field \spad{v} to the function \spad{f}.
351981`\spad{eval(m,{} x)} returns \spad{(a*x + b)/(c*x + d)} where \spad{m = moebius(a,{} b,{} c,{} d)} (see \spadfunFrom{moebius}{MoebiusTransform}).
352029`\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.}
352132`\spad{eval(om,{} v)} applies the differential \spad{om} to the vector field \spad{v}.
352201`\spad{eval(m,{} x)} returns \spad{(a*x + b)/(c*x + d)} where \spad{m = moebius(a,{} b,{} c,{} d)} (see \spadfunFrom{moebius}{MoebiusTransform}).
353029`\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}.
353105`\spad{eval(f,{} a)} evaluates a power series at a value in the ground ring by returning a stream of partial sums.
353228`\spad{eval(eqn,{} x=f)} replaces \spad{x} by \spad{f} in equation \spad{eqn}.
353310`\spad{eval(d,{} p)} evaluates the distribution \spad{d} as a linear functional on the polynomial \spad{p}. Same as \spad{integrate(p,{} d)}.
353393`\spad{eval(f,{} x = v)} replaces \spad{x} by \spad{v} in \spad{f}.
353443`\spad{eval(f,{} v = g)} returns \spad{f} with \spad{v} replaced by \spad{g}. Error: if \spad{v} is not a symbol.
353567`\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}\spad{'s} appearing inside the \spad{gi}\spad{'s} are not replaced. Error: if any \spad{vi} is not a symbol.
353697`\spad{eval(eqn,{} [x1=v1,{} ... xn=vn])} replaces \spad{xi} by \spad{vi} in equation \spad{eqn}.
353785`\spad{eval(f,{} [x1 = v1,{} ...,{} xn = vn])} replaces \spad{xi} by \spad{vi} in \spad{f}.
353841`\spad{eval(x,{} f)} evaluates the bivariate function \spad{f} linearly on the tensor product.
353913`\spad{eval(p,{} el)} returns the image of {\em el} under the permutation \spad{p}.
357694`\spad{eval(p(x,{} y),{} f(x),{} g(x))} returns \spad{p(f(x),{} y * g(x))}.
357780`\spad{eval(f,{} x,{} v)} replaces \spad{x} by \spad{v} in \spad{f}.
357829`\spad{eval(x,{} s,{} f)} replaces every \spad{s(a)} in \spad{x} by \spad{f(a)} for any \spad{a}.
357896`\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}.
357969`\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}\spad{'s} appearing inside the \spad{gi}\spad{'s} are not replaced.
358102`\spad{eval(f,{} v,{} g)} returns \spad{f} with \spad{v} replaced by \spad{g}.
358223`\spad{eval(f,{} [x1,{} ...,{} xn],{} [v1,{} ...,{} vn])} replaces \spad{xi} by \spad{vi} in \spad{f}.
358284`\spad{eval(x,{} [s1,{} ...,{} sm],{} [f1,{} ...,{} fm])} replaces every \spad{\spad{si}(a)} in \spad{x} by \spad{\spad{fi}(a)} for any \spad{a}.
358363`\spad{eval(x,{} [s1,{} ...,{} sm],{} [f1,{} ...,{} fm])} replaces every \spad{\spad{si}(a1,{} ...,{} an)} in \spad{x} by \spad{\spad{fi}(a1,{} ...,{} an)} for any \spad{a1},{} ...,{} \spad{an}.
358448`\spad{eval(x,{} [s1,{} ...,{} sm],{} [f1,{} ...,{} fm])} replaces every \spad{\spad{si}(a)} in \spad{x} by \spad{\spad{fi}(a)} for any \spad{a}.
358520`\spad{eval(x,{} [s1,{} ...,{} sm],{} [f1,{} ...,{} fm])} replaces every \spad{\spad{si}(a1,{} ...,{} an)} in \spad{x} by \spad{\spad{fi}(a1,{} ...,{} an)} for any \spad{a1},{} ...,{} \spad{an}.
358598`\spad{eval(p,{} [x1,{} ...,{} xn],{} [v1,{} ...,{} vn])} replaces \spad{\spad{xi}} by \spad{\spad{vi}} in \spad{p}.
358670`\spad{eval(x,{} s,{} f)} replaces every \spad{s(a)} in \spad{x} by \spad{f(a)} for any \spad{a}.
358730`\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}.
358796`\spad{eval(p,{} x,{} v)} replaces \spad{x} by \spad{v} in \spad{p}.
359358`\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}.
359458`\spad{eval(x,{} [s1,{} ...,{} sm],{} [f1,{} ...,{} fm],{} y)} replaces every \spad{\spad{si}(a)} in \spad{x} by \spad{\spad{fi}(y)} with \spad{y} replaced by \spad{a} for any \spad{a}.
359570`\spad{eval(x,{} [s1,{} ...,{} sm],{} [n1,{} ...,{} nm],{} [f1,{} ...,{} fm])} replaces every \spad{\spad{si}(a)^ni} in \spad{x} by \spad{\spad{fi}(a)} for any \spad{a}.
359678`\spad{eval(x,{} [s1,{} ...,{} sm],{} [n1,{} ...,{} nm],{} [f1,{} ...,{} fm])} replaces every \spad{\spad{si}(a1,{} ...,{} an)^ni} in \spad{x} by \spad{\spad{fi}(a1,{} ...,{} an)} for any \spad{a1},{} ...,{} am.
359792`\spad{eval(x,{} s,{} n,{} f)} replaces every \spad{s(a)^n} in \spad{x} by \spad{f(a)} for any \spad{a}.
359882`\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.
359978`\spad{eval_at(v,{} deg,{} pt,{} p)} treats \spad{v} as coefficients of polynomial of degree \spad{deg} and evaluates the polynomial at point \spad{pt} modulo \spad{p}
360075`\spad{evaluate(op)} returns the value of the "\%eval" property of \spad{op} if it has one,{} and "failed" otherwise.
360215`\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.
360303`\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)}.
360397`\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.
360490`\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}.
360598`\spad{evaluateInverse(x,{} f)} \undocumented
360662`\spad{eval_with_timeout(f,{} t)} calls \spad{f} with timeout of \spad{t} seconds. Returns value computed by \spad{f} or "failed" if \spad{f} did not finish within \spad{t} seconds.
360850`\spad{even? x} is \spad{true} if \spad{x} is an even integer.
360932`\spad{even?(n)} returns \spad{true} if and only if \spad{n} is even.
360985`\spad{even?(p)} returns \spad{true} if and only if \spad{p} is an even permutation,{} \spadignore{i.e.} {\em sign(p)} is 1.
361033`\spad{evenInfiniteProduct(f(x))} computes \spad{product(n=2,{} 4,{} 6...,{} f(x^n))}. The series \spad{f(x)} should have constant coefficient 1.
361173`\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(evenlambert(log(f(x))))}.}
361243`\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))))}.
361794`\spad{every?(p,{} u)} tests if \spad{p}(\spad{x}) is \spad{true} for all elements \spad{x} of \spad{u}. Note: for collections,{} \spad{every?(p,{} u) = reduce(and,{} map(p,{} u),{} true,{} false)}. However,{} \spad{every?(p,{} u)} returns as soon as it finds an element for which \spad{p} gives \spad{false}.
362169`\spad{exactQuotient(a,{} b)} computes the exact quotient of \spad{a} by \spad{b},{} which is assumed to be a divisor of \spad{a}. No error is returned if this exact quotient fails!
362262`\spad{exactQuotient!(a,{} b)} replaces \spad{a} by \spad{exactQuotient(a,{} b)}
362356`\spad{exactQuotient(p,{} r)} computes the exact quotient of \spad{p} by \spad{r},{} which is assumed to be a divisor of \spad{p}. No error is returned if this exact quotient fails!
362449`\spad{exactQuotient!(p,{} r)} replaces \spad{p} by \spad{exactQuotient(p,{} r)}.
362543`\spad{exists?(f)} tests if the file exists in the file system.
362595`\spad{exp0(f)} returns the exponential of the power series represented by cons(0,{} \spad{f}),{} \spadignore{i.e.} assuming zero constant term and therefore transcendentality is not involved.
362683`\spad{exp1()} returns the natural log base \spad{2.718281828...}.
362720`\spad{exp1()} returns exp 1: \spad{2.7182818284...}.
362751`\spad{exp1(b)} computes approximation to exp(1) accurate to at least \spad{b} bits.
362856`\spad{exp(x)} represents the Fortran intrinsic function EXP
362934`\spad{exp(x)} applies the exponential operator to \spad{x}
362983`\spad{exp(p)} returns the exponential of \spad{p}.
363062`\spad{exp([i1,{} ...in])} returns \spad{u_1\^{i_1} ... u_n\^{i_n}}
363313`\spad{exp(st)} computes the exponential of a power series \spad{st}.
363396`\spad{exp(st)} computes the exponential of a power series \spad{st}.
363493`\spad{exp(z)} returns the exponential of Laurent series \spad{z}.
363579`\spad{exp(z)} returns the exponential of a Puiseux series \spad{z}.
363674`\spad{exp(x)} returns \%\spad{e} to the power \spad{x}.
363726`\spad{exp(p,{} n)} returns the exponential of \spad{p} (truncated up to order \spad{n}).
363827`\spad{exp(x,{} b)} computes approximation to exp(\spad{x}) accurate to at least \spad{b} bits.
363973`\spad{exp(p,{} n)} returns the exponential of \spad{p} truncated at order \spad{n}.
364061`\spad{expa(x)} returns the exponent of the rotation a in the normal form of \spad{x}
364189`\spad{expand(p)} returns \spad{p} in distributed form.
364279`\spad{expand(f)} performs the following expansions on \spad{f:} \begin{items} \item 1. logs of products are expanded into sums of logs. \item 2. trigonometric and hyperbolic trigonometric functions of sums are expanded into sums of products of trigonometric and hyperbolic trigonometric functions. \item 3. formal powers of the form \spad{(a/b)^c} are expanded into \spad{a^c * b^(-c)}. \end{items}
364340`\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]}.
364398`\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]}.
364462`\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.
364502`\spad{expand(f,{} n)} returns list of all solutions \spad{y} to equation \spad{y^n} = \spad{f}
364608`\spad{expand(i,{} x)} returns the list of possible real functions of \spad{x} corresponding to \spad{i}.
364735`\spad{expand(i,{} x)} returns the list of possible real functions of \spad{x} corresponding to \spad{i}.
364828`\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)}.
364892`\spad{expandPower(f)} converts every power \spad{(a/b)^c} appearing in \spad{f} into \spad{a^c * b^(-c)}.
364958`\spad{expandTrigProducts(e)} replaces \spad{sin(x)*sin(y)} by \spad{(cos(x-y)-cos(x+y))/2},{} \spad{cos(x)*cos(y)} by \spad{(cos(x-y)+cos(x+y))/2},{} and \spad{sin(x)*cos(y)} by \spad{(sin(x-y)+sin(x+y))/2}. Note: this operation uses pattern matcher,{} so it is relatively expensive. To avoid getting into an infinite loop the transformations are applied at most ten times.
365155`\spad{expa(x)} returns the exponent of the reflection \spad{b} in the normal form of \spad{x}
365214`\spad{expextint(',{} rde,{} csolve,{} [g1,{} ...,{} gn])} returns a basis of solution of the homogeneous system \spad{h' + c1*g1 + ... + cn*gn = 0} Argument foo is an parametric \spad{rde} solver on \spad{F}. \spad{csolve} is solver over constants.
365572`\spad{expIfCan(z)} returns exp(\spad{z}) if possible,{} and "failed" otherwise.
365652`\spad{expint(f,{} x)} returns e^{the integral of \spad{f} with respect to \spad{x}}.
365707`\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}.
366002`\spad{explicitEntries?(s)} returns \spad{true} if the stream \spad{s} has explicitly computed entries,{} and \spad{false} otherwise.
366069`\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.
366264`\spad{explicitlyFinite?(s)} tests if the stream has a finite number of elements,{} and \spad{false} otherwise. Note: for many datatypes,{} \spad{explicitlyFinite?(s) = not possiblyInfinite?(s)}.
366328`\spad{explogs2trigs(f)} rewrites all the complex logs and exponentials appearing in \spad{f} in terms of trigonometric functions.
366413`\spad{exp_lower_bound(a,{} b,{} ob,{} nc0,{} lk,{} eta,{} logi)} computes lower degree bound for solution of \spad{a*D(y) + b*y = c} in exponential case. \spad{ob} is order of \spad{b},{} \spad{nc0} is lower bound on order of \spad{c},{} \spad{eta} is derivative of the argument of exponential.
366681`\spad{exponent(x)} \undocumented
366735`\spad{exponent(g^k)} returns the representative integer \$\spad{k}\$.
366788`\spad{exponent(g^k)} returns the representative integer \$\spad{k}\$.
366847`\spad{exponent(u)} returns the exponent of \spad{u}
366896`Each element \spad{x} can be written as x=p^n*a/b with \spad{gcd}(\spad{p},{}a)=gcd(\spad{p},{}\spad{b})\spad{=1}. exponent(\spad{x}) returns \spad{n}.
366970`\spad{exponent(exp(f(x)))} returns \spad{f(x)}
367083`\spad{exponent(x)} returns the \spadfunFrom{exponent}{FloatingPointSystem} part of \spad{x}.
367139`\spad{exponenta(x)} returns the exponent of the rotation a in the normal form of \spad{x} as integer
367197`\spad{exponentb(x)} returns the exponent of the reflection \spad{b} in the normal form of \spad{x} as integer
367255`\spad{exponential1()} \undocumented
367317`\spad{exponential(f)} \undocumented
367387`\spad{exponential(f(x))} returns \spad{exp(f(x))}. Note: the function does NOT check that \spad{f(x)} has no non-negative terms.
367503`\spad{exponentialOrder(exp(c * x ^(-n) + ...))} returns \spad{-n}. exponentialOrder(0) returns \spad{0}.
367606`\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.
367661`\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 \spad{GF}(2^m) using normal bases",{} Information and Computation 78,{} \spad{pp}.171-177,{} 1988.
367855`\spad{expressIdealMember([f1,{} ...,{} fn],{} h)} returns a representation of \spad{h} as a linear combination of the \spad{fi} or "failed" if \spad{h} is not in the ideal generated by the \spad{fi}.
367946`\spad{expression2Fortran1(nf,{} of,{} int_to_floats?)}
368043`\spad{expression2Fortran(of)}
368120`\spad{exprex(o)} converts \spadtype{OutputForm} to \spadtype{String}
368331`\spad{exprToGenUPS(fcn,{} posCheck?,{} atanFlag)} converts the expression \spad{fcn} to a generalized power series. If \spad{posCheck?} is \spad{true},{} log\spad{'s} of negative numbers are not allowed nor are \spad{n}th roots of negative numbers with \spad{n} even. If \spad{posCheck?} is \spad{false},{} these are allowed. \spad{atanFlag} determines how the case \spad{atan(f(x))},{} where \spad{f(x)} has a pole,{} will be treated. The possible values of \spad{atanFlag} are \spad{"complex"},{} \spad{"real: two sides"},{} \spad{"real: left side"},{} \spad{"real: right side"},{} and \spad{"just do it"}. If \spad{atanFlag} is \spad{"complex"},{} then no series expansion will be computed because,{} viewed as a function of a complex variable,{} \spad{atan(f(x))} has an essential singularity. Otherwise,{} the sign of the leading coefficient of the series expansion of \spad{f(x)} determines the constant coefficient in the series expansion of \spad{atan(f(x))}. If this sign cannot be determined,{} a series expansion is computed only when \spad{atanFlag} is \spad{"just do it"}. When the leading term in the series expansion of \spad{f(x)} is of odd degree (or is a rational degree with odd numerator),{} then the constant coefficient in the series expansion of \spad{atan(f(x))} for values to the left differs from that for values to the right. If \spad{atanFlag} is \spad{"real: two sides"},{} no series expansion will be computed. If \spad{atanFlag} is \spad{"real: left side"} the constant coefficient for values to the left will be used and if \spad{atanFlag} \spad{"real: right side"} the constant coefficient for values to the right will be used. If there is a problem in converting the function to a power series,{} we return a record containing the name of the function that caused the problem and a brief description of the problem. When expanding the expression into a series it is assumed that the series is centered at 0. For a series centered at a,{} the user should perform the substitution \spad{x -> x + a} before calling this function.
368597`\spad{exprToGenUPS(fcn,{} posCheck?,{} atanFlag)} converts the expression \spad{fcn} to a generalized power series. If \spad{posCheck?} is \spad{true},{} log\spad{'s} of negative numbers are not allowed nor are \spad{n}th roots of negative numbers with \spad{n} even. If \spad{posCheck?} is \spad{false},{} these are allowed. \spad{atanFlag} determines how the case \spad{atan(f(x))},{} where \spad{f(x)} has a pole,{} will be treated. The possible values of \spad{atanFlag} are \spad{"complex"},{} \spad{"real: two sides"},{} \spad{"real: left side"},{} \spad{"real: right side"},{} and \spad{"just do it"}. If \spad{atanFlag} is \spad{"complex"},{} then no series expansion will be computed because,{} viewed as a function of a complex variable,{} \spad{atan(f(x))} has an essential singularity. Otherwise,{} the sign of the leading coefficient of the series expansion of \spad{f(x)} determines the constant coefficient in the series expansion of \spad{atan(f(x))}. If this sign cannot be determined,{} a series expansion is computed only when \spad{atanFlag} is \spad{"just do it"}. When the leading term in the series expansion of \spad{f(x)} is of odd degree (or is a rational degree with odd numerator),{} then the constant coefficient in the series expansion of \spad{atan(f(x))} for values to the left differs from that for values to the right. If \spad{atanFlag} is \spad{"real: two sides"},{} no series expansion will be computed. If \spad{atanFlag} is \spad{"real: left side"} the constant coefficient for values to the left will be used and if \spad{atanFlag} \spad{"real: right side"} the constant coefficient for values to the right will be used. If there is a problem in converting the function to a power series,{} we return a record containing the name of the function that caused the problem and a brief description of the problem. When expanding the expression into a series it is assumed that the series is centered at 0. For a series centered at a,{} the user should perform the substitution \spad{x -> x + a} before calling this function.
368852`\spad{exprToPS(fcn,{} posCheck?,{} atanFlag,{} log_flag,{} log_val)} is like exprToUPS,{} but if \spad{log_flag} is \spad{true} it replaces logarithms of expansion variable by \spad{log_val}
369125`\spad{exprToPS(fcn,{} posCheck?,{} atanFlag,{} log_flag,{} log_val)} is like exprToUPS,{} but if \spad{log_flag} is \spad{true} it replaces logarithms of expansion variable by \spad{log_val}
369387`exprToPS(\spad{fcn},{} posCheck?,{} atanFlag,{} log_flag,{} log_val,{} coef_chk,{} inv_chk,{} zero_chk) is like exprToPS(\spad{fcn},{} posCheck?,{} atanFlag,{} log_flag,{} log_val),{} but fails if \spad{coef_chk} is \spad{false} for some coefficient of \spad{fcn} or if expansion process needs to invert element of \spad{FE} for which \spad{inv_chk} is \spad{false}
369702`exprToPS(\spad{fcn},{} posCheck?,{} atanFlag,{} log_flag,{} log_val,{} coef_chk,{} inv_chk,{} zero_chk) is like exprToPS(\spad{fcn},{} posCheck?,{} atanFlag,{} log_flag,{} log_val),{} but fails if \spad{coef_chk} is \spad{false} for some coefficient of \spad{fcn} or if expansion process needs to invert element of \spad{FE} for which \spad{inv_chk} is \spad{false}
370006`\spad{expr_to_series computes} degree and leading coefficinet of series expansion.
370317`\spad{exprToUPS(fcn,{} posCheck?,{} atanFlag)} converts the expression \spad{fcn} to a power series. If \spad{posCheck?} is \spad{true},{} log\spad{'s} of negative numbers are not allowed nor are \spad{n}th roots of negative numbers with \spad{n} even. If \spad{posCheck?} is \spad{false},{} these are allowed. \spad{atanFlag} determines how the case \spad{atan(f(x))},{} where \spad{f(x)} has a pole,{} will be treated. The possible values of \spad{atanFlag} are \spad{"complex"},{} \spad{"real: two sides"},{} \spad{"real: left side"},{} \spad{"real: right side"},{} and \spad{"just do it"}. If \spad{atanFlag} is \spad{"complex"},{} then no series expansion will be computed because,{} viewed as a function of a complex variable,{} \spad{atan(f(x))} has an essential singularity. Otherwise,{} the sign of the leading coefficient of the series expansion of \spad{f(x)} determines the constant coefficient in the series expansion of \spad{atan(f(x))}. If this sign cannot be determined,{} a series expansion is computed only when \spad{atanFlag} is \spad{"just do it"}. When the leading term in the series expansion of \spad{f(x)} is of odd degree (or is a rational degree with odd numerator),{} then the constant coefficient in the series expansion of \spad{atan(f(x))} for values to the left differs from that for values to the right. If \spad{atanFlag} is \spad{"real: two sides"},{} no series expansion will be computed. If \spad{atanFlag} is \spad{"real: left side"} the constant coefficient for values to the left will be used and if \spad{atanFlag} \spad{"real: right side"} the constant coefficient for values to the right will be used. If there is a problem in converting the function to a power series,{} a record containing the name of the function that caused the problem and a brief description of the problem is returned. When expanding the expression into a series it is assumed that the series is centered at 0. For a series centered at a,{} the user should perform the substitution \spad{x -> x + a} before calling this function.
370580`\spad{exprToUPS(fcn,{} posCheck?,{} atanFlag)} converts the expression \spad{fcn} to a power series. If \spad{posCheck?} is \spad{true},{} log\spad{'s} of negative numbers are not allowed nor are \spad{n}th roots of negative numbers with \spad{n} even. If \spad{posCheck?} is \spad{false},{} these are allowed. \spad{atanFlag} determines how the case \spad{atan(f(x))},{} where \spad{f(x)} has a pole,{} will be treated. The possible values of \spad{atanFlag} are \spad{"complex"},{} \spad{"real: two sides"},{} \spad{"real: left side"},{} \spad{"real: right side"},{} and \spad{"just do it"}. If \spad{atanFlag} is \spad{"complex"},{} then no series expansion will be computed because,{} viewed as a function of a complex variable,{} \spad{atan(f(x))} has an essential singularity. Otherwise,{} the sign of the leading coefficient of the series expansion of \spad{f(x)} determines the constant coefficient in the series expansion of \spad{atan(f(x))}. If this sign cannot be determined,{} a series expansion is computed only when \spad{atanFlag} is \spad{"just do it"}. When the leading term in the series expansion of \spad{f(x)} is of odd degree (or is a rational degree with odd numerator),{} then the constant coefficient in the series expansion of \spad{atan(f(x))} for values to the left differs from that for values to the right. If \spad{atanFlag} is \spad{"real: two sides"},{} no series expansion will be computed. If \spad{atanFlag} is \spad{"real: left side"} the constant coefficient for values to the left will be used and if \spad{atanFlag} \spad{"real: right side"} the constant coefficient for values to the right will be used. If there is a problem in converting the function to a power series,{} a record containing the name of the function that caused the problem and a brief description of the problem is returned. When expanding the expression into a series it is assumed that the series is centered at 0. For a series centered at a,{} the user should perform the substitution \spad{x -> x + a} before calling this function.
370832`\spad{exprToXXP(fcn,{} posCheck?)} converts the expression \spad{fcn} to an exponential expansion. If \spad{posCheck?} is \spad{true},{} log\spad{'s} of negative numbers are not allowed nor are \spad{n}th roots of negative numbers with \spad{n} even. If \spad{posCheck?} is \spad{false},{} these are allowed.
371158`\spad{expt(r,{} i)} computes r^i by repeated squaring
371220`\spad{exquo(f,{} g)} creates the equivalent infix form.
371865`\spad{exquo(a,{} b)} returns the power series quotient of \spad{a} by \spad{b},{} if the quotient exists,{} and "failed" otherwise
371966`\spad{exQuo(x,{} y)} \undocumented
372066`\spad{exQuo(x,{} y)} \undocumented
372156`\spad{exQuo(x,{} y)} \undocumented
372245`\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.
372330`\spad{exquo(p,{}r)} returns the exact quotient of polynomial \spad{p} by \spad{r},{} or "failed" if none exists.
372421`\spad{exquo(m,{} r)} computes the exact quotient of the elements of \spad{m} by \spad{r},{} returning \spad{"failed"} if this is not possible.
372513`\spad{exquo(m,{} r)} computes the exact quotient of the elements of \spad{m} by \spad{r},{} returning \spad{"failed"} if this is not possible.
372620`\spad{exquo(l,{} a)} returns the exact quotient of \spad{l} by a,{} returning \spad{"failed"} if this is not possible.
372722`\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.
372778`\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.
373336`\spad{extend(f,{} n)} causes all terms of \spad{f} of degree \spad{<=} \spad{n} to be computed.
373412`\spad{extend(st,{} n)} causes entries to be computed,{} if necessary,{} so that 'st' will have at least \spad{'n'} explicit entries or so that all entries of 'st' will be computed if 'st' is finite with length \spad{<=} \spad{n}.
373471`\spad{extend(x,{} n)} forces the computation of digits up to order \spad{n}.
373531`\spad{extend(x,{} n)} causes the first \spad{n} entries in the continued fraction \spad{x} to be computed. Normally entries are only computed as needed.
373588`\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))}
373668`\spad{extend(lp,{} lts)} returns the same as \spad{concat([extend(lp,{} ts) for ts in lts])|}
373754`\spad{extend(x,{} l,{} r)} \undocumented
373807`\spad{extend(f,{} n)} causes all terms of \spad{f} of degree \spad{<= n} to be computed.
373897`\spad{extend(ts,{} p)} returns a triangular set which encodes the simple extension by \spad{p} of the extension of the base field defined by \spad{ts},{} according to the properties of triangular sets of the current category If the required properties do not hold an error is returned.
373958`\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.
374032`\spad{extend(p,{} lts)} returns the same as \spad{concat([extend(p,{} ts) for ts in lts])|}
374112`\spad{extendedALS(f)} returns an extended ALS for \spad{f},{} that is,{} 1*f (with a scalar first row).
374172`\spad{extendedCoords(pt)} returns extended coordinates as a list.
374329`\spad{extendedEuclidean(x,{} y)} returns a record rec where \spad{rec.coef1*x+rec.coef2*y = rec.generator} and rec.generator is a \spad{gcd} of \spad{x} and \spad{y}. The \spad{gcd} is unique only up to associates if \spadtype{canonicalUnitNormal} is not asserted. \spadfun{principalIdeal} provides a version of this operation which accepts an arbitrary length list of arguments.
374516`\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}.
374613`\spad{extended_gcd(v1,{} v2,{} p)} gives [\spad{g},{} \spad{c1},{} \spad{c2}] such that \spad{g} is \spad{gcd(v1,{} v2,{} p)},{} \spad{g = c1*v1 + c2*v2} and degree(\spad{c1}) < max(degree(\spad{v2}) - degree(\spad{g}),{} 0) and degree(\spad{c2}) < max(degree(\spad{v1}) - degree(\spad{g}),{} 1)
374717`\spad{extendedint(f,{} x,{} [g1,{} ...,{} gn])} returns solution of the system \spad{f = dh/dx + c1*g1 + ... + cn*gn} and and a basis of the associated homogeneous system \spad{dh/dx + c1*g1 + ... + cn*gn = 0}. Solutions are in the field generated by kernels of \spad{f} and \spad{g1},{} ...,{} \spad{gn}.
374907`\spad{extendedint(x,{} [k1,{} ...,{} kn],{} [g1,{} ...,{} gn])} returns a basis of the homogeneous system \spad{dh/dx + c1*g1 + ... + cn*gn = 0}. Solutions are in the field generated by \spad{k1},{} ...,{} \spad{kn}.
375035`\spad{extendedint(f,{} x,{} [k1,{} ...,{} kn],{} [g1,{} ...,{} gn])} is like extendedint(\spad{f},{} [\spad{k1},{} ...,{} \spad{kn}],{} [\spad{g1},{} ...,{} \spad{gn}]) but looks for solutions in the field generated by \spad{k1},{} ...,{} \spad{kn}.
375241`\spad{extendedLLL(m)} returns the \spad{LLL} reductions of \spad{m} together with the transformation matrix,{} \spadignore{i.e.} if [\spad{l},{} \spad{t}] is returned then it holds \spad{l} = \spad{t*m}.
375347`\spad{extendedLLL!(m,{} n)} with 1 \spad{<=} \spad{n} \spad{<=} ncols(\spad{m}) performs the \spad{LLL} reduction of \spad{m} where only the first \spad{n} columns are considered significant. All matrix transformations,{} however,{} will be executed on the full matrix. \spad{m} is destructively modified and will be lost after this call.
375441`\spad{extendedResultant(a,{} b)} returns \spad{[r,{} ca,{} cb]} such that \spad{r} is the resultant of \spad{a} and \spad{b} and \spad{r = ca * a + cb * b}
375570`\spad{extendedSubResultantGcd(a,{} b)} returns \spad{[g,{} ca,{} cb]} such that \spad{g} is a \spad{gcd} of \spad{a} and \spad{b} in \spad{R^(-1) P} and \spad{g = ca * a + cb * b}
375699`\spad{extendedSubResultantGcd(a,{} b)} returns \spad{[g,{} ca,{} cb]} such that \spad{g} is \spad{subResultantGcd(a,{} b)} and we have \spad{ca * a + cb * cb = g}.
375830`\spad{extendIfCan(ts,{} p)} returns a triangular set which encodes the simple extension by \spad{p} of the extension of the base field defined by \spad{ts},{} according to the properties of triangular sets of the current domain. If the required properties do not hold then "failed" is returned. This operation encodes in some sense the properties of the triangular sets of the current category. Is is used to implement the \spad{construct} operation to guarantee that every triangular set build from a list of polynomials has the required properties.
375912`\spad{extendToPoint(n,{} p)} creates a boundary that is the union \indented{2}{of a boundary and a point.} \spad{n} is the boundary \spad{p} is the point
375964`\spad{extension(f)} returns the type part of the file name.
376118`\spad{extensionDegree()} returns the degree of field extension.
376204`\spad{extensionDegree()} returns the degree of the field extension if the extension is algebraic,{} and \spad{infinity} if it is not.
376292`\spad{extensionDegree()} returns the degree of field extension.
376375`\spad{exteriorDifferential(df)} returns the exterior derivative (gradient,{} curl,{} divergence,{} ...) of the differential form \spad{df}.
376452`\spad{external?(u)} returns \spad{true} if \spad{u} is declared to be EXTERNAL
376501`\spad{externalList(tab)} returns a list of all the external symbols in \spad{tab}
376638`\spad{extract!(u)} destructively removes a (random) item from bag \spad{u}.
376684`\spad{extract(A,{} i1,{} i2)} extracts the rows \spad{i1} to \spad{i2} and returns them as a new matrix.
376754`\spad{extractBottom!(d)} destructively extracts the bottom (back) element from the dequeue \spad{d}. Error: if \spad{d} is empty.
376810`\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.
376865`\spad{extractIfCan(x)} searches the item whose key is \spad{x}.
376960`\spad{extractIndex(s)} returns a non negative integer which is the current index of the 3 dimensional subspace \spad{s}.
377025`\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}.
377080`\spad{extractProperty(s)} returns the property of domain \spadtype{SubSpaceComponentProperty} of the indicated 3 dimensional subspace \spad{s}.
377155`\spad{extractSplittingLeaf(a)} returns the left most leaf (as a tree) whose status is \spad{false} if any,{} else "failed" is returned.
377232`\spad{extractSymbol(jm)} extracts the highest order part of the Jacobi matrix.
377456`\spad{extractSymbol(de,{} solved?)} computes the symbol of the differential equation \spad{de}. If \spad{solved?} is \spad{true},{} the row echelon form of the symbol is computed at once.
377553`\spad{extractTop!(d)} destructively extracts the top (front) element from the dequeue \spad{d}. Error: if \spad{d} is empty.
377606`\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}.
377831`\spad{F2FG(a + sqrt(-1) b)} returns \spad{a + i b}.
377898`\spad{F(n,{} m)} \undocumented
377990`returns an individual face map specified by \spad{n}. Where \spad{'n'} is the dimension required,{} so \spad{n=1} returns one dimensional faces (edges),{} \spad{n=2} returns two dimensional faces (triamgles),{} and so on. used by fundamentalGroup.
378073`\spad{factor1(a)} returns the factorisation of a,{} assuming that a has no first-order right factor.
378286`\spad{factor(x)} returns the decreasing factorization into Lyndon words.
378356`\spad{factor(n)} returns the full factorization of integer \spad{n}
378425`\spad{factor(a)} returns the factorisation of a.
378637`\spad{factor(f)} factorizes \spad{f} in f=f_1*f_2*...*f_k with atoms (irreducible elements) f_i. Notice that this factorization is unique only with respect to similarity.
378698`splits \spad{n} into a list of factors which must be \spad{true} for the whole to be \spad{true}. This assumes that the top level is already a set of factors separated by \spad{/\} otherwise the result will just be a list with one entry: \spad{'n'}. This is used when converting ILogic to types by using the Curry-Howard isomorphism.
378739`splits \spad{n} into a list of factors which must be \spad{true} for the whole to be \spad{true}. This assumes that the top level is already a set of factors separated by \spad{/\} otherwise the result will just be a list with one entry: \spad{'n'}. This is used when converting ILogic to types by using the Curry-Howard isomorphism.
378792`splits \spad{n} into a list of factors which must be \spad{true} for the whole to be \spad{true}. This assumes that the top level is already a set of factors separated by \spad{/\} otherwise the result will just be a list with one entry: \spad{'n'}. This is used when converting ILogic to types by using the Curry-Howard isomorphism.
378845`\spad{factor(p)} factors the multivariate polynomial \spad{p} over its coefficient domain
378928`\spad{factor(p)} factors the multivariate polynomial \spad{p} with coefficients which are fractions of elements of \spad{R}.
378995`\spad{factor(p)} factors a polynomial with polynomial coefficients.
379072`\spad{factor(p)} factors an extended polynomial \spad{p} over the rational numbers.
379424`\spad{factor(p)} tries to factor \spad{p} into linear factors with error at most {\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.
379496`\spad{factor(p)} returns the factorization of \spad{p} over the integers.
379562`\spad{factor(p)} factorizes \spad{p} into prime factors.
379639`\spad{factor(p)} returns a factorization of \spad{p} into irreducible factors. Note: in general there are finitely many nonequivalent factorizations into irreducible factors,{} this routine returns only one.
379789`\spad{factor(\spad{zi})} produces the complete factorization of the complex integer \spad{zi}.
379886`\spad{factor(x)} returns the factorization of \spad{x} into irreducibles.
379950`\spad{factor(p)} factors the multivariate polynomial \spad{p} over its coefficient domain
380020`\spad{factor(p)} produces the complete factorization of the multivariate polynomial \spad{p} over a finite field.
380091`\spad{factor(prf)} factors a polynomial with rational function coefficients.
380180`\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
380306`\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.
380433`\spad{factor(p)} returns a prime factorisation of \spad{p} over the field generated by its coefficients.
380487`\spad{factor(p)} returns a prime factorisation of \spad{p}.
380554`\spad{factor(p,{} f)} returns a prime factorisation of \spad{p}; \spad{f} is a factorisation map for elements of UP.
380652`\spad{factor(a,{} zeros)} returns the factorisation of a. \spad{zeros} is a zero finder in \spad{UP}.
380847`\spad{factor(p,{} ufact)} factors the multivariate polynomial \spad{p} by specializing variables and calling the univariate factorizer ufact.
380982`\spad{factor(p,{} [k1,{} ...,{} kn])} factors \spad{p} into irreducible factors over field generated by its coefficients and \spad{k1},{} ...,{} \spad{kn}.
381116`\spad{factor(p,{} ufact)} factors the multivariate polynomial \spad{p} by specializing variables and calling the univariate factorizer ufact. \spad{p} is represented as a univariate polynomial with multivariate coefficients.
381307`\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 listOfDegrees.
381398`\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.
381483`\spad{factor(p,{} eps)} tries to factor \spad{p} into linear factors with error at most {\em eps}. An overall error bound {\em eps0} is determined and iterated tree-like calls to {\em pleskenSplit} are used to get the factorization.
381557`\spad{factor(p,{} lan)} factors the polynomial \spad{p} over the extension generated by the algebraic numbers given by the list lan.
381643`\spad{factor(p,{} lan)} factors the polynomial \spad{p} over the extension generated by the algebraic numbers given by the list lan. \spad{p} is presented as a univariate polynomial with multivariate coefficients.
381785`\spad{factor(p,{} [a1,{} ...,{} an])} returns a prime factorisation of \spad{p} over the field generated by its coefficients and \spad{a1},{} ...,{} an.
381861`to be documented later.
382293`\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.
382403`\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.
382507`\spad{factor(p,{} eps,{} info)} tries to factor \spad{p} into linear factors with error at most {\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.
382589`\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.
382664`\spad{factorByRecursion(p)} factors polynomial \spad{p}. This function performs the recursion step for factorPolynomial,{} as defined in \spadtype{PolynomialFactorizationExplicit} category (see \spadfun{factorPolynomial})
382818`\spad{factorFraction(r)} factors the numerator and the denominator of the fraction \spad{r}.
382918`\spad{factorGroebnerBasis(basis)} checks whether the \spad{basis} contains reducible polynomials and uses these to split the \spad{basis}.
383035`\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.
383160`\spad{factorial(n)} returns the factorial of \spad{n},{} \spadignore{i.e.} \spad{n!}.
383268`\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}.
383329`\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.
383392`\spad{factorials(f)} rewrites the permutations and binomials in \spad{f} in terms of factorials.
383451`\spad{factorials(f)} rewrites the permutations and binomials in \spad{f} in terms of factorials.
383508`\spad{factorials(f,{} x)} rewrites the permutations and binomials in \spad{f} involving \spad{x} in terms of factorials.
383574`\spad{factorials(f,{} x)} rewrites the permutations and binomials in \spad{f} involving \spad{x} in terms of factorials.
383638`\spad{factorizationEquations(f,{}k_rows,{}k_cols)} for debugging purposes (interface LINPEN)
383765`\spad{factorizationGroebner(f,{}k_rows,{}k_cols)} for debugging purposes (interface LINPEN)
383891`\spad{factorizationSolve(f,{}k_rows,{}k_cols)} returns a (possible empty) list of solutions for an admissible transformation to create an upper right block of zeros of size \spad{k_rows} times \spad{k_cols}.
384030`\spad{factorizationTransformations(f,{}k_rows,{}k_cols,{}sol)} for debugging purposes (interface LINPEN)
384189`\spad{factorize(f,{}k)} factorizes \spad{f} in f=g*h with rank(\spad{g})\spad{=k} if possible (if necessary by using non-linear techniques).
384272`\spad{factorList(u)} returns the list of factors with flags (for use by factoring code).
384406`\spad{factorList(k,{} n,{} m,{} j)} \undocumented
384575`\spad{factorOfDegree(d,{} f)} returns a factor of degree \spad{d} of the factored polynomial \spad{f}. Such a factor shall exist.
384676`\spad{factorOfDegree(d,{} p)} returns a factor of \spad{p} of degree \spad{d}.
384772`\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 listOfDegrees.
384893`\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.
385008`\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.
385148`\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).
385296`\spad{factorPolynomial(p)} factors \spad{p} into irreducible factors over field generated by its coefficients.
385943`\spad{factorPolynomial(p)} returns the factorization into irreducibles of the univariate polynomial \spad{p}.
386079`\spad{factors(f)} analysis the block structure of the system matrix of the ALS of \spad{f} to split \spad{f} into factors.
386141`\spad{factors(a1\^e1,{} ...,{} an\^en)} returns \spad{[[a1,{} e1],{} ...,{} [an,{} en]]}.
386213`\spad{factors(a1\^e1,{} ...,{} an\^en)} returns \spad{[[a1,{} e1],{} ...,{} [an,{} en]]}.
386297`\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 \spad{unit(u)}).
386387`\spad{factorset(p)} returns the set of irreducible factors of \spad{p}.
386468`\spad{factorsOfCyclicGroupSize()} returns the factorization of size()\spad{-1}
386588`\spad{factorsOfDegree(d,{} f)} returns the factors of degree \spad{d} of the factored polynomial \spad{f}.
386696`\spad{factorSquareFree(p)} factors an extended squareFree polynomial \spad{p} over the rational numbers.
386768`\spad{factorSquareFree(p)} returns the factorization of \spad{p} which is supposed not having any repeated factor (this is not checked).
386844`\spad{factorSquareFree(p)} factorizes \spad{p} into prime factors. \spad{p} must be square free.
386931`\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 listOfDegrees. \spad{p} is supposed not having any repeated factor (this is not checked).
387032`\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{p} is supposed not having any repeated factor (this is not checked).
387127`\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{p} is supposed not having any repeated factor (this is not checked).
387247`\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{p} is supposed not having any repeated factor (this is not checked).
387361`\spad{factorSquareFreeByRecursion(p)} returns the square free factorization of \spad{p}. This functions performs the recursion step for factorSquareFreePolynomial,{} as defined in \spadtype{PolynomialFactorizationExplicit} category (see \spadfun{factorSquareFreePolynomial}).
388076`\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.
388222`\spad{failed()} returns a failed match.
388279`\spad{failed()} returns a failed match.
388330`\spad{failed?(r)} tests if \spad{r} is a failed match.
388395`\spad{failed?(r)} tests if \spad{r} is a failed match.
388454`\spad{false} is a logical constant.
388486`\spad{fffg(C,{} c,{} eta)} is version of fffg which uses sum of eta as order
388671`\spad{fffg(C,{} c,{} vd,{} K)} is the general algorithm as proposed by Beckermann and Labahn. \blankline The first argument is the list of \spad{c_}{\spad{i},{} \spad{i}}. These are the only values of \spad{C} explicitly needed in \spad{fffg}. \blankline The second argument \spad{c},{} computes \spad{c_k}(\spad{M}),{} \spadignore{i.e.} \spad{c_k}(.) is the dual basis of the vector space \spad{V},{} but also knows about the special multiplication rule as described in Equation (2). Note that the information about \spad{f} is therefore encoded in \spad{c}. \blankline \spad{vd} is modified by the routine,{} on input it is the vector of degree bounds \spad{n},{} as introduced in Definition 2.1. On output it is vector of defects (degree bound minus degree of solution). \blankline \spad{K} is requested order of solution.
388866`\spad{FG2F(a + i b)} returns \spad{a + sqrt(-1) b}.
388933`\spad{fglmIfCan(lp)} returns the lexicographical Groebner basis of \spad{lp} by using the {\em FGLM} strategy,{} if \spad{zeroDimensional?(lp)} holds .
389133`\spad{fglmIfCan(lq1)} returns the lexicographical Groebner basis of \spad{lq1} by using the {\em FGLM} strategy,{} if \spad{zeroDimensional?(lq1)} holds.
389239`\spad{fibonacci(n)} returns the \spad{n}th Fibonacci number,{} \spad{F[n]}. The Fibonacci numbers are defined by \spad{F[0] = 0},{} \spad{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.
389311`\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.
389550`\spad{fill!(u,{} x)} replaces each entry in aggregate \spad{u} by \spad{x}. The modified \spad{u} is returned as value.
389636`\spad{fill!(m,{} r)} fills \spad{m} with \spad{r}\spad{'s}
389704`\spad{fillPascalTriangle()} fills the stored table.
389770`\spad{filterUntil(p,{} t)} returns \spad{[x for x in t while not p(x)]}.
389833`\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}.
389889`\spad{filterWhile(p,{} t)} returns \spad{[x for x in t while p(x)]}.
389952`\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}.
390361`\spad{find(p,{} u)} returns the first \spad{x} in \spad{u} such that \spad{p(x)} is \spad{true},{} and "failed" otherwise.
390430`\spad{findCycle(n,{} st)} determines if st is periodic within \spad{n}.
390563`\spad{findNode(n,{} ptName)} finds a scene node
390629`\spad{findNonZeroEntry(A,{}i,{}j)} returns the indices [\spad{k},{}\spad{l}] with i<=k<=m and j<=l<=n such that A(\spad{k},{}\spad{l}) is non-zero and [0,{}0] otherwise. A is of size \spad{m} \spad{x} \spad{n}.
390775`\spad{findPoint(n,{} ptName)} find the point associated with a given string.
390835`\spad{find_relation(lf,{} k)} finds short integer relation between elements of \spad{lf} rounded to \spad{k} decimal places.
390924`\spad{finite?(\spad{a})} determines whether \spad{a} is a finite cardinal,{} \spadignore{i.e.} an integer.
390974`\spad{finite?(x)} tests if \spad{x} is finite.
391031`\spad{finite?(x)} tests if \spad{x} is finite.
391087`\spad{finiteBasis(d)} returns a basis for \spad{d} as a module over {\em K[x]}.
391155`construct finite lattice element from index
391226`construct finite lattice element from object
391280`\spad{finitePoset(c,{} s)} constructs a finite poset where the set and structure is supplied.
391348`\spad{finitePoset(c,{} p)} constructs a finite poset where the set and structure is supplied. The structure is supplied as a predicate function.
391411`\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.}
391537`\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.}
391640`\spad{first(x)} selects first component of the product
391824`\spad{first([l1]*[l2]*...[ln])} returns the Lyndon word \spad{l1}.
391908`\spad{first(x)} returns the first letter of \spad{x}.
392080`\spad{first(x)} returns the first entry of the tree \spad{x}.
392130`\spad{first(u)} returns the first element \spad{x} of \spad{u}. Note: for collections,{} \spad{first([x,{} y,{} ...,{} z]) = x}. Error: if \spad{u} is empty.
392212`\spad{first(u)} returns the first element of \spad{u} (equivalently,{} the value at the current node).
392266`\spad{first(ts)} returns the polynomial of \spad{ts} with greatest main variable if \spad{ts} is not empty,{} otherwise returns \spad{"failed"}.
392541`\spad{first(x,{} n)} returns the sequence of the first \spad{n} entries
392607`\spad{first(u,{} n)} returns a copy of the first \spad{n} elements of \spad{u}. Error: if \spad{u} has less than \spad{n} elements.
392672`\spad{first(u,{} n)} returns a copy of the first \spad{n} elements of \spad{u}.
392745`\spad{firstn(x,{} n)} returns a list of the first \spad{n} entries
392818`\spad{firstSubsetGray(n)} creates the first vector {\em ww} to start a loop using {\em nextSubsetGray(ww,{} n)}
392900`\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}.
393019`\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)])}.
393333`\spad{fixedPointExquo(f,{} g)} computes the exact quotient of \spad{f} and \spad{g} using a fixed point computation.
393420`\spad{fixedPoints(p)} returns the points fixed by the permutation \spad{p}.
393486`\spad{fixPredicate(f)} returns \spad{g} defined by \spad{g}(a) = \spad{f}(a::B).
393570`\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 flag.
393669`\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.
393759`\spad{flatten(n)} takes a second order graph,{} that is a graph whose elements are themselves graphs and create a first order graph whose vertices are the vertices of the inner graphs.
393818`\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\spad{'t} know whether \spad{2*a=0} implies \spad{a=0}.
393892`\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\spad{'t} know whether \spad{2*a=0} implies \spad{a=0}.
393963`\spad{flexibleArray(l)} creates a flexible array from the list of elements \spad{l}
394084`\spad{float?(s)} is \spad{true} if \spad{s} is an atom and belong to \spad{Flt}.
394155`\spad{float(s)} returns \spad{s} as an element of \spad{Flt}; Error: if \spad{s} is not an atom that also belongs to \spad{Flt}.
394281`\spad{float(a,{} e)} returns \spad{a * base() ^ e}.
394418`\spad{float(a,{} e,{} b)} returns \spad{a * b ^ e}.
394706`\spad{floor(x)} returns the largest integer below or equal \spad{x}.
394807`\spad{floor x} returns the largest integer \spad{<= x}.
394851`\spad{floor(x)} returns the largest integer below or equal \spad{x}.
394902`\spad{floor(x)} returns the largest integral element below \spad{x}.
394980`\spad{flush passes} all buffered data to the operating system.
395020`\spad{flush(f)} make sure that buffered data in written out to the operating system.
395131`\spad{fmecg(p1,{} e,{} r,{} p2)} returns \spad{p1 - monomial(r,{} e) * p2}.
395204`\spad{forLoop(i=1..10,{} c)} creates a representation of a FORTRAN DO loop with \spad{i} ranging over the values 1 to 10.
395281`\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}.
395378`\spad{formalDiff2(sys,{} i,{} jm)} is like the other \spadfun{\spad{formalDiff2}} but for systems.
395678`\spad{formalDiff2(f,{} i,{} jm)} formally differentiates the function \spad{f} with the Jacobi matrix \spad{jm} \spad{wrt} the \spad{i}\spad{-}th independent variable. \spad{JVars} is a list of the jet variables effectively in the result \spad{DPhi} (might be too large).
395942`\spad{formalDiff(f,{} mu)} formally differentiates \spad{f} as indicated by the multi-index \spad{mu}.
396029`\spad{formalDiff(sys,{} i)} formally differentiates a family \spad{sys} of functions \spad{wrt} the \spad{i}\spad{-}th independent variable.
396207`\spad{formalDiff(f,{} i)} formally (totally) differentiates \spad{f} \spad{wrt} the \spad{i}\spad{-}th independent variable.
396446`\spad{format(t)} extracts the \spad{fmt} section of a 2D-form \spad{t}.
396495`\spad{format(o)} creates a formatted form of the \spad{OutputForm} \spad{o}.
396545`\spad{FormatArabic(n)} forms an Arabic numeral string from an integer \spad{n}.
396612`\spad{formatConstant(op)} is a handler to format constant operators.
396707`\spad{formatConstant(op)} is a handler to format constant operators.
396806`\spad{formatExpression(p)} returns a handler \spad{h} that \spad{h(prec,{} args)} returns \spad{formatExpression(first args,{} p)}. This handler is used to change the precedence context in which the argument is formatted.
396904`\spad{formatExpression(p)} returns a handler \spad{h} that \spad{h(prec,{} args)} returns \spad{formatExpression(first args,{} p)}. This handler is used to change the precedence context in which the argument is formatted.
397006`\spad{formatExpression(o)} returns \spad{formatExpression(o,{} minPrecedence())}.
397079`\spad{formatExpression(o)} returns \spad{formatExpression(o,{} minPrecedence())}.
397156`\spad{formatExpression(o,{} p)} returns an \spadtype{OutputBox} that represent the expression \spad{o} in the respective format when considered in a context with outer precedence \spad{p}. This function is the main dispatcher function. It first checks whether \spad{o} is an integer or a string and treats these cases. Then,{} if the number \spad{n} of arguments is less than 3,{} it tries to find a handler for the top-level operator of \spad{o}. If none is found,{} it checks for a handler of an \spad{n}-ary operator. If no handler is found,{} the operator is treated as a function symbol and formatted as such.
397237`\spad{formatExpression(o,{} p)} returns an \spadtype{OutputBox} that represent the expression \spad{o} in the respective format when considered in a context with outer precedence \spad{p}. This function is the main dispatcher function. It first checks whether \spad{o} is an integer or a string and treats these cases. Then,{} if the number \spad{n} of arguments is less than 3,{} it tries to find a handler for the top-level operator of \spad{o}. If none is found,{} it checks for a handler of an \spad{n}-ary operator. If no handler is found,{} the operator is treated as a function symbol and formatted as such.
397322`\spad{formatFloat(s)} formats a floating point number from it string representation in \spadtype{OutputForm}.
397386`\spad{formatFloat(s)} formats a floating point number from it string representation in \spadtype{OutputForm}.
397454`\spad{formatFunction(b,{} args)} is supposed to create a box for \spad{"b}(args)",{} \spadignore{i.e.} format the list of arguments given by args an put it into a format that represents a function application.
397540`\spad{formatFunction(b,{} args)} is supposed to create a box for \spad{"b}(args)",{} \spadignore{i.e.} format the list of arguments given by args an put it into a format that represents a function application.
397630`\spad{formatFunctionSymbol(s)} formats an otherwise unknown function symbol.
397703`\spad{formatFunctionSymbol(s)} formats an otherwise unknown function symbol.
397780`\spad{formatInteger(n)} formats an integer.
397847`\spad{formatInteger(n)} formats an integer.
397918`\spad{FormatRadix(n,{} r)} forms a string from an integer \spad{n} in radix \spad{r}.
397984`\spad{FormatRoman(n)} forms a Roman numeral string from an integer \spad{n}.
398050`\spad{format(o,{} n)} creates a formatted form of the \spad{OutputForm} \spad{o} with step number \spad{n}.
398112`\spad{formatString(s)} formats a string.
398177`\spad{formatString(s)} formats a string.
398246`\spad{formatSymbol(s)} formats a symbol.
398311`\spad{formatSymbol(s)} formats a symbol.
398452`\spad{fortFormatHead(name,{} returnType,{} args)}
398567`\spad{fortFormatTypeLines(typeName,{} l)}
398646`\spad{fort_format_types(typeName,{} names)}
398727`\spad{fortran(fname,{} ftype,{} body)} builds an object of type \spadtype{FortranProgramCategory}. The three arguments specify the name,{} the type and the body of the program.
398809`\spad{fortranCarriageReturn()} produces a carriage return on the current Fortran output stream
398870`\spad{fortranCharacter()} returns CHARACTER,{} an element of FortranType
398919`\spad{fortranComplex()} returns COMPLEX,{} an element of FortranType
398966`\spad{fortranDouble()} returns DOUBLE PRECISION,{} an element of FortranType
399012`\spad{fortranDoubleComplex()} returns DOUBLE COMPLEX,{} an element of FortranType
399065`\spad{fortranInteger()} returns INTEGER,{} an element of FortranType
399112`\spad{fortranLiteral(s)} writes \spad{s} to the current Fortran output stream
399172`\spad{fortranLiteralLine(s)} writes \spad{s} to the current Fortran output stream,{} followed by a carriage return
399236`\spad{fortranLogical()} returns LOGICAL,{} an element of FortranType
399283`\spad{fortranReal()} returns REAL,{} an element of FortranType
399327`\spad{fortranTypeOf(u,{} tab)} returns the type of \spad{u} in tab
399391`\spad{fprindINFO }\undocumented
399576`\spad{fracPart(f)} returns the list of summands of the fractional part of \spad{f}.
399698`Format a fraction. \spad{fraction(p,{} h1,{} h2)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats the first argument by \spad{h1} and the second argument by \spad{h2}. Outer parentheses are added if \spad{p < prec}.
399864`\spad{fractionalTerms(p)} extracts the fractional part of \spad{p} to a list of Record(num : \spad{R},{} den : Factored \spad{R}). This returns [] if there is no fractional part.
399972`\spad{fractionFreeGauss(m)} performs the fraction free gaussian elimination on the matrix \spad{m},{} also known as Bareiss algorithm.
400132`\spad{fractionPart(x)} returns the fractional part of \spad{x}.
400247`\spad{fractionPart(x)} returns the fractional part of \spad{x}. \spad{x} = wholePart(\spad{x}) + fractionPart(\spad{x})
400328`\spad{fractionPart x} returns the fractional part of \spad{x}.
400379`\spad{fractionPart(x)} returns the fractional part of \spad{x}. Note: fractionPart(\spad{x}) = \spad{x} - floor(\spad{x}).
400437`\spad{fractionPart(b)} returns the fractional part of a binary expansion.
400503`\spad{fractionPart(d)} returns the fractional part of a decimal expansion.
400570`\spad{fractionPart(h)} returns the fractional part of a hexadecimal expansion.
400641`\spad{fractionPart(rx)} returns the fractional part of a radix expansion.
400710`\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...}.
400787`\spad{fractRagits(rx)} returns the ragits of the fractional part of a radix expansion.
400853`if this is a lambda term then is it free,{} that is does its variable appear in its expression
400897`\spad{freeConvolution(x,{} y)} returns the free convolution of the distributions \spad{x} and \spad{y}
400960`\spad{freeCumulant2moment(cc)} computes the sequence of moments from the sequence of free cumulants \spad{cc}
401038`\spad{freeCumulant(x,{} n)} returns the \spad{n}-th free cumulant of the distribution \spad{x}
401112`\spad{freeCumulants(x)} returns the sequence of free cumulants of the distribution \spad{x}.
401181`\spad{freeMultiplicativeConvolution(mu,{} nu)} computes the free multiplicative convolution of the distributions \spad{mu} and \spad{nu}.
401283`\spad{freeOf?(fun,{} jv)} checks whether \spad{fun} contains the jet variable \spad{jv}.
401532`\spad{freeOf?(x,{} y)} tests if \spad{x} does not contain any occurrence of \spad{y},{} where \spad{y} is a single kernel.
401589`\spad{freeOf?(x,{} s)} tests if \spad{x} does not contain any operator whose name is \spad{s}.
401651`\spad{freePoissonDistribution(a)} produces a free Poisson distribution of variance \spad{a}.
401733`the variable indicated by \spad{'s'} is free if it does not appear in node \spad{'n'} or any of its subnodes.
401796`\spad{fresnelC(f)} denotes the Fresnel integral \spad{C}
401851`\spad{fresnelC(x)} is the Fresnel integral \spad{C},{} defined by \spad{C(x) = integrate(cos(\%pi*t^2/2),{} t=0..x)}
401909`\spad{fresnelC(f)} denotes the Fresnel integral \spad{C}
402064`\spad{fresnelC(f)} denotes the Fresnel integral \spad{C}
402127`\spad{fresnelS(f)} denotes the Fresnel integral \spad{S}
402182`\spad{fresnelS(x)} is the Fresnel integral \spad{S},{} defined by \spad{S(x) = integrate(sin(\%pi*t^2/2),{} t=0..x)}
402240`\spad{fresnelS(f)} denotes the Fresnel integral \spad{S}
402395`\spad{fresnelS(f)} denotes the Fresnel integral \spad{S}
402458`\spad{frobenius(x)} computes \spad{x^q} where \spad{q} is the size of \spad{R}.
402531`\spad{Frobenius(x)} \undocumented
402654`\spad{Frobenius(a)} returns \spad{a ^ q} where \spad{q} is the \spad{size()\$F}.
402782`\spad{Frobenius(a,{} s)} returns \spad{a^(q^s)} where \spad{q} is the size()\$\spad{F}.
402863`\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.
402908`\spad{froot(f,{} n)} returns \spad{[m,{} c,{} r]} such that \spad{f^(1/n) = c * r^(1/m)}.
403049`\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 is no error check.
403098`\spad{fsqrt(f)} should be local but conditional
403164`\spad{fullDisplay(db)} prints full details of each entry in \spad{db}.
403212`\spad{fullDisplay(ic)} prints all of the information contained in \spad{ic}.
403258`\spad{fullDisplay(db,{} start,{} end )} prints full details of entries in the range \spad{start..end} in \spad{db}.
403338`\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}.
403425`\spad{function(f,{} arg)} generates a function with name \spad{f} and arguments \spad{arg}.
403493`\spad{function(e,{} foo)} creates a function \spad{foo() == e}.
403551`\spad{function(code,{} [x1,{} ...,{} xn],{} f)} returns the input form corresponding to \spad{f(x1,{} ...,{} xn) == code}.
403611`\spad{function(s,{} p,{} hh)} is meant to typeset function applications. It defaults to prefix(\spad{s},{}\spad{p},{}bracket("(",{}")",{}\spad{hh})).
403746`\spad{function(s,{} p,{} hh)} is meant to typeset function applications. It defaults to prefix(\spad{s},{}\spad{p},{}bracket("(",{}")",{}\spad{hh})).
403885`\spad{function(f,{} arg,{} show)} generates a function with name \spad{f} and arguments \spad{arg}. In the output only the first \spad{show} arguments are shown.
403971`\spad{function(e,{} foo,{} [x1,{} ...,{} xn])} creates a function \spad{foo(x1,{} ...,{} xn) == e}.
404042`\spad{function(e,{} foo,{} x)} creates a function \spad{foo(x) == e}.
404107`\spad{function(e,{} foo,{} x,{} y)} creates a function \spad{foo(x,{} y) = e}.
404179`construct graph from a list of permutations.
404250`constructor for graph with given objects more objects and arrows can be added later if required.
404423`constructor for graph with given list of object names. Use this version of the constructor if you don\spad{'t} intend to create diagrams and therefore don\spad{'t} care about \spad{x},{} \spad{y} coordinates. more objects and arrows can be added later if required.
404481`constructor for graph with given objects and arrows more objects and arrows can be added later if required.
404765`\spad{functionName returns} the name of the function given by the algebraic differential equation,{} default being \spad{f}
404842`\spad{functionName(d)} specifies the name of the function given by the algebraic differential equation or recurrence. This option is expressed in the form \spad{functionName == d}.
404893`\spad{functionNames returns} the names for the function in the algebraic dependence,{} default being \%\spad{f1},{} \%\spad{f2},{} ...
404977`\spad{functionNames(d)} specifies the names for the function in algebraic dependence. This option is expressed in the form \spad{functionNames == d}.
405035`Generates fundamental group from this simplicial complex.
405106`Generates fundamental group from this cubical complex. This works by converting to a DeltaComplex and then generating the fundamentalGroup from that. This is not the most efficient method because the conversion generates lots of higher order faceMaps which are not used. This will attempt to simplify the group presentation,{} if you don\spad{'t} want this use alternative function of same name. TODO write a faster implementation which only generates edge and square faceMaps.
405185`Generates fundamental group from this simplicial complex. This works by converting to a DeltaComplex and then generating the fundamentalGroup from that. This is not the most efficient method because the conversion generates lots of higher order faceMaps which are not used. This will attempt to simplify the group presentation,{} if you don\spad{'t} want this use alternative function of same name. For more information: \url{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/homotopy/index.\spad{htm}}
405267`Generates fundamental group from this simplicial complex.
405354`Generates fundamental group from this cubical complex. This works by converting to a DeltaComplex and then generating the fundamentalGroup from that. This is not the most efficient method because the conversion generates lots of higher order faceMaps which are not used. TODO write a faster implementation which only generates edge and square faceMaps. This version has options to: simplify - if \spad{true} attempts to simplify the group presentation trace - if \spad{true} outputs trace of simplification rules used.
405449`Generates fundamental group from this simplicial complex. This works by converting to a DeltaComplex and then generating the fundamentalGroup from that. This is not the most efficient method because the conversion generates lots of higher order faceMaps which are not used. This version has options to: simplify - if \spad{true} attempts to simplify the group presentation trace - if \spad{true} outputs trace of simplification rules used. For more information: \url{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/homotopy/index.\spad{htm}}
405547`\spad{Gamma()} returns symbol for capital greek letter gamma.
405598`\spad{gamma()} returns symbol for small greek letter gamma.
405649`\spad{gamma()} is the Euler constant
405713`\spad{Gamma(f)} returns the formal Gamma function applied to \spad{f}.
405860`\spad{Gamma(x)} is the Euler Gamma function.
405935`\spad{Gamma(x)} is the Euler Gamma function.
406057`\spad{Gamma(x)} is the Euler Gamma function.
406114`\spad{Gamma(a,{} x)} returns the incomplete Gamma function applied to a and \spad{x}.
406174`\spad{Gamma(a,{} x)} is the incomplete Gamma function.
406227`\spad{gauge(q,{} j,{} gamma)} computes the gauge corrections to the number of arbitrary functions of differentiation order \spad{j} for a system of order \spad{q} with \spad{gamma} gauge functions.
406338`\spad{gaugeHilbert(q,{} gamma)} computes the gauge correction to the Hilbert polynomial for a system of order \spad{q} with \spad{gamma} gauge functions.
406480`\spad{gaussianDistribution(a)} produces a gaussian distribution of variance \spad{a}.
406559`\spad{gbasis(pols,{} f1,{} f2)} computes a Groebner basis of \spad{pols}.
406661`\spad{gbasisExtend(pols,{} gb,{} f1,{} f2)} computes a Groebner basis of concat(\spad{pols},{} \spad{gb}) where \spad{gb} is assumed to be already a Groebner basis,{} \spadignore{i.e.} no \spad{S}-polynomials among elements of \spad{gb} will ever be considered.
406780`\spad{gcd([f1,{} ..,{} fk])} = \spad{gcd} of the polynomials \spad{fi}.
406824`\spad{gcd(lp)} computes the \spad{gcd} of the list of polynomials \spad{lp}.
406886`\spad{gcd(lp)} computes the \spad{gcd} of the list of polynomials \spad{lp}.
407249`\spad{gcd(l)} returns the common \spad{gcd} of the elements in the list \spad{l}.
407290`\spad{gcd(P,{} Q)} returns the \spad{gcd} of \spad{P} and \spad{Q}.
407374`\spad{gcd(p,{} q)} computes the \spad{gcd} of the two polynomials \spad{p} and \spad{q}.
407492`\spad{gcd(p,{} q)} computes the \spad{gcd} of the two polynomials \spad{p} and \spad{q}.
407859`\spad{gcd(x,{} y)} returns the greatest common divisor of \spad{x} and \spad{y}.
407896`\spad{gcd(a,{} b)} computes the greatest common divisor of two non negative integers \spad{a} and \spad{b}.
407942`\spad{gcd(a,{} b)} computes the greatest common divisor of two positive integers \spad{a} and \spad{b}.
407985`\spad{gcd(r,{} p)} returns the \spad{gcd} of \spad{r} and the content of \spad{p}.
408063`\spad{gcd(pol1,{} pol2,{} md)} computes \spad{gcd} of \spad{pol1} and \spad{pol2}.
408142`\spad{gcd(v1,{} v2,{} p)} computes monic \spad{gcd} of \spad{v1} and \spad{v2} modulo \spad{p}.
408231`\spad{gcd(a,{} lo,{} \spad{hi},{} p)} computes \spad{gcd} of elements a(\spad{lo}),{} a(\spad{lo+1}),{} ...,{} a(\spad{hi}).
408342`\spad{gcdBasis(lp)} computes \spad{gcd} basis of \spad{lp}
408432`\spad{gcdBasis(v)} returns basis part of \spad{gcdDecomposition(v)}.
408490`\spad{gcdcofact([f1,{} ..fk])} = \spad{gcd} and cofactors of \spad{k} univariate polynomials.
408546`\spad{gcdcofactprim([f1,{} ..fk])} = \spad{gcd} and cofactors of \spad{k} primitive polynomials.
408606`\spad{gcdDecomposition(v)} returns \spad{[b,{} t]} such that elements of \spad{b} are relatively prime and that \spad{v(i) = product(b(j)^(t(j,{} i)),{} j=1..n)}
408722`\spad{gcdDecomposition(v)} returns \spad{[b,{} t]} such that elements of \spad{b} are relatively prime and that \spad{v(i) = product(b(j)^(t(j,{} i)),{} j=1..n)}
408828`\spad{gcdPolynomial(p,{} q)} returns the \spad{GCD} of \spad{p} and \spad{q}
409558`\spad{gcdPolynomial(p,{} q)} returns the greatest common divisor (\spad{gcd}) of univariate polynomials over the domain
409689`\spad{gcdPolynomial(p,{} q)} returns the \spad{gcd} of the univariate polynomials \spad{p} \spad{qnd} \spad{q}.
409842`\spad{gcdprim([f1,{} ..,{} fk])} = \spad{gcd} of \spad{k} PRIMITIVE univariate polynomials
409890`\spad{gcdPrimitive lp} computes the \spad{gcd} of the list of primitive polynomials \spad{lp}.
409961`\spad{gcdPrimitive(p,{} q)} computes the \spad{gcd} of the primitive polynomials \spad{p} and \spad{q}.
410028`\spad{gcdPrimitive(p,{} q)} computes the \spad{gcd} of the primitive polynomials \spad{p} and \spad{q}.
410179`\spad{gderiv(f,{} [a0,{} a1,{} a2,{} ..])} returns \spad{[f(0)*a0,{} f(1)*a1,{} f(2)*a2,{} ..]}.
410268`\spad{GE(x,{} y)} returns the \spadtype{Switch} expression representing \spad{x>=y}.
410473`to be documented later.
411385`\spad{gen_ef(f_var,{} f_pol,{} cfr,{} cer)} produces linear combination
411512`\spad{generalCoefficient(action,{} f,{} k,{} p)} gives the coefficient of \spad{x^k} in \spad{p}(\spad{z})\dot \spad{f}(\spad{x}),{} where the \spad{action} of \spad{z^l} on a polynomial in \spad{x} is given by \spad{action},{} \spadignore{i.e.} \spad{action}(\spad{k},{} \spad{l},{} \spad{f}) should return the coefficient of \spad{x^k} in \spad{z^l} \spad{f}(\spad{x}).
411692`\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.
411789`\spad{generalInterpolation(l,{} CA,{} f,{} eta)} performs Hermite-Pade approximation using the given action \spad{CA} of polynomials on the elements of \spad{f}. The result is guaranteed to be correct up to order |eta|-1. Given that eta is a "normal" point,{} the degrees on the diagonal are given by eta. The degrees of column \spad{i} are in this case eta + \spad{e}.\spad{i} - [1,{} 1,{} ...,{} 1],{} where the degree of zero is \spad{-1}.
411996`\spad{generalInterpolation(C,{} CA,{} f,{} eta)} performs Hermite-Pade approximation using the given action \spad{CA} of polynomials on the elements of \spad{f}. The result is guaranteed to be correct up to order |eta|-1. Given that eta is a "normal" point,{} the degrees on the diagonal are given by eta. The degrees of column \spad{i} are in this case eta + \spad{e}.\spad{i} - [1,{} 1,{} ...,{} 1],{} where the degree of zero is \spad{-1}. \blankline The first argument \spad{C} is the list of coefficients \spad{c_}{\spad{k},{} \spad{k}} in the expansion <x^k> \spad{z} \spad{g}(\spad{x}) = sum_{\spad{i=0}}\spad{^k} \spad{c_}{\spad{k},{} \spad{i}} <x^i> \spad{g}(\spad{x}). \blankline The second argument,{} \spad{CA}(\spad{k},{} \spad{l},{} \spad{f}),{} should return the coefficient of \spad{x^k} in \spad{z^l} \spad{f}(\spad{x}).
412190`\spad{generalInterpolation(C,{} CA,{} f,{} vd,{} K)} is like \spad{generalInterpolation(C,{} CA,{} f,{} eta)} but solves up to order \spad{K} and modifies \spad{vd} to return defects of solutions
412394`\spad{generalizedContinuumHypothesisAssumed?()} tests if the hypothesis is currently assumed.
412474`\spad{generalizedContinuumHypothesisAssumed(bool)} is used to dictate whether the hypothesis is to be assumed.
412560`\spad{generalizedEigenvector(eigen,{} m)} returns the generalized eigenvectors of the matrix relative to the eigenvalue \spad{eigen},{} as returned by the function eigenvectors.
412807`\spad{generalizedEigenvector(eigen,{} m)} returns the generalized eigenvectors of the matrix relative to the eigenvalue \spad{eigen},{} as returned by the function eigenvectors.
413082`\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 the eigenvalue \spad{alpha}.
413274`\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 the eigenvalue \spad{alpha}.
413500`\spad{generalizedEigenvectors(m)} returns the generalized eigenvectors of the matrix \spad{m}.
413724`\spad{generalizedEigenvectors(m)} returns the generalized returns the generalized eigenvectors of the matrix \spad{m}.
413982`\spad{generalizedEigenvectors(m,{} fac)} returns the generalized eigenvectors of the matrix \spad{m}. fac is a factorizer for polynomials over \spad{F}.
414241`\spad{generalizedInverse(m)} returns the generalized (Moore--Penrose) inverse of the matrix \spad{m},{} \spadignore{i.e.} the matrix \spad{h} such that m*h*m=h,{} h*m*h=m,{} \spad{m*h} and \spad{h*m} are both symmetric matrices.
414340`\spad{generalizedMoebiusFunction(pp,{} zeta)} inverts the given zeta function
414522`\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.}
414611`\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.
414711`\spad{general_Lambert_product(f(x),{} a,{} d)} returns \spad{f(x^a)*f(x^(a + d))*f(x^(a + 2 d))* ...}. \spad{f(x)} should have constant coefficient equal to one and \spad{a} and \spad{d} should be positive.
415030`\spad{generalPosition(I,{} listvar)} perform a random linear transformation on the variables in listvar and returns the transformed ideal along with the change of basis matrix.
415168`\spad{generalTwoFactor(p)} returns the factorisation of polynomial \spad{p},{} a sparse univariate polynomial (sup) over a sup over \spad{F}.
415344`\spad{generator()} returns the generator.
415391`\spad{generator()} returns the generator.
415495`\spad{generator()} returns a root of the defining polynomial. This element generates the field as an algebra over the ground field.
415571`\spad{generator()} returns the generator for this domain.
415624`\spad{generator(n)} returns the \spad{n}th multiplicative generator,{} a basis term.
415689`\spad{generator(n)} returns the \spad{n}th basis term for a differential form.
415772`\spad{generator(i)} is the \spad{i}th Hall Basis element
415848`\spad{generator(d)} returns \spad{f} if \spad{(f) = d},{} "failed" if \spad{d} is not principal. \spad{d} is assumed to be of degree 0.
415930`\spad{generator(d,{} k,{} lp)} returns \spad{f} if \spad{(f) = d},{} "failed" if \spad{d} is not principal. \spad{k} is sum of orders of \spad{d} at special places. Special places are places over infinity and over zeros of polynomials in \spad{lp}. Elements of \spad{lp} are assumed to be relatively prime.
416029`\spad{generators()} returns the list of generators.
416084`\spad{generators(I)} returns a list of generators for the ideal \spad{I}.
416164`\spad{generators(gp)} returns the generators of the group {\em gp}.
416235`\spad{generic()} returns a generic element,{} \spadignore{i.e.} the linear combination of the fixed basis with the symbolic coefficients \spad{\%x1,{} \%x2,{} ..}
416306`\spad{generic?(p)} tests if \spad{p} is a single matching variable.
416353`\spad{generic(s)} returns a generic element,{} \spadignore{i.e.} the linear combination of the fixed basis with the symbolic coefficients \spad{s1,{} s2,{} ..}
416430`\spad{generic(ve)} returns a generic element,{} \spadignore{i.e.} the linear combination of \spad{ve} basis with the symbolic coefficients \spad{\%x1,{} \%x2,{} ..}
416510`\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
416595`\spad{generic(s,{} v)} returns a generic element,{} \spadignore{i.e.} the linear combination of \spad{v} with the symbolic coefficients \spad{s1,{} s2,{} ..}
416682`\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
416777`\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
416907`\spad{genericLeftMinimalPolynomial(a)} substitutes the coefficients of {em a} for the generic coefficients in \spad{leftRankPolynomial()}
417071`\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}
417194`\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}
417318`\spad{genericLeftTraceForm (a,{} b)} is defined to be \spad{genericLeftTrace (a*b)},{} this defines a symmetric bilinear form on the algebra
417448`\spad{genericPosition(lp,{} lv)} puts a radical zero dimensional ideal in general position,{} for system \spad{lp} in variables \spad{lv}.
417661`\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
417792`\spad{genericRightMinimalPolynomial(a)} substitutes the coefficients of \spad{a} for the generic coefficients in \spadfun{rightRankPolynomial}
417957`\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
418081`\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
418206`\spad{genericRightTraceForm (a,{} b)} is defined to be \spadfun{genericRightTrace (a*b)},{} this defines a symmetric bilinear form on the algebra
418337`to be documented later.
418896`\spad{gen_Monte_Carlo_check(check,{} l,{} kind,{} qvar,{} sigma,{} gen)} returns Monte Carlo \spad{check} for solutions to guessing problem. If Monte Carlo \spad{check} is unavailable returns \spad{check}.
419217`\spad{genus()} returns the genus of one absolutely irreducible component
419296`\spad{genus()} returns the genus of one absolutely irreducible component
419372`\spad{genVectorStream2} is like genVectorStream,{} but skips every second vector.
419526`\spad{genVectorStream(sumEta,{} maxEta,{} k)} generates stream of all possible non-increasing lists \spad{eta} with maximal entry \spad{maxEta} and sum of entries at most \spad{sumEta}.
419679`\spad{geometric(f)} \undocumented
419763`\spad{getArr(s)} returns a list of all the arrows (or edges) Note: different from getArrows(\spad{s}) which is inherited from FiniteGraph(\spad{S})
420018`\spad{getArrowIndex(s,{} a,{} b)} retrieves arrow index of the arrow form a to \spad{b}
420323`\spad{getArrows(s)} returns a list of all the arrows (or edges)
420531`\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".
420584`introspection: returns deBruijn index of bound variable in bound leaf node
420647`\spad{getCentre(n)} returns centre coordinate of the boundary. \spad{n:} \% is the boundary
420693`\spad{get_char(md)} returns characteristic of the field described by info \spad{md}.
420776`returns child nodes if this is a compound term otherwise returns []
420822`returns 2 child nodes if this is a compound term returns 1 child node if this is a lambda term otherwise returns []
420872`returns child nodes if this is a compound term otherwise returns []
420930`returns child nodes if this is a compound term otherwise returns []
420988`returns child nodes if this is a compound term otherwise returns []
421046`\spad{getCode(f)} returns a list of strings representing \spad{f} in Fortran notation. This is used by the FortranProgram domain.
421098`\spad{getCurve(t)} returns the \spadtype{PlottableSpaceCurveCategory} representing the parametric curve of the given tube plot \spad{t}.
421148`\spad{getDatabase("char")} returns a list of appropriate entries in the browser database. The legal values for \spad{"char"} are "o" (operations),{} \spad{"k"} (constructors),{} \spad{"d"} (domains),{} \spad{"c"} (categories) or \spad{"p"} (packages).
421220`\spad{getDialect()} return current dialect setting.
421266`\spad{get_elliptics(der,{} x)} tries to find elliptic forms on \spad{R} \spad{x} is expression for variable of integration in \spad{F}
421396`\spad{getEq f} returns the defining equation,{} if \spad{f} represents the coefficient of an ADE or a recurrence.
421447`\spad{get_extension_degree(md)} returns degree of the field described by info \spad{md} over its prime subfield.
421542`\spad{get_fort_indent()} gets current amount of Frotran indentation
421601`\spad{getGoodPrime n} returns the smallest prime not dividing \spad{n}
421689`\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}.
421767`returns indexes in face
421836`returns indexes in face with sign to give orientation
421900`returns left indexes
422005`returns intervals in face one for each dimension
422073`\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}.
422154`\spad{getMax(n)} returns maximum coordinate of the boundary. \spad{n} is the boundary
422197`returns maximum left index
422259`returns maximum right index
422322`\spad{getMin(n)} returns minimum coordinate of the boundary. \spad{n} is the boundary
422365`\spad{get_mod(pmd)} extracts field info from reduction data.
422443`returns multiplier of face
422492`\spad{getMultiplicationMatrix()} returns the multiplication table in form of a matrix.
422597`\spad{getMultiplicationMatrix()} returns the multiplication table in form of a matrix.
422693`\spad{getMultiplicationMatrix()} returns the multiplication table in form of a matrix.
422790`\spad{getMultiplicationTable()} returns the multiplication table for the normal basis of the field. This table is used to perform multiplications between field elements.
422934`\spad{getMultiplicationTable()} returns the multiplication table for the normal basis of the field. This table is used to perform multiplications between field elements.
423069`\spad{getMultiplicationTable()} returns the multiplication table for the normal basis of the field. This table is used to perform multiplications between field elements.
423205`returns the name of the variable.
423246`\spad{getNames(n)} returns a list of names for this node
423308`\spad{getNotation()} shows the currently used notation.
423490`\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])}.
423580`\spad{get_output_mode()} returns current output mode and precision
423653`\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.
423736`\spad{get_rational_roots(p)} finds rational root of \spad{p}.
423829`\spad{get_rational_roots(f,{} k)} finds rational root of \spad{f} treated as univariate polynomial in \spad{k}.
423933`\spad{getRef(f)} returns a reference containing the order to which the terms of \spad{f} have been computed.
424036`\spad{getSimplifyDenomsFlag()} gets values of flag affecting simplification of denominators. See setSimplifyDenomsFlag.
424119`\spad{getStatement(of,{} int_to_floats?)}
424198`\spad{getStream(f)} returns the stream of terms representing the series \spad{f}.
424299`\spad{getType()} returns the input form corresponding to \spad{R}
424358`returns the type of the variable. This may be a compound type,{} for instance ["a",{}\spad{"b"}] represents a-\spad{>b} a function from type a to type \spad{b} untyped implementations return []
424399`\spad{get_used_intrinsics()} gets list of used intrinsics
424521`introspection: returns value of unbound variable in unbound leaf node or bound variable in lambda term
424566`returns the variable,{} if this is not a variable then return \spad{I}
424619`\spad{getVariableOrder()} returns \spad{[[b1,{} ...,{} bm],{} [a1,{} ...,{} an]]} such that the ordering on the variables was given by \spad{setVariableOrder([b1,{} ...,{} bm],{} [a1,{} ...,{} an])}.
424839`\spad{getVert(s)} returns a list of all the vertices (or objects) of the graph \spad{s}. Note: different from getVertices(\spad{s}) which is inherited from FiniteGraph(\spad{S})
424951`\spad{getVertexIndex(s,{} o)} gives index of object \spad{o}. returns 0 if not found
425129`\spad{getVertices(s)} returns a list of all the vertices (or objects) of the graph \spad{s}.
425245`\spad{getZechTable()} returns the zech logarithm table of the field it is used to perform additions in the field quickly.
425361`\spad{getZechTable()} returns the zech logarithm table of the field. This table is used to perform additions in the field quickly.
425465`\spad{getZechTable()} returns the zech logarithm table of the field. This table is used to perform additions in the field quickly.
425559`\spad{GF2FG(a + i b)} returns \spad{a + i b} viewed as a function with the \spad{i} pushed down into the coefficient domain.
425726`\spad{glb(s,{} l)} 'greatest lower bound' or 'infimum' of \spad{l}. In this version of \spad{glb} nodes are represented as index values. Not every subset of a poset will have a \spad{glb} in which case "failed" will be returned as an error indication.
425818`\spad{gnuDraw} provides 2d plotting,{} default options
425903`\spad{gnuDraw} provides 2d plotting from list of values,{} default options
425984`\spad{gnuDraw} provides 3d surface plotting,{} default options
426091`\spad{gnuDraw} provides 2d plotting with options
426193`\spad{gnuDraw} provides 2d plotting from list of values with options
426291`\spad{gnuDraw} provides 3d surface plotting with options
426415`\spad{goodPoint([p1,{} ...,{} pn],{} q)} returns an integer a such that a is neither a pole of \spad{\spad{pi}(x,{} y)} for some \spad{i} nor a branch point of \spad{q(x,{} y) = 0}.
426488`\spad{GospersMethod(b,{} n,{} new)} returns a rational function \spad{rf(n)} such that \spad{a(n) * rf(n)} is the indefinite sum of \spad{a(n)} with respect to upward difference on \spad{n},{} \spadignore{i.e.} \spad{a(n+1) * rf(n+1) - a(n) * rf(n) = a(n)},{} where \spad{b(n) = a(n)/a(n-1)} is a rational function. Returns "failed" if no such rational function \spad{rf(n)} exists. Note: \spad{new} is a nullary function returning a new \spad{V} every time. The condition on \spad{a(n)} is that \spad{a(n)/a(n-1)} is a rational function of \spad{n}.
426580`\spad{gotoJump(l)} creates a representation of a FORTRAN GOTO statement
426634`A function to grade faces according to the number of non-degenerate intervals. This nests the lists according to their order Vertices,{} edges,{} squares and so on.
426709`a function to grade simplexes according to their lengths. This nests the lists according to their length. Vertices,{} edges,{} triangles and so on. The list is returned in reverse order,{} that is,{} it starts at highest grade and works down.
426788`return the max grade of multivector,{} for example 1 is grade 0 \spad{e1} is grade 1 e1/\e2 is grade 2 and so on
426858`\spad{x} = ((\spad{-1})^grade(\spad{x}))\spad{*x}
426921`\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 xlist.
427010`\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}.
427073`\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.
427190`\spad{graphCurves([[p0],{} [p1],{} ...,{} [pn]])} creates a \spadtype{GraphImage} from the list of lists of points indicated by \spad{p0} through \spad{pn}.
427277`\spad{graphCurves([[p0],{} [p1],{} ...,{} [pn]],{} [options])} creates a \spadtype{GraphImage} from the list of lists of points,{} \spad{p0} through \spad{pn},{} using the options specified in the list \spad{options}.
427381`\spad{graphCurves([[p0],{} [p1],{} ...,{} [pn]],{} ptColor,{} lineColor,{} ptSize,{} [options])} creates a \spadtype{GraphImage} from the list of lists of points,{} \spad{p0} through \spad{pn},{} using the options specified in the list \spad{options}. The graph point color is specified by \spad{ptColor},{} the graph line color is specified by \spad{lineColor},{} and the size of the points is specified by \spad{ptSize}.
427517`\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.
427559`\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.
427646`\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.}
427733`\spad{graphState(v,{} num,{} sX,{} sY,{} dX,{} dY,{} pts,{} lns,{} box,{} axes,{} axesC,{} un,{} unC,{} cP)} sets the state of the characteristics for the graph indicated by \spad{num} in the given two-dimensional viewport \spad{v},{} of domain \spadtype{TwoDimensionalViewport},{} to the values given as parameters. The scaling of the graph in the \spad{x} and \spad{y} component directions is set to be \spad{sX} and \spad{sY}; the window translation in the \spad{x} and \spad{y} component directions is set to be \spad{dX} and \spad{dY}; The graph points,{} lines,{} bounding \spad{box},{} \spad{axes},{} or units will be shown in the viewport if their given parameters \spad{pts},{} \spad{lns},{} \spad{box},{} \spad{axes} or \spad{un} are set to be \spad{1},{} but will not be shown if they are set to \spad{0}. The color of the \spad{axes} and the color of the units are indicated by the palette colors \spad{axesC} and \spad{unC} respectively. To display the control panel when the viewport window is displayed,{} set \spad{cP} to \spad{1},{} otherwise set it to \spad{0}.
427920`\spad{graphStates(v)} returns and shows a listing of a record containing the current state of the characteristics of each of the ten graph records in the given two-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{TwoDimensionalViewport}.
428192`\spad{green()} returns the position of the green hue from total hues.
428224`\spad{groebgen }\undocumented
428402`\spad{groebner(lp)} computes a groebner basis for a polynomial ideal generated by the list of polynomials \spad{lp}.
428483`\spad{groebner(lp)} computes a Groebner basis for the ideal generated by the list of polynomials \spad{lp}.
428584`\spad{groebner(lp)} computes a Groebner basis for the ideal generated by \spad{lp} \spad{wrt} a lexicographic ordering.
428668`\spad{groebner(lp)} returns the lexicographical Groebner basis of \spad{lp}. If \spad{lp} generates a zero-dimensional ideal then the {\em FGLM} strategy is used,{} otherwise the {\em Sugar} strategy is used.
428851`\spad{groebner(lp)} computes a Groebner basis for the ideal generated by the polynomials \spad{lp}.
428919`\spad{groebner(lq1)} returns the lexicographical Groebner basis of \spad{lq1}. If \spad{lq1} generates a zero-dimensional ideal then the {\em FGLM} strategy is used,{} otherwise the {\em Sugar} strategy is used.
429008`\spad{groebner?(I)} tests if the generators of the ideal \spad{I} are a Groebner basis.
429083`\spad{groebner(I)} returns a set of generators of \spad{I} that are a Groebner basis for \spad{I}.
429151`\spad{groebner(lp)} computes a groebner basis for a polynomial ideal generated by the list of polynomials \spad{lp}.
429231`\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 information is printed during computation.
429318`\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.
429412`\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 createGroebnerBasis} is started doing the usual updates with the factor in place of \spad{p}.
429527`\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},{} 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.
429650`\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\spad{'t} vanish. 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 createGroebnerBasis} is started doing the usual updates with the factor in place of \spad{p}.
429776`\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\spad{'t} vanish. 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 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.
429910`\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.
429993`\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}.
430171`\spad{ground?(l)} yields \spad{true},{} if \spad{l} is an element of the ground domain \spad{D}.
430236`\spad{ground(exp)} is \spad{true},{} if \spad{exp} contains only fully evaluated parts.
430293`\spad{ground(l)} returns the ground part of \spad{l}.
430663`\spad{ground?(p)} tests if polynomial \spad{p} is a member of the coefficient ring.
430727`\spad{ground?(f)} tests if \spad{f} is an element of \spad{R}.
430782`\spad{ground(p)} retracts polynomial \spad{p} to the coefficient ring.
430839`\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}.
430887`construct trivial group with no generators or relations
430943`construct free group with generators but no relations
431023`construct from generators and relations
431123`Should be local but conditional.
431279`\spad{GT(x,{} y)} returns the \spadtype{Switch} expression representing \spad{x>y}.
431638`\spad{guess l} applies recursively \spadfun{guessRat} to the successive differences and quotients of the list. Default options as described in \spadtype{GuessOptionFunctions0} are used.
432180`\spad{guess(l,{} options)} applies recursively \spadfun{guessRat} to the successive differences and quotients of the list. The given options are used.
432920`\spad{guess(l,{} guessers,{} ops)} applies recursively the given \spad{guessers} to the successive differences if ops contains the symbol guessSum and quotients if ops contains the symbol guessProduct to the list. Default options as described in \spadtype{GuessOptionFunctions0} are used.
433972`\spad{guess(l,{} guessers,{} ops)} applies recursively the given \spad{guessers} to the successive differences if ops contains the symbol \spad{guessSum} and quotients if ops contains the symbol \spad{guessProduct} to the list. The given options are used.
435064`\spad{guessADE l} tries to find an algebraic differential equation for a generating function whose first Taylor coefficients are given by \spad{l},{} using the default options described in \spadtype{GuessOptionFunctions0}.
435554`\spad{guessADE q} returns a guesser that tries to find an algebraic differential equation for a generating function whose first Taylor coefficients are given by \spad{l},{} using the given options.
436576`\spad{guessADE(l,{} options)} tries to find an algebraic differential equation for a generating function whose first Taylor coefficients are given by \spad{l},{} using the given options.
437172`\spad{guessAlg l} tries to find an algebraic equation for a generating function whose first Taylor coefficients are given by \spad{l},{} using the default options described in \spadtype{GuessOptionFunctions0}. It is equivalent to \spadfun{guessADE}(\spad{l},{} maxDerivative \spad{==} 0).
437732`\spad{guessAlg(l,{} options)} tries to find an algebraic equation for a generating function whose first Taylor coefficients are given by \spad{l},{} using the given options. It is equivalent to \spadfun{guessADE}(\spad{l},{} options) with \spad{maxDerivative == 0}.
438346`\spad{guessAlgDep ll} tries to find an algebraic dependence between several power series whose first Taylor coefficients are given by members of \spad{ll},{} using the default options described in \spadtype{GuessOptionFunctions0}.
438960`\spad{guessAlgDep ll} tries to find an algebraic dependence between several power series whose first Taylor coefficients are given by members of \spad{ll},{} using the given options.
439688`\spad{guessBinRat q} returns a guesser that tries to find a function of the form \spad{n+}->qbinomial(a+b \spad{n},{} \spad{n}) \spad{r}(\spad{n}),{} where \spad{r}(\spad{q^n}) is a \spad{q}-rational function,{} that fits \spad{l}.
439938`\spad{guessBinRat(l,{} options)} tries to find a function of the form \spad{n+}->binomial(a+b \spad{n},{} \spad{n}) \spad{r}(\spad{n}),{} where \spad{r}(\spad{n}) is a rational function,{} that fits \spad{l}.
440443`\spad{guessBinRat q} returns a guesser that tries to find a function of the form \spad{n+}->qbinomial(a+b \spad{n},{} \spad{n}) \spad{r}(\spad{n}),{} where \spad{r}(\spad{q^n}) is a \spad{q}-rational function,{} that fits \spad{l}.
441392`\spad{guessBinRat(l,{} options)} tries to find a function of the form \spad{n+}->binomial(a+b \spad{n},{} \spad{n}) \spad{r}(\spad{n}),{} where \spad{r}(\spad{n}) is a rational function,{} that fits \spad{l}.
441588`\spad{guessBinRat(l,{} options)} tries to find a function of the form \spad{n+}->binomial(a+b \spad{n},{} \spad{n}) \spad{r}(\spad{n}),{} where \spad{r}(\spad{n}) is a rational function,{} that fits \spad{l}.
442292`\spad{guessExpRat q} returns a guesser that tries to find a function of the form \spad{n+}->(a+b \spad{q^n})\spad{^n} \spad{r}(\spad{q^n}),{} where \spad{r}(\spad{q^n}) is a \spad{q}-rational function,{} that fits \spad{l}.
442542`\spad{guessExpRat l} tries to find a function of the form \spad{n+}->(a+b \spad{n})\spad{^n} \spad{r}(\spad{n}),{} where \spad{r}(\spad{n}) is a rational function,{} that fits \spad{l}.
443047`\spad{guessExpRat q} returns a guesser that tries to find a function of the form \spad{n+}->(a+b \spad{q^n})\spad{^n} \spad{r}(\spad{q^n}),{} where \spad{r}(\spad{q^n}) is a \spad{q}-rational function,{} that fits \spad{l}.
443996`\spad{guessExpRat(l,{} options)} tries to find a function of the form \spad{n+}->(a+b \spad{n})\spad{^n} \spad{r}(\spad{n}),{} where \spad{r}(\spad{n}) is a rational function,{} that fits \spad{l}.
444192`\spad{guessExpRat(l,{} options)} tries to find a function of the form \spad{n+}->(a+b \spad{n})\spad{^n} \spad{r}(\spad{n}),{} where \spad{r}(\spad{n}) is a rational function,{} that fits \spad{l}.
444798`\spad{guessFE l} tries to find an algebraic substitution equation for a generating function whose first Taylor coefficients are given by \spad{l},{} using the default options described in \spadtype{GuessOptionFunctions0}.
445352`\spad{guessFE(l,{} options)} tries to find an algebraic substitution equation for a generating function whose first Taylor coefficients are given by \spad{l},{} using the given options.
446107`\spad{guessHolo l} tries to find an ordinary linear differential equation for a generating function whose first Taylor coefficients are given by \spad{l},{} using the default options described in \spadtype{GuessOptionFunctions0}. It is equivalent to \spadfun{guessADE}\spad{(l,{} maxPower == 1)}.
446602`\spad{guessHolo q} returns a guesser that tries to find a linear differential equation for a generating function whose first Taylor coefficients are given by \spad{l},{} using the given options.
447630`\spad{guessHolo(l,{} options)} tries to find an ordinary linear differential equation for a generating function whose first Taylor coefficients are given by \spad{l},{} using the given options. It is equivalent to \spadfun{guessADE}\spad{(l,{} options)} with \spad{maxPower == 1}.
448232`\spad{guessPade(l,{} options)} tries to find a rational function whose first Taylor coefficients are given by \spad{l},{} using the default options described in \spadtype{GuessOptionFunctions0}. It is equivalent to \spadfun{guessADE}\spad{(l,{} options)} with \spad{maxDerivative == 0,{} maxPower == 1,{} allDegrees == true}.
448798`\spad{guessPade(l,{} options)} tries to find a rational function whose first Taylor coefficients are given by \spad{l},{} using the given options. It is equivalent to \spadfun{guessADE}\spad{(l,{} maxDerivative == 0,{} maxPower == 1,{} allDegrees == true)}.
449561`\spad{guessPRec l} tries to find a linear recurrence with polynomial coefficients whose first values are given by \spad{l},{} using the default options described in \spadtype{GuessOptionFunctions0}. It is equivalent to \spadfun{guessRec}\spad{(l,{} maxPower == 1)}.
450056`\spad{guessPRec q} returns a guesser that tries to find a linear \spad{q}-recurrence with polynomial coefficients whose first values are given by \spad{l},{} using the given options. It is equivalent to \spadfun{guessRec}\spad{(q)} with \spad{maxPower == 1}.
451084`\spad{guessPRec(l,{} options)} tries to find a linear recurrence with polynomial coefficients whose first values are given by \spad{l},{} using the given options. It is equivalent to \spadfun{guessRec}\spad{(l,{} options)} with \spad{maxPower == 1}.
451844`\spad{guessRat l} tries to find a rational function whose first values are given by \spad{l},{} using the default options described in \spadtype{GuessOptionFunctions0}. It is equivalent to \spadfun{guessRec}\spad{(l,{} maxShift == 0,{} maxPower == 1,{} allDegrees == true)}.
452334`\spad{guessRat q} returns a guesser that tries to find a \spad{q}-rational function whose first values are given by \spad{l},{} using the given options. It is equivalent to \spadfun{guessRec} with \spad{(l,{} maxShift == 0,{} maxPower == 1,{} allDegrees == true)}.
453356`\spad{guessRat(l,{} options)} tries to find a rational function whose first values are given by \spad{l},{} using the given options. It is equivalent to \spadfun{guessRec}\spad{(l,{} maxShift == 0,{} maxPower == 1,{} allDegrees == true)}.
454112`\spad{guessRec l} tries to find an ordinary difference equation whose first values are given by \spad{l},{} using the default options described in \spadtype{GuessOptionFunctions0}.
454602`\spad{guessRec q} returns a guesser that finds an ordinary \spad{q}-difference equation whose first values are given by \spad{l},{} using the given options.
455624`\spad{guessRec(l,{} options)} tries to find an ordinary difference equation whose first values are given by \spad{l},{} using the given options.
456226`\spad{hahn_p(n,{} a,{} b,{} bar_a,{} bar_b,{} z)} is the continuous Hahn polynomial.
456293`\spad{hahn_p(n,{} a,{} b,{} bar_a,{} bar_b,{} z)} is the continuous Hahn polynomial.
456353`\spad{hahnQ(n,{} a,{} b,{} N,{} z)} is the Hahn polynomial.
456419`\spad{hahnQ(n,{} a,{} b,{} N,{} z)} \spad{s} the Hahn polynomial.
456478`\spad{hahnR(n,{} c,{} d,{} N,{} z)} is the dual Hahn polynomial.
456544`\spad{hahnR(n,{} c,{} d,{} N,{} z)} is the dual Hahn polynomial.
456603`\spad{hahnS(n,{} a,{} b,{} c,{} z)} is the continuous dual Hahn polynomial.
456669`\spad{hahnS(n,{} a,{} b,{} c,{} z)} is the continuous dual Hahn polynomial.
456728`\spad{halfExtendedResultant1(a,{} b)} returns \spad{[r,{} ca]} such that \spad{extendedResultant(a,{} b)} returns \spad{[r,{} ca,{} cb]}
456854`\spad{halfExtendedResultant2(a,{} b)} returns \spad{[r,{} ca]} such that \spad{extendedResultant(a,{} b)} returns \spad{[r,{} ca,{} cb]}
456980`\spad{halfExtendedSubResultantGcd1(a,{} b)} returns \spad{[g,{} ca]} such that \spad{extendedSubResultantGcd(a,{} b)} returns \spad{[g,{} ca,{} cb]}
457106`\spad{halfExtendedSubResultantGcd1(a,{} b)} returns \spad{[g,{} ca]} if \spad{extendedSubResultantGcd(a,{} b)} returns \spad{[g,{} ca,{} cb]} otherwise produces an error.
457234`\spad{halfExtendedSubResultantGcd2(a,{} b)} returns \spad{[g,{} cb]} such that \spad{extendedSubResultantGcd(a,{} b)} returns \spad{[g,{} ca,{} cb]}
457360`\spad{halfExtendedSubResultantGcd2(a,{} b)} returns \spad{[g,{} cb]} if \spad{extendedSubResultantGcd(a,{} b)} returns \spad{[g,{} ca,{} cb]} otherwise produces an error.
457488`\spad{handle_imaginary(d)} should be local but conditional.
457667`\spad{handler(x,{} n,{} op)} is only valid if \spad{knownHandler?(n,{} op)} is \spad{true}. It returns the respective handler stored in \spad{x}.
457743`\spad{hankelDeterminant(x,{} n)} returns the \spad{n}th Hankel determinant of the sequence \spad{x}.
457828`\spad{hankelDeterminants(x)} returns the stream of hankel determinants of the distribution \spad{x}.
457900`\spad{hankelH1(v,{} z)} is first Hankel function (Bessel function of the third kind).
457963`\spad{hankelH1(v,{} z)} is first Hankel function (Bessel function of the third kind).
458019`\spad{hankelH2(v,{} z)} is the second Hankel function (Bessel function of the third kind).
458082`\spad{hankelH2(v,{} z)} is the second Hankel function (Bessel function of the third kind).
458138`\spad{hankelIndices(p)} returns a list of all left and right factors of the monomials of a given multivariate noncommutative polynomial. Factorization: \spad{w} = u*v
458260`\spad{HankelMatrix([a_0,{} a_1,{} a_2,{} ...,{} a_{2n}])} builds the Hankel matrix [ \spad{a0},{} \spad{a1},{} ...,{} an ] [ \spad{a1},{} \spad{a2},{} ... ] [ ... ] [ an,{} ...,{} a2n]
458325`\spad{hankelMatrix(p)} returns the Hankel matrix \spad{H}(\spad{p}) of given polynomial \spad{p},{} \spadignore{i.e.} the entries at (\spad{u},{}\spad{v}) are the coefficients of the monomials \spad{w} = u*v. Rows and columns are indexed by words.
458434`\spad{hankelMatrix(p,{}x)} returns a matrix with the entries of the coefficients of \spad{p} at (\spad{u},{}\spad{v}) where the monomials factorizes through \spad{w} = u*x*v. This matrix is indexed by all words of the Hankel matrix.
458547`\spad{hankelSystem(p)} creates a Hankel-matrix for the polynomial \spad{p} with respect to the basis of all factors in \spad{p}. Row- and column-indices can be different.
458720`\spad{harmonic(n)} returns the \spad{n}th harmonic number. This is \spad{H[n] = sum(1/k,{} k=1..n)}.
458801`\spad{has?(op,{} s)} tests if property \spad{s} is attached to \spad{op}.
458854`\spad{hasDimension?(c)} returns \spad{true} if \spad{c} is of positive dimension (that is one-dimensional),{} otherwise hasDimension?(\spad{c}) returns \spad{false}
458924`\spad{hasDimension?(c)} returns \spad{true} if \spad{c} is of positive dimension. Otherwise hasDimension?(\spad{c}) returns \spad{false}.
458987`\spad{hash(s)} calculates a hash code for \spad{s}.
459080`\spad{hasHi(s)} tests whether the segment \spad{s} has an upper bound.
459272`\spad{hashUpdate!(hs,{} s)} computes new HashState from old and \spad{s} used for incremental computation of hash values. hashUpdate! might destructively work on its first argument.
459622`\spad{hasoln(g,{} l)} tests whether the quasi-algebraic set defined by \spad{p} = 0 for \spad{p} in \spad{g} and \spad{q} \spad{~=} 0 for \spad{q} in \spad{l} is empty or not and returns a simplified definition of the quasi-algebraic set
459752`\spad{has_op?(f,{} s)} returns \spad{true} is \spad{f} is a composite from with operator \spad{s},{} otherwise returns \spad{false}
459819`\spad{hasPredicate?(p)} tests if \spad{p} has predicates attached to it.
459871`\spad{hasSolution?(A,{} B)} tests if the linear system \spad{AX = B} has a solution.
459959`\spad{hasSolution?(A,{} B)} tests if the linear system \spad{AX = B} has a solution.
460042`\spad{hasTopPredicate?(p)} tests if \spad{p} has a top-level predicate.
460097`\spad{Hausdorff(a,{} b,{} n)} returns log(exp(a)*exp(\spad{b})) truncated at order \spad{n}.
460197`\spad{hcenter(w)(box)} centers the box horizontally inside a box of width \spad{w}.
460258`\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}.
460300`\spad{hconcat(lbox)} aligns the boxes at their baseline and concats those boxes horizontally from left to right.
460345`\spad{hconcat(u)} horizontally concatenates all forms in list \spad{u}.
460391`\spad{hconcat(f,{} g)} horizontally concatenate forms \spad{f} and \spad{g}.
460433`\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}.
460475`\spad{hdmpToDmp(p)} converts \spad{p} from a \spadtype{HDMP} to a \spadtype{DMP}.
460608`\spad{hdmpToP(p)} converts \spad{p} from a \spadtype{HDMP} to a \spadtype{POLY}.
460772`\spad{head(l)} returns the first element of a doubly-linked aggregate \spad{l}. Error: if \spad{l} is empty.
460823`\spad{head(p)} returns \spad{p} if \spad{p} belongs to \spad{R},{} otherwise returns its leading term (monomial in the FriCAS sense),{} where \spad{p} is viewed as a univariate polynomial in its main variable.
461014`\spad{headReduce(a,{} b)} returns a polynomial \spad{r} such that \spad{headReduced?(r,{} b)} holds and there exists an integer \spad{e} such that \spad{init(b)^e a - r} is zero modulo \spad{b}.
461083`\spad{headReduce(p,{} ts)} returns a polynomial \spad{r} such that \spad{headReduce?(r,{} ts)} holds and there exists some product \spad{h} of \spad{initials(ts)} such that \spad{h*p - r} lies in the ideal generated by \spad{ts}.
461217`\spad{headReduced?(ts)} returns \spad{true} iff the head of every element of \spad{ts} is reduced with respect to any other element of \spad{ts}.
461515`\spad{headReduced?(a,{} b)} returns \spad{true} iff \spad{degree(head(a),{} mvar(b)) < mdeg(b)}.
461592`\spad{headReduced?(q,{} lp)} returns \spad{true} iff \spad{headReduced?(q,{} p)} holds for every \spad{p} in \spad{lp}.
461675`\spad{headReduced?(p,{} ts)} returns \spad{true} iff the head of \spad{p} is reduced \spad{ts} \spad{ts}.
461837`\spad{headRemainder(a,{} ps)} returns \spad{[b,{} r]} such that the leading monomial of \spad{b} is reduced in the sense of Groebner bases with respect to \spad{ps} and \spad{r*a - b} lies in the ideal generated by \spad{ps}.
461949`\spad{heap(ls)} creates a heap of elements consisting of the elements of \spad{ls}.
461989`\spad{heapSort(f,{} agg)} sorts the aggregate agg with the ordering function \spad{f} using the heapsort algorithm.
462065`\spad{height(k)} returns the nesting level of \spad{k}.
462128`\spad{height(box)} returns the height of the \spad{box} (above the baseline) including the baseline.
462246`\spad{height(p)} returns the maximal absolute value of the coefficients of the polynomial \spad{p}.
462317`\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},{} ...,{} \spad{fn},{} \spad{op(f1,{} ...,{} fn)} has height equal to \spad{1 + max(height(f1),{} ...,{} height(fn))}.
462382`\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).
462521`\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 > bound. No recombining is done .
462641`\spad{hensel_update(v,{} p,{} r)} performs one step of Hensel lifting
462724`\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)}.
462825`\spad{hermite(m)} returns the Hermite normal form of the matrix \spad{m}.
462883`\spad{hermiteH(n,{} z)} is the Hermite polynomial.
462946`\spad{hermiteH(n,{} z)} is the Hermite polynomial.
463002`\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..)}.
463084`\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 with respect to \spad{D},{} and all the squarefree factors of the denominator of \spad{s} are special with respect to \spad{D}. Furthermore,{} \spad{h} and \spad{s} have no polynomial parts. \spad{D} is the derivation to use on \spadtype{UP}.
463262`\spad{HermiteIntegrate(f,{} ')} returns \spad{[g,{} h]} such that \spad{f = g' + h} and \spad{h} has a only simple finite normal poles.
463375`\spad{HermiteIntegrate(f,{} D,{} d0)} returns \spad{[g,{} h,{} s,{} p]} such that \spad{f = Dg + g*d0 + h + s + p},{} \spad{h} has a squarefree denominator normal with respect to \spad{D},{} and all the squarefree factors of the denominator of \spad{s} are special with respect to \spad{D}. Furthermore,{} \spad{h} and \spad{s} have no polynomial parts. \spad{D} is the derivation to use on \spadtype{UP}.
463556`\spad{HermiteIntegrate(f,{} ',{} d0)} returns \spad{[g,{} h]} such that \spad{f = g' + d0*g + h} and \spad{h} has a only simple finite normal poles. Note: \spad{d0} must be integral.
463671`\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 xlist.
463759`\spad{hex(r)} converts a rational number to a hexadecimal expansion.
463821`\spad{hexDigit()} returns the class of all characters for which \spadfunFrom{hexDigit?}{Character} is \spad{true}.
463865`\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}.
463912`\spad{high(s)} returns the second endpoint of \spad{s}. Note: \spad{high(l..h) = h}.
463957`\spad{hilbert(cc)} computes the Hilbert polynomial to the Cartan characters \spad{cc}.
464075`\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}.
464142`\spad{hMonic }\undocumented
464216`\spad{hMonic(p)} tries to remove content from \spad{p}
464283`\spad{homo_fact(p)} factors homogeneous polynomial \spad{p} into irreducible factors.
464398`\spad{homogeneous?(p)} tests if all of the terms of \spad{p} have the same degree.
464455`\spad{homogeneous?(df)} tests if all of the terms of differential form \spad{df} have the same degree.
464530`\spad{homogeneous returns} whether we allow only homogeneous algebraic differential equations,{} default being \spad{false}
464630`\spad{homogeneous(d)} specifies whether we allow only homogeneous algebraic differential equations. This option is expressed in the form \spad{homogeneous == d}. If \spad{true},{} then maxPower must be set,{} too,{} and ADEs with constant total degree are allowed. If a PositiveInteger is given,{} only ADE\spad{'s} with this total degree are allowed.
464704`construct empty homology,{} useful in validation code
464743`calculate homology using SmithNormalForm
464799`calculate homology using SmithNormalForm
464859`calculate homology using SmithNormalForm
464927`calculate homology using SmithNormalForm For more information: \url{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/homology/index.\spad{htm}}
464998`construct from lists
465089`construct \spad{C2} homology,{} useful in validation code
465129`construct from differential over integers uses method described by Waldek Hebisch here: https://groups.google.com/forum/?hl=en\#!topic/fricas-devel/mLOdQ-\spad{fwbO0}
465203`construct \spad{Z} homology,{} useful in validation code
465242`construct \spad{Z+C2} homology,{} useful in validation code
465283`construct \spad{Z*Z} homology,{} useful in validation code
465399`\spad{horizConcat(l)} horizontally concatenates all members of \spad{l} Error: if the arrays do not have the same number of rows.
465549`\spad{horizConcat(x,{} y)} horizontally concatenates two arrays with an equal number of rows. The entries of \spad{y} appear to the right of the entries of \spad{x}. Error: if the arrays do not have the same number of rows.
465623`\spad{horizJoin(A,{} B)} horizontally concats the matrices \spad{A} and \spad{B}. It is assumed that all indices of \spad{B} are smaller than those of \spad{A}.
465681`\spad{horizSplit(A,{} c)} splits the matrix \spad{A} into two at the column given by \spad{c}. The first column of the right matrix is enumerated by the first index less or equal to \spad{c}.
465952`\spad{horizSplit(a,{} [n1,{} n2,{} ...,{} \spad{ni}])} splits a into arrays having \spad{n1},{} ...,{} \spad{ni} columns. Error: if number of columns of a is different than \spad{n1} + ... + \spad{ni}.
466054`\spad{horizSplit(a,{} n)} splits a into \spad{n} arrays of equal size column wise. Error: if number of columns of a is not divisible by \spad{n}.
466147`\spad{hp_solve(lv,{} eta,{} K)} solves Hermite-Pade problem with degree bound \spad{eta} up to order \spad{K}.
466359`\spad{HP_solve(l,{} degs,{} kind,{} sigma,{} gen check)} finds a \spad{sigma} basis with degree bounds given by \spad{degs}. It returns \spad{false} if there is no interpolating vector that is correct up to (and including) \spad{z^}(\spad{sigma}-1) with \spad{sigma} \spad{>=} |degs+[1,{} 1,{} ...,{} 1]| or if check rejects all solutions. It returns \spad{true} if it can not handle given problem.
466658`HP_solve_A is a fake solver over algebraic numbers.
466983`\spad{HP_solve_I implements} HP_solve over integers.
467294`\spad{HP_solve_M implements} HP_solve over \$\spad{Z_p}\$ with machine-sized \$\spad{p}\$.
467603`\spad{HP_solve_P implements} HP_solve over integer polynomials.
467957`HP_solve_PA is a fake solver over polynomials having algebraic coefficients.
468336`\spad{hspace(n)} creates white space of width \spad{n}.
468381`\spad{htrigs(f)} converts all the exponentials in \spad{f} into hyperbolic sines and cosines.
468442`\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.
468490`\spad{hue(p)} returns the hue field of the indicated palette \spad{p}.
468527`\spad{hue(c)} returns the hue index of the indicated color \spad{c}.
468564`\spad{hyperelliptic()} returns \spad{p(x)} if the curve is the hyperelliptic defined by \spad{y^2 = p(x)},{} "failed" otherwise.
468651`\spad{hyperelliptic()} returns \spad{p(x)} if the curve is the hyperelliptic defined by \spad{y^2 = p(x)},{} "failed" otherwise.
468952`\spad{hypergeometricF(la,{} lb,{} z)} is the generalized hypergeometric function.
469065`\spad{hypergeometricF(la,{} lb,{} z)} is the generalized hypergeometric function.
469171`Constructs a \spad{I} combinator
469212`\spad{iAiryAi(x)} should be local but conditional.
469272`\spad{iAiryAiPrime(x)} should be local but conditional.
469337`\spad{iAiryBi(x)} should be local but conditional.
469397`\spad{iAiryBiPrime(x)} should be local but conditional.
469462`\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.
469533`\spad{id x} is \spad{x}.
469576`\spad{ideal([f1,{} ...,{} fn])} returns the ideal \spad{(f1,{} ...,{} fn)}.
469637`\spad{ideal(D)} returns the ideal corresponding to a divisor \spad{D}.
469737`\spad{ideal(polyList)} constructs the ideal generated by the list of polynomials \spad{polyList}.
469812`\spad{idealiser(m1,{} m2)} computes the order of an ideal defined by \spad{m1} and \spad{m2}
469896`\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
469982`\spad{idealiserMatrix(m1,{} m2)} returns the matrix representing the linear conditions on the Ring associated with an ideal defined by \spad{m1} and \spad{m2}.
470072`\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\spad{'s} algorithm.
470144`\spad{identification(g,{} h)} returns the list of equations \spad{g_i = h_i},{} where \spad{g_i} (resp. \spad{h_i}) are exponential coordinates of \spad{g} (resp. \spad{h}).
470230`\spad{identity()} returns the identity element which is do nothing transform
470274`\spad{identity()} create the identity dhmatrix
470330`\spad{identityMatrix(n)} create an identity matrix we note that this must be square
470420`\spad{identitySquareMatrix(s,{} p)} \undocumented{}
470597`\spad{iexactQuo(x,{} y)} should be local but conditional
470669`\spad{iexactQuo(x,{} y)} should be local but conditional
470740`\spad{iexactQuo(x,{} y)} should be local but conditional
470830`\spad{iexactQuo(x,{} y)} should be local but conditional
470919`\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)}.
471012`\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.
471082`\spad{iiabs(x)} should be local but conditional.
471140`\spad{iiacos(x)} should be local but conditional
471192`\spad{iiacosh(x)} should be local but conditional
471245`\spad{iiacot(x)} should be local but conditional
471297`\spad{iiacoth(x)} should be local but conditional
471350`\spad{iiacsc(x)} should be local but conditional
471402`\spad{iiacsch(x)} should be local but conditional
471455`\spad{iiAiryAi(x)} should be local but conditional.
471516`\spad{iiAiryAiPrime(x)} should be local but conditional.
471582`\spad{iiAiryBi(x)} should be local but conditional.
471643`\spad{iiAiryBiPrime(x)} should be local but conditional.
471709`\spad{iiasec(x)} should be local but conditional
471761`\spad{iiasech(x)} should be local but conditional
471814`\spad{iiasin(x)} should be local but conditional
471866`\spad{iiasinh(x)} should be local but conditional
471919`\spad{iiatan(x)} should be local but conditional
471971`\spad{iiatanh(x)} should be local but conditional
472024`\spad{iiBesselI(x)} should be local but conditional.
472092`\spad{iiBesselJ(x)} should be local but conditional.
472160`\spad{iiBesselK(x)} should be local but conditional.
472228`\spad{iiBesselY(x)} should be local but conditional.
472296`\spad{iiBeta(x)} should be local but conditional.
472361`\spad{iibinom(l)} should be local but conditional.
472423`\spad{iiconjugate(x)} should be local but conditional.
472487`\spad{iicos(x)} should be local but conditional
472538`\spad{iicosh(x)} should be local but conditional
472590`\spad{iicot(x)} should be local but conditional
472641`\spad{iicoth(x)} should be local but conditional
472693`\spad{iicsc(x)} should be local but conditional
472744`\spad{iicsch(x)} should be local but conditional
472796`\spad{iidigamma(x)} should be local but conditional.
472858`\spad{iidprod(l)} should be local but conditional.
472920`\spad{iidsum(l)} should be local but conditional.
472981`\spad{iiexp(x)} should be local but conditional
473032`\spad{iifact(x)} should be local but conditional.
473087`\spad{iiGamma(x)} should be local but conditional.
473147`\spad{iiHypergeometricF(l)} should be local but conditional.
473223`\spad{iilog(x)} should be local but conditional
473274`should be local but conditional
473346`\spad{iiperm(l)} should be local but conditional.
473407`\spad{iipolygamma(x)} should be local but conditional.
473477`\spad{iiPolylog(x,{} s)} should be local but conditional.
473541`\spad{iipow(l)} should be local but conditional.
473601`should be local but conditional
473701`\spad{iisec(x)} should be local but conditional
473752`\spad{iisech(x)} should be local but conditional
473804`\spad{iisin(x)} should be local but conditional
473855`\spad{iisinh(x)} should be local but conditional
473907`\spad{iisqrt2()} should be local but conditional
473959`\spad{iisqrt3()} should be local but conditional
474011`\spad{iitan(x)} should be local but conditional
474062`\spad{iitanh(x)} should be local but conditional
474114`\spad{iLambertW(x)} should be local but conditional.
474176`\spad{imag(f)} returns the imaginary part of \spad{f} where \spad{f} is a complex function.
474253`\spad{imag(f)} returns the imaginary part of \spad{f} where \spad{f} is a complex function.
474311`\spad{imag(x)} returns imaginary part of \spad{x}.
474356`\spad{imagE(o)} extracts the imaginary \spad{E} part of octonion \spad{o}.
474403`\spad{imagI(o)} extracts the imaginary \spad{I} part of octonion \spad{o}.
474450`\spad{imagi(o)} extracts the \spad{i} part of octonion \spad{o}.
474497`\spad{imagI(q)} extracts the imaginary \spad{i} part of quaternion \spad{q}.
474593`\spad{imaginary()} = sqrt(\spad{-1}) = \%\spad{i}.
474642`\spad{imagJ(o)} extracts the imaginary \spad{J} part of octonion \spad{o}.
474689`\spad{imagj(o)} extracts the \spad{j} part of octonion \spad{o}.
474736`\spad{imagJ(q)} extracts the imaginary \spad{j} part of quaternion \spad{q}.
474785`\spad{imagK(o)} extracts the imaginary \spad{K} part of octonion \spad{o}.
474832`\spad{imagk(o)} extracts the \spad{k} part of octonion \spad{o}.
474879`\spad{imagK(q)} extracts the imaginary \spad{k} part of quaternion \spad{q}.
474928`\spad{implies(a,{} b)} returns the logical implication of ILogic a and \spad{b}. a is premise,{} \spad{b} is conclusion,{} result is \spad{false} (contradiction) if premise=true and conclusion=false does not mean there is a causal connection
474966`\spad{implies(a,{} b)} returns the logical implication of Boolean \spad{a} and \spad{b}.
475162`\spad{in?(I,{} J)} tests if the ideal \spad{I} is contained in the ideal \spad{J}.
475233`\spad{inBounds?(pt,{} mns,{} mxs)} returns \spad{true} if \spad{pt} is inside bounding box where bounding box is specified by min and max.
475289`\spad{inc(x)} returns \spad{x + 1}.
475334`\spad{incFail(s,{} o)} is an internal function that steps the number of failed tests and records in- and output.
475402`\spad{incFatal s} is an internal function that steps the number of fatal tests and records input.
475454`\spad{incidenceAlgebra(A,{} ss)} constructs an adjacency matrix with with indices \spad{ss} and Matrix A
475530`\spad{incidenceAlgebra(A,{} ss)} constructs an adjacency matrix with with indices \spad{ss} and Matrix A
475685`\spad{incidenceMatrix(s)} represents graph \spad{s} by a matrix of size \spad{|V|} by |E| where: V=number of vertices E=number of edges entry [vertex,{} arrow] = arrow endpoint data (undirected case case: 1 - incident,{} 0 - not incident,{} directed case: \spad{-1} - start,{} 1 - end,{} 0 - not incident).
475751`incLibraryError is an internal function that steps the number of failed tests,{} but not the number of tests.
475827`\spad{inconsistent?(pl)} returns \spad{true} if the system of equations \spad{p} = 0 for \spad{p} in \spad{pl} is inconsistent. It is assumed that \spad{pl} is a groebner basis.
475917`\spad{inconsistent?(pl)} returns \spad{true} if the system of equations \spad{p} = 0 for \spad{p} in \spad{pl} is inconsistent. It is assumed that \spad{pl} is a groebner basis.
476018`incPass is an internal function that steps the number of passed tests.
476063`\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}.
476114`\spad{increasePrecision(n)} increases the current \spadfunFrom{precision}{FloatingPointSystem} by \spad{n} decimal digits.
476218`\spad{increment()} produces a function which adds \spad{1} to whatever argument it is given. For example,{} if {\spad{f} \spad{:=} increment()} then \spad{f x} is \spad{x+1}.
476273`\spad{incrementBy(n)} produces a function which adds \spad{n} to whatever argument it is given. For example,{} if {\spad{f} \spad{:=} increment(\spad{n})} then \spad{f x} is \spad{x+n}.
476331`\spad{incrementKthElement(S,{} k)} increments the \spad{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.
476432`incTest is an internal function that steps the test number.
476477`\spad{incXfFail()} is an internal function that steps the number expected failures.
476524`incXfFatal is like incFatal,{} but for expected failures.
476578`incXfLibraryError is like incLibraryError,{} but using expected failures.
476656`\spad{incXfPass(s,{} o)} is an internal function that steps the number of tests that passed but were expected to fail and records in- and output.
476878`\spad{inDegree(s,{} a)} gives the number of arrows leading in to node 'a' in graph \spad{'s'}
476959`\spad{indentFortLevel(i)}
477022`\spad{index(x)} \undocumented
477135`\spad{index(jv)} yields number of the jet variable \spad{jv}.
477397`\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 establishes a bijection between the elements of the finite set and \spad{1..size()}.
477629`\spad{index(n,{} m)} is a index function for vectors of length \spad{n} over the ground field.
477730`\spad{index?(i,{} u)} tests if \spad{i} is an index of aggregate \spad{u}.
477800`\spad{indexes(me)} returns indexes into pointList(\spad{me})
477871`\spad{indexName returns} the name of the index variable used for the formulas,{} default being \spad{n}
477945`\spad{indexName(d)} specifies the index variable used for the formulas. This option is expressed in the form \spad{indexName == d}.
478054`\spad{indexToObject returns} the object at a given index.
478237`\spad{indices(A)} returns the indices of the incidence matrix A
478370`\spad{indices(u)} returns a list of indices of aggregate \spad{u} in no particular order.
478439`\spad{indiceSubResultant(P,{} Q,{} i)} returns the subresultant of indice \spad{i}
478541`\spad{indiceSubResultant(P,{} Q,{} i)} returns the subresultant \spad{S_i(P,{} Q)} and carries out the equality \spad{coef1*P + coef2*Q = S_i(P,{} Q)}
478695`\spad{indicialEquation(op,{} a)} returns the indicial equation of \spad{op} at \spad{a}.
478762`\spad{indicialEquation(op,{} a)} returns the indicial equation of \spad{op} at \spad{a}.
478830`\spad{indicialEquationAtInfinity op} returns the indicial equation of \spad{op} at infinity.
478946`\spad{indicialEquationAtInfinity op} returns the indicial equation of \spad{op} at infinity.
479065`\spad{indicialEquations op} returns \spad{[[d1,{} e1],{} ...,{} [dq,{} eq]]} where the \spad{d_i}\spad{'s} are the affine singularities of \spad{op},{} and the \spad{e_i}\spad{'s} are the indicial equations at each \spad{d_i}.
479164`\spad{indicialEquations op} returns \spad{[[d1,{} e1],{} ...,{} [dq,{} eq]]} where the \spad{d_i}\spad{'s} are the affine singularities of \spad{op},{} and the \spad{e_i}\spad{'s} are the indicial equations at each \spad{d_i}.
479264`\spad{indicialEquations(op,{} p)} returns \spad{[[d1,{} e1],{} ...,{} [dq,{} eq]]} where the \spad{d_i}\spad{'s} are the affine singularities of \spad{op} above the roots of \spad{p},{} and the \spad{e_i}\spad{'s} are the indicial equations at each \spad{d_i}.
479367`\spad{indicialEquations(op,{} p)} returns \spad{[[d1,{} e1],{} ...,{} [dq,{} eq]]} where the \spad{d_i}\spad{'s} are the affine singularities of \spad{op} above the roots of \spad{p},{} and the \spad{e_i}\spad{'s} are the indicial equations at each \spad{d_i}.
479469`\spad{inf(u)} returns the infinum of \spad{u}.
479514`\spad{inf(x,{} y)} returns the largest element which can be subtracted from \spad{x} and \spad{y}.
479565`\spad{infieldint(f)} returns \spad{g} such that \spad{g' = f} or "failed" if the integral of \spad{f} is not a rational function.
479661`\spad{infieldIntegrate(f,{} x)} returns a fraction \spad{g} such that \spad{dg/dx = f} if \spad{g} exists,{} "failed" otherwise.
479797`\spad{infinite?(x)} tests if \spad{x} is infinite.
479856`\spad{infinite?(x)} tests if \spad{x} is +infinity or -infinity,{}
479914`\spad{infiniteProduct(f(x))} computes \spad{product(n=1,{} 2,{} 3...,{} f(x^n))}. The series \spad{f(x)} should have constant coefficient 1.
479988`\spad{infinity()} returns infinity.
480039`\spad{infinity()} returns infinity.
480103`\spad{infinityNorm(f)} returns the maximal absolute value of the coefficients of the polynomial \spad{f}.
480180`\spad{infix?(op)} returns \spad{true} if \spad{op} is an infix operator,{} and \spad{false} otherwise.
480225`\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}.
480271`\spad{infix(op,{} a,{} b)} creates a form which prints as: a \spad{op} \spad{b}.
480313`\spad{infix(op,{} p,{} h1,{} h2)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats the first argument by \spad{h1} and the second argument by \spad{h2}. Both boxes will be horizontally concatenated with \spad{box op} in the middle. Outer parentheses are added if \spad{p < prec}.
480483`\spad{infix(op,{} p,{} h1,{} h2)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats the first argument by \spad{h1} and the second argument by \spad{h2}. Both boxes will be horizontally concatenated with \spad{box op} in the middle. Outer parentheses are added if \spad{p < prec}.
480657`\spad{infLex?(n1,{} n2,{} o1,{} o2)} returns \spad{true} iff \spad{o1(value(n1),{} value(n2))} or \spad{value(n1) = value(n2)} and \spad{o2(condition(n1),{} condition(n2))}.
480885`\spad{infRittWu?(a,{} b)} returns \spad{true} if \spad{a} is less than \spad{b} with respect to the Ritt and Wu Wen Tsun ordering using the refinement of Lazard.
480960`\spad{infRittWu?(ts1,{} ts2)} returns \spad{true} iff \spad{ts2} has higher rank than \spad{ts1} in Wu Wen Tsun sense.
481031`\spad{infRittWu?(lp1,{} lp2)} is an internal subroutine,{} exported only for development.
481117`\spad{infRittWu?(lp1,{} lp2)} is an internal subroutine,{} exported only for development.
481213`\spad{infsum(x)} computes sum of all elements of \spad{x}. Degrees of elements of \spad{x} must be nondecreasing and tend to infinity.
481302`\spad{inGroundField?(a)} tests whether an element \spad{a} is already in the ground field \spad{F}.
481362`\spad{inHallBasis?(numberOfGens,{} leftCandidate,{} rightCandidate,{} left)} tests to see if a new element should be added to the \spad{P}. Hall basis being constructed. The list \spad{[leftCandidate,{} wt,{} rightCandidate]} is included in the basis if in the unique factorization of \spad{rightCandidate},{} we have left factor leftOfRight,{} and leftOfRight \spad{<=} \spad{leftCandidate}
481442`\spad{ini_rdata(pv,{} p)} generates data allowing faster computation of remainders from division by \spad{pv} modulo \spad{p}. Result is used by other functions in this package,{} in particular \spad{red_pol!}.
481716`\spad{init()} chooses an initial object for stepping.
481812`\spad{init(p)} returns an error if \spad{p} belongs to \spad{R},{} otherwise returns its leading coefficient,{} where \spad{p} is viewed as a univariate polynomial in its main variable.
481908`\spad{initial constructs} a graph without vertices or edges
482018`\spad{initial(p)} returns the leading coefficient when the differential polynomial \spad{p} is written as a univariate polynomial in its leader.
482087`\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 solution of the word problem.
482161`\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 solution of the word problem.
482391`\spad{initiallyReduce(a,{} b)} returns a polynomial \spad{r} such that \spad{initiallyReduced?(r,{} b)} holds and there exists an integer \spad{e} such that \spad{init(b)^e a - r} is zero modulo \spad{b}.
482465`\spad{initiallyReduce(p,{} ts)} returns a polynomial \spad{r} such that \spad{initiallyReduced?(r,{} ts)} holds and there exists some product \spad{h} of \spad{initials(ts)} such that \spad{h*p - r} lies in the ideal generated by \spad{ts}.
482609`\spad{initiallyReduced?(ts)} returns \spad{true} iff for every element \spad{p} of \spad{ts} \spad{p} and all its iterated initials are reduced with respect to the other elements of \spad{ts} with the same main variable.
482927`\spad{initiallyReduced?(a,{} b)} returns \spad{false} iff there exists an iterated initial of \spad{a} which is not reduced with respect to \spad{b}.
483009`\spad{initiallyReduced?(q,{} lp)} returns \spad{true} iff \spad{initiallyReduced?(q,{} p)} holds for every \spad{p} in \spad{lp}.
483097`\spad{initiallyReduced?(p,{} ts)} returns \spad{true} iff \spad{p} and all its iterated initials are reduced with respect to the elements of \spad{ts} with the same main variable.
483240`\spad{initials(ts)} returns the list of the non-constant initials of the members of \spad{ts}.
483307`\spad{initTable!()} initializes the hash-table.
483380`\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,{} factor is the univariate factorizer used to reduce the characteristic polynomial into irreducible factors.
483599`\spad{innerint(f,{} x,{} a,{} b,{} ignore?)} should be local but conditional
483823`\spad{innerSolve1(p,{} eps)} returns the list of the zeros of the polynomial \spad{p} with precision eps.
483917`\spad{innerSolve1(up,{} eps)} returns the list of the zeros of the univariate polynomial \spad{up} with precision eps.
484027`\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 eps.
484165`\spad{input(op)} returns the "\%input" property of \spad{op} if it has one attached,{} "failed" otherwise.
484249`\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)}.
484319`\spad{inR?(p)} tests if \spad{p} is an atom (\spadignore{i.e.} an element of \spad{R}).
484362`\spad{inRadical?(f,{} I)} tests if some power of the polynomial \spad{f} belongs to the ideal \spad{I}.
484444`\spad{inrootof(p,{} x)} should be a non-exported function.
484527`\spad{insert!(x,{} y)} stores the item whose key is \spad{x} and whose entry is \spad{y}.
484606`\spad{insert(sys,{} de)} adds the system \spad{sys = 0} to the differential equation \spad{de}.
484753`\spad{insert!(x,{} u)} inserts item \spad{x} into bag \spad{u}.
484800`\spad{insert!(x,{} b)} inserts element \spad{x} as a leave into binary search tree \spad{b}.
484851`\spad{insert!(x,{} b)} inserts element \spad{x} as a leave into binary tournament \spad{b}.
485504`\spad{insert!(v,{} u,{} i)} destructively inserts aggregate \spad{v} into \spad{u} at position \spad{i}.
485572`\spad{insert(v,{} u,{} i)} returns a copy of \spad{u} having \spad{v} inserted beginning at the \spad{i}th element. Note: \spad{insert(v,{} u,{} i) = concat(u(minIndex(u)..i-1),{} concat(v,{} u(i..)))}.
485629`\spad{insert!(x,{} u,{} i)} destructively inserts \spad{x} into \spad{u} at position \spad{i}.
485697`\spad{insert(x,{} u,{} i)} returns a copy of \spad{u} having \spad{x} as its \spad{i}th element. Note: \spad{insert(x,{} u,{} i) = concat(u(minIndex(u)..i-1),{} concat(x,{} u(i..)))}.
485754`\spad{insert!(x,{} d,{} n)} destructively inserts \spad{n} copies of \spad{x} into dictionary \spad{d}.
485823`\spad{insertBottom!(x,{} d)} destructively inserts \spad{x} into the dequeue \spad{d} at the bottom (back) of the dequeue.
485880`\spad{insertionSort! }\undocumented
485950`\spad{insertionSort!(a,{} f)} \undocumented
486018`\spad{insertMatch(var,{} expr,{} r)} adds the match (\spad{var},{} \spad{expr}) in \spad{r},{} without checking predicates or previous matches for \spad{var}.
486088`\spad{insertRoot!(x,{} b)} inserts element \spad{x} as the root of binary search tree \spad{b}.
486143`\spad{insertRowsColumns(f,{} lst_row,{} lst_col)} returns a new system with rows and columns inserted. An index \spad{k} means a new row/column between \spad{k} and \spad{k+1}. The number of rows and columns have to be the same!
486259`\spad{insertRowsColumns(p,{} lst_row,{} lst_col)} returns a new pencil with additional rows and columns after the specified indices. addRowsColumns(\spad{p},{} [0,{}0,{}1],{} [0,{}0,{}3]) would insert 2 rows and columns at the beginning an one row and column between rows 1 and 2 and columns 3 and 4 respectively.
486382`\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.
486515`\spad{inspect(u)} returns an (random) element from a bag.
486560`\spad{int(r)} returns [\spad{r},{} \spad{r+1},{} \spad{r+2},{} ...],{} where \spad{r} is a ring element.
486625`\spad{int(expr)} creates the form prefixing \spad{expr} with an integral sign.
486661`\spad{int(expr,{} lowerlimit)} creates the form prefixing \spad{expr} by an integral sign with a lowerlimit.
486699`\spad{int(f,{} x)} returns the integral of \spad{f} with respect to \spad{x}.
486751`\spad{int(expr,{} lowerlimit,{} upperlimit)} creates the form prefixing \spad{expr} by an integral sign with both a \spad{lowerlimit} and upperlimit.
486791`\spad{intBasis Lb} computes a basis of the intersection of the list of subspaces represented by \spad{LLv}.
486847`\spad{intBasis LLv} computes a basis of the intersection of the list of subspaces represented by \spad{LLv}.
486917`\spad{intBasis(B1,{} B2)} computes a basis of the intersection of the two subspaces.
486969`\spad{intBasis(Lv1,{} Lv2)} computes a basis of the intersection of the two subspaces spanned by the vectors of \spad{Lv1} and \spad{Lv2}.
487049`\spad{intChoose should} be local
487311`\spad{intcompBasis }\undocumented
487561`\spad{integ should} be local but conditional
487672`\spad{integ_df should} be local but conditional
487790`\spad{integer?(t)} tests whether \spad{t} is equivalent to the FORTRAN type INTEGER.
487844`\spad{integer?(f)} checks if \spad{f} is an integer,{} this implies atom?(\spad{f})
487905`\spad{integer(f)} gives integer corresponding to \spad{f}. Valid only when integer?(\spad{f}) is \spad{true}
487965`\spad{integer?(s)} is \spad{true} if \spad{s} is an atom and belong to Int.
488038`\spad{integer(s)} returns \spad{s} as an element of Int. Error: if \spad{s} is not an atom that also belongs to Int.
488106`\spad{integer?(x)} is \spad{true} if \spad{x} is an integer,{} \spad{false} otherwise.
488164`\spad{integer(x)} returns \spad{x} as an integer; error if \spad{x} is not an integer.
488221`\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.
488286`\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.
488357`\spad{integerIfCan(x)} returns \spad{x} as an integer,{} "failed" if \spad{x} is not an integer.
488435`\spad{integerPart(o)} = \spad{n} when \spad{o} = \spad{l} + \spad{n} and \spad{l} is a limit ordinal
488498`\spad{integers(n)} returns \spad{[n,{} n+1,{} n+2,{} ...]}.
488580`\spad{integral(p)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats the expression as an integral with integral sign and respective limits. Outer parentheses are added if \spad{p < prec}.
488738`\spad{integral?(f)} tests if \spad{f} is integral over \spad{k[x]}.
488808`\spad{integral(f,{} x)} returns the formal integral of \spad{f} with respect to \spad{x}
488861`\spad{integral(f,{} x = a..b)} denotes the definite integral of \spad{f} with respect to \spad{x} from \spad{a} to \spad{b}.
488934`\spad{integral(f,{} x)} returns the formal integral of \spad{f} with respect to \spad{x}
489020`\spad{integral(f,{} x)} indefinite integral of \spad{f} with respect to \spad{x}.
489223`\spad{integral?(f,{} a)} tests whether \spad{f} is locally integral at \spad{x = a}.
489295`\spad{integral(f,{} x = a..b)} returns the formal definite integral of \spad{f} \spad{dx} for \spad{x} between \spad{a} and \spad{b}.
489369`\spad{integral(f,{} x)} returns the formal integral of \spad{f} \spad{dx}.
489432`\spad{integral?(f,{} p)} tests whether \spad{f} is locally integral at \spad{p(x) = 0}.
489583`\spad{integralAtInfinity?(f)} tests if \spad{f} is locally integral at infinity.
489663`\spad{integralBasis()} returns a record \spad{[basis,{} basisDen,{} basisInv]} containing information regarding the integral closure of \spad{Z} in the quotient field of \spad{F},{} where \spad{F} is a framed algebra with \spad{Z}-module basis \spad{w1,{} w2,{} ...,{} wn}. If \spad{basis} is the matrix \spad{(aij,{} i = 1..n,{} j = 1..n)},{} then the \spad{i}th element of the integral basis is \spad{\spad{vi} = (1/basisDen) * sum(aij * wj,{} j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of \spad{basis} contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix \spad{basisInv} contains the coordinates of \spad{\spad{wi}} with respect to the basis \spad{v1,{} ...,{} vn}: if \spad{basisInv} is the matrix \spad{(bij,{} i = 1..n,{} j = 1..n)},{} then \spad{\spad{wi} = sum(bij * vj,{} j = 1..n)}.
489798`\spad{integralBasis()} returns a record \spad{[basis,{} basisDen,{} basisInv]} containing information regarding the integral closure of \spad{R} in the quotient field of \spad{F},{} where \spad{F} is a framed algebra with \spad{R}-module basis \spad{w1,{} w2,{} ...,{} wn}. If \spad{basis} is the matrix \spad{(aij,{} i = 1..n,{} j = 1..n)},{} then the \spad{i}th element of the integral basis is \spad{\spad{vi} = (1/basisDen) * sum(aij * wj,{} j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of \spad{basis} contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix \spad{basisInv} contains the coordinates of \spad{\spad{wi}} with respect to the basis \spad{v1,{} ...,{} vn}: if \spad{basisInv} is the matrix \spad{(bij,{} i = 1..n,{} j = 1..n)},{} then \spad{\spad{wi} = sum(bij * vj,{} j = 1..n)}.
489919`\spad{integralBasis()} returns a record \spad{[basis,{} basisDen,{} basisInv] } containing information regarding the integral closure of \spad{R} in the quotient field of the framed algebra \spad{F}. \spad{F} is a framed algebra with \spad{R}-module basis \spad{w1,{} w2,{} ...,{} wn}. If 'basis' is the matrix \spad{(aij,{} i = 1..n,{} j = 1..n)},{} then the \spad{i}th element of the integral basis is \spad{\spad{vi} = (1/basisDen) * sum(aij * wj,{} j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of 'basis' contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix 'basisInv' contains the coordinates of \spad{\spad{wi}} with respect to the basis \spad{v1,{} ...,{} vn}: if 'basisInv' is the matrix \spad{(bij,{} i = 1..n,{} j = 1..n)},{} then \spad{\spad{wi} = sum(bij * vj,{} j = 1..n)}.
490051`\spad{integralBasis()} returns a record \spad{[basis,{} basisDen,{} basisInv]} containing information regarding the integral closure of \spad{R} in the quotient field of \spad{F},{} where \spad{F} is a framed algebra with \spad{R}-module basis \spad{w1,{} w2,{} ...,{} wn}. If \spad{basis} is the matrix \spad{(aij,{} i = 1..n,{} j = 1..n)},{} then the \spad{i}th element of the integral basis is \spad{\spad{vi} = (1/basisDen) * sum(aij * wj,{} j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of \spad{basis} contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix \spad{basisInv} contains the coordinates of \spad{\spad{wi}} with respect to the basis \spad{v1,{} ...,{} vn}: if \spad{basisInv} is the matrix \spad{(bij,{} i = 1..n,{} j = 1..n)},{} then \spad{\spad{wi} = sum(bij * vj,{} j = 1..n)}.
490178`\spad{integralBasis()} returns the integral basis for the curve.
490253`\spad{integralBasisAtInfinity()} returns the local integral basis at infinity.
490338`\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()}.
490440`\spad{integralDerivationMatrix(d)} extends the derivation \spad{d} from UP to \$ and returns (\spad{M},{} \spad{Q}) such that the i^th row of \spad{M} divided by \spad{Q} form the coordinates of \spad{d(\spad{wi})} with respect to \spad{(w1,{} ...,{} wn)} where \spad{(w1,{} ...,{} wn)} is the integral basis returned by integralBasis().
490554`\spad{integralLastSubResultant(p1,{} p2,{} ts)} is an internal subroutine,{} exported only for development.
490675`\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}.
490762`\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()}.
490859`\spad{integralRepresents([A1,{} ...,{} An],{} D)} returns \spad{(A1 w1+...+An wn)/D} where \spad{(w1,{} ...,{} wn)} is the integral basis of \spad{integralBasis()}.
490944`\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.
491061`\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}.
491167`\spad{integrate(f)} returns \spad{g} such that \spad{g' = f}.
491326`\spad{integrate(p)} integrates the univariate polynomial \spad{p} with respect to its distinguished variable.
491422`\spad{integrate(r,{} a)} returns the integral of the power series \spad{a} with respect to the power series variable where \spad{r} denotes the constant of integration. Thus \spad{integrate(a,{} [a0,{} a1,{} a2,{} ...]) = [a,{} a0,{} a1/2,{} a2/3,{} ...]}.
491536`\spad{integrate(c,{} f)} integrates with constant term \spad{c},{} this is simply the right shift
491634`\spad{integrate(jv,{} i)} is like \spad{integrateIfCan(jv,{} i)} but yields an error,{} if the integration is not possible.
491763`\spad{integrate(f(x),{} y)} returns an anti-derivative of the power series \spad{f(x)} with respect to the variable \spad{y}.
491991`\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.
492116`\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.
492241`\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.
492365`\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.
492484`\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.
492603`\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.
492830`\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}.
493089`\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}.
493358`\spad{integrate(f,{} x)} returns the integral of \spad{f(x)dx} where \spad{x} is viewed as a real variable.
493515`\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}.
493720`\spad{integrate(f,{} x)} returns the integral of \spad{f(x)dx} where \spad{x} is viewed as a real variable.
493803`\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}.
493888`\spad{integrate(p,{} d)} integrates the polynomial \spad{p} against the distribution \spad{d}. Same as \spad{eval(d,{} p)}.
493976`\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.
494090`\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.
494214`\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.}
494335`\spad{integrate(f,{} x = a..b,{} "noPole")} returns the integral of \spad{f(x)dx} from a to \spad{b}. If it is not possible to check whether \spad{f} has a pole for \spad{x} between a and \spad{b} (because of parameters),{} then this function will assume that \spad{f} has no such pole. Error: if \spad{f} has a pole for \spad{x} between a and \spad{b} or if the last argument is not "noPole".
494601`\spad{integrate(f,{} x = a..b,{} "noPole")} returns the integral of \spad{f(x)dx} from a to \spad{b}. If it is not possible to check whether \spad{f} has a pole for \spad{x} between a and \spad{b} (because of parameters),{} then this function will assume that \spad{f} has no such pole. Error: if \spad{f} has a pole for \spad{x} between a and \spad{b} or if the last argument is not "noPole".
494877`\spad{integrate(f,{} x = a..b,{} "noPole")} returns the integral of \spad{f(x)dx} from a to \spad{b}. If it is not possible to check whether \spad{f} has a pole for \spad{x} between a and \spad{b} (because of parameters),{} then this function will assume that \spad{f} has no such pole. Error: if \spad{f} has a pole for \spad{x} between a and \spad{b} or if the last argument is not "noPole".
495089`\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.}
495187`\spad{integrate(jv,{} i)} integrated \spad{jv} \spad{wrt} the \spad{i}\spad{-}th independent variable,{} if possible.
495358`\spad{integrate_sols(l)} integrates the solutions of an operator \spad{l}.
495592`\spad{integrate_sols(l,{} rat_solve)} integrates the solutions of an operator \spad{l} given rat_solve(op,{} \spad{g}) that returns \spad{["failed",{} []]} if the equation \spad{op y = g} has no rational solution. Otherwise,{} the rat_solve function should return \spad{[f,{} [y1,{} ...,{} ym]]} where \spad{f} is a particular rational solution and the \spad{yi}\spad{'s} form a basis for the rational solutions of the homogeneous equation.
495745`\spad{integt should} be local but conditional
495857`\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}.
495922`\spad{internal?(x)} \undocumented
495973`\spad{internalAugment(lp,{} ts)} returns \spad{ts} if \spad{lp} is empty otherwise returns \spad{internalAugment(rest lp,{} internalAugment(first lp,{} ts))}
496056`\spad{internalAugment(p,{} ts)} assumes that \spad{augment(p,{} ts)} returns a singleton and returns it.
496133`\spad{internalAugment(p,{} ts,{} b1,{} b2,{} b3,{} b4,{} b5)} is an internal subroutine,{} exported only for development.
496248`\spad{internalAugment(p,{} ts,{} b1,{} b2,{} b3,{} b4,{} b5)} is an internal subroutine,{} exported only for development.
497335`\spad{internalInfRittWu?(lp1,{} lp2)} is an internal subroutine,{} exported only for development.
497429`\spad{internalInfRittWu?(lp1,{} lp2)} is an internal subroutine,{} exported only for development.
497533`\spad{internalIntegrate0 should} be a local function,{} but is conditional.
497636`\spad{internalIntegrate(f,{} x)} returns the integral of \spad{f(x)dx} where \spad{x} is viewed as a complex variable.
497744`\spad{internalIntegrate(f,{} x)} returns \spad{g} such that \spad{dg/dx = f}.
497884`\spad{internalIntegrate(f,{} x)} returns the integral of \spad{f(x)dx} where \spad{x} is viewed as a complex variable.
497986`\spad{internalLastSubResultant(lpwt,{} v,{} flag)} is an internal subroutine,{} exported only for development.
498145`\spad{internalLastSubResultant(p1,{} p2,{} ts,{} inv?,{} break?)} is an internal subroutine,{} exported only for development.
498282`\spad{internalSubPolSet?(lp1,{} lp2)} returns \spad{true} iff \spad{lp1} is a sub-set of \spad{lp2} assuming that these lists are sorted increasingly with respect to \spadopFrom{infRittWu?}{RecursivePolynomialCategory}.
498376`\spad{internalSubPolSet?(lp1,{} lp2)} returns \spad{true} iff \spad{lp1} is a sub-set of \spad{lp2} assuming that these lists are sorted increasingly with respect to \spadopFrom{infRittWu?}{RecursivePolynomialCategory}.
498480`\spad{internalSubQuasiComponent?(ts,{} us)} returns a boolean \spad{b} value if the fact that the regular zero set of \spad{us} contains that of \spad{ts} can be decided (and in that case \spad{b} gives this inclusion) otherwise returns \spad{"failed"}.
498588`\spad{internalSubQuasiComponent?(ts,{} us)} returns a boolean \spad{b} value if the fact the regular zero set of \spad{us} contains that of \spad{ts} can be decided (and in that case \spad{b} gives this inclusion) otherwise returns \spad{"failed"}.
498706`\spad{internalZeroSetSplit(lp,{} b1,{} b2,{} b3)} is an internal subroutine,{} exported only for development.
498814`\spad{internalZeroSetSplit(lp,{} b1,{} b2,{} b3)} is an internal subroutine,{} exported only for development.
498932`\spad{interpolate(lf,{} lg)} \undocumented
499037`\spad{interpolate(xlist,{} ylist,{} deg)} returns the rational function with numerator degree at most \spad{deg} and denominator degree at most \spad{\#xlist-deg-1} that interpolates the given points using fraction free arithmetic. Note that rational interpolation does not guarantee that all given points are interpolated correctly: unattainable points may make this impossible.
499171`\spad{interpolate(xlist,{} ylist,{} deg)} returns the rational function with numerator degree \spad{deg} that interpolates the given points using fraction free arithmetic.
499325`\spad{interpolate(u,{} lf,{} lg)} \undocumented
499584`\spad{interpret(f)} passes \spad{f} to the interpreter.
499627`\spad{interpret(f)} passes \spad{f} to the interpreter,{} and transforms the result into an object of type \spad{R}.
499689`\spad{interpret_in_new_env(f)} evaluates \spad{f} in the interpreter using fresh environment which is discarded after evaluation
499743`\spad{interpretString(s)} treats a string as a piece of FriCAS input,{} by parsing and interpreting it.
499805`\spad{interReduce(lp)} returns \spad{lq} such that \spad{lp} and \spad{lq} generate the same ideal and no polynomial in \spad{lq} is reducible 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.
499889`\spad{intersect(LI)} computes the intersection of the list of ideals \spad{LI}.
500341`\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})].
500390`\spad{intersect(I,{} J)} computes the intersection of the ideals \spad{I} and \spad{J}.
500461`\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}.
500544`\spad{intersect(lp,{} lts)} returns the same as \spad{concat([intersect(lp,{} ts) for ts in lts])|}
500633`\spad{intersect(p,{} ts)} returns the same as \spad{intersect([p],{} ts)}
500710`\spad{intersect(p,{} lts)} returns the same as \spad{intersect([p],{} lts)}
500793`\spad{intersection(x)} constructs a compound boundary from the intersection of \spad{x} \spad{x:} List \% is supplied list of boundaries to form intersection.
500847`\spad{interval(f)} creates a new interval around \spad{f}.
500913`\spad{interval(f)} creates a new interval around \spad{f}.
500963`\spad{interval(i,{} j)} creates list [\spad{i},{} \spad{i+1},{} ...,{} \spad{j}]
501079`\spad{interval(inf,{} sup)} creates a new interval,{} either \spad{[inf,{} sup]} if \spad{inf <= sup} or \spad{[sup,{} inf]} otherwise.
501131`\spad{intoMatrix(lp,{} lvar)} converts linear in symbols lvar system of polynomials \spad{lp} = 0 into matrix form
501272`\spad{inv(x)} \undocumented
501352`\spad{inv(x)} \undocumented
501581`\spad{inv x} \undocumented{} See \spadfunFrom{inv}{DivisionRing}
501659`\spad{inv x} returns the multiplicative inverse of \spad{x}. Error: if \spad{x} is 0.
501697`\spad{inv(x)} returns the inverse of \spad{x}.
501728`\spad{inv(o)} returns the inverse of \spad{o} if it exists.
501785`\spad{inv(x)} returns the multiplicative inverse of \spad{x}.
501834`\spad{inverse(f)} \spad{f^}-1 using invertMIN.
501890`\spad{inverse(ls)} forms the inverse of a sequence \spad{ls}
501950`\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.
502059`\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.
502151`\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.
502250`\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.
502333`\spad{inverse(m)} returns the inverse of the matrix \spad{m},{} if that matrix is invertible and returns "failed" otherwise.
502427`\spad{inverseColeman(alpha,{} beta,{} C)}: there is a bijection from the set of matrices having nonnegative entries and row sums {\em alpha},{} column sums {\em beta} to the set of {\em Salpha - Sbeta} double cosets of the symmetric group {\em Sn}. ({\em Salpha} is the Young subgroup corresponding to the improper partition {\em alpha}). For such a matrix \spad{C},{} inverseColeman(\spad{alpha},{} \spad{beta},{} \spad{C}) calculates the lexicographical smallest {\em \spad{pi}} in the corresponding double coset. Note: the resulting permutation {\em \spad{pi}} of {\em {1,{} 2,{} ...,{} n}} is given in list form. Notes: the inverse of this map is {\em coleman}. For details,{} see James/Kerber.
502553`\spad{inverse_cyclotomic(n)} computes \spad{n}-th inverse cyclotomic polynomial,{} that is \spad{(x^n - 1)/cyclotomic(n)}.
502653`\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}.
502747`\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()}.
502851`\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. Handles only rational \spad{f(s)}.
502946`\spad{invertALS(f)} computes \spad{f^}-1 in terms of the ALS for \spad{f}. There is no check if \spad{f} is invertible!
503004`\spad{invertible?(p,{} ts)} returns \spad{true} iff \spad{p} is invertible in the tower associated with \spad{ts}.
503083`\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}.
503188`\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}.
503291`\spad{invertibleSet(p,{} ts)} returns a split of Kalkbrener of the quotient ideal of the ideal \spad{I} by \spad{p} where \spad{I} is the radical of saturated of \spad{ts}.
503372`\spad{invertIfCan(m)} returns the inverse of \spad{m} over \spad{R}
503484`\spad{invertIfCan(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.
503564`\spad{invertMIN(f)} uses invertSTD(\spad{f}) and minimization to construct a minimal system for \spad{f^}-1. Linear techniques are used to get a fine pivot block structure.
503622`\spad{invertSTD(f)} computes the standard inverse of \spad{f} in terems of the admissible linear system There is no check if \spad{f} is invertible!
503729`\spad{invmod(a,{} b)},{} \spad{0<=a<b>1},{} \spad{(a,{} b)=1} means \spad{1/a mod b}.
503858`\spad{invmultisect(a,{} b,{} f(x))} substitutes \spad{x^((a+b)*n)} \indented{1}{for \spad{x^n} and multiples by \spad{x^b}.}
503945`\spad{invmultisect(a,{} b,{} st)} substitutes \spad{x^((a+b)*n)} for \spad{x^n} and multiplies by \spad{x^b}.
504043`\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.
504097`\spad{Iota()} returns symbol for capital greek letter iota.
504147`\spad{iota()} returns symbol for small greek letter iota.
504197`\spad{ipow(l)} should be local but conditional.
504256`\spad{iprint(s)} prints \spad{s} at the current position of the cursor.
504313`\spad{iroot(p,{} n)} should be a non-exported function.
504400`\spad{irootDep(k)} is a local function with a conditional implementation.
504533`\spad{irreducible?(p)} tests if \spad{p} is irreducible.
504611`\spad{irreducible?(pv,{} md)} checks if \spad{pv} is irreducible. \spad{pv} is assumed square-free and monic,{} \spad{md} is info representing finite field.
504883`\spad{irreducibleFactor(base,{} exponent)} creates a factored object with a single factor whose \spad{base} is asserted to be irreducible (flag = "irred").
504953`\spad{irreducibleFactors(lp)} returns \spad{lf} such that if \spad{lp = [p1,{} ...,{} pn]} and \spad{lf = [f1,{} ...,{} fm]} then \spad{p1*p2*...*pn=0} means \spad{f1*f2*...*fm=0},{} and the \spad{\spad{fi}} are irreducible over \spad{R} and are pairwise distinct.
505113`\spad{irreducibleRepresentation(lambda)} is the list of the two irreducible representations corresponding to the partition {\em lambda} in Young\spad{'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).
505212`\spad{irreducibleRepresentation(lambda,{} listOfPerm)} is the list of the irreducible representations corresponding to {\em lambda} in Young\spad{'s} natural form for the list of permutations given by {\em listOfPerm}.
505338`\spad{irreducibleRepresentation(lambda,{} \spad{pi})} is the irreducible representation corresponding to partition {\em lambda} in Young\spad{'s} natural form of the permutation {\em \spad{pi}} in the symmetric group,{} whose elements permute {\em {1,{} 2,{} ...,{} n}}.
505452`\spad{is?(op(a1,{} ...,{} an),{} f)} tests if op = \spad{f}.
505634`\spad{is?(op(a1,{} ...,{} an),{} s)} tests if the name of op is \spad{s}.
505690`\spad{is?(x,{} op)} tests if \spad{x} is a kernel and if its operator is op.
505755`\spad{is?([e1,{} ...,{} en],{} pat)} tests if the list of expressions \spad{[e1,{} ...,{} en]} matches the pattern pat.
505833`\spad{Is([e1,{} ...,{} en],{} pat)} matches the pattern pat on the list of expressions \spad{[e1,{} ...,{} en]} and returns the result.
505953`\spad{is?(expr,{} pat)} tests if the expression \spad{expr} matches the pattern pat.
506025`\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}.
506186`\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}.
506307`\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}.
506470`\spad{is?(x,{} s)} tests if \spad{x} is a kernel and if the name of its operator is \spad{s}.
506528`\spad{is?(op,{} s)} tests if the name of \spad{op} is \spad{s}.
506580`\spad{isAbsolutelyIrreducible?(aG)} calls {\em isAbsolutelyIrreducible?(aG,{} 25)}. Note: the choice of 25 was rather arbitrary.
506684`\spad{isAbsolutelyIrreducible?(aG,{} numberOfTries)} uses Norton\spad{'s} irreducibility test to check for absolute irreduciblity,{} assuming if a one-dimensional kernel is found. As no field extension changes create "new" elements in a one-dimensional space,{} the criterium stays \spad{true} for every extension. The method looks for one-dimensionals only by creating random elements (no fingerprints) since a run of {\em meatAxe} would have proved absolute irreducibility anyway.
506847`\spad{isAcyclic?(s)} returns \spad{true} if there are no loops
506900`\spad{isAntiChain?(s)} checks if \spad{s} is an antichain,{} that is any two elements in \spad{s} are incomparable.
506949`\spad{isBasis? Lv} tests for linear independence of a list of vectors.
507019`introspection: returns \spad{true} if this is a bound leaf node
507070`\spad{isBox?(n)} returns \spad{true} if this is a rectangular boundary.
507118`\spad{isChain?(s)} checks if \spad{s} is a chain,{} that is any two elements in \spad{s} are comparable.
507163`introspection: returns \spad{true} if this is a compound term containing two nodes
507213`\spad{isDirected?()} is \spad{true} iff \% is domain consisting of directed graphs,{} \spad{false} for undirected graphs.
507266`\spad{isDirected?()} is \spad{true} iff \% is domain consisting of directed graphs,{} \spad{false} for undirected graphs.
507555`\spad{isDirectSuccessor?(s,{} a,{} b)} is \spad{true} if \spad{'b'} is a direct successor of 'a' that is,{} if there is a direct arrow from 'a' to \spad{'b'}
507654`\spad{isEllipse?(n)} returns \spad{true} if this is a ellipsoid boundary.
507706`\spad{isExpt(p)} returns \spad{[x,{} n]} if \spad{p = x^n} and \spad{n ~= 0},{} "failed" otherwise.
508035`\spad{isExpt(p)} returns \spad{[q,{} n]} if \spad{n > 0} and \spad{p = q ^ n},{} and "failed" otherwise.
508130`\spad{isExpt(p)} returns \spad{[x,{} n]} if \spad{p = x^n} and \spad{n ~= 0}.
508239`\spad{isExpt(p)} returns \spad{[x,{} n]} if polynomial \spad{p} has the form \spad{x^n} and \spad{n > 0}.
508577`\spad{isExpt(p,{} op)} returns \spad{[x,{} n]} if \spad{p = x^n} and \spad{n ~= 0} and \spad{x = op(a)}.
508695`\spad{isExpt(p,{} f)} returns \spad{[x,{} n]} if \spad{p = x^n} and \spad{n ~= 0} and \spad{x = f(a)}.
508942`\spad{isFixPoint?(s,{} a)} is \spad{true} if 'a' has an arrow to itself
509015`introspection: returns \spad{true} if this is a unbound leaf node
509119`\spad{isFunctional?(s)} returns \spad{true} if \spad{s} is a functional graph,{} that is a directed graph in which each vertex has a single outgoing arrow.
509355`\spad{isGreaterThan?(s,{} a,{} b)} is \spad{true} if we can get from vertex 'a' to \spad{'b'} through a sequence of arrows but we can\spad{'t} go in the opposite direction from \spad{'b'} to 'a'
509450`returns \spad{true} if this is an \spad{I} combinator node
509501`returns \spad{true} if this is a \spad{K} combinator node
509552`introspection: returns \spad{true} if this is a lambda definition
509600`\spad{isList(p)} returns \spad{[a1,{} ...,{} an]} if \spad{p = [a1,{} ...,{} an]},{} "failed" otherwise.
509748`\spad{isMult(p)} returns \spad{[n,{} x]} if \spad{p = n * x} and \spad{n ~= 0}.
509860`\spad{isNodeBranch?(n)} returns \spad{true} if this is a branch.
509922`\spad{isNodeLeaf?(n)} returns \spad{true} if this is a leaf which holds Scene nodes.
509982`\spad{isNull?(n)} returns \spad{true} if this is a null boundary,{} that is no boundary
510106`\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.
510183`\spad{isOp(p)} returns \spad{[op,{} [a1,{} ...,{} an]]} if \spad{p = op(a1,{} ...,{} an)},{} and "failed" otherwise.
510271`\spad{isOp(p,{} op)} returns \spad{[a1,{} ...,{} an]} if \spad{p = op(a1,{} ...,{} an)},{} and "failed" otherwise.
510344`\spad{isPlus(p)} returns [\spad{m1},{} ...,{} \spad{mn}] if \spad{p = m1 + ... + mn} and \spad{n > 1},{} "failed" otherwise.
510588`\spad{isPlus(p)} returns \spad{[a1,{} ...,{} an]} if \spad{n > 1} \indented{1}{and \spad{p = a1 + ... + an},{}} and "failed" otherwise.
510649`\spad{isPlus(p)} returns \spad{[m1,{} ...,{} mn]} if \spad{p = m1 +...+ mn} and \spad{n > 1}.
510742`\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.
510823`\spad{isPoint?(p)} returns \spad{true} if this represents a point as opposed to a vector.
510874`\spad{isPointLeaf?(n)} returns \spad{true} if this is a \spad{pt} node,{} that is,{} if this node contains points
510935`\spad{isPower(p)} returns \spad{[x,{} n]} if \spad{p = x^n} and \spad{n ~= 0},{} "failed" otherwise.
511148`\spad{isPower(p)} returns \spad{[a,{} b]} if \spad{p = a ^ b},{} and "failed" otherwise.
511227`\spad{isPower(p)} returns \spad{[x,{} n]} if \spad{p = x^n} and \spad{n ~= 0}.
511332`\spad{isQuotient(p)} returns \spad{[a,{} b]} if \spad{p = a / b},{} and "failed" otherwise.
511409`returns \spad{true} if this is a \spad{S} combinator node
511460`returns \spad{true} if face 'a' is contained in face \spad{'b'}. \spad{true} subset only : returns \spad{false} if a=b
511515`\spad{is_symbol?(f,{} s)} returns \spad{true} if form is symbol \spad{s},{} otherwise returns \spad{false}
511585`\spad{isTimes(p)} returns \spad{[a1,{} ...,{} an]} if \spad{p = a1 ... an} and \spad{n > 1},{} "failed" otherwise.
511832`\spad{isTimes(p)} returns \spad{[a1,{} ...,{} an]} if \spad{n > 1} and \spad{p = a1 * ... * an},{} and "failed" otherwise.
511894`\spad{isTimes(p)} returns \spad{[a1,{} ...,{} an]} if \spad{p = a1*...*an} and \spad{n > 1}.
511981`\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} is a member of VarSet.
512078`\spad{isVector? returns} \spad{true} if this represents a vector as opposed to a point.
512130`\spad{iter(f,{} n,{} x)} applies \spad{f} \spad{n} times to \spad{x}.
512291`\spad{iteratedInitials(p)} returns \spad{[]} if \spad{p} belongs to \spad{R},{} otherwise returns the list of the iterated initials of \spad{p}.
512370`\spad{jacobi2poly(aa,{} bb)} returns the stream of orthogonal polynomials corresponding to the Jacobi parameters \spad{a_n} and \spad{b_n}.
512474`\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.
512551`\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 xlist.
512643`\spad{jacobiCn(z,{} m)} is the Jacobi elliptic \spad{cn} function,{} defined by \spad{jacobiCn(z,{} m)^2 + jacobiSn(z,{} m)^2 = 1} and \spad{jacobiCn(0,{} m) = 1}.
512706`\spad{jacobiCn(z,{} m)} expands the elliptic function \spad{cn} as a Taylor \indented{1}{series in \spad{z}.}
512795`\spad{jacobiCn(z,{} m)} is the Jacobi \spad{cn} function
512889`\spad{jacobiCn(z,{} m)} is the Jacobi elliptic \spad{cn} function,{} defined by \spad{jacobiCn(z,{} m)^2 + jacobiSn(z,{} m)^2 = 1} and \spad{jacobiCn(0,{} m) = 1}.
512945`\spad{jacobiCn(z,{} m)} is the Jacobi \spad{cn} function
513012`\spad{jacobiDn(z,{} m)} is the Jacobi elliptic \spad{dn} function,{} defined by \spad{jacobiDn(z,{} m)^2 + m*jacobiSn(z,{} m)^2 = 1} and \spad{jacobiDn(0,{} m) = 1}.
513075`\spad{jacobiDn(z,{} m)} expands the elliptic function \spad{dn} as a Taylor \indented{1}{series in \spad{z}.}
513164`\spad{jacobiDn(z,{} m)} is the Jacobi \spad{dn} function
513258`\spad{jacobiDn(z,{} m)} is the Jacobi elliptic \spad{dn} function,{} defined by \spad{jacobiDn(z,{} m)^2 + m*jacobiSn(z,{} m)^2 = 1} and \spad{jacobiDn(0,{} m) = 1}.
513314`\spad{jacobiDn(z,{} m)} is the Jacobi \spad{dn} function
513381`\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.
513461`\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.
513538`\spad{jacobiMatrix(sys)} constructs the Jacobi matrix of the family \spad{sys} of functions.
513632`\spad{jacobiMatrix(De)} returns a list of Jacobi matrices sorted by the order of the equations.
513818`\spad{jacobiMatrix(sys,{} jvars)} constructs the Jacobi matrix of the family \spad{sys} of functions. \spad{jvars} contains for each function the effectively occurring jet variables. The columns of the matrix are ordered.
514034`\spad{jacobiP(n,{} a,{} b,{} z)} is the Jacobi polynomial.
514100`\spad{jacobiP(n,{} a,{} b,{} z)} is the Jacobi polynomial.
514159`\spad{jacobiParameters(x)} returns the pair of streams of Jacobi parameters of the distribution \spad{x}.
514317`\spad{jacobiParameters(x)} returns the pair of streams of Jacobi parameters of the distribution \spad{x}.
514423`\spad{jacobiPathArray([b0,{} b1,{} ...],{} [c1,{} c2,{} ...])} computes Flajolet\spad{'s} Motzkin path array from the sequences [1,{} 1,{} ...],{} \spad{bi},{} \spad{ci}.
514512`\spad{jacobiSn(z,{} m)} is the Jacobi elliptic \spad{sn} function,{} defined by the formula \spad{jacobiSn(ellipticF(z,{} m),{} m) = z}.
514575`\spad{jacobiSn(z,{} m)} expands the elliptic function \spad{sn} as a Taylor \indented{1}{series in \spad{z}.}
514664`\spad{jacobiSn(z,{} m)} is the Jacobi \spad{sn} function
514758`\spad{jacobiSn(z,{} m)} is the Jacobi elliptic \spad{sn} function,{} defined by the formula \spad{jacobiSn(ellipticF(z,{} m),{} m) = z}.
514814`\spad{jacobiSn(z,{} m)} is the Jacobi \spad{sn} function
514881`\spad{jacobiTheta(z,{} m)} is the Jacobi Theta function in Jacobi notation.
514947`\spad{jacobiTheta(z,{} m)} is the Jacobi Theta function in Jacobi notation.
515006`\spad{jacobiZeta(z,{} m)} is the Jacobi elliptic zeta function,{} defined by \spad{D(jacobiZeta(z,{} m),{} z) = jacobiDn(z,{} m)^2 - ellipticE(m)/ellipticK(m)} and \spad{jacobiZeta(0,{} m) = 0}.
515071`\spad{jacobiZeta(z,{} m)} is the Jacobi elliptic zeta function,{} defined by \spad{D(jacobiZeta(z,{} m),{} z) = jacobiDn(z,{} m)^2 - ellipticE(m)/ellipticK(m)} and \spad{jacobiZeta(0,{} m) = 0}.
515129`\spad{jacobiZeta(z,{} m)} is the Jacobi zeta function
515198`\spad{janko2 constructs} the janko group acting on the integers 1,{} ...,{} 100.
515274`\spad{janko2(\spad{li})} constructs the janko group acting on the 100 integers given in the list {\em \spad{li}}. Note: duplicates in the list will be removed. Error: if {\em \spad{li}} has less or more than 100 different entries
515363`\spad{JContinuedFraction(d,{} z)} returns the Cauchy transform as a continued fraction at \spad{z}.
515592`\spad{JContinuedFraction(d,{} z)} returns the Cauchy transform as a continued fraction at \spad{z}.
515769`\spad{jetVariables(f)} yields all jet variables effectively occurring in \spad{f} in an ordered list.
515840`\spad{join of} set of elements
515891`\spad{join of} set of elements
515942`\spad{join(de1,{} de2)} combines \spad{de1} and \spad{de2} to a single differential equation.
516000`used by simplicialJoin. Returns join (union) of 'a' and \spad{'b'}. That is: returns a facet containing indexes in both 'a' and \spad{'b'}.
516042`\spad{join(A,{} B)} vertically concats the matrices \spad{A} and \spad{B}.
516095`\spad{join(sep,{}ls)} returns an element that is the concatenation of all strings in \spad{ls} but separated by \spad{sep},{} for example,{} join(\spad{"/"},{}["a",{}\spad{"b"},{}\spad{"c"}]) returns "a/b/c".
516145`returns the join of 'a' and \spad{'b'} In this version of join nodes are represented as index values. Not every poset will have a join but DCPO will.
516330`\spad{joinIfCan returns} the join of a subset of lattice given by list of elements.
516537`\spad{joinIfCan(s,{} a,{} b)} returns the join of 'a' and \spad{'b'} In this version of join nodes are represented as index values. In the general case,{} not every poset will have a join in which case "failed" will be returned as an error indication.
516648`\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 \spadtype{CommutativeStar} follows from by definition.
516730`\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 \spadtype{CommutativeStar} follows from by definition.
516809`\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}.
516888`\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}.
516964`Constructs a \spad{K} combinator
517005`\spad{Kappa()} returns symbol for capital greek letter kappa.
517056`\spad{kappa()} returns symbol for small greek letter kappa.
517107`\spad{karatsuba(a,{} b,{} l,{} k)} returns \spad{a*b} by applying Karatsuba\spad{'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.
517225`\spad{karatsubaDivide(p,{} n)} returns the same as \spad{monicDivide(p,{} monomial(1,{} n))}
517353`\spad{karatsuba(a,{} b)} returns \spad{a*b} by applying Karatsuba\spad{'s} trick once. The other multiplications are performed by calling \spad{*} from \spad{U}.
517437`\spad{kelvinBei(v,{} z)} is the Kelvin bei function defined by equality. \spad{kelvinBei(v,{} z) = imag(besselJ(v,{} exp(3*\%pi*\%i/4)*z))}. for \spad{z} and \spad{v} real.
517501`\spad{kelvinBei(v,{} z)} is the Kelvin bei function defined by equality \spad{kelvinBei(v,{} z) = imag(besselJ(v,{} exp(3*\%pi*\%i/4)*z))} for \spad{z} and \spad{v} real.
517558`\spad{kelvinBer(v,{} z)} is the Kelvin ber function defined by equality \spad{kelvinBer(v,{} z) = real(besselJ(v,{} exp(3*\%pi*\%i/4)*z))} for \spad{z} and \spad{v} real.
517622`\spad{kelvinBer(v,{} z)} is the Kelvin ber function defined by equality \spad{kelvinBer(v,{} z) = real(besselJ(v,{} exp(3*\%pi*\%i/4)*z))} for \spad{z} and \spad{v} real.
517679`\spad{kelvinKei(v,{} z)} is the Kelvin kei function defined by equality \spad{kelvinKei(v,{} z) = imag(exp(-v*\%pi*\%i/2)*besselK(v,{} exp(\%pi*\%i/4)*z))} for \spad{z} and \spad{v} real.
517743`\spad{kelvinKei(v,{} z)} is the Kelvin kei function defined by equality \spad{kelvinKei(v,{} z) = imag(exp(-v*\%pi*\%i/2)*besselK(v,{} exp(\%pi*\%i/4)*z))} for \spad{z} and \spad{v} real.
517800`\spad{kelvinKer(v,{} z)} is the Kelvin kei function defined by equality \spad{kelvinKer(v,{} z) = real(exp(-v*\%pi*\%i/2)*besselK(v,{} exp(\%pi*\%i/4)*z))} for \spad{z} and \spad{v} real.
517864`\spad{kelvinKer(v,{} z)} is the Kelvin kei function defined by equality \spad{kelvinKer(v,{} z) = real(exp(-v*\%pi*\%i/2)*besselK(v,{} exp(\%pi*\%i/4)*z))} for \spad{z} and \spad{v} real.
517921`\spad{kernel(x)} returns \spad{x} viewed as a kernel.
518098`\spad{kernel(op,{} x)} constructs \spad{op}(\spad{x}) without evaluating it.
518160`\spad{kernel(op,{} [f1,{} ...,{} fn])} constructs \spad{op(f1,{} ...,{} fn)} without evaluating it.
518228`\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{n}.
518537`\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.
518592`\spad{kernels([f1,{}...,{}fn])} returns the list of all the top-level kernels appearing in \spad{f1},{} ...,{} \spad{fn} but not the ones appearing in the arguments of the top-level kernels.
518653`\spad{key(\spad{gi})} returns the process ID of the given graph,{} \spad{\spad{gi}},{} of the domain \spadtype{GraphImage}.
518695`\spad{key(v)} returns the process ID number of the given two-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{TwoDimensionalViewport}.
518749`\spad{key(v)} returns the process ID number of the given three-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{ThreeDimensionalViewport}.
518866`\spad{key?(k,{} t)} tests if \spad{k} is a key in table \spad{t}.
518929`\spad{keys(f)} gives the list of keys of \spad{f}.
519046`\spad{keys(t)} returns the list of keys in table \spad{t}.
519155`\spad{kgraph(objs,{} arrowName)} constructs a graph with vertices (from \spad{objs}) and fully connected arrows,{} that is,{} each object has an arrow to every other object except itself. arrowName is a prefix for all arrow names,{} this will be followed by a number starting at 1 and incremented for each arrow
519211`generate a minimal Klein bottle.
519282`generate a cubical complex of the surface of a Klein bottle.
519364`generate a minimal triangulation of the surface of a Klein bottle.
519451`\spad{kmax([k1,{} ...,{} kn])} returns the top-level \spad{ki} for integration.
519521`\spad{knownHandler?(x,{} n,{} op)} checks whether a handler for operator \spad{op} is known. The number \spad{n} denotes the number of arguments that the operator can take. It is OK if both \spad{knownOperator?(m,{} op)} and \spad{knownOperator?(n,{} op)} return \spad{true} for different \spad{m} and \spad{n}.
519603`\spad{knownInfBasis(n)} \undocumented{}
519700`\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.
519835`\spad{kovacic(a_0,{}a_1,{}a_2,{}ezfactor)} returns either "failed" or \spad{P}(\spad{u}) such that \spad{\$e^{\int(-a_1/2a_2)} e^{\int u}\$} is a solution of \indented{5}{\spad{\$a_2 y'' + a_1 y' + a0 y = 0\$}} whenever \spad{u} is a solution of \spad{P u = 0}. The equation must be already irreducible over the rational functions. Argument \spad{ezfactor} is a factorisation in \spad{UP},{} not necessarily into irreducibles.
519989`Undocumented.
520071`Undocumented.
520135`\spad{krawtchoukK(n,{} p,{} N,{} z)} is the Krawtchouk polynomial.
520205`\spad{krawtchoukK(n,{} p,{} N,{} z)} is the Krawtchouk polynomial.
520268`\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}}
520496`Should be local but conditional.
520730`\spad{kroneckerProduct([a1,{} a2,{} ...,{} an])} calculates the Kronecker product of the matrices \spad{a1},{} \spad{a2},{} ...,{} an. This corresponds to tensor product of corresponding operators.
520878`\spad{kroneckerProduct(a,{} b)} calculates the Kronecker product of the matrices a and \spad{b}. This corresponds to tensor product of corresponding operators.
521022`\spad{kroneckerSum([a1,{} a2,{} ...,{} an])} calculates the Kronecker sum of the matrices \spad{a1},{} \spad{a2},{} ...,{} an.
521148`\spad{kroneckerSum(a,{} b)} calculates the Kronecker sum of the matrices a and \spad{b}.
521426`\spad{ksec(k,{} [k1,{} ...,{} kn],{} x)} returns the second top-level \spad{ki} after \spad{k} involving \spad{x}.
521513`\spad{kummerM(a,{} b,{} z)} is the Kummer \spad{M} function.
521577`\spad{kummerM(mu,{} nu,{} z)} is the Kummer \spad{M} function.
521634`\spad{kummerU(a,{} b,{} z)} is the Kummer \spad{U} function.
521698`\spad{kummerU(mu,{} nu,{} z)} is the Kummer \spad{U} function.
521755`\spad{label(n,{} f)} gives form \spad{f} an equation label \spad{n}.
521854`\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))}.}
521921`\spad{lagrange(g)} produces the power series for \spad{f} where \spad{f} is implicitly defined as \spad{f(z) = z*g(f(z))}.
521999`\spad{LagrangeInterpolation(l1,{} l2)} \undocumented
522095`\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)}.
522197`\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..)}.
522280`\spad{laguerreL(n,{} a,{} z)} is the Laguerre polynomial.
522346`\spad{laguerreL(n,{} a,{} z)} is the Laguerre polynomial.
522405`\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)}.
522507`\spad{Lambda()} returns symbol for capital greek letter lambda.
522559`\spad{lambda()} returns symbol for small greek letter lambda.
522611`Constructs a reference to a bound variable from its deBruijn index
522667`Constructs a reference to a free variable
522707`Constructs a node containing multiple terms
522748`\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}.
522799`Constructs lambda term and bind any variables with the name provided
522899`\spad{lambert(f(x))} returns \spad{f(x) + f(x^2) + f(x^3) + ...}. \indented{1}{\spad{f(x)} should have 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^n)) = exp(lambert(log(f(x))))}.}
522965`\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))))}.
523042`Undocumented
523167`Undocumented
523274`Undocumented
523372`Undocumented
523452`Undocumented
523586`Undocumented
523696`Undocumented
523803`Undocumented
523886`Undocumented
524020`Undocumented
524130`Undocumented
524237`Undocumented
524320`\spad{lambertW0(x)} applies lambertW to \spad{x}. \spad{x} must have no term of order 0.
524403`\spad{lambertW(x)} is the Lambert \spad{W} function at \spad{x}.
524464`\spad{lambertW(x)} is the Lambert \spad{W} function.
524554`\spad{lambertW(x)} is the Lambert \spad{W} function.
524632`\spad{lambertW(z)} = \spad{w} is the principal branch of the solution to the equation \spad{we^w = z}.
524686`\spad{lambertW(x)} is the Lambert \spad{W} function.
524758`\spad{lambertW(x)} is the Lambert \spad{W} function.
524818`\spad{lambintegrate(f,{} dx,{} D1,{} D2,{} extint,{} int)} integrates \spad{f} in extension by LambertW function. \spad{dx} is derivative of the argument of LambertW,{} \spad{D1} is dervative on \spad{F},{} \spad{D2} is derivative on UP,{} \spad{extint} is extended integration function on \spad{F},{} int is integration function on \spad{F}.
525056`Undocumented.
525161`Undocumented.
525239`Undocumented.
525350`Undocumented.
525434`Undocumented.
525523`Undocumented.
525594`\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.
525659`\spad{laplacian(v,{} xlist)} computes the laplacian of the scalar field \spad{v},{} \spad{v} a function of the variables listed in xlist.
525805`\spad{laplacianMatrix(s)} returns matrix also known as "Kirchhoff matrix" or "Admittance matrix" where: entry [\spad{i},{} \spad{j}] = inDegree(\spad{vi}) if \spad{i} = \spad{j} (number of incoming links) \spad{-1} if \spad{i} not = \spad{j} and \spad{vi} is adjacent to \spad{vj} 0 otherwise Alternatively this is defined as \spad{D} - A,{} where \spad{D} is the diagonal degree matrix. It contains both adjacency information and degree information. There are other,{} similar matrices,{} that are also called "Laplacian matrices" of a graph.
525871`\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}.
525953`\spad{largest(l,{} fn)} returns the largest element of \spad{l} where the partial ordering induced by setOrder is completed into a total one by \spad{fn}.
526202`\spad{last(l)} returns the last element of a doubly-linked aggregate \spad{l}. Error: if \spad{l} is empty.
526253`\spad{last(u)} returns the last element of \spad{u}. Note: for lists,{} \spad{last(u) = u.(maxIndex u)}.
526306`\spad{last(ts)} returns the polynomial of \spad{ts} with smallest main variable if \spad{ts} is not empty,{} otherwise returns \spad{"failed"}.
526515`\spad{last(u,{} n)} returns a copy of the last \spad{n} nodes of \spad{u}. Note: \spad{last(u,{} n)} is a list of \spad{n} elements.
526587`\spad{lastSubResultant(a,{} b)} returns \spad{resultant(a,{} b)} if \spad{a} and \spad{b} has no non-trivial \spad{gcd} in \spad{R^(-1) P} otherwise the non-zero sub-resultant with smallest index.
526681`\spad{lastSubResultant(P,{} Q)} computes the last non zero subresultant of \spad{P} and \spad{Q}
526762`\spad{lastSubResultant(a,{} b)} returns the last non-zero subresultant of \spad{a} and \spad{b} where \spad{a} and \spad{b} are assumed to have the same main variable \spad{v} and are viewed as univariate polynomials in \spad{v}.
526858`\spad{lastSubResultant(p1,{} p2,{} ts)} returns \spad{lpwt} such that \spad{lpwt.i.val} is a quasi-monic \spad{gcd} of \spad{p1} and \spad{p2} with respect to \spad{lpwt.i.tower},{} for every \spad{i},{} and such that the list of the \spad{lpwt.i.tower} is a split of Kalkbrener of \spad{ts}. Moreover,{} if \spad{p1} and \spad{p2} do not have a non-trivial \spad{gcd} with respect to \spad{lpwt.i.tower} then \spad{lpwt.i.val} is the resultant of these polynomials with respect to \spad{lpwt.i.tower}. This assumes that \spad{p1} and \spad{p2} have the same main variable and that this variable is greater that any variable occurring in \spad{ts}.
526964`\spad{lastSubResultantElseSplit(p1,{} p2,{} ts)} returns either \spad{g} a quasi-monic \spad{gcd} of \spad{p1} and \spad{p2} with respect to the \spad{ts} or a split of Kalkbrener of \spad{ts}. This assumes that \spad{p1} and \spad{p2} have the same main variable and that this variable is greater that any variable occurring in \spad{ts}.
527068`\spad{lastSubResultantEuclidean(P,{} Q)} computes the last non zero subresultant \spad{S} and carries out the equality \spad{coef1*P + coef2*Q = S}.
527244`\spad{latex(s)} returns a LaTeX-printable output representation of \spad{s}.
527288`construct a lattice with one element
527400`construct a lattice with one element
527512`\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.
527584`\spad{laurent(x)} returns \spad{x} viewed as a Laurent series.
527660`\spad{laurent(f(x))} converts the Puiseux series \spad{f(x)} to a Laurent series if possible. Error: if this is not possible.
528017`\spad{laurent(f,{} x = a)} expands the expression \spad{f} as a Laurent series in powers of \spad{(x - a)}.
528102`\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}.
528182`\spad{laurent(n,{} st)} returns \spad{xn * series st} where \spad{xn = monomial(1,{} n)} and \spad{series st} stands for the power series with coefficients given by the stream st.
528268`\spad{laurent(n,{} f(x))} returns \spad{x^n * f(x)}.
528360`\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)}.
528477`\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}.
528683`\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)}.
528852`\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)}.
529128`\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.
529233`\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)]}.
529320`\spad{LazardQuotient2(F,{} x,{} y,{} n)} computes \spad{(x^(n-1) * F) exquo y^(n-1)}
529418`\spad{LazardQuotient2(p,{} a,{} b,{} n)} returns \spad{(a^(n-1) * p) exquo b^(n-1)} assuming that this quotient does not fail.
529534`\spad{LazardQuotient(x,{} y,{} n)} computes \spad{x^n exquo y^(n-1)}
529623`\spad{LazardQuotient(a,{} b,{} n)} returns \spad{a^n exquo b^(n-1)} assuming that this quotient does not fail.
529736`\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}.
529792`\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
529849`\spad{lazyGintegrate(f,{} r,{} g)} is used for fixed point computations.
529964`\spad{lazyIntegrate(r,{} f)} is a version of integrate used for fixed point computations.
530086`\spad{lazyIntegrate(c,{} f)} integrates with constant term \spad{c},{} this is simply the right shift
530192`\spad{lazyIrreducibleFactors(lp)} returns \spad{lf} such that if \spad{lp = [p1,{} ...,{} pn]} and \spad{lf = [f1,{} ...,{} fm]} then \spad{p1*p2*...*pn=0} means \spad{f1*f2*...*fm=0},{} and the \spad{\spad{fi}} are irreducible over \spad{R} and are pairwise distinct. The algorithm tries to avoid factorization into irreducible factors as far as possible and makes previously use of \spad{gcd} techniques over \spad{R}.
530421`\spad{lazyPquo(a,{} b)} returns the polynomial \spad{q} such that \spad{lazyPseudoDivide(a,{} b)} returns \spad{[c,{} g,{} q,{} r]}.
530555`\spad{lazyPquo(a,{} b,{} v)} returns the polynomial \spad{q} such that \spad{lazyPseudoDivide(a,{} b,{} v)} returns \spad{[c,{} g,{} q,{} r]}.
530689`\spad{lazyPrem(a,{} b)} returns the polynomial \spad{r} reduced with respect to \spad{b} and such that \spad{b} divides \spad{init(b)^e a - r} where \spad{e} is the number of steps of this pseudo-division.
530823`\spad{lazyPrem(a,{} b,{} v)} returns the polynomial \spad{r} reduced with respect to \spad{b} viewed as univariate polynomials in the variable \spad{v} such that \spad{b} divides \spad{init(b)^e a - r} where \spad{e} is the number of steps of this pseudo-division.
531016`\spad{lazyPremWithDefault(a,{} b)} returns \spad{[c,{} g,{} r]} such that \spad{r = lazyPrem(a,{} b)} and \spad{(c^g)*r = prem(a,{} b)}.
531268`\spad{lazyPremWithDefault(a,{} b,{} v)} returns \spad{[c,{} g,{} r]} such that \spad{r = lazyPrem(a,{} b,{} v)} and \spad{(c^g)*r = prem(a,{} b,{} v)}.
531396`\spad{lazyPseudoDivide(a,{} b)} returns \spad{[c,{} g,{} q,{} r]} such that \spad{c^n * a = q*b +r} and \spad{lazyResidueClass(a,{} b)} returns \spad{[r,{} c,{} n]} where \spad{n + g = max(0,{} degree(b) - degree(a) + 1)}.
531660`\spad{lazyPseudoDivide(a,{} b)} returns \spad{[c,{} g,{} q,{} r]} such that \spad{[c,{} g,{} r] = lazyPremWithDefault(a,{} b)} and \spad{q} is the pseudo-quotient computed in this lazy pseudo-division.
531928`\spad{lazyPseudoDivide(a,{} b,{} v)} returns \spad{[c,{} g,{} q,{} r]} such that \spad{r = lazyPrem(a,{} b,{} v)},{} \spad{(c^g)*r = prem(a,{} b,{} v)} and \spad{q} is the pseudo-quotient computed in this lazy pseudo-division.
532064`\spad{lazyPseudoQuotient(a,{} b)} returns \spad{q} if \spad{lazyPseudoDivide(a,{} b)} returns \spad{[c,{} g,{} q,{} r]}
532139`\spad{lazyPseudoRemainder(a,{} b)} returns \spad{r} if \spad{lazyResidueClass(a,{} b)} returns \spad{[r,{} c,{} n]}. This lazy pseudo-remainder is computed by means of the \spadopFrom{fmecg}{NewSparseUnivariatePolynomial} operation.
532215`\spad{lazyResidueClass(a,{} b)} returns \spad{[r,{} c,{} n]} such that \spad{r} is reduced with respect to \spad{b} and \spad{b} divides \spad{c^n * a - r} where \spad{c} is \spad{leadingCoefficient(b)} and \spad{n} is as small as possible with the previous properties.
532459`\spad{lazyResidueClass(a,{} b)} returns \spad{[p,{} q,{} n]} where \spad{p / q^n} represents the residue class of \spad{a} modulo \spad{b} and \spad{p} is reduced with respect to \spad{b} and \spad{q} is \spad{init(b)}.
532583`\spad{lazyVariations(l,{} s1,{} sn)} is the number of sign variations in the list of non null numbers [s1::l]\spad{@sn},{}
532739`left contraction inner product
532831`\spad{lcm(l)} returns the least common multiple of the elements of the list \spad{l}.
532908`\spad{lcm(x,{} y)} returns the least common multiple of \spad{x} and \spad{y}.
532945`\spad{lcm(a,{} lo,{} \spad{hi},{} p)} computes \spad{lcm} of elements a(\spad{lo}),{} a(\spad{lo+1}),{} ...,{} a(\spad{hi}).
533056`\spad{lcmCoef(c1,{} c2)} computes (llcm_res,{} \spad{coeff1},{} \spad{coeff2}) such that llcm_res is least left common multiple of \spad{c1} and \spad{c2} and llcm_res = \spad{coeff1*c1} = \spad{coeff2*c2}
533209`\spad{lcx0(x,{} lv)} computes leading coefficient of \spad{x} and corresponding product of variables (monomial with coefficient 1) with respect to variables in \spad{lv} Variables in \spad{lv} must be decreasing and bigger than all other variables of \spad{x}.
533408`\spad{lcz(x,{} z)} computes leading coefficient and degree of \spad{x} with respect to variable \spad{z}.
533558`\spad{ldegree(p,{} v)} computes degree of \spad{p} with respect to \spad{v}. \spad{v} must be one of auxiliary variables and must be lexicographically first variable which appears in \spad{p}. Moreover,{} \spad{p} must be a polynomial in \spad{v} (not a rational function).
533645`\spad{ldivide(a,{} b)} returns [\spad{c},{} \spad{r}] such that a = \spad{b*c} + \spad{r},{} \spad{r} is is of minimal possible degree and homogeneous part of of \spad{r} of maximal degree contains no terms divisible from left by leading term of \spad{b}.
533837`\spad{LE(x,{} y)} returns the \spadtype{Switch} expression representing \spad{x<=y}.
534083`\spad{le(s,{} x,{} y)} returns \spad{true} if and only if \spad{x} is less than or equal to \spad{y}. Note: at first glance we would like to use '<='. But le needs 3 arguments while '<=' has only 2.
534195`\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.
534263`\spad{leadingBasisTerm(p)} returns the leading basis term of antisymmetric polynomial \spad{p}.
534318`\spad{leadingBasisTerm(df)} returns the leading basis term of differential form \spad{df}.
534391`\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.
534538`\spad{leadingCoefficient(df)} returns the leading coefficient of differential form \spad{df}.
534632`\spad{leadingCoefficient(p)} returns the coefficient of the highest degree term of \spad{p}.
534712`\spad{leadingCoefficient(p)} returns the leading coefficient of antisymmetric polynomial \spad{p}.
534769`\spad{leadingCoefficient(x)} \undocumented
534849`\spad{leadingCoefficient }\undocumented
535069`\spad{leadingCoefficient(f)} returns the coefficient of the lowest order term of \spad{f}
535223`\spad{leadingCoefficient(p,{} v)} returns the leading coefficient of \spad{p},{} where \spad{p} is viewed as A univariate polynomial in \spad{v}.
535300`\spad{leadingCoefficientRicDE(op)} returns \spad{[[m1,{} p1],{} [m2,{} p2],{} ... ,{} [mk,{} pk]]} such that the polynomial part of any rational solution of the associated Riccati equation of \spad{op y = 0} must have degree \spad{mj} for some \spad{j},{} and its leading coefficient is then a zero of \spad{pj}. In addition,{} \spad{m1>m2> ... >mk}.
535415`\spad{leadingDer(fun)} yields the leading derivative of \spad{fun}. If \spad{fun} contains no derivatives \spad{1} is returned.
535539`\spad{leadingExponent(x)} \undocumented
535616`\spad{leadingIdeal(I)} is the ideal generated by the leading terms of the elements of the ideal \spad{I}.
535688`\spad{leadingIndex(x)} \undocumented
535822`\spad{leadingMonomial(x)} returns the monomial supported by the first element from \spad{S}. Error: if \spad{x} has no support.
535904`\spad{leadingMonomial(p)} returns the monomial of \spad{p} with the highest degree.
535981`\spad{leadingMonomial(x)} \undocumented
536157`\spad{leadingMonomial(f)} returns the monomial of \spad{f} of lowest order.
536288`\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.
536369`\spad{leadingTerm(x)} returns the leading (with respect to the ordering on the indexing set) term of \spad{z}. Error: if \spad{z} has no support.
536631`\spad{leaf?(x)} \undocumented
536678`\spad{leaf?(u)} tests if \spad{u} is a terminal node.
536733`\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}.
536933`\spad{leastMonomial(p)} returns an error if \spad{p} is \spad{O},{} otherwise,{} if \spad{p} belongs to \spad{R} returns \spad{1},{} otherwise,{} the monomial of \spad{p} with lowest degree,{} where \spad{p} is viewed as a univariate polynomial in its main variable.
537003`\spad{leastPower(p,{} n)} returns \spad{e},{} where \spad{e} is the smallest integer such that \spad{p ^e >= n}
537343`\spad{leaves(u)} returns the list of leaves in aggregate \spad{u}.
537399`\spad{left(x)} returns left subtree of \spad{x} or error if \spadopFrom{retractable?}{FreeMagma}(\spad{x}) is \spad{true}.
537443`\spad{left(x)} returns left subtree of \spad{x} or error if \spadopFrom{retractable?}{LyndonWord}(\spad{x}) is \spad{true}.
537488`\spad{left(f)} left-justifies form \spad{f} in total space.
537525`\spad{left(a)} returns the left child.
537579`\spad{left(rootChar)} is the left bound of the isolating interval
537670`\spad{left(f,{} n)} left-justifies form \spad{f} within space of width \spad{n}.
537715`\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\spad{'t} know whether \spad{2*a=0} implies \spad{a=0}.
537796`\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\spad{'t} know whether \spad{2*a=0} implies \spad{a=0}.
537985`\spad{leftCharacteristicPolynomial(a)} returns the characteristic polynomial of the left regular representation of \spad{a} with respect to any basis.
538098`\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())}.
538169`\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())}.
538391`\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]))}.
538472`\spad{leftDivide(a,{} b)} returns the pair \spad{[q,{} r]} such that \spad{a = b*q + r} and the degree of \spad{r} is less than the degree of \spad{b}. This process is called ``left division\spad{''}.
538583`\spad{leftDivide(a,{} b,{} sigma)} returns the pair \spad{[q,{} r]} such that \spad{a = b*q + r} and the degree of \spad{r} is less than the degree of \spad{b}. This process is called ``left division\spad{''}. \spad{\sigma} is the morphism to use.
538806`\spad{leftExactQuotient(a,{} b)} computes the value \spad{q},{} if it exists,{} \indented{1}{such that \spad{a = b*q}.}
539018`\spad{leftExtendedGcd(a,{} b)} returns \spad{[c,{} d,{} g]} such that \spad{g = a * c + b * d = leftGcd(a,{} b)}.
539139`\spad{left_ext_GCD(a,{} b)} returns [\spad{g},{} \spad{u0},{} \spad{v0},{} \spad{u},{} \spad{v}] where \spad{g} is left \spad{GCD} of a and \spad{b},{} \spad{g} = \spad{a*u0} + \spad{b*v0} and au = - \spad{bv} is least common right multiple of a and \spad{b} when a and \spad{b} have least common right multiple. Otherwise left_ext_GCD(a,{} \spad{b}) returns "failed".
539434`\spad{leftFactor(f,{}k)} returns the left factor of rank \spad{k} of a polynomial \spad{f} or 1 if it\spad{'s} not possible by linear techniques.
539512`\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.
539617`\spad{leftFamily(f)} prints the left family s=A^-1*v.
539756`\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.
539835`\spad{leftIdentity(p)} returns the left identity matrix.
539976`\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.
540159`\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.
540286`\spad{leftMinimization(f,{} i_min,{} i_max)} tries to apply a left minimization step with respect to the pivot block with the rows/columns (\spad{i_min},{} ...,{} i_max).
540389`\spad{leftMult(s,{} a)} returns \spad{s * a} where \spad{*} is the monoid operation,{} which is assumed non-commutative.
540506`\spad{leftNorm(a)} returns the determinant of the left regular representation of \spad{a}.
540571`\spad{leftOne(eq)} divides by the left hand side.
540640`\spad{leftOne(eq)} divides by the left hand side.
540885`\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}.
540949`\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}.
541072`\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.
541156`\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.
541223`\spad{leftRankPolynomial()} returns the left minimimal polynomial of the generic element
541376`\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.
541489`\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.
541751`\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\spad{'t} exist or cannot be determined (see unitsKnown).
541854`\spad{leftRecip(a)} returns an element,{} which is a left inverse of \spad{a},{} or \spad{"failed"} if such an element doesn\spad{'t} exist or cannot be determined (see unitsKnown).
541999`\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.
542277`\spad{leftRegularRepresentation(a,{} [v1,{} ...,{} vn])} returns the matrix \spad{m} of the linear map defined by left multiplication by \spad{a} with respect to the \spad{R}-module basis \spad{b = [v1,{} ...,{} vn]}. That is for all \spad{x} \spad{coordinates(a*x,{} b) = m*coordinates(x,{} b)}.
542448`\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.
542533`\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.
542699`\spad{leftTrace(a)} returns the trace of the left regular representation of \spad{a}.
542765`\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.
542843`\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.
543086`\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}.
543223`\spad{leftTrim(s,{} cc)} returns \spad{s} with all leading characters in \spad{cc} deleted. For example,{} \spad{leftTrim("(abc)",{} charClass "()")} returns \spad{"abc)"}.
543284`\spad{leftTrim(u,{} x)} returns a copy of \spad{u} with all leading \spad{x} deleted. For example,{} \spad{leftTrim(" abc ",{} char " ")} returns \spad{"abc "}.
543453`\spad{leftUnit()} returns a left unit of the algebra (not necessarily unique),{} or \spad{"failed"} if there is none.
543554`\spad{leftUnits()} returns the affine space of all left units of the algebra,{} or \spad{"failed"} if there is none
543784`\spad{leftUnits()} returns the affine space of all left units of the algebra,{} or \spad{"failed"} if there is none.
543919`\spad{leftZero(eq)} subtracts the left hand side.
543980`\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)}.
544092`\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)}.
544171`\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..)}.
544287`\spad{legendreP(nu,{} mu,{} z)} is the Legendre \spad{P} function.
544353`\spad{legendreP(nu,{} mu,{} z)} is the Legendre \spad{P} function.
544412`\spad{legendreQ(nu,{} mu,{} z)} is the Legendre \spad{Q} function.
544478`\spad{legendreQ(nu,{} mu,{} z)} is the Legendre \spad{Q} function.
544537`\spad{length(x)} returns the length of \spad{x}.
544596`\spad{length([l1]*[l2]*...[ln])} returns the length of the word \spad{l1*l2*...*ln}.
544681`\spad{length(x)} returns the number of entries in \spad{x}.
544741`\spad{length(x)} returns the number of entries in \spad{x}.
544846`\spad{length(p)} returns the sum of the absolute values of the coefficients of the polynomial \spad{p}.
544917`\spad{length(a)} length of \spad{a} in digits.
544965`\spad{length(v)} computes the sqrt(dot(\spad{v},{} \spad{v})),{} \spadignore{i.e.} the euclidean length
545050`\spad{lepol }\undocumented
545126`\spad{lerchPhi(z,{} s,{} a)} is the Lerch Phi function.
545191`\spad{lerchPhi(z,{} s,{} a)} is the Lerch Phi function.
545549`\spad{less?(a,{} b)} compares \spad{a} and \spad{b} in the partial ordering induced by setOrder.
545630`\spad{less?(u,{} n)} tests if \spad{u} has less than \spad{n} elements.
545692`\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.
545772`\spad{level(s)} returns a non negative integer which is the current level field of the indicated 3 dimensional subspace \spad{s}.
545830`\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}.
545896`\spad{lex(ls)} sorts a list of pairs to lexicographic order
545964`\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}.
546062`\spad{lexico(x,{} y)} returns \spad{true} iff \spad{x} is smaller than\spad{y} with respect to the lexicographical ordering induced by \spad{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.
546116`\spad{lexico(x,{} y)} returns \spad{true} iff \spad{x} is smaller than \spad{y} with respect to the pure lexicographical ordering induced by \spad{S}.
546183`\spad{lexico(x,{} y)} returns \spad{true} iff \spad{x} is smaller than \spad{y} with respect to the lexicographical ordering induced by \spad{VarSet}.
546238`\spad{lexSmaller?(f,{} g)} compares monic \spad{f} and \spad{g} of the same degree in the following order. Error: if \spad{f} or \spad{g} is not monic or if \spad{f} and \spad{g} have different degrees or if common degree is 0. \spad{f < g} if the number of monomials of \spad{f} is less than this number for \spad{g}. If \spad{f} and \spad{g} have the same number of monomials,{} the lists of exponents are compared lexicographically. If these lists are also equal,{} the lists of coefficients are compared according to the lexicographic ordering induced by the ordering of the elements of {\em GF} given by {\em lookup}.
546370`\spad{lexTriangular(base,{} norm?)} decomposes the variety associated with \spad{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 \spad{base} needs to be a lexicographical Groebner basis of a zero-dimensional ideal. If \spad{norm?} is \spad{true} then the regular sets are normalized.
546526`\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.
546637`\spad{lfintegrate(f,{} x)} = \spad{g} such that \spad{dg/dx = f}.
546723`\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
546780`\spad{lhs(f)} returns the left side of \spad{f}
546822`\spad{lhs(r)} returns the left hand side of the rule \spad{r}.
546869`\spad{lhs(eqn)} returns the left hand side of equation \spad{eqn}.
546906`\spad{\spad{li}(f)} denotes the logarithmic integral
546955`\spad{\spad{li}(x)} returns the logarithmic integral of \spad{x},{} \spadignore{i.e.} the integral of \spad{dx / log(x)}.
547007`\spad{\spad{li}(f)} denotes the logarithmic integral
547150`\spad{\spad{li}(f)} denotes the logarithmic integral
547207`\spad{li2(z)} is polylog(2,{} \spad{z})
547280`\spad{library(ln)} creates a new library file.
547324`\spad{lie(v,{} w)} calculates the Lie derivative of \spad{w} with respect to \spad{v}. (This yields the commutator of the fields.)
547372`\spad{lie(v,{} om)} calculates the Lie derivative of \spad{om} with respect to \spad{v}.
547440`\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.
547519`\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.
547595`\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}.
547671`\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}.
547744`\spad{LiePoly(l)} returns the bracketed form of \spad{l} as a Lie polynomial.
547815`\spad{LiePolyIfCan(p)} return \spad{p} if \spad{p} is a Lie polynomial.
547912`\spad{LiePolyIfCan(p)} returns \spad{p} in Lyndon basis if \spad{p} is a Lie polynomial,{} otherwise \spad{"failed"} is returned.
548017`\spad{lift(x)} return the canonical representative of the equivalence class \spad{x}
548085`\spad{lift(x)} returns \spad{x} as a polynomial.
548200`\spad{lift(z)} returns a minimal degree univariate polynomial up such that \spad{z=reduce up}.
548250`\spad{lift(u,{} k)} \undocumented
548408`\spad{lift should} be local
548651`\spad{lifting(u,{} lv,{} lu,{} lr,{} lp,{} ln,{} gen_solv)} lifts univariate factorization,{} returning recovered factors or "failed" in case of bad reduction. \spad{u} is multivariate polynomial to factor,{} \spad{lu} is list of univariate factors,{} \spad{lv} is list of variables,{} \spad{ln} is list of degrees corresponding to variables,{} \spad{lr} is list of evaluation points,{} \spad{lp} is list of leading coefficients of factors if known,{} empty otherwise,{} gen_solv delivers solver for polynomial equations
549014`\spad{lifting(u,{} lv,{} lu,{} lr,{} lp,{} ln,{} r)} is lifting(\spad{u},{} \spad{lv},{} \spad{lu},{} \spad{lr},{} \spad{lp},{} \spad{ln},{} solv(\spad{r})) where solv(\spad{r}) is solver using reduction modulo \spad{r} and lifting. Memberes of \spad{lu} must be relatively prime modulo \spad{r}
549261`\spad{light(c)} sets the shade of a hue,{} \spad{c},{} to it\spad{'s} highest value.
549300`\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}.
549376`\spad{li_int(f,{} k,{} x)} generates logarithmic integrals.
549650`apply 'function' represented by this graph to 'a' repeatedly until we reach a loop which is returned as a sequence of vertex indexes.
549716`\spad{limit(f(x),{} x = a)} computes the real limit \spad{lim(x -> a,{} f(x))}.
549955`\spad{limit(f(x),{} x = a)} computes the real two-sided limit of \spad{f} as its argument \spad{x} approaches \spad{a}.
550282`\spad{limit(f(x),{} x = a)} computes the real two-sided limit of \spad{f} as its argument \spad{x} approaches \spad{a}.
550618`apply 'function' represented by this graph to 'a' repeatedly until we reach a loop which is returned as a sequence of vertex indexes.
550708`\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))}.
550822`\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.
551001`\spad{limitPart(o)} = \spad{l} when \spad{o} = \spad{l} + \spad{n} and \spad{l} is a limit ordinal and \spad{n} is a nonnegative integer
551045`\spad{limitPlus(f(var))} returns \spad{limit(var -> a+,{} f(var))}.
551147`\spad{limitPlus(f(var))} returns \spad{limit(var -> cen+,{} f(var))}.
551278`\spad{lin_comb(v,{} [f1,{} ...,{} fn])} computes linear combination \spad{v}(1) \spad{f1} + ... \spad{v}(\spad{n}) \spad{fn}. Vector \spad{v} and list [\spad{f1},{} ...,{} \spad{fn}] must be of equal length.
551357`\spad{lin_comb(v,{} [f1,{} ...,{} fn])} computes linear combination \spad{v}(1) \spad{f1} + ... \spad{v}(\spad{n}) \spad{fn}. Vector \spad{v} and list [\spad{f1},{} ...,{} \spad{fn}] must be of equal length.
551458`\spad{lin_comb(v,{} [f1,{} ...,{} fn])} computes linear combination \spad{v}(1) \spad{f1} + ... \spad{v}(\spad{n}) \spad{fn}. Vector \spad{v} and list [\spad{f1},{} ...,{} \spad{fn}] must be of equal length.
551581`\spad{lin_comb(v,{} [f1,{} ...,{} fn])} computes linear combination \spad{v}(1) \spad{f1} + ... \spad{v}(\spad{n}) \spad{fn}. Vector \spad{v} and list [\spad{f1},{} ...,{} \spad{fn}] must be of equal length.
551662`\spad{lin_comb(v,{} [f1,{} ...,{} fn])} computes linear combination \spad{v}(1) \spad{f1} + ... \spad{v}(\spad{n}) \spad{fn}. Vector \spad{v} and list [\spad{f1},{} ...,{} \spad{fn}] must be of equal positive length.
551757`\spad{lin_comb(v,{} [f1,{} ...,{} fn])} computes linear combination \spad{v}(1) \spad{f1} + ... \spad{v}(\spad{n}) \spad{fn}. Vector \spad{v} and list [\spad{f1},{} ...,{} \spad{fn}] must be of equal length.
551852`\spad{lin_comb(v,{} [f1,{} ...,{} fn])} computes linear combination \spad{v}(1) \spad{f1} + ... \spad{v}(\spad{n}) \spad{fn}. Vector \spad{v} and list [\spad{f1},{} ...,{} \spad{fn}] must be of equal length.
551969`\spad{lin_comb!(v,{} w,{} [f1,{} ...,{} fn])} computes linear combination \spad{w} + \spad{v}(1) \spad{f1} + ... \spad{v}(\spad{n}) \spad{fn} by modifying \spad{w} in place. Vector \spad{v} and list [\spad{f1},{} ...,{} \spad{fn}] must be of equal length.
552075`create a simplicial complex containing a line.
552155`\spad{linear?(p)} returns \spad{true} iff \spad{p} does not lie in the base ring \spad{R} and has main degree \spad{1}.
552229`\spad{linear(u)} \undocumented
552299`\spad{linear(f,{} g)} \undocumented
552472`\spad{linearAssociatedExp(a,{} f)} is linear over {\em F},{} \spadignore{i.e.} for elements {\em a} from {\em \$},{} {\em c,{} d} form {\em F} and {\em f,{} g} univariate polynomials over {\em F} we have \spadfun{linearAssociatedExp}(a,{} cf+dg) equals {\em c} times \spadfun{linearAssociatedExp}(a,{} \spad{f}) plus {\em d} times \spadfun{linearAssociatedExp}(a,{} \spad{g}). Therefore \spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\em F[X]}: \spadfun{linearAssociatedExp}(a,{} monomial(1,{} \spad{k})\spad{\$}SUP(\spad{F})) is defined to be \spadfun{Frobenius}(a,{} \spad{k}) which is {\em a^(q^k)},{} where {\em q=size()\$F}.
552689`\spad{linearAssociatedLog(a)} returns a polynomial {\em g},{} such that \spadfun{linearAssociatedExp}(normalElement(),{} \spad{g}) equals {\em a}.
552922`\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.
553157`\spad{linearAssociatedOrder(a)} returns the monic polynomial {\em g} of least degree,{} such that \spadfun{linearAssociatedExp}(a,{} \spad{g}) is 0.
553274`\spad{linearDependence([v1,{} ...,{} vn])} returns \spad{[c1,{} ...,{} cn]} if \spad{c1*v1 + ... + cn*vn = 0} and not all the \spad{ci}\spad{'s} are 0,{} "failed" if the \spad{vi}\spad{'s} are linearly independent over \spad{S}.
553366`\spad{linearlyDependenceOverConstants([v1,{} ...,{} vn],{} ld)} returns \spad{[c1,{} ...,{} cn]} if \spad{c1*v1 + ... + cn*vn = 0} and not all the \spad{ci}\spad{'s} are 0,{} "failed" if the \spad{vi}\spad{'s} are linearly independent over constants.
553492`\spad{linearlyDependenceOverZ([v1,{} ...,{} vn])} returns \spad{[c1,{} ...,{} cn]} if \spad{c1*v1 + ... + cn*vn = 0} and not all the \spad{ci}\spad{'s} are 0,{} "failed" if the \spad{vi}\spad{'s} are linearly independent over the integers.
553600`\spad{linearExtend: (f,{} x)} returns the linear extension of a multilinear map defined on the basis of \spad{M2} applied to a linear combination
553704`\spad{linearExtend: (f,{} x)} returns the linear extension of a map defined on the basis of \spad{M2} applied to a linear combination
553780`\spad{linearExtend: (f,{} x)} returns the linear extension of a map defined on the basis applied to a linear combination
553867`\spad{linearization(f)} returns the element \spad{f} as linearization with entries represented by admissible linear systems in minimal refined form.
553937`\spad{linearization(f)} returns the element \spad{f} as linearization.
554035`\spad{linearize(sys)} tries to retract all equations in \spad{sys} to a linear one. If that is not possible,{} an error occurs.
554255`\spad{linearlyDependent?([v1,{} ...,{} vn])} returns \spad{true} if the \spad{vi}\spad{'s} are linearly dependent over \spad{S},{} \spad{false} otherwise.
554331`\spad{linearlyDependentOverConstants?([v1,{} ...,{} vn],{} ld)} returns \spad{true} if the \spad{vi}\spad{'s} are linearly dependent over constants,{} \spad{false} otherwise.
554441`\spad{linearlyDependentOverZ?([v1,{} ...,{} vn])} returns \spad{true} if the \spad{vi}\spad{'s} are linearly dependent over the integers,{} \spad{false} otherwise.
554527`\spad{linearPolynomials(lp)} returns \spad{lps,{} nlps} where \spad{lps} is a list of the linear polynomials in \spad{lp},{} and \spad{nlps} are the other ones.
554650`\spad{linearSearch(f)} searches the cache,{} calling \spad{f(y)} find desired \spad{y}. It returns \spad{y} from cache if \spad{f}(\spad{y}) is \spad{true} or "failed" if no such \spad{y} exists.
554726`\spad{lineColorDefault()} returns the default color of lines connecting points in a 2D viewport.
554789`\spad{lineColorDefault(p)} sets the default color of lines connecting points in a 2D viewport to the palette \spad{p}.
554859`\spad{lineIntersect(n,{} p)} returns the point where a line,{} from the centre of the boundary to the point \spad{p},{} intersects with the boundary. \spad{n:} \% is the boundary \spad{p:} \spad{PT} is the point at the end of the line (outside boundary)
554912`\spad{lines(box)} returns the contents of the \spad{box} as strings (all of the same length (width(\spad{box})).
554960`\spad{linGenPos }\undocumented
555151`\spad{link(m,{} n)} returns a line which is the shortest distance between the two boundaries. The line is represented by its two endpoints. \spad{m:} \% is the first boundary to be linked \spad{n:} \% is the second boundary to be linked
555200`a simplicial complex with one link
555279`The 'link' of a simplicial complex and a vertex contains the boundary of the simplexes of \spad{s} which include simplex.
555347`\spad{lin_sol(eql,{} vl)} solves system of equations \spad{eql} for variables in \spad{vl}. Equations must be linear in variables from \spad{vl}.
555444`\spad{linSolve(lp,{} lvar)} finds the solutions of the linear system of polynomials \spad{lp} = 0 with respect to the list of symbols lvar.
555614`\spad{lintgcd([a1,{} ..,{} ak])} = \spad{gcd} of a list of integers
555713`\spad{list?(s)} is \spad{true} if \spad{s} is a Lisp list,{} possibly ().
555783`\spad{list(x)} returns the list of one element \spad{x}.
555826`\spad{listBranches(c)} returns a list of lists of points,{} representing the branches of the curve \spad{c}.
555917`\spad{listBranches(c)} returns a list of lists of points,{} representing the branches of the curve \spad{c}.
556008`\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.
556242`\spad{listLoops(t)} returns the list of lists of points,{} or the 'loops',{} of the given tube plot \spad{t}.
556400`\spad{listOfLists(m)} returns the rows of the matrix \spad{m} as a list of lists.
556486`\spad{listOfLists(m)} returns the rows of the array \spad{m} as a list of lists.
556570`\spad{listOfLists t} converts a tableau \spad{t} to a list of lists.
556626`\spad{listOfMonoms(l)} returns the list of the monomials forming \spad{l}.
556706`\spad{listOfTerms([l1]*[l2]*...[ln])} returns the list of words \spad{l1,{} l2,{} .... ln}.
556802`\spad{listOfTerms(p)} returns the internal representation of \spad{p}.
556925`\spad{listOfTerms(x)} returns a list \spad{lt} of terms with type \spad{Record(k: S,{} c: R)} such that \spad{x} equals \spad{construct(lt)}. If \spad{S has Comparable} than \spad{x} equals \spad{constructOrdered(lt)}.
557012`\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.
557104`\spad{lists(r)} returns the list of matches that match lists.
557183`\spad{listYoungTableaus(lambda)} where {\em lambda} is a proper partition generates the list of all standard tableaus of shape {\em lambda} by means of lattice permutations. The numbers of the lattice permutation are interpreted as column labels. Hence the contents of these lattice permutations are the conjugate of {\em lambda}. Notes: the functions {\em nextLatticePermutation} and {\em makeYoungTableau} are used. The entries are from {\em 0,{} ...,{} n-1}.
557290`evaluation routine
557416`evaluation routine
557582`modular reduction
557729`\spad{LLL(m)} computes \spad{LLL} reduction of \spad{m} \spad{LLL}(\spad{m}) is the same as extendedLLL!(copy \spad{m},{} ncols \spad{m}).
557795`\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.
557879`\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.
557952`\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.
558038`\spad{localAbs(fcn)} = \spad{abs(fcn)} or \spad{sqrt(fcn^2)} depending on whether or not FE has a function \spad{abs}. This should be a local function,{} but the compiler won\spad{'t} allow it.
558118`\spad{localAbs(fcn)} = \spad{abs(fcn)} or \spad{sqrt(fcn^2)} depending on whether or not FE has a function \spad{abs}. This should be a local function,{} but the compiler won\spad{'t} allow it.
558230`\spad{integralBasis(p)} returns a record \spad{[basis,{} basisDen,{} basisInv]} containing information regarding the local integral closure of \spad{Z} at the prime \spad{p} in the quotient field of \spad{F},{} where \spad{F} is a framed algebra with \spad{Z}-module basis \spad{w1,{} w2,{} ...,{} wn}. If \spad{basis} is the matrix \spad{(aij,{} i = 1..n,{} j = 1..n)},{} then the \spad{i}th element of the integral basis is \spad{\spad{vi} = (1/basisDen) * sum(aij * wj,{} j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of \spad{basis} contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix \spad{basisInv} contains the coordinates of \spad{\spad{wi}} with respect to the basis \spad{v1,{} ...,{} vn}: if \spad{basisInv} is the matrix \spad{(bij,{} i = 1..n,{} j = 1..n)},{} then \spad{\spad{wi} = sum(bij * vj,{} j = 1..n)}.
558377`\spad{integralBasis(p)} returns a record \spad{[basis,{} basisDen,{} basisInv]} containing information regarding the local integral closure of \spad{R} at the prime \spad{p} in the quotient field of \spad{F},{} where \spad{F} is a framed algebra with \spad{R}-module basis \spad{w1,{} w2,{} ...,{} wn}. If \spad{basis} is the matrix \spad{(aij,{} i = 1..n,{} j = 1..n)},{} then the \spad{i}th element of the local integral basis is \spad{\spad{vi} = (1/basisDen) * sum(aij * wj,{} j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of \spad{basis} contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix \spad{basisInv} contains the coordinates of \spad{\spad{wi}} with respect to the basis \spad{v1,{} ...,{} vn}: if \spad{basisInv} is the matrix \spad{(bij,{} i = 1..n,{} j = 1..n)},{} then \spad{\spad{wi} = sum(bij * vj,{} j = 1..n)}.
558504`\spad{integralBasis(p)} returns a record \spad{[basis,{} basisDen,{} basisInv] } containing information regarding the local integral closure of \spad{R} at the prime \spad{p} in the quotient field of the framed algebra \spad{F}. \spad{F} is a framed algebra with \spad{R}-module basis \spad{w1,{} w2,{} ...,{} wn}. If 'basis' is the matrix \spad{(aij,{} i = 1..n,{} j = 1..n)},{} then the \spad{i}th element of the local integral basis is \spad{\spad{vi} = (1/basisDen) * sum(aij * wj,{} j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of 'basis' contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix 'basisInv' contains the coordinates of \spad{\spad{wi}} with respect to the basis \spad{v1,{} ...,{} vn}: if 'basisInv' is the matrix \spad{(bij,{} i = 1..n,{} j = 1..n)},{} then \spad{\spad{wi} = sum(bij * vj,{} j = 1..n)}.
558642`\spad{integralBasis(p)} returns a record \spad{[basis,{} basisDen,{} basisInv]} containing information regarding the local integral closure of \spad{R} at the prime \spad{p} in the quotient field of \spad{F},{} where \spad{F} is a framed algebra with \spad{R}-module basis \spad{w1,{} w2,{} ...,{} wn}. If \spad{basis} is the matrix \spad{(aij,{} i = 1..n,{} j = 1..n)},{} then the \spad{i}th element of the local integral basis is \spad{\spad{vi} = (1/basisDen) * sum(aij * wj,{} j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of \spad{basis} contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix \spad{basisInv} contains the coordinates of \spad{\spad{wi}} with respect to the basis \spad{v1,{} ...,{} vn}: if \spad{basisInv} is the matrix \spad{(bij,{} i = 1..n,{} j = 1..n)},{} then \spad{\spad{wi} = sum(bij * vj,{} j = 1..n)}.
558775`\spad{localReal?(x)} should be local but conditional
558837`\spad{LODO2FUN(op)} returns the function to pass to the series ODE solver in order to solve \spad{op y = 0}.
558906`\spad{log10()} returns \spad{ln 10}: \spad{2.3025809299...}.
558938`\spad{log10(x)} represents the Fortran intrinsic function \spad{LOG10}
559018`\spad{log10(b)} computes approximation to log(10) accurate to at least \spad{b} bits.
559124`\spad{log10(x)} computes the logarithm with base 10 for \spad{x}.
559163`\spad{log10(x)} computes the logarithm for \spad{x} to base 10.
559196`\spad{log1(f)} returns the logarithm of the power series represented by cons(1,{} \spad{f}),{} \spadignore{i.e.} assuming that the constant term is 1 and therefore transcendentality is not involved.
559284`\spad{log(x)} represents the Fortran intrinsic function LOG
559362`\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)}.
559463`\spad{log(x)} applies the logarithm operator to \spad{x}
559512`\spad{log(p)} returns the logarithm of \spad{p}.
559788`\spad{log(st)} computes the log of a power series.
559871`\spad{log(st)} computes the log of a power series.
559968`\spad{log(z)} returns the logarithm of Laurent series \spad{z}.
560054`\spad{log(z)} returns the logarithm of a Puiseux series \spad{z}.
560149`\spad{log(x)} returns the natural logarithm of \spad{x}. When evaluated into some subset of the complex numbers,{} the branch cut lies along the negative real axis,{} continuous with quadrant II. The domain does not contain the origin.
560201`\spad{log2()} returns \spad{ln 2},{} \spadignore{i.e.} \spad{0.6931471805...}.
560232`\spad{log2(b)} computes approximation to log(2) accurate to at least \spad{b} bits.
560337`\spad{log2(x)} computes the logarithm with base 2 for \spad{x}.
560375`\spad{log2(x)} computes the logarithm for \spad{x} to base 2.
560407`\spad{log(p,{} n)} returns the logarithm of \spad{p} (truncated up to order \spad{n}).
560508`\spad{log(x,{} b)} computes approximation to exp(\spad{x}) accurate to at least \spad{b} bits.
560654`\spad{log(p,{} n)} returns the logarithm of \spad{p} truncated at order \spad{n}.
560742`\spad{logDependenceQ([q1,{} ...,{} qn],{} q0)} finds rational constants \spad{c1,{} ...cn} such that \spad{q1^c1*...*qn^cn=u*q0} where \spad{u} is a unit
560883`\spad{logextint(x,{} lk,{} lg)} returns [[\spad{u1},{} ...,{} um],{} bas] giving basis of solution of the homogeneous systym \spad{c1*g1 + ... + cn*gn + c_{n+1}u1'/u1 + ... c_{n+m}um'/um = 0}
561030`\spad{logextint(der,{} ufactor,{} csolve,{} rec,{} [g1,{} ...,{} gn])} returns [[\spad{u1},{} ...,{} um],{} bas] giving basis of solution of the homogeneous systym \spad{c1*g1 + ... + cn*gn + c_{n+1}u1'/u1 + ... c_{n+m}um'/um = 0}
561441`\spad{logGamma(x)} is the natural log of \spad{Gamma(x)}.
561593`\spad{logGamma(x)} is the natural log of \spad{Gamma(x)}.
561653`\spad{logical?(t)} tests whether \spad{t} is equivalent to the FORTRAN type LOGICAL.
561707`\spad{false} (contradiction) is a logical constant.
561741`construct \spad{false} (contradiction): a logical constant.
561787`construct \spad{false} (contradiction): a logical constant.
561833`\spad{true} is a logical constant.
561867`construct true: a logical constant.
561913`construct true: a logical constant.
561959`\spad{logIfCan(z)} returns log(\spad{z}) if possible,{} and "failed" otherwise.
562039`\spad{logpart(ir)} returns the logarithmic part of an integration result
562199`\spad{log_plus_1(x)} computes \spad{log(1 + x)} with good accuracy.
562430`\spad{lommelS1(mu,{} nu,{} z)} is the Lommel \spad{s} function.
562495`\spad{lommelS1(mu,{} nu,{} z)} is the Lommel \spad{s} function.
562553`\spad{lommelS2(mu,{} nu,{} z)} is the Lommel \spad{S} function.
562618`\spad{lommelS2(mu,{} nu,{} z)} is the Lommel \spad{S} function.
562944`\spad{lookup(x)} \undocumented{} See \spadfunFrom{lookup}{Finite}
563030`\spad{lookup(x)} returns a positive integer such that \spad{x = index lookup x}.
563079`\spad{loop(\spad{li})} constructs loop from list of indexes \spad{li}
563133`\spad{loopPoints(p,{} n,{} b,{} r,{} lls)} creates and returns a list of points which form the loop with radius \spad{r},{} around the center point indicated by the point \spad{p},{} with the principal normal vector of the space curve at point \spad{p} given by the point(vector) \spad{n},{} and the binormal vector given by the point(vector) \spad{b},{} and a list of lists,{} \spad{lls},{} which is the \spadfun{cosSinInfo} of the number of points defining the loop.
563348`\spad{loopsArrows(s)} returns a list of loops for this graph in this case the loop is represented by the indexes of the sequence of nodes passed through. to-do: it would be better to use a more efficient algorithm,{} currently the code calls spanningForestArrow and traverses the result for loops,{} it might be more efficient to use Floyds algorithm.
563479`\spad{loopsAtNode(s,{} a)} returns a list of loops for this graph that pass through vertex index 'a'
563609`\spad{loopsNodes(s)} returns a list of loops for this graph in this case the loop is represented by the indexes of the sequence of nodes passed through.
563767`\spad{looseEquals(x,{} y)} is \spad{true} if \spad{x} 'equals' \spad{y} this is a looser version of equality test but is not as general as isomorphism. it only requires the same number of vertices but does not require the objects themselves being equal. the arrows must be the same,{} that is it may return \spad{false} if the order of vertices is changed so this is not isomorphism test.
563823`\spad{low(s)} returns the first endpoint of \spad{s}. Note: \spad{low(l..h) = l}.
563867`\spad{lowerCase()} returns the class of all characters for which \spadfunFrom{lowerCase?}{Character} is \spad{true}.
563958`\spad{lowerCase?(c)} tests if \spad{c} is an lower case letter,{} \spadignore{i.e.} one of a..\spad{z}.
564006`\spad{lowerCase!(s)} destructively replaces the alphabetic characters in \spad{s} by lower case.
564054`\spad{lowerCase(s)} returns the string with all characters in lower case.
564101`\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.
564142`\spad{lowerPolynomial(upoly)} converts \spad{upoly} to be a univariate polynomial over \spad{R}. An error if the coefficients contain variables.
564264`a subset \spad{U} with the property that,{} if \spad{x} is in \spad{U} and \spad{x} \spad{>=} \spad{y},{} then \spad{y} is in \spad{U}
564303`\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}.
564384`\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.
564443`\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.
564522`\spad{lquo(x,{} s)} returns the exact left quotient of \spad{x} by \spad{s}.
564580`\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}.
564638`\spad{lquo(x,{} y)} is a bilinear extention of \spad{lquo} from words to \spad{\%}.
564685`\spad{lquo(x,{} w)} returns the left simplification of \spad{x} by the word \spad{w}.
564745`\spad{lquo(x,{} v)} returns the left simplification of \spad{x} by the variable \spad{v}.
564793`\spad{lquo(x,{} y)} returns the left simplification of \spad{x} by \spad{y}.
564904`\spad{lSpaceBasis(d)} returns a basis for \spad{L(d) = {f | (f) >= -d}} as a module over \spad{K[x]}.
564972`\spad{LT(x,{} y)} returns the \spadtype{Switch} expression representing \spad{x<y}.
565267`\spad{lub(s,{} l)} is 'least upper bound' or 'supremum' of \spad{l}. In this version of lub nodes are represented as index values. Not every subset of a poset will have a lub in which case "failed" will be returned as an error indication.
565359`\spad{LUDecomp(A)} computes a LU decomposition of \spad{A} using the algorithm of Crout. \spad{LU} contains both triangular matrices; \spad{Perm} is the permutation used for partial pivoting and \spad{Pivots} yields the used pivots.
565471`\spad{LUInverse(A)} computes the inverse of \spad{A} using a LU decomposition.
565564`\spad{LUSolve(LU,{} Perm,{} B)} uses a previously computed \spad{LU} decomposition to solve a linear system with right hand side \spad{B}. \spad{LU} and \spad{Perm} are as given by \spad{LUDecomp}.
565654`\spad{lyndon?(w)} test if \spad{w} is a Lyndon word.
565725`\spad{lyndon(w)} convert \spad{w} into a Lyndon word,{} error if \spad{w} is not a Lyndon word.
565789`\spad{LyndonBasis(lv)} returns the Lyndon basis of the nilpotent free Lie algebra.
565893`\spad{LyndonCoordinates(g)} returns the exponential coordinates of \spad{g}.
566001`\spad{lyndonIfCan(w)} convert \spad{w} into a Lyndon word.
566086`\spad{LyndonWordsList1(vl,{} n)} returns an array of lists of Lyndon words over the alphabet \spad{vl},{} up to order \spad{n}.
566197`\spad{LyndonWordsList(vl,{} n)} returns the list of Lyndon words over the alphabet \spad{vl},{} up to order \spad{n}.
566286`\spad{m2r(ind)} transforms a multi-index into a repeated index.
566372`\spad{m2r(ind)} transforms a multi-index into a repeated index.
566462`\spad{mainCharacterization(x)} is the main algebraic quantity of \spad{x} (\spad{SEG})
566688`\spad{mainCoefficients(p)} returns an error if \spad{p} is \spad{O},{} otherwise,{} if \spad{p} belongs to \spad{R} returns [\spad{p}],{} otherwise returns the list of the coefficients of \spad{p},{} where \spad{p} is viewed as a univariate polynomial in its main variable.
566833`\spad{mainContent(p)} returns the content of \spad{p} viewed as a univariate polynomial in its main variable and with coefficients in the polynomial ring generated by its other variables over \spad{R}.
566917`\spad{mainDefiningPolynomial(x)} is the defining polynomial for the main algebraic quantity of \spad{x}
567021`\spad{mainForm(x)} is the main algebraic quantity name of \spad{x}
567224`\spad{mainKernel(f)} returns a kernel of \spad{f} with maximum nesting level,{} or "failed" if \spad{f} has no kernels (\spadignore{i.e.} \spad{f} is a constant).
567359`\spad{mainMonomial(p)} returns an error if \spad{p} is \spad{O},{} otherwise,{} if \spad{p} belongs to \spad{R} returns \spad{1},{} otherwise,{} \spad{mvar(p)} raised to the power \spad{mdeg(p)}.
567502`\spad{mainMonomials(p)} returns an error if \spad{p} is \spad{O},{} otherwise,{} if \spad{p} belongs to \spad{R} returns [1],{} otherwise returns the list of the monomials of \spad{p},{} where \spad{p} is viewed as a univariate polynomial in its main variable.
567650`\spad{mainPrimitivePart(p)} returns the primitive part of \spad{p} viewed as a univariate polynomial in its main variable and with coefficients in the polynomial ring generated by its other variables over \spad{R}.
567813`\spad{mainSquareFreePart(p)} returns the square free part of \spad{p} viewed as a univariate polynomial in its main variable and with coefficients in the polynomial ring generated by its other variables over \spad{R}.
567904`\spad{mainValue(x)} is the expression of \spad{x} in terms of \spad{SparseUnivariatePolynomial(\%)}
567995`\spad{mainVariable(f)} returns the highest variable appearing in the numerator or the denominator of \spad{f},{} "failed" if \spad{f} has no variables.
568192`\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?
568287`\spad{mainVariable(f)} returns the highest variable appearing in the numerator or the denominator of \spad{f},{} "failed" if \spad{f} has no variables.
568466`\spad{mainVariable?(v,{} ps)} returns \spad{true} iff \spad{v} is the main variable of some polynomial in \spad{ps}.
568550`\spad{mainVariableOf(c)} returns main variable of \spad{c}
568686`\spad{mainVariables(ps)} returns the decreasingly sorted list of the variables which are main variables of some polynomial in \spad{ps}.
568768`\spad{makeCell(lc)} creates a cell from list of simple cells \spad{lc}
568875`\spad{makeCell(c,{} sc)} creates a cell which consists of \spad{sc} in main variable and which has projection \spad{c}
568978`\spad{makeCos(e,{} r)} makes a sin expression with given argument and coefficient
569028`\spad{makeCrit }\undocumented
569228`If index numbers of \spad{'b'} overlap with index numbers of 'a' then refactor \spad{'b'} so that it does not overlap.
569292`\spad{makeEq(lsol,{} lvar)} returns a list of equations formed by corresponding members of lvar and \spad{lsol}.
569406`\spad{evalADE(f,{} x,{} n,{} eq,{} parameters,{} values)} creates an expression that stands for the coefficient of \spad{x^n} in the Taylor expansion of \spad{f}(\spad{x}),{} where \spad{f}(\spad{x}) is given by the functional equation \spad{eq}. The argument values specifies the first few Taylor coefficients.
569505`\spad{makeFloatFunction(expr,{} x)} returns a Lisp function \spad{f}: \spadtype{DoubleFloat} \spad{->} \spadtype{DoubleFloat} defined by \spad{f(x) == expr}. Function \spad{f} is compiled and directly applicable to objects of type \spadtype{DoubleFloat}.
569605`\spad{makeFloatFunction(expr,{} x,{} y)} returns a Lisp function \spad{f}: (\spadtype{DoubleFloat},{} \spadtype{DoubleFloat}) \spad{->} \spadtype{DoubleFloat} defined by \spad{f(x,{} y) == expr}. Function \spad{f} is compiled and directly applicable to objects of type (\spadtype{DoubleFloat},{} \spadtype{DoubleFloat}).
569724`\spad{makeFR(flist)} turns the final factorization of henselFact into a \spadtype{Factored} object.
569861`\spad{makeFR(unit,{} listOfFactors)} creates a factored object (for use by factoring code).
569993`\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.
570069`\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 parameter \spad{lp} is a list of integers which denote the size of the data points.
570195`\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 parameter \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.
570338`\spad{make_imaginary_part_function(expr,{} x)} returns a Lisp function \spad{f}: \spadtype{DoubleFloat} \spad{->} \spadtype{DoubleFloat} defined by \spad{f(x) == imag(expr)}. Function \spad{f} is compiled and directly applicable to objects of type \spadtype{DoubleFloat}.
570449`\spad{makeMulti(l)} returns the element whose list of monomials is \spad{l}.
570526`\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)}.
570669`\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)}.
570827`\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.
570952`\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)}.
571115`\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)}.
571285`\spad{makeObject(f,{} a..b,{} l)} creates 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.
571425`\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.
571585`\spad{makeObject(f(x),{} x = a..b,{} l)} creates 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.
571692`\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.
571817`\spad{makeObject(c,{} b,{} l)} is like version for plane curves,{} but uses complex curve.
571948`\spad{makeObject(curve(f,{} g),{} a..b,{} l)} creates 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.
572110`\spad{makeObject(curve(f(t),{} g(t)),{} t = a..b,{} l)} creates 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.
572239`\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.
572414`\spad{makeObject(curve(f(t),{} g(t),{} h(t)),{} t = a..b,{} l)} returns a space of the domain \spadtype{ThreeSpace} which contains the graph of the parametric curve \spad{x = f(t)},{} \spad{y = g(t)},{} \spad{z = h(t)} as \spad{t} ranges from \spad{min(a,{} b)} to \spad{max(a,{} b)}; \spad{h(t)} is the default title,{} and the options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
572556`\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)}.
572738`\spad{makeObject(surface(f(u,{} v),{} g(u,{} v),{} h(u,{} v)),{} u = a..b,{} v = c..d)} returns a space of the domain \spadtype{ThreeSpace} which contains the graph of the parametric surface \spad{x = f(u,{} v)},{} \spad{y = g(u,{} v)},{} \spad{z = h(u,{} v)} as \spad{u} ranges from \spad{min(a,{} b)} to \spad{max(a,{} b)} and \spad{v} ranges from \spad{min(c,{} d)} to \spad{max(c,{} d)}; \spad{h(t)} is the default title.
572882`\spad{makeObject(f,{} a..b,{} c..d,{} l)} returns a space of the domain \spadtype{ThreeSpace} which contains the graph of \spad{z = f(x,{} y)} as \spad{x} ranges from \spad{min(a,{} b)} to \spad{max(a,{} b)} and \spad{y} ranges from \spad{min(c,{} d)} to \spad{max(c,{} d)},{} and the options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
573062`\spad{makeObject(f,{} a..b,{} c..d,{} l)} returns a space of the domain \spadtype{ThreeSpace} which contains the graph of the parametric surface \spad{f(u,{} v)} as \spad{u} ranges from \spad{min(a,{} b)} to \spad{max(a,{} b)} and \spad{v} ranges from \spad{min(c,{} d)} to \spad{max(c,{} d)}; The options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
573249`\spad{makeObject(f(x,{} y) = g(x,{} y),{} x,{} y,{} l)} creates 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.
573378`\spad{makeObject(f(x,{} y),{} x = a..b,{} y = c..d,{} l)} returns a space of the domain \spadtype{ThreeSpace} which contains the graph of \spad{z = f(x,{} y)} as \spad{x} ranges from \spad{min(a,{} b)} to \spad{max(a,{} b)} and \spad{y} ranges from \spad{min(c,{} d)} to \spad{max(c,{} d)}; \spad{f(x,{} y)} is the default title,{} and the options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
573520`\spad{makeObject(surface(f,{} g,{} h),{} a..b,{} c..d,{} l)} returns a space of the domain \spadtype{ThreeSpace} which contains the graph of the parametric surface \spad{x = f(u,{} v)},{} \spad{y = g(u,{} v)},{} \spad{z = h(u,{} v)} as \spad{u} ranges from \spad{min(a,{} b)} to \spad{max(a,{} b)} and \spad{v} ranges from \spad{min(c,{} d)} to \spad{max(c,{} d)}. The options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
573719`\spad{makeObject(surface(f(u,{} v),{} g(u,{} v),{} h(u,{} v)),{} u = a..b,{} v = c..d,{} l)} returns a space of the domain \spadtype{ThreeSpace} which contains the graph of the parametric surface \spad{x = f(u,{} v)},{} \spad{y = g(u,{} v)},{} \spad{z = h(u,{} v)} as \spad{u} ranges from \spad{min(a,{} b)} to \spad{max(a,{} b)} and \spad{v} ranges from \spad{min(c,{} d)} to \spad{max(c,{} d)}; \spad{h(t)} is the default title,{} and the options contained in the list \spad{l} of the domain \spad{DrawOption} are applied.
573940`\spad{makeop should} be local but conditional
574013`\spad{make_real_part_function(expr,{} x)} returns a Lisp function \spad{f}: \spadtype{DoubleFloat} \spad{->} \spadtype{DoubleFloat} defined by \spad{f(x) == real(expr)}. Function \spad{f} is compiled and directly applicable to objects of type \spadtype{DoubleFloat}.
574119`\spad{makeRec(u,{} n,{} eq,{} parameters,{} values)} creates an expression that stands for \spad{u}(\spad{n}),{} where \spad{u}(\spad{n}) is given by the equation \spad{eq}. The argument \spad{parameters} has to contain all variables (or kernels) that appear eventually in the stream of values. The argument values specifies the initial values of the recurrence \spad{u}(0),{} \spad{u}(1),{} ... For the moment we don\spad{'t} allow recursions that contain \spad{u} inside of another operator.
574211`\spad{makeRecord(a,{} b)} creates a record object with type Record(\spad{part1} : \spad{S},{} \spad{part2} : \spad{T}),{} where \spad{part1} is \spad{a} and \spad{part2} is \spad{b}.
574283`\spad{makeResult(r1,{} r2)} makes the combined result [\spad{r1},{} \spad{r2}].
574391`\spad{makeSeries(refer,{} str)} creates a power series from the reference \spad{refer} and the stream \spad{str}.
574531`\spad{makeSin(e,{} r)} makes a sin expression with given argument and coefficient
574581`\spad{makeSketch(p,{} x,{} y,{} a..b,{} c..d)} creates an ACPLOT of the curve \spad{p = 0} in the region {\em a <= x <= b,{} c <= y <= d}. More specifically,{} 'makeSketch' plots a non-singular algebraic curve \spad{p = 0} in an rectangular region {\em xMin <= x <= xMax},{} {\em yMin <= y <= yMax}. The user inputs \spad{makeSketch(p,{} x,{} y,{} xMin..xMax,{} yMin..yMax)}. Here \spad{p} is a polynomial in the variables \spad{x} and \spad{y} with integer coefficients (\spad{p} belongs to the domain \spad{Polynomial Integer}). The case where \spad{p} is a polynomial in only one of the variables is allowed. The variables \spad{x} and \spad{y} are input to specify the the coordinate axes. The horizontal axis is the \spad{x}-axis and the vertical axis is the \spad{y}-axis. The rational numbers xMin,{} ...,{} yMax specify the boundaries of the region in which the curve is to be plotted.
574810`\spad{makeSUP(p)} converts the polynomial \spad{p} to be of type SparseUnivariatePolynomial over the same coefficients.
574899`\spad{makeSystem(sys)} creates a differential equation from a system.
574967`\spad{makeTerm(s,{} e)} returns the monomial \spad{s} exponentiated by \spad{e} (\spadignore{e.g.} s^e or \spad{e} * \spad{s}).
575021`\spad{makeUnit()} returns the unit element of the monomial.
575260`\spad{makeVariable(p)} views \spad{p} as an element of a differential ring,{} in such a way that the \spad{n}-th derivative of \spad{p} may be simply referenced as \spad{z}.\spad{n} where \spad{z} \spad{:=} makeVariable(\spad{p}). Note: In the interpreter,{} \spad{z} is given as an internal map,{} which may be ignored.
575379`\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} \spad{:=} makeVariable(\spad{s}). Note: In the interpreter,{} \spad{z} is given as an internal map,{} which may be ignored.
575475`\spad{makeVariable(s,{} n)} returns the \spad{n}-th derivative of a differential indeterminate \spad{s} as an algebraic indeterminate.
575560`\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}.
575619`\spad{makeViewport2D(\spad{gi},{} lopt)} creates and displays a viewport window of the domain \spadtype{TwoDimensionalViewport} whose graph field is assigned to be the given graph,{} \spad{\spad{gi}},{} of domain \spadtype{GraphImage},{} and whose options field is set to be the list of options,{} \spad{lopt} of domain \spadtype{DrawOption}.
575704`\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}.
575765`\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}.
575865`\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}.
575955`\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}.
576069`\spad{makingStats?()} returns \spad{true} iff the statistics process is running.
576147`\spad{mantissa(u)} returns the mantissa of \spad{u}
576196`\spad{mantissa(x)} returns the mantissa part of \spad{x}.
576252`\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}.
576312`\spad{map(f,{} m)} applies the function \spad{f} to every element of the array \spad{m} producing a new array containing the values.
576664`\spad{map(f,{} df)} replaces each coefficient \spad{x} of differential form \spad{df} by \spad{f(x)}.
577021`\spad{map(f,{} p)} \undocumented{}
577097`\spad{map}(\spad{f},{} a) applies the map \spad{f} to each coefficient in a. It is assumed that \spad{f} maps 0 to 0
577182`\spad{map(f,{} p)} lifts \spad{f} to the domain of \spad{p} then applies it to \spad{p}.
577676`\spad{map(f,{} p)} changes each coefficient of \spad{p} by the application of \spad{f}.
577725`\spad{map(fn,{} x)} returns \spad{Sum(fn(r_i) w_i)} if \spad{x} writes \spad{Sum(r_i w_i)}.
578121`\spad{map(func,{} poly)} creates a new polynomial by applying \spad{func} to every non-zero coefficient of the polynomial poly.
578700`\spad{map(f,{} x)} \undocumented
578792`\spad{map(f,{} v)} applies the function \spad{f} to every element of the vector \spad{v} producing a new vector containing the values.
578895`\spad{map(func,{} frac)} applies the function \spad{func} to the numerator and denominator of the fraction frac.
578971`\spad{map(f,{} [x0,{} x1,{} x2,{} ...])} returns \spad{[f(x0),{} f(x1),{} f(x2),{} ..]}.
579062`\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]}.
579126`\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.
579235`\spad{map(f,{} [(v1,{} a1),{} ...,{} (vn,{} an)])} returns the matching result [(\spad{v1},{} \spad{f}(\spad{a1})),{} ...,{} (\spad{vn},{} \spad{f}(an))].
579347`\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.
579441`\spad{map(func,{} frac)} applies the function \spad{func} to the numerator and denominator of frac.
579514`\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),{} ..]}.
579584`\spad{map(f,{} v)} applies the function \spad{f} to every element of the vector \spad{v} producing a new vector containing the values.
579654`\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"}.
579756`\spad{map(f,{} x)} \undocumented
579880`\spad{map(f,{} x)} \undocumented
580004`\spad{map(f,{} x)} \undocumented
580119`\spad{map(f,{} g(x))} applies the map \spad{f} to the coefficients of the Laurent series \spad{g(x)}.
580304`\spad{map(f,{} g(x))} applies the map \spad{f} to the coefficients of the Puiseux series \spad{g(x)}.
580489`\spad{map(f,{} g(x))} applies the map \spad{f} to the coefficients of \indented{1}{the Taylor series \spad{g(x)}.}
580591`\spad{map(f,{} ire)} \undocumented
580694`\spad{map(f,{} k)} returns \spad{g = op(f(a1),{} ...,{} f(an))} where \spad{k = op(a1,{} ...,{} an)}.
580765`\spad{map(f,{} ue)} \undocumented
580862`\spad{map(f,{} ufe)} \undocumented
581079`\spad{map(f,{} ure)} \undocumented
581224`\spad{map(f,{} k)} returns \spad{op(f(x1),{} ...,{} f(xn))} where \spad{k = op(x1,{} ...,{} xn)}.
581276`\spad{map(f,{} p)} lifts \spad{f} to \spad{F1} and applies it to \spad{p}.
581377`\spad{map(f,{} d)} \undocumented{}
581526`\spad{map(f,{} i)} \undocumented{}
581665`\spad{map(f,{} x)} applies the function \spad{f} to every coefficient of \spad{x}
581748`\spad{map(f,{} m)} applies the function \spad{f} to the elements of the matrix \spad{m}.
581842`\spad{map(f,{} m)} applies the function \spad{f} to the elements of the matrix \spad{m}.
581951`\spad{map(f,{} p)} \undocumented
582024`\spad{map(f,{} x)} maps the function \spad{f} on the entries of \spad{x}
582106`\spad{map(f,{} m)} applies the function \spad{f} to the elements of the matrix \spad{m}.
582232`\spad{map(f,{} ex)} evaluates ex,{} applying \spad{f} to values of type \spad{R} in ex.
582285`\spad{map(f,{} a)} returns \spad{b},{} where \spad{b(i,{} j) = a(i,{} j)} for all \spad{i},{} \spad{j}.
582358`\spad{map!(f,{} a)} assign \spad{a(i,{} j)} to \spad{f(a(i,{} j))} for all \spad{i,{} j}
582430`\spad{map(f,{} a)} returns \spad{b},{} where \spad{b(i,{} j) = f(a(i,{} j))} for all \spad{i,{} j}
582501`\spad{map(fn,{} x)} returns \spad{Sum(fn(r_i) w_i)} if \spad{x} writes \spad{Sum(r_i w_i)}.
582552`\spad{map(fn,{} u)} maps the function \userfun{\spad{fn}} across the factors of \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.
582596`\spad{map(f,{} a)} applies \spad{f} to all the constants in \spad{R} appearing in \spad{a}.
582661`\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}.
582744`\spad{map(f,{} u)} maps \spad{f} onto real and imaginary parts of \spad{u}.
582817`\spad{map(f,{} e)} applies \spad{f} to all the constants appearing in \spad{e}.
582899`\spad{map(fn,{} u)} is used to apply the function \userfun{\spad{fn}} to every factor of \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.
582975`\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}.
583063`\spad{map(f,{} r)} lifts \spad{f} and applies it to \spad{r},{} assuming that \spad{f}(infinity) = infinity.
583169`\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.
583272`\spad{map(f,{} u)} maps \spad{f} onto the component parts of the octonion \spad{u}.
583344`\spad{map(f,{} p)} applies \spad{f} to all the leaves of \spad{p} and returns the result as a pattern over \spad{S}.
583417`\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}.
583499`\spad{map(f,{} p)} \undocumented
583576`\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.
583660`\spad{map(f,{} u)} maps \spad{f} onto the component parts of the quaternion \spad{u}.
583734`\spad{map(f,{} v=a..b)} returns the value given by \spad{v=f(a)..f(b)}.
583828`\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}.
583916`\spad{map(f,{} l..h)} returns a new segment \spad{f(l)..f(h)}.
583989`\spad{map(func,{} poly)} creates a new polynomial by applying \spad{func} to every non-zero coefficient of the polynomial poly.
584119`\spad{map(func,{} poly)} creates a new polynomial by applying \spad{func} to every non-zero coefficient of the polynomial poly.
584239`\spad{map(f,{} s)} expands the segment \spad{s},{} applying \spad{f} to each value.
584347`\spad{map(f,{} seg)} returns the new segment obtained by applying \spad{f} to the endpoints of seg.
584447`\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.
584520`\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.
584590`\spad{map(f,{} eq)} returns an equation where \spad{f} is applied to the sides of eq
584666`\spad{map!(f,{} u)} destructively replaces each element \spad{x} of \spad{u} by \spad{f(x)}.
584746`\spad{map(f,{} u)} returns a copy of \spad{u} with each element \spad{x} replaced by \spad{f}(\spad{x}). For collections,{} \spad{map(f,{} u) = [f(x) for x in u]}.
584802`\spad{map(f,{} eqn)} constructs a new equation by applying \spad{f} to both sides of eqn.
584846`\spad{map(f,{} t)} replaces the tuple \spad{t} by \spad{[f(x) for x in t]}.
584895`\spad{map(f,{} l..h by k)} produces a value of type \spad{L} by applying \spad{f} to each of the successive elements of the segment,{} that is,{} \spad{[f(l),{} f(l+k),{} ...,{} f(lN)]},{} where \spad{lN <= h < lN+k}.
584957`\spad{map(f,{} ts)} does a componentwise conversion of the tensor \spad{ts} to a tensor with components of type \spad{T}.
585156`\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}.
585424`\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}.
585506`\spad{map(f,{} a,{} b)} \undocumented
585618`\spad{map(f,{} a,{} b)} \undocumented
585716`\spad{map(fn,{} u1,{} 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/5,{} 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}.
585792`\spad{map(f,{} a,{} b)} \undocumented
585890`\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),{} ..]}.
585974`\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.
586048`\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}.
586125`\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}
586200`\spad{map(f,{} r,{} i)} lifts \spad{f} and applies it to \spad{r},{} assuming that \spad{f}(infinity) = \spad{i}.
586328`\spad{map(f,{} u,{} v)} returns a new aggregate \spad{w} with elements \spad{z = f(x,{} y)} for corresponding elements \spad{x} and \spad{y} from \spad{u} and \spad{v}. Note: \spad{w.i = f(u.i,{} v.i)}.
586458`\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)}.
586535`\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}.
586761`\spad{map(s,{} m,{} newOb,{} offsetX,{} offsetY)} creates a new graph by mapping from this one \spad{newOb} should contain the new list of vertices. \spad{m} should contain a NNI value for each vertex,{} this is the new index into \spad{newOb}. It is allowed that \spad{newOb} may contain less objects than \spad{s} (for surjective mapping) or more objects than \spad{s} (for injective mapping)
586850`\spad{map(f,{} x)} maps the moments and cumulants from the ring \spad{R1} to \spad{R2}.
586947`\spad{mapBivariate(f,{} p(x,{} y))} applies the function \spad{f} to the coefficients of \spad{p(x,{} y)}.
587171`\spad{mapContra(s,{} m,{} newOb,{} offsetX,{} offsetY)} is similar to map function but reverses the directions of the arrows
587266`\spad{mapdiv([a0,{} a1,{} ..],{} [b0,{} b1,{} ..])} returns \spad{[a0/b0,{} a1/b1,{} ..]}.
587364`\spad{mapDown!(t,{}p,{}f)} returns \spad{t} after traversing \spad{t} in "preorder" (node then left then right) fashion replacing the successive interior nodes as follows. The root value \spad{x} is replaced by \spad{q} \spad{:=} \spad{f}(\spad{p},{} \spad{x}). The mapDown!(\spad{l},{} \spad{q},{} \spad{f}) and mapDown!(\spad{r},{} \spad{q},{} \spad{f}) are evaluated for the left and right subtrees \spad{l} and \spad{r} of \spad{t}.
587427`\spad{mapDown!(t,{}p,{}f)} returns \spad{t} after traversing \spad{t} in "preorder" (node then left then right) fashion replacing the successive interior nodes as follows. Let \spad{l} and \spad{r} denote the left and right subtrees of \spad{t}. The root value \spad{x} of \spad{t} is replaced by \spad{p}. Then \spad{f}(value \spad{l},{} value \spad{r},{} \spad{p}),{} where \spad{l} and \spad{r} denote the left and right subtrees of \spad{t},{} is evaluated producing two values \spad{pl} and \spad{pr}. Then \spad{mapDown!(l,{} pl,{} f)} and \spad{mapDown!(l,{} pr,{} f)} are evaluated.
587498`\spad{mapExpon(f,{} a1\^e1 ... an\^en)} returns \spad{a1\^f(e1) ... an\^f(en)}.
587557`\spad{mapExpon(f,{} a1\^e1 ... an\^en)} returns \spad{a1\^f(e1) ... an\^f(en)}.
587619`\spad{mapExpon(f,{} a1\^e1 ... an\^en)} returns \spad{a1\^f(e1) ... an\^f(en)}.
587772`\spad{mapExponents(fn,{} u)} maps function \spad{fn} onto the exponents of the non-zero monomials of polynomial \spad{u}.
587842`\spad{mapGen(f,{} a1\^e1 ... an\^en)} returns \spad{f(a1)\^e1 ... f(an)\^en}.
587890`\spad{mapGen(f,{} a1\^e1 ... an\^en)} returns \spad{f(a1)\^e1 ... f(an)\^en}.
587939`\spad{mapGen(f,{} a1\^e1 ... an\^en)} returns \spad{f(a1)\^e1 ... f(an)\^en}.
587996`\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.
588154`\spad{mapmult([a0,{} a1,{} ..],{} [b0,{} b1,{} ..])} returns \spad{[a0*b0,{} a1*b1,{} ..]}.
588241`\spad{map_preserving(fn,{} u)} is used to apply the function \userfun{\spad{fn}} to every factor of \spad{u}. The new factored object will have the same flags as original.
588328`\spad{mapUnivariate(f,{} p(x))} applies the function \spad{f} to the coefficients of \spad{p(x)}.
588437`\spad{mapUnivariate(f,{} p(x))} applies the function \spad{f} to the coefficients of \spad{p(x)}.
588546`\spad{mapUnivariateIfCan(f,{} p(x))} applies the function \spad{f} to the coefficients of \spad{p(x)},{} if possible,{} and returns \spad{"failed"} otherwise.
588692`\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.
588751`\spad{mapUp!(t,{}t1,{}f)} traverses \spad{t} in an "endorder" (left then right then node) fashion returning \spad{t} with the value at each successive interior node of \spad{t} replaced by \spad{f}(\spad{l},{} \spad{r},{} \spad{l1},{} \spad{r1}) where \spad{l} and \spad{r} are the values at the immediate left and right nodes. Values \spad{l1} and \spad{r1} are values at the corresponding nodes of a balanced binary tree \spad{t1},{} of identical shape at \spad{t}.
588861`\spad{mask(n)} returns \spad{2^n-1} (an \spad{n} bit mask).
588907`\spad{match(la,{} lb)} creates a map with no default source or target values 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 in \spad{lb}. Error: if \spad{la} and \spad{lb} are not of equal length. Note: when this map is applied,{} an error occurs when applied to a value missing from \spad{la}.
588968`\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.
589030`\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 in \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.
589098`\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 in \spad{lb}. Error: if \spad{la} and \spad{lb} are not of equal length.
589156`\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 in \spad{lb}. Error: if \spad{la} and \spad{lb} are not of equal length.
589219`\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 in \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.
589284`\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 in \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.
589344`\spad{mathieu11 constructs} the mathieu group acting on the integers 1,{} ...,{} 11.
589423`\spad{mathieu11(\spad{li})} constructs the mathieu group acting on the 11 integers given in the list {\em \spad{li}}. Note: duplicates in the list will be removed. error,{} if {\em \spad{li}} has less or more than 11 different entries.
589515`\spad{mathieu12 constructs} the mathieu group acting on the integers 1,{} ...,{} 12.
589594`\spad{mathieu12(\spad{li})} constructs the mathieu group acting on the 12 integers given in the list {\em \spad{li}}. Note: duplicates in the list will be removed Error: if {\em \spad{li}} has less or more than 12 different entries.
589686`\spad{mathieu22 constructs} the mathieu group acting on the integers 1,{} ...,{} 22.
589765`\spad{mathieu22(\spad{li})} constructs the mathieu group acting on the 22 integers given in the list {\em \spad{li}}. Note: duplicates in the list will be removed. Error: if {\em \spad{li}} has less or more than 22 different entries.
589857`\spad{mathieu23 constructs} the mathieu group acting on the integers 1,{} ...,{} 23.
589936`\spad{mathieu23(\spad{li})} constructs the mathieu group acting on the 23 integers given in the list {\em \spad{li}}. Note: duplicates in the list will be removed. Error: if {\em \spad{li}} has less or more than 23 different entries.
590028`\spad{mathieu24 constructs} the mathieu group acting on the integers 1,{} ...,{} 24.
590107`\spad{mathieu24(\spad{li})} constructs the mathieu group acting on the 24 integers given in the list {\em \spad{li}}. Note: duplicates in the list will be removed. Error: if {\em \spad{li}} has less or more than 24 different entries.
590199`\spad{matrix(llf)} makes \spad{llf} (a list of lists of forms) into a form which displays as a matrix.
590314`\spad{matrix(A)} returns the underlying matrix of the incidence matrix A
590372`\spad{matrix(f)} returns the matrix of the ALS of \spad{f}.
590463`\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.
590529`\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.
590610`\spad{matrix(qf)} creates a square matrix from the quadratic form \spad{qf}.
590673`\spad{matrix(f,{}m)} returns the coefficient matrix for the monomial \spad{m} of the ALS of \spad{f}.
590752`\spad{matrix(p,{} l)} returns matrix \spad{l} in the linear pencil \spad{p}.
590841`\spad{matrix(left,{} right)} returns a handler that typesets a matrix with parentheses given by \spad{left} and right where rows are formatted using \spad{h}.
591044`\spad{matrix(n,{}m,{}f)} constructs an \spad{n * m} matrix with the \spad{(i,{}j)} entry equal to \spad{f(i,{}j)}.
591155`\spad{matrixConcat3D(s,{} x,{} y)} concatenates two 3-\spad{D} matrices along a specified axis
591226`\spad{matrixDimensions(x)} returns the dimensions of a matrix
591315`\spad{matrixGcd(mat,{} sing,{} n)} is \spad{gcd(sing,{} g)} where \spad{g} is the \spad{gcd} of the entries of the \spad{n}-by-\spad{n} upper-triangular matrix \spad{mat}.
591402`\spad{max()} returns the maximum floating point number.
591511`\spad{max()} returns the largest single integer.
591745`\spad{max(s)} returns index of the vertex which can be reached from all other vertices. Gives 0 if no such node exists or if it is not unique,{} if there is a loop for instance.
591802`\spad{max(u)} returns maximal element of \spad{u}. Error if \spad{u} is empty.
591896`\spad{max(q)} returns the maximum element of priority queue \spad{q}.
592101`\spad{max(a,{} b)} returns a point whose value in each dimension is the maximum. So if a has the largest \spad{x} value and \spad{b} has the largest \spad{y} value then the result will combine these. This is useful for constructing boundary boxes around sets of points.
592143`\spad{max(s,{} sub)} returns index of the vertex which can be reached from a given subset of the vertices. Gives 0 if no such node exists or if it is not unique,{} if there is a loop for instance.
592384`\spad{max(x,{}y)} returns the maximum of \spad{x} and \spad{y} relative to \spad{"<"}.
592422`\spad{max(p,{} u)} returns maximal element of \spad{u} with respect to total ordering predicate \spad{p}. Error if \spad{u} is empty.
592508`\spad{maxColIndex(m)} returns the index of the 'last' column of the matrix \spad{m}.
592588`\spad{maxColIndex(m)} returns the index of the 'last' column of the array \spad{m}
592666`\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.
592715`\spad{maxdeg(p)} returns the greatest leading word in the support of \spad{p}.
592778`\spad{maxDegree returns} the specified maxDegree.
592883`\spad{maxDegree(d)} specifies the maximum degree of the coefficient polynomials in an algebraic differential equation or a recursion with polynomial coefficients. For rational functions with an exponential term,{} \spad{maxDegree} bounds the degree of the denominator polynomial. This option is expressed in the form \spad{maxDegree == d}.
592962`\spad{maxDerivative returns} the specified maxDerivative.
593071`\spad{maxDerivative(d)} specifies the maximum derivative in an algebraic differential equation. This option is expressed in the form \spad{maxDerivative == d}.
593154`\spad{maximumExponent()} returns the maximum exponent in the model
593209`\spad{maximumExponent(e)} sets the maximum exponent in the model to \spad{e}
593381`find the maximum index.
593453`find the maximum index.
593528`returns maximum index
593651`\spad{maxIndex(u)} returns the maximum index \spad{i} of aggregate \spad{u}. Note: in general,{} \spad{maxIndex(u) = reduce(max,{} indices u)}; for List,{} \spad{maxIndex(u) = \#u}.
593736`\spad{maxint()} returns the maximum integer in the model
593792`\spad{maxint(u)} sets the maximum integer in the model to \spad{u}
593863`\spad{maxLevel returns} the specified maxLevel.
593967`\spad{maxLevel(d)} specifies the maximum number of recursion levels operators guessProduct and guessSum will be applied. This option is expressed in the form spad{maxLevel \spad{==} \spad{d}}.
594045`\spad{maxMixedDegree returns} the specified maxMixedDegree.
594136`\spad{maxMixedDegree(d)} specifies the maximum \spad{q}-degree of the coefficient polynomials in a recurrence with polynomial coefficients,{} in the case of mixed shifts. Although slightly inconsistent,{} maxMixedDegree(0) specifies that no mixed shifts are allowed. This option is expressed in the form \spad{maxMixedDegree == d}.
594201`\spad{maxPoints()} returns the maximum number of points in a plot
594242`\spad{maxPoints()} returns the maximum number of points in a plot.
594295`\spad{maxPoints()} sets the maximum number of points in a plot.
594355`\spad{maxPoints3D()} returns the maximum number of points in a plot.
594400`\spad{maxPower returns} the specified maxPower.
594501`\spad{maxPower(d)} specifies the maximum degree in an algebraic differential equation. For example,{} the degree of (\spad{f}\spad{''})\spad{^3} \spad{f'} is 4. maxPower(\spad{-1}) specifies that the maximum exponent can be arbitrary. This option is expressed in the form \spad{maxPower == d}.
594576`\spad{maxPrecedence()} returns the maximal precedence value,{}
594634`\spad{maxPrecedence()} returns the maximal precedence value,{}
594696`\spad{maxrank(r)} returns the maximum rank in the list \spad{r} of regimes
594897`\spad{maxrow(a,{} b,{} c,{} d,{} e)} is an auxiliary function for \spad{mr}
595124`\spad{maxRowIndex(m)} returns the index of the 'last' row of the matrix \spad{m}.
595204`\spad{maxRowIndex(m)} returns the index of the 'last' row of the array \spad{m}
595282`\spad{maxShift returns} the specified maxShift.
595386`\spad{maxShift(d)} specifies the maximum shift in a recurrence equation. This option is expressed in the form \spad{maxShift == d}.
595464`\spad{maxSubst returns} the specified maxSubst.
595565`\spad{maxSubst(d)} specifies the maximum degree of the monomial substituted into the function we are looking for. That is,{} if \spad{maxSubst == d},{} we look for polynomials such that \$\spad{p}(\spad{f}(\spad{x}),{} \spad{f}(\spad{x^2}),{} ...,{} \spad{f}(\spad{x^d}))\spad{=0}\$. equation. This option is expressed in the form \spad{maxSubst == d}.
595716`\spad{mdeg(p)} returns an error if \spad{p} is \spad{0},{} otherwise,{} if \spad{p} belongs to \spad{R} returns \spad{0},{} otherwise,{} returns the degree of \spad{p} in its main variable.
595794`\spad{meatAxe(aG)} calls {\em meatAxe(aG,{} false,{} 25,{} 7)} returns a 2-list of representations as follows. All matrices of argument \spad{aG} are assumed to be square and of equal size. Then \spad{aG} generates a subalgebra,{} say \spad{A},{} of the algebra of all square matrices of dimension \spad{n}. {\em V R} is an A-module in the usual way. meatAxe(\spad{aG}) creates at most 25 random elements of the algebra,{} tests them for singularity. If singular,{} it tries at most 7 elements of its kernel to generate a proper submodule. If successful a list which contains first the list of the representations of the submodule,{} then a list of the representations of the factor module is returned. Otherwise,{} if we know that all the kernel is already scanned,{} Norton\spad{'s} irreducibility test can be used either to prove irreducibility or to find the splitting. Notes: the first 6 tries use Parker\spad{'s} fingerprints. Also,{} 7 covers the case of three-dimensional kernels over the field with 2 elements.
595914`\spad{meatAxe(aG,{} randomElements)} calls {\em meatAxe(aG,{} false,{} 6,{} 7)},{} only using Parker\spad{'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.
596042`\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.
596178`\spad{meatAxe(aG,{} randomElements,{} numberOfTries,{} maxTests)} returns a 2-list of representations as follows. All matrices of argument \spad{aG} are assumed to be square and of equal size. Then \spad{aG} generates a subalgebra,{} say \spad{A},{} of the algebra of all square matrices of dimension \spad{n}. {\em V R} is an A-module in the usual way. meatAxe(\spad{aG},{} \spad{numberOfTries},{} maxTests) creates at most {\em numberOfTries} random elements of the algebra,{} tests them for singularity. If singular,{} it tries at most {\em maxTests} elements of its kernel to generate a proper submodule. If successful,{} a 2-list is returned: first,{} a list containing first the list of the representations of the submodule,{} then a list of the representations of the factor module. Otherwise,{} if we know that all the kernel is already scanned,{} Norton\spad{'s} irreducibility test can be used either to prove irreducibility or to find the splitting. If {\em randomElements} is {\em false},{} the first 6 tries use Parker\spad{'s} fingerprints.
596322`\spad{medial(ps)} returns the same as \spad{medialSet(ps,{} initiallyReduced?,{} initiallyReduce)}.
596407`\spad{medialSet(ps,{} redOp?,{} redOp)} returns \spad{bs} a basic set (in Wu Wen Tsun sense with respect to the reduction-test \spad{redOp?}) of some set generating the same ideal as \spad{ps} (with rank not higher than any basic set of \spad{ps}),{} if no non-zero constant polynomials appear during the computations,{} else \spad{"failed"} is returned. In the former case,{} \spad{bs} has to be understood as a candidate for being a characteristic set of \spad{ps}. In the original algorithm,{} \spad{bs} is simply a basic set of \spad{ps}.
596516`\spad{meet of} set of elements
596567`\spad{meet of} set of elements
596618`returns the meet of 'a' and \spad{'b'} In this version of meet nodes are represented as index values. Not every poset will have a meet but CoDCPO will.
596805`\spad{meetIfCan returns} the meet of a subset of lattice given by list of elements.
597012`\spad{meetIfCan(s,{} a,{} b)} returns the meet of 'a' and \spad{'b'} In this version of meet nodes are represented as index values. In the general case,{} not every poset will have a meet in which case "failed" will be returned as an error indication.
597123`\spad{meijerG(la,{} lb,{} lc,{} ld,{} z)} is the meijerG function.
597244`\spad{meijerG(la,{} lb,{} lc,{} ld,{} z)} is the meijerG function.
597358`\spad{meixnerM(n,{} b,{} c,{} z)} is the Meixner polynomial.
597425`\spad{meixnerM(n,{} b,{} c,{} z)} is the Meixner polynomial.
597485`\spad{meixnerP(n,{} phi,{} lambda,{} z)} is the Meixner-Pollaczek polynomial.
597552`\spad{meixnerP(n,{} phi,{} lambda,{} z)} is the Meixner–Pollaczek polynomial.
597612`\spad{member?(p,{} s)} returns \spad{true} is \spad{p} is in \spad{s},{} \spad{false} otherwise.
597975`\spad{member?(v,{} B)} tests if the vector \spad{v} is in the subspace spanned by \spad{B}.
598040`\spad{member?(pp,{} gp)} answers the question,{} whether the permutation {\em pp} is in the group {\em gp} or not.
598110`\spad{member?(x,{} u)} tests if \spad{x} is a member of \spad{u}. For collections,{} \spad{member?(x,{} u) = reduce(or,{} [x=y for y in u],{} false)}. However,{} \spad{member?(x,{} u)} returns as soon as it finds a member.
598272`\spad{members(mf)} returns the elements of the subposet
598332`\spad{members(mf)} returns the elements of the subposet
598405`\spad{members(u)} returns a list of the consecutive elements of \spad{u}. For multisets \spadfun{members} gives result with no repetition. See also \spadfun{parts}.
598486`\spad{merge(ls)} a list of subspaces,{} \spad{ls},{} into one subspace.
598533`\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.
599092`\spad{merge(a,{} b)} returns sum : union (not necessarily disjoint) of nodes with arrows merged in from appropriate input,{} if arrow exists from both inputs then it will be duplicated.
599136`Forms union of two simplicial complexes.
599193`\spad{merge(s1,{} s2)} the subspaces \spad{s1} and \spad{s2} into a single subspace.
599236`\spad{merge!(u,{} v)} destructively merges \spad{u} and \spad{v} in ascending order.
599312`\spad{merge(u,{} v)} merges \spad{u} and \spad{v} in ascending order. Note: \spad{merge(u,{} v) = merge(<=,{} u,{} v)}.
599405`\spad{merge(q1,{} q2)} returns combines priority queues \spad{q1} and \spad{q2} to return a single priority queue \spad{q}.
599460`\spad{merge!(q,{} q1)} destructively changes priority queue \spad{q} to include the values from priority queue \spad{q1}.
599516`\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.
599893`\spad{merge!(p,{} u,{} v)} destructively merges \spad{u} and \spad{v} using predicate \spad{p}.
599967`\spad{merge(p,{} a,{} b)} returns an aggregate \spad{c} which merges \spad{a} and \spad{b}. The result is produced by examining each element \spad{x} of \spad{a} and \spad{y} of \spad{b} successively. If \spad{p(x,{} 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 \spad{a} is examined,{} and so on. When all the elements of one aggregate are examined,{} the remaining elements of the other are appended. For example,{} \spad{merge(<,{} [1,{} 3],{} [2,{} 7,{} 5])} returns \spad{[1,{} 2,{} 3,{} 7,{} 5]}.
600052`\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}.
600277`\spad{mergeFactors(u,{} v)} is used when the factorizations of \spad{u} and \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.
600325`\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
600380`\spad{mesh([[p0],{} [p1],{} ...,{} [pn]])} creates a surface defined by a list of curves which are lists,{} \spad{p0} through \spad{pn},{} of points,{} and returns a \spadtype{ThreeSpace} whose component is the surface.
600447`\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.
600514`\spad{mesh([[p0],{} [p1],{} ...,{} [pn]],{} close1,{} close2)} creates a surface defined over a list of curves,{} \spad{p0} through \spad{pn},{} which are lists of points; the booleans \spad{close1} and \spad{close2} indicate how the surface is to be closed: \spad{close1} set to \spad{true} means that each individual list (a curve) is to be closed (that is,{} the last point of the list is to be connected to the first point); \spad{close2} set to \spad{true} means that the boundary at one end of the surface is to be connected to the boundary at the other end (the boundaries are defined as the first list of points (curve) and the last list of points (curve)); the \spadtype{ThreeSpace} containing this surface is returned.
600597`\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 \spad{WxH} where \spad{W} is the number of lists of points from the domain \spad{PointDomain(R)} and \spad{H} is the number of elements in each of those lists; the booleans \spad{close1} and \spad{close2} indicate how the surface is to be closed: if \spad{close1} is \spad{true} this means that each individual list (a curve) is to be closed (\spadignore{i.e.} the last point of the list is to be connected to the first point); if \spad{close2} is \spad{true},{} this means that the boundary at one end of the surface is to be connected to the boundary at the other end (the boundaries are defined as the first list of points (curve) and the last list of points (curve)).
600681`\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 \spad{WxH} where \spad{W} is the number of lists of points from the domain \spad{PointDomain(R)} and \spad{H} is the number of elements in each of those lists; lprops is the list of the subspace component properties for each curve list,{} and prop is the subspace component property by which the points are defined.
600807`\spad{mesh(s,{} [[p0],{} [p1],{} ...,{} [pn]],{} close1,{} close2)} adds a surface component to the \spadtype{ThreeSpace},{} which is defined over a list of curves,{} in which each of these curves is a list of points. The boolean arguments \spad{close1} and \spad{close2} indicate how the surface is to be closed. Argument \spad{close1} equal \spad{true} means that each individual list (a curve) is to be closed,{} \spadignore{i.e.} the last point of the list is to be connected to the first point. Argument \spad{close2} equal \spad{true} means that the boundary at one end of the surface is to be connected to the boundary at the other end,{} \spadignore{i.e.} the boundaries are defined as the first list of points (curve) and the last list of points (curve).
600892`\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 prop is the subspace component property by which the points are defined.
601019`\spad{meshFun2Var(f,{} g,{} s1,{} s2,{} l)} \undocumented
601279`\spad{meshPar1Var(s,{} t,{} u,{} f,{} s1,{} l)} \undocumented
601496`\spad{meshPar2Var(f,{} s1,{} s2,{} l)} \undocumented
601693`\spad{meshPar2Var(sp,{} f,{} s1,{} s2,{} l)} \undocumented
601914`\spad{meshPar2Var(f,{} g,{} h,{} j,{} s1,{} s2,{} l)} \undocumented
602252`\spad{message(s)} creates an form with no string quotes from string \spad{s}.
602297`\spad{messagePrint(s)} prints \spad{s} without string quotes. Note: \spad{messagePrint(s)} is equivalent to \spad{print message(s)}.
602350`\spad{mfactor(pv,{} md)} computes factorization of \spad{pv} into irreducibles over field described by \spad{md}. \spad{pv} is assumed square-free and monic,{} \spad{md} is info representing finite field.
602632`\spad{middle(rootChar)} is the middle of the isolating interval
602725`\spad{midpoint(int)} returns the midpoint of the interval \spad{int}.
602845`\spad{midpoints(isolist)} returns the list of midpoints for the list of intervals \spad{isolist}.
602978`\spad{mightHaveRoots(p,{} r)} is \spad{false} if \spad{p.r} is not 0
603088`\spad{min()} returns the minimum floating point number.
603197`\spad{min()} returns the smallest single integer.
603431`\spad{min(s)} returns index of the vertex which can reach to all other vertices. Gives 0 if no such node exists or if it is not unique,{} if there is a loop for instance.
603488`\spad{min(u)} returns minimal element of \spad{u}. Error if \spad{u} is empty.
603582`\spad{min(u)} returns the smallest entry in the multiset aggregate \spad{u}.
603789`\spad{min(a,{} b)} returns a point whose value in each dimension is the minimum. So if a has the smallest \spad{x} value and \spad{b} has the smallest \spad{y} value then the result will combine these. This is useful for constructing boundary boxes around sets of points.
603831`\spad{min(s,{} sub)} returns index of the vertex which can reach to a given subset of the vertices. Gives 0 if no such node exists or if it is not unique,{} if there is a loop for instance.
603950`\spad{min(x,{}y)} returns the minimum of \spad{x} and \spad{y} relative to \spad{"<"}.
603988`\spad{minColIndex(m)} returns the index of the 'first' column of the matrix \spad{m}.
604068`\spad{minColIndex(m)} returns the index of the 'first' column of the array \spad{m}
604146`\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.
604195`\spad{mindeg(x)} returns the little word which appears in \spad{x}. Error if \spad{x=0}.
604255`\spad{mindegTerm(x)} returns the term whose word is \spad{mindeg(x)}.
604333`\spad{minGbasis }\undocumented
604422`\spad{minimal?(f)} is \spad{f} represented by a minimal ALS?
604485`\spad{minimalMatrix(A,{}r)} returns the minimal (upper-left) submatrix of A such that the rank corresponds to the given.
604834`\spad{minimalPolynomial(x)} \undocumented{} See \spadfunFrom{minimalPolynomial}{FiniteAlgebraicExtensionField}
604946`\spad{minimalPolynomial(a)} returns the minimal polynomial of \spad{a}.
605136`\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}.
605265`\spad{minimalRepresentation(p)} returns a minimal representation using the generalized Ho algorithm [Fornasini,{} 1978] \spad{p} = sum_w alpha*mu(\spad{w})*beta*w [Theorem 3.3,{} Salomaa--Soittola 1978]
605445`\spad{minimize(I)} returns a reduced set of generators for \spad{I}.
605501`\spad{minimize(f)} minimizes the underlying ALS by applying left and right block minimization steps. Minimality is only guaranteed if the remaining blocks are refined.
605640`\spad{minimumDegree(p)} gives the least exponent of a non-zero term of polynomial \spad{p}. Error: if applied to 0.
605924`\spad{minimumDegree(p,{} lv)} gives the list of minimum degrees of the polynomial \spad{p} with respect to each of the variables in the list \spad{lv}
606026`\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}
606116`\spad{minimumExponent()} returns the minimum exponent in the model
606171`\spad{minimumExponent(e)} sets the minimum exponent in the model to \spad{e}
606290`find the minimum index.
606365`returns minimum index
606488`\spad{minIndex(u)} returns the minimum index \spad{i} of aggregate \spad{u}. Note: in general,{} \spad{minIndex(a) = reduce(min,{} indices a)}; for List,{} \spad{minIndex(a) = 1}.
606573`\spad{minordet(m)} computes the determinant of the matrix \spad{m} using minors. Error: if the matrix is not square.
606645`\spad{minordet(m)} computes the determinant of the matrix \spad{m} using minors. Error: if the matrix is not square.
606723`\spad{minordet(m)} computes the determinant of the matrix \spad{m} using minors.
606812`\spad{minPoints()} returns the minimum number of points in a plot
606853`\spad{minPoints()} returns the minimum number of points in a plot.
606906`\spad{minPoints()} sets the minimum number of points in a plot.
606966`\spad{minPoints3D()} returns the minimum number of points in a plot.
607011`\spad{minPol }\undocumented
607192`\spad{minPol }\undocumented
607430`\spad{minPoly(k)} returns the defining polynomial of \spad{k}.
607547`\spad{minPoly(k)} returns \spad{p} such that \spad{p(k) = 0}.
607635`\spad{minPrecedence()} returns the minimal precedence value.
607693`\spad{minPrecedence()} returns the minimal precedence value.
607755`\spad{minrank(r)} returns the minimum rank in the list \spad{r} of regimes
607956`\spad{minRowIndex(m)} returns the index of the 'first' row of the matrix \spad{m}.
608036`\spad{minRowIndex(m)} returns the index of the 'first' row of the array \spad{m}
608114`\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
608210`\spad{minShift(l)} returns the lexicographically minimal cyclic rotation of the list \spad{l}
608284`\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.
608374`\spad{minus(x,{} y)} computes \spad{x - y} with no rounding.
608547`\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.
608647`\spad{minus(x,{} y,{} b)} computes approximation to \spad{x - y} accurate to at least \spad{b} bits.
608837`\spad{minusInfinity()} returns -infinity.
608892`\spad{minusInfinity()} returns minusInfinity.
608960`\spad{m_inverse(x,{} lm,{} lv,{} p)} computes inverse of \spad{x} in algebraic extension defined by \spad{lm}.
609116`\spad{mirror(x)} returns the reversed word of \spad{x}. That is \spad{x} itself if \spadopFrom{retractable?}{FreeMagma}(\spad{x}) is \spad{true} and \spad{mirror(z) * mirror(y)} if \spad{x} is \spad{y*z}.
609162`\spad{mirror(x)} returns the reversed word of \spad{x}.
609204`\spad{mirror(g)} is the mirror of the internal representation of \spad{g}.
609264`\spad{mirror(x)} returns \spad{Sum(r_i mirror(w_i))} if \spad{x} is \spad{Sum(r_i w_i)}.
609317`\spad{mirror(x)} returns \spad{Sum(r_i mirror(w_i))} if \spad{x} writes \spad{Sum(r_i w_i)}.
609364`\spad{mix(l)} \undocumented
609468`\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 ne.
609666`\spad{mkcomm(i)} \undocumented{}
609711`\spad{mkcomm(i,{} j)} \undocumented{}
609752`\spad{mk_erf(u,{} f)} should be local but conditional
609806`\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}.
609903`\spad{mkPrim(f,{} x)} makes the logs in \spad{f} which are linear in \spad{x} primitive with respect to \spad{x}.
610015`\spad{mod_exp(pv,{} d,{} rd)} computes \spad{pv^d} modulo reduction data in \spad{rd}.
610104`\spad{modifyPoint(s,{} \spad{li},{} i)} replaces an existing point in the 3 dimensional subspace,{} \spad{s},{} with the 4 dimensional point indicated by the index location,{} \spad{i}. The list of non negative integers,{} \spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component in which the existing point is to be modified. An error message occurs if \spad{s} is empty,{} otherwise the subspace \spad{s} is returned with the point modification.
610195`\spad{modifyPoint(s,{} \spad{li},{} p)} replaces an existing point in the 3 dimensional subspace,{} \spad{s},{} with the 4 dimensional point,{} \spad{p}. The list of non negative integers,{} \spad{li},{} dictates the path to follow,{} or,{} to look at it another way,{} points to the component in which the existing point is to be modified. An error message occurs if \spad{s} is empty,{} otherwise the subspace \spad{s} is returned with the point modification.
610276`\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.
610351`\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}.
610454`\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.
610541`\spad{modpeval(pol,{} lv,{} lpt,{} p)} evaluates polynomial \spad{pol} in variables form \spad{lv} at point from \spad{lpt} modulo a prime \spad{p}
610660`\spad{modpreduction(r,{} p)} reduces a rational function \spad{r} modulo prime \spad{p}.
610835`\spad{modpreduction(p,{} q)} reduces all coefficients of \spad{p} modulo \spad{q}.
610929`\spad{modpreduction(pol,{} p)} reduces polynomial \spad{pol} modulo prime \spad{p}.
611038`\spad{modTree(r,{} l)} \undocumented{}
611095`\spad{modular_compose(pol,{} pm,{} p1,{} l1,{} rd)} computes composion of \spad{pol} with \spad{p0} modulo reduction data \spad{rd}. \spad{pm} and \spad{p1} are as from call to \spad{power_matrix(p0,{} l1,{} rd)}.
611210`\spad{modularFactor(f,{} d)} chooses a "good" prime and returns the factorization of \spad{f} modulo this prime in a form that may be used by \spadfunFrom{completeHensel}{GeneralHenselPackage}. If prime is zero it means that \spad{f} has been proved to be irreducible over the integers or that \spad{f} is a unit (\spadignore{i.e.} 1 or \spad{-1}). \spad{f} shall be primitive (\spadignore{i.e.} content(\spad{p})\spad{=1}) and square free (\spadignore{i.e.} without repeated factors). \spad{d} is set of possible degrees of factors.
611333`\spad{modularGcdPrimitive(listf)} computes the \spad{gcd} of the list of primitive polynomials \spad{listf} by modular methods.
611417`\spad{modularInvariantJ(tau)} computes modular invariant \spad{j},{} that is \spad{1728*g2^3/(g2^3 - 27*g3^2)} where \spad{g2},{} \spad{g3} are invariants corresponding to half periods \spad{w1},{} \spad{w2} such that \spad{tau = w1/w2}.
611505`\spad{module(I)} returns \spad{I} viewed has a module over \spad{R}.
611621`\spad{module([f1,{} ...,{} fn])} = the module generated by \spad{(f1,{} ...,{} fn)} over \spad{R}.
611698`\spad{moduleSum(m1,{} m2)} returns the sum of two modules in the framed algebra \spad{F}. Each module \spad{\spad{mi}} is represented as follows: \spad{F} is a framed algebra with \spad{R}-module basis \spad{w1,{} w2,{} ...,{} wn} and \spad{\spad{mi}} is a record \spad{[basis,{} basisDen,{} basisInv]}. If \spad{basis} is the matrix \spad{(aij,{} i = 1..n,{} j = 1..n)},{} then a basis \spad{v1,{} ...,{} vn} for \spad{\spad{mi}} is given by \spad{\spad{vi} = (1/basisDen) * sum(aij * wj,{} j = 1..n)},{} \spadignore{i.e.} the \spad{i}th row of 'basis' contains the coordinates of the \spad{i}th basis vector. Similarly,{} the \spad{i}th row of the matrix \spad{basisInv} contains the coordinates of \spad{\spad{wi}} with respect to the basis \spad{v1,{} ...,{} vn}: if \spad{basisInv} is the matrix \spad{(bij,{} i = 1..n,{} j = 1..n)},{} then \spad{\spad{wi} = sum(bij * vj,{} j = 1..n)}.
611914`\spad{modulo(x)} returns a,{} where \spad{x = a + b p}.
611973`\spad{modulus()} returns current modulus.
612019`\spad{modulus()} returns the value of \spad{p}.
612077`\spad{modulus(x)} \undocumented
612163`\spad{modulus(x)} \undocumented
612239`\spad{modulus(x)} \undocumented
612376`\spad{moebius incidence} matrix for this poset This function is based on code by Franz Lehner. Notes by Martin Baker on the webpage here: \url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/moebius/}
612440`\spad{moebius(a,{} b,{} c,{} d)} returns \spad{matrix [[a,{} b],{} [c,{} d]]}.
612495`Generate a cubical complex of the surface of a Moebius band. A one sided surface with a single external boundary line.
612577`Generate a minimal triangulation of the surface of a Moebius band. A one sided surface with a single external boundary line.
612664`\spad{moebiusFunction(pp)} creates the canonical zeta matrix and inverts it.
612732`\spad{moebiusMatrix(P)} returns the Moebius matrix
612806`\spad{moebiusMatrix()} returns the Moebius matrix
612887`\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.
612959`\spad{moebiusMu(mf,{} \spad{pi},{} \spad{si})} evaluates the Moebius function
613025`\spad{moment2booleanCumulant(mm)} computes the sequence of boolean cumulants from the sequence of moments \spad{mm}
613106`\spad{moment2cumulant(mm)} computes the sequence of classical cumulants from the sequence of moments \spad{mm}
613180`\spad{moment2freeCumulant(mm)} computes the sequence of free cumulants from the sequence of moments \spad{mm}
613258`\spad{moment2jacobi(mm)} computes the Jacobi parameters as pair of streams.
613364`\spad{moment2jacobi2(mm)} computes the Jacobi parameters as stream of pairs \$(an,{} \spad{bn})\$.
613463`\spad{moment2monotoneCumulant(x)} returns the sequence of monotone cumulants of the moment sequence \spad{x}
613578`\spad{moment2monotoneCumulant(x)} returns the sequence of monotone cumulants of the moment sequence \spad{x}
613660`\spad{moment(x,{} n)} returns the \spad{n}-th moment of the distribution \spad{x}
613731`\spad{moment2nthJacobi(mm)} computes the list of Jacobi parameters from the list of moments \spad{mm} as far as possible.
613832`\spad{moment2Stransform(x)} returns the Puiseux and Laurent order and coefficients of the \spad{S} transform of \spad{x}
614006`\spad{moments(x)} returns the sequence of moments of the distribution \spad{x}
614136`\spad{monic?(p)} tests if \spad{p} is monic (\spadignore{i.e.} leading coefficient equal to 1).
614208`\spad{monic?(p)} returns \spad{false} if \spad{p} belongs to \spad{R},{} otherwise returns \spad{true} iff \spad{p} is monic as a univariate polynomial in its main variable.
614277`\spad{monicCompleteDecompose(f)} returns a list of factors of \spad{f} for the functional decomposition of monic polynomial \spad{f}. [\spad{f1},{} ...,{} \spad{fn}] means \spad{f} = \spad{f1} \spad{o} ... \spad{o} \spad{fn}.
614376`\spad{monicDecomposeIfCan(f)} returns a functional decomposition of the monic polynomial \spad{f} or "failed" if it has not found any.
614504`\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\spad{'t} monic.
614711`\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}.
614824`\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\spad{''}.
614949`\spad{monicLeftDivide(a,{} b,{} sigma)} returns the pair \spad{[q,{} r]} such that \spad{a = b*q + r} and the degree of \spad{r} is less than the degree of \spad{b}. \spad{b} must be monic. This process is called ``left division\spad{''}. \spad{\sigma} is the morphism to use.
615095`\spad{monicModulo(a,{} b)} returns \spad{r} such that \spad{r} is reduced with respect to \spad{b} and \spad{b} divides \spad{a - r} where \spad{b} is monic.
615231`\spad{monicModulo(a,{} b)} computes \spad{a mod b},{} if \spad{b} is monic as univariate polynomial in its main variable.
615301`\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\spad{''}.
615427`\spad{monicRightDivide(a,{} b,{} sigma)} returns the pair \spad{[q,{} r]} such that \spad{a = q*b + r} and the degree of \spad{r} is less than the degree of \spad{b}. \spad{b} must be monic. This process is called ``right division\spad{''}. \spad{\sigma} is the morphism to use.
615574`\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.
615701`\spad{monologextint(lup,{} csolve,{} rec)} is a helper for logextint
615974`\spad{monom(deg,{} coef)} is a monomial of degree \spad{deg} with coefficient coef.
616049`\spad{monomial1(md)} returns monomial of degree 1 with coefficient 1.
616128`\spad{monomial?(x)} returns \spad{true} if \spad{x} is a single monomial,{} that is support of \spad{x} consists of a single element.
616193`\spad{monomial?(f)} tests if \spad{f} is a single monomial.
616269`\spad{monomial?(x)} \undocumented
616388`\spad{monomial?(x)} returns \spad{true} if \spad{x} is a monomial
616444`\spad{monomial(a,{} s)} constructs a direct product element with the \spad{s} component set to \spad{a}
616574`\spad{monomial(r,{} e)} makes a term from a coefficient \spad{r} and an exponent \spad{e}.
616650`\spad{monomial(x,{} n)} \undocumented
616712`\spad{monomial(r,{} x)} \undocumented
616885`\spad{monomial(c,{} [i1,{} i2,{} ...,{} iN])} produces the value given by \spad{c*e(i1)*e(i2)*...*e(iN)}.
616963`\spad{monomial(r,{} w)} returns the product of the word \spad{w} by the coefficient \spad{r}.
617027`\spad{monomial(a,{} [v1..vn],{} [e1..en])} returns \spad{a*prod(vi^ei)}.
617549`\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.
617645`\spad{monomial(a,{} [x1,{} x2,{} ...,{} xk],{} [n1,{} n2,{} ...,{} nk])} returns \spad{a * x1^n1 * ... * xk^nk}.
617753`\spad{monomial(a,{} x,{} n)} returns \spad{a*x^n}.
617849`\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 with respect to the derivation '.
618015`\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}.
618181`\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)]}.
618333`\spad{monomials(x)} returns the list of \spad{r_i*b_i} whose sum is \spad{x}.
618394`\spad{monotoneConvolution(x,{} y)} returns the monotone convolution of the distributions \spad{x} and \spad{y}
618461`\spad{monotoneCumulant2moment(hh)} computes the sequence of moments from the sequence of monotone cumulants \spad{hh}
618543`\spad{monotoneCumulant2momentPoly(hh)} computes the sequence of moment polynomials \$\spad{m_n}(\spad{t})\$ from the sequence of monotone cumulants \spad{hh}
618657`\spad{monotoneCumulants(x)} returns the sequence of monotone cumulants of the distribution \spad{x}.
619063`\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.
619145`\spad{more?(u,{} n)} tests if \spad{u} has more than \spad{n} elements.
619207`\spad{moreAlgebraic?(ts,{} us)} returns \spad{false} iff \spad{ts} and \spad{us} are both empty,{} or \spad{ts} has less elements than \spad{us},{} or some variable is algebraic with respect to \spad{us} and is not with respect to \spad{ts}.
619287`\spad{moreAlgebraic?(ts,{} us)} returns \spad{false} iff \spad{ts} and \spad{us} are both empty,{} or \spad{ts} has less elements than \spad{us},{} or some variable is algebraic with respect to \spad{us} and is not with respect to \spad{ts}.
619377`\spad{morphism(f)} returns the morphism given by \spad{f^n(x) = f(x,{} n)}.
619436`\spad{morphism(f)} returns the non-invertible morphism given by \spad{f}.
619487`\spad{morphism(f,{} g)} returns the invertible morphism given by \spad{f},{} where \spad{g} is the inverse of \spad{f}..
619545`\spad{motzkinPathArray([a0,{} a1,{} ...],{} [b0,{} b1,{} ...],{} [c1,{} c2,{} ...])} computes Flajolet\spad{'s} Motzkin path array from the sequences \spad{ai},{} \spad{bi},{} \spad{ci}.
619645`\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}.
619735`\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}.
619827`\spad{movedPoints(gp)} returns the points moved by the group {\em gp}.
619885`\spad{movedPoints(p)} returns the set of points moved by the permutation \spad{p}.
619938`\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}.
620048`\spad{MPtoMPT(p,{} s,{} ls,{} m)} converts \spad{p} to packed representation.
620160`\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
620301`\spad{mrv_cmp compare} kernels.
620608`\spad{mrv_limit1(f,{} x)} normalizes and computes limit.
620734`\spad{mrv_limit(f,{} x=a)} computes limit(\spad{f}(\spad{x}),{} x=a) for a finite or infinite limit point a.
621048`\spad{mrv_limit(f,{} x = a,{} str)} computes limit(\spad{f}(\spad{x}),{} x=a) for a strictly finite limit point a. This function computes one-sided limits from the left or right.
621203`\spad{mrv_limit(f,{} x,{} a)} is like mrv_limit(\spad{f},{} \spad{x} = a).
621514`\spad{mrv_limit(f,{} x,{} s)} computes limit.
621779`\spad{mrv_limit(f,{} x,{} a,{} str)} is like mrv_limit(\spad{f},{} \spad{x} = a,{} \spad{str}).
621931`\spad{mrv_normalize(f,{} x,{} s)} transform \spad{f} to the form acceptable by core variant of mrv_limit.
622165`\spad{mrv_rewrite0 rewrites} comparable kernels in terms of a single one.
622331`\spad{mrv_rewrite rewrites} comparable kernels and computes leading term of series expansion.
622678`\spad{mrv_set compute} \spad{MRV} set.
622976`\spad{mrv_sign(f,{} x,{} s)} computes sign of \spad{f} near \spad{x}.
623209`\spad{Mu()} returns symbol for capital greek letter mu.
623257`\spad{mu()} returns symbol for small greek letter mu.
623305`Polynomial multiplication.
623394`\spad{mul_by_binomial(v,{} pt,{} p)} treats \spad{v} a polynomial and multiplies in place this polynomial by binomial (\spad{x} + \spad{pt}). Highest coefficient of product is ignored.
623488`\spad{mul_by_binomial(v,{} deg,{} pt,{} p)} treats \spad{v} as coefficients of polynomial of degree \spad{deg} - 1 and multiplies in place this polynomial by binomial (\spad{x} + \spad{pt}). Highest coefficient of product is ignored.
623679`\spad{mul_by_scalar(v,{} deg,{} c,{} p)} treats \spad{v} as coefficients of polynomial of degree \spad{deg} and multiplies in place this polynomial by scalar \spad{c}
623779`\spad{mulmod(a,{} b,{} p)},{} \spad{0<=a,{} b<p>1},{} means \spad{a*b mod p}.
623912`\spad{multiEuclidean([f1,{} ...,{} fn],{} z)} returns a list of coefficients \spad{[a1,{} ...,{} an]} such that \spad{ z / prod \spad{fi} = sum aj/fj}. If no such list of coefficients exists,{} "failed" is returned.
623994`\spad{multiEuclideanTree(l,{} r)} \undocumented{}
624062`construct graph from a list of permutations.
624143`\spad{multifunctionGraph(l)} constructs a graph with given list \spad{l} of objects. More objects and arrows can be added later if required.
624338`\spad{multifunctionGraph(l)} constructs a graph with given list \spad{l} of object names. Use this version of the constructor if you don\spad{'t} intend to create diagrams and therefore don\spad{'t} care about \spad{x},{} \spad{y} coordinates. More objects and arrows can be added later if required.
624406`\spad{multifunctionGraph(lo,{} la)} constructs a graph with given list of objects la and list of arrows la. More objects and arrows can be added later if required.
624700`\spad{multifunctionGraph(lo,{} am)} constructs a graph given list of objects \spad{lo} and adjacency matrix am.
624799`\spad{multiIndex(jv)} returns the multi-index of the jet variable \spad{jv}.
624872`\spad{multinomial(n,{} [m1,{} m2,{} ...,{} mk])} returns the multinomial coefficient \spad{n!/(m1! m2! ... mk!)}.
624945`\spad{multiple?(p)} tests if \spad{p} is a single matching variable allowing list matching or multiple term matching in a sum or product.
624993`\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.
625052`\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.
625128`\spad{multiplicative?(a,{} n)} returns \spad{true} if the first \spad{n} coefficients of a are multiplicative
625207`\spad{multiplyALS(f,{}g)} computes \spad{f*g} in terms of the admissible linear systems for \spad{f} and \spad{g} (without minimization).
625269`\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..)}.
625366`\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.
625462`\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.
625557`\spad{multiplyColumn!(f,{} i,{} alpha)} multiplies column(\spad{i}) by alpha in the ALS of \spad{f}.
625642`\spad{multiplyColumn!(p,{} j,{} alphat)} multiplies column(\spad{j}) by alpha.
625734`\spad{multiplyExponents(f,{} r)} multiplies all exponents of the power series \spad{f} by the positive rational number \spad{r}.
625829`\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}.
625919`\spad{multiplyExponents(f,{} n)} multiplies all exponents of the power series \spad{f} by the positive integer \spad{n}.
626016`\spad{multiplyMIN(f,{}g)} uses multiplyALS(\spad{f},{}\spad{g}) with minimization.
626078`\spad{multiplyRow!(f,{} i,{} alpha)} multiplies row(\spad{i}) by alpha in the ALS of \spad{f}.
626160`\spad{multiplyRow!(p,{} i,{} alpha)} multiplies row(\spad{i}) by alpha.
626325`\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}.}
626409`\spad{multisect(a,{} b,{} st)} selects the coefficients of \spad{x^((a+b)*n+a)},{} and changes them to \spad{x^n}.
626504`\spad{multiset()}\$\spad{D} creates an empty multiset of domain \spad{D}.
626545`\spad{multiset(ls)} creates a multiset with elements from \spad{ls}.
626593`\spad{multiset(s)} creates a multiset with singleton \spad{s}.
626635`\spad{multi_SPDE(a,{} b,{} lc,{} d,{} der)}
627146`\spad{multivariate(f,{} v)} applies both the numerator and denominator of \spad{f} to \spad{v}.
627267`\spad{multivariate(f,{} v)} applies both the numerator and denominator of \spad{f} to \spad{v}.
627410`\spad{multivariate(sup,{} v)} converts an anonymous univariable polynomial \spad{sup} to a polynomial in the variable \spad{v}.
627510`\spad{multivariate(sup,{} v)} converts an anonymous univariable polynomial \spad{sup} to a polynomial in the variable \spad{v}.
627610`\spad{multivariate(u,{} k,{} f)} \undocumented
627750`to allow entries like: 1+2*e1+3*e2+4*e1e2 = multivector[1,{} 2,{} 3,{} 4]
627815`\spad{multMonom(r,{} e,{} x)} \undocumented
627890`\spad{musserTrials()} returns the number of primes that are tried in \spadfun{modularFactor}.
627963`\spad{musserTrials(n)} sets to \spad{n} the number of primes to be tried in \spadfun{modularFactor} and returns the previous value.
628051`\spad{mutable?(f)} is the underlying ALS of \spad{f} mutable?
628228`\spad{mvar(ps)} returns the main variable of the non constant polynomial with the greatest main variable,{} if any,{} else an error is returned.
628295`\spad{mvar(p)} returns an error if \spad{p} belongs to \spad{R},{} otherwise returns its main variable \spad{w}. \spad{r}. \spad{t}. to the total ordering on the elements in \spad{V}.
628356`\spad{myDegree should} be local
628498`\spad{my_digamma should} be local but conditional
628612`\spad{my_root3(a)} should be local but conditional
628661`\spad{my_sqrt(a)} should be local but conditional
628709`main solver routine
629419`\spad{naiveBeckermannLabahn(f,{} degs,{} sigma,{} p)} solves modulo \$\spad{p}\$ Hermite-Pade interpolation problem of order \$\spad{sigma}\$. \$\spad{degs}\$ specifies degree bounds for solution. The first element of result contains \spad{sigma}-basis. The second gives defects of elements of \spad{sigma}-basis. The third one contains residuals \spad{--} we stop updating solution if this would violate degree bounds,{} so residual is zero for elements of \spad{sigma}-basis which are within bounds,{} but non-zero otherwise.
629584`\spad{naiveBeckermannLabahn(f,{} degs,{} sigma,{} p)} solves modulo \$\spad{p}\$ Hermite-Pade interpolation problem of order \$\spad{sigma}\$. \$\spad{degs}\$ specifies degree bounds for solution. The first element of result contains \spad{sigma}-basis. The second gives defects of elements of \spad{sigma}-basis. The third one contains residuals \spad{--} we stop updating solution if this would violate degree bounds,{} so residual is zero for elements of \spad{sigma}-basis which are within bounds,{} but non-zero otherwise.
629723`\spad{naiveBeckermannLabahnMultipoint(f,{} degs,{} sigma,{} p)} solves modulo \$\spad{p}\$ multipoint Hermite-Pade interpolation problem of order \$\spad{sigma}\$. \$\spad{degs}\$ specifies degree bounds for solution. The first element of result contains \spad{sigma}-basis. The second gives defects of elements of \spad{sigma}-basis. The third one contains residuals \spad{--} we stop updating solution if this would violate degree bounds,{} so residual is zero for elements of \spad{sigma}-basis which are within bounds,{} but non-zero otherwise.
629889`\spad{naiveBeckermannLabahnMultipoint(f,{} degs,{} sigma,{} p)} solves modulo \$\spad{p}\$ multipoint Hermite-Pade interpolation problem of order \$\spad{sigma}\$. \$\spad{degs}\$ specifies degree bounds for solution. The first element of result contains \spad{sigma}-basis. The second gives defects of elements of \spad{sigma}-basis. The third one contains residuals \spad{--} we stop updating solution if this would violate degree bounds,{} so residual is zero for elements of \spad{sigma}-basis which are within bounds,{} but non-zero otherwise.
630029`\spad{name(jv)} yields the name of the jet variable \spad{jv}.
630078`\spad{name(op(a1,{} ...,{} an))} returns the name of op.
630127`\spad{name(x)} returns the symbol
630176`\spad{name(x)} returns the symbol
630221`\spad{name(s)} returns \spad{s} without its scripts.
630254`\spad{name(f)} returns the external name of the file \spad{f}.
630304`\spad{name(f)} returns the name part of the file name.
630352`\spad{name(op)} returns the name of \spad{op}.
630397`\spad{namedBranch(chin,{} nmin)} constructs a branch in the tree structure
630470`\spad{namedPoints(ptin,{} nmin)} constructs a list of named points.
630544`\spad{namedPoints(scin,{} nmin)} constructs a list of named nodes.
630665`\spad{nand(a,{} b)} returns the logical {\em nand} of bit aggregates \spad{a} and \spad{b}.
630706`\spad{nand(a,{} b)} returns the logical negation of \spad{a} and \spad{b}.
630742`\spad{nary?(op)} tests if \spad{op} has arbitrary arity.
630789`\spad{nary(s,{} p,{} hh)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats each argument according to \spad{hh}. All resulting boxes will be horizontally concatenated with \spad{box s} inbetween. Outer parentheses are added if \spad{p < prec}.
630920`\spad{nary(s,{} p,{} hh)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats each argument according to \spad{hh}. All resulting boxes will be horizontally concatenated with \spad{box s} inbetween. Outer parentheses are added if \spad{p < prec}.
631055`\spad{nary(plus,{} minus,{} p,{} hh)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats each argument according to \spad{hh}. All resulting boxes will be horizontally concatenated with \spad{box minus} or \spad{box plus} inbetween depending on whether the respective argument starts with a unary \spad{minus} or not. Outer parentheses are added if \spad{p < prec}. This is a special handler that treats the case that a sum is represented as a nary expression that contains unary subexpressions that are unary \spad{minus} expressions. This handler transforms something like (+ a (- \spad{b})) into a - \spad{b}.
631197`\spad{nary(plus,{} minus,{} p,{} hh)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats each argument according to \spad{hh}. All resulting boxes will be horizontally concatenated with \spad{box minus} or \spad{box plus} inbetween depending on whether the respective argument starts with a unary \spad{minus} or not. Outer parentheses are added if \spad{p < prec}. This is a special handler that treats the case that a sum is represented as a nary expression that contains unary subexpressions that are unary \spad{minus} expressions. This handler transforms something like (+ a (- \spad{b})) into a - \spad{b}.
631343`\spad{ncDetSys(sys)} computes the determining system for generators of conditional symmetries of \spad{sys}. It makes the same assumptions as \spad{detSys}.
631484`\spad{ncDetSys(sys,{} vf)} computes the determining system for generators of conditional symmetries of \spad{sys} with a given ansatz for the vector fields.
631646`\spad{ncDetSys(sys,{} sjb,{} vf)} computes the determining system for generators of conditional symmetries of \spad{sys}. The meaning of the further arguments is the same as in \spad{detSys}.
631818`\spad{ncols(p)} returns the number of columns.
631896`\spad{ncols(A)} returns the number of columns of the matrix \spad{A}.
632048`\spad{ncols(m)} returns the number of columns in the matrix \spad{m}.
632133`\spad{ncols(m)} returns the number of columns in the array \spad{m}
632264`\spad{negative?(u)} returns \spad{true} if every element of \spad{u} is negative,{} \spad{false} otherwise.
632321`\spad{negative?(x)} tests whether \spad{x} is strictly less than 0.
632464`\spad{negative?(pol,{} aRoot)} answers if \spad{pol} interpreted as \spad{aRoot} is negative
632560`\spad{nelem(p)} returns the number of elements.
632638`\spad{new()} create a new,{} empty object with defaultPrologue(\spad{""}) and defaultEpilogue(\spad{""}). Use \spadfun{setPrologue!},{} \spadfun{setFormat!} and \spadfun{setEpilogue!} to set the various components of this object.
632675`\spad{new()} return a new HashState.
632709`\spad{new()} creates an empty structure of handlers.
632759`\spad{new()} returns a new empty match result.
632813`\spad{new()} returns a new empty match result.
632861`\spad{new()} \undocumented
632911`\spad{new()} \undocumented
632949`\spad{new()} create a new,{} empty object. Use \spadfun{setPrologue!},{} \spadfun{setTex!} and \spadfun{setEpilogue!} to set the various components of this object.
632983`\spad{new()} returns a new symbol whose name starts with \%.
633014`\spad{new(c)} creates a constant element.
633066`\spad{new(s)} returns a new symbol whose name starts with \%\spad{s}.
633098`\spad{new(m,{}c)} creates a monomial element with coefficient \spad{c}.
633166`\spad{new(lp,{} lst)} creates an element by the linear multivariate matrix pencil \spad{lp} and the list of monomials \spad{lst}.
633272`\spad{new(inds,{} nrows)} generates a new matrix with \spad{nrows} rows and columns enumerated by the indices \spad{inds}. The matrix is empty,{} \spadignore{i.e.} the zero matrix.
633395`\spad{new(n,{} x)} returns a new aggregate of size \spad{n} all of whose entries are \spad{x}.
633458`\spad{new(m,{} n,{} r)} is an \spad{m}-by-\spad{n} array all of whose entries are \spad{r}
633560`\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.
633621`\spad{newFortranTempVar()} creates new name for temporary variable and puts it in TheSymbolTable
633681`\spad{newGreek()} returns the next greek symbol.
633735`\spad{newline()} provides the newline character.
633773`\spad{newLine()} sends a new line command to output.
633821`\spad{newReduc(n)} empties reduction state. \spad{n} is size of random integers to use during next reduction.
633885`\spad{newSubProgram(f)} asserts that from now on type declarations are part of subprogram \spad{f}.
633943`\spad{newton}(\spad{l}) returns the interpolating polynomial for the values \spad{l},{} where the \spad{x}-coordinates are assumed to be [1,{} 2,{} 3,{} ...,{} \spad{n}] and the coefficients of the interpolating polynomial are known to be in the domain \spad{F}. \spad{I}.\spad{e}.,{} it is a very streamlined version for a special case of interpolation.
634028`\spad{newTypeLists(x)} \undocumented
634084`\spad{next(l)} returns the doubly-linked aggregate beginning with its next element. Error: if \spad{l} has no next element. Note: \spad{next(l) = rest(l)} and \spad{previous(next(l)) = l}.
634135`\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.
634260`\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. \spad{lexSmaller?} is used as ordering predicate.
634683`\spad{nextItem(x)} returns the next item,{} or "failed" if domain is exhausted.
634741`\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 []} indicates that {\em lattP} has no successor.
634867`\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. \spad{nlexSmaller?} is used as ordering predicate.
635010`\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. \spad{cnlexSmaller?} is used as ordering predicate. This operation is equivalent to nextPrimitiveNormalPoly(\spad{f}).
635162`\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.
635283`\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.
635406`\spad{nextPrime(n)} returns the smallest prime strictly larger than \spad{n}
635461`\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. \spad{cnlexSmaller?} is used as ordering predicate. This operation is equivalent to nextNormalPrimitivePoly(\spad{f}).
635613`\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. \spad{clexSmaller?} is used as ordering predicate.
635759`\spad{next_sousResultant2(P,{} Q,{} Z,{} s)} returns the subresultant \spad{S_{e-1}} where \spad{P ~ S_d,{} Q = S_{d-1},{} Z = S_e,{} s = lc(S_d)}
635850`\spad{nextSublist(n,{} k)} returns a list of \spad{k}-subsets of {1,{} ...,{} \spad{n}}.
635957`\spad{next_subResultant2(p,{} q,{} z,{} s)} is the multivariate version of the operation \spadopFrom{\spad{next_sousResultant2}}{PseudoRemainderSequence} from the \spadtype{PseudoRemainderSequence} constructor.
636059`\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 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(\spad{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 side-effect,{} \spadignore{i.e.} {\em nextSubsetGray(vv)} and {\em vv := nextSubsetGray(vv)} will have the same effect.
636164`\spad{nilFactor(base,{} exponent)} creates a factored object with a single factor with no information about the kind of \spad{base} (flag = "nil").
636226`\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))}.
636341`\spad{nlexSmaller?(f,{} g)} compares monic \spad{f} and \spad{g} of the same degree \spad{n} in the following order. Error: if \spad{f} or \spad{g} is not monic or if \spad{f} and \spad{g} have different degrees or if common degree is 0. \spad{f < g} if the coefficient of the term of degree {\em n-1} of \spad{f} is zero and than that for \spad{g} is nonzero. Also,{} \spad{f < g} if both coefficients are nonzero and {\em lookup} of the coefficient of \spad{f} is less than that for \spad{g}. In case those coefficients are equal,{} then \spad{lexSmaller?} is used as ordering predicate.
636651`\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.).
636724`\spad{node(l,{} v,{} r)} creates a binary tree with value \spad{v},{} left subtree \spad{l},{} and right subtree \spad{r}.
636950`\spad{nodeFromArrow(s,{} a)} returns index of all nodes with a direct arrow leading in to arrow 'a' in graph \spad{'s'}
637214`\spad{nodeFromNode(s,{} a)} gives list of all nodes with a direct arrow leading in to node 'a' in graph \spad{'s'}
637305`\spad{nodeOf?(s,{} a)} returns \spad{true} iff some node of \spad{a} is equal to \spad{s}
637602`\spad{nodes(u)} returns a list of all of the nodes of aggregate \spad{u}.
637827`\spad{nodeToArrow(s,{} a)} returns index of all nodes with a direct arrow leading out of arrow 'a' in graph \spad{'s'}
638085`\spad{nodeToNode(s,{} a)} gives list of all nodes with a direct arrow leading out of node 'a' in graph \spad{'s'}
638174`\spad{noKaratsuba(a,{} b)} returns \spad{a*b} without using Karatsuba\spad{'s} trick at all.
638256`\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.
638319`\spad{noncommutativeJordanAlgebra?()} tests if the algebra is flexible and Jordan admissible.
638412`\spad{noncommutativeJordanAlgebra?()} tests if the algebra is flexible and Jordan admissible.
638502`\spad{nonQsign(r)} \undocumented
638570`\spad{nonSingularModel(u)} returns the equations in \spad{u1},{} ...,{} un of an affine non-singular model for the curve.
638667`\spad{nonSingularModel(u)} returns the equations in \spad{u1},{} ...,{} un of an affine non-singular model for the curve.
638812`\spad{nor(a,{} b)} returns the logical {\em nor} of bit aggregates \spad{a} and \spad{b}.
638852`\spad{nor(a,{} b)} returns the logical negation of \spad{a} or \spad{b}.
638887`\spad{norm(f)} returns the norm of the module \spad{f}.
638954`\spad{norm(I)} returns the norm of the ideal \spad{I}.
639285`\spad{norm(p)} determines sum of absolute values of coefficients Note: this function depends on \spadfunFrom{abs}{Complex}.
639344`\spad{norm x} returns the same as absolute value.
639387`\spad{norm q} returns the norm of \spad{q},{} \spadignore{i.e.} the product of all the conjugates of \spad{q}.
639457`\spad{norm(x)} returns \spad{x} * conjugate(\spad{x})
639502`\spad{norm(a)} returns the determinant of the regular representation of \spad{a} with respect to any basis.
639552`\spad{norm(o)} returns the norm of an octonion,{} equal to the sum of the squares of its coefficients.
639598`\spad{norm(q)} computes the norm of \spad{q} (the sum of the squares of the components).
639719`\spad{norm(f,{} p)} returns the \spad{lp} norm of the polynomial \spad{f}.
639804`\spad{norm(x,{} n)} \undocumented{} See \spadfunFrom{norm}{FiniteAlgebraicExtensionField}
639899`\spad{norm(f,{} k)} computes the norm of the algebraic number \spad{f} with respect to the extension generated by kernel \spad{k}
639951`\spad{norm(f,{} l)} computes the norm of the algebraic number \spad{f} with respect to the extension generated by kernels \spad{l}
640009`\spad{norm(a,{} d)} computes the norm of \spad{a} with respect to the intermediate field of extension degree \spad{d} over the ground field \spad{F}. Error: if \spad{d} does not divide the extension degree \spad{n} of \spad{\%}. Note: norm(a,{} \spad{d}) = reduce(*,{} [a^(\spad{q^}(d*i)) for \spad{i} in 0..\spad{n/d}]) where \spad{q} is size of \spad{F}.
640097`\spad{norm(p,{} k)} computes the norm of the polynomial \spad{p} with respect to the extension generated by kernel \spad{k}
640205`\spad{norm(p,{} l)} computes the norm of the polynomial \spad{p} with respect to the extension generated by kernels \spad{l}
640319`\spad{normal01()} \undocumented
640443`\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.
640540`\spad{normal?(x)} \undocumented{} See \spadfunFrom{normal?}{FiniteAlgebraicExtensionField}
640619`\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.
640700`\spad{normal(f,{} g)} \undocumented
640771`\spad{normalALS(f)} removes a scalar first row of an (extended) ALS.
640829`\spad{normalDenom(f,{} D)} returns the product of all the normal factors of \spad{denom(f)}. \spad{D} is the derivation to use.
640912`\spad{normalDeriv(poly,{} i)} computes the \spad{i}th derivative of \spad{poly} divided by i!.
641038`\spad{normalElement()} returns a element,{} normal over the ground field \spad{F},{} \spadignore{i.e.} \spad{a^(q^i),{} 0 <= i < extensionDegree()} is an \spad{F}-basis,{} where \spad{q = size()\$F}. At the first call,{} the element is computed by \spadfunFrom{createNormalElement}{FiniteAlgebraicExtensionField} then cached in a global variable. On subsequent calls,{} the element is retrieved by referencing the global variable.
641118`\spad{normalElement(n)} \undocumented{} See \spadfunFrom{normalElement}{FiniteAlgebraicExtensionField}
641211`\spad{normalForm(poly,{} gb)} reduces the polynomial \spad{poly} modulo the precomputed groebner basis \spad{gb} giving a canonical representative of the residue class.
641306`\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.
641440`\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.
641543`normalised point has scalar value of one,{} if this is not the case then scale values
641593`\spad{normalize!(f)} rescales the rows such that the first nonzero entry of the coefficient matrix in the diagonal is one. The right hand side is normalized by normalizeRHS! and the non-zero entry is in the last row of the corresponding block.
641652`\spad{normalize(x)} normalizes \spad{x} at current precision.
641689`\spad{normalize(f)} rewrites \spad{f} using the least possible number of real algebraically independent kernels.
641760`\spad{normalize(lf)} is normalize(\spad{lf},{} [])
641843`\spad{normalize(f,{} x)} is normalize([\spad{f}],{} [\spad{x}])
641921`\spad{normalize([f1,{} ...,{} fn],{} lx)} rewrites \spad{f1,{} ...,{} fn} using the least possible number of real algebraically independent kernels. Additionally,{} it tries to ensure that any expression in resulting kernels which syntactically depends on a variable \spad{x} from \spad{lx} has nonzero derivative with respect to \spad{x}.
642017`\spad{normalize(p,{} ts)} normalizes \spad{p} with respect to \spad{ts}.
642199`\spad{normalizeAtInfinity(v)} makes \spad{v} normal at infinity.
642357`\spad{normalized?(ts)} returns \spad{true} iff for every \spad{p} in \spad{ts} we have \spad{normalized?(p,{} us)} where \spad{us} is \spad{collectUnder(ts,{} mvar(p))}.
642651`\spad{normalized?(a,{} b)} returns \spad{true} iff \spad{a} and its iterated initials have degree zero with respect to the main variable of \spad{b}
642727`\spad{normalized?(q,{} lp)} returns \spad{true} iff \spad{normalized?(q,{} p)} holds for every \spad{p} in \spad{lp}.
642809`\spad{normalized?(p,{} ts)} returns \spad{true} iff \spad{p} and all its iterated initials have degree zero with respect to the main variables of the polynomials of \spad{ts}.
642881`\spad{normalizedAssociate(p,{} ts)} returns a normalized polynomial \spad{n} with respect to \spad{ts} such that \spad{n} and \spad{p} are associates with respect to \spad{ts} and assuming that \spad{p} is invertible with respect to \spad{ts}.
642958`\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
643059`\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
643192`\spad{normalizeDIAG!(f)} rescales the rows such that the first nonzero entry of the coefficient matrix in the diagonal is one.
643255`\spad{normalizeIfCan(ts)} returns \spad{ts} in an normalized shape if \spad{ts} is zero-dimensional.
643332`\spad{normalizePLS!(f)} scales and rearranges rows and columns of the system matrix such that the constant part of the system matrix is the identity matrix (possibly of smaller size).
643394`\spad{normalizeRHS!(f)} eliminates non-zero entries in the right hand side of ALS with respect of the non-zero entry with the highest index.
643456`\spad{normDeriv2 should} be local
643585`\spad{normFactors(x)} \undocumented
643669`\spad{normInvertible?(p,{} ts)} is an internal subroutine,{} exported only for development.
643775`\spad{Not(n)} returns the bit-by-bit logical {\em Not} of \spad{n}.
643816`\spad{not f} creates the equivalent prefix form.
643852`\spad{NOT(x)} returns the \spadtype{Switch} expression representing \spad{\~~x}.
643921`\spad{NOT(x)} returns the \spadtype{Switch} expression representing \spad{\~~x}.
644039`\spad{not(b)} returns the logical {\em not} of bit aggregate \spad{b}.
644077`\spad{not n} returns the negation of \spad{n}.
644110`\spad{not(n)} returns the bit-by-bit logical {\em not} of the single integer \spad{n}.
644149`\spad{Not(n)} returns the bit-by-bit logical {\em not} of the single integer \spad{n}.
644188`\spad{notelem(ir)} returns the non-elementary part of an integration result
644271`\spad{nothing()} returns a handler \spad{h} such that \spad{h(prec,{} args)} returns an empty box. This corresponds to NOTHING in \spad{OutputForm}.
644353`\spad{nothing()} returns a handler \spad{h} such that \spad{h(prec,{} args)} returns an empty box. This corresponds to NOTHING in \spad{OutputForm}.
644439`\spad{npcoef(p,{} lmf,{} lcf)} tries to determine some coefficients of factors of \spad{p} assuming that \spad{lcf} gives \spad{true} leading coefficients of the factors and that sparsity pattern of modular factors \spad{lmf} is the same as sparsity pattern of \spad{true} factors. If \spad{res} is the result,{} then \spad{res.deter} gives fully determined factors,{} \spad{res.dterm} gives determined terms of partially determinaed factors,{} \spad{res.nfacts} and \spad{res.nlead} give modular factors and leading coefficients corresponding to undetermined factors.
644668`\spad{nrows(p)} returns the number of rows.
644746`\spad{nrows(A)} returns the number of rows of the matrix \spad{A}.
644898`\spad{nrows(m)} returns the number of rows in the matrix \spad{m}.
644983`\spad{nrows(m)} returns the number of rows in the array \spad{m}
645066`\spad{nsqfree should} be local
645282`\spad{nthExpon(l,{} n)} returns the exponent of the n^th monomial of \spad{l}.
645342`\spad{nthExpon(x,{} n)} returns the exponent of the n^th monomial of \spad{x}.
645399`\spad{nthExpon(x,{} n)} returns the exponent of the n^th monomial of \spad{x}.
645468`\spad{nthFactor(x,{} n)} returns the factor of the n^th monomial of \spad{x}.
645520`\spad{nthFactor(x,{} n)} returns the factor of the n^th monomial of \spad{x}.
645573`\spad{nthFactor(l,{} n)} returns the factor of the n^th monomial of \spad{l}.
645634`\spad{nthr(p,{} n)} should be local but conditional
645764`\spad{nthRoot(f,{} n)} returns \spad{(p,{} r,{} [r1,{} ...,{} rm])} such that the \spad{n}th-root of \spad{f} is equal to \spad{r * \spad{p}th-root(r1 * ... * rm)},{} where \spad{r1},{} ...,{} \spad{rm} are distinct factors of \spad{f},{} each of which has an exponent smaller than \spad{p} in \spad{f}.
646005`\spad{nthRoot(x,{} n)} returns the \spad{n}th root of \spad{x}.
646058`Format square roots and \spad{n}th roots. \spad{nthRoot(p,{} h1,{} h2)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats the first argument according to \spad{h1}. If there is no second argument,{} then the \spad{n}th root is a square root and formatted accordingly. Otherwise the second argument is formatted by \spad{h2}. Outer parentheses are added if \spad{p < prec}.
646223`\spad{nthRootIfCan(z,{} n)} returns the \spad{n}th root of \spad{z} if possible,{} and "failed" otherwise.
646326`\spad{Nu()} returns symbol for capital greek letter nu.
646374`\spad{nu()} returns symbol for small greek letter nu.
646422`\spad{Nul()} gives the basis element 1 for the algebra generated by \spad{n} generators.
646476`\spad{null?(s)} is \spad{true} if \spad{s} is the \spad{S}-expression ().
646546`\spad{nullary A} changes its argument into a \indented{1}{nullary function.}
646598`\spad{nullary?(op)} tests if \spad{op} is nullary.
646648`\spad{nullBoundary()} constructs a null boundary,{} for example,{} when the boundary of a material node is requested.
646695`\spad{nullity(m)} returns the mullity of the matrix \spad{m}. This is the dimension of the null space of the matrix \spad{m}.
646788`\spad{nullity(m)} returns the mullity of the matrix \spad{m}. This is the dimension of the null space of the matrix \spad{m}.
646897`\spad{nullity(m)} returns the nullity of the matrix \spad{m}. This is the dimension of the null space of the matrix \spad{m}.
646990`\spad{nullity(m)} returns the nullity of the matrix \spad{m}. This is the dimension of the null space of the matrix \spad{m}.
647098`\spad{nullSpace M} builds a basis of the kernel of the linear transformation defined by the matrix \spad{M}. This function calls the function \spad{nullSpace} from the \spad{Matrix} domain. Only the signature changes.
647157`\spad{nullSpace(m)} returns a basis for the null space of the matrix \spad{m}.
647268`\spad{nullSpace(m)} returns a basis for the null space of the matrix \spad{m}.
647396`\spad{nullSpace(m)} returns a basis for the null space of the matrix \spad{m}.
647482`\spad{nullSpace(m)}+ returns a basis for the null space of the matrix \spad{m}.
647583`\spad{nullSpace(m)} returns a basis for the null space of the matrix \spad{m}.
647685`\spad{nullSpaceOverConstants(A,{} ld)} returns basis of the homogeneous system \spad{A*vc = 0} where \spad{vc} is a vector of constants.
647794`\spad{number?(f)} tests if \spad{f} is rational
647864`\spad{numberOfChildren(x)} \undocumented
647933`\spad{numberOfComponents()} returns the number of absolutely irreducible components.
648025`\spad{numberOfComponents()} returns the number of absolutely irreducible components.
648114`\spad{numberOfComponents(s)} returns the number of distinct object components in the indicated \spadtype{ThreeSpace},{} \spad{s},{} such as points,{} curves,{} polygons,{} and constructs.
648193`\spad{numberOfComposites(s)} returns the number of supercomponents,{} or composites,{} in the \spadtype{ThreeSpace},{} \spad{s}; Composites are arbitrary groupings of otherwise distinct and unrelated components; A \spadtype{ThreeSpace} need not have any composites defined at all and,{} outside of the requirement that no component can belong to more than one composite at a time,{} the definition and interpretation of composites are unrestricted.
648272`\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.
648357`\spad{numberOfCycles(p)} returns the number of non-trivial cycles of the permutation \spad{p}.
648425`\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)}.
648504`\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 modular factorization package for some prime \spad{p}.
648621`\spad{numberOfFactors(u)} returns the number of factors in \spad{u}.
648687`\spad{numberOfFractionalTerms(p)} computes the number of fractional terms in \spad{p}. This returns 0 if there is no fractional part.
648757`\spad{numberOfHues()} returns the number of total hues,{} set in totalHues.
648810`\spad{numberOfImproperPartitions(n,{} m)} computes the number of partitions of the nonnegative integer \spad{n} in \spad{m} nonnegative parts with regarding the order (improper partitions). Example: {\em numberOfImproperPartitions (3,{} 3)} is 10,{} since {\em [0,{} 0,{} 3],{} [0,{} 1,{} 2],{} [0,{} 2,{} 1],{} [0,{} 3,{} 0],{} [1,{} 0,{} 2],{} [1,{} 1,{} 1],{} [1,{} 2,{} 0],{} [2,{} 0,{} 1],{} [2,{} 1,{} 0],{} [3,{} 0,{} 0]} are the possibilities. Note: this operation has a recursive implementation.
648914`\spad{numberOfIrreduciblePoly(n)}\$FFPOLY(\spad{GF}) yields the number of monic irreducible univariate polynomials of degree \spad{n} over the finite field {\em GF}.
649020`\spad{numberOfMonomials(x)} returns the number of monomials of \spad{x}.
649110`\spad{numberOfNormalPoly(n)}\$FFPOLY(\spad{GF}) yields the number of normal polynomials of degree \spad{n} over the finite field {\em GF}.
649211`\spad{numberOfPrimes(e)} counts the number of commas in \spad{e} and returns it. If \spad{s} does not only contain commas,{} but has a parenthesis at the beginning and the end of the string,{} then the part between the parentheses is interpreted as a roman numeral and translated into an integer. For any other format the function returns \spad{-1}.
649280`\spad{numberOfPrimes(e)} counts the number of commas in \spad{e} and returns it. If \spad{s} does not only contain commas,{} but has a parenthesis at the beginning and the end of the string,{} then the part between the parentheses is interpreted as a roman numeral and translated into an integer. For any other format the function returns \spad{-1}.
649353`\spad{numberOfPrimitivePoly(n)}\$FFPOLY(\spad{GF}) yields the number of primitive polynomials of degree \spad{n} over the finite field {\em GF}.
649685`\spad{numDepVar} returns the number of dependent variables.
649888`\spad{numer x} returns the numerator of \spad{x}.
649933`\spad{numer x} returns the numerator of \spad{x}.
649974`\spad{numer(1/d * (f1,{} ...,{} fn))} = the vector \spad{[f1,{} ...,{} fn]}.
650035`\spad{numer(x)} returns the numerator of the fraction \spad{x}.
650087`\spad{numer(f)} returns the numerator of \spad{f} viewed as a polynomial in the kernels over \spad{Z}.
650176`\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}.
650320`\spad{numerator(f)} yields the numerator of \spad{f}.
650430`\spad{numerator(f)} returns the numerator of \spad{f} converted to \%.
650492`\spad{numerator(x)} is the numerator of the fraction \spad{x} converted to \%.
650548`\spad{numerators(x)} returns the stream of numerators of the approximants of the continued fraction \spad{x}. If the continued fraction is finite,{} then the stream will be finite.
650609`\spad{numeric(x)} returns a real approximation of \spad{x}.
650709`\spad{numeric(x)} returns a real approximation of \spad{x}.
650796`\spad{numeric(x)} returns a real approximation of \spad{x}.
650863`\spad{numeric(x)} returns a real approximation of \spad{x}.
650907`\spad{numeric(x,{} n)} returns a real approximation of \spad{x} up to \spad{n} decimal places.
651023`\spad{numeric(x,{} n)} returns a real approximation of \spad{x} up to \spad{n} decimal places.
651126`\spad{numeric(x,{} n)} returns a real approximation of \spad{x} up to \spad{n} decimal places.
651209`\spad{numeric(x,{} n)} returns a real approximation of \spad{x} up to \spad{n} decimal places.
651269`\spad{numericIfCan(x)} returns a real approximation of \spad{x},{} or "failed" if \spad{x} is not a constant.
651390`\spad{numericIfCan(x)} returns a real approximation of \spad{x},{} or "failed" if \spad{x} is not a constant.
651498`\spad{numericIfCan(x)} returns a real approximation of \spad{x},{} or "failed" if \spad{x} is not a constant.
651586`\spad{numericIfCan(x,{} n)} returns a real approximation of \spad{x} up to \spad{n} decimal places,{} or "failed" if \spad{x} is not a constant.
651723`\spad{numericIfCan(x,{} n)} returns a real approximation of \spad{x} up to \spad{n} decimal places,{} or "failed" if \spad{x} is not a constant.
651847`\spad{numericIfCan(x,{} n)} returns a real approximation of \spad{x} up to \spad{n} decimal places,{} or "failed" if \spad{x} is not a constant.
651951`\spad{numerJP(f)} writes \spad{f} as polynomial over \spad{JB}.
652055`\spad{numFunEvals()} returns the number of points computed
652098`\spad{numFunEvals3D()} returns the number of points computed.
652145`\spad{numIndVar} returns the number of independent variables.
652348`\spad{obj(a)} essentially returns the original object that was converted to \spadtype{Any} except that the type is forced to be \spadtype{None}.
652380`\spad{objectOf(a)} returns a printable form of the original object that was converted to \spadtype{Any}.
652423`\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}..
652651`\spad{objectToIndex returns} the index of a given object.
652714`\spad{oblateSpheroidal(a)} transforms from oblate spheroidal coordinates to Cartesian coordinates: \spad{oblateSpheroidal(a)} is a function which will map the point \spad{(\spad{xi},{} eta,{} phi)} to \spad{x = a*sinh(\spad{xi})*sin(eta)*cos(phi)},{} \spad{y = a*sinh(\spad{xi})*sin(eta)*sin(phi)},{} \spad{z = a*cosh(\spad{xi})*cos(eta)}.
652792`\spad{octon(qe,{} qE)} constructs an octonion from two quaternions using the relation {\em O = Q + QE}.
652857`\spad{octon(re,{} \spad{ri},{} rj,{} rk,{} rE,{} rI,{} rJ,{} rK)} constructs an octonion from scalars.
652968`\spad{odd? x} is \spad{true} if \spad{x} is an odd integer.
653049`\spad{odd?(n)} returns \spad{true} if and only if \spad{n} is odd.
653101`\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}.
653148`\spad{oddInfiniteProduct(f(x))} computes \spad{product(n=1,{} 3,{} 5...,{} f(x^n))}. The series \spad{f(x)} should have constant coefficient 1.
653225`\spad{oddintegers(n)} returns \spad{[n,{} n+2,{} n+4,{} ...]}.
653371`\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(oddlambert(log(f(x))))}.}
653440`\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))))}.
653520`\spad{odd_partitions(n)} is the stream of all partitions \indented{1}{of \spad{n} into odd numbers.}
653608`\spad{odd_partitions(p,{} l,{} n)} is the stream of partitions \indented{1}{of \spad{n} into odd numbers whose number of parts is no greater than \spad{p}} \indented{1}{and whose largest part is no greater than \spad{l}.}
653712`\spad{ode1(f,{} c)} is the solution to \spad{y' = f(y)} such that \spad{y(a) = c}.
653796`\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}.
653889`\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+1)} for \spad{i} in 0..(\spad{n} - 1).
653984`\spad{OMbindTCP}
654054`\spad{OMclose(dev)} closes \spad{dev},{} flushing output if necessary.
654101`\spad{OMcloseConn}
654156`\spad{OMconnectTCP}
654236`\spad{OMconnInDevice : }
654304`\spad{OMconnOutDevice : }
654373`\spad{omega()} is the first infinite ordinal
654412`\spad{Omega()} returns symbol for capital greek letter omega.
654463`\spad{omega()} returns symbol for small greek letter omega.
654514`\spad{omegapower(p)} returns omega^p
654559`\spad{OMencodingBinary()} is the constant for the OpenMath binary encoding.
654613`\spad{OMencodingSGML()} is the constant for the deprecated OpenMath SGML encoding.
654665`\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.
654720`\spad{OMencodingXML()} is the constant for the OpenMath \spad{XML} encoding.
654771`\spad{omError(k,{} l)} creates an instance of OpenMathError.
654843`\spad{OMgetApp(dev)} reads a begin application token from \spad{dev}.
654891`\spad{OMgetAtp(dev)} reads a begin attribute pair token from \spad{dev}.
654939`\spad{OMgetAttr(dev)} reads a begin attribute token from \spad{dev}.
654988`\spad{OMgetBind(dev)} reads a begin binder token from \spad{dev}.
655037`\spad{OMgetBVar(dev)} reads a begin bound variable list token from \spad{dev}.
655086`\spad{OMgetEndApp(dev)} reads an end application token from \spad{dev}.
655137`\spad{OMgetEndAtp(dev)} reads an end attribute pair token from \spad{dev}.
655188`\spad{OMgetEndAttr(dev)} reads an end attribute token from \spad{dev}.
655240`\spad{OMgetEndBind(dev)} reads an end binder token from \spad{dev}.
655292`\spad{OMgetEndBVar(dev)} reads an end bound variable list token from \spad{dev}.
655344`\spad{OMgetEndError(dev)} reads an end error token from \spad{dev}.
655397`\spad{OMgetEndObject(dev)} reads an end object token from \spad{dev}.
655451`\spad{OMgetError(dev)} reads a begin error token from \spad{dev}.
655501`\spad{OMgetFloat(dev)} reads a float from \spad{dev}.
655558`\spad{OMgetInteger(dev)} reads an integer from \spad{dev}.
655613`\spad{OMgetObject(dev)} reads a begin object token from \spad{dev}.
655664`\spad{OMgetString(dev)} reads a string from \spad{dev}.
655717`\spad{OMgetSymbol(dev)} reads a symbol from \spad{dev}.
655793`\spad{OMgetType(dev)} returns the type of the next object on \spad{dev}.
655844`\spad{OMgetVariable(dev)} reads a variable from \spad{dev}.
655899`\spad{Omicron()} returns symbol for capital greek letter omicron.
655952`\spad{omicron()} returns symbol for small greek letter omicron.
656005`\spad{OMlistCDs()} lists all the \spad{CDs} supported by FriCAS.
656062`\spad{OMlistSymbols(cd)} lists all the symbols in \spad{cd}.
656129`\spad{OMmakeConn}
656192`\spad{OMopenFile(f,{} mode,{} enc)} opens file \spad{f} for reading or writing OpenMath objects (depending on \spad{mode} which can be \spad{"r"},{} \spad{"w"} or "a" for read,{} write and append respectively),{} in the encoding \spad{enc}.
656268`\spad{OMopenString(s,{} mode)} opens the string \spad{s} for reading or writing OpenMath objects in encoding \spad{enc}.
656339`\spad{OMParseError?(u)} tests whether \spad{u} is an OpenMath parsing error.
656398`\spad{OMputApp(dev)} writes a begin application token to \spad{dev}.
656446`\spad{OMputAtp(dev)} writes a begin attribute pair token to \spad{dev}.
656494`\spad{OMputAttr(dev)} writes a begin attribute token to \spad{dev}.
656543`\spad{OMputBind(dev)} writes a begin binder token to \spad{dev}.
656592`\spad{OMputBVar(dev)} writes a begin bound variable list token to \spad{dev}.
656641`\spad{OMputEndApp(dev)} writes an end application token to \spad{dev}.
656692`\spad{OMputEndAtp(dev)} writes an end attribute pair token to \spad{dev}.
656743`\spad{OMputEndAttr(dev)} writes an end attribute token to \spad{dev}.
656795`\spad{OMputEndBind(dev)} writes an end binder token to \spad{dev}.
656847`\spad{OMputEndBVar(dev)} writes an end bound variable list token to \spad{dev}.
656899`\spad{OMputEndError(dev)} writes an end error token to \spad{dev}.
656952`\spad{OMputEndObject(dev)} writes an end object token to \spad{dev}.
657006`\spad{OMputError(dev)} writes a begin error token to \spad{dev}.
657056`\spad{OMputFloat(dev,{} i)} writes the float \spad{i} to \spad{dev}.
657118`\spad{OMputInteger(dev,{} i)} writes the integer \spad{i} to \spad{dev}.
657178`\spad{OMputObject(dev)} writes a begin object token to \spad{dev}.
657229`\spad{OMputString(dev,{} i)} writes the string \spad{i} to \spad{dev}.
657287`\spad{OMputSymbol(dev,{} cd,{} s)} writes the symbol \spad{s} from \spad{CD} \spad{cd} to \spad{dev}.
657352`\spad{OMputVariable(dev,{} i)} writes the variable \spad{i} to \spad{dev}.
657412`\spad{OMread(dev)} reads an OpenMath object from \spad{dev} and passes it to FriCAS.
657471`\spad{OMReadError?(u)} tests whether \spad{u} is an OpenMath read error.
657529`\spad{OMreadFile(f)} reads an OpenMath object from \spad{f} and passes it to FriCAS.
657584`\spad{OMreadStr(f)} reads an OpenMath object from \spad{f} and passes it to FriCAS.
657638`\spad{OMreceive(c)} reads an OpenMath object from connection \spad{c} and returns the appropriate FriCAS object.
657710`\spad{OMsend(c,{} u)} attempts to output \spad{u} on \spad{c} in OpenMath.
657784`\spad{OMserve(portnum,{} timeout)} puts FriCAS into server mode on port number \spad{portnum}. The parameter \spad{timeout} specifies the timeout period for the connection.
657864`\spad{OMsetEncoding(dev,{} enc)} sets the encoding used for reading or writing OpenMath objects to or from \spad{dev} to \spad{enc}.
657934`\spad{OMsupportsCD?(cd)} returns \spad{true} if FriCAS supports \spad{cd},{} \spad{false} otherwise.
657996`\spad{OMsupportsSymbol?(s,{} cd)} returns \spad{true} if FriCAS supports symbol \spad{s} from \spad{CD} \spad{cd},{} \spad{false} otherwise.
658069`\spad{OMunhandledSymbol(s,{} cd)} raises an error if FriCAS reads a symbol which it is unable to handle. Note that this is different from an unexpected symbol.
658139`\spad{OMUnknownCD?(u)} tests whether \spad{u} is an OpenMath unknown \spad{CD} error.
658197`\spad{OMUnknownSymbol?(u)} tests whether \spad{u} is an OpenMath unknown symbol error.
658366`\spad{OMwrite(u)} returns the OpenMath \spad{XML} encoding of \spad{u} as a complete OpenMath object.
658514`\spad{OMwrite(u,{} true)} returns the OpenMath \spad{XML} encoding of \spad{u} as a complete OpenMath object; OMwrite(\spad{u},{} \spad{false}) returns the OpenMath \spad{XML} encoding of \spad{u} as an OpenMath fragment.
658716`\spad{OMwrite(dev,{} u)} writes the OpenMath form of \spad{u} to the OpenMath device \spad{dev} as a complete OpenMath object.
658835`\spad{OMwrite(dev,{} u,{} true)} writes the OpenMath form of \spad{u} to the OpenMath device \spad{dev} as a complete OpenMath object; OMwrite(\spad{dev},{} \spad{u},{} \spad{false}) writes the object as an OpenMath fragment.
658985`\spad{one?(jv)} checks whether the jet variables \spad{jv} is the special variable 1.
659035`\spad{one returns} whether we need only one solution,{} default being \spad{true}.
659250`\spad{one?(a)} tests whether \spad{a} is the unit 1.
659296`\spad{one(d)} specifies whether we are happy with one solution. This option is expressed in the form \spad{one == d}.
659339`\spad{one?(I)} tests whether the ideal \spad{I} is the unit ideal,{} \spadignore{i.e.} contains 1.
659409`\spad{oneDimensionalArray(l)} creates an array from a list of elements \spad{l}
659479`\spad{oneDimensionalArray(n,{} s)} creates an array from \spad{n} copies of element \spad{s}
659562`generates graph AKA 1-skeleton
659655`generates graph AKA 1-skeleton
659739`\spad{open?(t)} tests whether the given tube plot \spad{t} is open.
659788`\spad{open(s)} returns the file \spad{s} open for input.
659838`\spad{open opens} the file.
659888`\spad{open opens} the keyed access file.
659949`\spad{open(s,{} mode)} returns a file \spad{s} open for operation in the indicated mode: "input" or "output".
660006`\spad{operation(f)} returns the name of the operation represented by \spad{f}.
660336`\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.
660413`\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.
660494`\spad{operator(p)} returns an elementary operator with the same symbol as \spad{p}
660572`\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.
660657`\spad{operator(op)} returns the Liouvillian operator based on \spad{op}
660736`\spad{operator(op)} returns a copy of \spad{op} with the domain-dependent properties appropriate for \%.
660885`\spad{operator(op(a1,{} ...,{} an))} returns the operator op.
660945`\spad{operator(f)} gives operator (head) of form \spad{f}. Valid only when atom?(\spad{f}) is \spad{false}
661009`\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.
661072`\spad{operator(op)} returns a copy of \spad{op} with the domain-dependent properties appropriate for \%.
661146`\spad{operator(f)} makes \spad{f} into an operator with arbitrary arity.
661195`\spad{operator(f,{} n)} makes \spad{f} into an \spad{n}-ary operator.
661263`\spad{operatorHandlers()} returns an internal data structure that is used for the selection of respective handlers.
661372`\spad{operatorHandlers()} returns an internal data structure that is used for the selection of respective handlers.
661543`\spad{operators(f)} returns all the basic operators appearing in \spad{f},{} no matter what their levels are.
661661`\spad{opeval should} be local but conditional
661760`\spad{opposite(s)} constructs the opposite in the category theory sense of reversing all the arrows.
661902`\spad{opposite?(x,{}y)} holds if the sum of \spad{x} and \spad{y} is \spad{0}.
661955`\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.
662045`\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.
662104`\spad{option()} is not to be used at the top level; option determines internally which drawing options are indicated in a draw command.
662174`\spad{option(l,{} option)} returns which options are given.
662245`\spad{optional?(p)} tests if \spad{p} is a single matching variable which can match an identity.
662293`\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.
662352`\spad{optional(x)} tells the pattern matcher that \spad{x} can match an identity (0 in a sum,{} 1 in a product or exponentiation).
662428`\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}.
662495`\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}.
662564`\spad{options(v,{} lopt)} takes the given two-dimensional viewport,{} \spad{v},{} of the domain \spadtype{TwoDimensionalViewport} and returns \spad{v} with it\spad{'s} draw options modified to be those which are indicated in the given list,{} \spad{lopt} of domain \spadtype{DrawOption}.
662633`\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}.
662704`\spad{optpair(l)} returns \spad{l} has the form \spad{[a,{} b]} and a is optional,{} and "failed" otherwise.
662772`if this is a compound op then opType returns the type of that op: "IMPLY"::Symbol =implies "AND"::Symbol=/\ "OR"::Symbol=\spad{\/} "NOT"::Symbol=~ "OTHER"::Symbol=not compound op
662812`if this is a compound op then opType returns the type of that op: "IMPLY"::Symbol =implies "AND"::Symbol=/\ "OR"::Symbol=\spad{\/} "NOT"::Symbol=~ "OTHER"::Symbol=not compound op
662864`if this is a compound op then opType returns the type of that op: "IMPLY"::Symbol =implies "AND"::Symbol=/\ "OR"::Symbol=\spad{\/} "NOT"::Symbol=~ "OTHER"::Symbol=not compound op
662916`\spad{Or(n,{} m)} returns the bit-by-bit logical {\em Or} of \spad{n} and \spad{m}.
662958`\spad{f or g} creates the equivalent infix form.
662995`\spad{OR(x,{} y)} returns the \spadtype{Switch} expression representing \spad{x or y}.
663200`\spad{a or b} returns the logical {\em or} of bit aggregates \spad{a} and \spad{b}.
663239`\spad{a or b} returns the logical inclusive {\em or} of Boolean \spad{a} and \spad{b}.
663273`\spad{Or(n,{} m)} returns the bit-by-bit logical {\em or} of the single integers \spad{n} and \spad{m}.
663313`\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.
663379`\spad{orbit(gp,{} els)} returns the orbit of the unordered set {\em els} under the group {\em gp}.
663443`\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}.
663500`\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}.
663554`\spad{orbits(gp)} returns the orbits of the group {\em gp},{} \spadignore{i.e.} it partitions the (finite) of all moved points.
663612`\spad{ord(c)} provides an integral code corresponding to the character \spad{c}. It is always \spad{true} that \spad{char ord c = c}.
663735`\spad{order(f)} \undocumented
663875`\spad{order(x)} \undocumented
663973`\spad{order(fd)} returns order of divisor \spad{fd} or \spad{"failed"} if \spad{fd} is not of finite order.
664094`\spad{order(x)} computes the order of the element \$\spad{x}\$.
664139`\spad{order(x)} \undocumented
664196`number of vertices
664254`\spad{order(jv)} yields the order of the jet variable \spad{jv} (Order as derivative).
664316`\spad{order(f)} gives highest order of the jet variables effectively occurring in \spad{f}.
664390`\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.}
664458`\spad{order(de)} yields the order of the differential equation \spad{de}.
664849`\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.
664922`\spad{order x} is the order of magnitude of \spad{x}. Note: \spad{base ^ order x <= |x| < base ^ (1 + order x)}.
664975`\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}.
665059`\spad{order(v)} returns \spad{n} if \spad{v} is the \spad{n}-th derivative of any differential indeterminate.
665135`\spad{order(x)} returns the exponent of the highest power of \spad{p} dividing \spad{x}.
665203`\spad{order(gp)} returns the order of the group {\em gp}.
665267`\spad{order(p)} returns the order of a permutation \spad{p} as a group element.
665326`\spad{order(a)} computes the order of an element in the multiplicative group of the field. Error: if \spad{a} is 0.
665414`\spad{order(b)} computes the order of an element \spad{b} in the multiplicative group of the field. Error: if \spad{b} equals 0.
665559`\spad{order(x,{} n)} returns the minimum of \spad{n} and the order of \spad{x}.
665722`\spad{order(f,{} n) = min(m,{} n)},{} where \spad{m} is the degree of the lowest order non-zero term in \spad{f}.
665801`\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}.
665900`\spad{order(p,{} s)} returns the order of the differential polynomial \spad{p} in differential indeterminate \spad{s}.
665986`\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.
666077`\spad{order(f,{} u,{} g)} \undocumented
666193`\spad{order(f,{} x,{} n)} returns \spad{min(n,{} order(f,{} x))}.
666303`\spad{orderDim(sys,{} jm,{} q)} computes the dimension of the manifold described by the system \spad{sys} with Jacobi matrix \spad{jm} in the jet bundle of order \spad{q} over the jet bundle of order \spad{q-1}.
666557`\spad{ordinalAdd(o1,{} o2)} returns sum of \spad{o1} and \spad{o2} as ordered sets
666604`\spad{ordinalMul(o1,{} o2)} returns product of \spad{o1} and \spad{o2} as ordered sets
666651`\spad{ordinalPower(o1,{} o2)} returns \spad{o1} to power \spad{o2},{} where power is inductively defined using successive ordinal multiplication from the left
666700`Constructor for oriented facet oriented facet is always stored in vertex order orientation is calculated by the number of edges that have to be flipped to put it in order.
666780`Copy constructor which can change mul
666849`Constructor for oriented face from its boundary. This is like filling-in the boundary,{} in that sense it is the inverse of 'boundary'. May fail,{} for instance in 'implied' loops,{} where both ends of an edge are the same point. Also similar cases for higher order facets.
666925`Constructor for oriented face which removes duplicates If the face is positive then we expect the sequence to be: + - + - ...
666992`Constructor for oriented face which removes duplicates and ignores orientation
667061`\spad{orthogonalConvolution(x,{} y)} returns the orthogonal convolution of the distributions \spad{x} and \spad{y}
667130`\spad{orthogonalPolynomials(x)} returns the stream of orthogonal polynomials.
667287`\spad{orthogonalPolynomials(x)} returns the stream of orthogonal polynomials.
667402`\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.
667682`\spad{outDegree(s,{} a)} gives the number of arrows leading out of node 'a' in graph \spad{'s'}
667824`\spad{outerProduct(u,{} v)} constructs the matrix whose (\spad{i},{} \spad{j})\spad{'}th element is \spad{u}(\spad{i})\spad{*v}(\spad{j}).
667897`\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".
667967`\spad{output(x)} displays the output form \spad{x} on the ``algebra output\spad{''} stream,{} as defined by \spadsys{)set output algebra}.
668021`\spad{output(s)} displays the string \spad{s} on the ``algebra output\spad{''} stream,{} as defined by \spadsys{)set output algebra}.
668071`\spad{output(s,{} x)} displays the string \spad{s} followed by the form \spad{x} on the ``algebra output\spad{''} stream,{} as defined by \spadsys{)set output algebra}.
668132`\spad{outputArgs(s1,{} s2,{} p,{} ts)} is an internal subroutine,{} exported only for development.
668217`\spad{outputAsFortran(u)} translates \spad{u} into a legal FORTRAN subprogram.
668280`\spad{outputAsFortran(l)} sends (for each expression in the list \spad{l}) output in FORTRAN format to the destination defined by \spadsys{)set output fortran}.
668356`\spad{outputAsFortran(o)} sends output \spad{o} in FORTRAN format.
668426`\spad{outputAsFortran(v,{} o)} sends output \spad{v} = \spad{o} in FORTRAN format to the destination defined by \spadsys{)set output fortran}.
668503`\spad{outputAsMathML(l)} sends (for each expression in the list \spad{l}) output in MathML format to the destination as defined by \spadsys{)set output mathml}.
668578`\spad{outputAsMathML(o)} sends output \spad{o} in MathML format to the destination as defined by \spadsys{)set output mathml}.
668647`\spad{outputAsTex(l)} sends (for each expression in the list \spad{l}) output in Tex format to the destination as defined by \spadsys{)set output tex}.
668719`\spad{outputAsTex(o)} sends output \spad{o} in Tex format to the destination defined by \spadsys{)set output tex}.
668785`\spad{outputFixed()} sets the output mode to fixed point notation; the output will contain a decimal point.
668826`\spad{outputFixed(n)} sets the output mode to fixed point notation,{} with \spad{n} digits displayed after the decimal point.
668885`\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}.
668929`\spad{outputFloating(n)} sets the output mode to floating (scientific) notation with \spad{n} significant digits displayed after the decimal point.
668991`\spad{outputForm(n)} creates a form for an integer.
669040`\spad{outputForm(s)} creates a form for a string.
669088`\spad{outputForm(s)} creates a form for a symbol.
669136`\spad{outputForm(p,{} var)} converts the SparseUnivariatePolynomial \spad{p} to an output form (see \spadtype{OutputForm}) printed as a polynomial in the output form \spad{var}.
669218`\spad{outputForm(p,{} x)} returns the output form of \spad{p} using \spad{x} for the otherwise anonymous variable.
669316`\spad{outputForm(l,{} fop,{} fexp,{} unit)} converts the monoid element represented by \spad{l} to an \spadtype{OutputForm}. Argument unit is the output form for the \spadignore{unit} of the monoid (\spadignore{e.g.} 0 or 1),{} \spad{fop(a,{} b)} is the output form for the monoid operation applied to \spad{a} and \spad{b} (\spadignore{e.g.} \spad{a + b},{} \spad{a * b},{} \spad{ab}),{} and \spad{fexp(a,{} n)} is the output form for the exponentiation operation applied to \spad{a} and \spad{n} (\spadignore{e.g.} \spad{n a},{} \spad{n * a},{} \spad{a ^ n},{} \spad{a\^n}).
669459`\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.
669502`\spad{outputGeneral(n)} sets the output mode to general notation with \spad{n} significant digits displayed.
669563`\spad{outputList(l)} displays the concatenated components of the list \spad{l} on the ``algebra output\spad{''} stream,{} as defined by \spadsys{)set output algebra}; quotes are stripped from strings.
669620`\spad{outputSpacing(n)} inserts an underscore after \spad{n} (default 10) digits on output; outputSpacing(0) means no underscores are inserted. Returns old setting.
669695`\spad{outputVRML(rp,{} f1)} writes the attribute as \spad{VRML2}. \spad{VRML2} is not \spad{xml} but it has the same semantics and node names as \spad{X3D} but a different syntax so it makes sense to create an \spad{XML} structure and then format the output differently.
669752`\spad{outputVRML(rp,{} f1)} writes the element as \spad{VRML2}. \spad{VRML2} is not \spad{xml} but it has the same semantics and node names as \spad{X3D} but a different syntax so it makes sense to create an \spad{XML} structure and then format the output differently.
669807`\spad{over(f,{} g)} creates a form for the vertical fraction of \spad{f} over \spad{g}.
669846`\spad{overbar(f)} creates the form \spad{f} with an overbar.
669886`\spad{overbar(p,{} hh)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats arguments via \spad{hh(p,{} args)} and then draws a bar over the resulting box. Outer parentheses are added if \spad{p < prec}.
670013`\spad{overlabel(x,{}f)} creates the form \spad{f} with \spad{"x} overbar" over the top.
670057`\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]}.
670123`\spad{overset?(s,{} sl)} returns \spad{true} if \spad{s} properly a sublist of a member of \spad{sl}; otherwise it returns \spad{false}
670223`\spad{P(ind)} generates the derivative of the only dependent variable \spad{wrt} the index \spad{ind}.
670573`\spad{P(i)} generates the \spad{i}\spad{-}th derivative of the only dependent variable \spad{wrt} the only independent variable.
670893`\spad{P(i,{} ind)} generates the derivative of the \spad{i}\spad{-}th dependent variable \spad{wrt} the index \spad{ind}. Whether \spad{ind} is interpreted as multi-index or as repeated index depends on the chosen notation.
671323`\spad{P(i,{} j)} generates the \spad{j}\spad{-}th derivative of the \spad{i}\spad{-}th independent variable \spad{wrt} the only independent variable.
671723`\spad{pack!(f)} reorganizes the file \spad{f} on disk to recover unused space.
671773`\spad{pack!(f)} reorganizes the file \spad{f} on disk to recover unused space.
671808`\spad{packageCall(f)} returns the input form corresponding to \spad{f}\$\spad{R}.
671877`\spad{packageCall(f,{} l)} returns the input form corresponding to \spad{f}(\spad{l}.1,{} \spad{l}.2,{} ...)\$\spad{R}.
671962`\spad{pack_exps0(exps,{} sizes,{} ns,{} start)} is used by pack_exps.
672072`\spad{pack_exps(d,{} s,{} m)} produces vector of exponents up to degree \spad{d}. \spad{s} is size (degree) of algebraic extension. Use together with \spad{repack1}.
672180`\spad{pack_modulus(lp,{} ls,{} p)} converts \spad{lp},{} \spad{ls} and prime \spad{p} which together describe algebraic extension to packed representation.
672300`\spad{pad(t,{} b,{} l,{} r)(box)} returns a new box that is padded by \spad{t} empty lines at the top,{} \spad{b} empty lines at the bottom,{} \spad{l} space characters at the left,{} \spad{r} space characters at the right. If \spad{w},{} \spad{h},{} \spad{d} are the width,{} height and depth of box then the resulting box will have width l+w+r and height \spad{t+h} and depth \spad{d+b}.
672414`\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}.
672588`\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).
672709`\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).
672914`\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).
673046`\spad{padicallyExpand(p,{} x)} is a utility function that expands the second argument \spad{x} \spad{``p}-adically\spad{''} in the first.
673132`\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.
673186`\spad{pair?(s)} is \spad{true} if \spad{s} has is a non-null Lisp list.
673256`\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)}.
673385`\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{x = eval(t,{} z,{} ry)} and \spad{c = d/dz t}; \spad{r} is rational function of \spad{x},{} \spad{c} and \spad{t} are rational functions of \spad{z}. Argument \spad{z} is a dummy variable not appearing in \spad{f(x,{} y)}.
673536`\spad{palgint(f,{} x,{} y)} returns the integral of \spad{f(x,{} y)dx} where \spad{y} is an algebraic function of \spad{x}.
673636`\spad{palgintegrate(f,{} x,{} d)} integrates \spad{f} with respect to the derivation \spad{d}. Argument \spad{f} must be a pure algebraic function.
673762`\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)}.
673976`\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{x = eval(t,{} z,{} ry)} and \spad{c = d/dz t}; \spad{r} is rational function of \spad{x},{} \spad{c} and \spad{t} are rational functions of \spad{z}.
674212`\spad{palgLODE(op,{} g,{} kx,{} y,{} x)} returns the solution of \spad{op f = g}. \spad{y} is an algebraic function of \spad{x}.
674404`\spad{palgRDE0(f,{} g,{} x,{} y,{} foo,{} d,{} p)} returns a function \spad{z(x,{} y)} such that \spad{dz/dx + n * df/dx z(x,{} y) = g(x,{} y)} if such a \spad{z} exists,{} and "failed" otherwise. Argument \spad{y} is an algebraic function of \spad{x} satisfying \spad{d(x)\^2y(x)\^2 = P(x)}. Argument \spad{foo},{} called by \spad{foo(a,{} b,{} x)},{} is a function that solves \spad{du/dx + n * da/dx u(x) = u(x)} for an unknown \spad{u(x)} not involving \spad{y}.
674564`\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{x = eval(t,{} z,{} ry)} and \spad{c = d/dz t}; \spad{r} is rational function of \spad{x},{} \spad{c} and \spad{t} are rational functions of \spad{z}. 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}.
674746`\spad{palgRDE(nfp,{} f,{} g,{} x,{} y,{} foo)} returns a function \spad{z(x,{} y)} such that \spad{dz/dx + n * df/dx z(x,{} y) = g(x,{} y)} if such a \spad{z} exists,{} "failed" otherwise; \spad{y} is an algebraic function of \spad{x}; \spad{foo(a,{} b,{} x)} is a function that solves \spad{du/dx + n * da/dx u(x) = u(x)} for an unknown \spad{u(x)} not involving \spad{y}. \spad{nfp} is \spad{n * df/dx}.
674879`\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}.
674945`\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}.
675022`\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)}.
675091`\spad{parallel(x,{} y)} returns the length of the parallel component of two vectors. In the case of Euclidean space this is the dot product of two vectors. We use this function to test the colinearity
675148`\spad{parametersOf(tab)} returns a list of all the symbols declared in \spad{tab}
675205`\spad{parametric? determines} whether it is a parametric plot?
675249`\spad{param_LODE(eq,{} lg,{} x,{} y)}
675419`\spad{param_rde2(fp,{} lg,{} x,{} lk,{} ext,{} logi)} finds basis of solution to the equation dy/dx + \spad{fp} \spad{y} + \spad{c1} \spad{g1} + ... \spad{cn} \spad{gn} = 0 where \spad{y} is in field generated by \spad{lk} and \spad{ci} are constants.
675701`\spad{param_RDE(fp,{} lg,{} x,{} y)}
675864`\spad{param_rde(n,{} f,{} lg,{} x,{} lk,{} ext,{} logi)} finds basis of solution to the equation dy/dx + \spad{n} df/dx \spad{y} + \spad{c1} \spad{g1} + ... \spad{cn} \spad{gn} = 0 where \spad{y} is in field generated by \spad{lk} and \spad{ci} are constants.
676153`\spad{param_rde(n,{} f,{} h,{} lg,{} x,{} lk,{} ext,{} logi)} finds a particular solution and basis of solutions to homogeneous equation for equation dy/dx + \spad{n} df/dx \spad{y} + \spad{c1} \spad{g1} + ... \spad{cn} \spad{gn} = \spad{h} where \spad{y} is in field generated by \spad{lk} and \spad{ci} are constants.
676520`\spad{ParCond(m,{} k)} returns the list of all \spad{k} by \spad{k} subdeterminants in the matrix \spad{m}
676676`\spad{ParCondList(c,{} r)} computes a list of subdeterminants of each rank \spad{>=} \spad{r} of the matrix \spad{c} and returns a groebner basis for the ideal they generate
676892`\spad{paren(f)} creates the form enclosing \spad{f} in parentheses.
676930`\spad{paren(lf)} creates the form separating the elements of \spad{lf} by commas and encloses the result in parentheses.
677019`\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)).
677066`\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.
677108`\spad{parenthesize(lb,{} rb,{} bx)} returns the box \spad{bx} with left and right brackets (\spad{lb} and \spad{rb}) around it.
677190`\spad{parenthesizeIf(paren?,{} bx)} returns parentheses (of appropriate size if \spad{paren?} is \spad{true}. Otherwise,{} \spad{bx} is returned.
677268`\spad{parenthesizeIf(paren?,{} bx)} returns parentheses (of appropriate size if \spad{paren?} is \spad{true}. Otherwise,{} \spad{bx} is returned.
677350`\spad{parse(s)} is the inverse of unparse. It parses a string to InputForm
677392`Constructs intuitionistic logic terms from a string notation assumes format like this: <term> : \spad{:=} var | <term>/\spad{\<}term> | <term>\spad{\/}<term> | \indented{11}{<term>-><term> | "("<term>")"}
677433`Constructs intuitionistic logic terms from a string notation assumes format like this: <term2> : \spad{:=} var | "("<term>")" <term> : \spad{:=} var | <term>/\spad{\<}term> | <term>\spad{\/}<term> | \indented{11}{<term>-><term> | "("<term>")"}
677530`parseTerm is used by parseIL. It would rarely be called externally but it is here to allow it to call parseIL that is to allow circular calls
677630`\spad{parse_integer(s)} converts string of digits \spad{s} into integer
677694`Constructs nested lambda terms from a string notation assumes format like this: <term> : \spad{:=} "\spad{\"} var "."<term> | \spad{n} | <term><term> | "("<term>")" where: \\ = lambda (\spad{I} would like to use unicode lambda symbol but \indented{12}{\spad{I} would also like to keep maximum compatibility} \indented{12}{with non-unicode versions of Lisp)} \spad{n} = De Bruijn index which is a integer where,{} 1=inside inner \indented{12}{lambda term,{} 2= next outer lambda term,{} 3= next} \indented{12}{outer and so on.} brackets can be used around whole terms.
677743`Constructs combinators from a string
677797`parseTerm is used by parseLambda. It would rarely be called externally but it is here to allow it to call parseLambda that is to allow circular calls
677899`parseTerm is used by parseSki. It would rarely be called externally but it is here to allow it to call parseSki that is to allow circular calls
678009`construct a variable by parsing a string
678051`construct a variable by parsing a string pin is index to string at start of parse pout is index to string at end of parse
678152`\spad{partial()} returns symbol for partial derivative.
678205`\spad{partialDenominators(x)} extracts the denominators in \spad{x}. That is,{} if \spad{x = continuedFraction(b0,{} [a1,{} a2,{} a3,{} ...],{} [b1,{} b2,{} b3,{} ...])},{} then \spad{partialDenominators(x) = [b1,{} b2,{} b3,{} ...]}.
678275`\spad{partialFraction(f)} is a user friendly interface for partial fractions when \spad{f} is a fraction of UniqueFactorizationDomain.
678373`\spad{partialFraction(rf,{} var)} returns the partial fraction decomposition of the rational function \spad{rf} with respect to the variable var.
678467`\spad{partialFraction(numer,{} denom)} is the main function for constructing partial fractions. The second argument is the denominator and should be factored.
678535`\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.
678643`\spad{partialNumerators(x)} extracts the numerators in \spad{x}. That is,{} if \spad{x = continuedFraction(b0,{} [a1,{} a2,{} a3,{} ...],{} [b1,{} b2,{} b3,{} ...])},{} then \spad{partialNumerators(x) = [a1,{} a2,{} a3,{} ...]}.
678711`\spad{partialQuotients(x)} extracts the partial quotients in \spad{x}. That is,{} if \spad{x = continuedFraction(b0,{} [a1,{} a2,{} a3,{} ...],{} [b1,{} b2,{} b3,{} ...])},{} then \spad{partialQuotients(x) = [b0,{} b1,{} b2,{} b3,{} ...]}.
678778`\spad{particularSolution(u)} \undocumented
678854`\spad{particularSolution([v1,{} ...,{} vn],{} u)} returns \spad{[c1,{} ...,{} cn]} such that \spad{c1*v1 + ... + cn*vn = u},{} "failed" if no such \spad{ci}\spad{'s} exist in the quotient field of \spad{S}.
678985`\spad{particularSolution([v1,{} ...,{} vn],{} u)} returns \spad{[c1,{} ...,{} cn]} such that \spad{c1*v1 + ... + cn*vn = u},{} "failed" if no such \spad{ci}\spad{'s} exist in \spad{S}.
679101`\spad{particularSolution([v1,{} ...,{} vn],{} u)} returns \spad{[c1,{} ...,{} cn]} such that \spad{c1*v1 + ... + cn*vn = u},{} "failed" if no such \spad{ci}\spad{'s} exist in the quotient field of \spad{S}.
679224`\spad{particularSolution([v1,{} ...,{} vn],{} u)} returns \spad{[c1,{} ...,{} cn]} such that \spad{c1*v1 + ... + cn*vn = u},{} "failed" if no such \spad{ci}\spad{'s} exist in \spad{S}.
679332`\spad{particularSolution(A,{} B)} finds a particular solution of the linear system \spad{AX = B}.
679444`\spad{particularSolution(A,{} B)} finds a particular solution of the linear system \spad{AX = B}.
679545`\spad{particularSolution(op,{} g,{} [f1,{} ...,{} fm],{} I)} returns a particular solution \spad{h} of the equation \spad{op y = g} where \spad{[f1,{} ...,{} fm]} are linearly independent and \spad{op(\spad{fi})=0}. The value "failed" is returned if no particular solution is found. Note: the method of variations of parameters is used.
679638`\spad{solveLinearlyOverConstants([v1,{} ...,{} vn],{} u,{} ld)} returns \spad{[c1,{} ...,{} cn]} such that \spad{c1*v1 + ... + cn*vn = u},{} "failed" if no such rational numbers \spad{ci}\spad{'s} exist.
679776`\spad{particularSolutionOverConstants([v1,{} ...,{} vn],{} u,{} ld)} returns \spad{[c1,{} ...,{} cn]} such that \spad{c1*v1 + ... + cn*vn = u},{} "failed" if no such constants numbers \spad{ci}\spad{'s} exist.
679906`\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}\spad{'s} exist.
680036`\spad{particularSolutionOverQ([v1,{} ...,{} vn],{} u)} returns \spad{[c1,{} ...,{} cn]} such that \spad{c1*v1 + ... + cn*vn = u},{} "failed" if no such rational numbers \spad{ci}\spad{'s} exist.
680158`\spad{partition(\spad{li})} converts a list of integers \spad{li} to a partition
680211`\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.
680274`\spad{partitions(n)} is the stream of all partitions of \spad{n}.
680358`\spad{partitions(p,{} l)} is the stream of all \indented{1}{partitions whose number of} \indented{1}{parts and largest part are no greater than \spad{p} and \spad{l}.}
680450`\spad{partitions(p,{} l,{} n)} is the stream of partitions \indented{1}{of \spad{n} whose number of parts is no greater than \spad{p}} \indented{1}{and whose largest part is no greater than \spad{l}.}
680880`\spad{parts(m)} returns a list of the elements of \spad{m} in row major order
680952`\spad{parts(u)} returns a list of the consecutive elements of \spad{u}. For finite collections,{} \spad{construct(parts(u)) = u}.
681031`\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.
681116`\spad{pastel(c)} sets the shade of a hue,{} \spad{c},{} above bright,{} but below light.
681156`\spad{pa_to_sup(v)} converts vector of coefficients to a polynomial
681262`\spad{pa_to_sup(v)} converts vector of coefficients to a polynomial
681386`\spad{pa_to_sup(v)} converts vector of coefficients to a polynomial
681489`\spad{pattern(r)} returns the pattern corresponding to the left hand side of the rule \spad{r}.
681810`\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}.
681929`\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.
682089`\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.
682213`\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.
682357`\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.
682480`\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.
682616`\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.
682775`\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.
683670`\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).
683798`\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.
683909`\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.
684106`\spad{patternMatch(lsubj,{} lpat,{} op,{} res,{} match)} matches the list of patterns \spad{lpat} to the list of subjects \spad{lsubj},{} allowing for commutativity; \spad{op} is the operator such that \spad{op}(\spad{lpat}) should match \spad{op}(\spad{lsubj}) at the end,{} \spad{r} contains the previous matches,{} and match is a pattern-matching function on \spad{P}.
684311`\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}.
684508`\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}.
684585`\spad{pdct(a1^n1 a2^n2 ...)} returns \spad{n1! * a1^n1 * n2! * a2^n2 * ...}. This function is used in the package \spadtype{CycleIndicators}.
684627`\spad{pencil(f)} returns a pointer to the underlying pencil.
684714`\spad{perfectNthPower?(n,{} r)} returns \spad{true} if \spad{n} is an \spad{r}th power and \spad{false} otherwise
684793`\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
684886`\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
684973`\spad{perfectSqrt(n)} returns the square root of \spad{n} if \spad{n} is a perfect square and returns "failed" otherwise
685038`\spad{perfectSquare?(n)} returns \spad{true} if \spad{n} is a perfect square and \spad{false} otherwise
685096`\spad{permanent(x)} computes the permanent of a square matrix \spad{x}. The {\em permanent} is equivalent to the \spadfun{determinant} except that coefficients have no change of sign. This function is much more difficult to compute than the {\em determinant}. The formula used is by \spad{H}.\spad{J}. Ryser,{} improved by [Nijenhuis and Wilf,{} \spad{Ch}. 19]. Note: permanent(\spad{x}) choose one of three algorithms,{} depending on the underlying ring \spad{R} and on \spad{n},{} the number of rows (and columns) of \spad{x:} \begin{items} \item 1. if 2 has an inverse in \spad{R} we can use the algorithm of \indented{3}{[Nijenhuis and Wilf,{} \spad{ch}.19,{} \spad{p}.158]; if 2 has no inverse,{}} \indented{3}{some modifications are necessary:} \item 2. if {\em n > 6} and \spad{R} is an integral domain with characteristic \indented{3}{different from 2 (the algorithm works if and only 2 is not a} \indented{3}{zero-divisor of \spad{R} and {\em characteristic()\$R ~= 2},{}} \indented{3}{but how to check that for any given \spad{R} ?),{}} \indented{3}{the local function {\em permanent2} is called;} \item 3. else,{} the local function {\em permanent3} is called \indented{3}{(works for all commutative rings \spad{R}).} \end{items}
685158`\spad{perm_to_vec(supp,{} p,{} degree)} should be local but conditional
685276`\spad{permutation(n,{} r)} returns the number of permutations of \spad{n} objects taken \spad{r} at a time,{} \spadignore{i.e.} \spad{n!/}(\spad{n}-\spad{r})!.
685392`\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)!}.
685457`\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.
685524`\spad{permutationGroup(ls)} coerces a list of permutations {\em ls} to the group generated by this list.
685601`\spad{permutationRepresentation(x)} returns the permutation induced by \spad{x} on \spad{enumerate()\$G}
685689`\spad{permutationRepresentation(\spad{pi},{} n)} returns the matrix {\em (deltai,{} \spad{pi}(i))} (Kronecker delta) if the permutation {\em \spad{pi}} is in list notation and permutes {\em {1,{} 2,{} ...,{} n}}.
685788`\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}}.
685899`\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}}.
686025`\spad{permutationRepresentation(\spad{pi},{} n)} returns the matrix {\em (deltai,{} \spad{pi}(i))} (Kronecker delta) for a permutation {\em \spad{pi}} of {\em {1,{} 2,{} ...,{} n}}.
686139`\spad{permutations(n)} is the stream of permutations \indented{1}{formed from \spad{1,{} 2,{} 3,{} ...,{} n}.}
686225`\spad{perpendicular(x,{} y)} returns a vector perpendicular to the two vectors in the case of 3D Euclidean space this is the cross the product of two vectors. We use this function to compute orthogonal
686277`\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}.
686399`\spad{Pfaffian(m)} returns the Pfaffian of the matrix \spad{m}. Error: if the matrix is not antisymmetric.
686477`\spad{Pfaffian(m)} returns the Pfaffian of the matrix \spad{m}. Error: if the matrix is not antisymmetric.
686566`\spad{Phi()} returns symbol for capital greek letter phi.
686615`\spad{phi()} returns symbol for small greek letter phi.
686664`\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.
686717`\spad{physicalLength(x)} returns the number of elements \spad{x} can accommodate before growing
686862`\spad{physicalLength!(x,{} n)} changes the physical length of \spad{x} to be \spad{n} and returns the new array.
686991`\spad{\spad{pi}(x)} represents the NAG Library function X01AAF which returns \indented{1}{an approximation to the value of \spad{pi}}
687067`\spad{\spad{pi}()} returns the \spad{pi} operator
687207`\spad{\spad{Pi}()} returns symbol for capital greek letter \spad{pi}.
687255`\spad{\spad{pi}()} returns symbol for small greek letter \spad{pi}.
687303`\spad{\spad{pi}()} returns the constant \spad{pi}.
687357`\spad{\spad{pi}()} returns the symbolic \%\spad{pi}.
687389`\spad{pile()} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats args according to \spad{hh} and then puts them on top of each other left adjusted. The baseline corresponds to the baseline of the first argument.
687505`\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.
687548`\spad{pivot(A,{} i)} returns the leading entry of the \spad{i}\spad{-}th row of the matrix \spad{A} together with its index.
687630`\spad{pivots(A)} returns all leading entries of the matrix \spad{A} together with their indices.
687794`\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}.
687869`\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} \spad{-1"}. Then a divisor cascade is calculated and the best splitting is chosen,{} as soon as the error is small enough.
687949`\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} \spad{-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 information messages are issued.
688037`\spad{plot(f,{} a..b)} plots the function \spad{f(x)} on the interval \spad{[a,{} b]}.
688114`\spad{plot([f1,{} ...,{} fm],{} a..b)} plots the functions \spad{y = f1(x)},{} ...,{} \spad{y = fm(x)} on the interval \spad{a..b}.
688197`\spad{plot(x,{} r)} \undocumented
688251`\spad{plot(x,{} r)} \undocumented
688303`\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]}.
688407`\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.
688505`\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.
688609`\spad{plot(fcn,{} x,{} seg)} plots the graph of \spad{y = f(x)} on a interval
688684`\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.
688761`\spad{plot(f,{} g,{} h,{} a..b)} plots \spad{x} = \spad{f}(\spad{t}),{} \spad{y} = \spad{g}(\spad{t}),{} \spad{z} = \spad{h}(\spad{t}) as \spad{t} ranges over [a,{} \spad{b}].
688921`\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.
689067`\spad{plot(f1,{} f2,{} f3,{} f4,{} x,{} y,{} z,{} w)} \undocumented
689290`\spad{plotPolar(f)} plots the polar curve \spad{r = f(theta)} as theta ranges over the interval \spad{[0,{} 2*\%\spad{pi}]}; this is the same as the parametric curve \spad{x = f(t) * cos(t)},{} \spad{y = f(t) * sin(t)}.
689351`\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)}.
689433`\spad{plotPolar(f,{} theta)} plots the graph of \spad{r = f(theta)} as theta ranges from 0 to 2 \spad{pi}
689492`\spad{plotPolar(f,{} theta,{} seg)} plots the graph of \spad{r = f(theta)} as \spad{theta} ranges over an interval
689572`\spad{plus(x,{} y)} adds two matrices,{} term by term we note that they must be the same size
689637`\spad{plus(x,{} y)} computes \spad{x + y} with no rounding.
689809`\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.
689908`\spad{plus(x,{} y,{} b)} computes approximation to \spad{x + y} accurate to at least \spad{b} bits.
690097`\spad{plusInfinity()} returns +infinity.
690151`\spad{plusInfinity()} returns plusInfinity.
690218`\spad{Pm(i,{} ind)} is like \spad{P(i,{} ind)} but \spad{ind} is always a multi-index.
690299`\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.
690533`\spad{Pnan?(p)} returns \spad{true} if any of its elements are not valid DoubleFloat values. Examples of invalid floating point numbers are when we have divided a given element by zero or taken sqrt of negative number at some stage? Note: we can still represent a point at infinity and we can represent points using complex numbers,{} but we do this using projective or conformal space or by using the appropriate instance of SPointCategory,{} not by using invalid floating point numbers.
690581`\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.
690637`\spad{point(l)} returns a point category defined by a list \spad{l} of elements from the domain \spad{R}.
690687`\spad{point(p)} returns a \spadtype{ThreeSpace} object which is composed of one component,{} the point \spad{p}.
690743`\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.
690799`\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.
690856`\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}.
690924`\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.
690982`\spad{point(\spad{gi},{} pt,{} pal)} modifies the graph \spad{\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}.
691050`\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.
691154`\spad{pointColor(v)} specifies a color,{} \spad{v},{} for 2D graph points. This option is expressed in the form \spad{pointColor == v}.
691201`\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}.
691250`\spad{pointColorDefault()} returns the default color of points in a 2D viewport.
691314`\spad{pointColorDefault(p)} sets the default color of points in a 2D viewport to the palette \spad{p}.
691385`\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.
691474`\spad{pointData(s)} returns the list of points from the point data field of the 3 dimensional subspace \spad{s}.
691532`\spad{pointList(me)} returns points at vertices of this mesh.
691583`\spad{pointList(gp)} should be local but conditional
691640`\spad{pointLists(\spad{gi})} returns the list of lists of points which compose the given graph,{} \spad{\spad{gi}},{} of the domain \spadtype{GraphImage}.
691712`\spad{pointPlot(f,{} g,{} h,{} a..b)} plots \spad{x} = \spad{f}(\spad{t}),{} \spad{y} = \spad{g}(\spad{t}),{} \spad{z} = \spad{h}(\spad{t}) as \spad{t} ranges over [a,{} \spad{b}].
691803`\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]}.
691892`\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.
692023`\spad{pointPlot(f,{} x,{} y,{} z,{} w)} \undocumented
692177`\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".
692254`\spad{pointSizeDefault()} returns the default size of the points in a 2D viewport.
692325`\spad{pointSizeDefault(i)} sets the default size of the points in a 2D viewport to \spad{i}.
692411`\spad{poisson(f)} \undocumented
692493`\spad{poissonDistribution(a)} produces a Poisson distribution of variance \spad{a}.
692571`\spad{pol(v)} turns the vector \spad{[v0,{} ...,{} vn]} into the polynomial \spad{v0+v1*x+ ... + vn*x^n}.
692669`\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)}.
692802`\spad{polarCoordinates(x)} returns (\spad{r},{} phi) such that \spad{x} = \spad{r} * exp(\%\spad{i} * phi).
692941`\spad{polCase(contprod,{} numFacts,{} evallcs)},{} where \spad{contprod} is the product of the content of the leading coefficient of the polynomial to be factored with the content of the evaluated polynomial,{} \spad{numFacts} is the number of factors of the leadingCoefficient,{} and evallcs is the list of the evaluated factors of the leadingCoefficient,{} returns \spad{true} if the factors of the leading Coefficient can be distributed with this valuation.
693038`\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.}
693095`\spad{pole?(f)} determines if the power series \spad{f} has a pole.
693164`\spad{PollardSmallFactor(n)} returns a factor of \spad{n} or "failed" if no one is found
693251`\spad{poly_factor(p)} should be local but conditional.
693462`\spad{polygamma(x,{} y)} returns the polygamma function applied to \spad{x} and \spad{y}.
693526`\spad{polygamma(k,{} x)} is the \spad{k-th} derivative of \spad{digamma(x)},{} (often written \spad{psi(k,{} x)} in the literature).
693789`\spad{polygon?(s)} returns \spad{true} if the \spadtype{ThreeSpace} \spad{s} contains a single polygon component,{} or \spad{false} otherwise.
693847`\spad{polygon([p0,{} p1,{} ...,{} pn])} creates a polygon defined by a list of points,{} \spad{p0} through \spad{pn},{} and returns a \spadtype{ThreeSpace} whose component is the polygon.
693911`\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.
693975`\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.
694040`\spad{polygon(s,{} [p0,{} p1,{} ...,{} pn])} adds a polygon component defined by a list of points,{} \spad{p0} through \spad{pn},{} to the \spadtype{ThreeSpace} \spad{s}.
694106`\spad{poly_int(f,{} k,{} x)} generates polylogarithms.
694382`\spad{polylog(s,{} x)} is the polylogarithm of order \spad{s} at \spad{x}.
694444`\spad{polylog(s,{} x)} is the polylogarithm of order \spad{s} at \spad{x}.
694499`\spad{polylog_int(f,{} x,{} k0,{} [k1,{} ...,{} kn],{} g)}
694660`\spad{polynomial?(f)} is the ALS in polynomial form?
694726`\spad{polynomial(f)} returns \spad{f} as XDPOLY (if possible)
694813`\spad{polynomial(f,{} k)} returns a polynomial consisting of the sum of all terms of \spad{f} of degree \spad{<= k}.
694922`\spad{polynomial(f,{} k)} returns a polynomial consisting of the sum of all terms of \spad{f} of degree \spad{<= k}.
695025`\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}.
695153`\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}.
695275`\spad{polyPart(f)} returns the polynomial part of \spad{f}.
695341`\spad{polyred(u)} \undocumented
695410`\spad{polyRicDE(op,{} zeros)} returns \spad{[[p1,{} L1],{} [p2,{} L2],{} ... ,{} [pk,{} Lk]]} such that the polynomial part of any rational solution of the associated Riccati equation of \spad{op y = 0} must be one of the \spad{pi}\spad{'s} (up to the constant coefficient),{} in which case the equation for \spad{z = y e^{-int p}} is \spad{\spad{Li} z = 0}. \spad{zeros} is a zero finder in \spad{UP}.
695602`\spad{polyRicDE(op,{} zeros)} returns \spad{[[p1,{} L1],{} [p2,{} L2],{} ... ,{} [pk,{} Lk]]} such that the polynomial part of any rational solution of the associated Riccati equation of \spad{op y=0} must be one of the \spad{pi}\spad{'s} (up to the constant coefficient),{} in which case the equation for \spad{z=y e^{-int p}} is \spad{\spad{Li} z =0}. \spad{zeros} is a zero finder in \spad{UP}.
695763`\spad{pomopo!(p1,{} r,{} e,{} p2)} returns \spad{p1 + monomial(r,{} e) * p2} and may use \spad{p1} as workspace. The constant \spad{r} is assumed to be nonzero.
695827`\spad{pop!(s)} returns the top element \spad{x},{} destructively removing \spad{x} from \spad{s}. Note: Use \spad{top(s)} to obtain \spad{x} without removing it from \spad{s}. Error: if \spad{s} is empty.
695871`\spad{popFortranOutputStack()} pops the Fortran output stack
695942`generates a poset corresponding to an \spad{L7} lattice
696006`generates a poset corresponding to an \spad{M5} lattice
696070`generates a poset corresponding to an \spad{N5} lattice
696134`generates a poset corresponding to an \spad{O6} lattice
696198`generates a poset corresponding to an \spad{P6} lattice
696262`\spad{position(x)} returns the integer \spad{n} associated to \spad{x}.
696321`return index of \spad{e} in \spad{lst}. Index will be negative if \spad{e} has negative multiplier.
696378`return index of \spad{e} in \spad{lst}. Index will be negative if \spad{e} has negative multiplier.
696821`\spad{position(p,{} a)} returns the index \spad{i} of the first \spad{x} in \spad{a} such that \spad{p(x)} is \spad{true},{} and \spad{minIndex(a) - 1} if there is no such \spad{x}.
696911`\spad{position(x,{} a)} returns the index \spad{i} of the first occurrence of \spad{x} in a,{} and \spad{minIndex(a) - 1} if there is no such \spad{x}.
697212`\spad{position(cc,{} t,{} i)} returns the position \spad{j} in string \spad{t} of the first character belonging to \spad{cc},{} beginning at index \spad{i}. Returns \spad{minIndex(t) - 1} if there is no such \spad{j}.
697287`\spad{position(s,{} t,{} i)} returns the position \spad{j} of the substring \spad{s} in string \spad{t},{} beginning at index \spad{i}. Returns \spad{minIndex(s) - 1} if there is no such \spad{j}.
697349`\spad{position(x,{} a,{} n)} returns the index \spad{i} of the first occurrence of \spad{x} in \spad{a} where \spad{i >= n},{} and \spad{minIndex(a) - 1} if no such \spad{x} is found.
697562`\spad{positive?(u)} returns \spad{true} if every element of \spad{u} is positive,{} \spad{false} otherwise.
697619`\spad{positive?(x)} tests whether \spad{x} is strictly greater than 0.
697762`\spad{positive?(pol,{} aRoot)} answers if \spad{pol} interpreted as \spad{aRoot} is positive
697925`\spad{positivePower(x,{} n)} computes a positive integral power of the matrix \spad{x}. Error: if the matrix is not square.
698008`\spad{positiveRemainder(a,{} b)} (where \spad{b > 1}) yields \spad{r} where \spad{0 <= r < b} and \spad{r = a rem b}.
698069`\spad{positiveSolve(lp)} returns the same as \spad{positiveSolve(lp,{} false,{} false)}.
698195`\spad{positiveSolve(ts)} returns the points of the regular set of \spad{ts} with (real) strictly positive coordinates.
698320`\spad{positiveSolve(lp)} returns the same as \spad{positiveSolve(lp,{} info?,{} false)}.
698454`\spad{positiveSolve(lp,{} info?,{} lextri?)} returns the set of the points in the variety associated with \spad{lp} whose coordinates are (real) strictly positive. Moreover,{} if \spad{info?} is \spad{true} then some information is displayed during decomposition into regular chains. If \spad{lextri?} is \spad{true} then the lexTriangular algorithm is called from the \spadtype{LexTriangularPackage} constructor (see \spadopFrom{zeroSetSplit}{LexTriangularPackage}(\spad{lp},{} \spad{false})). Otherwise,{} the triangular decomposition is computed directly from the input system by using the \spadopFrom{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 with respect to \spad{ls}.
698596`\spad{possibleOrder(d)} returns \spad{n} such that \spad{d} is of order \spad{n},{} or of infinite order.
698837`\spad{possiblyInfinite?(s)} tests if the stream \spad{s} could possibly have an infinite number of elements. Note: for many datatypes,{} \spad{possiblyInfinite?(s) = not explictlyFinite?(s)}.
698901`\spad{possiblyNewVariety?(newlp,{} llp)} returns \spad{true} iff for every \spad{lp} in \spad{llp} certainlySubVariety?(\spad{newlp},{} \spad{lp}) does not hold.
699007`\spad{postfix(op,{} a)} creates a form which prints as: a \spad{op}.
699049`\spad{pow()} returns precomputed array of powers of variable modulo current modulus from defree \spad{d} up to degree \spad{2*d -1},{} where \spad{d} is degree of the modulus. Note: element at index 0 is variable to power \spad{d}.
699105`\spad{pow(u,{} n,{} d,{} p)} returns u^n truncated after degree \spad{d},{} except if \spad{n=1},{} in which case \spad{u} itself is returned
699219`\spad{power(a,{} f)} returns the power series \spad{f} raised to the power \spad{a}.
699308`\spad{power(op,{} p,{} h1,{} h2)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats \spad{args.1} and \spad{args.2} according to \spad{h1} and \spad{h2},{} respectively. Outer parentheses are added if \spad{p < prec}.
699471`\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.
699600`\spad{powerAssociative?()} tests if all subalgebras generated by a single element are associative.
699679`\spad{power_matrix(s,{} l,{} rd)} computes [\spad{m},{} \spad{p}] such that \spad{p = s^l} modulo reduction data \spad{rd} and column \spad{j} of \spad{m} contain \spad{s^j} modulo reduction data \spad{rd}. Note that lowest column index is \spad{j = 0} and highest index is \spad{j=l-1}. \spad{rd} should be obtained by earlier call to \spad{ini_rdata}.
699806`\spad{powern(r,{} f)} raises power series \spad{f} to the power \spad{r}.
699933`\spad{powers(\spad{li})} returns a list of 2-element lists. For each 2-element list,{} the first element is an entry of \spad{li} and the second element is the multiplicity with which the first element occurs in \spad{li}. There is a 2-element list for each value occurring in \spad{l}.
700001`generate a poset representing all possible subsets of a given set with their subset relationships.
700072`\spad{powerSum n} is the \spad{n} th power sum symmetric \indented{1}{function.}
700212`\spad{powmod(a,{} b,{} p)},{} \spad{0<=a,{} b<p>1},{} means \spad{a^b mod p}.
700264`\spad{powToUPS should} be local but conditional
700876`\spad{pquo(a,{} b)} computes the pseudo-quotient of \spad{a} by \spad{b},{} both viewed as univariate polynomials in the main variable of \spad{b}.
701002`\spad{pquo(a,{} b,{} v)} computes the pseudo-quotient of \spad{a} by \spad{b},{} both viewed as univariate polynomials in \spad{v}.
701067`\spad{pr2dmp(p)} converts \spad{p} to target domain
701150`\spad{Pr(i,{} ind)} is like \spad{P(i,{} ind)} but \spad{ind} is always a repeated index.
701305`\spad{precedence(p,{} hh)} returns a handler \spad{h} such that \spad{h(prec,{} args)} returns \spad{hh(p,{} args)}. This handler can be used to change the context in which an expression is formatted.
701435`\spad{precedence(p,{} hh)} returns a handler \spad{h} such that \spad{h(prec,{} args)} returns \spad{hh(p,{} args)}. This handler can be used to change the context in which an expression is formatted.
701569`\spad{precision()} returns the number of digits in the model
701626`\spad{precision()} returns the precision in digits base.
701690`\spad{precision(p)} sets the number of digits in the model to \spad{p}
701762`\spad{precision(n)} set the precision in the base to \spad{n} decimal digits.
701866`\spad{precondition(f)} prepares form for formatting.
701934`\spad{predicate(p)} returns the predicate attached to \spad{p},{} the constant function \spad{true} if \spad{p} has no predicates attached to it.
702008`\spad{predicates(p)} returns \spad{[p1,{} ...,{} pn]} such that the predicate attached to \spad{p} is \spad{p1} and ... and \spad{pn}.
702059`\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}.
702158`\spad{prefix?(s,{} t)} tests if the string \spad{s} is the initial substring of \spad{t}. Note: \spad{prefix?(s,{} t) = reduce(and,{} [s.i = t.i for i in indices s])}.
702211`\spad{prefix(s,{} p,{} hh)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats args according to \spad{hh} and then prefixes this box by \spad{box s}. Outer parentheses are added if \spad{p < prec}.
702344`\spad{prefix(s,{} p,{} hh)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats args according to \spad{hh} and then prefixes this box by \spad{box s}. Outer parentheses are added if \spad{p < prec}.
702481`\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]}.
702546`\spad{pre_gauss(m)} performs Gaussian eliminaton on rows of \spad{m} using only 1 and \spad{-1} as pivots. Note: \spad{m} is modified in place
702629`\spad{pre_lr(m,{} \spad{pi},{} pj)} is like pre_gauss,{} but records positions of pivots in \spad{pi} and \spad{pj} and returns transformation matrix. \spad{m},{} \spad{pi},{} \spad{pj} are modified in place
702802`\spad{prem(a,{} b)} computes the pseudo-remainder of \spad{a} by \spad{b},{} both viewed as univariate polynomials in the main variable of \spad{b}.
702928`\spad{prem(a,{} b,{} v)} computes the pseudo-remainder of \spad{a} by \spad{b},{} both viewed as univariate polynomials in \spad{v}.
702993`\spad{prepareDecompose(lp,{} lts,{} b1,{} b2)} is an internal subroutine,{} exported only for development.
703141`\spad{prepareDecompose(lp,{} lts,{} b1,{} b2)} is an internal subroutine,{} exported only for development.
703299`\spad{prepareSubResAlgo(p1,{} p2,{} ts)} is an internal subroutine,{} exported only for development.
703419`\spad{pre_process(lp,{} b1,{} b2)} is an internal subroutine,{} exported only for development.
703537`\spad{pre_process(lp,{} b1,{} b2)} is an internal subroutine,{} exported only for development.
703665`\spad{pre_smith(m)} first performs pre_gauss(\spad{m}) and then drops all rows and columns of \spad{m} containing pivots.
703748`\spad{presub(f,{} n)} creates a form for \spad{f} presubscripted by \spad{n}.
703789`\spad{presuper(f,{} n)} creates a form for \spad{f} presuperscripted by \spad{n}.
703832`\spad{pretendOfType(f)} returns the input form corresponding to \spad{f pretend R}
703906`\spad{previous(l)} returns the doubly-link list beginning with its previous element. Error: if \spad{l} has no previous element. Note: \spad{next(previous(l)) = l}.
703961`\spad{prevPrime(n)} returns the largest prime strictly smaller than \spad{n}
704016`\spad{primaryDecomp(I)} returns a list of primary ideals such that their intersection is the ideal \spad{I}.
704393`\spad{prime(f)} creates the form \spad{f} followed by a suffix prime (single quote).
704431`\spad{prime(p)} returns a handler that treats the typesetting of primes. Note that differentiate(a,{} 3) gives the following \spad{s}-expression in OutputForm: (PRIME a ",{},{},{}") whereas differentiate(a+b,{} 4) gives: (PRIME (+ a \spad{b}) (PAREN "iv")). the precedence \spad{p1}. Outer parentheses are added if \spad{p < prec}. See also the auxiliary function \spad{numberOfPrimes}.
704720`\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.
704780`\spad{prime?(\spad{zi})} tests if the complex integer \spad{zi} is prime.
704858`\spad{prime?(n)} returns \spad{true} if \spad{n} is prime and \spad{false} if not. Note that we ignore sign of \spad{n},{} so \spad{-5} is considered prime. The algorithm used is Rabin\spad{'s} probabilistic primality test (reference: Knuth Volume 2 Semi Numerical Algorithms). If \spad{prime? n} returns \spad{false},{} \spad{n} is proven composite. If \spad{prime? n} returns \spad{true},{} prime? may be in error however,{} the probability of error is very low. and is zero below 25*10^9 (due to a result of Pomerance et al),{} below 10^12 and 10^13 due to results of Pinch,{} and below 341550071728321 due to a result of Jaeschke. Specifically,{} this implementation does at least 10 pseudo prime tests and so the probability of error is \spad{< 4^(-10)}. The running time of this method is cubic in the length of the input \spad{n},{} that is \spad{O( (log n)^3 )},{} for \spad{n<10^20}. beyond that,{} the algorithm is quartic,{} \spad{O( (log n)^4 )}. Two improvements due to Davenport have been incorporated which catches some trivial strong pseudo-primes,{} such as [Jaeschke,{} 1991] 1377161253229053 * 413148375987157,{} which the original algorithm regards as prime
704916`\spad{prime?(I)} tests if the ideal \spad{I} is prime.
705133`\spad{prime(f,{} n)} creates the form \spad{f} followed by \spad{n} primes.
705190`\spad{primeFactor(base,{} exponent)} creates a factored object with a single factor whose \spad{base} is asserted to be prime (flag = "prime").
705316`\spad{primeFrobenius(a)} returns \spad{a ^ p} where \spad{p} is the characteristic.
705460`\spad{primeFrobenius(a,{} s)} returns \spad{a^(p^s)} where \spad{p} is the characteristic.
705542`\spad{primes(a,{} b)} returns a list of all primes \spad{p} with \spad{a <= p <= b}
705602`\spad{primextint(',{} ext,{} csolve,{} [g1,{} ...,{} gn])} returns a basis of solutions of the homogeneous system \spad{h' + c1*g1 + ... + cn*gn = 0}. Argument \spad{ext} is an extended integration function on \spad{F}. \spad{csolve} is solver over constants.
705833`\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}.
706200`\spad{primitive?(f)} tests whether the polynomial \spad{f} over a finite field is primitive,{} \spadignore{i.e.} all its roots are primitive.
706300`\spad{primitive?(b)} tests whether the element \spad{b} is a generator of the (cyclic) multiplicative group of the field,{} \spadignore{i.e.} is a primitive element. Implementation Note: see \spad{ch}.IX.1.3,{} th.2 in \spad{D}. Lipson.
706358`\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}.
706415`\spad{primitiveElement([a1,{} ...,{} an])} returns \spad{[a,{} [q1,{} ...,{} qn],{} q]} such that then \spad{k(a1,{} ...,{} an) = k(a)},{} \spad{\spad{ai} = \spad{qi}(a)},{} and \spad{q(a) = 0}. This operation uses the technique of \spadglossSee{groebner bases}{Groebner basis}.
706586`\spad{primitiveElement([p1,{} ...,{} pn],{} [a1,{} ...,{} an])} returns \spad{[[c1,{} ...,{} cn],{} [q1,{} ...,{} qn],{} q]} such that then \spad{k(a1,{} ...,{} an) = k(a)},{} where \spad{a = a1 c1 + ... + an cn},{} \spad{\spad{ai} = \spad{qi}(a)},{} and \spad{q(a) = 0}. The \spad{pi}\spad{'s} are the defining polynomials for the \spad{ai}\spad{'s}. This operation uses the technique of \spadglossSee{groebner bases}{Groebner basis}.
706776`\spad{primitiveElement(a1,{} a2)} returns \spad{[a,{} q1,{} q2,{} q]} such that \spad{k(a1,{} a2) = k(a)},{} \spad{\spad{ai} = \spad{qi}(a)},{} and \spad{q(a) = 0}. The minimal polynomial for \spad{a2} may involve \spad{a1},{} but the minimal polynomial for \spad{a1} may not involve \spad{a2}; This operations uses \spadfun{resultant}.
707003`\spad{primitiveElement([p1,{} ...,{} pn],{} [a1,{} ...,{} an],{} a)} returns \spad{[[c1,{} ...,{} cn],{} [q1,{} ...,{} qn],{} q]} such that then \spad{k(a1,{} ...,{} an) = k(a)},{} where \spad{a = a1 c1 + ... + an cn},{} \spad{\spad{ai} = \spad{qi}(a)},{} and \spad{q(a) = 0}. The \spad{pi}\spad{'s} are the defining polynomials for the \spad{ai}\spad{'s}. This operation uses the technique of \spadglossSee{groebner bases}{Groebner basis}.
707200`\spad{primitiveElement(p1,{} a1,{} p2,{} a2)} returns \spad{[c1,{} c2,{} q]} such that \spad{k(a1,{} a2) = k(a)} where \spad{a = c1 a1 + c2 a2,{} and q(a) = 0}. The \spad{pi}\spad{'s} are the defining polynomials for the \spad{ai}\spad{'s}. The \spad{p2} may involve \spad{a1},{} but \spad{p1} must not involve \spad{a2}. This operation uses \spadfun{resultant}.
707367`\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)]}.
707882`\spad{primitivePart(p)} returns the unit normalized form of polynomial \spad{p} divided by the content of \spad{p}.
707962`\spad{primitivePart(f)} removes the content of the denominator and the common content of the numerator of \spad{f}.
708030`\spad{primitivePart(p)} returns the unitCanonical associate of the polynomial \spad{p} with its content divided out.
708112`\spad{primitivePart!(p)} replaces \spad{p} by its primitive part.
708270`\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.
708357`\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.
708446`\spad{primitiveRowEchelon(A)} computes a row echelon form for the matrix \spad{A}. The algorithm used is fraction-free elimination. Every row is made primitive by division by the \spad{gcd}. The algorithm is especially adapted to matrices already close to row echelon form. The transformation matrix,{} the used pivots and the rank of the matrix are also returned.
708763`\spad{primPartElseUnitCanonical!(p)} replaces \spad{p} by \spad{primPartElseUnitCanonical(p)}.
708867`\spad{primPartElseUnitCanonical(p)} returns \spad{primitivePart(p)} if \spad{R} is a \spad{gcd}-domain,{} otherwise \spad{unitCanonical(p)}.
708970`\spad{prinb }\undocumented
709117`\spad{principal?(D)} tests if the argument is the divisor of a function.
709278`\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)}
709585`\spad{prindINFO }\undocumented
709761`\spad{prinpolINFO }\undocumented
709846`\spad{prinshINFO }\undocumented
709924`\spad{print(u)} prints the form \spad{u}.
709965`\spad{print(o)} writes the output form \spad{o} on standard output using the two-dimensional formatter.
710017`\spad{printCode(f)} prints out \spad{f} in FORTRAN notation.
710063`\spad{printHeader()} produces the FORTRAN header for the current subprogram in the global symbol table on the current FORTRAN output stream.
710113`\spad{printHeader(f)} produces the FORTRAN header for subprogram \spad{f} in the global symbol table on the current FORTRAN output stream.
710169`\spad{printHeader(f,{} tab)} produces the FORTRAN header for subprogram \spad{f} in symbol table tab on the current FORTRAN output stream.
710227`\spad{printInfo!(x,{} y)} initializes the messages to be printed when manipulating items from the hash-table. If a key is retrieved then \spad{x} is displayed. If an item is stored then \spad{y} is displayed.
710571`\spad{printingInfo?()} returns \spad{true} iff messages are printed when manipulating items from the hash-table.
710650`\spad{printStatement(l)} creates a representation of a PRINT statement.
710713`\spad{printStats!()} prints the statistics.
710787`\spad{printSys(sys)} writes a list of functions as a vector of equations (with right hand side 0) and coerces the result to \spadtype{OutputForm}.
710862`\spad{printTypes(tab)} produces FORTRAN type declarations from \spad{tab},{} on the current FORTRAN output stream
710917`\spad{printTypes(tab)} produces FORTRAN type declarations from \spad{tab},{} on the current FORTRAN output stream
710964`\spad{probablyZeroDim?(lp)} returns \spad{true} iff the number of polynomials in \spad{lp} is not smaller than the number of variables occurring in these polynomials.
711053`\spad{processTemplate(tp)} processes the template \spad{tp},{} writing the result to the current FORTRAN output stream.
711120`\spad{processTemplate(tp,{} fn)} processes the template \spad{tp},{} writing the result out to \spad{fn}.
711196`\spad{prod(expr)} creates the form prefixing \spad{expr} by a capital \spad{pi}.
711233`\spad{prod(expr,{} lowerlimit)} creates the form prefixing \spad{expr} by a capital \spad{pi} with a lowerlimit.
711272`\spad{prod(expr,{} lowerlimit,{} upperlimit)} creates the form prefixing \spad{expr} by a capital \spad{pi} with both a \spad{lowerlimit} and upperlimit.
711313`\spad{prodiag(x)} performs "diagonal" infinite product of a stream of streams. When \spad{x(i)} is interpreted as stream of coefficients of series \spad{f_i(z),{} i=1,{}...},{} then \spad{prodiag(x) = (1 + z*f_1(z))*(1 + z^2*f_2(x))*...}
711398`\spad{product(p)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats a product with product sign and respective limits. Outer parentheses are added if \spad{p < prec}.
711487`This function returns the product of two cubical facets. Unlike the simplex case,{} the product is a single facet
711531`Forms product of two cubical complexes.
711587`Forms product of two simplicial complexes. For more detailed explanation of simplex product code see: \url{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/simplex/product/} Also see Hatcher [9]. page 277 - The simplicial cross product. page 278 - The cohomology cross product. Returns list,{} each entry is a 'lattice path' from (0,{} 0) to (\spad{x},{} \spad{y}) where \spad{x} is number of entries in sa and \spad{y} is number of entries in \spad{sb}.
711646`\spad{product(f(n),{} n = a..b)} returns \spad{f}(a) * ... * \spad{f}(\spad{b}) as a formal product.
711720`\spad{product(f(n),{} n)} returns the formal product \spad{P}(\spad{n}) which verifies \spad{P}(\spad{n+1})\spad{/P}(\spad{n}) = \spad{f}(\spad{n}).
711783`This function returns the product of two facets. For more detailed explanation of simplex product code see: \url{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/simplex/product/} Also see Hatcher [9]. page 277 - The simplicial cross product. page 278 - The cohomology cross product. Returns list,{} each entry is a 'lattice path' from (0,{} 0) to (\spad{x},{} \spad{y}) where \spad{x} is number of entries in sa and \spad{y} is number of entries in \spad{sb}.
711845`\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)}}
711895`\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)}.}
711955`\spad{product(f(n),{} n = a..b)} returns \spad{f}(a) * ... * \spad{f}(\spad{b}) as a formal product.
712027`\spad{product(f(n),{} n)} returns the formal product \spad{P}(\spad{n}) which verifies \spad{P}(\spad{n+1})\spad{/P}(\spad{n}) = \spad{f}(\spad{n}).
712088`\spad{product(a,{} b,{} n)} returns \spad{a*b} (truncated up to order \spad{n}).
712163`Constructor for product facet
712279`Copy constructor to allow change of sign
712345`\spad{project(de,{} q)} projects the differential equation \spad{de} of order higher than \spad{q} into the \spad{q}\spad{-}th order jet bundle.
712423`\spad{projection(c)} projects \spad{c} with respect to main variable
712486`\spad{projectionSet(lup)} performs one projection step
712650`Generate a minimal projective space.
712732`Generate a minimal triangulation of the surface of a projective plane. A one sided surface which cannot be embedded in 3D space without intersecting itself. There are no external boundaries,{} every edge connects two faces. (A punctured projective plane is equivalent to a Moebius band)
712830`Generate a cubical complex of the surface of a projective plane. A one sided surface which cannot be embedded in 3D space without intersecting itself. There are no external boundaries,{} every edge connects two faces. (A punctured projective plane is equivalent to a Moebius band)
712934`\spad{prolateSpheroidal(a)} transforms from prolate spheroidal coordinates to Cartesian coordinates: \spad{prolateSpheroidal(a)} is a function which will map the point \spad{(\spad{xi},{} eta,{} phi)} to \spad{x = a*sinh(\spad{xi})*sin(eta)*cos(phi)},{} \spad{y = a*sinh(\spad{xi})*sin(eta)*sin(phi)},{} \spad{z = a*cosh(\spad{xi})*cos(eta)}.
713013`\spad{prologue(t)} extracts the prologue section of a TeX form \spad{t}.
713064`\spad{prologue(t)} extracts the prologue section of the form \spad{t}.
713115`\spad{prolong(de)} prolongs the differential equation \spad{de}. Additionally the arising integrability conditions are returned.
713197`\spad{prolong(v,{} q)} prolongs a vector field \spad{v} defined on the base space into the jet bundle of order \spad{q}.
713266`\spad{prolong(de,{} q)} is like \spad{prolong(de)}. However,{} only equations of lower order than \spad{q} are prolonged.
713367`\spad{prolongMV(mv)} calculates the number of multiplicative variables for the prolongation of an involutive symbol.
713610`\spad{prolongSymbol(symb)} prolongs directly the symbol \spad{symb}.
713723`\spad{properties(op)} returns the list of all the properties currently attached to \spad{op}.
713796`\spad{property(op,{} s)} returns the value of property \spad{s} if it is attached to \spad{op},{} and "failed" otherwise.
713866`Constructs a proposition
714111`\spad{pseudoDivide(p,{} q)} returns \spad{[c,{} s,{} 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}.
714236`\spad{pseudoDivide(a,{} b)} computes \spad{[pquo(a,{} b),{} prem(a,{} b)]},{} both polynomials viewed as univariate polynomials in the main variable of \spad{b},{} if \spad{b} is not a constant polynomial.
714404`\spad{pseudoQuotient(p,{} q)} returns \spad{s},{} 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}.
714495`\spad{pseudoRem(x,{} y,{} m)} computes pseudoremainder of \spad{x} by \spad{y} modulo \spad{m}.
714647`\spad{pseudoRemainder(p,{} q)} = \spad{r},{} for polynomials \spad{p} and \spad{q},{} returns the remainder \spad{r} 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}.
714729`\spad{Psi()} returns symbol for capital greek letter psi.
714778`\spad{psi()} returns symbol for small greek letter psi.
714827`\spad{psolve(c)} solves the homogeneous linear system \spad{c} \spad{z} = 0 for all possible ranks of the matrix \spad{c}
715073`\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}
715328`\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}
715587`\spad{psolve(c)} solves the homogeneous linear system \spad{c} \spad{z} = 0 for all possible ranks \spad{>=} \spad{k} of the matrix \spad{c}
715849`\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
715941`\spad{psolve(c,{} w,{} k)} solves \spad{c} \spad{z} = \spad{w} for all possible ranks \spad{>=} \spad{k} of the matrix \spad{c} and given right hand side vector \spad{w}
716212`\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
716313`\spad{psolve(c,{} w,{} k)} solves \spad{c} \spad{z} = \spad{w} for all possible ranks \spad{>=} \spad{k} of the matrix \spad{c} and indeterminate right hand side \spad{w}
716588`\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
716693`\spad{psolve(c,{} k,{} s)} solves \spad{c} \spad{z} = 0 for all possible ranks \spad{>=} \spad{k} of the matrix \spad{c},{} writes the results to a file named \spad{s},{} and returns the number of regimes
716801`\spad{psolve(c,{} w,{} k,{} s)} solves \spad{c} \spad{z} = \spad{w} for all possible ranks \spad{>=} \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
716918`\spad{psolve(c,{} w,{} k,{} s)} solves \spad{c} \spad{z} = \spad{w} for all possible ranks \spad{>=} \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
717039`\spad{ptFunc(a,{} b,{} c,{} d)} is an internal function exported in order to compile packages.
717316`\spad{pToDmp(p)} converts \spad{p} from a \spadtype{POLY} to a \spadtype{DMP}.
717409`\spad{pToHdmp(p)} converts \spad{p} from a \spadtype{POLY} to a \spadtype{HDMP}.
717514`\spad{ptree(s)} is a leaf? pendant tree
717556`\spad{ptree(x,{} y)} \undocumented
717600`\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.
717672`\spad{puiseux(x)} returns \spad{x} viewed as a Puiseux series.
717748`\spad{puiseux(f,{} x = a)} expands the expression \spad{f} as a Puiseux series in powers of \spad{(x - a)}.
717833`\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}.
717923`\spad{puiseux(r,{} f(x))} returns \spad{f(x^r)}.
718025`\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}.
718128`\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)}.
718434`\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)}.
718641`\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)}.
718993`\spad{pureLex(v1,{} v2)} return \spad{true} if the vector \spad{v1} is less than the vector \spad{v2} in the lexicographic ordering.
719151`\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 \spadopFrom{select}{TriangularSetCategory}(\spad{ts},{} \spad{v}) and \spad{ts_v_-} is \spadopFrom{collectUnder}{TriangularSetCategory}(\spad{ts},{} \spad{v}).
719315`\spad{purelyAlgebraic?(p,{} ts)} returns \spad{true} iff every variable of \spad{p} is algebraic with respect to \spad{ts}.
719496`\spad{purelyAlgebraicLeadingMonomial?(p,{} ts)} returns \spad{true} iff the main variable of any non-constant iterarted initial of \spad{p} is algebraic with respect to \spad{ts}.
719683`\spad{purelyTranscendental?(p,{} ts)} returns \spad{true} iff every variable of \spad{p} is not algebraic with respect to \spad{ts}.
719773`\spad{purge!(A,{} crit)} eliminates all columns belonging to an index \spad{c} such that \spad{crit(c)} yields \spad{true}.
719843`\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}.
719891`\spad{pushdown(p,{} lv)} \undocumented{}
719961`\spad{pushdown(prf,{} var)} pushes all top level occurrences of the variable var into the coefficient domain for the polynomial \spad{prf}.
720046`\spad{pushdterm(monom,{} var)} pushes all top level occurrences of the variable var into the coefficient domain for the monomial \spad{monom}.
720160`\spad{pushFortranOutputStack(f)} pushes \spad{f} onto the Fortran output stack
720241`\spad{pushFortranOutputStack(f)} pushes \spad{f} onto the Fortran output stack
720320`\spad{pushucoef(upoly,{} var)} converts the anonymous univariate polynomial \spad{upoly} to a polynomial in var over rational functions.
720444`\spad{pushuconst(r,{} var)} takes a rational function and raises all occurrences of the variable var to the polynomial level.
720551`\spad{pushup(p,{} lv)} \undocumented{}
720619`\spad{pushup(prf,{} var)} raises all occurrences of the variable var in the coefficients of the polynomial \spad{prf} back to the polynomial level.
720702`\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}.
720820`\spad{putGraph(v,{} \spad{gi},{} n)} sets the graph field indicated by \spad{n},{} of the indicated two-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{TwoDimensionalViewport},{} to be the graph,{} \spad{\spad{gi}} of domain \spadtype{GraphImage}. The contents of viewport,{} \spad{v},{} will contain \spad{\spad{gi}} when the function \spadfun{makeViewport2D} is called to create the an updated viewport \spad{v}.
720904`\spad{addColumns!(f,{} i,{} j,{} alpha)} adds alpha*column(\spad{i}) to column(\spad{j}) in A and subtracts row(\spad{j}) from row(\spad{i}) in \spad{s} (in the ALS of \spad{f}),{} \spadignore{i.e.} (A*U)(U^-1*s) = \spad{v}.
721006`\spad{addColumns!(p,{} i,{} j,{} alpha)} adds alpha*column(\spad{i}) to column(\spad{j}) in all matrices of the linear pencil \spad{p}. (no index check)
721115`\spad{addRows!(f,{} i,{} j,{} alpha)} adds alpha*row(\spad{i}) to row(\spad{j}) in the ALS of \spad{f}.
721214`\spad{qaddRows!(p,{} i,{} j,{} alpha)} adds alpha*row(\spad{i}) to row(\spad{j}) in all matrices of the linear pencil \spad{p} (no index check). (no index check)
721320`\spad{qcoerce(n)} coerces \spad{n} to \spad{\%} trusting that \spad{n} is nonnegative
721375`\spad{qcoerce(n)} coerces \spad{n} to \spad{\%} trusting that \spad{n} is positive
721427`\spad{qcolumnIndices(p,{} off)} returns a list of column indices for nozero elements for every row starting at the specified offset. (no range check)
721546`\spad{qcolumnIndices(p,{} off,{} l)} returns a list of column indices for nonzero elements in matrix \spad{l} for every row starting at the specified offset. (no range check)
721684`\spad{qcolumnIndices(p,{} off,{} i,{} l)} returns a list of column indices for nonzero elements in the specified row of matrix \spad{l} for starting at the specified offset. (no range check)
721873`\spad{qconvert(x)} converts \spad{x} to \% trusting that \spad{x} is in correct range.
721924`\spad{qdiagonal?(p,{} k_min,{} k_max,{} l)} is the matrix \spad{l} diagonal between \spad{k_min} and k_max? (no range check)
722054`\spad{qdiagonal(p,{} k_min,{} k_max,{} l)} returns the entries along the diagonal between \spad{k_min} and \spad{k_max}. (no range check)
722237`\spad{qelt(u,{} x)} applies \spad{u} to \spad{x} without checking whether \spad{x} is in the domain of \spad{u}. If \spad{x} is not in the domain of \spad{u} a memory-access violation may occur. If a check on whether \spad{x} is in the domain of \spad{u} is required,{} use the function \spad{elt}.
722294`\spad{elt(p,{} i,{} j)} returns the elements (\spad{i},{}\spad{j}) from the linear pencil \spad{p} as a list (no check).
722399`\spad{qelt(f,{} i,{} j)} returns A(\spad{i},{}\spad{j}) from the ALS of \spad{f}.
722519`\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.
722603`\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
722685`\spad{elt(p,{} i,{} j,{} l)} returns the element (\spad{i},{}\spad{j}) in matrix \spad{l} of the linear pencil \spad{p} (no index-check).
722803`\spad{qequal?(p,{} pos_p,{} q,{} pos_q,{} offset)} checks,{} if the matrices are equal starting at offset.
722944`\spad{qinterval(inf,{} sup)} creates a new interval \spad{[inf,{} sup]},{} without checking the ordering on the elements.
722998`\spad{qlog(x)} computes natural logarithm of \spad{x}. It assumes that \spad{x > 0}.
723037`\spad{multiplyColumn!(p,{} j,{} alphat)} multiplies column(\spad{j}) by alpha.
723131`\spad{qmultiplyRow!(p,{} i,{} alpha)} multiplies row(\spad{i}) by alpha. (no index check)
723222`\spad{qnew(n)} creates a new uninitialized vector of length \spad{n}.
723280`\spad{qnew(n)} creates a new uninitialized vector of length \spad{n}.
723331`\spad{qnew(n)} creates an empty ALS of dimension \spad{n}.
723402`\spad{qnew(n,{} lst)} creates an empty ALS of dimension \spad{n}.
723495`\spad{qnew(m,{} n)} is is an \spad{m}-by-\spad{n} uninitilized array
723597`\spad{qnew(m,{} n,{} l)} creates an empty linear pencil with \spad{l} matrices with \spad{m} rows and \spad{n} columns.
723713`\spad{qnilpotent?(p,{} k_min,{} k_max,{} l)} ist the matrix \spad{l} nilpotent with respect to the specified block? (no range check)
723844`\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}.
723932`\spad{qregular?(f,{} i_min,{} i_max)} does the specified diagonal block define a regular element?
724035`\spad{qroot(f,{} n)} returns \spad{[m,{} c,{} r]} such that \spad{f^(1/n) = c * r^(1/m)}.
724177`\spad{qrowIndices(p,{} off)} returns a list of row indices for nonzero elements for every column starting at the specified offset. (no range check)
724293`\spad{qrowIndices(p,{} off,{} l)} returns a list of row indices for nonzero elements in matrix \spad{l} for every column starting at the specified offset. (no range check)
724428`\spad{qrowIndices(p,{} off,{} j,{} l)} returns a list of row indices for nozero elements in column \spad{j} in matrix \spad{l} (no range check)
724576`\spad{qscalesubMatrix!(p,{} i_min,{} i_max,{} j_min,{} j_max,{} l,{} alpha)} multiplies the entries in the specified block of matrix \spad{l} with alpha.
724742`\spad{qsemizero?(p,{} i_min,{} i_max,{} j_min,{} j_max,{} l)} checks,{} if the specified submatrix is zero except for matrix \spad{l} (no index check).
724971`\spad{qsetelt!(u,{} x,{} y)} sets the image of \spad{x} to be \spad{y} under \spad{u},{} without checking that \spad{x} is in the domain of \spad{u}. If such a check is required use the function \spad{setelt!}.
725058`\spad{qsetelt!(p,{} i,{} j,{} lst)} sets the element (\spad{i},{}\spad{j}) in the matrices of the linear pencil \spad{p} according to the elements in \spad{lst}.
725175`\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
725263`\spad{qselelt!(p,{} i,{} j,{} l,{} alpha)} sets the element (\spad{i},{}\spad{j}) in matrix \spad{l} of the linear pencil \spad{p} to alpha.
725446`\spad{qsetfirst!(u,{} x)} destructively changes the first element of \spad{u} to \spad{x} without checking for errors.
725589`\spad{qsetrest!(u,{} v)} destructively changes the rest of \spad{u} to \spad{v} without checking for errors.
725673`\spad{qShiftAction(q,{} k,{} l,{} g)} gives the coefficient of \spad{x^k} in \spad{z^l} \spad{g}(\spad{x}),{} where \spad{z*}(a+b*x+c*x^2+d*x^3+...) = (a+q*b*x+q^2*c*x^2+q^3*d*x^3+...). In terms of sequences,{} z*u(\spad{n})=q^n*u(\spad{n}).
725778`\spad{qShiftC} gives the coefficients \spad{c_}{\spad{k},{} \spad{k}} in the expansion <x^k> \spad{z} \spad{g}(\spad{x}) = sum_{\spad{i=0}}\spad{^k} \spad{c_}{\spad{k},{} \spad{i}} <x^i> \spad{g}(\spad{x}),{} where \spad{z} acts on \spad{g}(\spad{x}) by shifting. In fact,{} the result is [1,{} \spad{q},{} \spad{q^2},{} ...]
725863`\spad{qsqrt(x)} computes square root of \spad{x}. It assumes that \spad{x >= 0}.
725903`\spad{swapColumns!(f,{} i,{} j)} exchanges columns \spad{i} and \spad{j} in the ALS of \spad{f}.
726004`\spad{qswapColumns!(p,{} i,{} j)} exchanges columns \spad{i} and \spad{j} in all matrices of the linear pencil \spad{p} (no index check)
726112`\spad{swapRows!(f,{} i,{} j)} exchanges rows \spad{i} and \spad{j} in the ALS of \spad{f}.
726210`\spad{qswapRows!(p,{} i,{} j)} exchanges rows \spad{i} and \spad{j} in all matrices of the linear pencil \spad{p} (no index check).
726315`\spad{quadratic(u)} \undocumented
726389`\spad{quadratic(f,{} g,{} h)} \undocumented
726466`\spad{quadraticForm(m)} creates a quadratic form from a symmetric,{} square matrix \spad{m}.
726537`\spad{quadraticNonResidue()} computes the smallest non negative integer,{} which represents a quadratic non residue.
726597`\spad{quadraticNorm(f)} returns the \spad{l2} norm of the polynomial \spad{f}.
726676`\spad{quartic(u)} \undocumented
726748`\spad{quartic2(p,{} a0)} should be local but conditional
726902`\spad{quartic(f,{} g,{} h,{} i,{} j)} \undocumented
726981`\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} \spad{~=} 0.
727172`\spad{quasiComponent(ts)} returns \spad{[lp,{} lq]} where \spad{lp} is the list of the members of \spad{ts} and \spad{lq}is \spad{initials(ts)}.
727345`\spad{quasiMonic?(p)} returns \spad{false} if \spad{p} belongs to \spad{R},{} otherwise returns \spad{true} iff the initial of \spad{p} lies in the base ring \spad{R}.
727420`\spad{quasiMonicPolynomials(lp)} returns \spad{qmps,{} nqmps} where \spad{qmps} is a list of the quasi-monic polynomials in \spad{lp} and \spad{nqmps} are the other ones.
727548`\spad{quasiRegular?(x)} return \spad{true} if \spad{constant(p)} is zero.
727611`\spad{quasiRegular(x)} return \spad{x} minus its constant term.
727667`\spad{quasiRegular?(x)} return \spad{true} if \spad{constant(x)} is zero.
727728`\spad{quasiRegular(x)} return \spad{x} minus its constant term.
727782`\spad{quatern(r,{} i,{} j,{} k)} constructs a quaternion from scalars.
727840`\spad{queue([x,{} y,{} ...,{} z])} creates a queue with first (top) element \spad{x},{} second element \spad{y},{} ...,{} and last (bottom) element \spad{z}.
727883`\spad{quickSort(f,{} agg)} sorts the aggregate agg with the ordering function \spad{f} using the quicksort algorithm.
727961`\spad{f quo g} creates the equivalent infix form.
728086`\spad{x quo y} is the same as \spad{divide(x,{} y).quotient}. See \spadfunFrom{divide}{EuclideanDomain}.
728130`\spad{a quo b} returns the quotient of \spad{a} and \spad{b},{} forgetting the remainder.
728177`\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.
728245`\spad{quote()} provides the string quote character,{} \spad{"}.
728282`\spad{quote(f)} creates the form \spad{f} with a prefix quote.
728321`\spad{quoted?(p)} tests if \spad{p} is of the form \spad{'s} for a symbol \spad{s}.
728368`\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.
728439`take quotient by adding relations specified by addrel
728508`take quotient by removing generators specified by remgen
728582`\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))}.
728657`\spad{quotient(I,{} J)} computes the quotient of the ideals \spad{I} and \spad{J},{} \spad{(I: J)}.
728728`\spad{quotient(x,{} y,{} b)} computes approximation to \spad{x/y} accurate to at least \spad{b} bits.
728922`\spad{quotientByP(x)} returns \spad{b},{} where \spad{x = a + b p}.
728980`\spad{quppertriangular?(p,{} k_min,{} k_max,{} l)} is the matrix \spad{l} upper triangular with respect to the specified block? (no range check)
729117`\spad{qzero?(p,{} i,{} j)} checks if all the entries (\spad{i},{}\spad{j}) of the linear pencil \spad{p} are zero. (no index check)
729224`\spad{qzero?(f,{} i_min,{} i_max,{} j_min,{} j_max)} is the specified block zero (in the system matrix)?
729362`\spad{qzero?(p,{} i_min,{} i_max,{} j_min,{} j_max)} checks if the specified block of the linear pencil \spad{p} is zero for all matrices. (no index check)
729507`\spad{qzero?(f,{} i_min,{} i_max,{} j_min,{} j_max,{} m)} is the specified block zero in the (system) matrix corresponding to the monomial \spad{m?}
729661`\spad{qzero?(f,{} i_min,{} i_max,{} j_min,{} j_max,{} l)} is the specified block zero in matrix \spad{l?}
729818`\spad{qzero?(p,{} i_min,{} i_max,{} j_min,{} j_max,{} l)} checks if the specified block of matrix \spad{l} of the linear pencil \spad{p} is zero (no index check)
729982`\spad{R1_to_R2_coercion should} be local but conditional
730054`\spad{r2m(ind)} transforms a repeated index into a multi-index.
730141`\spad{r2m(ind)} transforms a repeated index into a multi-index.
730232`Undocumented
730310`Undocumented.
730377`Undocumented
730443`Undocumented
730512`Undocumented.
730570`Undocumented
730627`\spad{racahR(n,{} a,{} b,{} c,{} d,{} z)} is the Racah polynomial.
730697`\spad{racahR(n,{} a,{} b,{} c,{} d,{} z)} is the Racah polynomial.
730760`\spad{radical(I)} returns the radical of the ideal \spad{I}.
731126`\spad{radicalEigenvalues(m)} computes the eigenvalues of the matrix \spad{m}; when possible,{} the eigenvalues are expressed in terms of radicals.
731247`\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.
731396`\spad{radicalEigenvectors(m)} computes the eigenvalues and the corresponding eigenvectors of the matrix \spad{m}; when possible,{} values are expressed in terms of radicals.
731591`\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.
731661`\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}.
731766`\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 lvar.
731889`\spad{radicalSimplify(s)} returns a different and presumably simpler representation of \spad{s} with the defining polynomials for the equations forming a groebner basis,{} and the defining polynomial for the inequation reduced with respect to the basis,{} using using groebner basis of radical ideals
732260`\spad{radical_solve(p)} tries to solve polynomial \spad{p} in terms of radicals. Returns "failed" when unsuccessful.
732365`\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}.
732483`\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.
732591`\spad{radicalSolve(leq)} finds the solutions expressed in terms of radicals of the system of equations of rational functions \spad{leq} with respect to all symbols appearing in \spad{leq}.
732721`\spad{radicalSolve(lrf)} finds the solutions expressed in terms of radicals of the system of equations \spad{lrf} = 0,{} where \spad{lrf} is a list of rational functions.
732841`\spad{radical_solve(p)} should be local but conditional
732974`\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}.
733099`\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.
733214`\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 lvar.
733357`\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 lvar,{} where \spad{lrf} is a list of rational functions.
733490`\spad{radix(x,{} b)} converts \spad{x} to a radix expansion in base \spad{b}.
733559`\spad{radPoly(p(x,{} y))} returns \spad{[c(x),{} n]} if \spad{p} is of the form \spad{y^n - c(x)},{} "failed" otherwise.
733687`\spad{raisePolynomial(rpoly)} converts \spad{rpoly} from a univariate polynomial over \spad{r} to be a univariate polynomial with polynomial coefficients.
733810`\spad{ramified?(a)} tests whether \spad{x = a} is ramified.
733881`\spad{ramified?(p)} tests whether \spad{p(x) = 0} is ramified.
733953`\spad{ramifiedAtInfinity?()} tests if infinity is ramified.
734033`\spad{ran(k)} computes a random integer between \spad{-k} and \spad{k} as a member of \spad{R}.
734094`\spad{randnum()} is a random number between 0 and size().
734148`\spad{randnum(n)} is a random number between 0 and \spad{n}-1.
734349`\spad{random()} returns a random element from the set.
734384`\spad{random(n)}\$FFPOLY(\spad{GF}) generates a random monic polynomial of degree \spad{n} over the finite field {\em GF}.
734489`\spad{random(n)} creates a vector over the ground field with random entries.
734576`\spad{random(n)} creates a random element from 0 to \spad{n-1}.
734625`\spad{random(n)} returns a random integer from 0 to \spad{n-1}.
734662`\spad{random(n)} returns a random integer from 0 to \spad{n-1}.
734710`\spad{random(gp)} returns a random product of maximal 20 generators of the group {\em gp}. Note: {\em random(gp)=random(gp,{} 20)}.
734772`\spad{random(m,{} n)}\$FFPOLY(\spad{GF}) generates a random monic polynomial of degree \spad{d} over the finite field {\em GF},{} \spad{d} between \spad{m} and \spad{n}.
734893`\spad{random(gp,{} i)} returns a random product of maximal \spad{i} generators of the group {\em gp}.
734963`\spad{randomLC(n,{} x)} should be local but conditional.
735047`\spad{random_poly(n,{} md)} generated random polynomial of degree \spad{n}.
735137`\spad{randomR()} should be local but conditional
735204`\spad{randomR produces} a random element of \spad{R}
735289`\spad{range([l])} provides a user-specified range \spad{l}. This option is expressed in the form \spad{range == [l]}.
735347`\spad{range([i])} provides a user-specified range \spad{i}. This option is expressed in the form \spad{range == [i]}.
735417`\spad{rangePascalTriangle()} returns the maximal number of lines stored.
735499`\spad{rangePascalTriangle(n)} sets the maximal number of lines which are stored and returns the previous value.
735599`\spad{ranges(\spad{gi})} returns the list of ranges of the point components from the indicated graph,{} \spad{\spad{gi}},{} of the domain \spadtype{GraphImage}.
735658`\spad{ranges(l)} provides a list of user-specified ranges \spad{l}. This option is expressed in the form \spad{ranges == l}.
735717`\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.
735822`\spad{ranges(\spad{gi},{} lr)} modifies the list of ranges for the given graph,{} \spad{\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{\spad{gi}}.
735902`\spad{rank()} returns the rank of the module
736071`\spad{rank()} returns the rank of the algebra.
736135`\spad{rank()} returns the rank of the algebra as \spad{R}-module.
736210`\spad{rank Lv} computes the rank of a list of vectors.
736288`\spad{rank(m)} returns the rank of the matrix \spad{m}.
736379`\spad{rank(f)} returns the rank of the element \spad{f},{} that is,{} the dimension of a minimal admissible linear system (for \spad{f}).
736450`\spad{rank b} computes the rank of a basis,{} \spadignore{i.e.} the number of vectors in the basis.
736514`\spad{rank(m)} returns the rank of the matrix \spad{m}.
736621`\spad{rank(m)} returns the rank of the matrix \spad{m}.
736712`\spad{rank(m)} returns the rank of the matrix \spad{m}.
736818`\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.
736891`\spad{rank(A,{} B)} computes the rank of the complete matrix \spad{(A|B)} of the linear system \spad{AX = B}.
736983`\spad{rank(A,{} B)} computes the rank of the complete matrix \spad{(A|B)} of the linear system \spad{AX = B}.
737070`\spad{rarrow(f,{} g)} creates a form for the mapping \spad{f -> g}.
737112`\spad{ratDenom(f)} rationalizes the denominators appearing in \spad{f} by moving all the algebraic quantities into the numerators.
737171`\spad{ratDenom(f,{} a)} removes \spad{a} from the denominators in \spad{f} if \spad{a} is an algebraic kernel.
737232`\spad{ratDenom(f,{} [a1,{} ...,{} an])} removes the \spad{ai}\spad{'s} which are algebraic kernels from the denominators in \spad{f}.
737299`\spad{ratDenom(f,{} [a1,{} ...,{} an])} removes the \spad{ai}\spad{'s} which are algebraic from the denominators in \spad{f}.
737374`\spad{ratDsolve(op,{} g)} returns \spad{["failed",{} []]} if the equation \spad{op y = g} has no rational solution. Otherwise,{} it returns \spad{[f,{} [y1,{} ...,{} ym]]} where \spad{f} is a particular rational solution and the \spad{yi}\spad{'s} form a basis for the rational solutions of the homogeneous equation.
737557`\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{c1 h1 + ... + cq hq} where \spad{M [c1,{} ...,{} cq] = 0} and \spad{q >= m}.
737720`\spad{ratDsolve(op,{} g)} returns \spad{["failed",{} []]} if the equation \spad{op y = g} has no rational solution. Otherwise,{} it returns \spad{[f,{} [y1,{} ...,{} ym]]} where \spad{f} is a particular rational solution and the \spad{yi}\spad{'s} form a basis for the rational solutions of the homogeneous equation.
737906`\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{c1 h1 + ... + cq hq} where \spad{M [c1,{} ...,{} cq] = 0} and \spad{q >= m}.
738072`\spad{ratexpr(f)} analysis the block structure of the admissible linear system to write \spad{f} as rational expression.
738138`\spad{ratexprInverse(f,{} flg)} returns \spad{f} in output form if it is a polynomial,{} (\spad{f})^-1 if \spad{f^}-1 is a polynomial,{} "r<rank>" if the system is minimal and "d<dim>" in general.
738699`\spad{rational?(x)} tests if \spad{x} is a rational number.
738782`\spad{rational?(n)} tests if \spad{n} is a rational number (see \spadtype{Fraction Integer}).
738840`\spad{rational?(o)} tests if \spad{o} is rational,{} \spadignore{i.e.} that all seven imaginary parts are 0.
738924`\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.
739010`\spad{rational?(u)} tests if \spad{u} is actually a rational number (see \spadtype{Fraction Integer}).
739086`\spad{rational?(x)} tests if \spad{x} is a finite rational number.
739172`\spad{rational?(x)} tests if \spad{x} is a finite rational number.
739257`\spad{rational(x)} returns \spad{x} as a rational number. Error: if \spad{x} is not a rational number.
739349`\spad{rational(n)} creates a rational number (see \spadtype{Fraction Integer}).
739416`\spad{rational(o)} returns the real part if all seven imaginary parts are 0. Error: if \spad{o} is not rational.
739509`\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.
739604`\spad{rational(u)} assumes \spad{u} is actually a rational number and does the conversion to rational number (see \spadtype{Fraction Integer}).
739689`\spad{rational(x)} returns \spad{x} as a finite rational number. Error: if \spad{x} is not a rational number.
739784`\spad{rational(x)} returns \spad{x} as a finite rational number. Error: if \spad{x} cannot be so converted.
739878`\spad{rational?(x)} returns \spad{true} if \spad{x} is a rational number,{} \spad{false} otherwise.
739939`\spad{rational(x)} returns \spad{x} as a rational number; error if \spad{x} is not a rational number.
740009`\spad{rationalApproximation(f,{} n)} computes a rational approximation \spad{r} to \spad{f} with relative error \spad{< 10^(-n)}.
740100`\spad{rationalApproximation(f,{} n)} computes a rational approximation \spad{r} to \spad{f} with relative error \spad{< 10^(-n)}.
740185`\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)}).
740295`\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)}.
740399`\spad{rationalFunction(f,{} k)} returns a rational function consisting of the sum of all terms of \spad{f} of degree \spad{<=} \spad{k}.
740533`\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}.
741017`\spad{rationalIfCan(x)} returns \spad{x} as a rational number,{} "failed" if \spad{x} is not a rational number.
741108`\spad{rationalIfCan(x)} returns \spad{x} as a rational number,{} or "failed" if \spad{x} is not a rational number.
741221`\spad{rationalIfCan(n)} creates a rational number,{} or returns "failed" if this is not possible.
741309`\spad{rationalIfCan(o)} returns the real part if all seven imaginary parts are 0,{} and "failed" otherwise.
741423`\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.
741539`\spad{rationalIfCan(u)} returns a rational number if \spad{u} really is one,{} and "failed" otherwise.
741645`\spad{rationalIfCan(x)} returns \spad{x} as a finite rational number if it is one,{} "failed" otherwise.
741761`\spad{rationalIfCan(x)} returns \spad{x} as a finite rational number if it is one and "failed" otherwise.
741876`\spad{rationalize_ir(irf,{} k1)} eliminates square root \spad{k1} from the integration result.
741989`\spad{rationalPoint?(a,{} b)} tests if \spad{(x=a,{} y=b)} is on the curve.
742070`\spad{rationalPoint?(a,{} b)} tests if \spad{(x=a,{} y=b)} is on the curve.
742148`\spad{rationalPoints()} returns the list of all the affine rational points.
742232`\spad{rationalPoints()} returns the list of all the affine rational points.
742326`\spad{rationalPower(f(x))} returns \spad{r} where the Puiseux series \spad{f(x) = g(x^r)}.
742431`\spad{rational_reconstruction(r)} reconstructs vector of rational functions based on information stored in reconstructor.
742588`\spad{rational_reconstruction(r)} reconstructs vector of rational functions based on information stored in reconstructor.
742749`\spad{rational_reconstruction(x,{} y,{} i,{} j)} finds rational number \spad{r/s} such that \spad{r/s = x} modulo \spad{y},{} \spad{|r| <= i} and \spad{q <= j}. Returns "failed" when such \spad{r/s} does not exist.
742898`\spad{rational_reconstruction(x,{} y,{} i,{} j)} finds rational function \spad{r/s} such that \spad{r/s = y} modulo \spad{x},{} \spad{degre(r) <= i},{} \spad{degree(s) \leq j}. Returns "failed" when such \spad{r/s} does not exist.
743059`\spad{ratpart(ir)} returns the rational part of an integration result
743110`\spad{ratPoly(f)} returns a polynomial \spad{p} such that \spad{p} has no algebraic coefficients,{} and \spad{p(f) = 0}.
743196`\spad{ravel(t)} produces a list of components from a tensor such that \indented{2}{\spad{unravel(ravel(t)) = t}.}
743259`right contraction inner product
743312`\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.
743364`\spad{rdHack1(v,{} u,{} n)} \undocumented
743453`ldivide(a,{} \spad{b}) returns [\spad{c},{} \spad{r}] such that a = \spad{c*b} + \spad{r},{} \spad{r} is is of minimal possible degree and homogeneous part of of \spad{r} of maximal degree contains no terms divisible from right by leading term of \spad{b}.
743646`\spad{rdregime(s)} reads in a list from a file with name \spad{s}
743891`\spad{read sequentially} reads one item from the file.
743931`\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.
743980`\spad{read(f,{} key)} reads item with the key \spad{key} from \spad{f}.
744038`\spad{readable?(f)} tests if the named file exist and can it be opened for reading.
744093`\spad{readIfCan read} one item from the file. otherwise returns \spad{"failed"}
744154`\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.
744211`\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.
744274`\spad{readLine!(f)} returns a string of the contents of a line from the file \spad{f}.
744320`\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.
744387`\spad{real?(t)} tests whether \spad{t} is equivalent to the FORTRAN type REAL.
744439`\spad{real?(f)} returns \spad{true} if \spad{f = real f}.
744512`\spad{real?(f)} returns \spad{true} if \spad{f = real f}.
744578`\spad{real(f)} returns the real part of \spad{f} where \spad{f} is a complex function.
744656`\spad{real(f)} returns the real part of \spad{f} where \spad{f} is a complex function.
744715`\spad{real(x)} returns real part of \spad{x}.
744761`\spad{real(o)} extracts real part of octonion \spad{o}.
744808`\spad{real(q)} extracts the real part of quaternion \spad{q}.
744857`\spad{realEigenvalues(m,{} eps)} computes the eigenvalues of the matrix \spad{m} to precision eps. The eigenvalues are expressed as floats or rational numbers depending on the type of eps (float or rational).
744960`\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 eps as floats or rational numbers depending on the type of eps .
745121`\spad{realElementary(f)} rewrites \spad{f} in terms of the 4 fundamental real transcendental elementary functions: \spad{log,{} exp,{} tan,{} atan}.
745198`\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}.
745282`\spad{realLiouvillian(f)} rewrites \spad{f} elementary kernels of \spad{f} in terms 4 fundamental real elementary functions: \spad{log,{} exp,{} tan,{} atan}. Additionally,{} it rewrites Liouvillian functions as indefinite integrals to support better normalization.
745360`\spad{realLiouvillian(f,{} x)} rewrites \spad{f} elementary kernels of \spad{f} in terms 4 fundamental real elementary functions: \spad{log,{} exp,{} tan,{} atan}. Additionally,{} it rewrites Liouvillian functions of \spad{x} as indefinite integrals to support better normalization.
745445`\spad{realRoots(rf,{} eps)} finds the real zeros of a univariate rational function with precision given by eps.
745542`\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 eps. Each solution is expressed as a list of numbers in order corresponding to the variables in \spad{lv}.
745664`\spad{realSolve(lp)} returns the same as \spad{realSolve(ts,{} false,{} false,{} false)}
745787`\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 with respect to \spad{ls}.
745909`\spad{realSolve(ts,{} info?)} returns the same as \spad{realSolve(ts,{} info?,{} false,{} false)}.
746040`\spad{realSolve(lp,{} lv,{} eps)} computes 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 eps.
746148`\spad{realSolve(ts,{} info?,{} check?)} returns the same as \spad{realSolve(ts,{} info?,{} check?,{} false)}.
746287`\spad{realSolve(ts,{} info?,{} check?,{} lextri?)} returns the set of the points in the variety associated with \spad{lp} whose coordinates are all real. Moreover,{} if \spad{info?} is \spad{true} then some information is displayed during decomposition into regular chains. If \spad{check?} is \spad{true} then the result is checked. If \spad{lextri?} is \spad{true} then the lexTriangular algorithm is called from the \spadtype{LexTriangularPackage} constructor (see \spadopFrom{zeroSetSplit}{LexTriangularPackage}(\spad{lp},{} \spad{false})). Otherwise,{} the triangular decomposition is computed directly from the input system by using the \spadopFrom{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 with respect to \spad{ls}.
746434`\spad{realZeros(pol)} returns a list of isolating intervals for all the real zeros of the univariate polynomial \spad{pol}.
746548`\spad{realZeros(pol)} returns a list of isolating intervals for all the real zeros of the univariate polynomial \spad{pol}.
746663`\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}.
746795`\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}.
746928`\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.
747097`\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.
747267`\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}.
747454`\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}.
747642`\spad{recip()} returns \spad{matrix [[0,{} 1],{} [1,{} 0]]} representing the map \spad{x -> 1 / x}.
747689`\spad{recip(m)} = recip() * \spad{m}
747737`\spad{recip(a)} returns the power series reciprocal of \spad{a},{} or "failed" if not possible.
748186`\spad{recip(x)} \undocumented
748285`\spad{recip(x)} \undocumented
748373`\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\spad{'t} exist or cannot be determined (see unitsKnown).
748473`\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\spad{'t} exist or cannot be determined (see unitsKnown).
748531`\spad{recip(x)} computes the multiplicative inverse of \spad{x} or "failed" if \spad{x} is not invertible.
748707`\spad{recip(p,{} ts)} returns the inverse of \spad{p} with respect to \spad{ts} assuming that \spad{p} is invertible with respect to \spad{ts}.
748789`\spad{recip(pol,{} aRoot)} tries to inverse \spad{pol} interpreted as \spad{aRoot}
748898`\spad{reciprocalPolynomial(p)} calculates a polynomial which has exactly the inverses of the non-zero roots of \spad{p} as roots,{} and the same number of 0-roots.
748975`\spad{recolor()},{} uninteresting to top level user; exported in order to compile package.
749186`\spad{reconstruct(r,{} bo)} combines rational reconstruction with removal of common denominators in blocks.
749301`\spad{reconstruct(r,{} n,{} bo,{} po,{} ev)} reconstructs polynomials in \spad{n + 1} variables using information stored in \spad{r}.
749535`\spad{reconstruct(n,{} bo,{} po,{} ev,{} nums,{} dens,{} p)} reconstructs polynomials in \spad{n} + 1 variables from result of rational reconstruction.
749811`\spad{rectangularMatrix(m)} converts a matrix of type \spadtype{Matrix} to a matrix of type \spad{RectangularMatrix}.
749884`\spad{recur(g)} is the function \spad{h} such that \indented{1}{\spad{h(n,{} x)= g(n,{} g(n-1,{} ..g(1,{} x)..))}.}
749979`\spad{recur(g,{} n,{} x)} is \spad{g(n,{} g(n-1,{} ..g(1,{} x)..))}.
750084`\spad{red()} returns the position of the red hue from total hues.
750115`\spad{redmat(m,{} g)} returns a matrix whose entries are those of \spad{m} modulo the ideal generated by the groebner basis \spad{g}
750213`\spad{redPo }\undocumented
750320`\spad{redPol }\undocumented
750406`normalForm(poly,{} \spad{gb}) reduces the polynomial poly modulo the precomputed groebner basis \spad{gb} giving up to a constant factor a canonical representative of the residue class.
750485`\spad{red_pol!(pv,{} rd)} computes remainder of \spad{pv} using reduction data \spad{rd} produced by earlier call to \spad{ini_rdata}.
750568`\spad{redpps(s,{} g)} returns the simplified form of \spad{s} after reducing modulo a groebner basis \spad{g}
750828`\spad{reduce(x)} reduces algebraics in \spad{x}.
750881`\spad{reduce(x)} reduces the algebraics in \spad{x}.
750935`\spad{reduce(f)} produces the equivalence class of \spad{f} in the residue ring
751181`\spad{reduce(x)} reduces \spad{x} modulo current modulus.
751228`\spad{reduce(p)} returns [\spad{q},{} \spad{d}] such that \spad{p}(\spad{x}) = \spad{q}(\spad{x^d}) and \spad{d} is maximal with this property
751500`\spad{reduce(D)} converts \spad{D} to some reduced form (the reduced forms can be different in different implementations).
751564`\spad{reduce(f)} simplifies all the unreduced algebraic numbers present in \spad{f} by applying their defining relations.
751609`\spad{reduce(f)} simplifies all the unreduced algebraic quantities present in \spad{f} by applying their defining relations.
751673`\spad{reduce(frac)} converts the fraction \spad{frac} to an algebra element.
751764`\spad{reduce(up)} converts the univariate polynomial \spad{up} to an algebra element,{} reducing by the \spad{definingPolynomial()} if necessary.
751883`\spad{reduce(r,{} bas)} returns a triple (\spad{p},{} \spad{v},{} \spad{m}) such that \spad{m*r} = sum(bas.\spad{i} * \spad{v}.\spad{i},{} \spad{i=1}..\#bas) + \spad{p}
751990`\spad{reduce(r,{} m)} \undocumented
752078`\spad{reduce(r,{} m)} \undocumented
752156`\spad{reduce(r,{} m)} \undocumented
752401`\spad{reduce(f,{} u)} reduces the binary operation \spad{f} across \spad{u}. For example,{} if \spad{u} is \spad{[x,{} y,{} ...,{} z]} then \spad{reduce(f,{} u)} returns \spad{f(..f(f(x,{} y),{} ...),{} z)}. Note: if \spad{u} has one element \spad{x},{} \spad{reduce(f,{} u)} returns \spad{x}. Error: if \spad{u} is empty.
752717`\spad{reduce(func,{} vec,{} ident)} combines the elements in \spad{vec} using the binary function \spad{func}. Argument ident is returned if the vector is empty.
752809`\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)}.
752875`\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}.
752971`\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}.
753057`\spad{reduce(func,{} vec,{} ident)} combines the elements in \spad{vec} using the binary function \spad{func}. Argument ident is returned if \spad{vec} is empty.
753127`\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))}.
753197`\spad{reduce(f,{} m,{} r)} traverses \spad{m} row by row passing \spad{m}(\spad{i},{} \spad{j}) as first argument to \spad{f}. The second argument to \spad{f} works as accumulator,{} value from previous call is passed to next call. On first call \spad{r} is passed as second argument to \spad{f}. Return value is the last result returned by \spad{f}.
753301`\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}.
753420`\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}.
753501`\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.
753579`\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 \spad{reduce(f,{} u)} if \spad{u} has 2 or more elements. Returns \spad{f(y,{} x)} if \spad{u} has one element \spad{y}. Returns \spad{x} if \spad{u} is empty. For example,{} \spad{reduce(+,{} u,{} 0)} returns the sum of the elements of \spad{u}.
753988`\spad{reduce(p,{} ts,{} redOp,{} redOp?)} returns a polynomial \spad{r} such that \spad{redOp?(r,{} p)} holds for every \spad{p} of \spad{ts} and there exists some product \spad{h} of the initials of the members of \spad{ts} such that \spad{h*p - r} lies in the ideal generated by \spad{ts}. The operation \spad{redOp} must satisfy the following conditions. For every \spad{p} and \spad{q} we have \spad{redOp?(redOp(p,{} q),{} q)} and there exists an integer \spad{e} and a polynomial \spad{f} such that \spad{init(q)^e*p = f*q + redOp(p,{} q)}.
754074`\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 \spad{reduce(f,{} u,{} x)},{} \spad{x} is the identity element of \spad{f}. Same as \spad{reduce(f,{} u,{} x)} when \spad{u} contains no element \spad{z}. Thus the third argument \spad{x} is returned when \spad{u} is empty.
754390`\spad{reduceBasis skips} elements of sigma basis which does not satisfy degree bounds and puts sigma-basis into canonical form.
754688`\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.
754852`\spad{reduceByQuasiMonic(p,{} ts)} returns the same as \spad{remainder(p,{} collectQuasiMonic(ts)).polnum}.
755074`\spad{reduced?(a,{} b)} returns \spad{true} iff \spad{degree(a,{} mvar(b)) < mdeg(b)}.
755148`\spad{reduced?(q,{} lp)} returns \spad{true} iff \spad{reduced?(q,{} p)} holds for every \spad{p} in \spad{lp}.
755310`\spad{reduced?(p,{} ts,{} redOp?)} returns \spad{true} iff \spad{p} is reduced with respect to \spad{ts} in the sense of the operation \spad{redOp?},{} that is if for every \spad{t} in \spad{ts} \spad{redOp?(p,{} t)} holds.
755395`\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,{} ...])}.
755473`\spad{reducedDiscriminant(up)} \undocumented
755562`\spad{reducedForm(x)} puts the continued fraction \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,{} ...])}.
755617`\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}.
756725`\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}.
757033`\spad{reducedSystem(A,{} ld)} returns a matrix of constants \spad{B} such that \spad{A x = 0} and \spad{B x = 0} have the same solutions over constants.
758328`\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}.
758440`\spad{reducedSystem(A,{} v,{} ld)} returns matrix of constants \spad{B} and vector of constants \spad{w} such that \spad{A x = v} and \spad{B x = w} have the same solutions over constants.
758571`\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}.
758665`\spad{reduceLODE(op,{} [g1,{} ...,{} gn])} returns \spad{[m,{} [v1,{} ...,{} vn]]} such that any solution in \spad{A} of \spad{op z = c1*g1 + ... + cn*gn} where \spad{ci} are constants satisfy the differential system \spad{M.z = c1*v1 + ... + cn*vn}
758772`\spad{reduceMod(sys1,{} sys2)} reduces the system \spad{sys1} modulo the system \spad{sys2}.
758933`\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}.
758991`\spad{ReduceOrder(op,{} [f1,{} ...,{} fk])} returns \spad{[op1,{} [g1,{} ...,{} gk]]} such that for any solution \spad{z} of \spad{op1 z = 0},{} \spad{y = gk \int(g_{k-1} \int(... \int(g1 \int z)...))} is a solution of \spad{op y = 0}. Each \spad{\spad{fi}} must satisfy \spad{op \spad{fi} = 0}.
759077`\spad{reduction(p,{} prime)} reduces the polynomial \spad{p} modulo prime of \spad{R}. Note: this function is exported only because it\spad{'s} conditional.
759131`\spad{reduction(f,{} p)} reduces the coefficients of the polynomial \spad{f} modulo the prime \spad{p}.
759202`\spad{reduction(u,{} pol)} computes the symmetric reduction of \spad{u} mod pol
759267`\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.
759343`\spad{reductum(u)} returns \spad{u} minus its leading monomial returns zero if handed the zero element.
759414`\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.
759462`\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.
759528`\spad{reductum(x)} \undocumented
759599`\spad{reductum(x)} \undocumented
759654`\spad{reductum(p)} returns \spad{p} minus its leading term. An error is produced if \spad{p} is zero.
759904`\spad{reductum(p,{} v)} returns the reductum of \spad{p},{} where \spad{p} is viewed as a univariate polynomial in \spad{v}.
759972`attempt to simplify theory apply recursively to subnodes normally this should not be necessary since logic values are interpreted when constructed
760007`beta reduction - apply beta reduction recusivly to all subnodes
760046`attempt to simplify terms
760093`attempt to simplify terms
760140`weak reduction - apply this combinator to rearrange its subnodes then apply recursively to its subnodes.
760187`\spad{ref(n)} creates a pointer (reference) to the object \spad{n}.
760226`actual value of generators is not important,{} it is only important that they correspond to the appropriate entries in the relations. Therefore we can refactor the generators without changing the group represented.
760275`add \spad{'n'} to all indexes without changing the structure of this simplicial complex.
760360`adds \spad{'n'} to each index. Used to refactor simplexes so that they don\spad{'t} overlap.
760431`\spad{refine!(f)} refines \spad{f} using non-linear techniques.
760488`\spad{refine(x)} \undocumented
760524`\spad{refine(p)} performs a refinement on the plot \spad{p}
760558`\spad{refine(rootChar)} shrinks isolating interval around \spad{rootChar}
760645`\spad{refine!(f,{} flg)} refines the underlying admissible admissible linear system using simple and linear techniques and if flg=true also non-linear techniques (Groebner basis).
760710`\spad{refine(p,{} x)} \undocumented{}
760775`\spad{refine(u,{} fn)} is used to apply the function \userfun{\spad{fn}} to each factor of \spad{u} and then build a new factored object from the results. For example,{} if \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)}.
760870`\spad{refine(x,{} r)} \undocumented
760927`\spad{refine(x,{} r)} \undocumented
760982`\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.
761160`\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.
761339`\spad{refine(pol,{} int,{} range)} takes a univariate polynomial \spad{pol} and and isolating interval \spad{int} containing exactly one real root of \spad{pol}; the operation returns an isolating interval which is contained within range,{} or "failed" if no such isolating interval exists.
761570`\spad{refine(pol,{} int,{} range)} takes a univariate polynomial \spad{pol} and and isolating interval \spad{int} which must contain exactly one real root of \spad{pol},{} and returns an isolating interval which is contained within range,{} or "failed" if no such isolating interval exists.
761802`\spad{refined?(f)} is \spad{f} represented by a refined ALS?
761866`\spad{refinementEquations(f,{}i_min,{}i_max,{}k_rows,{}flg_u,{}flg_r)} for debugging purposes (interface LINPEN)
762026`\spad{refinementGroebner(f,{}i_min,{}i_max,{}k_rows,{}flg_u,{}flg_r)} computes a Groebner basis for the ideal generated by the equations for creating a zero block with \spad{k} rows within the pivot block \spad{i_min}..\spad{i_max} and conditions to guarantee invertible transformations.
762185`\spad{refinementSolve(f,{}i_min,{}i_max,{}k_rows,{}flg_u,{}flg_r)} Computes a list of solutions (for the entries in transformation matrices) to create a lower left block of zeros with \spad{k} rows in the pivot block \spad{i_min}..\spad{i_max}.
762357`\spad{refinementTransformations(f,{}i_min,{}i_max,{}sol)} for debugging purposes (interface LINPEN)
762514`\spad{refineUR!(f)} uses linear techniques to create upper right blocks of zeros in staircase form (as far as possible).
762573`\spad{refineUR!(f,{}k)} uses linear techniques to create an upper right block of zeros with \spad{k} rows (if possible).
762651`\spad{regime(y,{} c,{} w,{} p,{} r,{} rm,{} m)} returns a regime,{} a list of polynomials specifying the consistency conditions,{} a particular solution and basis representing the general solution of the parametric linear system \spad{c} \spad{z} = \spad{w} on that regime. The regime returned depends on the subdeterminant \spad{y}.det and the row and column indices. The solutions are simplified using the assumption that the system has rank \spad{r} and maximum rank \spad{rm}. The list \spad{p} represents a list of list of factors of polynomials in a groebner basis of the ideal generated by higher order subdeterminants,{} and ius used for the simplification. The mode \spad{m} distinguishes the cases when the system is homogeneous,{} or the right hand side is arbitrary,{} or when there is no new right hand side variables.
763036`\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".
763114`\spad{regular?(f)} is \spad{f} a regular element?
763178`\spad{regularRepresentation(x)} returns the matrix representation of the permutation \spad{permutationRep(x)}
763327`\spad{regularRepresentation(a)} returns the matrix \spad{m} of the linear map defined by left multiplication by \spad{a} with respect to the fixed basis. That is for all \spad{x} we have \spad{coordinates(a*x) = m*coordinates(x)}.
763561`\spad{regularRepresentation(a,{} basis)} returns the matrix \spad{m} of the linear map defined by left multiplication by \spad{a} with respect to the basis \spad{basis}. That is for all \spad{x} we have \spad{coordinates(a*x,{} basis) = m*coordinates(x,{} basis)}.
763647`re-index so that indexes start at 1 and are then consecutive.
763691`\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)}.}
763764`\spad{relationsIdeal(polyList)} returns the ideal of relations among the polynomials in \spad{polyList}.
763940`\spad{relationsInGenerators(gp)} computes relations between generators.
764022`\spad{relationsInStrongGenerators(gp)} computes relations between strong generators.
764110`\spad{relativeApprox(n,{} p)} gives a relative approximation of \spad{n} that has precision \spad{p}
764187`\spad{relativeApprox(exp,{} c,{} p) = a} is relatively close to exp as a polynomial in \spad{c} up to precision \spad{p}
764308`\spad{approximate(term,{} root,{} prec)} gives an approximation of \spad{term} over \spad{root} with precision \spad{prec}
764420`\spad{relerror(x,{} y)} computes the absolute value of \spad{(x - y)/y},{} when \spad{y \~= 0}.
764459`\spad{f rem g} creates the equivalent infix form.
764584`\spad{x rem y} is the same as \spad{divide(x,{} y).remainder}. See \spadfunFrom{divide}{EuclideanDomain}.
764628`\spad{a rem b} returns the remainder of \spad{a} and \spad{b}.
764770`\spad{remainder(a,{} ps)} returns \spad{[c,{} b,{} r]} such that \spad{b} is fully reduced in the sense of Groebner bases with respect to \spad{ps} and \spad{r*a - c*b} lies in the ideal generated by \spad{ps}. Furthermore,{} if \spad{R} is a \spad{gcd}-domain,{} \spad{b} is primitive.
764889`Polynomial remainder
765051`\spad{RemainderList(p)} returns the regular part of \spad{p} as a list of terms.
765143`\spad{remap_variables(p,{} lv1,{} lv2)} replaces corresponding variables from \spad{l1} by variables from \spad{lv2}. Assumes that \spad{lv1} and \spad{lv2} have the same length and that \spad{p} has variables in \spad{lv1}.
766133`\spad{remove!(s,{} a)} replaces a by remove(\spad{s},{} a)
766201`\spad{remove(s,{} a)} returns the splitting tree obtained from a by removing every sub-tree \spad{b} such that \spad{value(b)} and \spad{s} have the same value,{} condition and status.
766268`\spad{remove!(f,{} key)} removes item with the key \spad{key} from \spad{f}.
766329`\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,{} \spad{remove!(k,{}t)} returns "failed".
766410`\spad{remove(p,{} u)} returns a copy of \spad{u} removing all elements \spad{x} such that \spad{p(x)} is \spad{true}. Note: \spad{remove(p,{} u) = [x for x in u | not p(x)]}.
766488`\spad{remove!(p,{} d)} destructively changes dictionary \spad{d} by removing all entries \spad{x} such that \spad{p(x)} is \spad{true}.
766577`\spad{remove!(p,{} u)} destructively removes all elements \spad{x} of \spad{u} such that \spad{p(x)} is \spad{true}.
766649`\spad{remove(f,{} st)} returns a stream consisting of those elements of stream st which do not satisfy the predicate \spad{f}. Note: \spad{remove(f,{} st) = [x for x in st | not f(x)]}.
766714`\spad{remove(x,{} u)} returns a copy of \spad{u} with all elements equal to \spad{x} removed. Note: \spad{remove(x,{} u) = [y for y in u | y ~= x]}.
766803`\spad{remove!(x,{} d)} destructively changes dictionary \spad{d} by removing all entries \spad{y} such that \spad{y = x}.
766903`\spad{remove!(x,{} u)} destructively removes all values \spad{x} from \spad{u}.
766980`\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.
767042`\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.
767105`\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.
767156`\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.
767208`\spad{removeChild!(n,{} c)} removes the specified child node \spad{'c'} below node \spad{'n'}
767258`\spad{removeConstantTerm(f,{} x)} returns \spad{f} minus any additive constant with respect to \spad{x}.
767349`\spad{removeCoshSq(f)} converts every \spad{cosh(u)^2} appearing in \spad{f} into \spad{1 - sinh(u)^2},{} and also reduces higher powers of \spad{cosh(u)} with that formula.
767417`\spad{removeCosSq(f)} converts every \spad{cos(u)^2} appearing in \spad{f} into \spad{1 - sin(u)^2},{} and also reduces higher powers of \spad{cos(u)} with that formula.
767484`\spad{remove_denoms(bo,{} n,{} d)} remove common denominators in blocks. \spad{n} is vector of numerators,{} \spad{d} is vector of denomiantors,{} \spad{bo(i)} contains starting index of block number \spad{i}.
767631`\spad{remove_denoms(offsets,{} nums,{} denoms,{} p)} removes common denominator from vectors of rational functions. Several vectors of rational functions are packed into \spad{nums} (storing numerators) and dens (storing denominators) Vector \spad{i} starts at position \spad{offsets}(\spad{i}). Computations are done modulo \spad{p}.
767961`\spad{removeDuplicates(u)} returns a copy of \spad{u} with all duplicates removed.
768058`\spad{removeDuplicates!(u)} destructively removes duplicates from \spad{u}.
768143`\spad{removeDuplicates!(d)} destructively removes any duplicate values in dictionary \spad{d}.
768202`\spad{removeHandler!(n,{} op)} removes any handler from an internal data structure (for the pair \spad{(n,{} op)} such that afterwards \spad{knownHandler?(x,{} n,{} op)} returns \spad{false}.
768283`\spad{removeIrreducibleRedundantFactors(lp,{} lq)} returns the same as \spad{irreducibleFactors(concat(lp,{} lq))} assuming that \spad{irreducibleFactors(lp)} returns \spad{lp} up to replacing some polynomial \spad{pj} in \spad{lp} by some polynomial \spad{qj} associated to \spad{pj}.
768467`\spad{removeRedundantFactors(lp)} returns \spad{lq} such that if \spad{lp = [p1,{} ...,{} pn]} and \spad{lq = [q1,{} ...,{} qm]} then the product \spad{p1*p2*...*pn} vanishes iff the product \spad{q1*q2*...*qm} vanishes,{} and the product of degrees of the \spad{\spad{qi}} is not greater than the one of the \spad{pj},{} and no polynomial in \spad{lq} divides another polynomial in \spad{lq}. In particular,{} polynomials lying in the base ring \spad{R} are removed. Moreover,{} \spad{lq} is sorted with respect to \spad{infRittWu?}. Furthermore,{} if \spad{R} is \spad{gcd}-domain,{} the polynomials in \spad{lq} are pairwise without common non trivial factor.
768563`\spad{removeRedundantFactors(lp,{} lq)} returns the same as \spad{removeRedundantFactors(concat(lp,{} lq))} assuming that \spad{removeRedundantFactors(lp)} returns \spad{lp} up to replacing some polynomial \spad{pj} in \spad{lp} by some polynomial \spad{qj} associated to \spad{pj}.
768667`\spad{removeRedundantFactors(lp,{} q)} returns the same as \spad{removeRedundantFactors(cons(q,{} lp))} assuming that \spad{removeRedundantFactors(lp)} returns \spad{lp} up to replacing some polynomial \spad{pj} in \spad{lp} by some some polynomial \spad{qj} associated to \spad{pj}.
768765`\spad{removeRedundantFactors(p,{} q)} returns the same as \spad{removeRedundantFactors([p,{} q])}
768857`\spad{removeRedundantFactors(lp,{} lq,{} remOp)} returns the same as \spad{concat(remOp(removeRoughlyRedundantFactorsInPols(lp,{} lq)),{} lq)} assuming that \spad{remOp(lq)} returns \spad{lq} up to similarity.
768980`\spad{removeRedundantFactorsInContents(lp,{} lf)} returns \spad{newlp} where \spad{newlp} is obtained from \spad{lp} by removing in the content of every polynomial of \spad{lp} any non trivial factor of any polynomial \spad{f} in \spad{lf}. Moreover,{} squares over \spad{R} are first removed in the content of every polynomial of \spad{lp}.
769110`\spad{removeRedundantFactorsInPols(lp,{} lf)} returns \spad{newlp} where \spad{newlp} is obtained from \spad{lp} by removing in every polynomial \spad{p} of \spad{lp} any non trivial factor of any polynomial \spad{f} in \spad{lf}. Moreover,{} squares over \spad{R} are first removed in every polynomial \spad{lp}.
769236`\spad{removeRepeats!(u)} destructively replaces runs of consecutive equal elements of \spad{u} by single elements.
769348`\spad{removeRoughlyRedundantFactorsInContents(lp,{} lf)} returns \spad{newlp}where \spad{newlp} is obtained from \spad{lp} by removing in the content of every polynomial of \spad{lp} any occurrence of a polynomial \spad{f} in \spad{lf}. Moreover,{} squares over \spad{R} are first removed in the content of every polynomial of \spad{lp}.
769485`\spad{removeRoughlyRedundantFactorsInPol(p,{} lf)} returns the same as removeRoughlyRedundantFactorsInPols([\spad{p}],{} \spad{lf},{} \spad{true})
769589`\spad{removeRoughlyRedundantFactorsInPols(lp,{} lf)} returns \spad{newlp}where \spad{newlp} is obtained from \spad{lp} by removing in every polynomial \spad{p} of \spad{lp} any occurrence of a polynomial \spad{f} in \spad{lf}. This may involve a lot of exact-quotients computations.
769706`\spad{removeRoughlyRedundantFactorsInPols(lp,{} lf,{} opt)} returns the same as \spad{removeRoughlyRedundantFactorsInPols(lp,{} lf)} if \spad{opt} is \spad{false} and if the previous operation does not return any non null and constant polynomial,{} else return \spad{[1]}.
769831`\spad{removeRowsColumns(f,{} lst_row,{} lst_col)} returns a new system with the specified rows and columns removed. The number of rows and columns have to be the same!
769948`\spad{removeRowsColumns(p,{} lst_row,{} lst_col)} returns a new pencil with submatrices specified by the complement of the list of rows and columns.
770072`\spad{removeSinhSq(f)} converts every \spad{sinh(u)^2} appearing in \spad{f} into \spad{1 - cosh(u)^2},{} and also reduces higher powers of \spad{sinh(u)} with that formula.
770140`\spad{removeSinSq(f)} converts every \spad{sin(u)^2} appearing in \spad{f} into \spad{1 - cos(u)^2},{} and also reduces higher powers of \spad{sin(u)} with that formula.
770207`\spad{removeSquaresIfCan(lp)} returns \spad{removeDuplicates [squareFreePart(p)\$P for p in lp]} if \spad{R} is \spad{gcd}-domain else returns \spad{lp}.
770299`\spad{removeSuperfluousCases(llpwt)} is an internal subroutine,{} exported only for development.
770444`\spad{removeSuperfluousCases(llpwt)} is an internal subroutine,{} exported only for development.
770599`\spad{removeSuperfluousQuasiComponents(lts)} removes from \spad{lts} any \spad{ts} such that \spad{subQuasiComponent?(ts,{} us)} holds for another \spad{us} in \spad{lts}.
770702`\spad{removeSuperfluousQuasiComponents(lts)} removes from \spad{lts} any \spad{ts} such that \spad{subQuasiComponent?(ts,{} us)} holds for another \spad{us} in \spad{lts}.
770878`\spad{removeZero(p,{} ts)} returns \spad{0} if \spad{p} reduces to \spad{0} by pseudo-division with respect to \spad{ts} otherwise returns a polynomial \spad{q} computed from \spad{p} by removing any coefficient in \spad{p} reducing to \spad{0}.
770998`\spad{removeZeroes(x)} removes leading zeroes from the representation of the \spad{p}-adic rational \spad{x}. A \spad{p}-adic rational is represented by (1) an exponent and (2) a \spad{p}-adic integer which may have leading zero digits. When the \spad{p}-adic integer has a leading zero digit,{} a 'leading zero' is removed from the \spad{p}-adic rational as follows: the number is rewritten by increasing the exponent by 1 and dividing the \spad{p}-adic integer by \spad{p}. Note: \spad{removeZeroes(f)} removes all leading zeroes from \spad{f}.
771113`\spad{removeZeroes(f(x))} removes leading zeroes from the representation of the Laurent series \spad{f(x)}. A Laurent series is represented by (1) an exponent and (2) a Taylor series which may have leading zero coefficients. When the Taylor series has a leading zero coefficient,{} the 'leading zero' is removed from the Laurent series as follows: the series is rewritten by increasing the exponent by 1 and dividing the Taylor series by its variable. Note: \spad{removeZeroes(f)} removes all leading zeroes from \spad{f}
771263`\spad{removeZeroes(n,{} x)} removes up to \spad{n} leading zeroes from the \spad{p}-adic rational \spad{x}.
771394`\spad{removeZeroes(n,{} f(x))} removes up to \spad{n} leading zeroes from the Laurent series \spad{f(x)}. A Laurent series is represented by (1) an exponent and (2) a Taylor series which may have leading zero coefficients. When the Taylor series has a leading zero coefficient,{} the 'leading zero' is removed from the Laurent series as follows: the series is rewritten by increasing the exponent by 1 and dividing the Taylor series by its variable.
771490`\spad{removeZeros(s,{} k)} removes leading zero terms in \spad{s} with exponent smaller than \spad{k}
771583`\spad{rename!(x,{} name)} changes the way \spad{x} is printed
771640`\spad{rename(x,{} name)} gives a new number that prints as name
771696`\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.
771754`\spad{reorder(p,{} perm)} applies the permutation perm to the variables in a polynomial and returns the new correctly ordered polynomial
771838`\spad{reorder(p,{} perm)} applies the permutation perm to the variables in a polynomial and returns the new correctly ordered polynomial
771931`\spad{reorder(p,{} perm)} applies the permutation perm to the variables in a polynomial and returns the new correctly ordered polynomial
772026`\spad{repack1(x,{} a,{} d,{} m)} stores coefficients of \spad{x} in a. \spad{d} is degree of \spad{x}. Corresponding exponents are given by pack_exps.
772123`\spad{repack_polys(k,{} offsets,{} exponents,{} coefficients)} converts polynomials represented as parallel vector of \spad{exponents} in \spad{k} variables and vector of univariate polynomials to parallel vector of \spad{exponents} in \spad{k+1} variables and coefficients.
772350`\spad{repeatedIndex(jv)} returns the multi-index of the jet variable \spad{jv} in repeated index notation.
772496`\spad{repeating(l)} is a repeating stream whose period is the list \spad{l}.
772544`\spad{repeating?(l,{} s)} returns \spad{true} if a stream \spad{s} is periodic with period \spad{l},{} and \spad{false} otherwise.
772619`\spad{repeatUntilLoop(s,{} c)} creates a repeat ... until loop in FORTRAN.
772676`\spad{replace(s,{} i..j,{} t)} replaces the substring \spad{s(i..j)} of \spad{s} by string \spad{t}.
772834`\spad{replaceKthElement(S,{} k,{} p)} replaces the \spad{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.
772950`\spad{representation(f)} returns the element \spad{f} as linear representation (\spad{u},{}A,{}\spad{v}).
773056`\spad{representationType()} returns the type of the representation,{} one of: \spad{prime},{} \spad{polynomial},{} \spad{normal},{} or \spad{cyclic}.
773313`\spad{represents([a1,{} ..,{} an])} returns \spad{a1*v1 + ... + an*vn},{} where \spad{v1},{} ...,{} \spad{vn} are the elements of the fixed basis.
774173`\spad{represents([a1,{} ..,{} an],{} [v1,{} ..,{} vn])} returns \spad{a1*v1 + ... + an*vn}.
774248`\spad{represents([a1,{} ...,{} am],{} [v1,{} ...,{} vm])} returns the linear combination \spad{a1*vm + ... + an*vm}.
774334`\spad{represents([A0,{} ...,{} A(n-1)],{} D)} returns \spad{(A0 + A1 y +...+ A(n-1)*y^(n-1))/D}.
774412`\spad{repSq(v,{} e)} computes \spad{v^e} by repeated squaring,{} interpreting \spad{v} as an element of a normal basis field.
774512`\spad{reseed(n)} restarts the random number generator at \spad{n}.
774569`\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.
774623`\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.
774679`\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".
774727`\spad{resetNew()} resets the internals counters that new() and new(\spad{s}) use to return distinct symbols every time.
774767`\spad{resetNewGreek()} resets the internals counters that newGreek() used to return distinct symbols every time.
774825`\spad{resetVariableOrder()} cancels any previous use of setVariableOrder and returns to the default system ordering.
774896`\spad{reshape(lt,{} ts)} organizes the list of components \spad{lt} into a tensor with the same shape as \spad{ts}.
775029`\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.
775116`\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.
775303`\spad{rest(x)} return \spad{x} without the first entry or error if \spadopFrom{retractable?}{FreeMagma}(\spad{x}) is \spad{true}.
775348`\spad{rest(x)} returns \spad{x} except the first letter.
775389`\spad{rest([l1]*[l2]*...[ln])} returns the list \spad{l2,{} .... ln}.
775527`\spad{rest(u)} returns an aggregate consisting of all but the first element of \spad{u} (equivalently,{} the next node of \spad{u}).
775581`\spad{rest(ts)} returns the polynomials of \spad{ts} with smaller main variable than \spad{mvar(ts)} if \spad{ts} is not empty,{} otherwise returns "failed"
775791`\spad{rest(u,{} n)} returns the \spad{n}th node of \spad{u}. Note: \spad{rest(u,{} 0) = u}.
775864`\spad{result(a)} where \spad{ls} is the leaves list of \spad{a} returns \spad{[[value(s),{} condition(s)]\$VT for s in ls]} if the computations are terminated in \spad{a} else an error is produced.
775938`\spad{resultant(P,{} Q)} returns the resultant of \spad{P} and \spad{Q}
776010`\spad{resultant(a,{} b)} computes the resultant of \spad{a} and \spad{b} where \spad{a} and \spad{b} are assumed to have the same main variable \spad{v} and are viewed as univariate polynomials in \spad{v}.
776100`\spad{resultant(p,{} q)} returns the resultant of the polynomials \spad{p} and \spad{q}.
776257`\spad{resultant(v1,{} v2,{} p)} computes resultant of \spad{v1} and \spad{v2} modulo \spad{p}.
776351`\spad{resultant(p,{} q,{} v)} returns the resultant of the polynomials \spad{p} and \spad{q} with respect to the variable \spad{v}.
776445`\spad{resultantEuclidean(P,{} Q)} carries out the equality \spad{coef1*P + coef2*Q = resultant(P,{} Q)}
776566`\spad{resultantReduit(P,{}Q)} returns the "reduce resultant" of \spad{P} and \spad{Q}.
776660`\spad{resultantReduitEuclidean(P,{} Q)} returns the "reduce resultant" and carries out the equality \spad{coef1*P + coef2*Q = resultantReduit(P,{} Q)}.
777474`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
777544`\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.}
777670`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
777742`\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.}
777872`\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.}
777967`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
778047`\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.}
778183`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
778265`\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.}
778405`\spad{retract(p)} is like \spad{retractIfCan(p)} put yields a hard error,{} if \spad{p} contains further jet variables.
778560`\spad{retract(p)} is like \spad{retractIfCan(p)} put yields a hard error,{} if \spad{p} contains further jet variables.
778637`\spad{retract(de)} returns the system defining the differential equation \spad{de}.
778703`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
778787`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
778873`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
778967`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
779063`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
779147`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
779233`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
779303`\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.}
779519`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
779591`\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.}
779921`\spad{retract(a)} transforms a into an element of \% if possible. Error: if a cannot be made into an element of \%.
782577`\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.}
782665`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
782749`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
782835`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
782929`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
783025`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
783109`\spad{retract(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
783195`\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.
783244`\spad{retract(p)} returns \spad{p} as an element of the current domain,{} if \spad{retractIfCan(p)} does not return "failed",{} otherwise an error is produced.
783404`\spad{retract(p)} returns \spad{p} as an element of the current domain,{} if \spad{retractIfCan(p)} does not return "failed",{} otherwise an error is produced.
783544`\spad{retract(p)} returns \spad{p} as an element of the current domain,{} if \spad{retractIfCan(p)} does not return "failed",{} otherwise an error is produced.
783649`\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}.
783696`\spad{retractable?(p)} tests if \spad{p} is a 0-form,{} \spadignore{i.e.} if degree(\spad{p}) = 0.
783754`\spad{retractable?(df)} tests if differential form \spad{df} is a 0-form,{} \spadignore{i.e.} if degree(\spad{df}) = 0.
783830`\spad{retractable?(x)} tests if \spad{x} is a tree with only one entry.
783889`\spad{retractable?(x)} tests if \spad{x} is a tree with only one entry.
783949`\spad{retractable?([l1]*[l2]*...[ln])} returns \spad{true} iff \spad{n} equals \spad{1}.
784030`\spad{retractable?(a)} tests if \spad{a} can be converted into an object of type \spad{S}.
785183`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
785274`\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.}
785421`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
785514`\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.}
785665`\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.}
785781`\spad{retractIfCan(x)} \undocumented
785930`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
786031`\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.}
786188`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
786291`\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.}
786452`\spad{retractIfCan(p)} tries to write a general expression as a linear function.
786628`\spad{retractIfCan(p)} checks whether \spad{p} depends only on the independent variables. If yes,{} it is coerced.
786811`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
786916`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
787023`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
787138`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
787255`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
787360`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
787467`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
787558`\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.}
787816`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
787909`\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.}
788256`\spad{retractIfCan(a)} transforms a into an element of \% if possible. Returns "failed" if a cannot be made into an element of \%.
792147`\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.}
792256`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
792361`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
792468`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
792583`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
792700`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
792805`\spad{retractIfCan(e)} tries to convert \spad{e} into an ASP,{} checking that \indented{1}{legal Fortran-77 is produced.}
792912`\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.
792982`\spad{retractIfCan(p)} returns \spad{p} as an element of the current domain,{} if all its variables belong to \spad{V}.
793163`\spad{retractIfCan(p)} returns \spad{p} as an element of the current domain,{} if all its variables belong to \spad{V}.
793324`\spad{retractIfCan(p)} returns \spad{p} as an element of the current domain,{} if all its variables belong to \spad{V}.
793450`\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}.
793518`\spad{retract_Q(x)} should be local but conditional
793613`\spad{returns()} creates a representation of a FORTRAN RETURN statement.
793654`\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.
793721`\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.
793779`\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.
793839`\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.
793906`\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.
793971`\spad{returns(e)} creates a representation of a FORTRAN RETURN statement with a returned value.
794038`\spad{returnType!(t)} declares that the return type of he current subprogram in the global symbol table is \spad{t}.
794129`\spad{returnType!(f,{} t)} declares that the return type of subprogram \spad{f} in the global symbol table is \spad{t}.
794227`\spad{returnType!(f,{} t,{} tab)} declares that the return type of subprogram \spad{f} in symbol table tab is \spad{t}.
794327`\spad{returnTypeOf(f,{} tab)} returns the type of the object returned by \spad{f}
794574`\spad{reverse!(l)} reverses the list of monomials forming \spad{l},{} destroying the element \spad{l}.
794627`\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.
794679`\spad{reverse(p)} returns the reverse polynomial of \spad{p}.
794748`\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.
794799`\spad{reverse!(u)} returns \spad{u} with its elements in reverse order.
794900`\spad{reverse(a)} returns a copy of \spad{a} with elements in reverse order.
794971`\spad{reverse(s)} returns segment \spad{s} in reverse order.
795038`implements reverse for a single term by using: grade: 0 1 2 3... multi: 1 1 \spad{-1} \spad{-1}...
795094`\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.
795233`\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.
795299`\spad{revert(a)} computes the inverse of a power series \spad{a} with respect to composition. the series should have constant coefficient 0 and invertible first order coefficient.
795475`\spad{rewriteIdealWithHeadRemainder(lp,{} cs)} returns \spad{lr} such that the leading monomial of every polynomial in \spad{lr} is reduced in the sense of Groebner bases with respect to \spad{cs} and \spad{(lp,{} cs)} and \spad{(lr,{} cs)} generate the same ideal in \spad{(R)^(-1) P}.
795598`\spad{rewriteIdealWithQuasiMonicGenerators(lp,{} redOp?,{} redOp)} returns \spad{lq} where \spad{lq} and \spad{lp} generate the same ideal in \spad{R^(-1) P} and \spad{lq} has rank not higher than the one of \spad{lp}. Moreover,{} \spad{lq} is computed by reducing \spad{lp} with respect to some basic set of the ideal generated by the quasi-monic polynomials in \spad{lp}.
795827`\spad{rewriteIdealWithRemainder(lp,{} cs)} returns \spad{lr} such that every polynomial in \spad{lr} is fully reduced in the sense of Groebner bases with respect to \spad{cs} and \spad{(lp,{} cs)} and \spad{(lr,{} cs)} generate the same ideal in \spad{(R)^(-1) P}.
795946`\spad{rewriteSetByReducingWithParticularGenerators(lp,{} pred?,{} redOp?,{} redOp)} returns \spad{lq} where \spad{lq} is computed by the following algorithm. Chose a basic set with respect to the reduction-test \spad{redOp?} among the polynomials satisfying property \spad{pred?},{} if it is empty then leave,{} else reduce the other polynomials by this basic set with respect to the reduction-operation \spad{redOp}. Repeat while another basic set with smaller rank can be computed. See code. If \spad{pred?} is \spad{quasiMonic?} the ideal is unchanged.
796213`\spad{rewriteSetWithReduction(lp,{} ts,{} redOp,{} redOp?)} returns a list \spad{lq} of polynomials such that \spad{[reduce(p,{} ts,{} redOp,{} redOp?) for p in lp]} and \spad{lp} have the same zeros inside the regular zero set of \spad{ts}. Moreover,{} for every polynomial \spad{q} in \spad{lq} and every polynomial \spad{t} in \spad{ts} \spad{redOp?(q,{} t)} holds and there exists a polynomial \spad{p} in the ideal generated by \spad{lp} and a product \spad{h} of \spad{initials(ts)} such that \spad{h*p - r} lies in the ideal generated by \spad{ts}. The operation \spad{redOp} must satisfy the following conditions. For every \spad{p} and \spad{q} we have \spad{redOp?(redOp(p,{} q),{} q)} and there exists an integer \spad{e} and a polynomial \spad{f} such that \spad{init(q)^e*p = f*q + redOp(p,{} q)}.
796328`\spad{RF2UTS(f)} converts \spad{f} to a Taylor series.
796415`\spad{Rho()} returns symbol for capital greek letter rho.
796465`\spad{rho()} returns symbol for small greek letter rho.
796515`\spad{rhs(f)} returns the right side of \spad{f}
796558`\spad{rhs(r)} returns the right hand side of the rule \spad{r}.
796606`\spad{rhs(eqn)} returns the right hand side of equation \spad{eqn}.
796644`\spad{ricDsolve(op)} returns the rational solutions of the associated Riccati equation of \spad{op y = 0}.
796792`\spad{ricDsolve(op)} returns the rational solutions of the associated Riccati equation of \spad{op y = 0}.
796943`\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.
797110`\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}.
797241`\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.
797411`\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}.
797545`\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.
797695`\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.
797848`\spad{ridHack1(i,{} j,{} k,{} l)} \undocumented
797942`\spad{riemannZeta(z)} is the Riemann Zeta function.
798007`\spad{riemannZeta(z)} is the Riemann Zeta function.
798089`\spad{riemannZeta(z)} is the Riemann Zeta function.
798147`\spad{right(x)} returns right subtree of \spad{x} or error if \spadopFrom{retractable?}{FreeMagma}(\spad{x}) is \spad{true}.
798193`\spad{right(x)} returns right subtree of \spad{x} or error if \spadopFrom{retractable?}{LyndonWord}(\spad{x}) is \spad{true}.
798240`\spad{right(f)} right-justifies form \spad{f} in total space.
798279`\spad{right(a)} returns the right child.
798335`\spad{right(rootChar)} is the right bound of the isolating interval
798428`\spad{right(f,{} n)} right-justifies form \spad{f} within space of width \spad{n}.
798475`\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\spad{'t} know whether \spad{2*a=0} implies \spad{a=0}.
798558`\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\spad{'t} know whether \spad{2*a=0} implies \spad{a=0}.
798750`\spad{rightCharacteristicPolynomial(a)} returns the characteristic polynomial of the right regular representation of \spad{a} with respect to any basis.
798865`\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())}.
798938`\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())}.
799164`\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]))}.
799247`\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\spad{''}.
799360`\spad{rightDivide(a,{} b,{} sigma)} returns the pair \spad{[q,{} r]} such that \spad{a = q*b + r} and the degree of \spad{r} is less than the degree of \spad{b}. This process is called ``right division\spad{''}. \spad{\sigma} is the morphism to use.
799586`\spad{rightExactQuotient(a,{} b)} computes the value \spad{q},{} if it exists such that \spad{a = q*b}.
799801`\spad{rightExtendedGcd(a,{} b)} returns \spad{[c,{} d,{} g]} such that \spad{g = c * a + d * b = rightGcd(a,{} b)}.
800049`\spad{right_ext_ext_GCD(a,{} b)} returns \spad{g,{} c,{} d,{} u,{} v} such that \spad{g = c * a + d * b = rightGcd(a,{} b)},{} \spad{u * a = - v * b = leftLcm(a,{} b)} and matrix \spad{matrix([[c,{} d],{} [u,{} v]])} is invertible.
800189`\spad{rightFactor(f,{}k)} returns the right factor of rank \spad{k} of a polynomial \spad{f} or 1 if it\spad{'s} not possible by linear techniques.
800269`\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.
800394`\spad{rightFamily(f)} prints the right family t=u*A^-1.
800536`\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.
800617`\spad{rightIdentity(p)} returns the right identity matrix.
800761`\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.
800947`\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.
801076`\spad{rightMinimization(f,{} i_min,{} i_max)} tries to apply a right minimization step with respect to the pivot block with the rows/columns (\spad{i_min},{} ...,{} i_max).
801181`\spad{rightMult(a,{} s)} returns \spad{a * s} where \spad{*} is the monoid operation,{} which is assumed non-commutative.
801301`\spad{rightNorm(a)} returns the determinant of the right regular representation of \spad{a}.
801368`\spad{rightOne(eq)} divides by the right hand side.
801439`\spad{rightOne(eq)} divides by the right hand side.
801689`\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}.
801755`\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}.
801881`\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.
801967`\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.
802036`\spad{rightRankPolynomial()} returns the right minimimal polynomial of the generic element
802191`\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.
802306`\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.
802572`\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\spad{'t} exist or cannot be determined (see unitsKnown).
802677`\spad{rightRecip(a)} returns an element,{} which is a right inverse of \spad{a},{} or \spad{"failed"} if such an element doesn\spad{'t} exist or cannot be determined (see unitsKnown).
802825`\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.
803107`\spad{rightRegularRepresentation(a,{} [v1,{} ...,{} vn])} returns the matrix \spad{m} of the linear map defined by right multiplication by \spad{a} with respect to the \spad{R}-module basis \spad{b = [v1,{} ...,{} vn]}. That is for all \spad{x} \spad{coordinates(x*a,{} b) = m*coordinates(x,{} b)}.
803281`\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.
803368`\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.
803537`\spad{rightTrace(a)} returns the trace of the right regular representation of \spad{a}.
803605`\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.
803685`\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.
803932`\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}.
804072`\spad{rightTrim(s,{} cc)} returns \spad{s} with all trailing occurrences of characters in \spad{cc} deleted. For example,{} \spad{rightTrim("(abc)",{} charClass "()")} returns \spad{"(abc"}.
804135`\spad{rightTrim(u,{} x)} returns a copy of \spad{u} with all trailing occurrences of \spad{x} deleted. For example,{} \spad{rightTrim(" abc ",{} char " ")} returns \spad{" abc"}.
804307`\spad{rightUnit()} returns a right unit of the algebra (not necessarily unique),{} or \spad{"failed"} if there is none.
804410`\spad{rightUnits()} returns the affine space of all right units of the algebra,{} or \spad{"failed"} if there is none
804643`\spad{rightUnits()} returns the affine space of all right units of the algebra,{} or \spad{"failed"} if there is none.
804780`\spad{rightZero(eq)} subtracts the right hand side.
804843`\spad{risch_de_ext(n,{} f,{} g,{} x)} returns \spad{[y,{} h,{} p,{} b]} such that \spad{dy/dx + n df/dx y + exp(-nf)dp/dx = 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).
804964`\spad{rischNormalize(f,{} lx)} is rischNormalize([\spad{f}],{} \spad{lx})
805101`\spad{rischNormalize(f,{} x)} is rischNormalize([\spad{f}],{} [\spad{x}]) rischNormalize(\spad{f},{} \spad{x}) returns \spad{[g,{} [k1,{} ...,{} kn],{} [h1,{} ...,{} hn]]} such that \spad{g = normalize(f,{} x)} and each \spad{\spad{ki}} was rewritten as \spad{\spad{hi}} during the normalization.
805232`\spad{rischNormalize(lf,{} lx)} returns \spad{[lg,{} [k1,{} ...,{} kn],{} [h1,{} ...,{} hn]]} such that \spad{lg = normalize(lf,{} lx)} and each \spad{\spad{ki}} was rewritten as \spad{\spad{hi}} during the normalization.
805474`\spad{RittWuCompare(a,{}b)} returns \spad{"failed"} if \spad{a} and \spad{b} have same rank with respect to Ritt and Wu Wen Tsun ordering using the refinement of Lazard,{} otherwise returns \spad{infRittWu?(a,{} b)}.
805569`\spad{rk4(y,{} n,{} x1,{} h,{} derivs)} uses a 4-th order Runge-Kutta method to numerically integrate the ordinary differential equation {\em dy/dx = f(y,{} x)} of \spad{n} variables,{} where \spad{y} is an \spad{n}-vector. Argument \spad{y} is a vector of initial conditions of length \spad{n} which upon exit contains the solution at \spad{x1 + h},{} \spad{n} is the number of dependent variables,{} \spad{x1} is the initial point,{} \spad{h} is the step size,{} and \spad{derivs} is a function which computes the right hand side of the ordinary differential equation. For details,{} see \spadtype{NumericalOrdinaryDifferentialEquations}.
805711`\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 \spadtype{NumericalOrdinaryDifferentialEquations}.
805909`\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 \spadtype{NumericalOrdinaryDifferentialEquations}.
806072`\spad{rk4f(y,{} n,{} x1,{} x2,{} ns,{} derivs)} uses a 4-th order Runge-Kutta method to numerically integrate the ordinary differential equation {\em dy/dx = f(y,{} x)} of \spad{n} variables,{} where \spad{y} is an \spad{n}-vector. Starting with \spad{y} at \spad{x1},{} this function uses \spad{ns} fixed steps of a 4-th order Runge-Kutta integrator to advance the solution vector to \spad{x2} and return the values in \spad{y}. For details,{} see \spadtype{NumericalOrdinaryDifferentialEquations}.
806223`\spad{rk4qc(y,{} n,{} x1,{} step,{} eps,{} yscal,{} derivs,{} t1,{} t2,{} t3,{} t4,{} t5,{} t6,{} t7)} is a subfunction for the numerical integration of an ordinary differential equation {\em dy/dx = f(y,{} x)} of \spad{n} variables,{} where \spad{y} is an \spad{n}-vector using a 4-th order Runge-Kutta method. This function takes a 5-th order Runge-Kutta \spad{step} with monitoring of local truncation to ensure accuracy and adjust stepsize. For details,{} see \spadtype{NumericalOrdinaryDifferentialEquations}.
806522`\spad{rk4qc(y,{} n,{} x1,{} step,{} eps,{} yscal,{} derivs)} is a subfunction for the numerical integration of an ordinary differential equation {\em dy/dx = f(y,{} x)} of \spad{n} variables,{} where \spad{y} is an \spad{n}-vector using a 4-th order Runge-Kutta method. This function takes a 5-th order Runge-Kutta \spad{step} with monitoring of local truncation to ensure accuracy and adjust stepsize. For details,{} see \spadtype{NumericalOrdinaryDifferentialEquations}.
806722`\spad{rmap(f,{} e)} rewrites \spad{e} replacing each kernel \spad{k} in \spad{e} by \spad{f}(\spad{k})
806804`\spad{roman(n)} creates a roman numeral for \spad{n}.
806851`\spad{roman(n)} creates a roman numeral for symbol \spad{n}.
806897`\spad{romberg(fn,{} a,{} b,{} epsrel,{} epsabs,{} nmin,{} nmax)} uses the romberg method to numerically integrate function \spad{fn} over the closed interval \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin} to \spad{nmax}. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
807034`\spad{rombergo(fn,{} a,{} b,{} epsrel,{} epsabs,{} nmin,{} nmax)} uses the romberg method to numerically integrate function \spad{fn} over the open interval from \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin} to \spad{nmax}. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
807172`\spad{root?(x)} \undocumented
807220`\spad{root(f)} creates a form for the square root of form \spad{f}.
807258`\spad{root(f,{} n)} creates a form for the \spad{n}th root of form \spad{f}.
807298`\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)}.
807391`\spad{rootBound(p)} returns a bound on the largest norm of the complex roots of \spad{p}.
807472`\spad{rootFactor(f)} transforms every radical of the form \spad{(a1*...*am)^(1/n)} appearing in \spad{f} into \spad{a^(1/n)*...*am^(1/n)}. This transformation is not in general valid for all complex numbers \spad{a} and \spad{b}.
807659`\spad{rootKerSimp(op,{} f,{} n)} should be local but conditional.
807847`\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}.
808303`\spad{rootOf(p)} returns \spad{y} such that \spad{p(y) = 0}. Error: if \spad{p} has more than one variable \spad{y}.
808368`\spad{rootOf(p)} returns \spad{y} such that \spad{p(y) = 0}. Error: if \spad{p} has more than one variable \spad{y}.
808434`\spad{rootOf(p)} returns \spad{y} such that \spad{p(y) = 0}.
808516`\spad{rootOf(p,{} y)} returns \spad{y} such that \spad{p(y) = 0}. The object returned displays as \spad{'y}.
809074`\spad{rootOf(pol,{} n)} creates the \spad{n}th root for the order of \spad{pol} and gives it unique name
809179`\spad{rootOf(p,{} y)} returns \spad{y} such that \spad{p(y) = 0}. The object returned displays as \spad{'y}.
809268`\spad{rootOf(p,{} y)} returns \spad{y} such that \spad{p(y) = 0}. The object returned displays as \spad{'y}.
809340`\spad{rootOf(pol,{} n)} gives the \spad{n}th root for the order of the Real Closure
809572`\spad{rootOf(pol,{} n,{} name)} creates the \spad{n}th root for the order of \spad{pol} and names it \spad{name}
809688`\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}.
809797`\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}.
809950`\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.
810103`\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.
810258`\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}.
810324`\spad{rootRadius(p,{} errQuot)} calculates the root radius of \spad{p} with a maximal error quotient of {\em errQuot}.
810392`\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}.
810949`\spad{rootsOf(p,{} y)} returns \spad{[y1,{} ...,{} yn]} such that \spad{p(\spad{yi}) = 0}; Note: the returned values \spad{y1},{} ...,{} \spad{yn} contain new symbols which are bound in the interpreter to the respective values. Error: if \spad{p} has more than one variable \spad{y}.
811021`\spad{rootsOf(p)} returns \spad{[y1,{} ...,{} yn]} such that \spad{p(\spad{yi}) = 0}. Note: the returned values \spad{y1},{} ...,{} \spad{yn} contain new symbols which are bound in the interpreter to the respective values. Error: if \spad{p} has more than one variable \spad{y}.
811094`\spad{rootsOf(p)} returns \spad{[y1,{} ...,{} yn]} such that \spad{p(\spad{yi}) = 0}. Note: the returned values \spad{y1},{} ...,{} \spad{yn} contain new symbols which are bound in the interpreter to the respective values.
811457`\spad{rootsOf(p,{} z)} returns \spad{[y1,{} ...,{} yn]} such that \spad{p(\spad{yi}) = 0}; The returned roots contain new symbols \spad{'\%z0},{} \spad{'\%z1} ...; Note: the new symbols are bound in the interpreter to the respective values.
811553`\spad{rootsOf(p,{} y)} returns \spad{[y1,{} ...,{} yn]} such that \spad{p(\spad{yi}) = 0}; The returned roots contain new symbols \spad{'\%z0},{} \spad{'\%z1} ...; Note: the new symbols are bound in the interpreter to the respective values.
811632`\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}.
811692`\spad{rootSum(expr,{} p,{} s)}
811879`\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})).
811927`\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}.
811996`\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}.
812069`\spad{rotatex(r)} returns a dhmatrix for rotation about axis \spad{X} for \spad{r} degrees
812126`\spad{rotatey(r)} returns a dhmatrix for rotation about axis \spad{Y} for \spad{r} degrees
812183`\spad{rotatez(r)} returns a dhmatrix for rotation about axis \spad{Z} for \spad{r} degrees
812312`\spad{roughBase?(ps)} returns \spad{true} iff for every pair \spad{{p,{} q}} of polynomials in \spad{ps} their leading monomials are relatively prime.
812408`\spad{roughBasicSet(lp)} returns the smallest (with Ritt-Wu ordering) triangular set contained in \spad{lp}.
812638`\spad{roughEqualIdeals?(ps1,{} ps2)} returns \spad{true} iff it can proved that \spad{ps1} and \spad{ps2} generate the same ideal in \spad{(R)^(-1) P} without computing Groebner bases.
812821`\spad{roughSubIdeal?(ps1,{} ps2)} returns \spad{true} iff it can proved that all polynomials in \spad{ps1} lie in the ideal generated by \spad{ps2} in \spad{(R)^(-1) P} without computing Groebner bases.
813000`\spad{roughUnitIdeal?(ps)} returns \spad{true} iff \spad{ps} contains some non null element lying in the base ring \spad{R}.
813101`\spad{round(x)} returns integer closest to \spad{x}.
813243`\spad{round x} computes the integer closest to \spad{x}.
813496`\spad{routeArrows(s,{} a,{} b)} gives the shortest route between nodes 'a' and \spad{'b'} as a sequence of arrow indexes. [] if 'a' = \spad{'b'} [0] if it is not possible to go from 'a' to \spad{'b'}
813606`the cumulative weight of a given route. The route is given in terms of a sequence of arrow indexes.
813895`\spad{routeNodes(s,{} a,{} b)} gives the shortest route between nodes 'a' and \spad{'b'} as a sequence of node indexes. [a] if 'a' = \spad{'b'} [] if it is not possible to go from 'a' to \spad{'b'}
814004`the cumulative weight of a given route. The route is given in terms of a sequence of node indexes.
814086`\spad{row(A,{} i)} returns the \spad{i}\spad{-}th row of the matrix \spad{A}.
814255`\spad{row(m,{} i)} returns the \spad{i}th row of the matrix \spad{m}. Error: if the index is outside the proper range.
814332`\spad{row(m,{} i)} returns the \spad{i}th row of \spad{m} error check to determine if index is in proper ranges
814407`\spad{rowEch(m)} computes a modular row-echelon form of \spad{m},{} finding an appropriate modulus.
814484`\spad{rowEchelon(m)} returns the row echelon form of the matrix \spad{m}.
814571`\spad{rowEchelon(m)} returns the row echelon form of the matrix \spad{m}. the result will have entries in the quotient field.
814668`\spad{rowEchelon(m)} returns the row echelon form of the matrix \spad{m}.
814748`\spad{primitiveRowEchelon(A)} computes a row echelon form for the matrix \spad{A}. The algorithm used is fraction-free elimination. It is especially adapted to matrices already close to row echelon form. The transformation matrix,{} the used pivots and the rank of the matrix are also returned.
814870`\spad{rowEchelon(m)} returns the row echelon form of the matrix \spad{m}.
814951`\spad{rowEchelon(m)} returns the row echelon form of the matrix \spad{m}.
815047`\spad{rowEchelon(m)} returns the row echelon form of the matrix \spad{m}.
815144`\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}.
815227`\spad{rowEchelon(m,{} c,{} lv)} returns [\spad{m2},{} \spad{lv2}] such that \spad{m2} is the row echelon form of the matrix \spad{m}. \spad{lv2} is transformed \spad{lv} using \spad{c} as parameter to \spad{apply}.
815365`\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.
815455`\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.
815539`\spad{rowMatrix} returns a single row out of a matrix. The row is put into a one by \spad{N} matrix.
815611`\spad{row_operation_base should} be local,{} but conditional
815736`\spad{row_operation_modular should} be local,{} but conditional
815872`\spad{rows} returns several rows out of a matrix. The rows are stacked into a matrix.
815945`\spad{rows} returns several rows out of a matrix. The rows are stacked into a matrix.
816103`\spad{rowSlice(m)} returns a segment \spad{s} such that for \spad{m} the access \spad{m}(\spad{s},{} \spad{j}) gives the \spad{j}-th column.
816188`\spad{rowSpan(f)} computes the row span for a regular element,{} that is (\spad{u}; uM; \spad{uM^2}; ...) where PAs=Pv with PA = \spad{I}-\spad{M}.
816289`\spad{rquo(x,{} s)} returns the exact right quotient of \spad{x} by \spad{s}.
816348`\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}.
816407`\spad{rquo(x,{} y)} is a bilinear extention of \spad{rquo} from words to \spad{\%}.
816455`\spad{rquo(x,{} w)} returns the right simplification of \spad{x} by \spad{w}.
816516`\spad{rquo(x,{} v)} returns the right simplification of \spad{x} by the variable \spad{v}.
816565`\spad{rquo(x,{} y)} returns the right simplification of \spad{x} by \spad{y}.
816677`\spad{rroot(f,{} n)} returns \spad{[m,{} c,{} r]} such that \spad{f^(1/n) = c * r^(1/m)}.
816803`\spad{rsimp1(a : eI,{} k : Integer)} : Union(eI,{} "failed") returns root of degree \spad{k} of a if such root exists in the field generated by kernels contained in a. Otherwise it returns "failed".
816911`\spad{rsimp(a : eI)} : Union(eI,{} "failed") tries to express a using roots of lower nesting depth. If this fails it returns "failed"
817010`\spad{rspace(n,{} m)} creates rectangular white space,{} \spad{n} wide by \spad{m} high.
817064`\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 is no error check.
817113`\spad{rubiksGroup constructs} the permutation group representing Rubic\spad{'s} Cube acting on integers {\em 10*i+j} for {\em 1 <= i <= 6},{} {\em 1 <= j <= 8}. The faces of Rubik\spad{'s} Cube are labelled in the obvious way Front,{} Right,{} Up,{} Down,{} Left,{} Back and numbered from 1 to 6 in this given ordering,{} the pieces on each face (except the unmoveable center piece) are clockwise numbered from 1 to 8 starting with the piece in the upper left corner. The moves of the cube are represented as permutations on these pieces,{} represented as a two digit integer {\em ij} where \spad{i} is the numer of theface (1 to 6) and \spad{j} is the number of the piece on this face. The remaining ambiguities are resolved by looking at the 6 generators,{} which represent a 90 degree turns of the faces,{} or from the following pictorial description. Permutation group representing Rubic\spad{'s} Cube acting on integers 10*i+j for 1 \spad{<=} \spad{i} \spad{<=} 6,{} 1 \spad{<=} \spad{j} \spad{<=8}. \blankline\begin{verbatim}Rubik's Cube:   +-----+ +-- B   where: marks Side # :               / U   /|/              /     / |         F(ront)    <->    1      L -->  +-----+ R|         R(ight)    <->    2             |     |  +         U(p)       <->    3             |  F  | /          D(own)     <->    4             |     |/           L(eft)     <->    5             +-----+            B(ack)     <->    6                ^                |                DThe Cube's surface:                               The pieces on each side            +---+              (except the unmoveable center            |567|              piece) are clockwise numbered            |4U8|              from 1 to 8 starting with the            |321|              piece in the upper left        +---+---+---+          corner (see figure on the        |781|123|345|          left).  The moves of the cube        |6L2|8F4|2R6|          are represented as        |543|765|187|          permutations on these pieces.        +---+---+---+          Each of the pieces is            |123|              represented as a two digit            |8D4|              integer ij where i is the            |765|              # of the side ( 1 to 6 for            +---+              F to B (see table above ))            |567|              and j is the # of the piece.            |4B8|            |321|            +---+\end{verbatim}
817195`\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}.
817246`\spad{rule(f,{} g,{} [f1,{} ...,{} fn])} creates the rewrite rule \spad{f == eval(eval(g,{} g is f),{} [f1,{} ...,{} fn])},{} that is a rule with left-hand side \spad{f} and right-hand side \spad{g}; The symbols \spad{f1},{} ...,{} \spad{fn} are the operators that are considered quoted,{} that is they are not evaluated during any rewrite,{} but just applied formally to their arguments.
817310`\spad{rules(r)} returns the rules contained in \spad{r}.
817382`\spad{ruleset([r1,{} ...,{} rn])} creates the rule set \spad{{r1,{} ...,{} rn}}.
817456`\spad{rur(lp)} returns the same as \spad{rur(lp,{} true)}
817633`\spad{rur(lp,{} univ?)} returns a rational univariate representation of \spad{lp}. This assumes that \spad{lp} defines a regular triangular \spad{ts} whose associated variety is zero-dimensional over \spad{R}. \spad{rur(lp,{} univ?)} returns a list of items \spad{[u,{} lc]} where \spad{u} is an irreducible univariate polynomial and each \spad{c} in \spad{lc} involves two variables: one from \spad{ls},{} called the coordinate of \spad{c},{} and an extra variable which represents any root of \spad{u}. Every root of \spad{u} leads to a tuple of values for the coordinates of \spad{lc}. Moreover,{} a point \spad{x} belongs to the variety associated with \spad{lp} iff there exists an item \spad{[u,{} lc]} in \spad{rur(lp,{} univ?)} and a root \spad{r} of \spad{u} such that \spad{x} is given by the tuple of values for the coordinates of \spad{lc} evaluated at \spad{r}. If \spad{univ?} is \spad{true} then each polynomial \spad{c} will have a constant leading coefficient with respect to its coordinate. See the example which illustrates the \spadtype{ZeroDimensionalSolvePackage} package constructor.
817818`\spad{rur(ts,{} univ?)} returns a rational univariate representation of \spad{ts}. This assumes that the lowest polynomial in \spad{ts} is a variable \spad{v} which does not occur in the other polynomials of \spad{ts}. This variable will be used to define the simple algebraic extension over which these other polynomials will be rewritten as univariate polynomials with degree one. If \spad{univ?} is \spad{true} then these polynomials will have a constant initial.
817920`\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.
818113`Constructs a \spad{S} combinator
818155`\spad{safeCeiling(x)} returns the integer which is greater than any integer with the same floating point number representation.
818245`\spad{safeFloor(x)} returns the integer which is lower or equal to the largest integer which has the same floating point number representation.
818333`\spad{safety returns} the specified safety or 1 as default.
818417`\spad{safety(d)} specifies the number of values reserved for testing any solutions found. This option is expressed in the form \spad{safety == d}.
818475`\spad{safetyMargin()} returns the number of low weight digits we do not trust in the floating point representation (used by \spadfun{safeCeiling}).
818576`\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}).
818695`\spad{true} if this is the same face although the orientation may be different.
818748`\spad{true} if this is the same face although the orientation may be different
818918`\spad{sample yields} a value of type \%
818960`\spad{sample yields} a value of type \%
818998`\spad{sample yields} a value of type \%
819040`\spad{sample()} returns an object of type \%.
819097`\spad{sample()} returns a sample of \%
819132`\spad{samplePoint(c)} returns the sample point of \spad{c}
819194`\spad{samplePoint(c)} returns the sample point of \spad{c}
819264`\spad{satisfy?(v,{} p)} returns \spad{f}(\spad{v}) where \spad{f} is the predicate attached to \spad{p}.
819335`\spad{satisfy?([v1,{} ...,{} vn],{} p)} returns \spad{f(v1,{} ...,{} vn)} where \spad{f} is the top-level predicate attached to \spad{p}.
819412`\spad{satisfy?(r,{} p)} returns \spad{true} if the matches satisfy the top-level predicate of \spad{p},{} \spad{false} if they don\spad{'t},{} and "failed" if not enough variables of \spad{p} are matched in \spad{r} to decide.
819500`\spad{saturate(I,{} f)} is the saturation of the ideal \spad{I} with respect to the multiplicative set generated by the polynomial \spad{f}.
819575`\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]}.
819663`\spad{save()} creates a representation of a SAVE statement.
819701`\spad{say(l)} sends a list of strings \spad{l} to output.
819756`\spad{say(s)} sends a string \spad{s} to output.
819805`\spad{sayLength(l)} returns the length of a list of strings \spad{l} as an integer.
819869`\spad{sayLength(s)} returns the length of a string \spad{s} as an integer.
819927`\spad{scalar?(f)} is \spad{f} scalar?
819990`\spad{scalar?(f,{} i,{} j)} is A(\spad{i},{}\spad{j}) scalar?
820091`\spad{scalarMatrix(r)} returns an \spad{n}-by-\spad{n} matrix with \spad{r}\spad{'s} on the diagonal and zeroes elsewhere.
820240`\spad{scalarMatrix(n,{} r)} returns an \spad{n}-by-\spad{n} matrix with \spad{r}\spad{'s} on the diagonal and zeroes elsewhere.
820320`\spad{scalarTypeOf(t)} returns the FORTRAN data type of \spad{t}
820406`\spad{scale(k)} returns \spad{matrix [[k,{} 0],{} [0,{} 1]]} representing the map \spad{x -> k * x}.
820454`\spad{scale(m,{} h)} returns \spad{scale(h) * m} (see \spadfunFrom{shift}{MoebiusTransform}).
820504`\spad{scale(sx,{} sy,{} sz)} returns a dhmatrix for scaling in the \spad{X},{} \spad{Y} and \spad{Z} directions
820563`\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.
820645`\spad{scaleALS(f,{} alpha)} computes alpha*f by scaling the right hand side of the ALS for \spad{f}.
820705`\spad{scaleRoots(p,{} c)} returns the polynomial which has \spad{c} times the roots of \spad{p}.
820779`\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 ident.
820888`\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)]}.
820958`\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),{} ...]}.
821073`\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),{} ...]}.
821173`\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 ident.
821249`\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))}.
821325`\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),{} ...]}.
821404`\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),{} ...]}.
821480`\spad{ScanArabic(s)} forms an integer from an Arabic numeral string \spad{s}.
821546`\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.
821613`\spad{ScanFloatIgnoreSpacesIfCan(s)} tries to form a floating point number from the string \spad{s} ignoring any spaces.
821701`\spad{scanOneDimSubspaces(basis,{} n)} gives a canonical representative of the {\em n}\spad{-}th one-dimensional subspace of the vector space generated by the elements of {\em basis},{} all from {\em R^n}. The coefficients of the representative are of shape {\em (0,{} ...,{} 0,{} 1,{} *,{} ...,{} *)},{} {\em *} in \spad{R}. If the size of \spad{R} is \spad{q},{} then there are {\em (q^n-1)/(q-1)} of them. We first reduce \spad{n} modulo this number,{} then find the largest \spad{i} such that {\em +/[q^i for i in 0..i-1] <= n}. Subtracting this sum of powers from \spad{n} results in an \spad{i}-digit number to \spad{basis} \spad{q}. This fills the positions of the stars.
821830`\spad{ScanRoman(s)} forms an integer from a Roman numeral string \spad{s}.
821895`\spad{schema(P,{} Q)} returns the list of degrees of non zero subresultants of \spad{P} and \spad{Q}.
821987`\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 coefficient of \spad{x^(n-1)}} divided by {\em n times coefficient of \spad{x^n}}.
822063`\spad{screenCoords(pt)} returns screen coordinates as a list.
822129`\spad{screenCoordX(pt)} returns the \spad{'x'}(left to right) screen coordinate.
822189`\spad{screenCoordY(pt)} returns the \spad{'y'}(bottom to top) screen coordinate.
822249`\spad{screenCoordZ(pt)} returns the \spad{'z'}(out from screen) screen coordinate.
822309`\spad{screenResolution()} returns the screen resolution
822358`\spad{screenResolution()} returns the screen resolution \spad{n}.
822419`\spad{screenResolution(n)} sets the screen resolution to \spad{n}.
822487`\spad{screenResolution3D()} returns the screen resolution for a 3d graph.
822540`\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,{} [],{} []])}.
822599`\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}.
822755`\spad{scripted?(s)} is \spad{true} if \spad{s} has been given any scripts.
822800`Formats super- and subscripts also presuper and presub. \spad{scripts(p)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats the first argument with respect to the precedence \spad{p}. The other arguments are interpreted as subscript,{} superscript,{} presuperscript,{} and presubscript (in this order). Outer parentheses are added if \spad{p < prec}.
822890`\spad{scripts(s)} returns all the scripts of \spad{s}.
823045`\spad{scripts(f,{} l)} where \spad{l} is \spad{[sub,{} super,{} presuper,{} presub]} creates a form for \spad{f} with scripts on all 4 corners. If \spad{l} has less than 4 elements corresponding scripts are absent.
823094`\spad{se2rfi(l)} converts \spad{l} to target domain
823204`\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,{} \spad{search(k,{}t)} returns "failed".
823284`\spad{sec(x)} applies the secant operator to \spad{x}
823448`\spad{sec(st)} computes secant of a power series \spad{st}.
823532`\spad{sec(st)} computes secant of a power series \spad{st}.
823630`\spad{sec(z)} returns the secant of Laurent series \spad{z}.
823717`\spad{sec(z)} returns the secant of a Puiseux series \spad{z}.
823813`\spad{sec(x)} returns the secant of \spad{x}.
823869`\spad{sec2cos(f)} converts every \spad{sec(u)} appearing in \spad{f} into \spad{1/cos(u)}.
823932`\spad{sech(x)} applies the hyperbolic secant operator to \spad{x}
824096`\spad{sech(st)} computes the hyperbolic secant of a power series \spad{st}.
824181`\spad{sech(st)} computes the hyperbolic secant of a power series \spad{st}.
824280`\spad{sech(z)} returns the hyperbolic secant of Laurent series \spad{z}.
824368`\spad{sech(z)} returns the hyperbolic secant of a Puiseux series \spad{z}.
824465`\spad{sech(x)} returns the hyperbolic secant of \spad{x}.
824519`\spad{sech2cosh(f)} converts every \spad{sech(u)} appearing in \spad{f} into \spad{1/cosh(u)}.
824584`\spad{sechIfCan(z)} returns sech(\spad{z}) if possible,{} and "failed" otherwise.
824666`\spad{secIfCan(z)} returns sec(\spad{z}) if possible,{} and "failed" otherwise.
824800`\spad{second(x)} selects second component of the product
824842`\spad{second(u)} returns the second element of \spad{u}. Note: \spad{second(u) = first(rest(u))}.
824898`\spad{seed()} returns the current seed value.
824949`\spad{seedRandom()} seeds the pseudo random number generator with a new random seed. Note that internally there is only one (global) pseudo random number generator as a source for random data. All other random objects are derived from that source.
824992`\spad{SEGMENT(x)} creates the prefix form: \spad{x..}.
825033`\spad{l..} produces a half open segment,{} that is,{} one with no upper bound.
825083`\spad{segment(l)} is an alternate way to construct the segment \spad{l..}.
825133`\spad{segment(segb)} returns the segment from the right hand side of the \spadtype{SegmentBinding}. For example,{} if \spad{segb} is \spad{v=a..b},{} then \spad{segment(segb)} returns \spad{a..b}.
825190`\spad{SEGMENT(x,{} y)} creates the infix form: \spad{x..y}.
825233`\spad{l..h} creates a segment with \spad{l} and \spad{h} as the endpoints.
825284`\spad{segment(i,{} j)} is an alternate way to create the segment \spad{i..j}.
825335`\spad{select(x,{} n)} returns the \spad{n}-th element of tuple \spad{x}. tuples are 0-based
825769`\spad{select(p,{} u)} returns a copy of \spad{u} containing only those elements such \spad{p(x)} is \spad{true}. Note: \spad{select(p,{} u) = [x for x in u | p(x)]}.
825847`\spad{select!(p,{} d)} destructively changes dictionary \spad{d} by removing all entries \spad{x} such that \spad{p(x)} is not \spad{true}.
825936`\spad{select!(p,{} u)} destructively changes \spad{u} by keeping only values \spad{x} such that \spad{p(x)}.
826008`\spad{select(f,{} st)} returns a stream consisting of those elements of stream st satisfying the predicate \spad{f}. Note: \spad{select(f,{} st) = [x for x in st | f(x)]}.
826073`\spad{select(p,{} t)} returns \spad{[x for x in t | p(x)]}.
826132`\spad{select(ts,{} v)} returns the polynomial of \spad{ts} with \spad{v} as main variable,{} if any.
826210`\spad{selectAndPolynomials(lpred?,{} ps)} returns \spad{gps,{} bps} where \spad{gps} is a list of the polynomial \spad{p} in \spad{ps} such that \spad{pred?(p)} holds for every \spad{pred?} in \spad{lpred?} and \spad{bps} are the other ones.
826356`\spad{selectOrPolynomials(lpred?,{} ps)} returns \spad{gps,{} bps} where \spad{gps} is a list of the polynomial \spad{p} in \spad{ps} such that \spad{pred?(p)} holds for some \spad{pred?} in \spad{lpred?} and \spad{bps} are the other ones.
826501`\spad{selectPolynomials(pred?,{} ps)} returns \spad{gps,{} bps} where \spad{gps} is a list of the polynomial \spad{p} in \spad{ps} such that \spad{pred?(p)} holds and \spad{bps} are the other ones.
826638`\spad{semicolonSeparate(l)} creates the form separating the elements of \spad{l} by semicolons.
826695`\spad{semiDegreeSubResultantEuclidean(P,{} Q,{} d)} returns a subresultant \spad{S_i} of degree \spad{d} and carries out the equality \spad{... P + coef2*Q = S_i}. Warning: \spad{degree(P) >= degree(Q)}.
826843`\spad{discriminantEuclidean(P)} carries out the equality \spad{... P + coef2 * D(P) = discriminant(P)}. Warning: \spad{degree(P) >= degree(Q)}.
826958`\spad{semiIndiceSubResultantEuclidean(P,{} Q,{} i)} returns the subresultant \spad{S_i(P,{} Q)} and carries out the equality \spad{... P + coef2*Q = S_i(P,{} Q)} Warning: \spad{degree(P) >= degree(Q)}.
827106`\spad{semiLastSubResultantEuclidean(P,{} Q)} computes the last non zero subresultant \spad{S} and carries out the equality \spad{... P + coef2*Q = S}. Warning: \spad{degree(P) >= degree(Q)}.
827233`\spad{semiResultantEuclidean1(P,{} Q)} carries out the equality \spad{coef1.P + ... Q = resultant(P,{} Q)}.
827348`\spad{semiResultantEuclidean2(P,{} Q)} carries out the equality \spad{... P + coef2*Q = resultant(P,{} Q)}. Warning: \spad{degree(P) >= degree(Q)}.
827463`\spad{semiResultantReduitEuclidean(P,{} Q)} returns the "reduce resultant" and carries out the equality \spad{... P + coef2*Q = resultantReduit(P,{} Q)}.
827605`\spad{semiSubResultantGcdEuclidean1(P,{} Q)} carries out the equality \spad{coef1*P + ... Q = +/- S_i(P,{} Q)} where the degree (not the indice) of the subresultant \spad{S_i(P,{} Q)} is as small as possible.
827723`\spad{semiSubResultantGcdEuclidean2(P,{} Q)} carries out the equality \spad{... P + coef2*Q = +/- S_i(P,{} Q)} where the degree (not the indice) of the subresultant \spad{S_i(P,{} Q)} is as small as possible. Warning: \spad{degree(P) >= degree(Q)}.
827841`\spad{sendGraphImage(\spad{gi})} takes the given graph,{} \spad{\spad{gi}} of the domain \spadtype{GraphImage},{} and sends it\spad{'s} data to the viewport manager where it waits to be included in a two-dimensional viewport window. \spad{\spad{gi}} cannot be an empty graph.
827960`\spad{separant(p)} returns the partial derivative of the differential polynomial \spad{p} with respect to its leader.
828031`\spad{separate(x)} \undocumented
828148`\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.
828292`\spad{separate(p,{} q)} returns \spad{[a,{} b]} such that \spad{p = a b},{} \spad{a} is relatively prime to \spad{q} and \spad{b} divides some power of \spad{q}.
828532`\spad{sequence(x)} turns the stream \spad{x} into a sequence
828591`\spad{sequence(f,{} s0)} generates a stream recursively by applying the function \spad{f:} \spad{S} \spad{->} \spad{S} to the last computed value.
828649`\spad{sequences([l0,{} l1,{} l2,{} ..,{} ln])} is the set of \indented{1}{all sequences formed from} \spad{l0} 0\spad{'s},{} \spad{l1} 1\spad{'s},{} \spad{l2} 2\spad{'s},{} ...,{} \spad{ln} \spad{n}\spad{'s}.
828739`\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}\spad{'s},{} and 4 \spad{5}\spad{'s}.}
828843`\spad{serialize(d)} returns copy of \spad{d} transformed for writing to files.
828899`\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.}
828963`\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.
829062`\spad{series(st)} creates a series from a stream of coefficients.
829146`\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.
829218`\spad{series([a0,{} a1,{} a2,{} ...])} is the Taylor series \spad{a0 + a1 x + a2 x^2 + ...}.
829295`\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.
829393`\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.
829501`\spad{series(x)} returns \spad{x} viewed as a series.
829577`\spad{series(n +-> a(n),{} x = a)} returns \spad{sum(n = 0..,{} a(n)*(x-a)^n)}.
829668`\spad{series(f,{} x = a)} expands the expression \spad{f} as a series in powers of (\spad{x} - a).
829753`\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}.
829929`\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.
830056`\spad{series(a(n),{} n,{} x = a)} returns \spad{sum(n = 0..,{} a(n)*(x-a)^n)}.
830209`\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)}.
830326`\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}.
830689`\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)}.
830868`\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)}.
831347`\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)}.
831934`\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)}.
832048`\spad{seriesSolve(eq,{} y,{} x=a,{} b)} is equivalent to \spad{seriesSolve(eq,{} y,{} x=a,{} y a = b)}.
832152`\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))}.
832262`\spad{seriesSolve(eq,{} y,{} x = a,{} y a = b)} is equivalent to \spad{seriesSolve(eq=0,{} y,{} x=a,{} y a = b)}.
832366`\spad{seriesSolve(eq,{} y,{} x = a,{} b)} is equivalent to \spad{seriesSolve(eq = 0,{} y,{} x = a,{} y a = b)}.
832460`\spad{seriesSolve(eq,{} y,{} x = a,{} [b0,{} ...,{} bn])} is equivalent to \spad{seriesSolve(eq = 0,{} y,{} x = a,{} [b0,{} ...,{} b(n-1)])}.
832560`\spad{seriesSolve([eq1,{} ...,{} eqn],{} [y1,{} ...,{} yn],{} x = a,{} [y1 a = b1,{} ...,{} yn a = bn])} returns a taylor series solution of \spad{[eq1,{} ...,{} eqn]} around \spad{x = a} with initial conditions \spad{\spad{yi}(a) = \spad{bi}}. Note: eqi must be of the form \spad{\spad{fi}(x,{} y1 x,{} y2 x,{} ...,{} yn x) y1'(x) + \spad{gi}(x,{} y1 x,{} y2 x,{} ...,{} yn x) = h(x,{} y1 x,{} y2 x,{} ...,{} yn x)}.
832692`\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])}.
832814`\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])}.
832936`\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])}.
833048`\spad{seriesToOutputForm(st,{} refer,{} var,{} cen,{} r)} prints the series \spad{f((var - cen)^r)}.
833280`\spad{set()}\$\spad{D} creates an empty set aggregate of type \spad{D}.
833372`\spad{set([x,{} y,{} ...,{} z])} creates a set aggregate containing items \spad{x},{} \spad{y},{} ...,{} \spad{z}.
833420`\spad{setAdaptive(true)} turns adaptive plotting on \spad{setAdaptive(false)} turns adaptive plotting off
833471`\spad{setAdaptive3D(true)} turns adaptive plotting on; setAdaptive3D(\spad{false}) turns adaptive plotting off.
833661`\spad{setchildren!(u,{} v)} replaces the current children of node \spad{u} with the members of \spad{v} in left-to-right order.
833749`\spad{setClipValue(x)} sets to \spad{x} the maximum value to plot when drawing complex functions. Returns \spad{x}.
833816`\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.
833959`\spad{setColumn!(m,{} j,{} v)} sets to \spad{j}th column of \spad{m} to \spad{v}
834043`\spad{setCondition!(n,{} t)} returns \spad{n} whose condition has been replaced by \spad{t} if it is not empty,{} else an error is produced.
834100`Set the prologue and epilogue that is used by default. Between the elements of the list the stepnumber will be inserted. The old values are returned.
834245`\spad{setDialect(d)} sets \spad{s} as current dialect and returns previous setting. Possible values are \spad{tex} meaning using mostly plain TeX constructs and \spad{latex} which means more idiomatic LaTeX.
834298`\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.
834360`\spad{setelt!(n,{} m)} changes the value of the object \spad{n} to \spad{m}.
835420`\spad{setelt!(f,{} i,{} alpha)} sets \spad{v}(\spad{i}) = alpha in the ALS of \spad{f}.
835498`\spad{setelt!(u,{} x,{} y)} sets the image of \spad{x} to be \spad{y} under \spad{u},{} if \spad{x} is in the domain of \spad{u}. Error: if \spad{x} is not in the domain of \spad{u}.
835584`\spad{setelt!(u,{} "first",{} x)} (also written: \spad{u.first := x}) is equivalent to \spad{setfirst!(u,{} x)}.
835674`\spad{setelt!(t,{} k,{} e)} (also written \spad{t.k := e}) is equivalent to \spad{(insert!([k,{} e],{} t); e)}.
835744`\spad{setelt!(u,{} "last",{} x)} (also written: \spad{u.last := x}) is equivalent to \spad{setlast!(u,{} x)}.
835833`\spad{setelt!(a,{} "left",{} b)} (also written \spad{a.left := b}) is equivalent to \spad{setleft!(a,{} b)}.
835923`\spad{setelt!(u,{} "rest",{} v)} (also written: \spad{u.rest := v}) is equivalent to \spad{setrest!(u,{} v)}.
836012`\spad{setelt!(a,{} "right",{} b)} (also written \spad{a.right := b}) is equivalent to \spad{setright!(a,{} b)}.
836103`\spad{lib.k := v} saves the value \spad{v} in the library \spad{lib}. It can later be extracted using the key \spad{k}.
836154`\spad{setelt!(u,{} i..j,{} x)} (also written: \spad{u(i..j) := x}) destructively replaces each element in the segment \spad{u(i..j)} by \spad{x}. The value \spad{x} is returned. Note: \spad{u} is destructively changed so that \spad{u.k := x for k in i..j}; its length remains unchanged.
836254`\spad{setelt!(u,{} "value",{} x)} (also written \spad{u.value := x}) is equivalent to \spad{setvalue!(u,{} x)}
836339`\spad{setelt!(A,{} i,{} c,{} d)} sets the entry of the matrix \spad{A} in row \spad{i} and in the column with index \spad{c} to the value \spad{d}.
836409`\spad{setelt!(p,{} i,{} j,{} lst)} sets the element (\spad{i},{}\spad{j}) in the matrices of the linear pencil \spad{p} according to the elements in \spad{lst}.
836525`\spad{setelt!(f,{} i,{} j,{} p)} sets A(\spad{i},{}\spad{j}) = \spad{p} in the ALS of \spad{f} (where \spad{p} has degree less equal one) if the system is in polynomial form and j>i.
837866`\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
837953`\spad{setelt!(x,{} row,{} colList)} assigns to an 1-by-\spad{n} selection of the array,{} where \spad{n = \# colList}.
838046`\spad{setelt!(x,{} row,{} ls2)} is equivalent to \spad{setelt!(x,{} row,{} l2)} where \spad{l2} is obtained appending expansions of elements of \spad{ls2},{} but should be more convenient and more efficient.
838148`\spad{setelt!(x,{} rowList,{} col)} assigns to an \spad{m}-by-1 selection of the array,{} where \spad{m = \# rowList}.
838241`\spad{setelt!(x,{} rowList,{} colList,{} y)} destructively alters the array \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}.
838340`\spad{setelt!(x,{} l1,{} s2)} is equivalent to \spad{setelt!(x,{} l1,{} expand(s2))} but should be more convenient and more efficient.
838442`\spad{setelt!(x,{} ls1,{} col)} is equivalent to \spad{setelt!(x,{} l1,{} col)} where \spad{l1} is obtained appending expansions of elements of \spad{ls1},{} but should be more convenient and more efficient.
838544`\spad{setelt!(x,{} ls1,{} ls1)} is equivalent to \spad{setelt!(x,{} l1,{} l2)} where \spad{li} is obtained appending expansions of elements of lsi,{} but should be more convenient and more efficient.
838661`\spad{setelt!(x,{} ls1,{} s2)} is equivalent to \spad{setelt!(x,{} l1,{} l2)} where \spad{li} is obtained appending expansions of elements of lsi,{} but should be more convenient and more efficient.
838772`\spad{setelt!(x,{} s1,{} l2)} is equivalent to \spad{setelt!(x,{} expand(s1),{} l2)} but should be more convenient and more efficient.
838874`\spad{setelt!(x,{} s1,{} ls2)} is equivalent to \spad{setelt!(x,{} l1,{} l2)} where \spad{li} is obtained appending expansions of elements of lsi,{} but should be more convenient and more efficient.
838985`\spad{setelt!(x,{} s1,{} s2)} is equivalent to \spad{setelt!(x,{} expand(s1),{} expand(s2))} but should be more convenient and more efficient.
839090`\spad{selelt!(p,{} i,{} j,{} l,{} alpha)} sets the element (\spad{i},{}\spad{j}) in matrix \spad{l} of the linear pencil \spad{p} to alpha.
839213`\spad{setelt!(x,{} i,{} j,{} k,{} s)} (or \spad{x}.\spad{i}.\spad{j}.\spad{k} \spad{:=} \spad{s}) sets a specific element of the array to some value of type \spad{R}
839328`\spad{setEmpty!(n)} replaces \spad{n} by \spad{empty()\$\%}.
839379`\spad{setEpilogue!(t,{} strings)} sets the epilogue section of a TeX form \spad{t} to strings.
839448`\spad{setEpilogue!(t,{} epi)} sets the epilogue section of the form \spad{t} to epi and returns the previous epilogue.
839514`\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.
839582`\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 \spad{GF}.
839707`\spad{setfirst!(u,{} x)} destructively changes the first element of \spad{u} to \spad{x}. Error if \spad{u} is empty.
839791`\spad{setFormat! f} returns \spad{setFormats! [f]}.
839845`\spad{setFormat!(t,{} box)} sets the \spad{fmt} section of a form \spad{t} and returns the previous box.
839909`\spad{setFormats!(l)} takes a list \spad{l} of formatters and sets this for future output in a session.
839990`\spad{setFormats!(l)} takes a list \spad{l} of formatters and sets this for future output in a session. It also issues a command equivalent to ")set output formatted on" if the given list is non-empty and ")set output formatted off" if the input list is empty.
840051`\spad{setGcdMode(s)} sets a new value for the flag deciding on the method used to compute gcd`s for lists. Possible values for \spad{s} are \spad{iterated} and \spad{random}.
840135`\spad{setHandler!(x,{} n,{} op,{} hdl)} puts \spad{hdl} into the data structure \spad{x} such that it can be queried afterwards.
840224`\spad{setImagSteps(i)} sets to \spad{i} the number of steps to use in the imaginary direction when drawing complex functions. Returns \spad{i}.
840283`\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.
840347`\spad{setLabelValue(i)} resets the counter which produces labels to \spad{i}
840476`\spad{setlast!(u,{} x)} destructively changes the last element of \spad{u} to \spad{x}. Error if \spad{u} is empty.
840559`\spad{setleaves!(t,{} ls)} sets the leaves of \spad{t} in left-to-right order to the elements of \spad{ls}.
840622`\spad{setleft!(a,{} b)} sets the left child of \spad{a} to be \spad{b}.
840706`\spad{setMaxPoints(i)} sets the maximum number of points in a plot to \spad{i}
840758`\spad{setMaxPoints3D(i)} sets the maximum number of points in a plot to \spad{i}.
840814`\spad{setMinPoints(i)} sets the minimum number of points in a plot to \spad{i}
840866`\spad{setMinPoints3D(i)} sets the minimum number of points in a plot to \spad{i}.
840922`\spad{setMode(s,{} b)} allows override of parameters such as orthogonal used for debugging
840997`sets multiplier of face
841048`sets multiplier of face
841101`sets multiplier of face
841153`\spad{setnext!(u,{} v)} destructively sets the next node of doubly-linked aggregate \spad{u} to \spad{v},{} returning \spad{v}.
841234`\spad{setNotation(s)} chooses the notation used for derivatives. Returns the old value.
841431`\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}.
841511`\spad{setOrder([a1,{} ...,{} an])} defines a partial ordering on \spad{S} given \spad{by:} \indented{3}{(1)\space{2}\spad{a1 < a2 < ... < an}.} \indented{3}{(2)\space{2}\spad{b < \spad{ai}\space{3}for i = 1..n} and \spad{b} not among the \spad{ai}\spad{'s}.} \indented{3}{(3)\space{2}undefined on \spad{(b,{} c)} if neither is among the \spad{ai}\spad{'s}.}
841581`\spad{setOrder([b1,{} ...,{} bm],{} [a1,{} ...,{} an])} defines a partial ordering on \spad{S} given \spad{by:} \indented{3}{(1)\space{2}\spad{b1 < b2 < ... < bm < a1 < a2 < ... < an}.} \indented{3}{(2)\space{2}\spad{bj < c < \spad{ai}}\space{2}for \spad{c} not among the \spad{ai}\spad{'s} and \spad{bj}\spad{'s}.} \indented{3}{(3)\space{2}undefined on \spad{(c,{} d)} if neither is among the \spad{ai}\spad{'s},{} \spad{bj}\spad{'s}.}
841659`\spad{setOutput(i)} controls amount of generated output during the completion algorithm: \spad{i = 0} --> no display,{} \spad{i = 1} --> result is displayed,{} \spad{i = 2} --> Cartan characters are displayed,{} \spad{i = 3} --> integrability conditions are traced,{} \spad{i = 4} --> intermediate dimensions are traced,{} \spad{i = 5} --> all intermediate systems are traced,{} \spad{i = 6} --> all intermediate systems and symbols are traced,{} if \spad{i > 10} then TeX output is produced. Default is 0. The old value is returned.
841748`\spad{set_output_mode(mode,{} precision)} sets output \spad{mode} and precision.
841808`\spad{setPoly(x)} sets modulus for subsequent operations.
841858`\spad{setPosition(x,{} n)} associates the integer \spad{n} to \spad{x}.
841926`\spad{setPredicates(p,{} [p1,{} ...,{} pn])} attaches the predicate \spad{p1} and ... and \spad{pn} to \spad{p}.
841983`\spad{setprevious!(u,{} v)} destructively sets the previous node of doubly-linked aggregate \spad{u} to \spad{v},{} returning \spad{v}.
842068`\spad{setPrologue!(t,{} strings)} sets the prologue section of a TeX form \spad{t} to strings.
842137`\spad{setPrologue!(t,{} pro)} sets the prologue section of the form \spad{t} to pro and returns the previous prologue.
842203`\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.
842282`\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.
842342`\spad{setRealSteps(i)} sets to \spad{i} the number of steps to use in the real direction when drawing complex functions. Returns \spad{i}.
842401`\spad{setRedMode(i)} sets the flag for the reduction mode. Returns old value. Current values are: \spad{i = 0} --> No reduction of integrability conditions etc. \spad{i = 1} --> Autoreduction of complete system and reduction \indented{16}{of all integrability conditions.} Default is 0.
842490`\spad{setref(n,{} m)} same as \spad{setelt!(n,{} m)}.
842534`\spad{setRefined!(f,{}max_sze)} sets the internal flag if the system is refined (over the ground field) up to the specified block size.
842614`\spad{setrest!(u,{} v)} destructively changes the rest of \spad{u} to \spad{v}. Error if \spad{u} is empty.
842697`\spad{setrest!(x,{} n,{} y)} sets rest(\spad{x},{} \spad{n}) to \spad{y}. The function will expand cycles if necessary.
842748`\spad{setright!(a,{} b)} sets the right child of \spad{a} to be \spad{b}.
842833`\spad{setRow!(A,{} i,{} ind,{} ent)} sets the \spad{i}\spad{-}th row of the matrix \spad{A} to the value \spad{r}.
843017`\spad{setRow!(m,{} i,{} v)} sets to \spad{i}th row of \spad{m} to \spad{v}
843098`\spad{setRow!(A,{} i,{} ind,{} ent)} sets the \spad{i}\spad{-}th row of the matrix \spad{A}. Its indices are \spad{ind}; the entries \spad{ent}.
843180`\spad{setScreenResolution(i)} sets the screen resolution to \spad{i}
843239`\spad{setScreenResolution3D(i)} sets the screen resolution for a 3d graph to \spad{i}.
843302`\spad{setSimplifyDenomsFlag(x)} sets flag affecting simplification of denominators. If \spad{true} irrational algebraics are removed from denominators. If \spad{false} they are kept.
843393`\spad{setSimpMode(i)} sets the flag controlling the used simplifications and returns the old value. Current values are: \spad{i = 0} \spad{->} No simplification modulo lower order equations. \spad{i = 1} \spad{->} Simplification modulo lower order equations. Default is 0.
843491`\spad{setSimpMode(i)} sets the simplification mode used in \spad{JetDifferentialEquation}. Returns old value.
843581`\spad{setStatus!(n,{} b)} returns \spad{n} whose status has been replaced by \spad{b} if it is not empty,{} else an error is produced.
843641`\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\spad{'t} know"). Note: for internal use only,{} with care.
843824`\spad{setsubMatrix(x,{} i1,{} j1,{} y)} destructively alters the array \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}.
843917`\spad{setsubMatrix!(p,{} i,{} j,{} l,{} a)} sets the matrix a into the matrix \spad{l} of \spad{p} in position (\spad{i},{}\spad{j}).
844062`\spad{setsubPencil!(p,{} i,{} j,{} q)} sets the matrices of pencil \spad{q} into the matrices of \spad{p} in position (\spad{i},{}\spad{j}).
844172`\spad{setTex!(t,{} strings)} sets the TeX section of a TeX form \spad{t} to strings.
844236`\spad{setTopPredicate(x,{} [a1,{} ...,{} an],{} f)} returns \spad{x} with the top-level predicate set to \spad{f(a1,{} ...,{} an)}.
844302`\spad{setTransform!(n,{} tran)} changes the transform without altering the scene hierarchy
844366`\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.
844481`\spad{setValue!(n,{} v)} returns \spad{n} whose value has been replaced by \spad{v} if it is not empty,{} else an error is produced.
844534`\spad{setvalue!(u,{} x)} sets the value of node \spad{u} to \spad{x}.
844613`\spad{setVariableOrder([a1,{} ...,{} an])} defines an ordering on the variables given by \spad{a1 > a2 > ... > an > other variables}.
844694`\spad{setVariableOrder([b1,{} ...,{} bm],{} [a1,{} ...,{} an])} defines an ordering on the variables given by \spad{b1 > b2 > ... > bm >} other variables \spad{> a1 > a2 > ... > an}.
844788`\spad{SFunction(\spad{li})} is the \spad{S}-function of the partition \spad{\spad{li}} \indented{1}{expressed in terms of power sum symmetric functions.}
844885`\spad{sh(x,{} y)} returns the shuffle-product of \spad{x} by \spad{y}. This multiplication is associative and commutative.
844953`\spad{sh(x,{} n)} returns the shuffle power of \spad{x} to the \spad{n}.
845038`\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.
845089`\spad{shade(p)} returns the shade index of the indicated palette \spad{p}.
845131`\spad{shallowCopy(x)} \undocumented
845179`\spad{shallowExpand(x)} replaces elements of basis by commutators of other basis elements if possible.
845252`\spad{shanksDiscLogAlgorithm(b,{} a,{} p)} computes \spad{s} with \spad{b^s = a} for assuming that \spad{a} and \spad{b} are elements in a 'small' cyclic group of order \spad{p} by Shank\spad{'s} algorithm. Note: this is a subroutine of the function \spadfun{discreteLog}.
845379`\spad{shellSort(f,{} agg)} sorts the aggregate agg with the ordering function \spad{f} using the shellSort algorithm.
845457`\spad{Shi(f)} denotes the hyperbolic sine integral
845508`\spad{Shi(x)} returns the hyperbolic sine integral of \spad{x},{} \spadignore{i.e.} the integral of \spad{sinh(x) / x dx}.
845562`\spad{Shi(f)} denotes the hyperbolic sine integral
845708`\spad{Shi(f)} denotes the hyperbolic sine integral
845767`\spad{shift(k)} returns \spad{matrix [[1,{} k],{} [0,{} 1]]} representing the map \spad{x -> x + k}.
845815`\spad{shift(m,{} h)} returns \spad{shift(h) * m} (see \spadfunFrom{shift}{MoebiusTransform}).
845865`\spad{shift(a,{} i)} shift \spad{a} by \spad{i} digits.
845915`\spad{shift(x,{} n)} adds \spad{n} to the exponent of float \spad{x}.
845957`\spad{shift(a,{} i)} shift \spad{a} by \spad{i} bits.
846012`\spad{ShiftAction(k,{} l,{} g)} gives the coefficient of \spad{x^k} in \spad{z^l} \spad{g}(\spad{x}),{} where \spad{z*(a+b*x+c*x^2+d*x^3+...) = (b*x+2*c*x^2+3*d*x^3+...)}. In terms of sequences,{} z*u(\spad{n})=n*u(\spad{n}).
846114`\spad{ShiftC} gives the coefficients \spad{c_}{\spad{k},{} \spad{k}} in the expansion <x^k> \spad{z} \spad{g}(\spad{x}) = sum_{\spad{i=0}}\spad{^k} \spad{c_}{\spad{k},{} \spad{i}} <x^i> \spad{g}(\spad{x}),{} where \spad{z} acts on \spad{g}(\spad{x}) by shifting. In fact,{} the result is [0,{} 1,{} 2,{} ...]
852570`\spad{shiftHP options} returns a specification for Hermite-Pade approximation with the shift operator
858027`\spad{shiftHP options} returns a specification for Hermite-Pade approximation with the \$\spad{q}\$-shift operator,{} or,{} if \spad{maxMixedDegree > 0} for mixed shifts
858990`\spad{leftShift(l)} rotates the list \spad{l} to the left and inserts the first element at the end
859049`\spad{shiftLeft(p,{} n)} returns \spad{p * monomial(1,{} n)}
859132`\spad{shift_mat!(mat,{} sa,{} nr)} moves modular composition matrix stored in \spad{nr} rows of \spad{mat} starting at \spad{sa} to first \spad{nr} rows of \spad{mat}. This is designed to work on output of split_mat!.
859232`\spad{shiftRight(p,{} n)} returns \spad{monicDivide(p,{} monomial(1,{} n)).quotient}
859327`\spad{shiftRoots(p,{} c)} returns the polynomial which has for roots \spad{c} added to the roots of \spad{p}.
859401`\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".
859477`\spad{showAll?()} returns \spad{true} if all computed entries of streams will be displayed.
859541`\spad{showAllElements(s)} creates an output form which displays all computed elements.
859616`\spad{showArrayValues(true)} forces the values of array components to be \indented{1}{displayed rather than just their types.}
859673`\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".
859745`\spad{showElements(n,{} st)} computes and creates and output form of the first \spad{n} entries of st.
859836`\spad{showFortranOutputStack()} returns the Fortran output stack
859918`\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".
859986`\spad{showScalarValues(true)} forces the values of scalar components to be \indented{1}{displayed rather than just their types.}
860044`\spad{showTheSymbolTable()} returns the current symbol table.
860099`\spad{showTypeInOutput(bool)} affects the way objects of \spadtype{Any} are displayed. If \spad{bool} is \spad{true} then the type of the original object that was converted to \spadtype{Any} will be printed. If \spad{bool} is \spad{false},{} it will not be printed.
860153`\spad{shrinkable(b)} sets the shrinkable attribute of flexible arrays to \spad{b} and returns the previous value
860281`\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}.}
860383`\spad{shufflein(l,{} st)} maps shuffle(\spad{l},{} \spad{u}) on to all \indented{1}{members \spad{u} of st,{} concatenating the results.}
860495`\spad{\spad{Si}(f)} denotes the sine integral
860545`\spad{\spad{Si}(x)} returns the sine integral of \spad{x},{} \spadignore{i.e.} the integral of \spad{sin(x) / x dx}.
860598`\spad{\spad{Si}(f)} denotes the sine integral
860742`\spad{\spad{Si}(f)} denotes the sine integral
860800`\spad{sierpinskiDivide(me,{} level)} for each edge of each face calculate a new point in the centre of the edge,{} then build a new set of faces which include the new points.
860871`\spad{Sigma()} returns symbol for capital greek letter sigma.
860923`\spad{sigma()} returns symbol for small greek letter sigma.
860975`\spad{sign(x)} returns the sign of \spad{x}.
861033`\spad{sign(r)} \undocumented
861141`\spad{sign(x)} returns the sign of \spad{x}.
861192`\spad{sign f} returns the sign of \spad{f} if it is constant everywhere.
861287`\spad{sign(f)} returns 1 if \spad{f} is always non-negative; returns \spad{-1} is \spad{f} is always non-positive; returns 0 if \spad{f} is always 0; returns "failed" if the sign of \spad{f} varies or can\spad{'t} be determined.
861364`\spad{sign(x)} is 1 if \spad{x} is positive,{} \spad{-1} if \spad{x} is negative,{} 0 if \spad{x} equals 0.
861409`\spad{sign(p)} returns the signum of the permutation \spad{p},{} \spad{+1} or \spad{-1}.
861457`\spad{sign(pol,{} aRoot)} gives the sign of \spad{pol} interpreted as \spad{aRoot}
861549`\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.
861694`\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.
861799`\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"}.
861932`\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".
862025`\spad{signAround(u,{} i,{} f)} \undocumented
862138`\spad{signAround(u,{} r,{} f)} \undocumented
862245`\spad{signAround(u,{} r,{} i,{} f)} \undocumented
862360`\spad{simpleCells(c)} returns lists of simple cells determining \spad{c}. That is \spad{c} = makeCell(simpleCells(\spad{c}))
862471`construct empty simplex
862546`constructor where the simplices are supplied
862652`constructor where the simplices are supplied
862777`construct FiniteSimplicialComplex from DeltaComplex. If there are 'implied' loops,{} such as facets with multiple entries with the same index,{} then this function may fail.
862881`construct FiniteSimplicialComplex from DeltaComplex with trace. If there are 'implied' loops,{} such as facets with multiple entries with the same index,{} then this function may fail.
862993`Forms join of two simplicial complexes. The join \spad{S*T} of two simplicial sets \spad{S} and \spad{T} is a new simplicial set that may geometrically be thought of as a cone over \spad{T} with tip of shape \spad{S}. simplicialJoin is commutative and associative. For more information: \url{http://www.euclideanspace.com/prog/scratchpad/mycode/topology/simplex/join/index.\spad{htm}}
863068`\spad{simplify(s)} tries to simplify \spad{s}. There may not be a simplest form but it is possible to do some simplifications as follows: 1. Remove all zero terms in relations. 2. If a relation consists of a single generator then remove \indented{3}{that generator.} 3. If a relation consists of a pair of generators then make the \indented{3}{second generator the inverse of the first.} 4. If a generator is adjacent to its inverse then cancel them out. 5. Remove duplicate relations. 6. Substitute one relation in another.
863117`\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.
863254`\spad{simplify(de)} simplifies the equations of each order separately using the procedure \spad{simplify} from \spad{D}. Found integrability conditions are also returned separately.
863338`\spad{simplify(an)} applies simplifications to \spad{an}
863439`\spad{simplify(f)} performs the following simplifications on \spad{f:} \begin{items} \item 1. rewrites trigs and hyperbolic trigs in terms of \spad{sin} ,{} \spad{cos},{} \spad{sinh},{} \spad{cosh}. \item 2. rewrites \spad{sin^2} and \spad{sinh^2} in terms of \spad{cos} and \spad{cosh},{} \item 3. rewrites \spad{exp(a)*exp(b)} as \spad{exp(a+b)}. \item 4. rewrites \spad{(a^(1/n))^m * (a^(1/s))^t} as a single power of a single radical of \spad{a}. \end{items}
863503`simplify with option to trace
863560`\spad{simplify(sys,{} jm)} simplifies a system with given Jacobi matrix. The Jacobi matrix of the simplified system is returned,{} too. \spad{Depend} contains for each equation of the simplified system the numbers of the equations of the original system out of which it is build,{} if it is possible to obtain this information. If one can generate equations of lower order by purely algebraic operations,{} then \spad{simplify} should do this.
863945`\spad{simplifyCoeffs(d,{} la)} should be local but conditional.
864194`\spad{simplifyExp(f)} performs the following simplifications on \spad{f:} \begin{items} \item 1. rewrites \spad{exp(a)*exp(b)} as \spad{exp(a+b)}. \item 2. rewrites \spad{a^b*a^c} as \spad{a^(b+c)}. \item 3. rewrites \spad{exp(a)/exp(b)} as \spad{exp(a-b)}. \item 4. rewrites \spad{a^b/a^c} as \spad{a^(b-c)}. \end{items}
864261`\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)}.
864328`\spad{simpMod(sys1,{} sys2)} simplifies the system \spad{sys1} modulo the system \spad{sys2}.
864485`\spad{simpMod(sys1,{} sys2)} simplifies the system \spad{sys1} modulo the system \spad{sys2}. Returns the same information as \spad{simplify}.
864884`\spad{simpOne(f)} removes unnecessary coefficients and exponents,{} denominators etc.
865001`\spad{simpson(fn,{} a,{} b,{} epsrel,{} epsabs,{} nmin,{} nmax)} uses the simpson method to numerically integrate function \spad{fn} over the closed interval \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin} to \spad{nmax}. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
865138`\spad{simpsono(fn,{} a,{} b,{} epsrel,{} epsabs,{} nmin,{} nmax)} uses the simpson method to numerically integrate function \spad{fn} over the open interval from \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin} to \spad{nmax}. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
865276`\spad{sin?(x)} returns \spad{true} if term is a sin,{} otherwise \spad{false}
865329`\spad{sin(x)} represents the Fortran intrinsic function SIN
865408`\spad{sin(x)} makes a sin kernel for use in Fourier series
865454`\spad{sin(x)} applies the sine operator to \spad{x}
865606`\spad{sin(st)} computes sine of a power series \spad{st}.
865690`\spad{sin(st)} computes sine of a power series \spad{st}.
865788`\spad{sin(z)} returns the sine of Laurent series \spad{z}.
865875`\spad{sin(z)} returns the sine of a Puiseux series \spad{z}.
865971`\spad{sin(x)} returns the sine of \spad{x}.
866027`\spad{sin2csc(f)} converts every \spad{sin(u)} appearing in \spad{f} into \spad{1/csc(u)}.
866090`\spad{sincos(st)} returns a record containing the sine and cosine of a power series \spad{st}.
866206`\spad{singleFace(ptin)} constructs a ifs representation of a face from an array of points
866259`\spad{singleFactorBound(p)} returns a bound on the infinite norm of the factor of \spad{p} with smallest Bombieri\spad{'s} norm. \spad{p} shall be of degree higher or equal to 2.
866348`\spad{singleFactorBound(p,{} r)} returns a bound on the infinite norm of the factor of \spad{p} with smallest Bombieri\spad{'s} norm. \spad{r} is a lower bound for the number of factors of \spad{p}. \spad{p} shall be of degree higher or equal to 2.
866456`\spad{singRicDE(op,{} ezfactor)} returns \spad{[[f1,{} L1],{} [f2,{} L2],{} ...,{} [fk,{} Lk]]} such that the singular \spad{++} part of any rational solution of the associated Riccati equation of \spad{op y = 0} must be one of the \spad{fi}\spad{'s} (up to the constant coefficient),{} in which case the equation for \spad{z = y e^{-int \spad{ai}}} is \spad{\spad{Li} z = 0}. Argument \spad{ezfactor} is a factorisation in \spad{UP},{} not necessarily into irreducibles.
866664`\spad{singRicDE(op,{} zeros,{} ezfactor)} returns \spad{[[f1,{} L1],{} [f2,{} L2],{} ... ,{} [fk,{} Lk]]} such that the singular part of any rational solution of the associated Riccati equation of \spad{op y=0} must be one of the \spad{fi}\spad{'s} (up to the constant coefficient),{} in which case the equation for \spad{z=y e^{-int p}} is \spad{\spad{Li} z=0}. \spad{zeros(C(x),{} H(x,{} y))} returns all the \spad{P_i(x)}\spad{'s} such that \spad{H(x,{} P_i(x)) = 0 modulo C(x)}. Argument \spad{ezfactor} is a factorisation in \spad{UP},{} not necessarily into irreducibles.
866825`\spad{singular?(a)} tests whether \spad{x = a} is singular.
866896`\spad{singular?(p)} tests whether \spad{p(x) = 0} is singular.
866968`\spad{singularAtInfinity?()} tests if there is a singularity at infinity.
867048`\spad{sinh(x)} represents the Fortran intrinsic function SINH
867128`\spad{sinh(x)} applies the hyperbolic sine operator to \spad{x}
867335`\spad{sinh(st)} computes the hyperbolic sine of a power series \spad{st}.
867420`\spad{sinh(st)} computes the hyperbolic sine of a power series \spad{st}.
867519`\spad{sinh(z)} returns the hyperbolic sine of Laurent series \spad{z}.
867607`\spad{sinh(z)} returns the hyperbolic sine of a Puiseux series \spad{z}.
867704`\spad{sinh(x)} returns the hyperbolic sine of \spad{x}.
867758`\spad{sinh2csch(f)} converts every \spad{sinh(u)} appearing in \spad{f} into \spad{1/csch(u)}.
867823`\spad{sinhcosh(st)} returns a record containing the hyperbolic sine and cosine of a power series \spad{st}.
867943`\spad{sinhIfCan(z)} returns sinh(\spad{z}) if possible,{} and "failed" otherwise.
868025`\spad{sinIfCan(z)} returns sin(\spad{z}) if possible,{} and "failed" otherwise.
868106`\spad{sipnt(a,{} b)} constructs a 2D point defined by a and \spad{b} of type Integer
868218`\spad{sipnt(a,{} b,{} c)} constructs a 3D point defined by a,{} \spad{b} and \spad{c} of type Integer
868346`\spad{sivec(a,{} b)} constructs a 2D vector defined by a and \spad{b} of type Integer
868458`\spad{sivec(a,{} b,{} c)} constructs a 3D vector defined by a,{} \spad{b} and \spad{c} of type Integer
868927`\spad{size()} is the base of the random number generator
868978`\spad{size()} returns the number of elements in the set.
869028`\spad{size(x)} returns the number of monomials in \spad{x}.
869085`\spad{size(x)} returns the number of monomials in \spad{x}.
869143`\spad{size(l)} returns the number of monomials forming \spad{l}.
869209`The size of the isolating interval
869601`\spad{size?(u,{} n)} tests if \spad{u} has exactly \spad{n} elements.
869718`\spad{sizeLess?(x,{} y)} tests whether \spad{x} is strictly smaller than \spad{y} with respect to the \spadfunFrom{euclideanSize}{EuclideanDomain}. Note: zero is considered smaller than every nonzero element.
869774`\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.
869883`\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.
869983`\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.
870073`\spad{sizeMultiplication(m)} returns the number of entries of the multiplication table {\em m}.
870205`\spad{sizePascalTriangle()} returns the number of entries currently stored in the table.
870286`\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.}
870401`Constructs variable combinator
870447`Constructs a node combinator over combinators
870494`\spad{slash(f,{} g)} creates a form for the horizontal fraction of \spad{f} over \spad{g}.
870535`Format a fraction linearly. \spad{slash(p,{} h1,{} h2)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats the first argument according to \spad{h1} and the second argument by \spad{h2}. Outer parentheses are added if \spad{p < prec}.
870699`\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
871063`\spad{smaller?(x,{} y)} is a strict total ordering on the elements of the set.
871402`\spad{smesh(ptin,{} clos)} constructs a ifs representation of a mesh from a 2 dimensional array of points
871464`\spad{smith(m)} computes Smith normal form of \spad{m}
871543`\spad{smith(m)} returns the Smith Normal form of the matrix \spad{m}.
871600`\spad{smith(m,{} full)} computes Smith normal form of \spad{m}. It first reduces \spad{m} to smaller matrix and then uses full to finish.
871714`Undocumented.
871810`Undocumented.
871879`\spad{sncndn(s,{} c)} is used internally.
871991`\spad{solid?(x)} \undocumented
872052`\spad{solid(x,{} b)} \undocumented
872120`\spad{solutionVector(f)} computes the solution vector \spad{s} of As=v if \spad{f} is polynomial.
872220`\spad{solutionVector(f,{} k)} computes the approximated solution vector up to powers \spad{M^k} \spad{v'} where PAs=Pv=v' with PA = \spad{I}-\spad{M}.
872339`\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.
872440`\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}.
872555`\spad{solve(u)} \undocumented
872625`\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}.
872724`\spad{solve(eq)} finds the solutions of the equation \spad{eq} with respect to the unique variable appearing in \spad{eq}.
872844`\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.
872933`\spad{solve(p)} finds the solution of a rational function \spad{p} = 0 with respect to the unique variable appearing in \spad{p}.
873043`\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}.
873175`\spad{solve(lp)} finds the solutions of the list \spad{lp} of rational functions with respect to all symbols appearing in \spad{lp}.
873297`\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}.
873425`\spad{solve(p,{} eps)} finds the real zeroes of a univariate rational polynomial \spad{p} with precision eps.
873514`\spad{solve(p,{} eps)} finds the real zeroes of a univariate integer polynomial \spad{p} with precision eps.
873593`\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}.
873699`\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 eps.
873824`\spad{solve(eq,{} v)} finds the solutions of the equation \spad{eq} with respect to the variable \spad{v}.
873951`\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}).
874047`\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 eps.
874162`\spad{solve(p,{} v)} solves the equation \spad{p=0},{} where \spad{p} is a rational function with respect to the variable \spad{v}.
874279`\spad{solve(leqs,{} lexpr)} returns a list of solutions to the list of equations \spad{leqs} with respect to the list of expressions lexpr. Each expression in lexpr is treated as a variable and must be a single kernel.
874410`\spad{solve(leqs,{} lker)} returns a list of solutions to the list of equations \spad{leqs} with respect to the list of kernels lker.
874549`\spad{solve(leqs,{} lvar)} returns a list of solutions to the list of equations \spad{leqs} with respect to the list of symbols lvar.
874673`\spad{solve(leq,{} eps)} finds all of the real solutions of the system \spad{leq} of equationas of rational functions with respect to all the variables appearing in \spad{lp},{} with precision eps.
874810`\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}.
874955`\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 eps.
875082`\spad{solve(lp,{} lv)} finds the solutions of the list \spad{lp} of rational functions with respect to the list of symbols \spad{lv}.
875217`\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}.
875374`\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}.
875519`\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}.
875672`\spad{solve(m,{} x)} returns a basis for the solutions of \spad{D y = m y}. \spad{x} is the dependent variable.
875778`\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}.
875919`\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}.
876043`\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}.
876179`\spad{solve(m,{} lv,{} solve)} is a parametric version of solve(\spad{m},{} \spad{v},{} solve)
876429`\spad{solve(m,{} v,{} solve)} returns \spad{[v_p,{} bm]} 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} are columns of \spad{bm} and form a basis for the solutions of \spad{D x = m x}. Argument \spad{solve} is a function for solving a single linear ordinary differential equation in \spad{F}.
876615`\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 homogeneous equation \spad{f(x,{} y) = 0}; A full basis for the solutions of the homogeneous 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.
876758`\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 homogeneous equation \spad{f(x,{} y) = 0}; A full basis for the solutions of the homogeneous 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}.
876891`\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 homogeneous equation \spad{op y = 0}. A full basis for the solutions of the homogeneous equation is not always returned,{} only the solutions which were found; \spad{x} is the dependent variable.
877013`\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 homogeneous system. error if the equations do not form a first order linear system
877182`\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 homogeneous system. error if the equations do not form a first order linear system
877341`\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.
877492`\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.
877593`\spad{solve(m,{} c,{} lv,{} solf)} returns "failed" of [[\spad{vp1},{} ...,{} vp_m],{} [\spad{b1},{} ...,{} \spad{bl}]] such that \spad{bi}-\spad{s} are basis of solutions of homogeneous system \spad{m} \spad{bi} = 0. Each vpi = [\spad{r},{} [\spad{c1},{} ...,{} \spad{cn}]] is a particular solution of a parametric matrix equation \spad{m} \spad{r} = \sum \spad{ci} \spad{vi} where \spad{lv} = [\spad{v1},{} ...,{} \spad{vn}]. solf is scalar solver,{} \spad{c} is a parameter to \spad{apply} (needed for action of LO on \spad{F}). "failed" means that system is underdetermined.
877876`\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)}.
877997`\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)}.
878108`\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.
878207`\spad{solveFor(fun,{} jv)} tries to solve \spad{fun} for the jet variable \spad{jv}.
878287`\spad{solveid(h,{} prime,{} table)} computes the coefficients of the extended euclidean algorithm for a list of polynomials whose tablePow is table and with right side \spad{h}.
878378`\spad{solveInField(lp)} finds the solution of the list \spad{lp} of rational functions with respect to all the symbols appearing in \spad{lp}.
878500`\spad{solveInField(lp,{} lv)} finds the solutions of the list \spad{lp} of rational functions with respect to the list of symbols \spad{lv}.
878635`\spad{solveInField(m,{} lv,{} solve)} is a parametric version of solveInField(\spad{m},{} \spad{v},{} solve)
878893`\spad{solveInField(m,{} v,{} solve)} returns \spad{[[v_1,{} ...,{} v_m],{} v_p]} such that the solutions in \spad{F} of the system \spad{m x = v} are \spad{v_p + c_1 v_1 + ... + c_m v_m} where the \spad{c_i's} are constants,{} and the \spad{v_i's} form a basis for the solutions of \spad{m x = 0}. Argument \spad{solve} is a function for solving a single linear ordinary differential equation in \spad{F}.
879093`\spad{solveLinear([v1,{} ...,{} vn],{} u)} returns solution of the system \spad{c1*v1 + ... + cn*vn = u} and and a basis of the associated homogeneous system \spad{c1*v1 + ... + cn*vn = 0}
879269`\spad{solveLinear([v1,{} ...,{} vn],{} u)} returns solution of the system \spad{c1*v1 + ... + cn*vn = u} and and a basis of the associated homogeneous system \spad{c1*v1 + ... + cn*vn = 0}
879420`\spad{solveLinear([v1,{} ...,{} vn],{} u)} returns solution of the system \spad{c1*v1 + ... + cn*vn = u} and and a basis of the associated homogeneous system \spad{c1*v1 + ... + cn*vn = 0}
879588`\spad{solveLinear([v1,{} ...,{} vn],{} u)} returns solution of the system \spad{c1*v1 + ... + cn*vn = u} and and a basis of the associated homogeneous system \spad{c1*v1 + ... + cn*vn = 0}
879731`\spad{solveLinearlyOverQ([v1,{} ...,{} vn],{} u)} returns solution of the system \spad{c1*v1 + ... + cn*vn = u} and and a basis of the associated homogeneous system \spad{c1*v1 + ... + cn*vn = 0}
879914`\spad{solveLinearlyOverQ([v1,{} ...,{} vn],{} u)} returns solution of the system \spad{c1*v1 + ... + cn*vn = u} and and a basis of the associated homogeneous system \spad{c1*v1 + ... + cn*vn = 0}
880089`\spad{solveLinearOverConstants([v1,{} ...,{} vn],{} u,{} ld)} returns solution of the system \spad{c1*v1 + ... + cn*vn = u} and and a basis of the associated homogeneous system \spad{c1*v1 + ... + cn*vn = 0}
880262`\spad{solveLinearOverConstants([v1,{} ...,{} vn],{} u,{} ld)} returns solution of the system \spad{c1*v1 + ... + cn*vn = u} and and a basis of the associated homogeneous system \spad{c1*v1 + ... + cn*vn = 0}
880427`\spad{solveLinearPolynomialEquation([f1,{} ...,{} fn],{} g)} (where the \spad{fi} are relatively prime to each other) returns a list of \spad{ai} such that \spad{g/prod \spad{fi} = sum ai/fi} or returns "failed" if no such list of \spad{ai}\spad{'s} exists.
880566`\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 \spad{fj} (\spad{j} \spad{\=} \spad{i}) or equivalently g/prod \spad{fj} = sum (ai/fi) or returns "failed" if no such list exists
880785`\spad{solveLinearPolynomialEquation([f1,{} ...,{} fn],{} g)} (where the \spad{fi} are relatively prime to each other) returns a list of \spad{ai} such that \spad{g/prod \spad{fi} = sum ai/fi} or returns "failed" if no such list of \spad{ai}\spad{'s} exists.
881773`\spad{solveLinearPolynomialEquation([f1,{} ...,{} fn],{} g)} (where the \spad{fi} are relatively prime to each other) returns a list of \spad{ai} such that \spad{g/prod \spad{fi} = sum ai/fi} or returns "failed" if no such list of \spad{ai}\spad{'s} exists.
881971`\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 \spad{fi} = sum ai/fi} or returns "failed" if no such exists.
882187`\spad{solveLinearPolynomialEquationByRecursion([p1,{} ...,{} pn],{} p)} returns the list of polynomials \spad{[q1,{} ...,{} qn]} such that \spad{sum qi/pi = p / prod \spad{pi}},{} a recursion step for solveLinearPolynomialEquation as defined in \spadtype{PolynomialFactorizationExplicit} category (see \spadfun{solveLinearPolynomialEquation}). If no such list of \spad{qi} exists,{} then "failed" is returned.
882413`\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.
882548`\spad{solve_u(f1,{} u,{} x)} returns [[\spad{c1},{} \spad{k1}],{} ...,{} [\spad{cn},{} \spad{kn}]] such that \spad{f1} = \spad{c1*u^k1} + ... + cn^kn and \spad{D}(\spad{ci},{} \spad{x}) = 0 or "failed".
882643`\spad{solveUniquely(m,{} v)} returns unique solution to the system \spad{m*x = v} or "failed" if solution is non unique or does not exist.
882751`\spad{someBasis()} returns some \spad{R}-module basis.
882825`\spad{Somos returns} whether we allow only Somos-like operators,{} default being \spad{false}
882920`\spad{Somos(d)} specifies whether we want that the total degree of the differential operators is constant,{} and equal to \spad{d},{} or maxDerivative if \spad{true}. If \spad{true},{} maxDerivative must be set,{} too.
883175`sort
883230`\spad{sort!(u)} returns \spad{u} with its elements in ascending order.
883346`\spad{sort(u)} returns an \spad{u} with elements in ascending order. Note: \spad{sort(u) = sort(<,{} u)}.
883437`\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.
883834`\spad{sort!(p,{} u)} returns \spad{u} with its elements ordered by \spad{p}.
883947`\spad{sort(p,{} a)} returns a copy of \spad{a} sorted using total ordering predicate \spad{p}.
884030`\spad{sort(v,{} ps)} returns \spad{us,{} vs,{} ws} such that \spad{us} is \spad{collectUnder(ps,{} v)},{} \spad{vs} is \spad{collect(ps,{} v)} and \spad{ws} is \spad{collectUpper(ps,{} v)}.
884297`\spad{sorted?(u)} tests if the elements of \spad{u} are in ascending order.
884609`\spad{sorted?(p,{} a)} tests if \spad{a} is sorted according to predicate \spad{p}.
884701`\spad{sortedPurge!(A,{} crit)} is like \spad{purge},{} however,{} with the additional assumption that \spad{crit} respects the ordering of the indices.
884777`\spad{sortLD(sys)} sorts the functions in \spad{sys} according to their leading derivatives.
884916`\spad{space()} provides the blank character.
884953`\spad{space(l)} takes a list of draw options,{} \spad{l},{} and checks to see if it contains the option \spad{space}. If the option doesn\spad{'t} exist,{} then an empty space is returned.
885039`\spad{space specifies} the space into which we will draw. If none is given then a new space is created.
885172`\spad{spanningForestArrow(s)} constructs a spanning tree for every arrow.
885318`\spad{spanningForestNode(s)} constructs a spanning tree for every vertex.
885475`\spad{spanningTreeArrow(s,{} i)} constructs a spanning tree for graph \spad{'s'} rooted at the arrow indexed by 'i'. The tree will expand out from 'i' only stopping when reaching a arrow that has already been visited (that is: loop detected). Elements in the tree are Integer,{} a positive Integer represents a arrow and a negative Integer represents a repeated arrow. note: it is possible that nodes may be visited many times,{} only arrows must not be re-visited.
885643`\spad{spanningTreeNode(s,{} i)} constructs a spanning tree for graph \spad{'s'} rooted at the node indexed by 'i'. The tree will expand out from 'i' only stopping when reaching a vertex that has already been visited (that is: loop detected). Elements in the tree are Integer,{} a positive Integer represents a vertex and a negative Integer represents a repeated vertex.
885728`\spad{SPDE1(b,{} c,{} D)} solves \spad{Q'} + \spad{b} \spad{Q} = \spad{c} and returns [\spad{Q},{} \spad{r}] where \spad{r} = \spad{c} - ( \spad{Q'} + \spad{b} \spad{Q}). That is when \spad{r} is zero then \spad{Q} is \spad{true} solution,{} otherwise \spad{r} represents unsolved part of \spad{c}. Moreover def(\spad{r}) < deg(\spad{bQ}). Note: \spad{SPDE1} assumes that deg(\spad{Q'}) < deg(\spad{bQ}) for all \spad{Q}.
885967`\spad{specialise(lp,{} c)} specializes all \spad{p} in \spad{lp} to the sample point of \spad{c}.
886213`\spad{special_order(f,{} lp)} computes sum of orders at special places,{} that is at infinite places and at places over zeros in polynomials in \spad{lp}. Elements of \spad{lp} must be relatively prime.
886297`\spad{specialTrigs(x,{} l)} should be local but conditional
886406`Generate a cubical complex equivalent to a solid hyper-sphere. That is,{} a solid volume with no holes in it,{} so we use a single \spad{n}-dimensional cube.
886507`Generate a simplicial complex equivalent to a solid hyper-sphere. That is,{} a solid volume with no holes in it,{} so we use a single \spad{n}-dimensional simplex.
886613`Generate a cubical complex equivalent to the surface of a hyper-sphere. That is,{} the surface of a volume with no holes in it,{} so we use the faces of a single cube.
886716`Generate a simplicial complex equivalent to the surface of a hyper-sphere. That is,{} the surface of a volume with no holes in it,{} so we use a minimal triangulation of the faces of a single simplex.
886824`\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)}.
886891`\spad{split(u(x) + sum_{P(a)=0} Q(a,{} x))} returns \spad{u(x) + sum_{P1(a)=0} Q(a,{} x) + ... + sum_{Pn(a)=0} Q(a,{} x)} where \spad{P1},{} ...,{} \spad{Pn} are the factors of \spad{P}.
886990`\spad{split(u(x) + sum_{P(a)=0} Q(a,{} x))} returns \spad{u(x) + sum_{P1(a)=0} Q(a,{} x) + ... + sum_{Pn(a)=0} Q(a,{} x)} where \spad{P1},{} ...,{} \spad{Pn} are the factors of \spad{P}.
887133`\spad{split(p)} returns a prime factorisation of \spad{p} over its splitting field.
887259`\spad{split(p,{} D)} returns \spad{[n,{}s]} such that \spad{p = n s},{} all the squarefree factors of \spad{n} are normal with respect to \spad{D},{} and \spad{s} is special with respect to \spad{D}. \spad{D} is the derivation to use.
887351`\spad{split(p,{} D)} returns \spad{[n,{} s]} such that \spad{p = n s},{} all the squarefree factors of \spad{n} are normal with respect to \spad{D},{} and \spad{s} is special with respect to \spad{D}. \spad{D} is the derivation to use.
887445`\spad{split(s,{} cc)} returns a list of substrings delimited by characters in \spad{cc}.
887510`\spad{split(s,{} c)} returns a list of substrings delimited by character \spad{c}.
887570`\spad{split(aG,{} vector)} returns a subalgebra \spad{A} of all square matrix of dimension \spad{n} as a list of list of matrices,{} generated by the list of matrices \spad{aG},{} where \spad{n} denotes both the size of vector as well as the dimension of each of the square matrices. {\em V R} is an A-module in the natural way. split(\spad{aG},{} vector) then checks whether the cyclic submodule generated by {\em vector} is a proper submodule of {\em V R}. If successful,{} it returns a two-element list,{} which contains first the list of the representations of the submodule,{} then the list of the representations of the factor module. If the vector generates the whole module,{} a one-element list of the old representation is given. Note: a later version this should call the other split.
887680`\spad{split(aG,{} submodule)} uses a proper submodule of {\em R^n} to create the representations of the submodule and of the factor module.
887798`\spad{split!(u,{} n)} splits \spad{u} into two aggregates: \spad{v = rest(u,{} n)} and \spad{w = first(u,{} n)},{} returning \spad{v} and setting \spad{u} to \spad{w}. If \spad{n} is 0,{} split! currently only works for Stream and gives error for List. Note: afterwards \spad{rest(u,{} n)} returns \spad{empty()}.
887896`\spad{split(x,{} b)} splits binary search tree \spad{b} into two trees,{} one with elements less than \spad{x},{} the other with elements greater than or equal to \spad{x}.
887969`\spad{splitConstant(f,{} x)} returns \spad{[c,{} g]} such that \spad{f = c * g} and \spad{c} does not involve \spad{t}.
888064`\spad{splitDenominator([q1,{} ...,{} qn])} returns \spad{[[p1,{} ...,{} pn],{} d]} such that \spad{\spad{qi} = pi/d} and \spad{d} is a common denominator for the \spad{qi}\spad{'s}.
888153`\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}.
888254`\spad{splitDenominator([q1,{} ...,{} qn])} returns \spad{[[p1,{} ...,{} pn],{} d]} such that \spad{\spad{qi} = pi/d} and \spad{d} is a common denominator for the \spad{qi}\spad{'s}.
888336`\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}.
888537`\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.
888655`\spad{splitList(f,{} x)} splits the list \spad{x} into a yes part and a no part according to the boolean function \spad{f}
888750`\spad{split_mat!(mat,{} nr0,{} nr1,{} nr2,{} pmod1,{} pmod2)} splits modular composition matrix \spad{mat} into two matrices,{} first modulo \spad{pmod1},{} second modulo \spad{pmod2}. To save space first result replaces first \spad{nr1} rows of \spad{mat},{} second result is stored in next \spad{nr2} rows of \spad{mat}. \spad{nr0} is number of rows used in argument.
888866`\spad{splitNodeOf!(l,{} a,{} ls)} returns \spad{a} where the children list of \spad{l} has been set to \spad{[[s]\$\% for s in ls | not nodeOf?(s,{} a)]}. Thus,{} if \spad{l} is not a node of \spad{a},{} this latter splitting tree is unchanged.
888947`\spad{splitNodeOf!(l,{} a,{} ls,{} sub?)} returns \spad{a} where the children list of \spad{l} has been set to \spad{[[s]\$\% for s in ls | not subNodeOf?(s,{} a,{} sub?)]}. Thus,{} if \spad{l} is not a node of \spad{a},{} this latter splitting tree is unchanged.
889043`\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 with respect to \spad{D} and each \spad{s_i} is special with respect to \spad{D}. \spad{D} is the derivation to use.
889167`\spad{spnt(a,{} b)} constructs a 2D point defined by a and \spad{b} of type \spad{R}
889231`\spad{spnt(a,{} b,{} c)} constructs a 3D point defined by a,{} \spad{b} and \spad{c} of type \spad{R}
889307`\spad{sPol }\undocumented
889442`sPol
889570`\spad{sqfree(p)} returns the product of square free factors of \spad{p}
889643`\spad{sqfrFactor(base,{} exponent)} creates a factored object with a single factor whose \spad{base} is asserted to be square-free (flag = "sqfr").
889707`\spad{sqrt(x)} represents the Fortran intrinsic function SQRT
889787`\spad{sqrt(x)} computes one \spad{y} such that \spad{y^2} = \spad{x},{} error if there is no square root,{} \spadignore{i.e.} jacobi(\spad{x},{}\spad{p}) = \spad{-1}. Implementation according to http://www.staff.uni-mainz.de/pommeren/Cryptology/Asymmetric/5_NTh/
890019`\spad{sqrt(x)} returns the square root of \spad{x}. The branch cut lies along the negative real axis,{} continuous with quadrant II.
890062`\spad{sqrt(x)} is \spad{x ^ (1/2)}
890105`\spad{sqrt(x)} computes one \spad{y} such that \spad{y^2} = \spad{x},{} error if there is no square root,{} \spadignore{i.e.} jacobi(\spad{x},{}\spad{p}) = \spad{-1}.
890146`\spad{sqrt(x)} is \spad{x ^ (1/2)}
890205`\spad{sqrt(x)} is \spad{x ^ (1/2)}
890311`\spad{sqrt(b,{} a)} returns a square root of \spad{b}. Argument \spad{a} is a square root of \spad{b} \spad{(mod p)}.
890370`\spad{sqrt(x,{} n)} is \spad{x ^ (1/n)}
890562`\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.
890624`\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.
890701`\spad{squareFree(n)} returns the square free factorization of integer \spad{n}
890775`\spad{squareFree(p)} computes the square free decomposition of a multivariate polynomial \spad{p}.
890851`\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.
890930`\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.
891320`\spad{squareFree(p)} computes the square free decomposition of a multivariate polynomial \spad{p} presented as a univariate polynomial with multivariate coefficients.
891452`\spad{squareFree(p)} returns the square free factorization of the polynomial \spad{p}.
891542`\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.
891611`\spad{squareFree(ts)} returns the square-free factorization of \spad{ts}. Moreover,{} each factor is a Lazard triangular set and the decomposition is a Kalkbrener split of \spad{ts},{} which is enough here for the matter of solving zero-dimensional algebraic systems. WARNING: \spad{ts} is not checked to be zero-dimensional.
891865`\spad{squareFreeBasis(lp)} computes \spad{gcd} basis of square-free parts of elements of \spad{lp}
891963`\spad{squareFreeFactors(p)} returns the square-free factors of \spad{p} over \spad{R}
892064`\spad{squareFreeLexTriangular(base,{} norm?)} decomposes the variety associated with \spad{base} into square-free regular chains. Thus a point belongs to this variety iff it is a regular zero of a regular set in in the output. Note that \spad{base} needs to be a lexicographical Groebner basis of a zero-dimensional ideal. If \spad{norm?} is \spad{true} then the regular sets are normalized.
892371`\spad{squareFreePart(p)} returns a polynomial which has the same irreducible factors as the univariate polynomial \spad{p},{} but each factor has multiplicity one.
892637`\spad{squareFreePart(p)} returns product of all the irreducible factors of polynomial \spad{p} each taken with multiplicity one.
892721`\spad{squareFreePart(x)} returns a product of prime factors of \spad{x} each taken with multiplicity one.
892784`\spad{squareFreePart(p,{} ts)} returns \spad{lpwt} such that \spad{lpwt.i.val} is a square-free polynomial with respect to \spad{lpwt.i.tower},{} this polynomial being associated with \spad{p} modulo \spad{lpwt.i.tower},{} for every \spad{i}. Moreover,{} the list of the \spad{lpwt.i.tower} is a split of Kalkbrener of \spad{ts}. WARNING: This assumes that \spad{p} is a non-constant polynomial such that if \spad{p} is added to \spad{ts},{} then the resulting set is a regular triangular set.
893152`\spad{squareFreePolynomial(p)} returns the square-free factorization of the univariate polynomial \spad{p}.
893293`\spad{squareMatrix(m)} converts a matrix of type \spadtype{Matrix} to a matrix of type \spadtype{SquareMatrix}.
893425`\spad{squareTop(m)} returns an \spad{n}-by-\spad{n} array consisting of the first \spad{n} rows of the \spad{m}-by-\spad{n} array \spad{m}. Error: if \spad{m < n}.
893496`\spad{stack([x,{} y,{} ...,{} z])} creates a stack with first (top) element \spad{x},{} second element \spad{y},{} ...,{} and last element \spad{z}.
893539`\spad{standardBasisOfCyclicSubmodule(lm,{} v)} returns a matrix as follows. It is assumed that the size \spad{n} of the vector equals the number of rows and columns of the matrices. Then the matrices generate a subalgebra,{} say \spad{A},{} of the algebra of all square matrices of dimension \spad{n}. {\em V R} is an \spad{A}-module in the natural way. standardBasisOfCyclicSubmodule(\spad{lm},{} \spad{v}) calculates a matrix whose non-zero column vectors are the \spad{R}-Basis of {\em Av} achieved in the way as described in section 6 of \spad{R}. A. Parker\spad{'s} "The Meat-Axe". Note: in contrast to {\em cyclicSubmodule},{} the result is not in echelon form.
893672`The 'star' of a simplicial complex and a facet contains only the faces of \spad{s} which include simplex.
893741`\spad{startPolynomial(p)} uses the ideas of Schoenhage\spad{'s} variant of Graeffe\spad{'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} which are otherwise 1.
893848`construct bit stream
893904`construct bit stream by parsing string containing 0,{} 1 and *
893953`\spad{startStats!(x)} initializes the statistics process and sets the comments to display when statistics are printed
894034`\spad{startTableGcd!(s1,{} s2,{} s3)} is an internal subroutine,{} exported only for development.
894124`\spad{startTableGcd!(s1,{} s2,{} s3)} is an internal subroutine,{} exported only for development.
894224`\spad{startTableGcd!(s1,{} s2,{} s3)} is an internal subroutine,{} exported only for development.
894432`\spad{startTableInvSet!(s1,{} s2,{} s3)} is an internal subroutine,{} exported only for development.
894646`\spad{statement2Fortran(of)}
894723`\spad{statistics()} prints a statistic on the use of the lazy evaluation mechanism. It displays the number of lazy differentiations performed and how many of them had to be executed explicitly later on.
894780`\spad{statistics()} prints out a summary of the outcome of the testcases so far. Use \spad{clear completely} to reset the statistics.
894829`\spad{status(n)} returns the status of the node \spad{n}.
894883`\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
894971`\spad{stFunc1(f)} is a local function exported due to compiler problem. This function is of no interest to the top-level user.
895079`\spad{stFunc2(f)} is a local function exported due to compiler problem. This function is of no interest to the top-level user.
895204`\spad{stFuncN(f)} is a local function xported due to compiler problem. This function is of no interest to the top-level user.
895324`\spad{stirling1(n,{} m)} returns the Stirling number of the first kind denoted \spad{S[n,{} m]}.
895390`\spad{stirling2(n,{} m)} returns the Stirling number of the second kind denoted \spad{SS[n,{} m]}.
895456`\spad{stirling(i,{} k,{} q)} computes the corresponding modified Stirling number.
895581`\spad{stop()} creates a representation of a STOP statement.
895619`\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.
895697`\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.
895790`\spad{stopTableGcd!()} is an internal subroutine,{} exported only for development.
895859`\spad{stopTableGcd!()} is an internal subroutine,{} exported only for development.
895938`\spad{stopTableGcd!()} is an internal subroutine,{} exported only for development.
896104`\spad{stopTableInvSet!()} is an internal subroutine,{} exported only for development.
897872`\spad{STransform(x)} returns the Taylor expansion of the \spad{S}-transform \spad{S(z)} of the distribution \spad{x} if the mean is nonzero.
897959`\spad{stransform(cpx)} construct transform as function of complex variable can only be used when \spad{PT} is SArgand so this can be converted to \spad{PT} \spad{->} \spad{PT}
898050`\spad{stransform(m)} construct transform using a multivector
898114`\spad{stransform(m)} constructs transform with given matrix elements
898184`\spad{stransform(gen)} construct transform in general form as a mapping from \spad{PT} to \spad{PT}
898239`\spad{STransform(x)} returns the Puiseux expansion of the \spad{S}-transform \spad{S(z)}.
898325`\spad{STransform(x)} returns the Puiseux expansion of the \spad{S}-transform \spad{S(z)} if the mean is zero.
898412`\spad{stranslate(offsetx,{} offsety,{} offsetz,{} scalex,{} scaley,{} scalez)} constructs a transform which represents pure translation we can also combine with scale which,{} for instance,{} is useful when writing to \spad{SVG} file because the \spad{y} dimension is inverted
898530`\spad{stream(x)} returns stream of entries
898587`\spad{stream(f)} creates an infinite stream all of whose elements are equal to \spad{f()}. Note: \spad{stream(f) = [f(),{} f(),{} f(),{} ...]}.
898630`\spad{stream(f,{} s)} returns \spad{[s,{} f(s),{} f(f(s)),{} ...]}.
898683`\spad{stream(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{stream(f,{} x) = [x,{} f(x),{} f(f(x)),{} ...]}.
898729`\spad{string?(f)} checks if \spad{f} is a string,{} this implies atom?(\spad{f})
898790`\spad{string(f)} gives string corresponding to \spad{f}. Valid only when string?(\spad{f}) is \spad{true}
898849`\spad{string?(s)} is \spad{true} if \spad{s} is an atom and belong to \spad{Str}.
898922`\spad{string(i)} returns the decimal representation of \spad{i} as a string.
898972`\spad{string(s)} returns \spad{s} as an element of \spad{Str}. Error: if \spad{s} is not an atom that also belongs to \spad{Str}.
899040`\spad{string(s)} converts the symbol \spad{s} to a string. Error: if the symbol is subscripted.
899081`\spad{stripCommentsAndBlanks(s)} treats \spad{s} as a piece of FriCAS input,{} and removes comments,{} and leading and trailing blanks.
899154`\spad{strongGenerators(gp)} returns strong generators for the group {\em gp}.
899299`\spad{stronglyReduce(p,{} ts)} returns a polynomial \spad{r} such that \spad{stronglyReduced?(r,{} ts)} holds and there exists some product \spad{h} of \spad{initials(ts)} such that \spad{h*p - r} lies in the ideal generated by \spad{ts}.
899442`\spad{stronglyReduced?(ts)} returns \spad{true} iff every element of \spad{ts} is reduced with respect to any other element of \spad{ts}.
899593`\spad{stronglyReduced?(p,{} ts)} returns \spad{true} iff \spad{p} is reduced with respect to \spad{ts}.
899671`\spad{structuralConstants()} calculates the structural constants \spad{[(gammaijk) for k in 1..rank()]} defined by \spad{\spad{vi} * vj = gammaij1 * v1 + ... + gammaijn * vn},{} where \spad{v1},{} ...,{} \spad{vn} is the fixed \spad{R}-module basis.
899762`\spad{structuralConstants()} calculates the structural constants \spad{[(gammaijk) for k in 1..rank()]} defined by \spad{\spad{vi} * vj = gammaij1 * v1 + ... + gammaijn * vn},{} where \spad{v1},{} ...,{} \spad{vn} is the fixed \spad{R}-module basis.
900042`\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.
900144`\spad{structuralConstants([v1,{} v2,{} ...,{} vm])} calculates the structural constants \spad{[(gammaijk) for k in 1..m]} defined by \spad{\spad{vi} * vj = gammaij1 * v1 + ... + gammaijm * vm},{} where \spad{[v1,{} ...,{} vm]} is an \spad{R}-module basis of a subalgebra.
900245`\spad{structuralConstants(ls,{} mt)} determines the structural constants of an algebra with generators \spad{ls} and multiplication table \spad{mt},{} the entries of which must be given as linear polynomials in the indeterminates given by \spad{ls}. The result is in particular useful \indented{1}{as fourth argument for \spadtype{AlgebraGivenByStructuralConstants}} \indented{1}{and \spadtype{GenericNonAssociativeAlgebra}.}
900398`\spad{structuralConstants(ls,{} mt)} determines the structural constants of an algebra with generators \spad{ls} and multiplication table \spad{mt},{} the entries of which must be given as linear polynomials in the indeterminates given by \spad{ls}. The result is in particular useful \indented{1}{as fourth argument for \spadtype{AlgebraGivenByStructuralConstants}} \indented{1}{and \spadtype{GenericNonAssociativeAlgebra}.}
900531`\spad{struveH(v,{} z)} is the Struve \spad{H} function.
900594`\spad{struveH(v,{} z)} is the Struve \spad{H} function.
900650`\spad{struveL(v,{} z)} is the Struve \spad{L} function defined by the formula \spad{struveL(v,{} z) = -\%i^exp(-v*\%pi*\%i/2)*struveH(v,{} \%i*z)}.
900713`\spad{struveL(v,{} z)} is the Struve \spad{L} function defined by the formula \spad{struveL(v,{} z) = -\%i^exp(-v*\%pi*\%i/2)*struveH(v,{} \%i*z)}.
900769`\spad{stube(functions: List Clipd,{} r,{} n)} creates a tube of radius \spad{r} around the curve functions.
900941`\spad{SturmHabicht(p1,{} p2)} computes \spad{c_}{+}\spad{-c_}{-} where \spad{c_}{+} is the number of real roots of \spad{p1} with \spad{p2>0} and \spad{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}.
901012`\spad{SturmHabichtCoefficients(p1,{} p2)} computes the principal Sturm-Habicht coefficients of \spad{p1} and \spad{p2}
901095`\spad{SturmHabichtMultiple(p1,{} p2)} computes \spad{c_}{+}\spad{-c_}{-} where \spad{c_}{+} is the number of real roots of \spad{p1} with \spad{p2>0} and \spad{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}.
901190`\spad{SturmHabichtSequence(p1,{} p2)} computes the Sturm-Habicht sequence of \spad{p1} and \spad{p2}
901270`\spad{sturmSequence(p) = sylvesterSequence(p,{} p')}
901373`\spad{sturmVariationsOf(l)} is the number of sign variations in the list of numbers \spad{l},{} note that the first term counts as a sign
901517`\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}.
901561`\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.
901637`\spad{sub1!(pol,{} md)} subtracts 1 from the polynomial \spad{pol}.
901716`\spad{sub(f,{} n)} creates a form for \spad{f} subscripted by \spad{n}.
901755`\spad{subCase?(lpwt1,{} lpwt2)} is an internal subroutine,{} exported only for development.
901882`\spad{subCase?(lpwt1,{} lpwt2)} is an internal subroutine,{} exported only for development.
902107`\spad{subdiagramSvg(sc,{} n,{} dispArrowName,{} deep)} creates a branch of an \spad{SVG} diagram diagram under an already existing scene node \spad{sc}. \spad{n:} \% is the graph that will be written dispArrowName: Boolean is \spad{true} to include the name of each arrow
902198`\spad{subdivide(me)} for each face calculate a new point in the centre of the face,{} then build a new set of faces which include the new point.
902243`\spad{subMatrix} returns several elements out of a matrix. The elements are stacked into a submatrix.
902335`\spad{subMatrix} returns several elements out of a matrix. The elements are stacked into a submatrix.
902533`\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}.
902636`\spad{subMatrix(p,{} r_min,{} r_max,{} c_min,{} c_max,{} l)} returns the specified submatrix \spad{l} of the linear pencil \spad{p}.
902805`\spad{submod(a,{} b,{} p)},{} \spad{0<=a,{} b<p>1},{} means \spad{a-b mod p}.
902858`\spad{subNode?(n1,{} n2,{} o2)} returns \spad{true} iff \spad{value(n1) = value(n2)} and \spad{o2(condition(n1),{} condition(n2))}
902931`\spad{subNodeOf?(s,{} a,{} sub?)} returns \spad{true} iff for some node \spad{n} in \spad{a} we have \spad{s = n} or \spad{status(n)} and \spad{subNode?(s,{} n,{} sub?)}.
903023`\spad{subordinationConvolution(x,{} y)} returns the subordination convolution of the distributions \spad{x} and \spad{y}
903096`\spad{subPencil(p,{} lst_row,{} lst_col)} returns a pencil with submatrices specified by a list of rows and columns.
903212`\spad{subPencil(p,{} r_min,{} r_max,{} c_min,{} c_max)} returns a pencil with the specified submatrices.
903354`\spad{subPolSet?(lp1,{} lp2)} returns \spad{true} iff \spad{lp1} is a sub-set of \spad{lp2}.
903441`\spad{subPolSet?(lp1,{} lp2)} returns \spad{true} iff \spad{lp1} is a sub-set of \spad{lp2}.
903538`\spad{sub_poly(pol1,{} pol2,{} md)} subtracts polynomials \spad{pol2} from \spad{pol1}.
903623`\spad{subQuasiComponent?(ts,{} lus)} returns \spad{true} iff \spad{subQuasiComponent?(ts,{} us)} holds for one \spad{us} in \spad{lus}.
903714`\spad{subQuasiComponent?(ts,{} lus)} returns \spad{true} iff \spad{subQuasiComponent?(ts,{} us)} holds for one \spad{us} in \spad{lus}.
903815`\spad{subQuasiComponent?(ts,{} us)} returns \spad{true} iff \spadopFrom{internalSubQuasiComponent?}{QuasiComponentPackage} returns \spad{true}.
903900`\spad{subQuasiComponent?(ts,{} us)} returns \spad{true} iff \spadopFrom{internalSubQuasiComponent?(\spad{ts},{} us)}{QuasiComponentPackage} returns \spad{true}.
903995`\spad{subResultantChain(a,{} b)},{} where \spad{a} and \spad{b} are not constant polynomials with the same main variable,{} returns the subresultant chain of \spad{a} and \spad{b}.
904099`\spad{subResultantGcd(P,{} Q)} returns the \spad{gcd} of two primitive polynomials \spad{P} and \spad{Q}.
904180`\spad{subResultantGcd(a,{} b)} computes a \spad{gcd} of \spad{a} and \spad{b} where \spad{a} and \spad{b} are assumed to have the same main variable \spad{v} and are viewed as univariate polynomials in \spad{v} with coefficients in the fraction field of the polynomial ring generated by their other variables over \spad{R}.
904276`\spad{subResultantGcd(p,{} q)} computes the \spad{gcd} of the polynomials \spad{p} and \spad{q} using the SubResultant \spad{GCD} algorithm.
904369`\spad{subResultantGcdEuclidean(P,{} Q)} carries out the equality \spad{coef1*P + coef2*Q = +/- S_i(P,{} Q)} where the degree (not the indice) of the subresultant \spad{S_i(P,{} Q)} is as small as possible.
904593`\spad{subresultants(p,{} q)} returns a vector of subresultants of \spad{p} and \spad{q},{} in ascending order,{} starting with index 0.
904705`\spad{subResultantsChain(a,{} b)} returns the list of the non-zero sub-resultants of \spad{a} and \spad{b} sorted by increasing degree.
904808`\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)}.
904896`\spad{subscript(p)} returns a handler such that \spad{subscript(p)(prec,{} args)} formats the first argument with respect to the precedence \spad{p}. The other arguments are formatted without parentheses and interpreted as subscripts separated by commas. Outer parentheses are added if \spad{p < prec}.
904988`\spad{subscript(s,{} [a1,{} ...,{} an])} returns \spad{s} subscripted by \spad{[a1,{} ...,{} an]}.
905101`\spad{subset?(u,{} v)} tests if \spad{u} is a subset of \spad{v}. Note: equivalent to \spad{reduce(and,{} [member?(x,{} v) for x in members(u)],{} true,{} false)}.
905155`\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))}.
905254`construct subset lattice element
905317`\spad{subspace()} \undocumented
905361`\spad{subspace(s)} returns the \spadtype{SubSpace} which holds all the point information in the \spadtype{ThreeSpace},{} \spad{s}.
905426`\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}.
905504`\spad{subspace?(B1,{} B2)} tests if the first space is included in the second.
905564`\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}.
905884`\spad{subst(eq1,{} eq2)} substitutes \spad{eq2} into both sides of \spad{eq1} the \spad{lhs} of \spad{eq2} should be a kernel
905948`\spad{subst(f,{} k = g)} replaces the kernel \spad{k} by \spad{g} formally in \spad{f}.
906008`\spad{subst(f,{} [k1 = g1,{} ...,{} kn = gn])} replaces the kernels \spad{k1},{} ...,{} \spad{kn} by \spad{g1},{} ...,{} \spad{gn} formally in \spad{f}.
906074`substitution of 'a' for \spad{'b'} in \spad{'n'}
906117`\spad{subst(f,{} jv,{} exp)} substitutes \spad{exp} for the jet variable \spad{jv} in the function \spad{f}.
906302`\spad{subst(f,{} [k1...,{} kn],{} [g1,{} ...,{} gn])} replaces the kernels \spad{k1},{} ...,{} \spad{kn} by \spad{g1},{} ...,{} \spad{gn} formally in \spad{f}.
911632`\spad{substHP options} returns a specification for Hermite-Pade approximation with the substitution operator
912523`\spad{substitute(x,{} y,{} d)} replace \spad{x}\spad{'s} with \spad{y}\spad{'s} in dictionary \spad{d}.
912583`\spad{substring?(s,{} t,{} i)} tests if \spad{s} is a substring of \spad{t} beginning at index \spad{i}. Note: \spad{substring?(s,{} t,{} 0) = prefix?(s,{} t)}.
912715`\spad{subst_vars(p,{} lv1,{} lv2)} substitutes variables from list \spad{lv2} for corresponding variables from \spad{lv1}.
912905`\spad{subSylvesterMatrix(S,{} j)} returns the \spad{j}th sub-Sylvester matrix \spad{jS}.
913109`\spad{subSylvesterMatrix(S,{} j,{} i)} returns sub-Sylvester matrix jSi.
913217`used by link. Returns face 'a' minus the vertices in face \spad{'b'}.
913329`\spad{subtractIfCan(x,{} y)} returns an element \spad{z} such that \spad{z+y=x} or "failed" if no such element exists.
913409`\spad{subTriSet?(ts,{} us)} returns \spad{true} iff \spad{ts} is a sub-set of \spad{us}.
913486`\spad{subTriSet?(ts,{} us)} returns \spad{true} iff \spad{ts} is a sub-set of \spad{us}.
913573`\spad{suchThat(p,{} f)} makes a copy of \spad{p} and adds the predicate \spad{f} to the copy,{} which is returned.
913658`\spad{suchThat(p,{} [f1,{} ...,{} fn])} makes a copy of \spad{p} and adds the predicate \spad{f1} and ... and \spad{fn} to the copy,{} which is returned.
913749`\spad{suchThat(x,{} foo)} attaches the predicate foo to \spad{x}; error if \spad{x} is not a symbol.
913830`\spad{suchThat(x,{} [f1,{} f2,{} ...,{} fn])} attaches the predicate \spad{f1} and \spad{f2} and ... and \spad{fn} to \spad{x}. Error: if \spad{x} is not a symbol.
913917`\spad{suchThat(x,{} foo)} attaches the predicate foo to \spad{x}.
914004`\spad{suchThat(x,{} [f1,{} f2,{} ...,{} fn])} attaches the predicate \spad{f1} and \spad{f2} and ... and \spad{fn} to \spad{x}.
914097`\spad{suchThat(p,{} [a1,{} ...,{} an],{} f)} returns a copy of \spad{p} with the top-level predicate set to \spad{f(a1,{} ...,{} an)}.
914201`\spad{suchThat(r,{} [a1,{} ...,{} an],{} f)} returns the rewrite rule \spad{r} with the predicate \spad{f(a1,{} ...,{} an)} attached to it.
914286`\spad{sufactor(p)} factorizes \spad{p} into prime factors.
914482`\spad{sufactor_square_free(p)} factorizes \spad{p} into prime factors. \spad{p} must be square free.
914624`\spad{suffix?(s,{} t)} tests if the string \spad{s} is the final substring of \spad{t}. Note: \spad{suffix?(s,{} t) = reduce(and,{} [s.i = t.(n - m + i) for i indices s])} where \spad{m} and \spad{n} denote the maxIndex of \spad{s} and \spad{t} respectively.
914678`\spad{su_irreducible?(p)} tests if \spad{p} is irreducible. \spad{p} must be monic and square free.
914787`\spad{sum(expr)} creates the form prefixing \spad{expr} by a capital sigma.
914824`\spad{sum(p)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats a sum expression with summation sign and respective limits. Outer parentheses are added if \spad{p < prec}.
914910`\spad{sum(expr,{} lowerlimit)} creates the form prefixing \spad{expr} by a capital sigma with a lowerlimit.
914949`\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) = p(n)}.
915023`\spad{sum(f(n),{} n = a..b)} returns \spad{f(a) + f(a+1) + ... f(b)}.
915177`\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)}.
915298`\spad{sum(f(n),{} n = a..b)} returns \spad{f}(a) + \spad{f}(\spad{a+1}) + ... + \spad{f}(\spad{b}).
915364`\spad{sum(a(n),{} n)} returns A(\spad{n}) such that A(\spad{n+1}) - A(\spad{n}) = a(\spad{n}).
915419`\spad{sum(f(n),{} n = a..b)} returns \spad{f(a) + f(a+1) + ... f(b)}.
915532`\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)}.
915622`\spad{sum(expr,{} lowerlimit,{} upperlimit)} creates the form prefixing \spad{expr} by a capital sigma with both a \spad{lowerlimit} and upperlimit.
915663`\spad{sum(p(n),{} n = a..b)} returns \spad{p(a) + p(a+1) + ... + p(b)}.
915748`\spad{sumBasis Lb} computes a basis of the sum of list of subspaces. This function is slightly more efficient than \spad{reduce(sumBasis,{} Lb)}.
915805`\spad{sumBasis LLv} computes a basis of the sum of the list of subspaces represented by \spad{LLv}. This function is slightly more efficient than \spad{reduce(sumBasis,{} LLv)}.
915876`\spad{sumBasis(B1,{} B2)} computes a basis of the sum of the two subspaces.
915929`\spad{sumBasis(Lv1,{} Lv2)} computes a basis of the sum of the two subspaces spanned by the vectors of \spad{Lv1} and \spad{Lv2}.
916010`\spad{summands(f)} analysis the block structure of the system matrix of the ALS of \spad{f} to split \spad{f} into summands.
916074`\spad{summation(f(n),{} n = a..b)} returns \spad{f}(a) + ... + \spad{f}(\spad{b}) as a formal sum.
916151`\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}).
916217`\spad{summation(f(n),{} n = a..b)} returns \spad{f}(a) + ... + \spad{f}(\spad{b}) as a formal sum.
916292`\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}).
916356`\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)}.
916433`\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)}.
916537`\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.
916617`\spad{sunion(x,{} y)} gives the union of two boundaries as a box,{} \indented{2}{that is it gives a box that is external to both.} \spad{x:} \% is first boundary to be combined \spad{y:} \% is second boundary to be combined
916662`\spad{sup(u)} returns the supremum of \spad{u}.
916708`\spad{sup(x,{} y)} returns the least element from which both \spad{x} and \spad{y} can be subtracted.
916760`\spad{supDimElseRittWu(ts,{} us)} returns \spad{true} iff \spad{ts} has less elements than \spad{us} otherwise if \spad{ts} has higher rank than \spad{us} with respect to Riit and Wu ordering.
916844`\spad{supDimElseRittWu?(ts,{} us)} returns \spad{true} iff \spad{ts} has less elements than \spad{us} otherwise if \spad{ts} has higher rank than \spad{us} with respect to Ritt and Wu ordering.
916938`\spad{super(f,{} n)} creates a form for \spad{f} superscripted by \spad{n}.
916979`\spad{superscript(s,{} [a1,{} ...,{} an])} returns \spad{s} superscripted by \spad{[a1,{} ...,{} an]}.
917037`\spad{supersub(a,{} [sub1,{} super1,{} sub2,{} super2,{} ...])} creates a form with each subscript aligned under each superscript.
917144`\spad{support(x)} returns the list of basis elements with nonzero coefficients.
917277`\spad{supRittWu?(a,{} b)} returns \spad{true} if \spad{a} is greater than \spad{b} with respect to the Ritt and Wu Wen Tsun ordering using the refinement of Lazard.
917353`\spad{surface(c1,{} c2,{} c3)} creates a surface from 3 parametric component functions \spad{c1},{} \spad{c2},{} and \spad{c3}.
917472`\spad{svec(a,{} b)} constructs a 2D vector defined by a and \spad{b} of type \spad{R}
917536`\spad{svec(a,{} b,{} c)} constructs a 3D vector defined by a,{} \spad{b} and \spad{c} of type \spad{R}
917612`\spad{swap(p(x,{} y))} returns \spad{p}(\spad{y},{} \spad{x}).
917692`\spad{swap(eq)} interchanges left and right hand side of equation \spad{eq}.
917801`\spad{swap!(u,{} i,{} j)} interchanges elements \spad{i} and \spad{j} of aggregate \spad{u}. No meaningful value is returned.
917897`\spad{swapColumns!(f,{} i,{} j)} exchanges columns \spad{i} and \spad{j} in the ALS of \spad{f}.
917997`\spad{swapColumns!(p,{} i,{} j)} exchanges columns \spad{i} and \spad{j} in all matrices of the linear pencil \spad{p}.
918191`\spad{swapColumns!(m,{} i,{} j)} interchanges the \spad{i}th and \spad{j}th columns of \spad{m}. This destructively alters the array.
918281`\spad{swapRows!(f,{} i,{} j)} exchanges rows \spad{i} and \spad{j} in the ALS of \spad{f}.
918378`\spad{swapRows!(p,{} i,{} j)} exchanges rows \spad{i} and \spad{j} in all matrices of the linear pencil \spad{p}.
918566`\spad{swapRows!(m,{} i,{} j)} interchanges the \spad{i}th and \spad{j}th rows of \spad{m}. This destructively alters the array.
918653`\spad{swapRowsColumns!(f,{} i,{} j)} exchanges rows \spad{i} and \spad{j} and columns \spad{j} and \spad{i} in the ALS of \spad{f}.
918827`\spad{sylvesterMatrix(p,{} q)} returns the Sylvester matrix for the two nonzero polynomials \spad{p} and \spad{q}.
918898`\spad{sylvesterSequence(p,{} q)} is the negated remainder sequence of \spad{p} and \spad{q} divided by the last computed term
919013`\spad{symbol?(p)} tests if \spad{p} is a symbol.
919060`\spad{symbol(sys)} computes directly the symbol of the family \spad{sys} of functions.
919235`\spad{symbol?(f)} checks if \spad{f} is a symbol,{} this implies atom?(\spad{f})
919296`\spad{symbol(f)} gives symbol corresponding to \spad{f}. Valid only when symbol?(\spad{f}) is \spad{true}
919355`\spad{symbol?(s)} is \spad{true} if \spad{s} is an atom and belong to \spad{Sym}.
919428`\spad{symbol(s)} returns \spad{s} as an element of \spad{Sym}. Error: if \spad{s} is not an atom that also belongs to \spad{Sym}.
919496`\spad{symbolIfCan(k)} returns \spad{k} viewed as a symbol if \spad{k} is a symbol,{} and "failed" otherwise.
919569`\spad{symbolTable(l)} creates a symbol table from the elements of \spad{l}.
919656`\spad{symbolTableOf(f,{} tab)} returns the symbol table of \spad{f}
919724`\spad{symFunc([r1,{} ...,{} rn])} returns the vector of the elementary symmetric functions in the \spad{\spad{ri}'s}: \spad{[r1 + ... + rn,{} r1 r2 + ... + r(n-1) rn,{} ...,{} r1 r2 ... rn]}.
919790`\spad{symFunc(r,{} n)} returns the vector of the elementary symmetric functions in \spad{[r,{} r,{} ...,{} r]} \spad{n} times.
920005`\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.
920070`\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.
920270`\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,{} \spad{symmetricDifference(u,{} v)} returns a copy of \spad{u}. Note: \spad{symmetricDifference(u,{} v) = union(difference(u,{} v),{} difference(v,{} u))}
920330`\spad{symmetricGroup(n)} constructs the symmetric group of order \spad{n}-1. Note: generates all possible relations may not be minimal.
920399`\spad{symmetricGroup(\spad{li})} constructs the symmetric group acting on the integers in the list {\em \spad{li}},{} generators are the cycle given by {\em \spad{li}} and the 2-cycle {\em (\spad{li}.1,{} \spad{li}.2)}. Note: duplicates in the list will be removed.
920497`\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)}.
920597`\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}.
920711`\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.
920818`\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}.
920917`\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.
921070`\spad{symmetricRemainder(a,{} b)} (where \spad{b > 1}) yields \spad{r} where \spad{-b/2 < r <= b/2}.
921214`\spad{symmetricSquare(a)} computes \spad{symmetricProduct(a,{} a)} using a more efficient method.
921310`\spad{symmetricTensors(la,{} n)} applies to each \spad{m}-by-\spad{m} square matrix in the list {\em la} the irreducible,{} polynomial representation of the general linear group {\em GLm} which corresponds to the partition {\em (n,{} 0,{} ...,{} 0)} of \spad{n}. Error: if the matrices in {\em la} are not square matrices. Note: this corresponds to the symmetrization of the representation with the trivial representation of the symmetric group {\em Sn}. The carrier spaces of the representation are the symmetric tensors of the \spad{n}-fold tensor product.
921419`\spad{symmetricTensors(a,{} n)} applies to the \spad{m}-by-\spad{m} square matrix {\em a} the irreducible,{} polynomial representation of the general linear group {\em GLm} which corresponds to the partition {\em (n,{} 0,{} ...,{} 0)} of \spad{n}. Error: if {\em a} is not a square matrix. Note: this corresponds to the symmetrization of the representation with the trivial representation of the symmetric group {\em Sn}. The carrier spaces of the representation are the symmetric tensors of the \spad{n}-fold tensor product.
921516`\spad{systemCommand(cmd)} takes the string \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.
921579`Top (\spad{true} in logic).
921654`\spad{t(n)} \undocumented
921728`\spad{tab1(lp)} creates a tableau from a list of pairs \spad{lp}
921804`\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}.
921920`\spad{table()}\$\spad{T} creates an empty table of type \spad{T}.
921973`\spad{table(h)} creates an empty hash table that uses \spad{h} instead of hash\$Key. Note that \spad{h} should be a mathematical function in the sense that from \spad{k1=k2} follows \spad{h}(\spad{k1})\spad{=h}(\spad{k2}). If that is not the case,{} \spad{k1} and \spad{k2} will internally be considered as being different keys. For XHashTable to work correctly,{} the function \spad{h} must only yield non-negative values.
922125`\spad{table(lv)} computes the commutator table for a given list of vector fields.
922201`\spad{table([x,{} y,{} ...,{} z])} creates a table consisting of entries \spad{x,{} y,{} ...,{} z}.
922287`\spad{tableau(ll)} converts a list of lists \spad{ll} to a tableau.
922340`\spad{tableau(symb,{} chi)} computes the tableau parametrized by a given one-form.
922470`\spad{tableau(symb,{} lchi)} computes the extended tableau parametrized by a given list of one-forms.
922606`\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.}
922720`\spad{tablePow(maxdeg,{} prime,{} lpol)} constructs the table with the coefficients of the Extended Euclidean Algorithm for lpol. Here the right side is \spad{x^k},{} for \spad{k} less to \spad{maxdeg}. The operation returns "failed" when the elements are not coprime modulo \spad{prime}.
922985`\spad{tail(l)} returns the doubly-linked aggregate \spad{l} starting at its second element. Error: if \spad{l} is empty.
923037`\spad{tail(p)} returns its reductum,{} where \spad{p} is viewed as a univariate polynomial in its main variable.
923099`\spad{tail(u)} returns the last node of \spad{u}. Error if \spad{u} is empty.
923153`\spad{tails(u)} returns list [rest(\spad{u},{} 0),{} rest(\spad{u},{} 1),{} ...,{} rest(\spad{u},{} \#u - 1)].
923195`\spad{tan(x)} represents the Fortran intrinsic function TAN
923274`\spad{tan(x)} applies the tangent operator to \spad{x}
923480`\spad{tan(st)} computes tangent of a power series \spad{st}.
923564`\spad{tan(st)} computes tangent of a power series \spad{st}.
923662`\spad{tan(z)} returns the tangent of Laurent series \spad{z}.
923749`\spad{tan(z)} returns the tangent of a Puiseux series \spad{z}.
923845`\spad{tan(x)} returns the tangent of \spad{x}.
923901`\spad{tan2cot(f)} converts every \spad{tan(u)} appearing in \spad{f} into \spad{1/cot(u)}.
923964`\spad{tan2trig(f)} converts every \spad{tan(u)} appearing in \spad{f} into \spad{sin(u)/cos(u)}.
924028`\spad{tanAn(a,{} n)} returns \spad{P(x)} such that if \spad{a = tan(u)} then \spad{P(tan(u/n)) = 0}.
924121`\spad{tanh(x)} represents the Fortran intrinsic function TANH
924201`\spad{tanh(x)} applies the hyperbolic tangent operator to \spad{x}
924408`\spad{tanh(st)} computes the hyperbolic tangent of a power series \spad{st}.
924493`\spad{tanh(st)} computes the hyperbolic tangent of a power series \spad{st}.
924592`\spad{tanh(z)} returns the hyperbolic tangent of Laurent series \spad{z}.
924680`\spad{tanh(z)} returns the hyperbolic tangent of a Puiseux series \spad{z}.
924777`\spad{tanh(x)} returns the hyperbolic tangent of \spad{x}.
924831`\spad{tanh2coth(f)} converts every \spad{tanh(u)} appearing in \spad{f} into \spad{1/coth(u)}.
924896`\spad{tanh2trigh(f)} converts every \spad{tanh(u)} appearing in \spad{f} into \spad{sinh(u)/cosh(u)}.
924962`\spad{tanhIfCan(z)} returns tanh(\spad{z}) if possible,{} and "failed" otherwise.
925044`\spad{tanIfCan(z)} returns tan(\spad{z}) if possible,{} and "failed" otherwise.
925125`\spad{tanNa(a,{} n)} returns \spad{f(a)} such that if \spad{a = tan(u)} then \spad{f(a) = tan(n * u)}.
925182`\spad{tanQ(q,{} a)} is a local function with a conditional implementation.
925267`\spad{tanSum([a1,{} ...,{} an])} returns \spad{f(a1,{} ...,{} an)} such that if \spad{\spad{ai} = tan(\spad{ui})} then \spad{f(a1,{} ...,{} an) = tan(u1 + ... + un)}.
925323`\spad{Tau()} returns symbol for capital greek letter tau.
925373`\spad{tau()} returns symbol for small greek letter tau.
925423`\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.
925495`\spad{taylor(x)} returns \spad{x} viewed as a Taylor series.
925571`\spad{taylor(f(x))} converts the Laurent series \spad{f}(\spad{x}) to a Taylor series,{} if possible. Error: if this is not possible.
925655`\spad{taylor(n +-> a(n),{} x = a)} returns \spad{sum(n = 0..,{} a(n)*(x-a)^n)}.
925746`\spad{taylor(f,{} x = a)} expands the expression \spad{f} as a Taylor series in powers of \spad{(x - a)}.
925831`\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}.
926008`\spad{taylor(a(n),{} n,{} x = a)} returns \spad{sum(n = 0..,{} a(n)*(x-a)^n)}.
926151`\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)}.
926279`\spad{taylor(n +-> a(n),{} x,{} a)} returns \spad{sum(n = 0..,{} a(n)*(x-a)^n)}.
926364`\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}.
926729`\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)}.
926909`\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)}.
927206`\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.
927311`\spad{taylorQuoByVar(a0 + a1 x + a2 x^2 + ...)} returns \spad{a1 + a2 x + a3 x^2 + ...}
927387`\spad{taylorRep(f(x))} returns \spad{g(x)},{} where \spad{f = x^n * g(x)} is represented by \spad{[n,{} g(x)]}.
927474`\spad{taylor_via_deriv(f,{} [x1,{} ...,{} xn],{} [D1,{} ...,{} Dn])} expands \spad{f} into Taylor series at (\spad{x1},{} ...,{} \spad{xn}) using \spad{D1},{} ...,{} \spad{Dn} as partial derivatives
927590`\spad{taylor_via_deriv(f,{} [x1,{} ...,{} xn],{} [D1,{} ...,{} Dn])} expands \spad{f} into Taylor series at (\spad{x1},{} ...,{} \spad{xn}) using \spad{D1},{} ...,{} \spad{Dn} as partial derivatives
927709`\spad{taylor_via_deriv(f,{} [x1,{} ...,{} xn],{} [D1,{} ...,{} Dn])} expands \spad{f} into Taylor series at (\spad{x1},{} ...,{} \spad{xn}) using \spad{D1},{} ...,{} \spad{Dn} as partial derivatives
927823`\spad{taylor_via_deriv(f,{} [x1,{} ...,{} xn],{} [D1,{} ...,{} Dn])} expands \spad{f} into Taylor series at (\spad{x1},{} ...,{} \spad{xn}) using \spad{D1},{} ...,{} \spad{Dn} as partial derivatives
927940`\spad{taylor_via_lode([a0,{} ...,{} ak],{} z,{} [c0,{} ...,{} ck])} expands into Taylor series solution of the linear ordinary differential equation
928155`\spad{tensor([x1,{} x2,{} ...,{} xn])} constructs the tensor product of \spad{x1,{} x2,{} ...,{} xn}.
928217`\spad{tensor(a,{} b)} creates a form for a tensor \spad{b}
928314`\spad{tensor(x,{} y)} constructs the tensor product of the elements \spad{x} and \spad{y}.
928374`\spad{tensorMap([s1,{} s2,{} ...],{} f)} returns the stream consisting of all elements of \spad{f}(\spad{s1}) followed by all elements of \spad{f}(\spad{s2}) and so on.
928451`\spad{tensorProduct([a1,{} ...ak])} calculates the list of Kronecker products of each matrix {\em \spad{ai}} with itself for {1 \spad{<=} \spad{i} \spad{<=} \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.
928541`\spad{tensorProduct(a)} calculates the Kronecker product of the matrix {\em a} with itself.
928619`\spad{tensorProduct([a1,{} ...,{} ak],{} [b1,{} ...,{} bk])} calculates the list of Kronecker products of the matrices {\em \spad{ai}} and {\em \spad{bi}} for {1 \spad{<=} \spad{i} \spad{<=} \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.
928725`\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.
928850`\spad{terminal(a)} constructs a graph over a with a single vertex and a single loop
928896`\spad{terms(f)} gives the list of non-zero coefficients combined with their corresponding basis element as records. This is the internal representation.
928968`\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. Warning: If the series \spad{f} has only finitely many non-zero terms,{} then accessing the resulting stream might lead to an infinite search for the next non-zero coefficient.
929067`\spad{test(b)} returns \spad{b} and is provided for compatibility with the new compiler.
929108`\spad{testAbsolutePrecision(eps)} returns the current absolute precision used for floating point comparison,{} and then sets it to \spad{eps}. The default value is 1.0e-15.
929190`\spad{testcase s} starts a new testcase with \spad{s} as title. It also calls \spad{clear all}. A testcase is composed of several tests.
929243`\spad{testcaseNoClear s},{} starts a new testcase with \spad{s} as title,{} without calling \spad{clear all}. A testcase is composed of several tests.
929303`test function.
929576`\spad{testComplexEquals(ex1,{} ex2)} states that \spad{ex1} and \spad{ex2} should be approximately equal as complex numbers,{} taking into account \spadfun{testAbsolutePrecision} and \spadfun{testRelativePrecision}.
929640`\spad{testComplexEqualsAux(inp ex1,{} ex2)} states that \spad{ex1} and \spad{ex2} should be approximately equal as complex numbers,{} taking into account \spadfun{testAbsolutePrecision} and \spadfun{testRelativePrecision}.
929751`test function.
930178`test function.
930481`\spad{testDim(lp,{} lv)} tests if the polynomial system \spad{lp} in variables \spad{lv} is zero dimensional.
930689`\spad{testEquals(ex1,{} ex2)} states that \spad{ex1} and \spad{ex2} should be equal. To sidestep the possibility that the equality function of the domain \spad{R} performs some simplifications,{} we convert \spad{ex1} and \spad{ex2} to \spad{InputForm},{} if possible.
930746`\spad{testEqualsAux(inp,{} ex1,{} ex2)} states that \spad{ex1} and \spad{ex2} should be equal. To sidestep the possibility that the equality function of the domain \spad{R} performs some simplifications,{} we convert \spad{ex1} and \spad{ex2} to \spad{InputForm},{} if possible.
930809`\spad{testEqualsAuxCmp should} be local but is conditional
930871`test function.
931512`test function.
931893`test function.
932416`test function.
933514`test function.
934612`test function.
934760`test function.
934941`test function.
935440`\spad{testLibraryError ex} states that ex should throw an error. Such a test will never count as a fatal error.
935496`\spad{testLibraryErrorAux(inp,{} ex)} states that ex should throw an error. Such a test will never count as a fatal error.
935563`test function.
936076`test function.
937311`test function.
937684`test function.
938405`\spad{testModulus(p,{} lp)} returns \spad{true} if the prime \spad{p} is valid for the list of polynomials \spad{lp},{} \spadignore{i.e.} preserves the degree and they remain relatively prime.
938472`\spad{testNotEquals(ex1,{} ex2)} states that \spad{ex1} and \spad{ex2} should be different.
938532`\spad{testNotEqualsAux(inp,{} ex1,{} ex2)} states that \spad{ex1} and \spad{ex2} should be different.
938598`test function.
938961`test function.
939249`\spad{testRealEquals(ex1,{} ex2)} states that \spad{ex1} and \spad{ex2} should be approximately equal as real numbers,{} taking into account \spadfun{testAbsolutePrecision} and \spadfun{testRelativePrecision}.
939310`\spad{testRealEqualsAux(inp,{} ex1,{} ex2)} states that \spad{ex1} and \spad{ex2} should be approximately equal as real numbers,{} taking into account \spadfun{testAbsolutePrecision} and \spadfun{testRelativePrecision}.
939400`\spad{testRelativePrecision(eps)} returns the current absolute precision used for floating point comparison,{} and then sets it to \spad{eps}. The default value is 1.0e-15.
939482`test function.
939919`test function.
940426`test function.
940941`\spad{testsuite s} starts a new testsuite with \spad{s} as title. It also calls \spad{clear all}. A testsuite is composed of several testcases.
940995`\spad{testsuiteNoClear s} starts a new testsuite with \spad{s} as title,{} without calling \spad{clear all}. A testsuite is composed of several testcases.
941056`\spad{testTrue(ex)} states that \spad{ex} should be \spad{true}.
941104`\spad{testTrueAux(inp,{} ex)} states that ex should be \spad{true}.
941163`\spad{tex(t)} extracts the TeX section of a TeX form \spad{t}.
941210`\spad{theMap} is a special handler to format a function.
941288`\spad{Theta()} returns symbol for capital greek letter theta.
941340`\spad{theta()} returns symbol for small greek letter theta.
941392`\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.
941500`\spad{third(u)} returns the third element of \spad{u}. Note: \spad{third(u) = first(rest(rest(u)))}.
941555`\spad{times(x,{} y,{} b)} computes \spad{x*y} with no rounding.
941729`\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.
941830`\spad{times(x,{} y,{} b)} computes approximation to \spad{x*y} accurate to at least \spad{b} bits.
942021`\spad{times(p,{} q,{} sigma,{} delta)} returns \spad{p * q}. \spad{\sigma} and \spad{\delta} are the maps to use.
942115`\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}.
942159`\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.
942235`\spad{title(v,{} s)} changes the title which is shown in the two-dimensional viewport window,{} \spad{v} of domain \spadtype{TwoDimensionalViewport}.
942296`\spad{title(v,{} s)} changes the title which is shown in the three-dimensional viewport window,{} \spad{v} of domain \spadtype{ThreeDimensionalViewport}.
942359`convert PermutationGroup to a Cayley graph
942460`convert permutation generators to a Cayley graph permList should contain generator permutations and should not contain identity permutation. if permutationNames then names generated represent permutation
942570`\spad{toggleAlternativeOutput(f)} enable/disable output as rational expression.
942643`\spad{toggleDebugOutput(f)} enable/disable ALS.
942710`\spad{to_mod_pa(s)} reduces coefficients of polynomial \spad{s} modulo prime \spad{p} and converts the result to vector
942835`\spad{to_mod_pa(s)} converts polynomial to vector
942942`\spad{to_mod_pa(s,{} p)} reduces coefficients of polynomial \spad{s} modulo prime \spad{p} and converts the result to vector
943054`\spad{toObj(n,{} ptLst,{} indexLst,{} indexNxt,{} tran,{} bb)} creates an .OBJ (Wavefront) file from scenegraph tree structure called recursively for each node,{} so when called on root node in scenegraph all other nodes in the scenegraph will get called. \spad{n} is the scene to be output to \spad{ptLst} and \spad{indexLst} \spad{ptLst} is the points. This will be set to ref([]) at the start \indented{6}{and will be built up as this function is called recursively} \spad{indexLst} is list of faces,{} where faces are list of points indexed \indented{9}{by \spad{ptLst} This will be set to ref([]) at the start} \indented{6}{and will be built up as this function is called recursively} \spad{tran} is the default transform which may be overridden by subnodes \spad{bb} is the default boundary which may be overridden by subnodes
943216`\spad{top(s)} returns the top element \spad{x} from \spad{s}; \spad{s} remains unchanged. Note: Use \spad{pop!(s)} to obtain \spad{x} and remove it from \spad{s}.
943260`generates a permutation group from this graph assumes this graph represents a valid group
943353`convert to permutation group return "failed" for infinite groups. For more information about the algorithm see: \url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/finiteGroup/pres2perm/}
943452`convert to permutation group return "failed" for infinite groups. For more information about the algorithm see: \url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/finiteGroup/pres2perm/}
943559`\spad{toPermutationIfCan(a,{} sg,{} trace)} returns permutation representation of a on cosets of subgroup generate by \spad{sg} or "failed" if computation exceed resource limit. trace activates debugging printouts.
943686`\spad{topFortranOutputStack()} returns the top element of the Fortran output stack
943760`\spad{toPoint(p)} returns a Point with the same coordinates as \spad{p} If \spad{p} was originally a vector then that will be treated as the distance from the origin.
943805`\spad{topologicalSort(xx)} returns a rearrangement of the elements which is compatible with the partial order. (Martin Baker) \spad{I} added this version because predicate function can be difficult to work with so use table instead.
943890`\spad{topologicalSort(xx)} returns a rearrangement of the elements which is compatible with the partial order.
943970`\spad{topologicalSort(xx)} returns a rearrangement of the elements which is compatible with the partial order. The argument list \spad{xx} is destroyed.
944051`\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.
944129`\spad{top_split(p)} returns [\spad{p1},{} \spad{p2}] where \spad{p1} is homogeneous part of \spad{p} of maximal degree and \spad{p2} is sum of lower order terms of \spad{p}.
944245`\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))}.
944316`\spad{torsion?(f)} \undocumented
944433`\spad{torsion?(fd)} returns \spad{true} if \spad{fd} is of finite order,{} \spad{false} otherwise.
944531`\spad{torsionIfCan(f)} \undocumented
944704`\spad{torsionIfCan(fd)} returns \spad{[n,{} f]} such that \spad{n*fd = div(f)} when \spad{fd} is of finite order. torsionIfCan(\spad{fd}) returns \spad{"failed"} if \spad{fd} is not of finite order.
944858`generate a minimal 3-dimensional torus surface.
944931`generate a cubical complex of the surface of an 3-dimensional torus.
945015`generate a minimal triangulation of the surface of a 3-dimensional torus.
945104`\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}.
945151`\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.
945231`\spad{toseInvertible?(p1,{} p2,{} ts)} has the same specifications as \spadopFrom{invertible?}{RegularTriangularSetCategory}.
945321`\spad{toseInvertible?(p1,{} p2,{} ts)} has the same specifications as \spadopFrom{invertible?}{RegularTriangularSetCategory}.
945438`\spad{toseInvertibleSet(p1,{} p2,{} ts)} has the same specifications as \spadopFrom{invertibleSet}{RegularTriangularSetCategory}.
945531`\spad{toseLastSubResultant(p1,{} p2,{} ts)} has the same specifications as \spadopFrom{lastSubResultant}{RegularTriangularSetCategory}.
945649`\spad{toseSquareFreePart(p,{} ts)} has the same specifications as \spadopFrom{squareFreePart}{RegularTriangularSetCategory}.
945817`returns the name and the type in string form.
945860`creates a string representation of this term and its sub-terms
945903`return string representation using deBruijn index for bound variables. notation assumes association to the left,{} in the absence of brackets,{} the term to the left binds more tightly than the one on the right.
945950`creates a string representation of this term and its sub-terms
946005`creates a string representation of this term and its sub-terms
946060`\spad{toString(n)} returns string representation for debug purposes.
946117`output
946172`\spad{toString(x)} returns the string representation of \spad{x}.
946301`\spad{toString(x,{} n)} returns a string representation of \spad{x} truncated to \spad{n} decimal digits.
946376`return string representation using conventional notation,{} that is deBruijn index is replaced by name using String value for bound variables. notation assumes association to the left,{} in the absence of brackets,{} the term to the left binds more tightly than the one on the right.
946442`similar to 'toString' but does not put outer compound terms in brackets
946494`similar to 'toString' but does not put outer compound terms in brackets
946558`similar to 'toString' but does not put outer compound terms in brackets
946622`\spad{toSVG(n,{} mat,{} tran,{} bb,{} scale,{} clipEn,{} useInteger,{} npt)} creates an XmlElement containing a 'SVG' representation of node \spad{'n'} and the nodes below it. \spad{n} is the scene to be output to \spad{XML} elements \spad{mat} is the default material which may be overridden by subnodes \spad{tran} is the default transform which may be overridden by subnodes \spad{bb} is the default boundary which may be overridden by subnodes \spad{scale} is the \spad{scale} used to \spad{scale} into canvas,{} it would be better \indented{6}{to merge this into trans.} \spad{clipEn} if \spad{true} this clips the output to the boundary \spad{useInteger} if \spad{true} truncate to integer values. \spad{npt} names points can be provided. If not required then set \indented{4}{to namedBranch([],{} [])}
946830`displays multiplication table for binary operation which is represented as a function with two parameters. row number represents first operand in binary order column number represents second operand in binary order could have returned type 'List List \%' but matrix displays better
946901`displays table of unary function such as inverse,{} reverse,{} complement,{} or dual basis could have returned type 'List List \%' but matrix displays better
946970`\spad{totalDegree(p)} returns the largest sum over all monomials of all exponents of a monomial.
947220`\spad{totalDegree(p,{} lv)} returns the maximum sum (over all monomials of polynomial \spad{p}) of the variables in the list \spad{lv}.
947524`\spad{totalDegreeSorted(p,{} lv)} returns the maximum sum (over all monomials of polynomial \spad{p}) of the degree in variables in the list \spad{lv}. \spad{lv} is assumed to be sorted in decreasing order.
947732`\spad{totalDifferential(x)} returns the total differential (gradient) form for element \spad{x}.
947826`\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.
947950`\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}.
948051`\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.
948131`\spad{totolex }\undocumented
948378`\spad{toVector returns} a Vector with the same coordinates as \spad{p} If \spad{p} was originally a point then the vector will be the distance from the origin.
948532`\spad{tower(f)} returns all the kernels appearing in \spad{f},{} no matter what their levels are.
948586`\spad{tower([f1,{}...,{}fn])} returns all the kernels appearing in \spad{f1},{} ...,{} \spad{fn} no matter what their levels are.
948646`\spad{toX3D(n,{} mat,{} tran,{} bb)} creates an XmlElement containing a 'X3D' representation of node \spad{'n'} and the nodes below it. \spad{n} is the scene to be output to \spad{XML} elements \spad{mat} is the default material which may be overridden by subnodes \spad{tran} is the default transform which may be overridden by subnodes \spad{bb} is the default boundary which may be overridden by subnodes
948969`\spad{trace(a)} returns the trace of the regular representation of \spad{a} with respect to any basis.
949021`\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}.
949160`\spad{trace(x,{} n)} \undocumented{} See \spadfunFrom{trace}{FiniteAlgebraicExtensionField}
949257`\spad{trace(a,{} d)} computes the trace of \spad{a} with respect to the intermediate field of extension degree \spad{d} over the ground field \spad{F}. Error: if \spad{d} does not divide the extension degree \spad{n} of \spad{\%}. Note: \spad{trace(a,{} d) = reduce(+,{} [a^(q^(d*i)) for i in 0..n/d])} where \spad{q} is size of \spad{F}.
949347`\spad{traceMatrix()} is the \spad{n}-by-\spad{n} matrix ( \spad{Tr(\spad{vi} * vj)} ),{} where \spad{v1},{} ...,{} \spad{vn} are the elements of the fixed basis.
949411`\spad{traceMatrix()} is the \spad{n}-by-\spad{n} matrix ( \spad{Tr(\spad{vi} * vj)} ),{} where \spad{v1},{} ...,{} \spad{vn} are the elements of the fixed basis.
949610`\spad{traceMatrix([v1,{} ..,{} vn])} is the \spad{n}-by-\spad{n} matrix ( \spad{Tr}(\spad{vi} * \spad{vj}) )
949684`\spad{trailingCoefficient }\undocumented
949750`\spad{tRange(p)} returns the range of the parameter in a parametric plot \spad{p}.
949805`\spad{tRange(p)} returns the range of the parameter in a parametric plot \spad{p}
949946`\spad{transcendenceDegree()} returns the transcendence degree of the field extension,{} 0 if the extension is algebraic.
950151`\spad{transcendent?(a)} tests whether an element \spad{a} is transcendent with respect to the ground field \spad{F}.
950853`\spad{transform }\undocumented
950997`\spad{transform(jv)} transforms a jet variable \spad{jv} into a function of the new coordinates.
951095`\spad{transform(f)} rewrites a function of the old coordinates in the new ones.
951214`\spad{transform(f)} transforms expressions between the different function types involved.
951345`\spad{transformationMatrices(A)} returns a list of two matrices \spad{P} and \spad{Q} such that P*A*Q = \spad{J} where the upper diagonal block of \spad{J} is I_k for \spad{k} = rank(A).
951451`\spad{transformationMatrix(f)} returns the identity matrix to be modified and used within transformRows! or transformColumns!
951529`\spad{transformColumns!(f,{} U)} transforms the ALS of \spad{f} from the right.
951606`\spad{transformColumns!(p,{} U)} multiplies the matrices of the linear pencil from the right by \spad{U}.
951690`\spad{transformRows!(f,{} T)} transforms the ALS of \spad{f} from the left.
951764`\spad{transformRows!(p,{} T)} multiplies the matrices of the linear pencil from the left by \spad{T}.
951845`\spad{transition_matrices(a)} gives list of transition matrices of a.
951920`\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}.
951992`\spad{translate(X,{} Y,{} Z)} returns a dhmatrix for translation by \spad{X},{} \spad{Y},{} and \spad{Z}
952055`\spad{translate(v,{} n,{} dx,{} dy)} displays the graph in field \spad{n} of the given two-dimensional viewport,{} \spad{v},{} which is of domain \spadtype{TwoDimensionalViewport},{} translated by \spad{dx} in the \spad{x}-coordinate direction from the center of the viewport,{} and by \spad{dy} in the \spad{y}-coordinate direction from the center. Setting \spad{dx} and \spad{dy} to \spad{0} places the center of the graph at the center of the viewport.
952141`\spad{transpose(m)} returns the transpose of the matrix \spad{m}.
952374`\spad{transpose(m)} returns the transpose of the array \spad{m}.
952445`\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)}.}
952506`\spad{transpose(r)} converts the row \spad{r} to a row matrix.
952566`\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)}.}
952643`\spad{trapezoidal(fn,{} a,{} b,{} epsrel,{} epsabs,{} nmin,{} nmax)} uses the trapezoidal method to numerically integrate function \spad{fn} over the closed interval \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin} to \spad{nmax}. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
952784`\spad{trapezoidalo(fn,{} a,{} b,{} epsrel,{} epsabs,{} nmin,{} nmax)} uses the trapezoidal method to numerically integrate function \spad{fn} over the open interval from \spad{a} to \spad{b},{} with relative accuracy \spad{epsrel} and absolute accuracy \spad{epsabs},{} with the refinement levels for convergence checking vary from \spad{nmin} to \spad{nmax}. The value returned is a record containing the value of the integral,{} the estimate of the error in the computation,{} the total number of function evaluations,{} and either a boolean value which is \spad{true} if the integral was computed within the user specified error criterion. See \spadtype{NumericalQuadrature} for details.
952926`\spad{traverse(s,{} \spad{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}.
952996`\spad{tree(ls)} creates a tree from a list of elements of \spad{s}.
953037`\spad{tree(nd)} creates a tree with value \spad{nd},{} and no children.
953072`\spad{tree(nd,{} ls)} creates a tree with value \spad{nd},{} and children \spad{ls}.
953115`\spad{trial_division(p,{} q,{} lm,{} v,{} lz)} checks if \spad{p} is divisible by \spad{q}. \spad{lm} is a list of defining equations for algebraic parameters,{} \spad{v} is main variable,{} \spad{lz} is the list of algebraic parameters.
953241`a simplicial complex with one triangle
953344`\spad{triangSolve(lp)} returns the same as \spad{triangSolve(lp,{} false,{} false)}
953457`\spad{triangSolve(lp,{} info?)} returns the same as \spad{triangSolve(lp,{} false)}
953578`\spad{triangSolve(lp,{} info?,{} lextri?)} decomposes the variety associated with \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 \spad{lp} needs to generate a zero-dimensional ideal. If \spad{lp} is not zero-dimensional then the result is only a decomposition of its zero-set in the sense of the closure (with respect to Zarisky topology). Moreover,{} if \spad{info?} is \spad{true} then some information is displayed during the computations. See \spadopFrom{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 \spadopFrom{zeroSetSplit}{LexTriangularPackage}(\spad{lp},{} \spad{false})). Otherwise,{} the triangular decomposition is computed directly from the input system by using the \spadopFrom{zeroSetSplit}{RegularChain} from \spadtype{RegularChain}.
953780`\spad{triangular?(ps)} returns \spad{true} iff \spad{ps} is a triangular set,{} \spadignore{i.e.} two distinct polynomials have distinct main variables and no constant lies in \spad{ps}.
953877`\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.
954004`\spad{triangulate(A,{} lv)} is a parametric version of triangulate(A,{} \spad{v}).
954169`\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}.
954314`\spad{triangulate(m,{} [v1,{} ...,{} vn])} returns \spad{[m_0,{} [w1,{} ...,{} wn]]} such that for any constant \spad{c1,{} ...,{} cn} the system \spad{m_0 x = c1*w1 + ... + cn*wn} is equivalent to to \spad{m x = c1*v1 + ... + cn*vn}
954437`\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}.
954547`\spad{trigs(f)} rewrites all the complex logs and exponentials appearing in \spad{f} in terms of trigonometric functions.
954614`\spad{trigs(f)} rewrites all the complex logs and exponentials appearing in \spad{f} in terms of trigonometric functions.
954674`\spad{trigs2explogs(f,{} [k1,{} ...,{} kn])} rewrites all the trigonometric functions appearing in \spad{f} in terms of complex logarithms and exponentials. A kernel of the form \spad{tan(u)} is expressed using \spad{exp(u)^2} if it is one of the \spad{\spad{ki}'s},{} in terms of \spad{exp(2*u)} otherwise.
954769`\spad{trigs2explogs(f,{} [k1,{} ...,{} kn])} rewrites all the trigonometric functions appearing in \spad{f} in terms of complex logarithms and exponentials. A kernel of the form \spad{tan(u)} is expressed using \spad{exp(u)^2} if it is one of the \spad{\spad{ki}'s},{} in terms of \spad{exp(2*u)} otherwise.
955012`\spad{trim(s,{} cc)} returns \spad{s} with all characters in \spad{cc} deleted from right and left ends. For example,{} \spad{trim("(abc)",{} charClass "()")} returns \spad{"abc"}.
955070`\spad{trim(u,{} x)} returns a copy of \spad{u} with all occurrences of \spad{x} deleted from right and left ends. For example,{} \spad{trim(" abc ",{} char " ")} returns \spad{"abc"}.
955162`\spad{trim_mat!(mat,{} nr0,{} nc1,{} pmod)} reduces modular composition matrix \spad{mat} modulo reduction data pmod. \spad{nr0} is number of rows used in argument,{} \spad{nr1} is number of rows used in the result. \spad{mat} is is modified in place.
955340`\spad{trivialIdeal?(ps)} returns \spad{true} iff \spad{ps} does not contain non-zero elements.
955418`\spad{true} is a logical constant.
955450`\spad{trueEqual(x,{} y)} tries to determine if the two numbers are equal
955506`\spad{trunc(p,{} n)} returns the polynomial \spad{p} truncated at order \spad{n}.
955578`\spad{trunc(p,{} n)} returns the polynomial \spad{p} truncated at order \spad{n}.
955693`\spad{truncate x} returns the integer between \spad{x} and 0 closest to \spad{x}.
955741`\spad{truncate(f,{} k)} returns a (finite) power series consisting of the sum of all terms of \spad{f} of degree \spad{<= k}.
955820`\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}.
955905`\spad{truncated_mul_add2(x,{} y,{} z,{} d1,{} d2,{} p)} adds to \spad{z} the product x*y and the variable to power \spad{d1} truncated after degree \spad{d}.
956031`\spad{truncated_mul_add(x,{} y,{} z,{} d,{} p)} adds to \spad{z} the product x*y truncated after degree \spad{d}.
956148`\spad{truncated_multiplication(x,{} y,{} d,{} p)} computes x*y truncated after degree \spad{d}.
956267`\spad{tryFunctionalDecomposition?()} returns \spad{true} if factorizers try functional decomposition of polynomials before factoring them.
956348`\spad{tryFunctionalDecomposition(b)} chooses whether factorizers have to look for functional decomposition of polynomials (\spad{true}) or not (\spad{false}). Returns the previous value.
956499`\spad{tryTwoFactor(p)} returns the factorisation of polynomial \spad{p},{} if it does not require using field extensions,{} otherwise returns \spad{p} unfactored (nil factorization).
956672`\spad{tube(c,{} r,{} n)} creates a tube of radius \spad{r} around the curve \spad{c}.
956760`\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.
956846`\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.
957052`\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.
957243`\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",{} the tube is considered to be open.
957456`\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 considered to be open.
957654`\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}.
957712`\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.
957811`\spad{tubePointsDefault()} returns the number of points to be used when creating the circle to be used in creating a 3D tube plot.
957884`\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}.
957972`\spad{tubeRadius(r)} specifies a radius,{} \spad{r},{} for a tube plot around a 3D curve; is expressed in the form \spad{tubeRadius == 4}.
958020`\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.
958099`\spad{tubeRadiusDefault()} returns the radius used for a 3D tube plot.
958168`\spad{tubeRadiusDefault(r)} sets the default radius for a 3D tube plot to \spad{r}.
958242`\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}.
958301`\spad{twist(f)} is the function \spad{g} \indented{1}{such that \spad{g (a,{} b)= f(b,{} a)}.}
958366`\spad{type(jv)} yields the type (\spad{Const,{} Indep,{} Dep,{} Deriv}) of the jet variable \spad{jv}.
958416`\spad{typeList(t,{} tab)} returns a list of all the objects of type \spad{t} in tab
958551`\spad{typeLists(tab)} returns a list of lists of types of objects in \spad{tab}
958675`\spad{U()} generates the only dependent variable.
958906`\spad{U(i)} generates the \spad{i}\spad{-}th dependent variable.
959212`\spad{ucodeToString(n)} converts Unicode code point to one-character string. If UTF-8 is in use the string may contain multiple octets.
959261`\spad{uentries(s)} converts \spad{s} to a list of Unicode code points encoding characters in \spad{s}. It work even if lower layer does not support Unicode,{} in such case string is treated as sequence of octets using UTF-8 encoding. Consegently length of returened list may be smaller than length of the string in octets.
959317`\spad{unary?(op)} tests if \spad{op} is unary.
959366`\spad{unaryFunction(a)} is a local function
959445`if this is a lambda term then replace De Bruijn index in sub-nodes with string name
959485`\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}\spad{'s}.
959575`\spad{underscore()} provides the underscore character,{} \spad{_},{} which is used to allow quotes and other characters {\em within} strings.
959617`\spad{undirectedGraph(poset)} constructs graph from a partially ordered set. This will be a graph with,{} at most,{} one arrow between any two nodes (in each direction).
959687`constructor for graph with given objects more objects and arrows can be added later if required.
959812`constructor for graph with given list of object names. Use this version of the constructor if you don\spad{'t} intend to create diagrams and therefore don\spad{'t} care about \spad{x},{} \spad{y} coordinates. more objects and arrows can be added later if required.
959875`constructor for graph with given objects and arrows more objects and arrows can be added later if required.
960164`constructor for graph with given objects and adjacency matrix.
960258`\spad{undirectedGraph(obs,{} ars)} constructs graph with objects \spad{obs} and arrows ars. This constructor just has pure abstract graph information without decoration information.
960456`\spad{unexpand(p)} returns \spad{p} in recursive form.
960549`\spad{uniform01()} \undocumented
960609`\spad{uniform(s)} \undocumented
960691`\spad{uniform(s)} \undocumented
960753`\spad{uniform(f,{} g)} \undocumented
960826`\spad{union(x)} constructs a compound boundary from the union of \spad{x} \spad{x:} List \% is supplied list of boundaries to form union
961058`\spad{union(a,{} b)} makes the set-union of two match results.
961112`\spad{union(l1,{} l2)} returns set-theoretic union of \spad{l1} and \spad{l2}.
961298`\spad{union(u,{} v)} returns the set aggregate of elements which are members of either set aggregate \spad{u} or \spad{v}.
961344`\spad{union(u,{} x)} returns the set aggregate \spad{u} with the element \spad{x} added. If \spad{u} already contains \spad{x},{} \spad{union(u,{} x)} returns a copy of \spad{u}.
961390`\spad{union(x,{} u)} returns the set aggregate \spad{u} with the element \spad{x} added. If \spad{u} already contains \spad{x},{} \spad{union(x,{} u)} returns a copy of \spad{u}.
961506`\spad{unit()} returns a unit of the algebra (necessarily unique),{} or \spad{"failed"} if there is none.
961647`\spad{unit?(x)} tests whether \spad{x} is a unit,{} \spadignore{i.e.} is invertible.
961692`\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]}.
961740`\spad{unit(u)} extracts the unit part of the factorization.
961825`\spad{unit(objs,{} arrowName)} constructs a graph with vertices (from \spad{objs}) and arrows from each object to itself. arrowName is a prefix for all arrow names,{} this will be followed by a number starting at 1 and incremented for each arrow
961965`\spad{unitCanonical(x)} returns \spad{unitNormal(x).canonical}.
962251`\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}.
962332`\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.
962380`Each element \spad{x} can be written as x=p^n*a/b with \spad{gcd}(\spad{p},{}a)=gcd(\spad{p},{}\spad{b})\spad{=1}. unitPart(\spad{x}) returns a/b.
962454`\spad{units(\spad{gi})} returns the list of unit increments for the \spad{x} and \spad{y} axes of the indicated graph,{} \spad{\spad{gi}},{} of the domain \spadtype{GraphImage}.
962503`\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.
962589`\spad{units(\spad{gi},{} lu)} modifies the list of unit increments for the \spad{x} and \spad{y} axes of the given graph,{} \spad{\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{\spad{gi}}.
962650`\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}.
962728`\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".
962805`\spad{unitsColorDefault()} returns the default color of the unit ticks in a 2D viewport.
962870`\spad{unitsColorDefault(p)} sets the default color of the unit ticks in a 2D viewport to the palette \spad{p}.
962942`\spad{unitStep(x)} is 0 for \spad{x} less than 0,{} 1 for \spad{x} bigger or equal 0.
963004`\spad{unitStep(x)} is 0 for \spad{x} less than 0,{} 1 for \spad{x} bigger or equal 0.
963059`\spad{unitVector(p)} returns a vector with the same direction as \spad{p} but with unit length. We scale until length is 1
963107`\spad{unitVector(x)} \undocumented
963181`\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|}.
963262`\spad{unitVector(n)} produces a vector with 1 in position \spad{n} and zero elsewhere.
963377`\spad{univariate?(p)} returns \spad{true} iff \spad{p} involves one and only one variable.
963456`\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
963548`\spad{univariate(f,{} v)} returns \spad{f} viewed as a univariate rational function in \spad{v}.
963758`\spad{univariate(f,{} v)} returns \spad{f} viewed as a univariate rational function in \spad{v}.
963900`\spad{univariate(f,{} k)} returns \spad{f} viewed as a univariate fraction in \spad{k}.
964014`\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]}.
964145`\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).
964244`\spad{univariate(f,{} x,{} p)} returns \spad{f} viewed as a univariate polynomial in \spad{x},{} using the side-condition \spad{p(x) = 0}.
964384`\spad{univariate(f,{} k,{} k,{} p)} \undocumented
964561`\spad{univariatePolynomial(f,{} k)} returns a univariate polynomial \indented{1}{consisting of the sum of all terms of \spad{f} of degree \spad{<= k}.}
964695`\spad{univariatePolynomial(f,{} k)} returns a univariate polynomial \indented{1}{consisting of the sum of all terms of \spad{f} of degree \spad{<= k}.}
964941`\spad{univariatePolynomials(lp)} returns \spad{ups,{} nups} where \spad{ups} is a list of the univariate polynomials,{} and \spad{nups} are the other ones.
965069`\spad{univariatePolynomialsGcds(lp)} returns \spad{lg} where \spad{lg} is a list of the gcds of every pair in \spad{lp} of univariate polynomials in the same main variable.
965184`\spad{univariatePolynomialsGcds(lp,{} opt)} returns the same as \spad{univariatePolynomialsGcds(lp)} if \spad{opt} is \spad{false} and if the previous operation does not return any non null and constant polynomial,{} else return \spad{[1]}.
965307`\spad{univariateSolve(lp)} returns the same as \spad{univariateSolve(lp,{} false,{} false,{} false)}.
965488`\spad{univariateSolve(ts)} returns a univariate representation of \spad{ts}. See \spadopFrom{rur}{RationalUnivariateRepresentationPackage}(\spad{lp},{} \spad{true}).
965668`\spad{univariateSolve(lp,{} info?)} returns the same as \spad{univariateSolve(lp,{} info?,{} false,{} false)}.
965857`\spad{univariateSolve(lp,{} info?,{} check?)} returns the same as \spad{univariateSolve(lp,{} info?,{} check?,{} false)}.
966054`\spad{univariateSolve(lp,{} info?,{} check?,{} lextri?)} returns a univariate representation of the variety associated with \spad{lp}. Moreover,{} if \spad{info?} is \spad{true} then some information is displayed during the decomposition into regular chains. If \spad{check?} is \spad{true} then the result is checked. See \spadopFrom{rur}{RationalUnivariateRepresentationPackage}(\spad{lp},{} \spad{true}). If \spad{lextri?} is \spad{true} then the lexTriangular algorithm is called from the \spadtype{LexTriangularPackage} constructor (see \spadopFrom{zeroSetSplit}{LexTriangularPackage}(\spad{lp},{} \spad{false})). Otherwise,{} the triangular decomposition is computed directly from the input system by using the \spadopFrom{zeroSetSplit}{RegularChain} from \spadtype{RegularChain}.
966259`\spad{univcase should} be local
966385`\spad{universe()}\$\spad{D} returns the universal set for finite set aggregate \spad{D}.
966450`\spad{unkextint(ext,{} csolve,{} [g1,{} ...,{} gn])} is like primextint and expextint but for makes no assumption about generator of the extension.
966750`\spad{unmakeSUP(sup)} converts \spad{sup} of type \spadtype{SparseUnivariatePolynomial(R)} to be a member of the given type. Note: converse of makeSUP.
966842`\spad{unpack_poly(vars,{} exps,{} coeffs,{} lo,{} \spad{hi})} converts polynomial from packed to sparse representation. Coefficients of packed polynomial are stored in \spad{coeffs}(\spad{l0}) up to \spad{coeffs}(\spad{hi}) Exponents are stored in corresponding elements of \spad{exps}.
967013`\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.
967058`\spad{unprotectedRemoveRedundantFactors(p,{} q)} returns the same as \spad{removeRedundantFactors(p,{} q)} but does assume that neither \spad{p} nor \spad{q} lie in the base ring \spad{R} and assumes that \spad{infRittWu?(p,{} q)} holds. Moreover,{} if \spad{R} is \spad{gcd}-domain,{} then \spad{p} and \spad{q} are assumed to be square free.
967161`\spad{unrankImproperPartitions0(n,{} m,{} k)} computes the {\em k}\spad{-}th improper partition of nonnegative \spad{n} in \spad{m} nonnegative parts in reverse lexicographical order. Example: {\em [0,{} 0,{} 3] < [0,{} 1,{} 2] < [0,{} 2,{} 1] < [0,{} 3,{} 0] < [1,{} 0,{} 2] < [1,{} 1,{} 1] < [1,{} 2,{} 0] < [2,{} 0,{} 1] < [2,{} 1,{} 0] < [3,{} 0,{} 0]}. Error: if \spad{k} is negative or too big. Note: counting of subtrees is done by \spadfunFrom{numberOfImproperPartitions}{SymmetricGroupCombinatoricFunctions}.
967279`\spad{unrankImproperPartitions1(n,{} m,{} k)} computes the {\em k}\spad{-}th improper partition of nonnegative \spad{n} in at most \spad{m} nonnegative parts ordered as follows: first,{} in reverse lexicographically according to their non-zero parts,{} then according to their positions (\spadignore{i.e.} lexicographical order using {\em subSet}: {\em [3,{} 0,{} 0] < [0,{} 3,{} 0] < [0,{} 0,{} 3] < [2,{} 1,{} 0] < [2,{} 0,{} 1] < [0,{} 2,{} 1] < [1,{} 2,{} 0] < [1,{} 0,{} 2] < [0,{} 1,{} 2] < [1,{} 1,{} 1]}). Note: counting of subtrees is done by {\em numberOfImproperPartitionsInternal}.
967397`\spad{unravel(t)} produces a tensor from a list of components such that \indented{2}{\spad{unravel(ravel(t)) = t}.}
967462`\spad{untab(lp,{} llp)} is an auxiliary function which unbumps a tableau \spad{llp},{} using \spad{lp} to accumulate pairs
967553`\spad{UnVectorise(v)} converts vector of coefficients to \spad{\%}.
967682`\spad{unvectorise(v)} returns the polynomial which has for coefficients the entries of \spad{v} in the increasing order.
967756`\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 polynomial,{} \spad{var} the new variable and \spad{n} the degree.
967948`\spad{UP2UTS(p)} converts \spad{p} to a Taylor series.
968004`\spad{updatD }\undocumented
968288`\spad{update!(hs,{} x)} computes new values of HashState from \spad{hs} and \spad{x} and might destructively operate on its first argument.
968342`\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.
968910`\spad{updateStatus!(a)} returns a where the status of the vertices are updated to satisfy the "termination condition".
968965`\spad{updatF }\undocumented
969152`\spad{upperCase()} returns the class of all characters for which \spadfunFrom{upperCase?}{Character} is \spad{true}.
969244`\spad{upperCase?(c)} tests if \spad{c} is an upper case letter,{} \spadignore{i.e.} one of A..\spad{Z}.
969293`\spad{upperCase!(s)} destructively replaces the alphabetic characters in \spad{s} by corresponding upper case characters.
969342`\spad{upperCase(s)} returns the string with all characters in upper case.
969390`\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.
969432`a subset \spad{U} with the property that,{} if \spad{x} is in \spad{U} and \spad{x} \spad{<=} \spad{y},{} then \spad{y} is in \spad{U}
969472`\spad{uppertriangular?(p,{} l)} is the matrix \spad{l} upper triangular?
969570`\spad{Upsilon()} returns symbol for capital greek letter upsilon.
969624`\spad{upsilon()} returns symbol for small greek letter upsilon.
969678`\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}.
969759`\spad{useEisensteinCriterion?()} returns \spad{true} if factorizers check Eisenstein\spad{'s} criterion before factoring.
969836`\spad{useEisensteinCriterion(b)} chooses whether factorizers check Eisenstein\spad{'s} criterion before factoring: \spad{true} for using it,{} \spad{false} else. Returns the previous value.
969919`\spad{userOrdered?()} tests if the partial ordering induced by \spadfunFrom{setOrder}{UserDefinedPartialOrdering} is not empty.
969989`\spad{useSingleFactorBound?()} returns \spad{true} if algorithm with single factor bound is used for factorization,{} \spad{false} for algorithm with overall bound.
970064`\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.
970145`\spad{usingTable?()} returns \spad{true} iff the hash-table is used
970223`\spad{UTS2UP(s,{} n)} converts the first \spad{n} terms of \spad{s} to a univariate polynomial.
970298`\spad{true} if this is a valid chain complex,{} that is: 1. maps compose 2. product of adjacent maps is zero
970348`\spad{true} if this is a valid chain complex,{} that is: 1. maps compose 2. product of adjacent coboundary maps is zero
970404`\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.
970622`\spad{value(x)} returns a non-negative SingleInteger value corresponding to \spad{x}.
970672`returns: \indented{2}{"T"::Symbol = \spad{T}} \indented{2}{"F"::Symbol = \spad{_|_}} \indented{2}{"E"::Symbol = error} \indented{2}{"P"::Symbol = proposition} \indented{2}{"C"::Symbol = compound} Constructs lambda term and bind any variables with the name provided
970712`returns: \indented{2}{"T"::Symbol = \spad{T}} \indented{2}{"F"::Symbol = \spad{_|_}} \indented{2}{"E"::Symbol = error} \indented{2}{"P"::Symbol = proposition} \indented{2}{"C"::Symbol = compound} Constructs lambda term and bind any variables with the name provided
970764`returns: \indented{2}{"T"::Symbol = \spad{T}} \indented{2}{"F"::Symbol = \spad{_|_}} \indented{2}{"E"::Symbol = error} \indented{2}{"P"::Symbol = proposition} \indented{2}{"C"::Symbol = compound} Constructs lambda term and bind any variables with the name provided
970816`\spad{value(n)} returns the value of the node \spad{n}.
970863`\spad{value(x)} returns the integer associated with \spad{x}
970908`\spad{value(u)} returns the value of the node \spad{u}.
970958`\spad{value(q)} returns the value (\spadignore{i.e.} right hand side) of \spad{q}.
971005`\spad{values()} returns the number of initial values to display at most.
971074`\spad{values N} sets the number of initial values to display at most.
971161`constructs variable with a name but no type.
971199`\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}.
971256`\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.
971354`\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)).
971426`\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)).
971513`constructs variable with a name and also a type.
971558`\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}.
971615`\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.
971713`\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)).
971785`\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)).
971872`\spad{variable()} returns the symbol
971921`returns \spad{true} if this is an variable
971978`construct a variable
972033`construct a variable
972088`\spad{variable(s)} returns a member of the variable set or failed
972174`\spad{variable(v)} returns \spad{s} if \spad{v} is any derivative of the differential indeterminate \spad{s}.
972237`\spad{variable(f)} returns the (unique) power series variable of the power series \spad{f}.
972315`\spad{variable(q)} returns the variable (\spadignore{i.e.} left hand side) of \spad{q}.
972365`\spad{variable(segb)} returns the variable from the left hand side of the \spadtype{SegmentBinding}. For example,{} if \spad{segb} is \spad{v=a..b},{} then \spad{variable(segb)} returns \spad{v}.
972419`\spad{variableName returns} the name of the variable used in by the algebraic differential equation,{} default being \spad{x}
972497`\spad{variableName(d)} specifies the variable used in by the algebraic differential equation. This option is expressed in the form \spad{variableName == d}.
972549`\spad{variableOf(c)} returns variable of \spad{c}
972616`\spad{variables(f)} returns the list of variables appearing in the numerator or the denominator of \spad{f}.
972701`\spad{variables(p)} returns the list of matching variables appearing in \spad{p}.
972750`\spad{variables(f)} returns a list of the variables.
972895`\spad{variables(e)} return a list of all the variables in \spad{e}.
972991`\spad{variables(p)} returns the list of those variables actually appearing in the polynomial \spad{p}.
973074`\spad{variables(q)} computes the list of all jet variables up to order \spad{q}.
973441`\spad{variables(upoly)} returns the list of variables for the coefficients of \spad{upoly}.
973537`\spad{variables(f)} returns the list of variables appearing in the numerator or the denominator of \spad{f}.
973622`\spad{variables([f1,{} ...,{} fn])} returns the list of all the variables of \spad{f1},{} ...,{} \spad{fn}.
973691`\spad{variables(f)} returns the list of all the variables of \spad{f}.
973754`\spad{variables(ps)} returns the decreasingly sorted list of the variables which are variables of some polynomial in \spad{ps}.
973833`\spad{variables(q,{} c)} computes all jet variables of order \spad{q} whose class is greater than or equal to \spad{c}.
974009`\spad{variablesOf(c)} returns list of variables of \spad{c}
974069`\spad{variationOfParameters(op,{} g,{} [f1,{} ...,{} fm])} returns \spad{[u1,{} ...,{} um]} such that a particular solution of the equation \spad{op y = g} is \spad{f1 int(u1) + ... + fm int(um)} where \spad{[f1,{} ...,{} fm]} are linearly independent and \spad{op(\spad{fi})=0}. The value "failed" is returned if \spad{m < n} and no particular solution is found.
974167`\spad{vark([f1,{} ...,{} fn],{} x)} returns the set-theoretic union of \spad{(varselect(f1,{} x),{} ...,{} varselect(fn,{} x))}.
974243`\spad{varList(x)} returns the list of variables of \spad{x}.
974309`\spad{varList(x)} returns the list of distinct entries of \spad{x}.
974368`\spad{varList(g)} returns the list of variables of \spad{g}.
974441`\spad{varList(x)} returns the list of distinct entries of \spad{x}.
974501`\spad{varList([l1]*[l2]*...[ln])} returns the list of variables in the word \spad{l1*l2*...*ln}.
974582`\spad{varList(x)} returns the list of distinct entries of \spad{x}.
974648`\spad{varList(x)} returns the list of variables which appear in \spad{x}.
974704`\spad{varselect([k1,{} ...,{} kn],{} x)} returns the \spad{ki} which involve \spad{x}.
974793`\spad{vconcat(hh)} returns a handler \spad{h} such that \spad{h(prec,{} args)} formats args according to \spad{hh} and then puts them on top of each other where the lines are centered. The baseline corresponds to the baseline of the first argument.
974913`\spad{vconcat(u)} vertically concatenates all forms in list \spad{u}.
974960`\spad{vconcat(f,{} g)} vertically concatenates forms \spad{f} and \spad{g}.
975003`\spad{vconcat(lbox,{} h)} returns \spad{vconcat(lbox,{}h,{} 0)},{}
975068`\spad{vconcat(lbox,{} h,{} adjust)} computes the maximal width of the boxes in the list \spad{lbox}; then if \spad{adjust<0},{} left adjusts,{} if \spad{adjust>0},{} right adjusts,{} and otherwise centers each smaller box in a new box of this maximal width and returns a box by putting all the boxes vertically on top of each other. The height of the new box is given by \spad{h},{} the depth results from the difference of the number of lines and \spad{h}.
975141`\spad{vector(l)} converts the list \spad{l} to a vector.
975220`\spad{vector(f)} returns \spad{v} from the ALS of \spad{f}.
975284`\spad{vector(f)} returns \spad{v} from the ALS of \spad{f}.
975376`\spad{vector(l)} converts the list \spad{l} to a vector.
975421`\spad{vector_add_mul(v1,{} v2,{} m,{} n,{} c,{} p)} sets \spad{v1}(\spad{m}),{} ...,{} \spad{v1}(\spad{n}) to corresponding extries in \spad{v1} + \spad{c*v2} modulo \spad{p}.
975541`\spad{vector_combination(v1,{} c1,{} v2,{} c2,{} n,{} delta,{} p)} replaces first \spad{n} + 1 entries of \spad{v1} by corresponding entries of \spad{c1*v1+c2*x^delta*v2} mod \spad{p}.
975673`\spad{Vectorise(x)} returns vector of coefficients of lift(\spad{x}).
975817`\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}.
975983`\spad{vertConcat(l)} vertically concatenates all members of \spad{l} Error: if the arrays do not have the same number of columns.
976132`\spad{vertConcat(x,{} y)} vertically concatenates two arrays with an equal number of columns. The entries of \spad{y} appear below of the entries of \spad{x}. Error: if the arrays do not have the same number of columns.
976395`\spad{vertSplit(a,{} [n1,{} ...,{} \spad{ni}])} splits a into arrays having \spad{n1},{} ...,{} \spad{ni} rows. Error: if number of rows of a is different than \spad{n1+} ... + \spad{ni}.
976497`\spad{vertSplit(a,{} n)} splits a into \spad{n} arrays of equal size row wise. Error: if number of rows of a is not divisible by \spad{n}.
976590`\spad{viewDefaults()} resets all the default graphics settings.
976647`\spad{viewDeltaXDefault()} returns the current default horizontal offset from the center of the viewport window.
976715`\spad{viewDeltaXDefault(dx)} sets the current default horizontal offset from the center of the viewport window to be \spad{dx} and returns \spad{dx}.
976788`\spad{viewDeltaYDefault()} returns the current default vertical offset from the center of the viewport window.
976856`\spad{viewDeltaYDefault(dy)} sets the current default vertical offset from the center of the viewport window to be \spad{dy} and returns \spad{dy}.
976929`\spad{viewPhiDefault()} returns the current default latitudinal view angle in radians.
976994`\spad{viewPhiDefault(p)} sets the current default latitudinal view angle in radians to the value \spad{p} and returns \spad{p}.
977064`\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}.
977260`\spad{viewpoint(v)} returns the current viewpoint setting of the given viewport,{} \spad{v}. This function is useful in the situation where the user has created a viewport,{} proceeded to interact with it via the control panel and desires to save the values of the viewpoint as the default settings for another viewport to be created using the system.
977470`\spad{viewpoint(l,{} ls)} takes the list of draw options,{} \spad{l},{} and checks the list to see if it contains the option \spad{viewpoint}. IF the option does not exist,{} the value \spad{ls} is returned.
977846`\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.
978061`\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}.
978133`\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.
978211`\spad{viewpoint(v,{} th,{} phi,{} s,{} dx,{} dy)} sets the longitudinal view angle to \spad{th} radians,{} the latitudinal view angle to \spad{phi} radians,{} the scale factor to \spad{s},{} the horizontal viewport offset to \spad{dx},{} and the vertical viewport offset to \spad{dy} for the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport}. The new viewpoint position is not displayed until the function \spadfun{makeViewport3D} is executed again for \spad{v}.
978301`\spad{viewpoint(v,{} th,{} phi,{} s,{} dx,{} dy)} sets the longitudinal view angle to \spad{th} degrees,{} the latitudinal view angle to \spad{phi} degrees,{} the scale factor to \spad{s},{} the horizontal viewport offset to \spad{dx},{} and the vertical viewport offset to \spad{dy} for the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport}. The new viewpoint position is not displayed until the function \spadfun{makeViewport3D} is executed again for \spad{v}.
978395`\spad{viewport2D()} returns an undefined two-dimensional viewport of the domain \spadtype{TwoDimensionalViewport} whose contents are empty.
978450`\spad{viewport3D()} returns an undefined three-dimensional viewport of the domain \spadtype{ThreeDimensionalViewport} whose contents are empty.
978507`\spad{viewPosDefault()} returns the default \spad{X} and \spad{Y} position of a viewport window unless overridden explicitly,{} newly created viewports will have this \spad{X} and \spad{Y} coordinate.
978586`\spad{viewPosDefault([x,{} y])} sets the default \spad{X} and \spad{Y} position of a viewport window unless overridden explicitly,{} newly created viewports will have th \spad{X} and \spad{Y} coordinates \spad{x},{} \spad{y}.
978689`\spad{viewSizeDefault()} returns the default viewport width and height.
978766`\spad{viewSizeDefault([w,{} h])} sets the default viewport width to \spad{w} and height to \spad{h}.
978864`\spad{viewThetaDefault()} returns the current default longitudinal view angle in radians.
978931`\spad{viewThetaDefault(t)} sets the current default longitudinal view angle in radians to the value \spad{t} and returns \spad{t}.
979003`\spad{viewWriteAvailable()} returns a list of available methods for writing,{} such as BITMAP,{} POSTSCRIPT,{} etc.
979074`\spad{viewWriteDefault()} returns the list of things to write in a viewport data file; a viewAlone file is always generated.
979143`\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 generated.
979224`\spad{viewZoomDefault()} returns the current default graph scaling value.
979290`\spad{viewZoomDefault(s)} sets the current default graph scaling value to \spad{s} and returns \spad{s}.
979361`\spad{virtualDegree }\undocumented
979457`virtualDegree
979546`\spad{void()} produces a void object.
979577`\spad{vspace(n)} creates white space of height \spad{n}.
979623`evaluation routine
979743`evaluation routine
979903`modular reduction
980055`\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.
980125`\spad{weberE(v,{} z)} is the Weber \spad{E} function.
980187`\spad{weberE(v,{} z)} is the Weber \spad{E} function.
980242`\spad{weierstrass(v,{} ts)} where \spad{v} is a variable and \spad{ts} is \indented{1}{a TaylorSeries,{} implements the Weierstrass Preparation} \indented{1}{Theorem. The result is a list of TaylorSeries that} \indented{1}{are the coefficients of the equivalent series.}
980343`\spad{weierstrassHalfPeriods(g2,{} g3)} computes half periods of Weierstrass elliptic functions from invariants \spad{g2},{} \spad{g3}.
980458`\spad{weierstrassInvariants(w1,{} w2)} computes invariants \spad{g2},{} \spad{g3} of Weierstrass elliptic functions from half periods \spad{w1},{} \spad{w2}.
980572`\spad{weierstrassP0(g2,{} g3,{} x)} computes finite part of weierstrassP(\spad{g2},{} \spad{g3},{} \spad{x}). \spad{x} must have no term of order 0.
980670`\spad{weierstrassP(g2,{} g3,{} x)} is the Weierstrass \spad{P} function.
980740`\spad{weierstrassP(g2,{} g3,{} x)} is the Weierstrass \spad{P} function
980854`\spad{weierstrassP(g2,{} g3,{} z)} is the Weierstrass \spad{P} function.
980917`\spad{weierstrassP(g2,{} g3,{} x)} is the Weierstrass \spad{P} function
980995`\spad{weierstrassPInverse(g2,{} g3,{} z)} is the inverse of Weierstrass \spad{P} function,{} defined by the formula \spad{weierstrassP(g2,{} g3,{} weierstrassPInverse(g2,{} g3,{} z)) = z}.
981072`\spad{weierstrassPInverse(g2,{} g3,{} z)} is the inverse of Weierstrass \spad{P} function,{} defined by the formula \spad{weierstrassP(g2,{} g3,{} weierstrassPInverse(g2,{} g3,{} z)) = z}.
981142`\spad{weierstrassPPrime0(g2,{} g3,{} x)} computes finite part of weierstrassPPrime(\spad{g2},{} \spad{g3},{} \spad{x}). \spad{x} must have no term of order 0.
981245`\spad{weierstrassPPrime(g2,{} g3,{} x)} is the derivative of Weierstrass \spad{P} function.
981320`\spad{weierstrassPPrime(g2,{} g3,{} x)} is the derivative of the Weierstrass \spad{P} function
981439`\spad{weierstrassPPrime(g2,{} g3,{} z)} is the derivative of Weierstrass \spad{P} function.
981507`\spad{weierstrassPPrime(g2,{} g3,{} x)} is the derivative of the Weierstrass \spad{P} function
981590`\spad{weierstrassSigma0(g2,{} g3,{} x)} computes weierstrassSigma(\spad{g2},{} \spad{g3},{} \spad{x}). \spad{x} must have no term of order 0.
981692`\spad{weierstrassSigma(g2,{} g3,{} x)} is the Weierstrass Sigma function.
981766`\spad{weierstrassSigma(g2,{} g3,{} z)} is the Weierstrass Sigma function.
981833`\spad{weierstrassZeta0(g2,{} g3,{} x)} computes finite part of weierstrassZeta(\spad{g2},{} \spad{g3},{} \spad{x}). \spad{x} must have no term of order 0.
981934`\spad{weierstrassZeta(g2,{} g3,{} x)} is the Weierstrass Zeta function.
982007`\spad{weierstrassZeta(g2,{} g3,{} z)} is the Weierstrass Zeta function.
982231`\spad{weight(jv)} assigns each jet variable a unique integer reflecting its position in the internal ordering. The variable with the greater weight is also greater in this ordering.
982357`\spad{weight(p)} returns the maximum weight of all differential monomials appearing in the differential polynomial \spad{p}.
982443`\spad{weight(v)} returns the weight of the derivative \spad{v}.
982521`\spad{weight(op)} returns the weight attached to \spad{op}.
982666`\spad{weight(op,{} n)} attaches the weight \spad{n} to \spad{op}.
982728`\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.
982816`\spad{weighted(l)} \undocumented
982909`The elements of the returned array will represent the distance weights between vertices. if there is no connection between the vertices then the element will be set to "disjoint"
983012`\spad{weightedGraph(poset)} constructs graph from a partially ordered set. This will be a graph with,{} at most,{} one arrow between any two nodes.
983080`constructor for graph with given objects more objects and arrows can be added later if required.
983212`constructor for graph with given list of object names. Use this version of the constructor if you don\spad{'t} intend to create diagrams and therefore don\spad{'t} care about \spad{x},{} \spad{y} coordinates. more objects and arrows can be added later if required.
983273`constructor for graph with given objects and arrows more objects and arrows can be added later if required.
983560`\spad{weightedGraph(ob,{} ar)} constructs graph with objects on and arrows ar. More objects and arrows can be added later if required.
983838`constructor for graph with given objects and adjacency matrix.
983930`\spad{weightedGraph(obs,{} ars)} constructs graph with objects \spad{obs} and arrows ars. This constructor just has pure abstract graph information without decoration information.
984145`\spad{weights(p)} returns a list of weights of differential monomials appearing in differential polynomial \spad{p}.
984330`\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.
984425`\spad{whatInfinity(x)} returns 0 if \spad{x} is finite,{} 1 if \spad{x} is +infinity,{} and \spad{-1} if \spad{x} is -infinity.
984493`\spad{whileLoop(s,{} c)} creates a while loop in FORTRAN.
984544`\spad{whittakerM(k,{} m,{} z)} is the Whittaker \spad{M} function.
984612`\spad{whittakerM(k,{} m,{} z)} is the Whittaker \spad{M} function.
984673`\spad{whittakerW(k,{} m,{} z)} is the Whittaker \spad{W} function.
984741`\spad{whittakerW(k,{} m,{} z)} is the Whittaker \spad{W} function.
984802`\spad{wholePart x} returns the integer part of \spad{x}.
984857`\spad{wholePart(x)} extracts the whole part of \spad{x}. That is,{} if \spad{x = continuedFraction(b0,{} [a1,{} a2,{} a3,{} ...],{} [b1,{} b2,{} b3,{} ...])},{} then \spad{wholePart(x) = b0}.
984910`\spad{wholePart(p)} extracts the whole part of the partial fraction \spad{p}.
984961`\spad{wholePart(x)} returns the whole part of the fraction \spad{x} \spadignore{i.e.} the truncated quotient of the numerator by the denominator.
985040`\spad{wholeRadix(l)} creates an integral radix expansion from a list of ragits. For example,{} \spad{wholeRadix([1,{} 3,{} 4])} will return \spad{134}.
985104`\spad{wholeRagits(rx)} returns the ragits of the integer part of a radix expansion.
985169`\spad{width(box)} returns the width of the \spad{box}.
985224`\spad{width(u)} returns \spad{sup(u) - inf(u)}.
985272`\spad{wignerDistribution(a)} produces a Wigner distribution of variance \spad{a}.
985350`\spad{wilsonW(n,{} a,{} b,{} c,{} d,{} z)} is the Wilson polynomial.
985421`\spad{wilsonW(n,{} a,{} b,{} c,{} d,{} z)} is the Wilson polynomial.
985485`\spad{withPredicates(p,{} [p1,{} ...,{} pn])} makes a copy of \spad{p} and attaches the predicate \spad{p1} and ... and \spad{pn} to the copy,{} which is returned.
985543`\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}.
985640`\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}.
985743`\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}.
985839`\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}.}
985997`\spad{writable?(f)} tests if the named file be opened for writing. The named file need not already exist.
986052`write writes one item to the file.
986099`\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}.
986162`\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.
986214`\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}.
986279`\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}.
986355`\spad{write! writes} one item to the keyed access file.
986420`\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}.
986490`\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}.
986568`\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}.
986640`writes a category to a file.
986720`\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,{}"")}.
986767`\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.
986821`\spad{writeObj(n,{} filename)} writes an 'OBJ' (Wavefront) representation of node \spad{'n'} to the filename supplied.
986872`writes 3D SubSpace to a file in Wavefront (.OBJ) format
986944`writes a package to a file.
987037`\spad{writeSvg(n,{} filename)} writes an 'SVG' representation of node \spad{'n'} to the filename supplied.
987088`\spad{writeSvgQuantised(n,{} filename)} writes an 'SVG' representation of node \spad{'n'} to the filename supplied.
987148`\spad{writeVRML(n,{} filename)} writes an 'VRML' representation of node \spad{'n'} to the filename supplied.
987200`\spad{writeVRML(content,{} filename)} writes the element as \spad{VRML2}. \spad{VRML2} is not \spad{xml} but it has the same semantics and node names as \spad{X3D} but a different syntax so it makes sense to create an \spad{XML} structure and then format the output differently.
987261`writeX3d: (\spad{n},{} filename) writes an 'X3D' representation of node \spad{'n'} to the filename supplied.
987312`\spad{writeXml(content,{} filename)} writes an \spad{xml} element and all the elements below it to an \spad{xml} file. This assumes that all elements,{} in a file,{} have a single root which is usually the case.
987372`\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)]}.
987441`\spad{wronskianMatrix([f1,{} ...,{} fn],{} q)} returns the \spad{q x n} matrix \spad{m} whose i^th row is \spad{[f1^(i-1),{} ...,{} fn^(i-1)]}.
987529`\spad{wrregime(l,{} s)} writes a list of regimes to a file named \spad{s} and returns the number of regimes written
987782`\spad{X()} generates the only independent variable.
987959`\spad{X(i)} generates the \spad{i}\spad{-}th independent variable.
988196`\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.
988248`\spad{xform(tr,{} inpt)} apply transform to a point producing another point
988295`xftestComplexEquals is like testComplexEquals,{} but expects failure.
988361`xftestComplexEqualsAux is like testComplexEqualsAux,{} but expects failure.
988474`xftestEquals is like testEquals,{} but expects failure.
988533`xftestEqualsAux is like testEquals,{} but expects failure.
988598`xftestLibraryError is like testLibraryError,{} but expects failure.
988656`\spad{xftestLibraryErrorAux like} testLibraryErrorAux,{} but expects failure (that is no error).
988725`xftestNotEquals is like testNotEquals,{} but expects failure.
988787`xftestNotEqualsAux is like testEquals,{} but expects failure.
988855`xftestRealEquals is like testRealEquals,{} but expects failure.
988918`xftestRealEqualsAux is like testRealEqualsAux,{} but expects failure.
989010`xftestTrue is like testTrue,{} but expects failure.
989060`xftestTrueAux is like testTrueAux,{} but expects failure.
989121`\spad{\spad{Xi}()} returns symbol for capital greek letter \spad{xi}.
989170`\spad{\spad{xi}()} returns symbol for small greek letter \spad{xi}.
989219`\spad{xmlAttribute(name,{} values)} constructs a xmlAttribute from its \spad{name} and list of values
989285`\spad{xmlAttribute(name,{} value)} construct a xmlAttribute from its \spad{name} and value
989345`\spad{xmlElement(name,{} elements,{} attributes)} construct an element with structured \spad{elements}
989421`\spad{xmlElement(name,{} txt,{} attributes)} construct an element with unstructured text
989496`\spad{xn(n)} returns the polynomial \spad{x^n-1}.
989602`\spad{xor(a,{} b)} returns the logical {\em exclusive-or} of bit aggregates \spad{a} and \spad{b}.
989643`\spad{xor(a,{} b)} returns the logical exclusive {\em or} of Boolean \spad{a} and \spad{b}.
989679`\spad{xor(n,{} m)} returns the bit-by-bit logical {\em xor} of the single integers \spad{n} and \spad{m}.
989721`\spad{xRange(c)} returns the range of the \spad{x}-coordinates of the points on the curve \spad{c}.
989797`\spad{xRange(c)} returns the range of the \spad{x}-coordinates of the points on the curve \spad{c}.
989873`\spad{Y(f)} computes a fixed point of the function \spad{f}.
989962`\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.
990077`\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.
990222`\spad{yCoordinates(f)} returns \spad{[[A1,{} ...,{} An],{} D]} such that \spad{f = (A1 + A2 y +...+ An y^(n-1)) / D}.
990318`\spad{yellow()} returns the position of the yellow hue from total hues.
990352`\spad{youngGroup([n1,{} ...,{} nk])} constructs the direct product of the symmetric groups {\em Sn1},{} ...,{} {\em Snk}.
990446`\spad{youngGroup(lambda)} constructs the direct product of the symmetric groups given by the parts of the partition {\em lambda}.
990536`\spad{yRange(c)} returns the range of the \spad{y}-coordinates of the points on the curve \spad{c}.
990612`\spad{yRange(c)} returns the range of the \spad{y}-coordinates of the points on the curve \spad{c}.
990688`\spad{zag(f,{} g)} creates a form for the continued fraction form for \spad{f} over \spad{g}.
990727`\spad{zag} is a handler such that \spad{zag(prec,{} args)} formats one part of a continued fraction.
990802`\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.
990854`\spad{zero?(x)} checks if \spad{x} is zero.
991482`\spad{zero?(x)} tests if \spad{x} is equal to 0.
991530`\spad{zero?(m)} returns \spad{true} if \spad{m} is a zero matrix and \spad{false} otherwise.
991590`\spad{zero?(x)} returns \spad{true} if \spad{x} is a zero vector,{} \spad{false} otherwise.
991662`\spad{zero?(I)} tests whether the ideal \spad{I} is the zero ideal
991734`\spad{zero(n)} creates a zero vector of length \spad{n}.
991992`\spad{zero(m,{} n)} returns an \spad{m}-by-\spad{n} zero matrix.
992081`\spad{zero?(pol,{} aRoot)} answers if \spad{pol} interpreted as \spad{aRoot} is \spad{0}
992174`\spad{zero?(f,{} i,{} j)} is A(\spad{i},{}\spad{j}) zero?
992273`\spad{zero?(p,{} i,{} j)} checks if all the entries (\spad{i},{}\spad{j}) of the linear pencil \spad{p} are zero.
992379`\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}
992454`\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]}
992542`\spad{zeroDimensional?(lp)} returns \spad{true} iff \spad{lp} generates a zero-dimensional ideal with respect to the variables involved in \spad{lp}.
992677`\spad{zeroDimensional?(lq1)} returns \spad{true} iff \spad{lq1} generates a zero-dimensional ideal with respect to the variables of \spad{ls}.
992763`\spad{zeroDimPrimary?(I)} tests if the ideal \spad{I} is 0-dimensional primary.
992990`\spad{zeroDimPrime?(I)} tests if the ideal \spad{I} is a 0-dimensional prime.
993215`\spad{zeroMatrix(i,{} j,{} k)} create a matrix with all zero terms
993340`\spad{zeroMatrix(s,{} p,{} q)} uses loop variables in the Fortran,{} \spad{I1} and \spad{I2}
993448`\spad{zeroMatrix(s,{} b,{} d)} in this version gives the user control over names of Fortran variables used in loops.
993958`\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.
994023`\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}.
994089`\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.
994424`\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}.
994513`\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}.
994585`\spad{zeroSetSplit(lp)} returns a list \spad{lts} of triangular sets such that the zero set of \spad{lp} is the union of the closures of the regular zero sets of the members of \spad{lts}.
994663`\spad{zeroSetSplit(lp,{} norm?)} decomposes the variety associated with \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 \spad{lp} needs to generate a zero-dimensional ideal. If \spad{norm?} is \spad{true} then the regular sets are normalized.
994819`\spad{zeroSetSplit(lp,{} norm?)} decomposes the variety associated with \spad{lp} into square-free regular chains. Thus a point belongs to this variety iff it is a regular zero of a regular set in in the output. Note that \spad{lp} needs to generate a zero-dimensional ideal. If \spad{norm?} is \spad{true} then the regular sets are normalized.
995115`\spad{zeroSetSplit(lp,{} clos?)} has the same specifications as \spadopFrom{zeroSetSplit}{RegularTriangularSetCategory}(\spad{lp},{} clos?).
995210`\spad{zeroSetSplit(lp,{} clos?)} returns \spad{lts} a split of Kalkbrener of the radical ideal associated with \spad{lp}. If \spad{clos?} is \spad{false},{} it is also a decomposition of the variety associated with \spad{lp} into the regular zero set of the \spad{ts} in \spad{lts} (or,{} in other words,{} a split of Lazard of this variety). See the example illustrating the \spadtype{RegularTriangularSet} constructor for more explanations about decompositions by means of regular triangular sets.
995303`\spad{zeroSetSplit(lp,{} clos?,{} info?)} returns a list \spad{lts} of regular chains such that the union of the closures of their regular zero sets equals the affine variety associated with \spad{lp}. Moreover,{} if \spad{clos?} is \spad{false} then the union of the regular zero set of the \spad{ts} (for \spad{ts} in \spad{lts}) equals this variety. If \spad{info?} is \spad{true} then some information is displayed during the computations. See \spadopFrom{zeroSetSplit}{RegularTriangularSet}.
995442`\spad{zeroSetSplit(lp,{} clos?,{} info?)} has the same specifications as \spadopFrom{zeroSetSplit}{RegularTriangularSetCategory}. Moreover,{} if \spad{clos?} then solves in the sense of the Zariski closure else solves in the sense of the regular zeros. If \spad{info?} then do print messages during the computations.
995535`\spad{zeroSetSplit(lp,{} clos?,{} info?)} has the same specifications as \spadopFrom{zeroSetSplit}{RegularTriangularSetCategory} from \spadtype{RegularTriangularSetCategory} Moreover,{} if \spad{clos?} then solves in the sense of the Zariski closure else solves in the sense of the regular zeros. If \spad{info?} then do print messages during the computations.
995638`\spad{zeroSetSplit(lp,{} b1,{} b2.b3,{} b4)} is an internal subroutine,{} exported only for development.
995747`\spad{zeroSetSplit(lp,{} b1,{} b2.b3,{} b4)} is an internal subroutine,{} exported only for development.
995866`\spad{zeroSetSplitIntoTriangularSystems(lp)} returns a list of triangular systems \spad{[[ts1,{} qs1],{} ...,{} [tsn,{} qsn]]} such that the zero set of \spad{lp} is the union of the closures of the \spad{W_i} where \spad{W_i} consists of the zeros of \spad{ts} which do not cancel any polynomial in \spad{qsi}.
996397`\spad{zerosOf(p)} returns \spad{[y1,{} ...,{} yn]} such that \spad{p(\spad{yi}) = 0}. The \spad{yi}\spad{'s} are expressed in radicals if possible. Note: the returned values \spad{y1},{} ...,{} \spad{yn} contain new symbols which are bound in the interpreter to the respective values. Error: if \spad{p} has more than one variable.
996469`\spad{zerosOf(p)} returns \spad{[y1,{} ...,{} yn]} such that \spad{p(\spad{yi}) = 0}. The \spad{yi}\spad{'s} are expressed in radicals if possible. Otherwise they are implicit algebraic quantities containing new symbols. The new symbols are bound in the interpreter to the respective values. Error: if \spad{p} has more than one variable \spad{y}.
996542`\spad{zerosOf(p)} returns \spad{[y1,{} ...,{} yn]} such that \spad{p(\spad{yi}) = 0}. The \spad{yi}\spad{'s} are expressed in radicals if possible. Otherwise they are implicit algebraic quantities containing new symbols. The new symbols are bound in the interpreter to the respective values.
996905`\spad{zerosOf(p,{} y)} returns \spad{[y1,{} ...,{} yn]} such that \spad{p(\spad{yi}) = 0}. The \spad{yi}\spad{'s} are expressed in radicals if possible,{} and otherwise as implicit algebraic quantities containing new symbols which display as \spad{'\%z0},{} \spad{'\%z1},{} ...; The new symbols are bound in the interpreter to respective values.
997001`\spad{zerosOf(p,{} y)} returns \spad{[y1,{} ...,{} yn]} such that \spad{p(\spad{yi}) = 0}. The \spad{yi}\spad{'s} are expressed in radicals if possible,{} and otherwise as implicit algebraic quantities containing new symbols which display as \spad{'\%z0},{} \spad{'\%z1},{} ...; The new symbols are bound in the interpreter to the respective values.
997080`\spad{zeroSquareMatrix(s,{} p)} \undocumented{}
997174`\spad{zeroVector(s,{} p)} \undocumented{}
997262`\spad{zeta()} returns the function which is constantly one
997308`\spad{Zeta()} returns symbol for capital greek letter zeta.
997359`\spad{zeta()} returns symbol for small greek letter zeta.
997475`\spad{zetaMatrix(P)} returns the matrix of the zeta function This function is based on code by Franz Lehner. Notes by Martin Baker on the webpage here: \url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/moebius/}
997543`\spad{zoom(x,{} r)} \undocumented
997596`\spad{zoom(v,{} s)} sets the graph scaling factor to \spad{s},{} for the viewport \spad{v},{} which is of the domain \spadtype{ThreeDimensionalViewport}.
997657`\spad{zoom(x,{} r,{} s)} \undocumented
997731`\spad{zoom(x,{} r,{} s,{} t)} \undocumented
997828`\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}.
997901`\spad{zRange(c)} returns the range of the \spad{z}-coordinates of the points on the curve \spad{c}.
997977`This package provides algebraic functions over an integral domain.
998066`algebraic Hermite redution.
998263`This package implements parametric integration \indented{1}{in algebraic case.\space{2}Some cases remain unimplemented and the} \indented{1}{code throws errors when they appear as the input.}
998507`This package provides functions for integrating a function on an algebraic curve.
998748`This package provides functions for the integration of algebraic integrands over transcendental functions.
998861`AlgebraicManipulations provides functions to simplify and expand expressions involving algebraic operators.
998954`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.
999093`AlgebraPackage assembles a variety of useful functions for general algebras.
999191`Factorization of univariate polynomials with coefficients in \spadtype{AlgebraicNumber}.
999280`\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.
999328`This package apply rewrite rules to expressions,{} calling the pattern matcher.
999441`\spad{ApplyUnivariateSkewPolynomial} (internal) allows univariate skew polynomials to be applied to appropriate modules.
999569`\spadtype{AssociatedEquations} provides functions to compute the associated equations needed for factoring operators
999688`Attaching predicates to symbols for pattern matching. Date Created: 21 Mar 1989
999741`This package provides balanced factorisations of polynomials.
999855`This package exports functions to set some commonly used properties of operators,{} including properties which contain functions.
999920`\spadtype{BezoutMatrix} contains functions for computing resultants and discriminants using Bezout matrices,{} and functions related with Sylvester matrix and subresultant.
1000101`This is a wrapper package for BezoutMatrix,{} to avoid manually filling up type arguments.
1000198`\spadtype{BoundIntegerRoots} provides functions to find lower bounds on the integer roots of a polynomial.
1000305`This package implements Brillhart irreducibility test.
1000389`\spadtype{CartanKuranishi} is a package for the completion of a given differential equation to an involutive equation. Procedures for Cartan characters and Hilbert polynomial are also provided. Based on the Cartan-Kuranishi theorem as it is used in formal theory.
1000489`This package provides functions to enable conversion of tensors given conversion of the components.
1000626`Tools to send a point to infinity on an algebraic curve.
1000860`This package computes characteristic polynomial \indented{1}{using Danilewski method.}
1000925`This package computes characteristic polynomial \indented{1}{via interpolation from values at several points.} \indented{1}{Additionally,{} it computes determinant of matrix of} \indented{1}{fractions by clearing common denominators of rows.} \indented{1}{The determinant routine can be used to compute characteristic} \indented{1}{polynomial instead of regular determinant.}
1000999`This package computes characteristic polynomial \indented{1}{via Berkovitz-Samuelson formula.}
1001063`This package implements characteristicPolynomials for monogenic algebras using resultants
1001227`This package provides a characteristicPolynomial function for any matrix over a commutative ring.
1001307`Modular helpers for computing integral bases.
1001473`CoerceVectorMatrixPackage: an unexposed,{} technical package for data conversions
1001544`Provides combinatorial functions over an integral domain.
1001640`CommonDenominator provides functions to compute the common denominator of a finite linear aggregate of elements of the quotient field of an integral domain.
1001762`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.
1001809`A package for swapping the order of two variables in a tower of two UnivariatePolynomialCategory extensions.
1001965`Maps abstract computational structures to real-world FriCAS code \blankline This allows FriCAS domains to be created from an instance of Lambda it also allows FriCAS categories to be created from an instance of intuitionisticLogic. \blankline So by the Curry-Howard isomorphism we can coerce to the intuitionisticLogic from Lambda. This gives an isomorphism where theorems in intuitionistic logic correspond to type signatures in combinatory logic and programs in intuitionistic logic correspond to the proofs of those theorems in combinatory logic. \blankline As an example of this in Haskell see "Djinn,{} a theorem prover in Haskell,{} for Haskell" here: http://lambda-the-ultimate.\spad{org/node/1178} \blankline see also: Philip Wadler - Theorems for free! http://homepages.inf.ed.ac.uk/wadler/topics/parametricity.html
1002005`This package extends maps from underlying rings to maps between complex over those rings.
1002092`This package provides the generalized euclidean algorithm which is needed as the basic step for factoring polynomials.
1002216`This package supports converting complex expressions to patterns
1002343`This package supports matching patterns involving complex expressions
1002468`\spadtype{ComplexRootFindingPackage} provides functions to find all roots of a polynomial \spad{p} over the complex number by using Plesken\spad{'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 it is the user\spad{'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.
1002588`\indented{2}{This package provides functions complexZeros} for finding the complex zeros of univariate polynomials with complex rational number coefficients. The results are to any user specified precision and are returned as either complex rational number or complex floating point numbers depending on the type of the second argument which specifies the precision.
1002711`\spadtype{ComplexTrigonometricManipulations} provides function that compute the real and imaginary parts of complex functions.
1002844`The compUtil package provides utilities to convert between the computational domains: Lambda,{} Ski and ILogic. Both Lambda are Ski are Turing complete and can be coerced to each other. Lambda and Ski are not equal and they are only isomorphic up to beta-equivalence and beta-equivalence is undecidable so there is not a direct correspondence between the nodes in their trees. Also the names of bound variables and other such constructions may be lost in Lambda \spad{->} Ski \spad{->} Lambda round trip. An element of ILogic cannot be coerced to the other types. However ILogic can be used to produce a theory which can be concerted to/from the other domains using Curry-Howard isomorphism.
1002894`\spad{ConstantLinearDependence(R,{} F)} supports solving linear systems with coefficients in \spad{Expression(R)} over constants. The parameter \spad{ld} to each function is a list of derivations to use. By definition element \spad{f} from \spad{Expression(R)} is a constant if for each \spad{d} in \spad{ld} we have \spad{d(f) = 0}. We assume that inputs are normalized in such a way that field of constants is generated by constant kernels.
1002999`Solution of linear ordinary differential equations,{} constant coefficient case.
1003168`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.
1003235`This package implements asymptotically efficient Chinese reconstruction
1003294`Provides functions to construct various Cubical complexes. For more information see: http://www.euclideanspace.com/prog/scratchpad/mycode/topology/cubical/factory/
1003345`Enumeration by cycle indices.
1003390`This package provides tools for working with cyclic streams.
1003477`Utilities for computations with cyclotomic polynomials.
1003727`\spadtype{DefiniteIntegrationTools} provides common tools used by the definite integration of both rational and elementary functions.
1003852`This package \undocumented{}
1003939`Provides functions to construct various minimal delta complexes which can be smaller than if constructed from SimplicialComplexes.
1004004`This package generates logarithmic integrals and polylogs corresponding to denominator of the integrand.
1004119`any solution of a homogeneous linear Diophantine equation can be represented as a sum of minimal solutions,{} which form a "basis" (a minimal solution cannot be represented as a nontrivial sum of solutions) in the case of an inhomogeneous linear Diophantine equation,{} each solution is the sum of a inhomogeneous solution and any number of homogeneous solutions therefore,{} it suffices to compute two sets: \indented{3}{1. all minimal inhomogeneous solutions} \indented{3}{2. all minimal homogeneous solutions} the algorithm implemented is a completion procedure,{} which enumerates all solutions in a recursive depth-first-search it can be seen as finding monotone paths in a graph for more details see Reference
1004174`\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}.
1004270`DiscreteLogarithmPackage implements help functions for discrete logarithms in monoids using small cyclic groups.
1004340`DisplayPackage allows one to print strings in a nice manner,{} including highlighting substrings.
1004385`A package to compute Jacobi continued fractions of Cauchy transforms.
1004481`A package to map distributions between different rings.
1004575`Various popular distributions.
1004642`A package to apply polynomial transformations to distributions and integrate polynomials with respect to distributions.
1004792`This package implements functions which \indented{1}{we can not directly take from underlying system.}
1004852`\spad{DoubleFloatEllipticIntegrals} implements machine A package for computing machine precision real and complex elliptic integrals,{} using algorithms given by Carlson. Note: Complex versions may misbehave for very large/small arguments and close to branch cuts.
1004911`This package provides special functions for double precision real and complex floating point.
1004968`This package implements \spadtype{DoubleFloat} versions \indented{1}{of several special functions.}
1005027`This package provides functions for computing the residues of a function on an algebraic curve.
1005218`\spadtype{DrawComplex} provides some facilities for drawing complex functions.
1005259`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}.
1005329`This package \undocumented{}
1005379`This package \undocumented{}
1005436`This is a package for the exact computation of eigenvalues and eigenvectors. This package works for matrices with coefficients which are rational functions over a ring where we can factor polynomials. Eigenvalues not in base field are represented by their minimal polynomial.
1005486`Provides elementary functions over an integral domain.
1005586`\spadtype{ElementaryFunctionDefiniteIntegration} provides functions to compute definite integrals of elementary functions.
1005746`\spad{ElementaryFunctionLODESolver} provides the top-level functions for finding closed form solutions of linear ordinary differential equations and initial value problems.
1005929`\spad{ElementaryFunctionODESolver} provides the top-level functions for finding closed form solutions of ordinary differential equations and initial value problems.
1006060`This package provides functions to determine the sign of an elementary function around a point or infinity.
1006180`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.
1006313`This package provides functions for integration,{} limited integration,{} extended integration and the risch differential equation for elemntary functions.
1006426`Risch differential equation,{} wrapper for extended version.
1006545`This package generates exponential integrals corresponding to polynomial part of the integral. \blankline
1006684`The elliptic functions \spad{sn},{} \spad{sc} and \spad{dn} are expanded as Taylor series.
1006814`This package provides operations for mapping the sides of equations.
1006875`ErrorFunctions implements error functions callable from the system interpreter. Typically,{} these functions would be called in user functions. The simple forms of the functions take one argument which is either a string (an error message) or a list of strings which all together make up a message. The list can contain formatting codes (see below). The more sophisticated versions takes two arguments where the first argument is the name of the function from which the error was invoked and the second argument is either a string or a list of strings,{} as above. When you use the one argument version in an interpreter function,{} the system will automatically insert the name of the function as the new first argument. Thus in the user interpreter function \indented{2}{\spad{f x == if x < 0 then error "negative argument" else x}} the call to error will actually be of the form \indented{2}{\spad{error("f",{}"negative argument")}} because the interpreter will have created a new first argument. \blankline Formatting codes: error messages may contain the following formatting codes (they should either start or end a string or else have blanks around them): \indented{3}{\spad{\%l}\space{6}start a new line} \indented{3}{\spad{\%b}\space{6}start printing in a bold font (where available)} \indented{3}{\spad{\%d}\space{6}stop\space{2}printing in a bold font (where available)} \indented{3}{\spad{ \%ceon}\space{2}start centering message lines} \indented{3}{\spad{\%ceoff}\space{2}stop\space{2}centering message lines} \indented{3}{\spad{\%rjon}\space{3}start displaying lines "ragged left"} \indented{3}{\spad{\%rjoff}\space{2}stop\space{2}displaying lines "ragged left"} \indented{3}{\spad{\%i}\space{6}indent\space{3}following lines 3 additional spaces} \indented{3}{\spad{\%u}\space{6}unindent following lines 3 additional spaces} \indented{3}{\spad{\%xN}\space{5}insert \spad{N} blanks (eg,{} \spad{\%x10} inserts 10 blanks)} \blankline
1006918`\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. 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{GeneralDistributedMultivariatePolynomial}.
1007111`This package is to be used in conjunction with \indented{12}{the CycleIndicators package. It provides an evaluation} \indented{12}{function for SymmetricPolynomials.}
1007194`This package provides support for exporting SubSpace and ThreeSpace structures to files.
1007231`This package provides support for \spad{XML} files
1007267`This package implements \spad{factorPolynomial} \indented{1}{for Expression.}
1007369`Lifting of maps to Expressions. Date Created: 16 Jan 1989
1007454`Solver for linear systems represented as list \indented{1}{of expressions.\space{2}More efficient than using solve because} \indented{1}{it does not check that system really is linear.}
1007769`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.
1007848`This package allows a mapping \spad{E} \spad{->} \spad{F} to be lifted to a kernel over \spad{E}; This lifting can fail if the operator of the kernel cannot be applied in \spad{F}; Do not use this package with \spad{E} = \spad{F},{} since this may drop some properties of the operators.
1007938`Taylor series solutions of explicit ODE\spad{'s}.
1008039`\spadtype{ExpressionToOpenMath} provides support for converting objects of type \spadtype{Expression} into OpenMath.
1008110`This package provides functions to convert functional expressions to power series.
1008240`Package for constructing tubes around 3-dimensional \indented{1}{parametric curves.}
1008290`\indented{1}{ExtendedPolynomialReduction(\spad{C},{} \spad{E},{} \spad{R}) is a package that allows} denominatorFree reductions of a polynomial \spad{r} from \spad{R} \spad{wrt} a list of polynomials from \spad{R} (usually such a list is a Groebner basis \spad{wrt} the order given via \spad{E}). Additionally,{} the reduction steps are recorded and provided in the output.
1008432`computes various functions on factored arguments.
1008498`\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))}.
1008579`\spadtype{FactoredFunctionUtilities} implements some utility functions for manipulating factored objects.
1008651`This package provides utilities used by the factorizers which operate on polynomials represented as univariate polynomials with multivariate coefficients.
1008785`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).
1008861`This package converts Spad data to form which can be written to files and back.
1008908`This package finds the order of a divisor over a finite \indented{1}{field.}
1009102`This package provides a mapping function for \spadtype{FiniteAbelianMonoidRing}
1009283`Lift a map to finite divisors.
1009637`FiniteFieldFunctions(\spad{GF}) is a package with functions concerning finite extension fields of the finite ground field {\em GF},{} \spadignore{e.g.} Zech logarithms.
1009707`FiniteFieldHomomorphisms(\spad{F1},{} \spad{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}.
1009863`This package provides a number of functions for generating,{} counting and testing irreducible,{} normal,{} primitive,{} random polynomials over finite fields.
1009944`\spad{FiniteFieldPolynomialPackage2}(\spad{F},{} \spad{GF}) exports some functions concerning finite fields,{} which depend on a finite field {\em GF} and an algebraic extension \spad{F} of {\em GF},{} \spadignore{e.g.} a zero of a polynomial over {\em GF} in \spad{F}.
1010069`This package solves linear diophantine equations for Bivariate polynomials over finite fields
1010242`A package for permutation representations of finite groups.
1010309`\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.
1010454`This package exports 3 sorting algorithms which work over FiniteLinearAggregates.
1010558`\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.
1010747`This package implements arbitrary precision numerical elliptic functions. The method is based on descending Landen transform.
1010799`\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.
1010964`\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.
1011040`This package implements numerical evaluation \indented{1}{for selected liouvilian functions.}
1011096`This package implements numerical evaluation of \indented{1}{several special functions.}
1011146`\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' responsibility to check that this is sensible. The advanced functions use SegmentBinding to allow users control over Fortran loop variable names.
1011235`Code to manipulate Fortran Output Stack
1011287`Lifting of morphisms to fractional ideals.
1011604`This package implements the interpolation algorithm proposed in Beckermann,{} Bernhard and Labahn,{} George,{} Fraction-free computation of matrix rational interpolants and matrix GCDs,{} SIAM Journal on Matrix Analysis and Applications 22.
1011729`This package lifts the interpolation functions from \spadtype{FractionFreeFastGaussian} to fractions.
1011932`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.
1012015`\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.
1012194`A package for mappings between coefficients of free modules over the same base set.
1012379`linear extensions of maps on the basis
1012507`Provides some special functions over an integral domain.
1012608`Lifts a map from rings to function fields over them.
1013011`In this package \spad{R} is a Euclidean domain and \spad{F} is a framed algebra over \spad{R}. The package provides functions to compute the integral closure of \spad{R} in the quotient field of \spad{F}. It is assumed that \spad{char(R/P) = char(R)} for any prime \spad{P} of \spad{R}. A typical instance of this is when \spad{R = K[x]} and \spad{F} is a function field over \spad{R}.
1013159`Attaching assertions to symbols for pattern matching; Date Created: 21 Mar 1989
1013249`Attaching predicates to symbols for pattern matching. Date Created: 21 Mar 1989
1013355`\spadtype{FunctionSpaceComplexIntegration} provides functions for the indefinite integration of complex-valued functions.
1013485`\spadtype{FunctionSpaceComplexIntegrationAux} provides functions for the indefinite integration of complex-valued functions.
1013621`This package allows a mapping \spad{R} \spad{->} \spad{S} to be lifted to a mapping from a function space over \spad{R} to a function space over \spad{S}.
1013751`\spadtype{FunctionSpaceIntegration} provides functions for the indefinite integration of real-valued functions.
1013873`FunctionsSpacePrimitiveElement provides functions to compute primitive elements in functions spaces.
1014085`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 newReduc().
1014179`computes sums of top-level expressions.
1014284`This package converts expressions in some function space to exponential expansions.
1014438`This package converts expressions in some function space to power series in a variable \spad{x} with coefficients in that function space. The function \spadfun{exprToUPS} converts expressions to power series whose coefficients do not contain the variable \spad{x}. The function \spadfun{exprToGenUPS} converts functional expressions to power series whose coefficients may involve functions of \spad{log(x)}.
1014854`This package converts expressions in some function space to power series in a variable \spad{x} with coefficients in that function space. The function \spadfun{exprToUPS} converts expressions to power series whose coefficients do not contain the variable \spad{x}. The function \spadfun{exprToGenUPS} converts functional expressions to power series whose coefficients may involve functions of \spad{log(x)}.
1015246`\spadtype{GaloisGroupFactorizationUtilities} provides functions that will be used by the factorizer.
1015392`\spadtype{GaloisGroupFactorizer} provides functions to factor resolvents.
1015601`\spadtype{GaloisGroupPolynomialUtilities} provides useful functions for univariate polynomials which should be added to \spadtype{UnivariatePolynomialCategory} or to \spadtype{Factored} (July 1994).
1015710`\spadtype{GaloisGroupUtilities} provides several useful functions.
1015768`Package for the factorization of complex or gaussian integers.
1015828`\spad{Gcd} basis provides functions to find structure of multiplicative group (and semigroup) generated by elements of \spad{Gcd} domain.
1015878`This package is used for factorization of bivariate polynomials over a finite field and univariate polynomials with integer coefficients.
1015990`\indented{2}{This is the top level package for doing multivariate factorization} over basic domains like \spadtype{Integer} or \spadtype{Fraction Integer}.
1016176`This package provides operations for \spad{GCD} computations on polynomials
1016346`This package provides support functions for generating elliptic integrals.
1016532`\spadtype{GenerateUnivariatePowerSeries} provides functions that create power series from explicit formulas for their \spad{n}th coefficient.
1016600`\spadtype{GenerateUnivariatePowerSeries} provides functions that create power series from explicit formulas for their \spad{n}th coefficient.
1016679`This package is to restrict interpreter choice of signatures,{} and force Expression when no types are declared
1016805`The equation \spad{Af+Bg=h} and its generalization to \spad{n} polynomials is solved for solutions over the \spad{R},{} euclidean domain. A table containing the solutions of \spad{Af+Bg=x^k} is used. The operations are performed modulus a prime which are in principle big enough,{} but the solutions are tested and,{} in case of failure,{} a hensel lifting process is used to get to the right solutions. It will be used in the factorization of multivariate polynomials over finite field,{} with \spad{R=F[x]}.
1016904`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.
1017024`This package provides support for gnuplot. These routines generate output files contain gnuplot scripts that may be processed directly by gnuplot. This is especially convenient in the FriCAS wiki environment where gnuplot is called from LaTeX via gnuplottex.
1017060`Gosper\spad{'s} summation algorithm.
1017250`TwoDimensionalPlotSettings sets global flags and constants for 2-dimensional plotting.
1017295`GrayCode provides a function for efficiently running through all subsets of a finite set,{} only changing one element by another one.
1017331`\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. 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 determined by the polynomial type used. Suggested types include \spadtype{DistributedMultivariatePolynomial},{} \spadtype{HomogeneousDistributedMultivariatePolynomial},{} \spadtype{GeneralDistributedMultivariatePolynomial}.
1017544`This package provides low level tools for Groebner basis computations.
1017708`\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 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 used. Suggested types include \spadtype{DistributedMultivariatePolynomial},{} \spadtype{HomogeneousDistributedMultivariatePolynomial},{} \spadtype{GeneralDistributedMultivariatePolynomial}.
1017858`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.
1017945`This package implements conversion between group \indented{1}{presentation given in terms of elements of \spadtype{FreeGroup}} \indented{1}{and \spadtype{GroupPresentation}.}
1018018`This package implements guessing of sequences. Packages for the most common cases are provided as \spadtype{GuessInteger},{} \spadtype{GuessPolynomial},{} etc.
1018168`This package exports guessing of sequences of rational functions
1018219`This package implements guessing GuessExpRat and GuessBinRat functions of guessing package.
1018377`This package exports guessing of sequences of numbers in a finite field
1018450`This package exports coercion and retraction from EXPR INT to finite fields
1018533`This package exports guessing of sequences of rational numbers
1018577`This package exports guessing of sequences of rational functions
1018629`This package exports coercion and retraction from EXPR INT to polynomials
1018691`This package exports guessing of sequences of rational functions over the integers
1018744`Generate a basis for the free Lie algebra on \spad{n} generators over a ring \spad{R} with identity up to basic commutators of length \spad{c} using the algorithm of \spad{P}. Hall as given in Serre\spad{'s} book Lie Groups \spad{--} Lie Algebras.
1018779`Package to generate Hankel matrices.
1018828`This package provides the functions for the heuristic integer \spad{gcd}. Geddes\spad{'s} algorithm,{} for univariate polynomials with integer coefficients
1018905`\indented{2}{This package provides functions for the primary decomposition of} polynomial ideals over the rational numbers. The ideals are members of the \spadtype{PolynomialIdeal} domain,{} and the polynomial generators are required to be from the \spadtype{DistributedMultivariatePolynomial} domain.
1018977`This package provides operations to create incrementing functions.
1019044`This package computes infinite products of univariate Taylor series
1019158`Functions defined on streams with entries in two sets.
1019227`Functions defined on streams with entries in three sets.
1019305`Default infinity signatures for the interpreter; Date Created: 4 Oct 1989
1019345`Factorization of univariate polynomials with coefficients in an algebraic extension of a field over which we can factor UP\spad{'s}.
1019515`InnerCommonDenominator provides functions to compute the common denominator of a finite linear aggregate of elements of the quotient field of an integral domain.
1019680`This is a package for the exact computation of eigenvalues and eigenvectors. This package works for matrices with coefficients from a field over which we can factor polynomials. Eigenvalues in base field are always explicitly computed while the other are expressed in terms of their minimal polynomial.
1019732`\spadtype{InnerMatrixLinearAlgebraFunctions} is an internal package which provides standard linear algebra functions on domains in \spad{MatrixCategory}
1019909`\spadtype{InnerMatrixQuotientFieldFunctions} provides functions on matrices over an integral domain which involve the quotient field of that integral domain. The functions rowEchelon and inverse return matrices with entries in the quotient field.
1020225`This file contains the functions for modular \spad{gcd} algorithm for univariate polynomials with coefficients in a non-trivial euclidean domain (\spadignore{i.e.} not a field). The package parametrised by the coefficient domain,{} the polynomial domain,{} a prime,{} and a function for choosing the next prime
1020371`This package solves Hermite-Pade interpolation problem \indented{1}{over ring of integer polynomials.\space{2}We use reduction modulo primes} \indented{1}{and modular reconstruction to reduce problem to polynomials modulo} \indented{1}{\$\spad{Z_p}\$.\space{2}Then we use evaluation and Lagrange interpolation to} \indented{1}{reduce problem to solving over \$\spad{Z_p}\$.}
1020424`\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
1020575`InnerNormalBasisFieldFunctions(\spad{GF}) (unexposed): This package has functions used by every normal basis finite field extension domain.
1020657`This package is the inner package to be used by NumericRealEigenPackage and NumericComplexEigenPackage for the computation of numeric eigenvalues and eigenvectors.
1020751`This is an internal package for computing approximate solutions to systems of polynomial equations. The parameter \spad{K} specifies the coefficient field of the input polynomials and must be either \spad{Fraction(Integer)} or \spad{Complex(Fraction Integer)}. The parameter \spad{F} specifies where the solutions must lie and can be one of the following: \spad{Float},{} \spad{Fraction(Integer)},{} \spad{Complex(Float)},{} \spad{Complex(Fraction Integer)}. The last parameter specifies the type of the precision operand and must be either \spad{Fraction(Integer)} or \spad{Float}.
1020855`Find the sign of a polynomial around a point or infinity.
1020946`tools for the summation packages.
1021079`This package provides transformations from trigonometric functions to exponentials and logarithms,{} and back. \spad{F} and \spad{FG} should be the same type of function space.
1021244`Tools for manipulating input forms.
1021301`This package provides functions to lookup bits in integers.
1021342`The \spadtype{IntegerCombinatoricFunctions} package provides some standard functions in combinatorics.
1021424`\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\spad{'s} elliptic curve method.
1021504`Test for linear dependence over the integers.
1021590`This package provides various number theoretic functions on the integers.
1021650`The \spadtype{IntegerPrimesPackage} implements a modification of Rabin\spad{'s} probabilistic primality test and the utility functions \spadfun{nextPrime},{} \spadfun{prevPrime} and \spadfun{primes}.
1021722`Provides integer testing and retraction functions. Date Created: March 1990
1021795`The \spadtype{IntegerRoots} package computes square roots and \indented{2}{\spad{n}th roots of integers efficiently.}
1021858`This package computes Smith form of integer matrices. \indented{1}{It is more efficinet than general case by first using elimination} \indented{1}{with unit pivots from \spadtype{UnitGaussianElimination}.}
1021910`This package provides the implementation for the \spadfun{solveLinearPolynomialEquation} operation over the integers. It uses a lifting technique from the package GenExEuclid
1021977`IntegralBasisPolynomialTools provides functions for \indented{1}{mapping functions on the coefficients of univariate and bivariate} \indented{1}{polynomials.}
1022129`This package contains functions used in the packages FunctionFieldIntegralBasis and NumberFieldIntegralBasis.
1022268`\spadtype{IntegrateSolutions} implements a method \indented{1}{to compute integral of solution of differential operator.}
1022387`Internally used by the integration packages.
1022459`\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
1022540`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.
1022669`Tools for the integrator.
1022753`A package to print strings without line-feed nor carriage-return.
1022804`\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 \spadopFrom{rur}{InternalRationalUnivariateRepresentationPackage}.} \indented{1}{It is based on the {\em generic} algorithm description in [1]. \newline References:} [1] \spad{D}. LAZARD "Solving Zero-dimensional Algebraic Systems" \indented{4}{Journal of Symbolic Computation,{} 1992,{} 13,{} 117-131}
1023063`This package computes the inverse Laplace Transform.
1023193`IrrRepSymNatPackage contains functions for computing the ordinary irreducible representations of symmetric groups on \spad{n} letters {\em {1,{} 2,{} ...,{} n}} in Young\spad{'s} natural form and their dimensions. These representations can be labelled by number partitions of \spad{n},{} \spadignore{i.e.} a weakly decreasing sequence of integers summing up to \spad{n},{} \spadignore{e.g.} {\em [3,{} 3,{} 3,{} 1]} labels an irreducible representation for \spad{n} equals 10. Note: whenever a \spadtype{List Integer} appears in a signature,{} a partition required.
1023240`\spadtype{JetCoordinateTransformation} implements changes of local coordinates. Given are the changes of the coordinates of the base space,{} \spadignore{i.e.} the independent and dependent variables. The transformations of the derivatives are computed via the chain rule. \spad{Y} (\spad{W}) contains expressions for the old variables in terms of the new ones.
1023412`\spadtype{JetGroebner} provides a procedure to compute Groebner bases for arbitrary domains of jet polynomials. Two internal procedures transform to and from \spadtype{DistributedJetBundlePolynomial} where the actual computation is done. The argument \spad{LJV} contains all jet variables effectively occurring in the polynomials. The ordering is determined by the ordering in \spad{P}.
1023600`\indented{1}{The package \spad{JFriCASSupport} provides a number of service} functions to more easily switch on/off certain formats,{} in particular the use of the FormatMathJax formatter. Use \spad{setFormat! FormatMathJax} to switch on MathJax output or \spad{setFormats [FormatMathJax,{} Format1D]} to enable several output formats.
1023645`This package exports some auxiliary functions on kernels
1023720`\spadtype{Kovacic} provides a modified Kovacic\spad{'s} algorithm for solving explicitly irreducible 2nd order linear ordinary differential equations.
1023829`This package computes the forward Laplace Transform.
1023967`A package for solving polynomial systems by means of Lazard triangular sets [1]. This package provides two operations. One for solving in the sense of the regular zeros,{} and the other for solving in the sense of the Zariski closure. Both produce square-free regular sets. Moreover,{} the decompositions do not contain any redundant component. However,{} only zero-dimensional regular sets are normalized,{} since normalization may be time consumming in positive dimension. The decomposition process is that of [2].\newline
1024212`Package for leading coefficient determination in the lifting step. Package working for every unique factorization domain \spad{R} . Uses algorithm given in section 3 of [1] generalized to arbitrary unique factorization domain.
1024358`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 \spadopFrom{lexTriangular}{LexTriangularPackage} and \spadopFrom{squareFreeLexTriangular}{LexTriangularPackage}. The second one provide decompositions by means of square-free regular triangular sets. Both are based on the {\em lexTriangular} method described in [1]. They differ from the algorithm described in [2] by the fact that multiciplities of the roots are not kept. With the \spadopFrom{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
1024544`This package implements frequently used operations \indented{1}{on linear combinations.}
1024649`Test for linear dependence.
1024742`\spad{LinearOrdinaryDifferentialOperator3Aux} is \indented{1}{a helper for \spad{LinearOrdinaryDifferentialOperator3}} \indented{1}{defining appropriate derivative.}
1024908`\spadtype{LinearOrdinaryDifferentialOperatorFactorizer2} provides a factorizer for linear ordinary differential operators whose coefficients are rational functions.
1025022`\spadtype{LinearOrdinaryDifferentialOperatorFactorizer} provides a factorizer for linear ordinary differential operators whose coefficients are rational functions.
1025153`\spad{LinearOrdinaryDifferentialOperatorsOps} provides symmetric products and sums for linear ordinary differential operators.
1025282`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.
1025382`This package solves linear system in the matrix form \spad{AX = B}. It is essentially a particular instantiation of the package \spadtype{LinearSystemMatrixPackage} for Matrix and Vector. This package\spad{'s} existence makes it easier to use \spadfun{solve} in the FriCAS interpreter.
1025445`This package solve system by passing to fraction field.
1025517`This package solves linear system in the matrix form \spad{AX = B}.
1025696`this package finds the solutions of linear systems presented as a list of polynomials.
1025848`\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. This is an internal package,{} operations in this package may crash the system on invalid input.
1025926`This package provides liouvillian functions over an integral domain.
1026027`\spadtype{ListFunctions2} implements utility functions that operate on two kinds of lists,{} each with a possibly different type of element.
1026086`\spadtype{ListFunctions3} implements utility functions that operate on three kinds of lists,{} each with a possibly different type of element.
1026154`splitting lists
1026208`\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.
1026272`This package implements \spad{LLL} reduction. Before \indented{1}{use user must set appropriate floating point precision.\space{2}Too} \indented{1}{low precision may cause nontermination.\space{2}Higher precisions} \indented{1}{require more compute time.}
1026314`\spadtype{LODOConvertions} implements conversion between \indented{1}{\spadtype{LinearOrdinaryDifferentialOperator1} and} \indented{1}{\spadtype{LinearOrdinaryDifferentialOperator3} and back.}
1026459`\spadtype{LUDecomposition} contains procedures to solve linear systems of equations or to compute inverses using a LU decomposition.
1026509`transforms top-level objects into compiled functions.
1026625`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.
1026708`transforms top-level objects into interpreter functions.
1026777`MakeRecord is used internally by the interpreter to create record types which are used for doing parallel iterations on streams.
1026835`transforms top-level objects into compiled functions.
1026937`various Currying operations.
1026997`various Currying operations.
1027073`various Currying operations.
1027165`various Currying operations.
1027239`various Currying operations.
1027329`various Currying operations.
1027435`MathematicalSymbols defines several mathematical symbols,{} mostly Greek letters and multiletter Greek symbols.
1027485`\spadtype{MatrixCategoryFunctions2} provides functions between two matrix domains. The functions provided are \spadfun{map} and \spadfun{reduce}.
1027802`MatrixCommonDenominator provides functions to compute the common denominator of a matrix of elements of the quotient field of an integral domain.
1027902`\spadtype{MatrixLinearAlgebraFunctions} provides functions to compute inverses and canonical forms.
1028076`Some functions for manipulating (dense) matrices. Supported are various kinds of slicing,{} splitting and stacking of matrices. The functions resemble operations often used in numerical linear algebra algorithms.
1028240`This package exports tools for merging lists
1028293`This package generates meshes for 3D plots.
1028359`This package computes \spad{gcd} over field of algebraic \indented{1}{functions over \spad{Q} using modular method based on \spad{M}. Monagan and} \indented{1}{van Hoej paper.} \indented{1}{Core modular operations are passed as parameter (MO) to this} \indented{1}{package.\space{2}Similarly,{} evaluation functions are passed as} \indented{1}{parameter ME.}
1028535`ModularAlgebraicGcd(\spad{MPT},{} \spad{MD},{} MO) is a compatibility \indented{1}{wrapper around \spad{ModularAlgebraicGcd2}.}
1028713`This package implements factorization of polynomials over finite fields using a variant of Kaltofen-Shoup method. Nontrivial data have abstract representation,{} operations are provided by matching package.
1028937`This package provides modular Hermite-Pade solvers \indented{1}{for a few rings.\space{2}Solver over integers is implemented in this} \indented{1}{package.\space{2}Also it contains interfaces to solver over \$\spad{Z_p}\$ and} \indented{1}{solver over ring of integer polynomials.}
1028984`This package provides generic interface to modular \indented{1}{Hermite-Pade solver.}
1029076`Modular hermitian row reduction.
1029154`An auxiliary package for various moment and cumulant transformations used in \spad{Distribution}.
1029215`\spad{MonoidRingFunctions2} implements functions between two monoid rings defined with the same monoid over different rings.
1029290`Tools for handling monomial extensions.
1029392`\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.} \spadsys{)what} commands.
1029441`Utilities for MPolyCat.
1029666`This package \undocumented
1029905`\indented{3}{This package exports a factor operation for multivariate polynomials} with coefficients which are polynomials over some ring \spad{R} over which we can factor. It is used internally by packages such as the solve package which need to work with polynomials in a specific set of variables with coefficients which are polynomials in all the other variables.
1030078`\indented{3}{This package exports a factor operation for multivariate polynomials} with coefficients which are rational functions over some ring \spad{R} over which we can factor. It is used internally by packages such as primary decomposition which need to work with polynomials with rational function coefficients,{} \spadignore{i.e.} themselves fractions of polynomials.
1030272`\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}.
1030437`Compute limits using Gruntz-Gonnet \spad{MRV} algorithm
1030482`Package for factorization of multivariate polynomials over finite fields.
1030635`Lifting of a map through 2 levels of polynomials.
1030958`\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.
1031136`\indented{2}{This is the top level package for doing multivariate factorization} over basic domains like \spadtype{Integer} or \spadtype{Fraction Integer}.
1031311`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]}.
1031454`This package provides the functions for the computation of the square free decomposition of a multivariate polynomial. It uses modular reduction and the package \spad{MultivariateLifting} for the "multivariate" lifting.
1031604`This package solves (multipoint) Hermite-Pade \indented{1}{interpolation problem over \$\spad{Z_p}\$,{} where \$\spad{p}\$ is machine} \indented{1}{sized prime.\space{2}We use quadratic algorithm from 94} \indented{1}{Beckermann and Labahn paper (with modification to handle} \indented{1}{multipoint case).}
1031660`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.
1031744`This package exports Newton interpolation for the special case where the result is known to be in the original integral domain
1031810`This is package computes noncommutative Groebner basis. Based on commutative version. Note that this package accepts rings as base domain,{} however computed basis is over left fraction field. Computations are done in fraction free way (coefficients stay in base ring).
1031964`\spadtype{NoneFunctions1} implements functions on \spadtype{None}. It includes a particularly dangerous coercion from any other type to \spadtype{None}.
1032014`NonLinearFirstOrderODESolver provides a function for finding closed form first integrals of nonlinear ordinary differential equations of order 1.
1032146`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.
1032215`A package for computing normalized associates of univariate polynomials with coefficients in a tower of simple extensions of a field.
1032405`This package implements the norm of a polynomial with coefficients in a monogenic algebra (using resultants)
1032584`This package \undocumented
1032809`Package for the determination of the coefficients in the lifting process. Used by \spadtype{MultivariateLifting}. This package will work for every integral domain \spad{R}. The same method is described in [1] section 2.3.4.
1032975`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 field of \spad{F}.
1033103`NumberFormats provides function to format and read arabic and roman numbers,{} to convert numbers to strings and to read floating-point numbers.
1033146`This package provides polynomials as functions on a ring.
1033229`Numeric provides real and complex numerical evaluation functions for various symbolic types.
1033290`This package is a suite of functions for the numerical integration of an ordinary differential equation of \spad{n} variables: \blankline \indented{8}{\centerline{dy/dx = \spad{f}(\spad{y},{} \spad{x})\space{5}\spad{y} is an \spad{n}-vector}} \blankline \par All the routines are based on a 4-th order Runge-Kutta kernel. These routines generally have as arguments: \spad{n},{} the number of dependent variables; \spad{x1},{} the initial point; \spad{h},{} the step size; \spad{y},{} a vector of initial conditions of length \spad{n} which upon exit contains the solution at \spad{x1 + h}; \spad{derivs},{} a function which computes the right hand side of the ordinary differential equation: \spad{derivs(dydx,{} y,{} x)} computes \spad{dydx},{} a vector which contains the derivative information. \blankline \par In order of increasing complexity: \begin{items} \blankline \item \spad{rk4(y,{} n,{} x1,{} h,{} derivs)} advances the solution vector to \spad{x1 + h} and return the values in \spad{y}. \blankline \item \spad{rk4(y,{} n,{} x1,{} h,{} derivs,{} t1,{} t2,{} t3,{} t4)} is the same as \spad{rk4(y,{} n,{} x1,{} h,{} derivs)} except that you must provide 4 scratch arrays \spad{t1}-\spad{t4} of size \spad{n}. \blankline \item Starting with \spad{y} at \spad{x1},{} \spad{rk4f(y,{} n,{} x1,{} x2,{} ns,{} derivs)} uses \spad{ns} fixed steps of a 4-th order Runge-Kutta integrator to advance the solution vector to \spad{x2} and return the values in \spad{y}. Argument \spad{x2},{} is the final point,{} and \spad{ns},{} the number of steps to take. \blankline \item \spad{rk4qc(y,{} n,{} x1,{} step,{} eps,{} yscal,{} derivs)} takes a 5-th order Runge-Kutta step with monitoring of local truncation to ensure accuracy and adjust stepsize. The function takes two half steps and one full step and scales the difference in solutions at the final point. If the error is within \spad{eps},{} the step is taken and the result is returned. If the error is not within \spad{eps},{} the stepsize if decreased and the procedure is tried again until the desired accuracy is reached. Upon input,{} an trial step size must be given and upon return,{} an estimate of the next step size to use is returned as well as the step size which produced the desired accuracy. The scaled error is computed as \centerline{\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 \centerline{\spad{hnew = 0.9 * hdid * (error/eps)^(-1/4)}} If the error criterion is satisfied,{} then we check if the step size was too fine and return a more efficient one. If \spad{error} > \spad{eps} * (6.0E-04) then the next step size should be \centerline{\spad{hnext} = 0.9 * hdid * (\spad{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 Recipes" by \spad{W}.Press,{} \spad{B}.\spad{P}. Flannery,{} \spad{S}.A. Teukolsky,{} \spad{W}.\spad{T}. Vetterling published by Cambridge University Press. Argument \spad{step} is a record of 3 floating point numbers \spad{(to_try ,{} did ,{} next)},{} \spad{eps} is the required accuracy,{} \spad{yscal} is the scaling vector for the difference in solutions. On input,{} \spad{step.to_try} should be the guess at a step size to achieve the accuracy. On output,{} \spad{step.did} contains the step size which achieved the accuracy and \spad{step.next} is the next step size to use. \blankline \item \spad{rk4qc(y,{} n,{} x1,{} step,{} eps,{} yscal,{} derivs,{} t1,{} t2,{} t3,{} t4,{} t5,{} t6,{} t7)} is the same as \spad{rk4qc(y,{} n,{} x1,{} step,{} eps,{} yscal,{} derivs)} except that the user must provide the 7 scratch arrays \spad{t1-t7} of size \spad{n}. \blankline \item \spad{rk4a(y,{} n,{} x1,{} x2,{} eps,{} h,{} ns,{} derivs)} is a driver program which uses \spad{rk4qc} to integrate \spad{n} ordinary differential equations starting at \spad{x1} to \spad{x2},{} keeping the local truncation error to within \spad{eps} by changing the local step size. The scaling vector is defined as \centerline{\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\spad{'s} right hand side,{} \spad{h} is the current step size and \spad{tiny} is 10 times the smallest positive number representable. The user must supply an estimate for a trial step size and the maximum number of calls to \spad{rk4qc} to use. Argument \spad{x2} is the final point,{} \spad{eps} is local truncation,{} \spad{ns} is the maximum number of call to \spad{rk4qc} to use. \end{items}
1033358`This suite of routines performs numerical quadrature using algorithms derived from the basic trapezoidal rule. Because the error term of this rule contains only even powers of the step size (for open and closed versions),{} fast convergence can be obtained if the integrand is sufficiently smooth. \blankline Each routine returns a Record of type TrapAns,{} which contains\indent{3} \newline value (\spadtype{Float}): \tab{20} estimate of the integral \newline error (\spadtype{Float}): \tab{20} estimate of the error in the computation \newline totalpts (\spadtype{Integer}): \tab{20} total number of function evaluations \newline success (\spadtype{Boolean}): \tab{20} if the integral was computed within the user specified error criterion \indent{0}\indent{0} To produce this estimate,{} each routine generates an internal sequence of sub-estimates,{} denoted by {\em S(i)},{} depending on the routine,{} to which the various convergence criteria are applied. The user must supply a relative accuracy,{} \spad{eps_r},{} and an absolute accuracy,{} \spad{eps_a}. Convergence is obtained when either \centerline{\spad{ABS(S(i) - S(i-1)) < eps_r * ABS(S(i-1))}} \centerline{or \spad{ABS(S(i) - S(i-1)) < eps_a}} are \spad{true} statements. \blankline The routines come in three families and three flavors: \newline\tab{3} closed: \tab{20}romberg,{} \tab{30}simpson,{} \tab{42}trapezoidal \newline\tab{3} open: \tab{20}rombergo,{} \tab{30}simpsono,{} \tab{42}trapezoidalo \newline\tab{3} adaptive closed: \tab{20}aromberg,{} \tab{30}asimpson,{} \tab{42}atrapezoidal \par The {\em S(i)} for the trapezoidal family is the value of the integral using an equally spaced absicca trapezoidal rule for that level of refinement. \par The {\em S(i)} for the simpson family is the value of the integral using an equally spaced absicca simpson rule for that level of refinement. \par The {\em S(i)} for the romberg family is the estimate of the integral using an equally spaced absicca romberg method. For the \spad{i}\spad{-}th level,{} this is an appropriate combination of all the previous trapezodial estimates so that the error term starts with the \spad{2*(i+1)} power only. \par The three families come in a closed version,{} where the formulas include the endpoints,{} an open version where the formulas do not include the endpoints and an adaptive version,{} where the user is required to input the number of subintervals over which the appropriate closed family integrator will apply with the usual convergence parameters for each subinterval. This is useful where a large number of points are needed only in a small fraction of the entire domain. \par Each routine takes as arguments: \newline \spad{f}\tab{10} integrand \newline a\tab{10} starting point \newline \spad{b}\tab{10} ending point \newline \spad{eps_r}\tab{10} relative error \newline \spad{eps_a}\tab{10} absolute error \newline \spad{nmin} \tab{10} refinement level when to start checking for convergence (> 1) \newline \spad{nmax} \tab{10} maximum level of refinement \par The adaptive routines take as an additional parameter \newline \spad{nint}\tab{10} the number of independent intervals to apply a closed \indented{1}{family integrator of the same name.} \par Notes: \newline Closed family level \spad{i} uses \spad{1 + 2^i} points. \newline Open family level \spad{i} uses \spad{1 + 3^i} points.
1033430`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.
1033504`\spadtype{NumericContinuedFraction} provides functions \indented{2}{for converting floating point numbers to continued fractions.}
1033582`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.
1033653`Package for constructing tubes around 3-dimensional \indented{1}{parametric curves.}
1033733`\spad{OctonionCategoryFunctions2} implements functions between two octonion domains defined over different rings. The function map is used to coerce between octonion types.
1033878`\spadtype{ODEIntegration} provides an interface to the integrator. This package is intended for use by the differential equations solver but not at top-level.
1033997`\spad{ODETools} provides tools for the linear ODE solver.
1034103`This package provides tools for operating on one-dimensional arrays with unary and binary functions involving different underlying types.
1034179`Lifting of maps to one-point completions. Date Created: 4 Oct 1989
1034269`\spadtype{OpenMathPackage} provides some simple utilities to make reading OpenMath objects easier.
1034313`\spadtype{OpenMathServerPackage} provides the necessary operations to run FriCAS 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.} \spad{Omserve(4000,{} 60)} and then another process sends OpenMath objects to port 4000 and reads the result.
1034366`This package exports tools to create FriCAS Library information databases.
1034412`Lifting of maps to ordered completions. Date Created: 4 Oct 1989
1034501`\indented{3}{This package provides ordering functions on vectors which} are suitable parameters for OrderedDirectProduct.
1034702`This package provides orthogonal polynomials as functions on a ring.
1034780`This package implements tools form handling \indented{1}{\spadtype{OutputForm}}
1034825`OutPackage allows pretty-printing from programs.
1034865`This package computes reliable Pade approximants using a generalized Viskovatov continued fraction algorithm.
1034947`This package computes reliable Pade approximants using a generalized Viskovatov continued fraction algorithm.
1035079`In this package \spad{K} is a finite field,{} \spad{R} is a ring of univariate polynomials over \spad{K},{} and \spad{F} is a monogenic algebra over \spad{R}. We require that \spad{F} is monogenic,{} \spadignore{i.e.} that \spad{F = K[x,{} y]/(f(x,{} y))},{} because the integral basis algorithm used will factor the polynomial \spad{f(x,{} y)}. The package provides a function to compute the integral closure of \spad{R} in the quotient field of \spad{F} as well as a function to compute a "local integral basis" at a specific prime.
1035269`This package implements fixed-point computations on streams.
1035457`This package implements general parametric integration. \indented{1}{Most work is delegated to other packages.}
1035572`This package completely solves a parametric linear system of equations by decomposing the set of all parametric values for which the linear system is consistent into a union of quasi-algebraic sets (which need not be irredundant,{} but most of the time is). Each quasi-algebraic set is described by a list of polynomials that vanish on the set,{} and a list of polynomials that vanish at no point of the set. For each quasi-algebraic set,{} the solution of the linear system is given,{} as a particular solution and a basis of the homogeneous system. The parametric linear system should be given in matrix form,{} with a coefficient matrix and a right hand side vector. The entries of the coefficient matrix and right hand side vector should be polynomials in the parametric variables,{} over a Euclidean domain of characteristic zero. \blankline If the system is homogeneous,{} the right hand side need not be given. The right hand side can also be replaced by an indeterminate vector,{} in which case,{} the conditions required for consistency will also be given.
1035759`This package \undocumented
1035841`This package implements parametric RDE solver. Only \indented{1}{simplest algebraic cases are implemented,{} the rest of algebraic} \indented{1}{case is unimplemented.\space{2}The code throws errors on inimplmented} \indented{1}{cases.}
1035957`This package \undocumented
1036039`This package \undocumented
1036118`This package implements parametric integration \indented{1}{in transcendental case.}
1036339`The package \spadtype{PartialFractionPackage} gives an easier to use interface to \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.
1036515`PartitionsAndPermutations contains functions for generating streams of integer partitions,{} and streams of sequences of integers composed from a multi-set.
1036572`A package for weighted Motzkin paths over a ring.
1036626`Tools for patterns.
1036698`Lifts maps to patterns.
1036777`This package provides the top-level pattern matching functions.
1036919`Attaching assertions to symbols for pattern matching. Date Created: 21 Mar 1989
1036970`This package provides pattern matching functions on function spaces.
1037099`This package provides pattern matching functions on integers.
1037181`\spadtype{PatternMatchIntegration} provides functions that use the pattern matcher to find some indefinite and definite integrals involving special functions and found in the literature.
1037297`This package provides pattern matching functions on kernels.
1037388`This package provides pattern matching functions on lists.
1037505`This package provides pattern matching functions on polynomials.
1037684`This packages provides tools for matching recursively in type towers.
1037800`This package provides pattern matching functions on quotients.
1037938`Lifts maps to pattern matching results.
1038043`This package provides pattern matching functions on symbols.
1038104`This package provides tools for the pattern matcher.
1038212`Permanent implements the functions {\em permanent},{} the permanent for square matrices.
1038288`PermutationGroupExamples provides permutation groups for some classes of groups: symmetric,{} alternating,{} dihedral,{} cyclic,{} direct products of cyclic,{} which are in fact the finite abelian groups of symmetric groups called Young subgroups. Furthermore,{} Rubik\spad{'s} group as permutation group of 48 integers and a list of sporadic simple groups derived from the atlas of finite groups.
1038339`\indented{1}{Provides a coercion from the symbolic fractions in \%\spad{pi} with} integer coefficients to any Expression type. Date Created: 21 Feb 1990
1038405`\spad{PlotFunctions1} provides facilities for plotting curves where functions \spad{SF} \spad{->} \spad{SF} are specified by giving an expression
1038475`This package exports plotting tools
1038516`This package \undocumented
1038581`This package \undocumented
1038630`This package provides function for testing whether a divisor on a curve is a torsion divisor.
1038853`This package provides function for testing whether a divisor on a curve is a torsion divisor.
1039068`Utilities for PFOQ and PFO.
1039231`Package with the conversion functions among different kind of polynomials
1039296`Groebner functions for \spad{P} \spad{F} \indented{2}{This package is an interface package to the groebner basis} package which allows you to compute groebner bases for polynomials in either lexicographic ordering or total degree ordering refined by reverse lex. The input is the ordinary polynomial type which is internally converted to a type with the required ordering. The resulting grobner basis is converted back to ordinary polynomials. The ordering among the variables is controlled by an explicit list of variables which is passed as a second argument. The coefficient domain is allowed to be any \spad{gcd} domain,{} but the groebner basis is computed as if the polynomials were over a field.
1039350`This package provides a coerce from polynomials over algebraic numbers to \spadtype{Expression Integer}.
1039405`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{^}.
1039574`This package transforms multivariate polynomials or fractions into univariate polynomials or fractions,{} and back.
1039743`PolynomialCommonDenominator provides \indented{1}{functions to compute and clear the common denominator of the} \indented{1}{coefficients of polynomials over the quotient field.}
1039935`This package implements evaluation functions \indented{1}{useful for modular algorithms.\space{2}Computations work} \indented{1}{on integer polynomials,{} but most is done modulo a prime} \indented{1}{which is provided via parameters,{} either explicitly or} \indented{1}{through a state parameter (state also caches needed buffers).} \indented{1}{Some functions work on fractions.\space{2}To avoid useless \spad{GCD}} \indented{1}{computations during evaluation fractions may be represented} \indented{1}{as a record.}
1039995`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}.
1040181`\indented{2}{This package takes a mapping between coefficient rings,{} and lifts} it to a mapping between polynomials over those rings.
1040246`\indented{2}{This package computes multivariate polynomial \spad{gcd}\spad{'s} using} a hensel lifting strategy. The constraint on the coefficient domain is imposed by the lifting strategy. It is assumed that the coefficient domain has the property that almost all specializations preserve the degree of the \spad{gcd}.
1040390`This package exports interpolation algorithms
1040464`This package exports interpolation algorithms
1040575`This package provides various polynomial number theoretic functions over the integers.
1040752`computes \spad{n}-th roots of quotients of multivariate polynomials
1040911`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.
1041071`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.
1041228`This package computes square-free decomposition of multivariate polynomials over a coefficient ring which is an arbitrary \spad{gcd} domain. The requirement on the coefficient domain guarantees that the \spadfun{content} can be removed so that factors will be primitive as well as square-free. Over an infinite ring of finite characteristic,{} it may not be possible to guarantee that the factors are square-free.
1041382`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.
1041463`Provides functions to construct various small posets including powerset. Perhaps it should be called a 'powerlist' but since we do not expect duplicates or require specific ordering it is essentially the same.
1041519`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.
1041638`\spadtype{PrecomputedAssociatedEquations} stores some generic precomputations which speed up the computations of the associated equations needed for factoring operators.
1041769`This is unfinished package for computing primitive \indented{1}{\spad{gcd} over algebraic extensions.\space{2}Algebraic extension is defined} \indented{1}{by list of polynomial forming triangular system.} \indented{1}{Currently implemented is only trial division.}
1041807`This package provides tools for operating on primitive arrays with unary and binary functions involving different underlying types.
1041879`PrimitiveElement provides functions to compute primitive elements in algebraic extensions.
1041944`\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}.}
1042161`In-field solution of Riccati equations,{} primitive case.
1042379`PrintPackage provides a print function for output forms.
1042420`PseudoLinearNormalForm provides a function for computing a block-companion form for pseudo-linear operators.
1042482`This package contains some functions: \spadopFrom{discriminant}{PseudoRemainderSequence},{} \spadopFrom{resultant}{PseudoRemainderSequence},{} \spadopFrom{subResultantGcd}{PseudoRemainderSequence},{} \spadopFrom{chainSubResultants}{PseudoRemainderSequence},{} \spadopFrom{degreeSubResultant}{PseudoRemainderSequence},{} \spadopFrom{lastSubResultant}{PseudoRemainderSequence},{} \spadopFrom{resultantEuclidean}{PseudoRemainderSequence},{} \spadopFrom{subResultantGcdEuclidean}{PseudoRemainderSequence},{} \spadopFrom{\spad{semiSubResultantGcdEuclidean1}}{PseudoRemainderSequence},{} \spadopFrom{\spad{semiSubResultantGcdEuclidean2}}{PseudoRemainderSequence},{} etc. These procedures are coming from improvements of the subresultants algorithm.
1042593`This package provides functions for integration,{} limited integration,{} extended integration and the risch differential equation for pure algebraic integrands.
1042718`In-field solution of an linear ordinary differential equation,{} pure algebraic case.
1042913`This package \undocumented{}
1043068`\spadtype{QuasiAlgebraicSet2} adds a function \spadfun{radicalSimplify} which uses \spadtype{IdealDecompositionPackage} to simplify the representation of a quasi-algebraic set. A quasi-algebraic set is the intersection of a Zariski closed set,{} defined as the common zeros of a given list of polynomials (the defining polynomials for equations),{} and a principal Zariski open set,{} defined as the complement of the common zeros of a polynomial \spad{f} (the defining polynomial for the inequation). Quasi-algebraic sets are implemented in the domain \spadtype{QuasiAlgebraicSet},{} where two simplification routines are provided: \spadfun{idealSimplify} and \spadfun{simplify}. The function \spadfun{radicalSimplify} is added for comparison study only. Because the domain \spadtype{IdealDecompositionPackage} provides facilities for computing with radical ideals,{} it is necessary to restrict the ground ring to the domain \spadtype{Fraction Integer},{} and the polynomial ring to be of type \spadtype{DistributedMultivariatePolynomial}. The routine \spadfun{radicalSimplify} uses these to compute groebner basis of radical ideals and is inefficient and restricted when compared to the two in \spadtype{QuasiAlgebraicSet}.
1043134`A package for removing redundant quasi-components and redundant branches when decomposing a variety by means of quasi-components of regular triangular sets. \newline
1043326`\spadtype{QuaternionCategoryFunctions2} implements functions between two quaternion domains. The function \spadfun{map} is used by the system interpreter to coerce between quaternion types.
1043478`This package extends a function between integral domains to a mapping between their quotient fields.
1043635`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.
1043681`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}.
1043776`This package provides tools for creating radix expansions.
1043821`This package exports random distributions
1043883`This package exports random floating-point distributions
1043937`This package exports integer distributions
1043993`Random number generators \indented{1}{All random numbers used in the system should originate from} \indented{1}{the same generator.\space{2}This package is intended to be the source.}
1044042`Factorization of extended polynomials with rational coefficients. This package implements factorization of extended polynomials whose coefficients are rational numbers. It does this by taking the \spad{lcm} of the coefficients of the polynomial and creating a polynomial with integer coefficients. The algorithm in \spadtype{GaloisGroupFactorizer} is then used to factor the integer polynomial. The result is normalized with respect to the original \spad{lcm} of the denominators.
1044141`Utilities that provide the same top-level manipulations on fractions than on polynomials.
1044200`\spadtype{RationalFunctionDefiniteIntegration} provides functions to compute definite integrals of rational functions.
1044295`Factorization of univariate polynomials with coefficients which are rational functions with integer coefficients.
1044410`This package provides functions for the integration of rational functions.
1044493`Computation of limits for rational functions.
1044564`Find the sign of a rational function around a point or infinity.
1044626`Computes sums of rational functions.
1044701`This package provides functions for the base case of the Risch algorithm.
1044808`This package exports rational interpolation algorithms
1044880`\spad{RationalLODE} provides functions for in-field solutions of linear \indented{1}{ordinary differential equations,{} in the rational case.}
1044980`rational number testing and retraction functions. Date Created: March 1990
1045064`In-field solution of Riccati equations,{} rational case.
1045167`\indented{1}{A package for computing the rational univariate representation} \indented{1}{of a zero-dimensional algebraic variety given by a regular} \indented{1}{triangular set. This package is essentially an interface for the} \spadtype{InternalRationalUnivariateRepresentationPackage} constructor. It is used in the \spadtype{ZeroDimensionalSolvePackage} for solving polynomial systems with finitely many solutions.
1045295`This package contains special case for RDE solver.
1045339`This package tries to rewrite an expression in \indented{1}{real form preserving its value.}
1045463`\spadtype{RealPolynomialUtilitiesPackage} provides common functions used by interval coding.
1045603`This package provides numerical solutions of systems of polynomial equations for use in ACPLOT.
1045651`\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.
1045737`\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.
1045835`\spadtype{RectangularMatrixCategoryFunctions2} provides functions between two matrix domains. The functions provided are \spadfun{map} and \spadfun{reduce}.
1046247`This package provides an operator for the \spad{n}-th term of a recurrence and an operator for the coefficient of \spad{x^n} in a function specified by a functional equation.
1046350`This package finds the order of a divisor over a field \indented{1}{using reduction to finite field.}
1046557`Elimination of an algebraic from the coefficients of a linear ordinary differential equation.
1046774`\spadtype{ReductionOfOrder} provides functions for reducing the order of linear ordinary differential equations once some solutions are known.
1046882`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\spad{'s} algorithm) or in the sense of the regular zeros (like in Wu,{} Wang or Lazard methods). This algorithm is valid for nay type of regular set. It does not care about the way a polynomial is added in an regular set,{} or how two quasi-components are compared (by an inclusion-test),{} or how the invertibility test is made in the tower of simple extensions associated with a regular set. These operations are realized respectively by the domain \spad{TS} and the packages \spadtype{QCMPACK}(\spad{R},{} \spad{E},{} \spad{V},{} \spad{P},{} \spad{TS}) and \spadtype{RSETGCD}(\spad{R},{} \spad{E},{} \spad{V},{} \spad{P},{} \spad{TS}). The same way it does not care about the way univariate polynomial \spad{gcd} (with coefficients in the tower of simple extensions associated with a regular set) are computed. The only requirement is that these \spad{gcd} need to have invertible initials (normalized or not). WARNING. There is no need for a user to call directly any operation of this package since they can be accessed by the domain \spad{TS}. Thus,{} the operations of this package are not documented.\newline
1047083`An internal package for computing gcds and resultants of univariate polynomials with coefficients in a tower of simple extensions of a field.\newline
1047284`Implements multiplication by repeated addition
1047353`Implements exponentiation by repeated squaring
1047422`\spad{RepresentationPackage1} provides functions for representation theory for finite groups and algebras. The package creates permutation representations and uses tensor products and its symmetric and antisymmetric components to create new representations of larger degree from given ones. Note: instead of having parameters from \spadtype{Permutation} this package allows list notation of permutations as well: \spadignore{e.g.} \spad{[1,{} 4,{} 3,{} 2]} denotes permutes 2 and 4 and fixes 1 and 3.
1047479`\spad{RepresentationPackage2} provides functions for working with modular representations of finite groups and algebra. The routines in this package are created,{} using ideas of \spad{R}. Parker,{} (the meat-Axe) to get smaller representations from bigger ones,{} \spadignore{i.e.} finding sub- and factormodules,{} or to show,{} that such the representations are irreducible. Note: most functions are randomized functions of Las Vegas type \spadignore{i.e.} every answer is correct,{} but with small probability the algorithm fails to get an answer.
1047536`This package provides coercions for the special types \spadtype{Exit} and \spadtype{Void}.
1047598`RetractSolvePackage is an interface to \spadtype{SystemSolvePackage} that attempts to retract the coefficients of the equations before solving.
1047695`This package implements \spad{alg_split_roots} \indented{1}{allowing its reuse.}
1047788`This package performs root simplifications developing further methods from references below.
1047835`This package implements 'complex_roots'.
1047995`This package provides operations for mapping functions onto \spadtype{SegmentBinding}\spad{s}.
1048067`This package provides operations for mapping functions onto segments.
1048128`A domain for mappings between sequences.
1048216`Provides functions to construct various simplicial complexes.
1048286`\indented{1}{Package to allow simplify to be called on AlgebraicNumbers} by converting to EXPR(INT)
1048353`\spadtype{SmithNormalForm} is a package which provides some standard canonical forms for matrices.
1048513`A sorted cache of a cachable set \spad{S} is a dynamic structure that keeps the elements of \spad{S} sorted and assigns an integer to each element of \spad{S} once it is in the cache. This way,{} equality and ordering on \spad{S} are tested directly on the integers associated with the elements of \spad{S},{} once they have been entered in the cache.
1048568`This package exports sorting algorithnms
1048661`This package contains a function which speeds up \indented{1}{coercion in an important special case.}
1048784`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.
1048864`This package implements series expansions for a few \indented{1}{special functions.}
1048992`SpecialOutputPackage allows FORTRAN,{} Tex and \indented{2}{MathML Formatter output from programs.}
1049043`A internal package for removing redundant quasi-components and redundant branches when decomposing a variety by means of quasi-components of regular triangular sets. \newline
1049245`A package providing a new algorithm for solving polynomial systems by means of regular chains. Two ways of solving are provided: in the sense of Zariski closure (like in Kalkbrener\spad{'s} algorithm) or in the sense of the regular zeros (like in Wu,{} Wang or Lazard- Moreno methods). This algorithm is valid for nay type of regular set. It does not care about the way a polynomial is added in an regular set,{} or how two quasi-components are compared (by an inclusion-test),{} or how the invertibility test is made in the tower of simple extensions associated with a regular set. These operations are realized respectively by the domain \spad{TS} and the packages \spad{QCMPPK(R,{} E,{} V,{} P,{} TS)} and \spad{RSETGCD(R,{} E,{} V,{} P,{} TS)}. The same way it does not care about the way univariate polynomial gcds (with coefficients in the tower of simple extensions associated with a regular set) are computed. The only requirement is that these gcds need to have invertible initials (normalized or not). WARNING. There is no need for a user to call directly any operation of this package since they can be accessed by the domain \spadtype{TS}. Thus,{} the operations of this package are not documented.\newline
1049466`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
1049676`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.
1049746`A package to compute Taylor and Puiseux series of \spad{S}-transforms.
1049989`StreamExponentialSeriesOperations implements arithmetic of exponential power series,{} where a power series is represented by a stream of its coefficients.
1050073`\indented{1}{StreamExponentialSeriesTranscendentalFunctions implements} \indented{1}{exp and log of exponential power series,{}} where a power series is represented by a stream of its coefficients.
1050192`Functions defined on streams with entries in one set.
1050246`Functions defined on streams with entries in two sets.
1050309`Functions defined on streams with entries in three sets.
1050381`StreamTaylorSeriesOperations implements Taylor series arithmetic,{} where a Taylor series is represented by a stream of its coefficients,{} see corresponding operations in the category Ring.
1050490`StreamTranscendentalFunctions implements transcendental functions on Taylor series,{} where a Taylor series is represented by a stream of its coefficients.
1050579`StreamTranscendentalFunctionsNonCommutative implements transcendental functions on Taylor series over a non-commutative ring,{} where a Taylor series is represented by a stream of its coefficients.
1050684`StructuralConstantsPackage provides functions creating structural constants from a multiplication tables or a basis of a matrix algebra and other useful functions in this context.
1050756`This package provides functions for counting real roots of univariate polynomials over an OrderedIntegralDomain.
1050866`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
1050973`Computes all the symmetric functions in \spad{n} variables.
1051029`SymmetricGroupCombinatoricFunctions contains combinatoric functions concerning symmetric groups and representation theory: list young tableaus,{} improper partitions,{} subsets bijection of Coleman.
1051092`\spad{SymmetryAnalysis(JB,{} \spad{xi},{} eta)} provides procedures for the symmetry analysis of differential equations over a given jet bundle. Currently there exist only some procedures to set up the determining system for the symmetry generators of Lie point symmetries.
1051228`SystemODESolver provides tools for triangulating and solving some systems of linear ordinary differential equations.
1051335`Symbolic solver for systems of rational functions with coefficients in an integral domain \spad{R}. The systems are solved in the field of rational functions over \spad{R}. Solutions are exact of the form variable = value when the value is a member of the coefficient domain \spad{R}. Otherwise the solutions are implicitly expressed as roots of univariate polynomial equations over \spad{R}. Care is taken to guarantee that the denominators of the input equations do not vanish on the solution sets. The arguments to solve can either be given as equations or as rational functions interpreted as equal to zero. The user can specify an explicit list of symbols to be solved for,{} treating all other symbols appearing as parameters or omit the list of symbols in which case the system tries to solve with respect to all symbols appearing in the input.
1051401`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.
1051461`\spad{TabulatedComputationPackage(Key ,{} Entry)} provides some modest support for dealing with operations with type \spad{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,{} only one hash-table is built by calling \spad{TabulatedComputationPackage(Key ,{} Entry)}.
1051559`Expands tangents of sums and scalar products.
1051794`This package provides functions for template manipulation
1051841`linear extensions of maps on the basis
1051995`\spadtype{TexFormat1} provides a utility coercion for changing to TeX format anything that has a coercion to the standard output format.
1052047`This package supports evaluation with timeout.
1052099`Tools for the sign finding utilities.
1052150`TopLevelDrawFunctions provides top level functions for drawing graphics of expressions.
1052237`TopLevelDrawFunctionsForAlgebraicCurves provides top level functions for drawing non-singular algebraic curves.
1052360`TopLevelDrawFunctionsForCompiledFunctions provides top level functions for drawing graphics of expressions.
1052433`TopLevelDrawFunctionsForPoints provides top level functions for drawing curves and surfaces described by sets of points.
1052493`This package exports a function for making a \spadtype{ThreeSpace}
1052540`Hermite integration,{} transcendental case.
1052652`This package provides functions for the transcendental case of the Risch algorithm.
1052754`TranscendentalManipulations provides functions to simplify and expand expressions involving transcendental operators.
1052868`This package tries to find solutions of equations of type Expression(\spad{R}). This means expressions involving transcendental,{} exponential,{} logarithmic and nthRoot functions. After trying to transform different kernels to one kernel by applying several rules,{} it calls zerosOf for the SparseUnivariatePolynomial in the remaining kernel. For example the expression \spad{sin(x)*cos(x)-2} will be transformed to \indented{3}{\spad{-2 tan(x/2)^4 -2 tan(x/2)^3 -4 tan(x/2)^2 +2 tan(x/2) -2}} by using the function normalize and then to \indented{3}{\spad{-2 tan(x)^2 + tan(x) -2}} with help of subsTan. This function tries to express the given function in terms of \spad{tan(x/2)} to express in terms of \spad{tan(x)} . Other examples are the expressions \spad{sqrt(x+1)+sqrt(x+7)+1} or \indented{1}{\spad{sqrt(sin(x))+1} .}
1052940`This package finds the function \spad{func3} where \spad{func1} and \spad{func2} \indented{1}{are given and\space{2}\spad{func1} = \spad{func3}(\spad{func2}) .\space{2}If there is no solution then} \indented{1}{function \spad{func1} will be returned.} \indented{1}{An example would be\space{2}\spad{func1 := 8*X^3+32*X^2-14*X ::EXPR INT} and} \indented{1}{\spad{func2 := 2*X ::EXPR INT} convert them via univariate} \indented{1}{to FRAC SUP EXPR INT and then the solution is \spad{func3 := X^3+X^2-X}} \indented{1}{of type FRAC SUP EXPR INT}
1053019`This package provides functions that compute "fraction-free" inverses of upper and lower triangular matrices over a integral domain. By "fraction-free inverses" we mean the following: given a matrix \spad{B} with entries in \spad{R} and an element \spad{d} of \spad{R} such that \spad{d} * inv(\spad{B}) also has entries in \spad{R},{} we return \spad{d} * inv(\spad{B}). Thus,{} it is not necessary to pass to the quotient field in any of our computations.
1053190`\spadtype{TrigonometricManipulations} provides transformations from trigonometric functions to complex exponentials and logarithms,{} and back.
1053311`This package provides transformations from trigonometric functions to exponentials and logarithms,{} and back. \spad{F} and \spad{FG} should be the same type of function space.
1053434`Tools for constructing tubes around 3-dimensional parametric curves.
1053760`\indented{1}{The purpose of this package is to provide reasonable plots of} functions with singularities.
1053814`A basic package for the factorization of bivariate polynomials over a finite field. The functions here represent the base step for the multivariate factorizer.
1053879`This is a low-level package which implements operations \indented{1}{on vectors treated as univariate modular polynomials.\space{2}Most} \indented{1}{operations takes modulus as parameter.\space{2}Modulus is machine} \indented{1}{sized prime which should be small enough to avoid overflow} \indented{1}{in intermediate calculations.}
1053939`Gaussian elimination using only 1 or \spad{-1} as pivots \blankline
1053992`Unittest is a package that provides functions for regression \indented{13}{testing.\space{2}Note that it calls the interpreter,{} thus,{} all} \indented{13}{functions require that their arguments be passed as strings.}
1054032`UnittestAux is an auxiliary package to Unittest,{} that performs \indented{13}{checking of tests,{} dealing also with fatal errors.}
1054086`UnittestCount is a package that keeps track of statistics \indented{13}{collected during testing.\space{2}It is separate from} \indented{13}{\spadtype{UnittestAux} because the latter takes an argument,{}} \indented{13}{and we want the state to be common for all arguments.}
1054315`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.}
1054476`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.
1054812`UnivariatePolynomialDecompositionPackage implements functional decomposition of univariate polynomial with coefficients in an \spad{IntegralDomain} of \spad{CharacteristicZero}.
1054941`UnivariatePolynomialDivisionPackage provides a division for non monic univarite polynomials with coefficients in an \spad{IntegralDomain}.
1055063`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.
1055158`This package implements Karatsuba\spad{'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 FriCAS.
1055272`This package provides for square-free decomposition of univariate polynomials over arbitrary rings,{} \spadignore{i.e.} a partial factorization such that each factor is a product of irreducibles with multiplicity one and the factors are pairwise relatively prime. If the ring has characteristic zero,{} the result is guaranteed to satisfy this condition. If the ring is an infinite ring of finite characteristic,{} then it may not be possible to decide when polynomials contain factors which are \spad{p}th powers. In this case,{} the flag associated with that polynomial is set to "nil" (meaning that that polynomials are not guaranteed to be square-free).
1055402`Mapping package for univariate Puiseux series. This package allows one to apply a function to the coefficients of a univariate Puiseux series.
1055564`\spad{UnivariateSkewPolynomialCategoryOps} provides products and \indented{1}{divisions of univariate skew polynomials.}
1055679`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.}
1055869`\indented{1}{This package provides Taylor series solutions to regular} linear or non-linear ordinary differential equations of arbitrary order.
1056012`This package provides operations for mapping functions onto segments.
1056085`Provides functions to force a partial ordering on any set.
1056153`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.
1056208`\spad{RUTSodetools} provides tools to interface with the series \indented{1}{ODE solver when presented with linear ODEs.}
1056391`\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}.
1056646`ViewportDefaultsPackage describes default and user definable values for graphics
1056696`ViewportPackage provides functions for creating GraphImages and TwoDimensionalViewports from lists of lists of points.
1056739`This package implements the Weierstrass preparation theorem \spad{f} for multivariate power series. weierstrass(\spad{v},{} \spad{p}) where \spad{v} is a variable,{} and \spad{p} is a TaylorSeries(\spad{R}) in which there is term of form c*v^s where \spad{c} is a constant. Let \spad{s} be minimal as above. The result is a list of TaylorSeries coefficients A[\spad{i}] of the equivalent polynomial A = A[0] + A[1]\spad{*v} + A[2]\spad{*v^2} + ... + A[\spad{s}-1]\spad{*v^}(\spad{s}-1) + \spad{v^s} such that p=A*B ,{} \spad{B} being a TaylorSeries of minimum degree 0
1056798`In this package \spad{K} is a finite field,{} \spad{R} is a ring of univariate polynomials over \spad{K},{} and \spad{F} is a framed algebra over \spad{R}. The package provides a function to compute the integral closure of \spad{R} in the quotient field of \spad{F} as well as a function to compute a "local integral basis" at a specific prime.
1056980`Using the Hankel matrix of a noncommutative polynomial one can determine the rank (Matrices de Hankel by Fliess). The extended Ho-Algorithmus (Fornasini+Marchesini) is used to create a minimal linear representation. Another approach is implemented in NonCommutativeRationalFunctions.
1057067`This package provides computations of logarithms and exponentials for polynomials in non-commutative variables. \newline Author: Michel Petitot (petitot@lifl.\spad{fr}).
1057264`A package for computing symbolically the complex and real roots of zero-dimensional algebraic systems over the integer or rational numbers. Complex roots are given by means of univariate representations of irreducible regular chains. Real roots are given by means of tuples of coordinates lying in the \spadtype{RealClosure} of the coefficient ring. This constructor takes three arguments. The first one \spad{R} is the coefficient ring. The second one \spad{ls} is the list of variables involved in the systems to solve. The third one must be \spad{concat(ls,{} s)} where \spad{s} is an additional symbol used for the univariate representations. WARNING: The third argument is not checked. All operations are based on triangular decompositions. The default is to compute these decompositions directly from the input system by using the \spadtype{RegularChain} domain constructor. The lexTriangular algorithm can also be used for computing these decompositions (see the \spadtype{LexTriangularPackage} package constructor). For that purpose,{} the operations \spadopFrom{univariateSolve}{ZeroDimensionalSolvePackage},{} \spadopFrom{realSolve}{ZeroDimensionalSolvePackage} and \spadopFrom{positiveSolve}{ZeroDimensionalSolvePackage} admit an optional argument. \newline Author: Marc Moreno Maza.
1057386`The class of abelian groups,{} \spadignore{i.e.} additive monoids where each element has an additive inverse. \blankline
1057446`The class of additive (commutative) monoids,{} \spadignore{i.e.} semigroups with an additive identity element. \blankline
1057508`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 coefficients and the e_i,{} elements of the ordered abelian monoid,{} are thought of as exponents or monomials. The monomials commute with each other,{} but in general do not commute with the coefficients (which themselves may or may not be commutative). See \spadtype{FiniteAbelianMonoidRing} for the case of finite support. A useful common model for polynomials and power series. Conceptually at least,{} only the non-zero terms are ever operated on.
1057626`the class of all additive (commutative) semigroups,{} \spadignore{i.e.} a set with a commutative and associative operation \spadop{+}. \blankline
1057693`The notion of aggregate serves to model any data structure aggregate,{} designating any collection of objects,{} with heterogeneous 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 \spadtype{finiteAggregate} is used to assert that a domain has a finite number of elements.
1057743`The category of associative algebras (modules which are themselves rings). \blankline
1057816`Model for algebraically closed fields.
1057896`Model for algebraically closed function spaces.
1058019`Category for the inverse trigonometric functions.
1058117`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.
1058243`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.
1058313`\spadtype{BasicType} is the basic category for describing a collection of elements with \spadop{=} (equality).
1058367`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
1058461`\spadtype{BinaryTreeCategory(S)} is the category of binary trees: a tree which is either empty or has a \spadfun{node} consisting of a value and a \spadfun{left} and \spadfun{right} which are both binary trees.
1058550`The bit aggregate category models aggregates representing large quantities of Boolean data.
1058608`A collection is a homogeneous aggregate which can be built from a 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.
1058674`This category represents the extension of a ring by a square root of \spad{-1}.
1058763`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.
1058829`This category is a collection of operations common to both categories \spadtype{Dictionary} and \spadtype{MultiDictionary}
1058915`Differential extensions of a ring \spad{R}. Given a differentiation on \spad{R},{} extend it to a differentiation on \%.
1059004`\spadtype{DifferentialPolynomialCategory} is a category constructor specifying basic functions in an ordinary differential polynomial ring with a given ordered set of differential indeterminates. In addition,{} it implements defaults for the basic functions. The functions \spadfun{order} and \spadfun{weight} are extended from the set of derivatives of differential indeterminates to the set of differential polynomials. Other operations provided on differential polynomials are \spadfun{leader},{} \spadfun{initial},{} \spadfun{separant},{} \spadfun{differentialVariables},{} and \spadfun{isobaric?}. Furthermore,{} if the ground ring is a differential ring,{} then evaluation (substitution of differential indeterminates by elements of the ground ring or by differential polynomials) is provided by \spadfun{eval}. A convenient way of referencing derivatives is provided by the functions \spadfun{makeVariable}. \blankline To construct a domain using this constructor,{} one needs to provide a ground ring \spad{R},{} an ordered set \spad{S} of differential indeterminates,{} a ranking \spad{V} on the set of derivatives of the differential indeterminates,{} and a set \spad{E} of exponents in bijection with the set of differential monomials in the given differential indeterminates. \blankline
1059197`An ordinary differential ring,{} that is,{} a ring with an operation \spadfun{differentiate}. \blankline
1059265`\spadtype{DifferentialVariableCategory} constructs the set of derivatives of a given set of (ordinary) differential indeterminates. If \spad{x},{} ...,{} \spad{y} is an ordered set of differential indeterminates,{} and the prime notation is used for differentiation,{} then the set of derivatives (including zero-th order) of the differential indeterminates is \spad{x},{} \spad{x'},{} \spad{x''},{} ...,{} \spad{y},{} \spad{y'},{} \spad{y''},{} ... (Note: in the interpreter,{} the \spad{n}-th derivative of \spad{y} is displayed as \spad{y} with a subscript \spad{n}.) This set is viewed as a set of algebraic indeterminates,{} totally ordered in a way compatible with differentiation and the given order on the differential indeterminates. Such a total order is called a ranking of the differential indeterminates. \blankline A domain in this category is needed to construct a differential polynomial domain. Differential polynomials are ordered by a ranking on the derivatives,{} and by an order (extending the ranking) on on the set of differential monomials. One may thus associate a domain in this category with a ranking of the differential indeterminates,{} just as one associates a domain in the category \spadtype{OrderedAbelianMonoidSup} with an ordering of the set of monomials in a set of algebraic indeterminates. The ranking is specified through the binary relation \spadfun{<}. For example,{} one may define one derivative to be less than another by lexicographically comparing first the \spadfun{order},{} then the given order of the differential indeterminates appearing in the derivatives. This is the default implementation. \blankline The notion of weight generalizes that of degree. A polynomial domain may be made into a graded ring if a weight function is given on the set of indeterminates,{} Very often,{} a grading is the first step in ordering the set of monomials. For differential polynomial domains,{} this constructor provides a function \spadfun{weight},{} which allows the assignment of a non-negative number to each derivative of a differential indeterminate. For example,{} one may define the weight of a derivative to be simply its \spadfun{order} (this is the default assignment). This weight function can then be extended to the set of all differential polynomials,{} providing a graded ring structure.
1059375`\indented{2}{This category represents a finite cartesian product of a given type.} Many categorical properties are preserved under this construction.
1059492`A division ring (sometimes called a skew field),{} \spadignore{i.e.} a not necessarily commutative ring where all non-zero elements have multiplicative inverses.
1059552`Category for the elementary functions.
1059640`An eltable aggregate is one which can be viewed as a function. For example,{} the list \spad{[1,{} 7,{} 4]} can be applied to 1,{} 2,{} and 3 respectively and will return the integers 1,{} 7,{} and 4; thus this list may be viewed as mapping 1 to 1,{} 2 to 7 and 3 to 4. In general,{} an aggregate can map members of a domain {\em Dom} to an image domain {\em Im}.
1059739`Entire Rings (non-commutative Integral Domains),{} \spadignore{i.e.} a ring not necessarily commutative which has no zero divisors. \blankline
1059795`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)}}
1059860`This category provides \spadfun{eval} operations. A domain may belong to this category if it is possible to make ``evaluation\spad{''} substitutions.
1059930`An expression space is a set which is closed under certain operators.
1060020`An extensible aggregate is one which allows insertion and deletion of entries. These aggregates are models of lists 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.
1060116`ExtensionField {\em F} is the category of fields which extend the field \spad{F}
1060186`This is a category to represent different types of facet,{} such as,{} (1) A single simplex (2) A single cubical simplex (3) The product of two facets \blankline
1060248`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
1060292`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.
1060376`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
1060423`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.
1060554`FiniteAlgebraicExtensionField {\em F} is the category of fields which are finite algebraic extensions of the field {\em F}. If {\em F} is finite then any finite algebraic extension of {\em F} is finite,{} too. Let {\em K} be a finite algebraic extension of the finite field {\em F}. The exponentiation of elements of {\em K} defines a \spad{Z}-module structure on the multiplicative group of {\em K}. The additive group of {\em K} becomes a module over the ring of polynomials over {\em F} via the operation \spadfun{linearAssociatedExp}(a: \spad{K},{} \spad{f:} SparseUnivariatePolynomial \spad{F}) which is linear over {\em F},{} \spadignore{i.e.} for elements {\em a} from {\em K},{} {\em c,{} d} from {\em F} and {\em f,{} g} univariate polynomials over {\em F} we have \spadfun{linearAssociatedExp}(a,{} cf+dg) equals {\em c} times \spadfun{linearAssociatedExp}(a,{} \spad{f}) plus {\em d} times \spadfun{linearAssociatedExp}(a,{} \spad{g}). Therefore \spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\em F[X]}: \spadfun{linearAssociatedExp}(a,{} monomial(1,{} \spad{k})\spad{\$}SUP(\spad{F})) is defined to be \spadfun{Frobenius}(a,{} \spad{k}) which is {\em a^(q^k)} where {\em q=size()\$F}. The operations order and discreteLog associated with the multiplicative exponentiation have additive analogues associated to the operation \spadfun{linearAssociatedExp}. These are the functions \spadfun{linearAssociatedOrder} and \spadfun{linearAssociatedLog},{} respectively.
1060658`This category describes finite rational divisors on a curve,{} that is finite formal sums SUM(\spad{n} * \spad{P}) where the \spad{n}\spad{'s} are integers and the \spad{P}\spad{'s} are finite rational points on the curve.
1060887`FiniteFieldCategory is the category of finite fields
1060961`Category of finite graphs,{} allows us to model graph theory \blankline
1061036`The category of finite groups.
1061093`A FiniteRankAlgebra is an algebra over a commutative ring \spad{R} which is a free \spad{R}-module of finite rank.
1061227`A FiniteRankNonAssociativeAlgebra is a non associative algebra over a commutative ring \spad{R} which is a free \spad{R}-module of finite rank.
1061348`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.
1061437`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 implementations are usually binary or decimal)} \indented{2}{2: \spadfunFrom{precision}{FloatingPointSystem} of the \spadfunFrom{mantissa}{FloatingPointSystem} (arbitrary or fixed)} \indented{2}{3: rounding error for operations} \blankline Because a Float is an approximation to the real numbers,{} even though it is defined to be a join of a Field and OrderedRing,{} some of the attributes do not hold. In particular associative(\spad{"+"}) does not hold. Algorithms defined over a field need special considerations when the field is a floating point system.
1061570`A \spadtype{FramedAlgebra} is a \spadtype{FiniteRankAlgebra} together with a fixed \spad{R}-module basis.
1061696`A \spadtype{FramedModule} is a finite rank free module with fixed \spad{R}-module basis.
1061779`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.
1061892`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{FreeModuleCategory} category constructor. Author: Michel Petitot (petitot@lifl.\spad{fr}) \blankline Note (Franz Lehner,{} June 2009): \spad{FreeModule} originally was not of FreeModuleCategory. Some functions (like \spad{support},{} \spad{coefficients},{} \spad{monomials},{} ...) from here could be moved to \spad{IndexedDirectProductCategory} but at the moment there is no need for this.
1062005`This category provides a selection of evaluation operations depending on what the argument type \spad{R} provides.
1062094`\spad{S} is \spadtype{FullyLinearlyExplicitOver R} means that \spad{S} is a \spadtype{LinearlyExplicitOver R} and,{} in addition,{} if \spad{R} is a \spadtype{LinearlyExplicitOver Integer},{} then so is \spad{S}
1062192`\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\spad{'t} retract into \spad{B}.} Date Created: March 1990
1062276`This category is a model for the function field of a plane algebraic curve.
1062484`A space of formal functions with arguments in an arbitrary ordered set.
1062587`This category describes domains where \spadfun{\spad{gcd}} can be computed but where there is no guarantee of the existence of \spadfun{factor} operation for factorization into irreducibles. However,{} if such a \spadfun{factor} operation exist,{} factorization will be unique up to order and units.
1062640`GradedAlgebra(\spad{R},{} \spad{E}) denotes ``E-graded \spad{R}-algebra\spad{''}. A graded algebra is a graded module together with a degree preserving \spad{R}-linear map,{} called the {\em product}. \blankline The name ``product\spad{''} is written out in full so inner and outer products with the same mapping type can be distinguished by name.
1062743`GradedModule(\spad{R},{} \spad{E}) denotes ``E-graded \spad{R}-module\spad{''},{} \spadignore{i.e.} collection of \spad{R}-modules indexed by an abelian monoid \spad{E}. An element \spad{g} of \spad{G[s]} for some specific \spad{s} in \spad{E} is said to be an element of \spad{G} with {\em degree} \spad{s}. Sums are defined in each module \spad{G[s]} so two elements of \spad{G} have a sum if they have the same degree. \blankline Morphisms can be defined and composed by degree to give the mathematical category of graded modules.
1062842`The class of multiplicative groups,{} \spadignore{i.e.} monoids with multiplicative inverses. \blankline
1062886`All domains for which we can compute hash function \indented{1}{compatible with equality.}
1062938`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 \spadtype{finiteAggregate} have a finite number of members. Of course,{} such a domain may have an infinite number of elements,{} like,{} for example \spadtype{List}. Those domains with attribute \spadtype{shallowlyMutable} allow an element to be modified or updated without changing its overall value.
1063024`Category for the hyperbolic trigonometric functions.
1063111`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.
1063224`This category provides \spadfun{eval} operations. A domain may belong to this category if it is possible to make ``evaluation\spad{''} 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.
1063316`An \spad{IntegerNumberSystem} is a model for the integers.
1063386`\spadtype{JetBundleBaseFunctionCategory} defines the category of functions (local sections) of the base space of a jet bundle,{} \spadignore{i.e.} functions depending only on the independent variables. Such a category is needed \spadignore{e.g.} for the representation of solutions.
1063503`\spadtype{JetBundleCategory} provides basic data structures and procedures for jet bundles. Nearly all necessary functions are implemented already here. Only the representation and functions which directly access it must be implemented in a domain. Two notations of derivatives are supported. Default is multi-index notation,{} where the \spad{i}-th entry of the index denotes the number of differentiations taken with respect to \spad{x^i}. In repeated index notation each entry \spad{i} in the index denotes a differentiation with respect to \spad{x^i}. The choice affects,{} however,{} only in- and output. Internally,{} multi-index notation is used throughout.
1063569`\spadtype{JetBundleFunctionCategory} defines the category of functions (local sections) over a jet bundle. The formal derivative is defined already here. It uses the Jacobi matrix of the functions. The columns of the matrices are enumerated by jet variables. Thus they are represented as a \spadtype{Record} of the matrix and a list of the jet variables. Several simplification routines are implemented already here.
1063680`A keyed dictionary is a dictionary of key-entry pairs for which there is a unique entry for each key.
1063785`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. Elements of LazyStreamAggregate are computed only when strictly needed. Lazy computation means that potential errors are delayed,{} so errors are detected later than in case of normal (eager) evaluation used by other aggregates. In some cases computation that would signal error when using eager evaluation can succeed when using lazy evaluation.
1063871`The category of all left algebras over an arbitrary ring.
1063938`The category of Lie Algebras. It is used by the following domains of non-commutative algebra: \spadtype{LiePolynomial} and \spadtype{XPBWPolynomial}. \newline Author : Michel Petitot (petitot@lifl.\spad{fr}).
1064016`A linear aggregate is an aggregate whose elements are indexed by integers. Examples of linear aggregates are strings,{} lists,{} and arrays. Most of the exported operations for linear aggregates are non-destructive but are not always efficient for a particular aggregate. For example,{} \spadfun{concat} of two lists needs only to copy its first argument,{} whereas \spadfun{concat} of two arrays needs to copy both arguments. Most of the operations exported here apply to infinite objects (\spadignore{e.g.} streams) as well to finite ones. If the aggregate is a finite aggregate then it has several additional exports such as \spadfun{reverse},{} \spadfun{sort},{} and so on.
1064092`\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}}
1064222`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.
1064294`'Logic' adds 'not' operation to lattices,{} Implements De Morgan\spad{'s} laws.
1064338`Magma is the class of all multiplicative magmas,{} \spadignore{i.e.} sets with a binary operation.
1064382`\indented{1}{MagmaWithUnit 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("*":(\%,{}\%)\spad{->}\%,{}1)\space{3}\tab{30} 1*x=x} \indented{3}{rightIdentity("*":(\%,{}\%)\spad{->}\%,{}1)\space{2}\tab{30} x*1=x} Common Additional Axioms \indented{3}{unitsKnown---if "recip" says "failed",{} that PROVES input wasn\spad{'t} a unit}
1064444`\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 columns returned as objects of type Col. A domain belonging to this category will be shallowly mutable. The index of the 'first' row may be obtained by calling the function \spadfun{minRowIndex}. The index of the 'first' column may be obtained by calling the function \spadfun{minColIndex}. The index of the first element of a Row is the same as the index of the first column in a matrix and vice versa.
1064602`The category for general multi-variate possibly skew polynomials over a ring \spad{R},{} in variables from VarSet,{} with exponents from the \spadtype{OrderedAbelianMonoidSup}.
1064779`The category of modules over a commutative ring. \blankline
1064849`A \spadtype{MonogenicAlgebra} is an algebra of finite rank which can be generated by a single element.
1064981`\spadtype{MultivariateTaylorSeriesCategory} is the most general multivariate Taylor series category.
1065124`NonAssociativeAlgebra is the category of non associative algebras (modules which are themselves non associative rngs). Axioms \indented{3}{\spad{r*}(a*b) = (r*a)\spad{*b} = a*(\spad{r*b})}
1065221`A NonAssociativeRing is a non associative \spad{rng} which has a unit,{} the multiplication is not necessarily commutative or associative.
1065292`NonAssociativeRng is a basic ring-type structure,{} not necessarily commutative or associative,{} and not necessarily with unit. Axioms \indented{2}{\spad{x*}(\spad{y+z}) = x*y + \spad{x*z}} \indented{2}{(x+y)\spad{*z} = \spad{x*z} + \spad{y*z}} Common Additional Axioms \indented{2}{noZeroDivisors\space{2}ab = 0 \spad{=>} \spad{a=0} or \spad{b=0}}
1065360`The category of semirings,{} not necessarily associative,{} not necessarily commutative,{} and not necessarily with a 1.
1065437`OctonionCategory gives the categorial frame for the octonions,{} and eight-dimensional non-associative algebra,{} doubling the quaternions in the same way as doubling the Complex numbers to get the quaternions.
1065523`One-dimensional-array aggregates serves as models for one-dimensional arrays. Categorically,{} these aggregates are finite linear aggregates with the \spadtype{shallowlyMutable} property,{} that is,{} any component of the array may be changed without affecting the identity of the overall array. Array data structures are typically represented by a fixed area in storage and therefore cannot efficiently grow or shrink on demand as can list structures (see however \spadtype{FlexibleArray} for a data structure which is a cross between a list and an array). Iteration over,{} and access to,{} elements of arrays is extremely fast (and often can be optimized to open-code). Insertion and deletion however is generally slow since an entirely new data structure must be created for the result.
1065625`\spadtype{OpenMath} provides operations for exporting an object in OpenMath format.
1065672`Ordered sets which are also rings,{} that is,{} domains where the ring operations are compatible with the ordering. \blankline
1065730`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}. This order should be the natural order on given structure.
1065785`A partial differential ring with differentiations indexed by a parameter type \spad{S}. \blankline
1065885`The class of partially ordered sets,{} that is sets equipped with transitive and reflexive relation \spad{<=}.
1065944`The category for general multi-variate polynomials over a ring \spad{R},{} in variables from VarSet,{} with exponents from the \spadtype{OrderedAbelianMonoidSup}. Here variables commute with the coefficients.
1066103`This is the category of domains that know "enough" about themselves in order to factor univariate polynomials over their fraction field.
1066200`A category for finite subsets of a polynomial ring. Such a set is only regarded as a set of polynomials and not identified to the ideal it generates. So two distinct sets may generate the same the ideal. Furthermore,{} for \spad{R} being an integral domain,{} a set of polynomials may be viewed as a representation of the ideal it generates in the polynomial ring \spad{(R)^(-1) P},{} or the set of its zeros (described for instance by the radical of the previous ideal,{} or a split of the associated affine variety) and so on. So this category provides operations about those different notions.
1066398`holds a complete set together with a structure to codify \indented{2}{the partial order.} \indented{2}{for more documentation see:} \indented{2}{\url{http://www.euclideanspace.com/prog/scratchpad/mycode/discrete/logic/index.\spad{htm}}}
1066461`\spadtype{PowerSeriesCategory} is the most general power series category with exponents in an ordered abelian monoid.
1066616`\spadtype{QuaternionCategory} describes the category of quaternions and implements functions that are not representation specific.
1066711`QuotientField(\spad{S}) is the category of fractions of an Integral Domain \spad{S}.
1066809`The \spad{RadicalCategory} is a model for the rational numbers.
1066874`\spadtype{RealClosedField} provides common access functions for all real closed fields.
1066940`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.
1067004`\spadtype{RealRootCharacterizationCategory} provides common access functions for all real root codings.
1067214`\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.
1067453`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 either empty or a {\em node} consisting of a \spadfun{value} from \spad{S} and 0 or more \spadfun{children} which are also nodes. 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.
1067535`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 \spadfun{sup} operation. When not constant,{} such a polynomial is viewed as a univariate polynomial in its main variable \spad{w}. \spad{r}. \spad{t}. to the total ordering on the elements in the ordered set,{} so that some operations usually defined for univariate polynomials make sense here.
1067684`The category of regular triangular sets,{} introduced under the name regular chains in [1] (and other papers). In [3] it is proved that regular triangular sets and towers of simple extensions of a field are equivalent notions. In the following definitions,{} all polynomials and ideals are taken from the polynomial ring \spad{k[x1,{} ...,{} xn]} where \spad{k} is the fraction field of \spad{R}. The triangular set \spad{[t1,{} ...,{} tm]} is regular iff for every \spad{i} the initial of \spad{ti+1} is invertible in the tower of simple extensions associated with \spad{[t1,{} ...,{} \spad{ti}]}. A family \spad{[T1,{} ...,{} Ts]} of regular triangular sets is a split of Kalkbrener of a given ideal \spad{I} iff the radical of \spad{I} is equal to the intersection of the radical ideals generated by the saturated ideals of the \spad{[T1,{} ...,{} \spad{Ti}]}. A family \spad{[T1,{} ...,{} Ts]} of regular triangular sets is a split of Kalkbrener of a given triangular set \spad{T} iff it is a split of Kalkbrener of the saturated ideal of \spad{T}. Let \spad{K} be an algebraic closure of \spad{k}. Assume that \spad{V} is finite with cardinality \spad{n} and let \spad{A} be the affine space \spad{K^n}. For a regular triangular set \spad{T} let denote by \spad{W(T)} the set of regular zeros of \spad{T}. A family \spad{[T1,{} ...,{} Ts]} of regular triangular sets is a split of Lazard of a given subset \spad{S} of \spad{A} iff the union of the \spad{W(\spad{Ti})} contains \spad{S} and is contained in the closure of \spad{S} (with respect to Zariski topology). A family \spad{[T1,{} ...,{} Ts]} of regular triangular sets is a split of Lazard of a given triangular set \spad{T} if it is a split of Lazard of \spad{W(T)}. Note that if \spad{[T1,{} ...,{} Ts]} is a split of Lazard of \spad{T} then it is also a split of Kalkbrener of \spad{T}. The converse is \spad{false}. This category provides operations related to both kinds of splits,{} the former being related to ideals decomposition whereas the latter deals with varieties decomposition. See the example illustrating the \spadtype{RegularTriangularSet} constructor for more explanations about decompositions by means of regular triangular sets. \newline
1067881`\spad{B} is retractable from A means that some elements in A can be converted into elements of \spad{B} and any element of \spad{B} can be converted into an element of A.
1067959`A is retractable to \spad{B} means that some elements of A can be converted into elements of \spad{B} and any element of \spad{B} can be converted into an element of A.
1068033`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
1068071`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.
1068149`\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{=}}
1068206`PointCategory is the category of points and vectors in space. Points may be used to represent shapes in a scenegraph such as: the vertices of a cube or points along a line. Shapes such as these may be defined explicitly or may be plotted. We implement SetCategory to allow us to curry transforms from one point to another.
1068269`\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 columns returned as objects of type Col.
1068488`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 as power series can be built.
1068564`A string aggregate is a category for strings,{} that is,{} one dimensional arrays of characters.
1068628`A table aggregate is a model of a table,{} \spadignore{i.e.} a discrete many-to-one mapping from keys to entries.
1068731`Category for operations needed by Taylor expansions.
1069008`Category of tensor powers of modules over commutative rings.
1069143`Category for the transcendental elementary functions.
1069239`The category of triangular sets of multivariate polynomials with coefficients in an integral domain. Let \spad{R} be an integral domain and \spad{V} a finite ordered set of variables,{} say \spad{X1 < X2 < ... < Xn}. A set \spad{S} of polynomials in \spad{R[X1,{} X2,{} ...,{} Xn]} is triangular if no elements of \spad{S} lies in \spad{R},{} and if two distinct elements of \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 \spad{P} is reduced with respect to a non-constant polynomial \spad{Q} if the degree of \spad{P} in the main variable of \spad{Q} is less than the main degree of \spad{Q}. A polynomial \spad{P} is reduced with respect to a triangular set \spad{T} if it is reduced with respect to every polynomial of \spad{T}. \newline
1069427`Category for the trigonometric functions.
1069521`\indented{1}{TwoDimensionalArrayCategory is a general array category which} allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and columns returned as objects of type Col. The index of the 'first' row may be obtained by calling the function 'minRowIndex'. The index of the 'first' column may be obtained by calling the function 'minColIndex'. The index of the first element of a 'Row' is the same as the index of the first column in an array and vice versa.
1069703`A unary-recursive aggregate is an aggregate 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. Since these aggregates are recursive aggregates,{} they may be cyclic.
1069795`A constructive unique factorization domain,{} \spadignore{i.e.} where we can constructively factor members into a product of a finite number of irreducible elements.
1069877`\spadtype{UnivariateLaurentSeriesCategory} is the category of Laurent series in one variable.
1069995`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)}.
1070185`The category of univariate polynomials over a ring \spad{R}. No particular model is assumed - implementations can be either sparse or dense.
1070301`\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.
1070454`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)}.
1070645`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} developed by Jean Della Dora and Stephen \spad{M}. Watt.
1070757`\spadtype{UnivariateTaylorSeriesCategory} is the category of Taylor series in one variable.
1070873`\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.
