Search Results for ""

A subset {v_1,...,v_k} of a vector space V, with the inner product <,>, is called orthogonal if <v_i,v_j>=0 when i!=j. That is, the vectors are mutually perpendicular. Note ...

The singular support of a generalized function u is the complement of the largest open set on which u is smooth. Roughly speaking, it is the closed set where the distribution ...

An independent edge set (also called a matching) of a graph G is a subset of the edges such that no two edges in the subset share a vertex of G (Skiena 1990, p. 219). The ...

One of the Zermelo-Fraenkel axioms which asserts the existence of the empty set emptyset. The axiom may be stated symbolically as exists x forall y(!y in x).

A connected dominating set in a connected graph G is a dominating set in G whose vertices induce a connected subgraph, i.e., one in which there is no dominating vertex not ...

Set covering deployment (sometimes written "set-covering deployment" and abbreviated SCDP for "set covering deployment problem") seeks an optimal stationing of troops in a ...

A RAT-free ("right angle triangle-free") set is a set of points, no three of which determine a right triangle. Let f(n) be the largest integer such that a RAT-free subset of ...

A union-closed set is a nonempty finite collection of distinct nonempty finite sets which is closed under union.

One of the Zermelo-Fraenkel axioms which asserts the existence for any set a of the power set x consisting of all the subsets of a. The axiom may be stated symbolically as ...

A lattice-ordered set is a poset (L,<=) in which each two-element subset {a,b} has an infimum, denoted inf{a,b}, and a supremum, denoted sup{a,b}. There is a natural ...