In this paper, we prove the global rigidity of sphere packings on 3-dimensional manifolds. This is a 3-dimensional analogue of the rigidity theorem of Andreev-Thurston and was conjectured by Cooper and Rivin. We also prove a global rigidity result using a combinatorial scalar curvature introduced by Ge and the author.

Computing uniformization maps for surfaces has been a challenging problem and has many practical applications. In this paper, we provide a theoretically rigorous algorithm to compute such maps via combinatorial Calabi flow for vertex scaling of polyhedral metrics on surfaces, which is an analogue of the combinatorial Yamabe flow introduced by Luo (Commun Contemp Math 6(5):765–780, 2004). To handle the singularies along the combinatorial Calabi flow, we do surgery on the flow by flipping. Using the discrete conformal theory established in Gu et al. (J Differ Geom 109(3):431–466, 2018; J Differ Geom 109(2):223–256, 2018), we prove that for any initial Euclidean or hyperbolic polyhedral metric on a closed surface, the combinatorial Calabi flow with surgery exists for all time and converges exponentially fast after finite number of surgeries. The convergence is independent of the combinatorial structure of the initial triangulation on the surface.

Inversive distance circle packing metric was introduced by P Bowers and K Stephenson as a generalization of Thurston’s circle packing metric. They conjectured that the inversive distance circle packings are rigid. For nonnegative inversive distance, Guo proved the infinitesimal rigidity and then Luo proved the global rigidity. In this paper, based on an observation of Zhou, we prove this conjecture for inversive distance in (−1, +∞)by variational principles. We also study the global rigidity of a combinatorial curvature with respect to the inversive distance circle packing metrics where the inversive distance is in (−1, +∞).

In this paper, we demonstrate the existence part of the discrete Orlicz Minkowski problem, which is a non-trivial extension of the discrete Lp Minkowski problem for 0 < p < 1.

No abstract uploaded!