Search Results for ""

Given a square complex or real matrix A, a matrix norm ||A|| is a nonnegative number associated with A having the properties 1. ||A||>0 when A!=0 and ||A||=0 iff A=0, 2. ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...

Minkowski's conjecture states that every lattice tiling of R^n by unit hypercubes contains two hypercubes that meet in an (n-1)-dimensional face. Minkowski first considered ...

A monomial is a product of positive integer powers of a fixed set of variables (possibly) together with a coefficient, e.g., x, 3xy^2, or -2x^2y^3z. A monomial can also be ...

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

By asking a small number of innocent-sounding questions about an unknown number, it is possible to reconstruct the number with absolute certainty (assuming that the questions ...

A permutation group is a finite group G whose elements are permutations of a given set and whose group operation is composition of permutations in G. Permutation groups have ...

A set of ascending sequences in a permutation is called a run (Graham et al. 1994) or sometimes a rise (Comtet 1974, p. 241). A sorted permutation consists of a single run, ...