The study of this paper consists of two aspects. One is characterizing the so-called circular cone convexity of f by exploiting the second-order differentiability of f L ; the other is introducing the concepts of determinant and trace associated with circular cone and establishing their basic inequalities. These results show the essential role played by the angle , which gives us a new insight when looking into properties about circular cone. MSC:26A27, 26B05, 26B35, 49J52, 90C33, 65K05.

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.

A first step towards a dual Orlicz-Brunn-Minkowski theory for star sets was taken by Zhu, Zhou, and Xue \cite{ZZ, ZZX}. In this essentially independent work we provide a more general framework and results. A radial Orlicz addition of two or more star sets is proposed and a corresponding dual Orlicz-Brunn-Minkowski inequality is established. Based on a radial Orlicz linear combination of two star sets, a formula for the dual Orlicz mixed volume is derived and a corresponding dual Orlicz-Minkowski inequality proved. The inequalities proved yield as special cases the precise duals of the conjectured log-Brunn-Minkowski and log-Minkowski inequalities of B\"{o}r\"{o}czky, Lutwak, Yang, and Zhang. A new addition of star sets called radial $M$-addition is also introduced and shown to relate to the radial Orlicz addition.

No abstract uploaded!

We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al.[3] for bounded degree graphs, and for three-connected graphs of fixed genus g . Using this we can show that for a three-connected graph satisfying a certain volume-growth condition, the multiplicity of the g th Laplacian eigenvalue is at most $2\left [