Search Results for ""

The Hamming graph H(d,q), sometimes also denoted q^d, is the graph Cartesian product of d copies of the complete graph K_q. H(d,q) therefore has q^d vertices. H(d,q) has ...

A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...

Matrix diagonalization is the process of taking a square matrix and converting it into a special type of matrix--a so-called diagonal matrix--that shares the same fundamental ...

A curve of constant width constructed by drawing arcs from each polygon vertex of an equilateral triangle between the other two vertices. The Reuleaux triangle has the ...

A matrix, also called a canonical box matrix, having zeros everywhere except along the diagonal and superdiagonal, with each element of the diagonal consisting of a single ...

A square matrix that is not singular, i.e., one that has a matrix inverse. Nonsingular matrices are sometimes also called regular matrices. A square matrix is nonsingular iff ...

An orthonormal set is a set of normalized orthogonal vectors or functions.

The quotient space K^__1A=K_1A/{0,[-1]} of the Whitehead group K_1A is known as the reduced Whitehead group. Here, the element [-1] in K_1A denotes the order-2 element ...

If W is a k-dimensional subspace of a vector space V with inner product <,>, then it is possible to project vectors from V to W. The most familiar projection is when W is the ...

Barycentric coordinates are triples of numbers (t_1,t_2,t_3) corresponding to masses placed at the vertices of a reference triangle DeltaA_1A_2A_3. These masses then ...