Search Results for ""

A sparse matrix is a matrix that allows special techniques to take advantage of the large number of "background" (commonly zero) elements. The number of zeros a matrix needs ...

If X is any compact space, let A be a subalgebra of the algebra C(X) over the reals R with binary operations + and ×. Then, if A contains the constant functions and separates ...

Term rewriting systems are reduction systems in which rewrite rules apply to terms. Terms are built up from variables and constants using function symbols (or operations). ...

Given 2n-1 numbers a_k, where k=-n+1, ..., -1, 0, 1, ..., n-1, a Toeplitz matrix is a matrix which has constant values along negative-sloping diagonals, i.e., a matrix of the ...

A topological algebra is a pair (A,tau), where A=(A,(f_i^A)_(i in I)) is an algebra and each of the operations f_i^A is continuous in the product topology. Examples of ...

A vector space with a T2-space topology such that the operations of vector addition and scalar multiplication are continuous. The interesting examples are ...

A square matrix with nonzero elements only on the diagonal and slots horizontally or vertically adjacent the diagonal (i.e., along the subdiagonal and superdiagonal), [a_(11) ...

A ring defined on a singleton set {*}. The ring operations (multiplication and addition) are defined in the only possible way, *·*=*, (1) and *+*=*. (2) It follows that this ...

The validity of a logical argument refers to whether or not the conclusion follows logically from the premises, i.e., whether it is possible to deduce the conclusion from the ...

The Chebotarev density theorem is a complicated theorem in algebraic number theory which yields an asymptotic formula for the density of prime ideals of a number field K that ...