A discrete conformality for hyperbolic polyhedral surfaces is introduced in this paper. This discrete conformality is shown to be computable. It is proved that each hyperbolic polyhedral metric on a closed surface is discrete conformal to a unique hyperbolic polyhedral metric with a given discrete curvature satisfying Gauss-Bonnet formula. Furthermore, the hyperbolic polyhedral metric with given curvature can be obtained using a discrete Yamabe flow with surgery. In particular, each hyperbolic polyhedral metric on a closed surface with negative Euler characteristic is discrete conformal to a unique hyperbolic metric.

Convex bodies with identical John and LYZ ellipsoids are characterized. This solves an important problem from convex geometry posed by G. Zhang. As applications, several sharp affine isoperimetric inequalities are established.

TheLpAleksandrovintegralcurvatureanditscorrespondingchar- acterization problem—the Lp Aleksandrov problem—were recently introduced by Huang, Lutwak, Yang, and Zhang. The current work presents a solution to the Lp Aleksandrov problem for origin-symmetric polytopes when −1 < p < 0.

For origin-symmetric convex bodies (i.e., the unit balls of finite dimensional Banach spaces) it is conjectured that there exist a family of inequalities each of which is stronger than the classical Brunn–Minkowski inequality and a family of inequalities each of which is stronger than the classical Minkowski mixed-volume inequality. It is shown that these two families of inequalities are “equivalent” in that once either of these inequalities is established, the other must follow as a consequence. All of the conjectured inequalities are established for plane convex bodies.

For a random quantum state on $\cH=\C^d \otimes \C^d$ obtained by partial tracing a random pure state on $\cH \otimes \C^s$, we consider the question whether it is typically separable or typically entangled. For this problem, we show the existence of a sharp threshold $s_0=s_0(d)$ of order roughly $d^3$. More precisely, for any $\e>0$ and for $d$ large enough, such a random state is entangled with very large probability when $s \leq (1-\e)s_0$, and separable with very large probability when $s \geq (1+\e) s_0$. One consequence of this result is as follows: for a system of $N$ identical particles in a random pure state, there is a threshold $k_0 = k_0(N)\sim N/5$ such that two subsystems of $k$ particles each typically share entanglement if $k>k_0$, and typically do not share entanglement if $k<k_0$. Our methods work also for multipartite systems and for ``unbalanced'' systems such as $\C^{d_1} \otimes \C^{d_2} $, ${d_1} \neq {d_2} $. The arguments rely on random matrices, classical convexity, high-dimensional probability and geometry of Banach spaces; some of the auxiliary results may be of reference value.