Search Results for ""

Dual pairs of linear programs are in "strong duality" if both are possible. The theorem was first conceived by John von Neumann. The first written proof was an Air Force ...

An orthogonal transformation is a linear transformation T:V->V which preserves a symmetric inner product. In particular, an orthogonal transformation (technically, an ...

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

A linear transformation of period two. Since a linear transformation has the form, lambda^'=(alphalambda+beta)/(gammalambda+delta), (1) applying the transformation a second ...

The finite simple groups of Lie-type. They include four families of linear simple groups: PSL(n,q) (the projective special linear group), PSU(n,q) (the projective special ...

A bounded linear operator T in B(H) on a Hilbert space H is said to be cyclic if there exists some vector v in H for which the set of orbits ...

A search algorithm of a tree that explores the first child of a node before visiting its siblings. Tarjan (1972) and Hopcroft and Tarjan (1973) showed that depth-first search ...

A finitely generated discontinuous group of linear fractional transformations z->(az+b)/(cz+d) acting on a domain in the complex plane. The Apollonian gasket corresponds to a ...

Given a linear code C of length n and dimension k over the field F, a parity check matrix H of C is a n×(n-k) matrix whose rows generate the orthogonal complement of C, i.e., ...

If M^n is a finite simplicial complex of dimension n>=5 that has the homotopy type of the sphere S^n and is locally piecewise linearly homeomorphic to the Euclidean space ...