Related papers: A short proof of rigidity of convex polytopes

The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…

We present a short proof of the Alexandrov-Fenchel inequalities for mixed volumes of convex bodies.

We present a constructive proof of Alexandrov's theorem regarding the existence of a convex polytope with a given metric on the boundary. The polytope is obtained as a result of a certain deformation in the class of generalized convex…

Let P be a locally finite disk pattern on the complex plane C whose combinatorics are described by the one-skeleton G of a triangulation of the open topological disk and whose dihedral angles are equal to a function \Theta:E\to [0,\pi/2] on…

We prove some rigidity theorems for configurations of closed disks. First, fix two collections $\mathcal{C}$ and $\tilde{\mathcal{C}}$ of closed disks in the Riemann sphere $\hat{\mathbb{C}}$, sharing a contact graph which…

Classical results of Cauchy and Dehn imply that the 1-skeleton of a convex polyhedron $P$ is rigid i.e. every continuous motion of the vertices of $P$ in $\mathbb R^3$ which preserves its edge lengths results in a polyhedron which is…

A compactness theorem is proved for a family of K\"{a}hler surfaces with constant scalar curvature and volume bounded from below, diameter bounded from above, Ricci curvature bounded and the signature bounded from below. Furthermore, a…

Here we propose a class of frameworks in the plane, braced polygons, that may be globally rigid and are analogous to convex polyopes in 3 space that are rigid by Cauchy's rigidity Theorem in 1813.

In this paper we give a pinching theorem of the Simon conjecture in the case s=3 and also give a new proof of the cases s=1 and s=2 by some Simons-type integral inequalities.

The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.

In this paper, we prove a local rigidity of convex hypersurfaces in the spaces of constant curvature of dimension $n\ge4$. Namely, we show that two convex isometric hypersurfaces are congruent locally around their corresponding under the…

We prove that any properly oriented $C^{2,1}$ isometric immersion of a positively curved Riemannian surface M into Euclidean 3-space is uniquely determined, up to a rigid motion, by its values on any curve segment in M. A generalization of…

In this article, I provide significant mathematical evidence in support of the existence of short-time approximations of any polynomial order for the computation of density matrices of physical systems described by arbitrarily smooth and…

We report a simple rigidity theorem for certain Euler products.

We prove that computing a shortest monotone path to the optimum of a linear program over a simple polytope is NP-hard, thus resolving a 2022 open question of De Loera, Kafer, and Sanit\`a. As a consequence, finding a shortest sequence of…

We prove that universal second-order rigidity implies universal prestress stability and that triangulated convex polytopes in three-space (with holes appropriately positioned) are prestress stable.

We will present a new proof of the Gromoll-Grove diameter rigidity theorem.

In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generalization of early results of Hopf and Pannwitz, Sutherland,…

We review several results related to the characterization of polyhedra in hyperbolic 3-space. In particular we present Rivin's theorem that gives a characterization of compact convex hyperbolic polyhedra, and Hodgson's proof of the Adreev's…

The Hard Lefschetz theorem is known to hold for the intersection cohomology of the toric variety associated to a rational convex polytope. One can construct the intersection cohomology combinatorially from the polytope, hence it is well…