Search Results for ""

A method for finding solutions u and v to a linear congruence au+bv=d by constructing a matrix formed by adjoining a vector containing a and b with a unit matrix, M=[a 1 0; b ...

The eigenvalues of a graph are defined as the eigenvalues of its adjacency matrix. The set of eigenvalues of a graph is called a graph spectrum. The largest eigenvalue ...

An (m+1)-dimensional subspace W of an (n+1)-dimensional vector space V can be specified by an (m+1)×(n+1) matrix whose rows are the coordinates of a basis of W. The set of ...

The Epstein zeta function for a n×n matrix S of a positive definite real quadratic form and rho a complex variable with R[rho]>n/2 (where R[z] denotes the real part) is ...

A dodecagon is a 12-sided polygon. Several special types of dodecagons are illustrated above. In particular, a dodecagon with vertices equally spaced around a circle and with ...

A binary tree in which special nodes are added wherever a null subtree was present in the original tree so that each node in the original tree (except the root node) has ...

An imaginary quadratic field is a quadratic field Q(sqrt(D)) with D<0. Special cases are summarized in the following table. D field members -1 Gaussian integer -3 Eisenstein ...

A quantity by which another (the multiplicand) is multiplied. For example, in the expression a×b, a is the multiplier. The result of the multiplication of two or more ...

In the plane, if a line intersects one side of a triangle and misses the three vertices, then it must intersect one of the other two sides. This is a special case of the ...

A weighted graph is a graph in which each branch is given a numerical weight. A weighted graph is therefore a special type of labeled graph in which the labels are numbers ...