In the description of isolated gravitating systems in General Relativity a spacelike timeslice has the structure of a complete Riemannian three-manifold with an asymptotically at end. Let (N; g) denote an end of such a complete Riemannian three-manifold, ie N is diffeomorphic to R3\B1 (0), and the metric on N asymptotically approaches the Euclidean metric near infinity: gij=

We describe the counting of BPS states of Type II on K3 by relating the supersymmetric cycles of genus <i>g</i> to the number of rational curves with <i>g</i> double points on K3. The generating function for the number of such curves is the left-moving partition function of the bosonic string.

When enough matter is condensed in a small region, gravitational effects will be strong enough to cause collapse and a black hole will be formed. We formulate and prove here such a statement in the language of general relativity. (This is Theorem 2 of this paper.)

Let M be a compact Criemannian manifold of nonpositive curvature1 and with fundamental group . It is well known [8, p. 102] that M is a K (, 1) and thus completely determined up to homotopy type by . In light of this fact it is natural to ask to what extent the riemannian structure of M is determined by the structure of , and the intent of this paper is to demonstrate that rather strong implications of this sort exist. In the case that M has strictly negative curvature, the group is known to be highly noncommutative. Every abelian, in fact, every solvable, subgroup of is cyclic [3]. It is therefore a plausible conjecture that in the nonpositive curvature case, will possess large amounts of commutativity only under special geometric circumstances. We shall show that this is true, that indeed those properties of which involve commutativity have a dramatic reflection in the riemannian structure of M.

A multilevel quality-guided phase unwrapping algorithm for real-time 3D shape measurement is presented. The quality map is generated from the gradient of the phase map. Multilevel thresholds are used to unwrap the phase level by level. Within the data points in each level, a fast scan-line algorithm is employed. The processing time of this algorithm is approximately 18.3 ms for an image size of 640480 pixels in an ordinary computer. We demonstrate that this algorithm can be implemented into our real-time 3D shape measurement system for real-time 3D reconstruction. Experiments show that this algorithm improves the previous scan-line phase unwrapping algorithm significantly although it reduces its processing speed slightly.