Search Results for ""

A set having the largest number k of distinct residue classes modulo m so that no subset has zero sum.

The maximum flow between vertices v_i and v_j in a graph G is exactly the weight of the smallest set of edges to disconnect G with v_i and v_j in different components (Ford ...

A method used by Gauss to solve the quadratic Diophantine equation of the form mx^2+ny^2=A (Dickson 2005, pp. 391 and 407).

The minimum excluded value. The mex of a set S of nonnegative integers is the least nonnegative integer not in the set.

A sequence defined from a finite sequence a_0, a_1, ..., a_n by defining a_(n+1)=mex_(i)(a_i+a_(n-i)), where mex is the mex (minimum excluded value).

Given a collection of sets, a member set that is not a proper subset of another member set is called a minimal set. Minimal sets are important in graph theory, since many ...

A morphism f:Y->X in a category is a monomorphism if, for any two morphisms u,v:Z->Y, fu=fv implies that u=v. In the categories of sets, groups, modules, etc., a monomorphism ...

A quantity by which another (the multiplicand) is multiplied. For example, in the expression a×b, a is the multiplier. The result of the multiplication of two or more ...

The mutual information between two discrete random variables X and Y is defined to be I(X;Y)=sum_(x in X)sum_(y in Y)P(x,y)log_2((P(x,y))/(P(x)P(y))) (1) bits. Additional ...

A theorem in game theory which guarantees the existence of a set of mixed strategies for finite, noncooperative games of two or more players in which no player can improve ...