Search Results for ""

A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.

A set in a Polish space is a Borel set iff it is both analytic and coanalytic. For subsets of w, a set is delta_1^1 iff it is "hyperarithmetic."

Asserts the existence and uniqueness of the extremal quasiconformal map between two compact Riemann surfaces of the same genus modulo an equivalence relation.

Maps between CW-complexes that induce isomorphisms on all homotopy groups are actually homotopy equivalences.

Let A(n) denote the number of partitions of n into parts =2,5,11 (mod 12), let B(n) denote the number of partitions of n into distinct parts =2,4,5 (mod 6), and let C(n) ...

e is transcendental.

Letting Lk be the linking number of the two components of a ribbon, Tw be the twist, and Wr be the writhe, then Lk(K)=Tw(K)+Wr(K). (Adams 1994, p. 187).

Any one of the eight Apollonius circles of three given circles is tangent to a circle H known as a Hart circle, as are the other three Apollonius circles having (1) like ...

Let P be a primitive polytope with eight vertices. Then there is a unimodular map that maps P to the polyhedron whose vertices are (0, 0, 0), (1, 0, 0), (0, 1, 0), (0, 0, 1), ...

For an algebraic curve, the total number of groups of a g_N^r consisting in a point of multiplicity k_1, one of multiplicity k_2, ..., one of multiplicity k_rho, where sumk_i ...