English
Related papers

Related papers: A short proof of rigidity of convex polytopes

200 papers

We survey the main extensions of the classical Hadamard, Liebmann and Cohn-Vossen rigidity theorems on convex surfaces of $3$-Euclidean space to the context of convex hypersurfaces of Riemannian manifolds. The results we present include the…

Differential Geometry · Mathematics 2023-02-03 Ronaldo Freire de Lima

In this paper, we discuss a rigidity property for holomorphic disks in Teichm\"uller space. In fact, we give a refinement of Tanigawa's rigidity theorem. We will also treat the rigidity property of holomorphic disks for complex manifolds.…

Complex Variables · Mathematics 2014-02-25 Hideki Miyachi

Using the orthogonal connectedness, we introduce the notion of orthogonal decomposability of convex polytopes and study it in the case of Platonic and Archimedean solids. While doing so, we also encounter polytopes which are not…

Combinatorics · Mathematics 2026-03-10 Julia Q. Du , Xuemei He , Xiaotian Song , Daniela Stiller , Liping Yuan , Tudor Zamfirescu

A convex-polynomial is a convex combination of the monomials $\{1, x, x^2, \ldots\}$. This paper establishes that the convex-polynomials on $\mathbb R$ are dense in $L^p(\mu)$ and weak$^*$ dense in $L^\infty(\mu)$, precisely when…

Functional Analysis · Mathematics 2015-11-02 Nathan S. Feldman , Paul J. McGuire

We prove an exponential deviation inequality for the convex hull of a finite sample of i.i.d. random points with a density supported on an arbitrary convex body in $\R^d$, $d\geq 2$. When the density is uniform, our result yields rate…

Probability · Mathematics 2017-04-07 Victor-Emmanuel Brunel

Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…

Combinatorics · Mathematics 2010-12-13 Roland Bacher , Frédéric Mouton

We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…

Algebraic Geometry · Mathematics 2026-01-21 Alejandro González Nevado

We present a short, direct proof of the uniform convexity of L^p spaces for 1<p<\infty.

Functional Analysis · Mathematics 2007-05-23 Harald Hanche-Olsen

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

Optimization and Control · Mathematics 2023-05-04 Daniel Dörfler

Since Thurston pioneered the connection between circle packing (abbr. CP) and three-dimensional geometric topology, the characterization of CPs and hyperbolic polyhedra has become increasingly profound. Some milestones have been achieved,…

Geometric Topology · Mathematics 2026-04-29 Huabin Ge , Longsong Jia , Hao Yu , Puchun Zhou

In (the surface of) a convex polytope P^n in R^n+1, for small prescribed volume, geodesic balls about some vertex minimize perimeter. This revision corrects a mistake in the mass bound argument in the proof of Theorem 3.8.

Metric Geometry · Mathematics 2007-05-23 Frank Morgan

There are many four vertex type theorems appearing in the literature, coming in both smooth and discrete flavors. The most familiar of these is the classical theorem in differential geometry, which states that the curvature function of a…

Metric Geometry · Mathematics 2023-02-09 Wiktor Mogilski , Kyle Grant

We establish an entropy rigidity theorem for Hitchin representations of all geometrically finite Fuchsian groups which generalizes a theorem of Potrie and Sambarino for Hitchin representations of closed surface groups. In the process, we…

Group Theory · Mathematics 2025-11-18 Richard Canary , Tengren Zhang , Andrew Zimmer

This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…

Optimization and Control · Mathematics 2025-04-28 Kazuo Murota , Akihisa Tamura

We provide a short proof for the Figiel, Lindenstrauss and Milman inequality regarding the number of vertices and faces of certain polytope, with an explicit bound on the universal constant involved. The proof is completely elementary and…

Metric Geometry · Mathematics 2025-04-10 Tomer Milo

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…

Geometric Topology · Mathematics 2018-12-31 Xu Xu

We determine (non-necessarily convex) polyhedra having simple dense geodesics.

Metric Geometry · Mathematics 2018-02-14 Jin-Ichi Itoh , Joël Rouyer , Costin Vîlcu

Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.

Discrete Mathematics · Computer Science 2007-11-04 Sergey Gubin

In this paper, we develop a new index theory for manifolds with polyhedral boundary. As an application, we prove Gromov's dihedral extremality conjecture regarding comparisons of scalar curvatures, mean curvatures and dihedral angles…

Differential Geometry · Mathematics 2023-03-09 Jinmin Wang , Zhizhang Xie , Guoliang Yu

We prove that any finite, abstract n-polytope is covered by a finite, abstract regular n-polytope.

Combinatorics · Mathematics 2012-09-07 B. Monson , Egon Schulte
‹ Prev 1 3 4 5 6 7 10 Next ›