Search Results for ""

The convexity coefficient chi(D) of a region D is the probability that the line segment connecting two random points in D is contained entirely within D. For a convex region, ...

A set A in a first-countable space is dense in B if B=A union L, where L is the set of limit points of A. For example, the rational numbers are dense in the reals. In ...

Let Omega be an open, bounded, and connected subset of R^d for some d and let dx denote d-dimensional Lebesgue measure on R^d. In functional analysis, the Friedrichs ...

Let G be a subgroup of the modular group Gamma. Then an open subset R_G of the upper half-plane H is called a fundamental region of G if 1. No two distinct points of R_G are ...

The generalized diameter is the greatest distance between any two points on the boundary of a closed figure. The diameter of a subset E of a Euclidean space R^n is therefore ...

A group action G×Omega->Omega might preserve a special kind of partition of Omega called a system of blocks. A block is a subset Delta of Omega such that for any group ...

A clause (i.e., a disjunction of literals) is called a Horn clause if it contains at most one positive literal. Horn clauses are usually written as L_1,...,L_n=>L(=¬L_1 v ... ...

A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...

A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a graph is known as the edge cover ...

A minimum vertex cut of a graph is a vertex cut of smallest possible size. A vertex cut set of size 1 in a connected graph corresponds to an articulation vertex. The size of ...