Search Results for ""

The notation R^_ denotes the set of affinely extended real numbers.

For a subgroup H of a group G, the index of H, denoted (G:H), is the cardinal number of the set of left cosets of H in G (which is equal to the cardinal number of the set of ...

The set E of edges of a loopless graph (V,E), being a set of unordered pairs of elements of V, constitutes an adjacency relation on V. Formally, an adjacency relation is any ...

The axiom of Zermelo-Fraenkel set theory which asserts the existence of a set containing all the natural numbers, exists x(emptyset in x ^ forall y in x(y^' in x)), where ...

Given a set of objects S, a binary relation is a subset of the Cartesian product S tensor S.

Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...

If A is a class of recursively enumerable sets, then the set of Gödel numbers of functions whose domains belong to A is called its index set. If the index set of A is a ...

If {a_0,a_1,...} is a recursive sequence, then the set of all k such that a_k=0 is the union of a finite (possibly empty) set and a finite number (possibly zero) of full ...

Discrepancy is a measure of the deviation of a point set from a uniform distribution. In general, the computation of the discrepancy of a point set is computationally ...

In set theory, a unary operation on set A is a function A->A. More generally, a unary operation is a function with exactly one operand, such as the factorial, square root, or ...