Search Results for ""

The smallest statistical rank (either up or down) of a set of data.

The set of rules for manipulating and calculating with tensors.

The unitary group U_n(q) is the set of n×n unitary matrices.

A subgraph G^' of a graph G is a graph G^' whose vertex set and edge set are subsets of those of G. If G^' is a subgraph of G, then G is said to be a supergraph of G^' ...

An open connected set is called a region (sometimes also called a domain).

A relation R on a set S is transitive provided that for all x, y and z in S such that xRy and yRz, we also have xRz.

A set X is said to be nowhere dense if the interior of the set closure of X is the empty set. For example, the Cantor set is nowhere dense. There exist nowhere dense sets of ...

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

A set which contains a nonnegative integral number of elements is said to be finite. A set which is not finite is said to be infinite. A finite or countably infinite set is ...

How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...