Search Results for ""

A set containing all elements of a smaller set. If B is a subset of A, then A is a superset of B, written A superset= B. If A is a proper superset of B, this is written A ...

A syllogism, also known as a rule of inference, is a formal logical scheme used to draw a conclusion from a set of premises. An example of a syllogism is modus ponens.

A symmetric design is a block design (v, k, lambda, r, b) with the same number of blocks as points, so b=v (or, equivalently, r=k). An example of a symmetric block design is ...

A map T:(M_1,omega_1)->(M_2,omega_2) between the symplectic manifolds (M_1,omega_1) and (M_2,omega_2) which is a diffeomorphism and T^*(omega_2)=omega_1, where T^* is the ...

X fulfils the T1-separation axiom and is regular. A space satisfying the T_3-separation axiom is said to be a T3-space.

A topological space fulfilling the T_4-axiom: X fulfils the T1-separation axiom and is normal. In the terminology of Alexandroff and Hopf (1972), T_4-space are called Tietze ...

A number of attractive 26-compounds of the regular tetrahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...

In an exterior algebra ^ V, a top-dimensional form has degree n where n=dimV. Any form of higher degree must be zero. For example, if V=R^4 then alpha=e_1 ^ e_2 ^ e_3 ^ e_4 ...

The topological entropy of a map M is defined as h_T(M)=sup_({W_i})h(M,{W_i}), where {W_i} is a partition of a bounded region W containing a probability measure which is ...

A topological sort is a permutation p of the vertices of a graph such that an edge {i,j} implies that i appears before j in p (Skiena 1990, p. 208). Only acyclic digraphs can ...