No abstract uploaded!

In this paper, we first establish an $L^2$-type Dolbeault isomorphism for logarithmic differential forms by H\"{o}rmander's $L^2$-estimates. By using this isomorphism and the construction of smooth Hermitian metrics, we obtain a number of new %Akizuki-Kodaira-Nakano type vanishing theorems for sheaves of logarithmic differential forms on compact K\"ahler manifolds with simple normal crossing divisors, which generalize several classical vanishing theorems, including Norimatsu's vanishing theorem, Gibrau's vanishing theorem, Le Potier's vanishing theorem and a version of the Kawamata-Viehweg vanishing theorem.

We prove that for every non-negative integer g, there exists a bound on the number of ends of a complete, embedded minimal surface M in R3 of genus g and finite topology. This bound on the finite number of ends when M has at least two ends implies that M has finite stability index which is bounded by a constant that only depends on its genus.

We calculate the local Fourier transforms for connections on the formal punctured disk, reproducing the results of J. Fang and C. Sabbah using a different method. Our method is similar to Fang’s, but more direct.

Parameterizations of manifolds are widely applied to the fields of numerical partial differential equations and computer graphics. To this end, in recent years several efficient and reliable numerical algorithms have been developed by different research groups for the computation of triangular and tetrahedral mesh parameterizations. However, it is still challenging when the topology of manifolds is nontrivial, e.g., the 3-manifold of a topological solid torus. In this paper, we propose a novel volumetric stretch energy minimization algorithm for volume-preserving parameterizations of toroidal polyhedra with a single boundary being mapped to a standard torus. In addition, the algorithm can also be used to compute the equiareal mapping between a genus-one closed surface and the standard torus. Numerical experiments indicate that the developed algorithm is effective and performs well on the bijectivity of the mapping. Applications on manifold registrations and partitions are demonstrated to show the robustness of our algorithms.