Search Results for ""

A limb of a tree at a vertex v is the union of one or more branches at v in the tree. v is then called the base of the limb.

Two or more functions, equations, or vectors f_1, f_2, ..., which are not linearly dependent, i.e., cannot be expressed in the form a_1f_1+a_2f_2+...+a_nf_n=0 with a_1, a_2, ...

A simplicial complex K is said to be locally finite if each vertex of K belongs only to finitely many simplices of K.

It is conjectured that every tree with e edges whose nodes are all trivalent or monovalent can be given a "magic" labeling such that the integers 1, 2, ..., e can be assigned ...

Every point which can be constructed with a straightedge and compass, and no other points, can be constructed using identical matchsticks (i.e., identical movable line ...

Matrix decomposition refers to the transformation of a given matrix (often assumed to be a square matrix) into a given canonical form.

A group in which the elements are square matrices, the group multiplication law is matrix multiplication, and the group inverse is simply the matrix inverse. Every matrix ...

A polynomial with matrix coefficients. An nth order matrix polynomial in a variable t is given by P(t)=A_0+A_1t+A_2t^2+...+A_nt^n, where A_k are p×p square matrices.

The power A^n of a matrix A for n a nonnegative integer is defined as the matrix product of n copies of A, A^n=A...A_()_(n). A matrix to the zeroth power is defined to be the ...

The dual of the snub dodecadodecahedron U_(40) and Wenninger dual W_(111).