A simplicial complex Δ is called$flag$if all minimal nonfaces of Δ have at most two elements. The following are proved: First, if Δ is a flag simplicial pseudomanifold of dimension$d$−1, then the graph of Δ (i) is (2$d$−2)-vertex-connected and (ii) has a subgraph which is a subdivision of the graph of the$d$-dimensional cross-polytope. Second, the$h$-vector of a flag simplicial homology sphere Δ of dimension$d$−1 is minimized when Δ is the boundary complex of the$d$-dimensional cross-polytope.

This paper investigates infinite-time spreading and finite-time blow-up for the Keller-Segel system. For 0 < m ≤ 2 − 2 / d, the L p space for both dynamic and steady solutions are detected with ${p:=\frac{d(2-m)}{2} }$ . Firstly, the global existence of the weak solution is proved for small initial data in L p . Moreover, when m > 1 − 2 / d, the weak solution preserves mass and satisfies the hyper-contractive estimates in L q for any p < q < ∞. Furthermore, for slow diffusion 1 < m ≤ 2 − 2/d, this weak solution is also a weak entropy solution which blows up at finite time provided by the initial negative free energy. For m > 2 − 2/d, the hyper-contractive estimates are also obtained. Finally, we focus on the L p norm of the steady solutions, it is shown that the energy critical exponent m = 2d/(d + 2) is the critical exponent separating finite L p norm and infinite L p norm for the steady state solutions.

In this follow-up work, we extend the discontinuous Galerkin (DG) methods previously developed on rectangular meshes \cite{previous} to triangular meshes. The DG schemes in \cite{previous} are both optimally convergent and energy conserving. However, as we shall see in the numerical results section, the DG schemes on triangular meshes only have suboptimal convergence rate. We prove the energy conservation and an error estimate for the semi-discrete schemes. The stability of the fully discrete scheme is proved and its error estimate is stated. We present extensive numerical results with convergence consistent of our error estimate, and simulations of wave propagation in Drude metamaterials to demonstrate the flexibility of triangular meshes.

We propose a novel framework for reconstructing lightweight polygonal surfaces from point clouds. Unlike traditional methods that focus on either extracting good geometric primitives or obtaining proper arrangements of primitives, the emphasis of this work lies in intersecting the primitives (planes only) and seeking for an appropriate combination of them to obtain a manifold polygonal surface model without boundary. We show that reconstruction from point clouds can be cast as a binary labeling problem. Our method is based on a hypothesizing and selection strategy. We first generate a reasonably large set of face candidates by intersecting the extracted planar primitives. Then an optimal subset of the candidate faces is selected through optimization. Our optimization is based on a binary linear programming formulation under hard constraints that enforce the final polygonal surface model to be manifold and watertight. Experiments on point clouds from various sources demonstrate that our method can generate lightweight polygonal surface models of arbitrary piecewise planar objects. Besides, our method is capable of recovering sharp features and is robust to noise, outliers, and missing data.

We have developed a mathematical theory of the topological vertexa theory that was originally proposed by M Aganagic, A Klemm, M Mario and C Vafa on effectively computing GromovWitten invariants of smooth toric CalabiYau threefolds derived from duality between open string theory of smooth CalabiYau threefolds and ChernSimons theory on three-manifolds.