Search Results for ""

Mastermind is a simple two-player code-breaking board game invented in 1970 by Mordecai Meirowitz, an Israeli postmaster and telecommunications expert. It may have been ...

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...

Let X be a set and S a collection of subsets of X. A set function mu:S->[0,infty] is said to possess finite monotonicity provided that, whenever a set E in S is covered by a ...

A set which transforms via converse functions. Antisets usually arise in the context of Chu spaces.

A function f mapping a set X->X/R (X modulo R), where R is an equivalence relation in X, is called a canonical map.

Each point in the convex hull of a set S in R^n is in the convex combination of n+1 or fewer points of S.

A set X is a called a "convex cone" if for any x,y in X and any scalars a>=0 and b>=0, ax+by in X.

The Burnside problem originated with Burnside (1902), who wrote, "A still undecided point in the theory of discontinuous groups is whether the group order of a group may be ...

Consider the expression 3×7+2^2. This expression has value (3×7)+(2^2)=25 due to what is called operator precedence (or "order of operations"). Precedence of common operators ...

Let S be a collection of subsets of a set X and let mu:S->[0,infty] be a set function. The function mu is called a premeasure provided that mu is finitely additive, countably ...