Three-fold quasi-homogeneous isolated rational singularity is argued to define a four dimensional N = 2 SCFT. The SeibergWitten geometry is built on the mini-versal deformation of the singularity. We argue in this paper that the corresponding SeibergWitten differential is given by the GelfandLeray form of K. Saitos primitive form. Our result also extends the SeibergWitten solution to include irrelevant deformations.

We investigate the structure of the higher genus topological string amplitudes on the quintic hypersurface. It is shown that the partition functions of the higher genus than one can be expressed as polynomials of five generators. We also compute the explicit polynomial forms of the partition functions for genus 2, 3, and 4. Moreover, some coefficients are written down for all genus.

We consider a class of two-dimensional Schrdinger operator with a singular interaction of the type and a fixed strength supported by an infinite family of concentric, equidistantly spaced circles, and discuss what happens below the essential spectrum when the system is amended by an AharonovBohm flux in the center. It is shown that if , there is a critical value such that the discrete spectrum has an accumulation point when , while for the number of eigenvalues is at most finite, in particular, the discrete spectrum is empty for any fixed and small enough.

We find two conditions related to the {\it news functions} of the Bondi's radiating vacuum spacetimes. We provide a complete proof of the positivity of the Bondi mass by using Schoen-Yau's method under one condition and by using Witten's method under another condition.

Alexandrov proved that any simplicial complex homeomorphic to a sphere with strictly non-negative Gaussian curvature at each vertex can be isometrically embedded uniquely in {{\mathbb {R}}}^{3} as a convex polyhedron. Due to the nonconstructive nature of his proof, there have yet to be any algorithms, that we know of, that realizes the Alexandrov embedding in polynomial time. Following his proof, we developed the adiabatic isometric mapping (AIM) algorithm. AIM uses a guided adiabatic pull-back procedure on a given polyhedral metric to produce an embedding that approximates the unique Alexandrov polyhedron. Tests of AIM applied to two different polyhedral metrics suggests that its run time is sub cubic with respect to the number of vertices. Although Alexandrov's theorem specifically addresses the embedding of convex polyhedral metrics, we tested AIM on a broader class of polyhedral metrics that included regions of