Search Results for ""

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

A number puzzle in which a group of arithmetical operations has some or all of its digits replaced by letters or symbols, and where the original digits must be found. In such ...

A branch of game theory dealing with strategies to maximize the outcome of a given process in the face of uncertain conditions.

A diminished polyhedron is a polyhedron in which one or more groups of associated faces (such as those comprising the top of a pyramid or cupola in the case of a Johnson ...

An n×n matrix A is an elementary matrix if it differs from the n×n identity I_n by a single elementary row or column operation.

A number which can be specified implicitly or explicitly by exponential, logarithmic, and algebraic operations.

One of the operations of addition, subtraction, multiplication, division, and integer (or rational) root extraction.

A member of the smallest algebraically closed subfield L of C which is closed under the exponentiation and logarithm operations.

Let p be prime and r = r_mp^m+...+r_1p+r_0 (0<=r_i<p) (1) k = k_mp^m+...+k_1p+k_0 (0<=k_i<p), (2) then (r; k)=product_(i=0)^m(r_i; k_i) (mod p). (3) This is proved in Fine ...

Let pi be a unitary representation of a group G on a separable Hilbert space, and let R(pi) be the smallest weakly closed algebra of bounded linear operators containing all ...