In a graph G, for a subset S of the vertex set, the induced subgraph determined by S has edge set consisting of all edges of G with both endpoints in S. The (edge) boundary, denoted by S consists of all edges containing one endpoint in S and one endpoint not in S.

Simplicial, piecewise-flat discretizations of manifolds provide a clear path towards curvature analysis on discrete geometries and for solutions of PDE's on manifolds of complex topologies. In this manuscript we review and expand on discrete exterior calculus methods using hybrid domains. We then analyze the geometric structure of curvature operators in a piecewise-flat lattice.

No abstract uploaded!

We study how Gromov-Witten invariants of projective 3-folds transform under a standard flop and a small extremal transition in the algebro-geometric setting from the recent development of algebraic relative Gromov-Witten theory and its applications. This gives an algebro-geometric account of Witten's wall-crossing formula for correlation functions of the descendant nonlinear sigma model in adjacent geometric phases of a gauge linear sigma model and of the symplectic approach in an earlier work of An-Min Li and Yongbin Ruan on the same problem. A terse account from the stringy and the symplectic viewpoint is given in the appendix to complement and compare to the discussion in the main text.

Computational conformal geometry focuses on developing the computational methodologies on discrete surfaces to discover conformal geometric invariants. In this work, we briefly summarize the recent developments for methods and related applications in computational conformal geometry. There are two major approaches, holomorphic differentials and curvature flow. The holomorphic differential method is a linear method, which is more efficient and robust to triangulations with lower quality. The curvature flow method is nonlinear and requires higher quality triangulations, but more flexible. The conformal geometric methods have been broadly applied in many engineering fields, such as computer graphics, vision, geometric modeling and medical imaging. The algorithms are robust for surfaces scanned from real life, general for surfaces with different topologies. The efficiency and efficacy of the algorithms