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.

The original goal of this paper is to extend the affine isoperimetric inequality and Steiner type inequality of Orlicz projection bodies (which originated to Lutwak, Yang, and Zhang [36]), from convex bodies to Lipschitz star bodies (whose radial functions are locally Lipschitz). In order to achieve it, we investigate the graph functions of the given Lipschitz star body K: Along almost all directions u, we can define the graph functions on an open dense subset of the orthogonal projection of K onto u⊥.

General affine invariances related to Mahler volume are introduced. We establish their affine isoperimetric inequalities by using a symmetrization scheme that involves a total of 2n elaborately chosen Steiner symmetrizations at a time. The necessity of this scheme, as opposed to the usual Steiner symmetrization, is demonstrated with an example (see the Appendix).

The conjecture about the Orlicz Pólya–Szegö principle posed in [42] is proved. The cases of equality are characterized in the affine Orlicz Pólya–Szegö principle with respect to Steiner symmetrization and Schwarz spherical symmetrization.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

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.

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, +∞).

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.

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.

Sufficient conditions are given for the existence of solutions to the discrete LpMinkowski problem for p-capacity when 0 <p <1and 1 <p <2.

A variational formula for the Lutwak affine surface areas j of convex bodies in Rn is established when 1 ≤ j ≤ n − 1. By using introduced new ellipsoids associated with projection functions of convex bodies, we prove a sharp isoperimetric inequality for j , which opens up a new passage to attack the longstanding Lutwak conjecture in convex geometry.

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 [

As&gt; iVinf^ b^ where dx denotes the degree of the vertex x. In particular, we derive lower bounds of eigenvalues for convex subgraphs which consist of lattice points in an d-dimensional Riemannian manifolds M with convex boundary. The techniques involve both the (discrete) heat kernels of graphs and improved estimates of the (continuous) heat kernels of Riemannian manifolds. We prove eigenvalue lower bounds for convex subgraphs of the form ce2/(dD (M)) 2 where e denotes the distance between two closest lattice points, D (M) denotes the diameter of the manifold M and c is a constant (independent of the dimension d and the number of vertices in 5, but depending on the how" dense" the lattice points are). This eigenvalue bound is useful for bounding the rates of convergence for various random walk problems. Since many enumeration problems can be approximated by considering random walks in convex subgraphs of some appropriate host graph, the eigenvalue inequalities here have many applications.

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.

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.

Simple-homotopy for cell complexes is a special type of topological homotopy constructed by elementary collapses and elementary expansions. In this paper, we introduce graph homotopy for graphs and Graham homotopy for hypergraphs and study the relation between the two homotopies and the simple-homotopy for cell complexes. The graph homotopy is useful to describe topological properties of discretized geometric figures, while the Graham homotopy is essential to characterize acyclic hypergraphs and acyclic relational database schemes.

Given a closed strictly convex hypersurface M in the Euclidean space I?"+*, the Gauss map of M defines a homeomorphism between M and the unit sphere S". Therefore the Gauss-Kronecker curvature of M can be transplanted via the Gauss map to a function defined on S". If this function is denoted by K, then Minkowski observed that K must satisfy the equation where xi are the coordinate functions on S". Minkowski then asked the converse of the problem. Namely, given a positive function K defined on S" satisfying the above integral conditions, can we find a closed strictly convex hypersurface whose curvature function is given by K? Minkowski solved the problem in the category of polyhedrons. Then AD Alexandrov and others solved the problem in general. However, this last solution does not provide any information about the regularity of the (unique) convex hypersurface even if we assume K is smooth. In the two

The Lp dual curvature measure was introduced by Lutwak, Yang & Zhang in an attempt to unify the Lp Brunn– Minkowski theory and the dual Brunn–Minkowski theory. The characterization problem for Lp dual curvature measure, called the Lp dual Minkowski problem, is a fundamental problem in this unifying theory. The Lp dual Minkowski problem contains the Lp Minkowski problem and the dual Minkowski problem, two major problems in modern convex geometry that remain open in general. In this paper, existence results on the Lp dual Minkowski problem in the weak sense will be provided. Moreover, existence and uniqueness of the solution in the smooth category will also be demonstrated.

In this paper, we consider the L p dual Minkowski problem by geometric variational method. Using anisotropic Gauss–Kronecker curvature flows, we establish the existence of smooth solutions of the L p dual Minkowski problem when pq ≥ 0 and the given data is even. If f ≡ 1, we show under some restrictions on p and q that the only even, smooth, uniformly convex solution is the unit ball.

A discrete conformality for polyhedral metrics on surfaces is introduced in this paper. It is shown that each polyhedral metric on a compact surface is discrete conformal to a constant curvature polyhedral metric which is unique up to scaling. Furthermore, the constant curvature metric can be found using a finite dimensional variational principle.

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.

No abstract uploaded!