In [$Rong$, F., Quasi-parabolic analytic transformations of$C$^{$n$},$J. Math. Anal. Appl.$$343$(2008), 99–109], we showed the existence of “parabolic curves” for certain quasi-parabolic analytic transformations of$C$^{$n$}. Under some extra assumptions, we show the existence of “parabolic manifolds” for such transformations.

Delaunay meshes (DM) are a special type of manifold triangle meshes --- where the local Delaunay condition holds everywhere --- and find important applications in digital geometry processing. This paper addresses the \yongjin{general} DM simplification problem: given an arbitrary manifold triangle mesh M with n vertices and the user-specified resolution m(< n), compute a Delaunay mesh M* with m vertices that has the least Hausdorff distance to M. To solve the problem, we abstract the simplification process using a 2D Cartesian grid model, in which each grid point corresponds to triangle meshes with a certain number of vertices and a simplification process is a monotonic path on the grid. We develop a novel differential-evolution-based method to compute a low-cost path, which leads to a high quality Delaunay mesh. Extensive evaluation shows that our method consistently outperforms the existing methods in terms of approximation error. In particular, our method is highly effective for small-scale CAD models and man-made objects with sharp features but less details. Moreover, our method is fully automatic and can preserve sharp features well and deal with models with multiple components, whereas the existing methods often fail.

We propose a generalized multiscale finite element method (GMsFEM) based on clustering algorithm to study the elliptic PDEs with random coefficients in the multi-query setting. Our method consists of offline and online stages. In the offline stage, we construct a small number of reduced basis functions within each coarse grid block, which can then be used to approximate the multiscale finite element basis functions. In addition, we coarsen the corresponding random space through a clustering algorithm. In the online stage, we can obtain the multiscale finite element basis very efficiently on a coarse grid by using the pre-computed multiscale basis. The new GMsFEM can be applied to multiscale SPDE starting with a relatively coarse grid, without requiring the coarsest grid to resolve the smallest-scale of the solution. The new method offers considerable savings in solving multiscale SPDEs. Numerical results are

Let g be the Witt algebra or the positive Witt algebra. It is well known that the enveloping algebra U(g) has intermediate growth and thus infinite Gelfand–Kirillov (GK-) dimension. We prove that the GK-dimension of U(g) is just infinite in the sense that any proper quotient of U(g) has polynomial growth. This proves a conjecture of Petukhov and the second named author for the positive Witt algebra. We also establish the corresponding results for quotients of the symmetric algebra S(g) by proper Poisson ideals. In fact, we prove more generally that any central quotient of the universal enveloping algebra of the Virasoro algebra has just infinite GK-dimension. We give several applications. In particular, we easily compute the annihilators of Verma modules over the Virasoro algebra.

We view regularized learning of a function in a Banach space from its finite samples as an optimization problem. Within the framework of reproducing kernel Banach spaces, we prove the representer theorem for the minimizer of regularized learning schemes with a general loss function and a nondecreasing regularizer. When the loss function and the regularizer are differentiable, a characterization equation for the minimizer is also established.