Search Results for ""

Integer programming in a special case of linear programming in which all variables are required to take on integer values only. Set covering deployment is an example ...

An algorithm in control theory introduced by Kalman (1960) and refined by Kalman and Bucy (1961). It is an algorithm which makes optimal use of imprecise data on a linear (or ...

There are a couple of versions of this theorem. Basically, it says that any bounded linear functional T on the space of compactly supported continuous functions on X is the ...

Every finite-dimensional Lie algebra of characteristic p=0 has a faithful finite-dimensional representation.

An operator Gamma=sum_(i=1)^me_i^Ru^(iR) on a representation R of a Lie algebra.

Every finite-dimensional Lie algebra of characteristic p!=0 has a faithful finite-dimensional representation.

If A is a normed algebra, a net {e_i} in A is called an approximate identity for A if sup_(i)|e_i|<infty and if for each a in A, e_ia->a and ae_i->a. Though this definition ...

The identity (xy)x^2=x(yx^2) satisfied by elements x and y in a Jordan algebra.

The Golay code is a perfect linear error-correcting code. There are two essentially distinct versions of the Golay code: a binary version and a ternary version. The binary ...

The conjecture that the equations for a Robbins algebra, commutativity, associativity, and the Robbins axiom !(!(x v y) v !(x v !y))=x, where !x denotes NOT and x v y denotes ...