This paper is motivated by the problem of subdividing a prismatic mesh to a tetrahedral mesh (without inserting Steiner points) so as to not only match arbitrarily prescribed boundary conditions but also allow arbitrary topologies in the base mesh. We explore all possible combinations of these two factors, and propose a complete solution to this 3D problem by converting it to an equivalent 2D graph problem, called cutting flow problem. For each case, we not only prove the sufficient and necessary condition for the existence of solutions, but also provide linear and provable algorithms to compute a solution whenever there is one.

The Gauss-Bonnet theorem and the Cohn-Vossen inequality show that the only complete surface with positive curvature is either the sphere, RP2, or the plane. In higher dimension, the curvature tensor is far more complicated. There are several commonly used partial components of the curvature tensor that had been studied for the whole century. The simplest one is the scalar curvature which is the average of all curvatures at one point. It appeared in the Hilbert action for general relativity. This was studied extensively in connection with general relativity.

Ricci flow deforms the Riemannian metric proportionally to the curvature, such that the curvature evolves according to a heat diffusion process and eventually becomes constant everywhere. Ricci flow has demonstrated its great potential by solving various problems in many fields, which can be hardly handled by alternative methods so far.

We construct a cohomology theory of transitive digraphs and use it to give a new proof of a theorem of Gerstenhaber and Schack about isomorphism between simplicial cohomology and Hochschild cohomology of a certain algebra associated with the simplicial complex.

We propose a polynomial time computable graph invariant, which comes out directly from a modified version of discrete Greens function on a graph. It is our hope that it can help to construct fast algorithms for the graph isomorphism testing. We explain the physics behind this discrete Greens function, which is a very basic idea applied to graphs.