Search Results for ""

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

Let s_k be the number of independent vertex sets of cardinality k in a graph G. The polynomial I(x)=sum_(k=0)^(alpha(G))s_kx^k, (1) where alpha(G) is the independence number, ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

The term annihilator is used in several different ways in various aspects of mathematics. It is most commonly used to mean the set of all functions satisfying a given set of ...

A collection B of subsets of a set X forming a topological basis.

Let P=(P,<=) be a partially ordered set, and let x,y,z in P. If x<=y<=z, then y is said to be between x and z. If y is between x and z and y not in {x,z}, then y is strictly ...

A Chu space is a binary relation from a set A to an antiset X which is defined as a set which transforms via converse functions.

A set in R^d is concave if it does not contain all the line segments connecting any pair of its points. If the set does contain all the line segments, it is called convex.