Search Results for ""

For every ergodic flow on a nonatomic probability space, there is a measurable set intersecting almost every orbit in a discrete set.

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

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 lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...

A set of maximum degree to which all other degrees of recursively enumerable sets can be many-one reduced. If set A is many-one complete, then it is one-one complete, and ...

A set of maximum degree to which all other degrees of recursively enumerable sets can be one-one reduced. If set A is many-one complete, then it is one-one complete, and vice ...

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

A set of statistical distributions having different variances.

An attracting set to which orbits or trajectories converge and upon which trajectories are periodic.

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