Search Results for ""

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

The number of ways of partitioning a set of n elements into m nonempty sets (i.e., m set blocks), also called a Stirling set number. For example, the set {1,2,3} can be ...

A subset is a portion of a set. B is a subset of A (written B subset= A) iff every member of B is a member of A. If B is a proper subset of A (i.e., a subset other than the ...

A distance graph with distance set (0,1].

An extension field F subset= K is called finite if the dimension of K as a vector space over F (the so-called degree of K over F) is finite. A finite field extension is ...

Suppose that V={(x_1,x_2,x_3)} and W={(x_1,0,0)}. Then the quotient space V/W (read as "V mod W") is isomorphic to {(x_2,x_3)}=R^2. In general, when W is a subspace of a ...

A mathematical object (such as a set or function) is said to bounded if it possesses a bound, i.e., a value which all members of the set, functions, etc., are less than.

The cardinal number of any set is lower than the cardinal number of the set of all its subsets. A corollary is that there is no highest aleph (aleph).

A set U has compact closure if its set closure is compact. Typically, compact closure is equivalent to the condition that U is bounded.

A set R of linear extensions of a partially ordered set P=(X,<=) is a realizer of P (and is said to realize P) provided that for all x,y in X, x<=y iff x is below y in every ...