No abstract uploaded!

In this paper we start the classification of strongly bracket-generated sub-symmetric spaces. We prove a structure theorem and analyze the nilpotent case.

We explain how Polchinski's work on D-branes re-read from a noncommutative version of Grothendieck's equivalence of local geometries and function rings gives rise to an intrinsic prototype definition of D-branes (of B-type) as an Azumaya-type noncommutative space. Several originally open-string induced properties of D-branes can be reproduced solely by this intrinsic definition. We study also the moduli space of D0-branes on a commutative target space in this setup. Some of its features resembles gas of D0-branes in Vafa's work.

Surface segmentation is a fundamental problem in computer graphics. It has various applications such as metamorphosis, surface matching, surface compression, 3D shape retrieval, texture mapping, etc. All orientable surfaces are Riemann surfaces, and admit conformal structures. This paper introduces a novel surface segmentation algorithm based on its conformal structure. Each segment can be conformally mapped to a planar rectangle, and the transition maps are planar translations. The segmentation is intrinsic to the surface, independent of the embedding, and consistent for surfaces with similar geometries. By using segmentation based on conformal structure, the mapping between surfaces with arbitrary topologies can be constructed explicitly. The method is rigorous, efficient and automatic. The segmentation can be applied to surface morphing, construct conformal geometry image, convert mesh to Spline

In this paper, we apply semi-Lagrangian discontinuous Galerkin (SLDG) methods for linear hyperbolic equations in one space dimension and analyze the error between the numerical and exact solutions under the L2-norm. In all the previous works, the theoretical analysis of the SLDG method would suggest a suboptimal convergence rate due to the error accumulation over time steps. However, numerical experiments demonstrate an optimal convergence rate and, if the terminal time is large, a superconvergence rate. In this paper, we will prove optimal convergence and optimal superconvergence rates. There are three main difficulties: 1. The error analysis on overlapping meshes. Due to the nature of the semi-Lagrangian time discretization, we need to introduce the background Eulerian mesh and the shifted mesh. The two meshes are staggered, and it is not easy to construct local projections and to handle the error accumulation during time evolution. 2. The superconvergence of time dependent terms under the L2-norm. The error of the numerical and exact solutions can be divided into two parts, the projection error and the time dependent superconvergence term. The projection strongly depends on the superconvergence rates. Therefore, we need to construct a sequence of projections and improve the superconvergence rates gradually. 3. The stopping criterion of the sequence of projections. The sequence of projections are basically of the same form. We need to show that the projections exist up to some certain order since the superconvergence rate cannot be innity. Hence, we will seek some \hidden" condition for the existence of the projections. In this paper, we will solve all the three difficulties and construct several local projections to prove the optimal convergence and superconvergence rates. Numerical experiments verify the theoretical ndings.