Search Results for ""

A theorem due to Conway et al. (1997) which states that, if a positive definite quadratic form with integer matrix entries represents all natural numbers up to 15, then it ...

The distance d(u,v) between two vertices u and v of a finite graph is the minimum length of the paths connecting them (i.e., the length of a graph geodesic). If no such path ...

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 ...

A square matrix with constant skew diagonals. In other words, a Hankel matrix is a matrix in which the (i,j)th entry depends only on the sum i+j. Such matrices are sometimes ...

The extension of a, an ideal in commutative ring A, in a ring B, is the ideal generated by its image f(a) under a ring homomorphism f. Explicitly, it is any finite sum of the ...

Let sigma_infty(n) be the sum of the infinitary divisors of a number n. An infinitary perfect number is a number n such that sigma_infty(n)=2n. The first few are 6, 60, 90, ...

The sum I over all internal (circular) nodes of the paths from the root of an extended binary tree to each node. For example, in the tree above, the internal path length is ...

A generalization of the Kronecker decomposition theorem which states that every finitely generated Abelian group is isomorphic to the group direct sum of a finite number of ...

Levenberg-Marquardt is a popular alternative to the Gauss-Newton method of finding the minimum of a function F(x) that is a sum of squares of nonlinear functions, ...

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...