Search Results for ""

To enumerate a set of objects satisfying some set of properties means to explicitly produce a listing of all such objects. The problem of determining or counting all such ...

A hyperstring is a simple semi-Hamiltonian acyclic digraph (V,E) with a labeling of the edges in E such that, for all vertices i,j,p,q in V, either pi(i,j)=pi(p,q) or pi(i,j) ...

Let P be a finite partially ordered set, then an antichain in P is a set of pairwise incomparable elements. Antichains are also called Sperner systems in older literature ...

The word "rank" refers to several related concepts in mathematics involving graphs, groups, matrices, quadratic forms, sequences, set theory, statistics, and tensors. In ...

A partially ordered set (or ordered set or poset for short) (L,<=) is called a complete lattice if every subset M of L has a least upper bound (supremum, supM) and a greatest ...

Let R be a ring, and let I be an ideal of R. The correspondence A<->A/I is an inclusion preserving bijection between the set of subrings A of R that contain I and the set of ...

A computation is an operation that begins with some initial conditions and gives an output which follows from a definite set of rules. The most common example are ...

A d-dimensional framework is a pair (G,p) where G=(V,E) is a graph with vertex set V and edge set E and p:V->R^d is a map that assigns a point in R^d to each vertex of G. The ...

A vertex cut, also called a vertex cut set or separating set (West 2000, p. 148), of a connected graph G is a subset of the vertex set S subset= V(G) such that G-S has more ...

If sets E and F are independent, then so are E and F^', where F^' is the complement of F (i.e., the set of all possible outcomes not contained in F). Let union denote "or" ...