English
Related papers

Related papers: A short proof of rigidity of convex polytopes

200 papers

We prove that, for a hyperbolic two bridge knot, infinitely many Dehn fillings are rigid in $SO_0(4,1)$. Here rigidity means that any discrete and faithful representation in $SO_0(4,1)$ is conjugate to the holonomy representation in…

Geometric Topology · Mathematics 2008-09-23 Stefano Francaviglia , Joan Porti

We prove via convex integration a result that allows to pass from a so-called subsolution of the isentropic Euler equations (in space dimension at least $2$) to exact weak solutions. The method is closely related to the incompressible…

Analysis of PDEs · Mathematics 2021-07-23 Tomasz Dębiec , Jack W. D. Skipper , Emil Wiedemann

We observe that a large part of the volume of a hyperbolic polyhedron is taken by a tubular neighbourhood of its boundary, and use this to give a new proof for the finiteness of arithmetic maximal reflection groups following a recent work…

Geometric Topology · Mathematics 2022-09-08 Jean Raimbault

In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…

Metric Geometry · Mathematics 2019-11-07 Fernando Mário de Oliveira Filho , Frank Vallentin

We provide a somewhat geometric proof of a rigidity theorem by M. Ledoux and C. Xia concerning complete manifolds with non-negative Ricci curvature supporting an Euclidean-type Sobolev inequality with (almost) best Sobolev constant. Using…

Differential Geometry · Mathematics 2010-02-22 Stefano Pigola , Giona Veronelli

We give an explicit formula on the Ehrhart polynomial of a 3-dimensional simple integral convex polytope by using toric geometry.

Combinatorics · Mathematics 2016-05-17 Yusuke Suyama

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

Metric Geometry · Mathematics 2026-03-10 Steven Hoehner

We characterize the asymptotic behaviour, in the sense of $\Gamma$-convergence, of a thin magnetoelastic shallow shell. The compactness is achieved up to rigid motions. For deformations, it relies on an approximation by rigid movements,…

Analysis of PDEs · Mathematics 2025-08-20 Emanuele Tasso , Tobias Unterberger

Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…

Computational Geometry · Computer Science 2018-10-24 Bhaskar Bagchi , Benjamin A. Burton , Basudeb Datta , Nitin Singh , Jonathan Spreer

It is shown that any smooth strictly convex global solution of $$\det(\frac{\partial^{2}u}{\partial \xi_{i}\partial \xi_{j}}) = \exp \left\{-\sum_{i=1}^n d_i \frac{\partial u}{\partial \xi_{i}} - d_0\right\},$$ where $d_0$, $d_1$,...,$d_n$…

Differential Geometry · Mathematics 2007-10-22 An-Min Li , Ruiwei Xu

A closed quasigeodesic on a convex polyhedron is a closed curve that is locally straight outside of the vertices, where it forms an angle at most $\pi$ on both sides. While the existence of a simple closed quasigeodesic on a convex…

Computational Geometry · Computer Science 2022-09-29 Jean Chartier , Arnaud de Mesmay

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Anna Lubiw , Joseph O'Rourke

The M-convexity of dual Schubert polynomials was first proven by Huh, Matherne, M\'esz\'aros, and St. Dizier in 2022. We give a full characterization of the supports of dual Schubert polynomials, which yields an elementary alternative proof…

Combinatorics · Mathematics 2024-11-26 Serena An , Katherine Tung , Yuchong Zhang

Let $(M, \dr M)$ be a 3-manifold with incompressible boundary that admits a convex co-compact hyperbolic metric. We consider the hyperbolic metrics on $M$ such that $\dr M$ looks locally like a hyperideal polyhedron, and we characterize the…

Geometric Topology · Mathematics 2007-05-23 Jean-Marc Schlenker

We prove the following comparison theorem for metrics with nonnegative scalar curvature, also known as the dihedral rigidity conjecture by Gromov: for $n\le 7$, if an $n$-dimensional prism has nonnegative scalar curvature and weakly mean…

Differential Geometry · Mathematics 2022-09-05 Chao Li

In Theorem 3.1 of [12], we proved a rigidity result for self-shrinkers under the integral condition on the norm of the second fundamental form. In this paper, we relax the such bound to any finite constant (see Theorem 4.4 for details).

Differential Geometry · Mathematics 2023-12-27 Qi Ding

We apply techniques from symplectic geometry to extend and give a new proof of the complex convexity theorem of Gindikin-Kroetz.

Symplectic Geometry · Mathematics 2007-05-23 Bernhard Kroetz , Michael Otto

The maximum principle for hyperbolic inversive distance circle packings on polyhedral surfaces is established,which unifies and generalizes existing maximum principles for various types of circle packings in the literature.As an application…

Differential Geometry · Mathematics 2025-11-14 Yanwen Luo , Xu Xu , Chao Zheng

In this paper, we prove new rigidity results related to some generalised Ricci-Hessian equation on Riemannian manifolds.

Differential Geometry · Mathematics 2023-03-21 Nicolas Ginoux , Georges Habib

We give a short proof of the log-concavity of the coefficients of the reduced characteristic polynomial of a matroid. The proof uses an extension of the theory of Lorentzian polynomials to convex cones, and reproves the Hodge-Riemann…

Combinatorics · Mathematics 2021-10-12 Petter Brändén , Jonathan Leake