Let M be a compact Riemannian manifold, π : \tilde{M} → M be the universal covering and ω be a smooth 2-form on M with π^∗ω cohomologous to zero. Suppose the fundamental group π_1(M) satisfies certain radial quadratic (resp. linear) isoperimetric inequality, we show that there exists a smooth 1-form η on \tilde{M} of linear (resp. bounded) growth such that π^∗ω = dη. As applications, we prove that on a compact Kahler manifold (M,ω) with π^∗ω cohomologous to zero, if π_1(M) is CAT(0) or automatic (resp. hyperbolic), then M is Kahler non-elliptic (resp. Kahler hyperbolic) and the Euler characteristic (−1)^{dim_RM/2χ(M) ≥ 0 (resp. >0).

In this paper, we prove the uniqueness of topological multivortex solutions for the self-dual Maxwell–Chern–Simons U(1)U(1) model if the Chern–Simons coupling parameter is sufficiently large and the charge of electron is sufficiently small or large. On the other hand, we also establish the sharp region of the flux for non-topological solutions and provide the classification of radial solutions of all types in the case of one vortex point.

No abstract uploaded!

No abstract uploaded!

Surface parameterizations have been widely applied to digital geometry processing. In this paper, we propose an efficient conformal energy minimization (CEM) algorithm for computing conformal parameterizations of simply-connected open surfaces with a very small angular distortion and a highly improved computational efficiency. In addition, we generalize the proposed CEM algorithm to computing conformal parameterizations of multiply-connected surfaces. Furthermore, we prove the existence of a nontrivial accumulation point of the proposed CEM algorithm under some mild conditions. Several numerical results show the efficiency and robustness of the CEM algorithm comparing to the existing state-of-the-art algorithms. An application of the CEM on the surface morphing between simply-connected open surfaces is demonstrated thereafter. Thanks to the CEM algorithm, the whole computations for the surface morphing can be performed efficiently and robustly.