Search Results for ""

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 ...

A natural transformation Phi={Phi_C:F(C)->D(C)} between functors F,G:C->D of categories C and D is said to be a natural isomorphism if each of the components is an ...

A group G is nilpotent if the upper central sequence 1=Z_0<=Z_1<=Z_2<=...<=Z_n<=... of the group terminates with Z_n=G for some n. Nilpotent groups have the property that ...

The set of nilpotent elements in a commutative ring is an ideal, and it is called the nilradical. Another equivalent description is that it is the intersection of the prime ...

A positive value of n for which x-phi(x)=n has no solution, where phi(x) is the totient function. The first few are 10, 26, 34, 50, 52, ... (OEIS A005278).