Search Results for ""

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

A set of vectors is maximally linearly independent if including any other vector in the vector space would make it linearly dependent (i.e., if any other vector in the space ...

Let V be a variety, and write G(V) for the set of divisors, G_l(V) for the set of divisors linearly equivalent to 0, and G_a(V) for the group of divisors algebraically equal ...

The set of all Schwartz functions is called a Schwartz space and is denoted S(R^n). If C_0^infty(R^n) denotes the set of smooth functions of compact support on R^n, then this ...

Let S be a collection of subsets of a set X, mu:S->[0,infty] a set function, and mu^* the outer measure induced by mu. The measure mu^_ that is the restriction of mu^* to the ...

The kernel of a ring homomorphism f:R-->S is the set of all elements of R which are mapped to zero. It is the kernel of f as a homomorphism of additive groups. It is an ideal ...

A topological space X is locally compact if every point has a neighborhood which is itself contained in a compact set. Many familiar topological spaces are locally compact, ...

Let (A,<=) and (B,<=) be disjoint totally ordered sets with order types alpha and beta. Then the ordinal sum is defined at set (C=A union B,<=) where, if c_1 and c_2 are both ...

A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...

The ascending chain condition, commonly abbreviated "A.C.C.," for a partially ordered set X requires that all increasing sequences in X become eventually constant. A module M ...