Search Results for ""

The pseudo-tangent cone P_S(x) of a subset S subset R^n at a point x in S is the set P_S(x)=convK_S^_, where K_S is the contingent cone of S and where conv(A) is the smallest ...

A set containing all elements of a smaller set. If B is a subset of A, then A is a superset of B, written A superset= B. If A is a proper superset of B, this is written A ...

The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...

An existential sentence is a statement claiming the existence of an object with given properties. In the language of set theory it can be formulated as follows, exists x in U ...

The Schröder-Bernstein theorem for numbers states that if n<=m<=n, then m=n. For sets, the theorem states that if there are injections of the set A into the set B and of B ...

A proper subset S^' of a set S, denoted S^' subset S, is a subset that is strictly contained in S and so necessarily excludes at least one member of S. The empty set is ...

One of the Zermelo-Fraenkel axioms which asserts the existence for any set a of a set x such that, for any y of a, if there exists a z satisfying A(y,z), then such z exists ...

A Julia set with c=-0.123+0.745i, also known as the dragon fractal.

A Cantor set with Lebesgue measure greater than 0.

The comparability graph of a partially ordered set P=(X,<=) is the graph with vertex set X for which vertices x and y are adjacent iff either x<=y or y<=x in P.