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.

An inscribed angle in a semicircle is a right angle.

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.

(1) for p in [-1/2,1/2], where delta is the central difference and S_(2n+1) = 1/2(p+n; 2n+1) (2) S_(2n+2) = p/(2n+2)(p+n; 2n+1), (3) with (n; k) a binomial coefficient.

The upper and lower hinges are descriptive statistics of a set of N data values, where N is of the form N=4n+5 with n=0, 1, 2, .... The hinges are obtained by ordering the ...

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