Search Results for ""

A problem related to the continuum hypothesis which was solved by Solovay (1970) using the inaccessible cardinals axiom. It has been proven by Shelah and Woodin (1990) that ...

Two totally ordered sets (A,<=) and (B,<=) are order isomorphic iff there is a bijection f from A to B such that for all a_1,a_2 in A, a_1<=a_2 iff f(a_1)<=f(a_2) (Ciesielski ...

An arc-transitive graph, sometimes also called a flag-transitive graph, is a graph whose graph automorphism group acts transitively on its graph arcs (Godsil and Royle 2001, ...

A mathematical structure A is said to be closed under an operation + if, whenever a and b are both elements of A, then so is a+b. A mathematical object taken together with ...

A subset of a topological space which is compact with respect to the relative topology.

A half-space is that portion of an n-dimensional space obtained by removing that part lying on one side of an (n-1)-dimensional hyperplane. For example, half a Euclidean ...

Two partially ordered sets are said to be isomorphic if their "structures" are entirely analogous. Formally, partially ordered sets P=(X,<=) and Q=(X^',<=^') are isomorphic ...

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...

A topological space X has a one-point compactification if and only if it is locally compact. To see a part of this, assume Y is compact, y in Y, X=Y\{y} and x in X. Let C be ...

An n-dimensional open ball of radius r is the collection of points of distance less than r from a fixed point in Euclidean n-space. Explicitly, the open ball with center x ...