Search Results for ""

A square matrix that does not have a matrix inverse. A matrix is singular iff its determinant is 0. For example, there are 10 singular 2×2 (0,1)-matrices: [0 0; 0 0],[0 0; 0 ...

A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...

A Steiner quadruple system is a Steiner system S(t=3,k=4,v), where S is a v-set and B is a collection of k-sets of S such that every t-subset of S is contained in exactly one ...

The most common statement known as Steiner's theorem (Casey 1893, p. 329) states that the Pascal lines of the hexagons 123456, 143652, and 163254 formed by interchanging the ...

A stochastic matrix, also called a probability matrix, probability transition matrix, transition matrix, substitution matrix, or Markov matrix, is matrix used to characterize ...

A subset is a portion of a set. B is a subset of A (written B subset= A) iff every member of B is a member of A. If B is a proper subset of A (i.e., a subset other than the ...

For every even dimension 2n, the symplectic group Sp(2n) is the group of 2n×2n matrices which preserve a nondegenerate antisymmetric bilinear form omega, i.e., a symplectic ...

A temporal point process is a random process whose realizations consist of the times {tau_j}_(j in J) of isolated events. Note that in some literature, the values tau_j are ...

The tetrahedral group T_d is the point group of symmetries of the tetrahedron including the inversion operation. It is one of the 12 non-Abelian groups of order 24. The ...

A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...