Search Results for ""

Let X be an infinite set of urelements, and let V(^*X) be an enlargement of the superstructure V(X). Let A,B in V(X) be finitary algebras with finitely many operations, and ...

If f is continuous on a closed interval [a,b], and c is any number between f(a) and f(b) inclusive, then there is at least one number x in the closed interval such that ...

A vector field X on a compact foliated manifold (M,F) is nice if X is transverse to F and if X has a closed orbit C (called a nice orbit) such that the intersection C ...

An equilibrium point in game theory is a set of strategies {x^^_1,...,x^^_n} such that the ith payoff function K_i(x) is larger or equal for any other ith strategy, i.e., ...

A simple function is a finite sum sum_(i)a_ichi_(A_i), where the functions chi_(A_i) are characteristic functions on a set A. Another description of a simple function is a ...

The discrete uniform distribution is also known as the "equally likely outcomes" distribution. Letting a set S have N elements, each of them having the same probability, then ...

The problem in computational geometry of identifying the point from a set of points which is nearest to a given point according to some measure of distance. The nearest ...

Parametric equations are a set of equations that express a set of quantities as explicit functions of a number of independent variables, known as "parameters." For example, ...

In a normal n×n Latin square, the entries in each row and column are chosen from a "global" set of n objects. Like a Latin square, a partial Latin square has no two rows or ...

The weighted mean of a discrete set of numbers {x_1,x_2,...,x_n} with weights {w_1,w_2,...,w_n} is given by <x>=sum_(i=1)^nw_ix_i, (1) where each weight w_i is a nonnegative ...