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.

Let (V, E) denote a graph with vertex set V= V (T) and edge set E= E (). Suppose a group TL acts on V such that:(i) for all g Ti,{gu, gv} GE if and only if {u, v} E,(ii) for any two vertices and v, there is a g T such that guv. Then we say is a homogeneous graph with the associated group Ti. In other words, is vertex-transitive under the action of Ti and We can identify V with the coset space Ti/X where X={g E Ti: gvv}, for a fixed vertex v, denotes the isotropy group. We note that the Cayley graph is a special case of homogeneous graphs with X trivial. The edge set of a homogeneous graph can be described by an (edge) generating set ii H such that each edge of is of the form {v, gv} for some v V, and g . In this paper we require the generating set to be symmetric, ie, g if and only if g^ 1 K. We say that a homogeneous graph is invariant if for every vertex a K, we have aKa-1= K.

The centro-affine Minkowski problem in affine differential geometry is considered. Existence for the solution of the discrete centro-affine Minkowski problem is proved.

The nth power of the volume functional Vnof polytopes P in R^n, according to dimensions of the spaces spanned by any nunit outer normal vectors of P, is decomposed into nhomogeneous polynomials of degree n. A set of new sharp affine isoperimetric inequalities for these volume decomposition functionals in R^3 are established, which essentially characterize the geometric and algebraic structures of polytopes.

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 [

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.

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 are concerned with upper bounds of eigenvalues of Laplace operator on compact Riemannian manifolds and finite graphs. While on the former the Laplace operator is generated by the Riemannian metric, on the latter it reflects combinatorial structure of a graph. Respectively, eigenvalues have many applications in geometry as well as in combinatorics and in other fields of mathematics. We develop a universal approach to upper bounds on both continuous and discrete structures based upon certain properties of the corresponding heat kernel. This approach is perhaps much more general than its realization here. Basically, we start with the following entries:(1) an underlying space M with a finite measure+;(2) a well-defined Laplace operator 2 on functions on M so that 2 is a self-adjoint operator in L2 (M,+) with a discrete spectrum;(3) if M has a boundary, then the boundary condition should be chosen so that it does not disrupt self-adjointness of 2 and is of dissipative nature;(4) a distance function dist (x, y) on M so that|{dist| 1 for an appropriate notion of gradient.

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.