Search Results for ""

A projection matrix P is an n×n square matrix that gives a vector space projection from R^n to a subspace W. The columns of P are the projections of the standard basis ...

A finite group is a group having finite group order. Examples of finite groups are the modulo multiplication groups, point groups, cyclic groups, dihedral groups, symmetric ...

For operators A^~ and B^~, the anticommutator is defined by {A^~,B^~}=A^~B^~+B^~A^~.

A convolution is an integral that expresses the amount of overlap of one function g as it is shifted over another function f. It therefore "blends" one function with another. ...

A square matrix U is a unitary matrix if U^(H)=U^(-1), (1) where U^(H) denotes the conjugate transpose and U^(-1) is the matrix inverse. For example, A=[2^(-1/2) 2^(-1/2) 0; ...

A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.

A Ramsey number of the form R(k,k;2).

Edge splitting is the reverse of edge contraction.

An elegant algorithm for constructing an Eulerian cycle (Skiena 1990, p. 193).

The problem of deciding if four colors are sufficient to color any map on a plane or sphere.