Search Results for ""

The Knuth-Bendix completion algorithm attempts to transform a finite set of identities into a finitely terminating, confluent term rewriting system whose reductions preserve ...

The ideal generated by a set in a vector space.

A metric space X is boundedly compact if all closed bounded subsets of X are compact. Every boundedly compact metric space is complete. (This is a generalization of the ...

The function given by CK_n(x)=cos(nxcos^(-1)x), where n is an integer and -1<x<1.

A function has compact support if it is zero outside of a compact set. Alternatively, one can say that a function has compact support if its support is a compact set. For ...

Functions which can be expressed in terms of Legendre functions of the first and second kinds. See Abramowitz and Stegun (1972, p. 337). P_(-1/2+ip)(costheta) = (1) = ...

Attractive compounds can be constructed from the cube 3-compounds and their octahedron 3-compound duals. One is illustrated above. This compound will be implemented in a ...

The term in logic used to describe the operation commonly known as OR. A literal is considered a (degenerate) disjunction (Mendelson 1997, p. 30). The Wolfram Language ...

The double bar symbol | is used to denote certain kinds of norms in mathematics (e.g., ||x|| or ||x||_2). It is also used to denote parallel lines, as in A∥B, and in an older ...

A group action phi:G×X->X is called faithful if there are no group elements g (except the identity element) such that gx=x for all x in X. Equivalently, the map phi induces ...