Search Results for ""

A minimum vertex cover is a vertex cover having the smallest possible number of vertices for a given graph. The size of a minimum vertex cover of a graph G is known as the ...

Minkowski space is a four-dimensional space possessing a Minkowski metric, i.e., a metric tensor having the form dtau^2=-(dx^0)^2+(dx^1)^2+(dx^2)^2+(dx^3)^2. Alternatively ...

Let A be an involutive algebra over the field C of complex numbers with involution xi|->xi^♯. Then A is a modular Hilbert algebra if A has an inner product <··> and a ...

A module is a mathematical object in which things can be added together commutatively by multiplying coefficients and in which most of the rules of manipulating vectors hold. ...

The multicomputational paradigm is a generalization of the computational paradigm to many computational threads of time. In the ordinary computational paradigm, time ...

A nonnegative matrix is a real or integer matrix (a)_(ij) for which each matrix element is a nonnegative number, i.e., a_(ij)>=0 for all i, j. Nonnegative matrices are ...

A nut graph is a graph on n>=2 vertices with adjacency matrix A such that A has matrix rank 1 and contains no 0 element (Sciriha 1998, 2008; Sciriha and Gutman, 1998; and ...

A n×n matrix A is an orthogonal matrix if AA^(T)=I, (1) where A^(T) is the transpose of A and I is the identity matrix. In particular, an orthogonal matrix is always ...

The Pauli matrices, also called the Pauli spin matrices, are complex matrices that arise in Pauli's treatment of spin in quantum mechanics. They are defined by sigma_1 = ...

There are at least 15 classes of convex pentagonal tilings, as illustrated above. The first five were discovered during investigations of German mathematician Karl Reinhardt ...