Search Results for ""
581 - 590 of 2474 for Set PartitionSearch Results

The digraph union of two digraphs is the digraph whose vertex set (respectively, edge set) is the union of their vertex sets (respectively, edge sets). Given a positive ...
The geometric span is largest possible distance between two points drawn from a finite set of points. It is therefore closely related to the generalized diameter of a closed ...
A decomposition of a module into a direct sum of submodules. The index set for the collection of submodules is then called the grading set. Graded modules arise naturally in ...
Let S be a set of n+1 symbols, then a Howell design H(s,2n) on symbol set S is an s×s array H such that 1. Every cell of H is either empty or contains an unordered pair of ...
Let E be a set of expressions representing real, single-valued partially defined functions of one real variable. Let E^* be the set of functions represented by expressions in ...
A link invariant is a function from the set of all links to any other set such that the function does not change as the link is changed (up to isotopy). In other words, a ...
A well-formed formula B is said to be true for the interpretation M (written |=_MB) iff every sequence in Sigma (the set of all denumerable sequences of elements of the ...
A module M is Noetherian if it obeys the ascending chain condition with respect to inclusion, i.e., if every set of increasing sequences of submodules eventually becomes ...
A point x in a manifold M is said to be nonwandering if, for every open neighborhood U of x, it is true that phi^nU intersection U!=emptyset for a map phi for some n>0. In ...
An orthogonal basis of vectors is a set of vectors {x_j} that satisfy x_jx_k=C_(jk)delta_(jk) and x^mux_nu=C_nu^mudelta_nu^mu, where C_(jk), C_nu^mu are constants (not ...

...