Search Results for ""

An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...

Given a pick-7 lottery with 23 numbers that pays a prize to anyone matching at least 4 of the 7 numbers, there is a set of 253 tickets that guarantees a win. This set ...

An extreme point of a subset K of a vector space X is an extreme set S of K which consists of a single point x in K. The collection of all extreme points of K is sometimes ...

A G-space is a special type of T1-Space. Consider a point x and a homeomorphism of an open neighborhood V of x onto an open set of R^n. Then a space is a G-space if, for any ...

Consider a clause (disjunction of literals) obtained from those of a first-order logic formula Phi in Skolemized form forall x_1... forall x_nS. Then an atomic statement ...

If G is a group, then the torsion elements Tor(G) of G (also called the torsion of G) are defined to be the set of elements g in G such that g^n=e for some natural number n, ...

A sequence in which no term divides any other. Let S_n be the set {1,...,n}, then the number of primitive subsets of S_n are 2, 3, 5, 7, 13, 17, 33, 45, 73, 103, 205, 253, ...

Informally, a symplectic map is a map which preserves the sum of areas projected onto the set of (p_i,q_i) planes. It is the generalization of an area-preserving map. ...

Every module over a ring R contains a so-called "zero element" which fulfils the properties suggested by its name with respect to addition, 0+0=0, and with respect to ...

A code is a set of n-tuples of elements ("words") taken from an alphabet. The designation "code n" is also given to the nth totalistic cellular automaton in Wolfram's ...