arXiv research

Intermediate logic of all convex polyhedra is axiomatized.

The paper solves three problems related to monostable polyhedra.

The paper proves rigidity and uniformization theorems for infinite circle patterns and convex polyhedra in hyperbolic 3-space.

Weakly convex polyhedra which are star-shaped with respect to one of their vertices are infinitesimally rigid. This is a partial answer to the question whether every decomposable weakly convex polyhedron is infinitesimally rigid. The proof uses a recent result of Izmestiev on the geometry of convex caps.

The study finds all possible 3D polytopes in Riemannian 3-manifolds with positive scalar curvature.

Study improves learning algorithms for convex polyhedra in Hilbert spaces.

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 theorem. We also review the analogous characterization of ideal polyhedra, and …

Study on polyhedra rigidity, finding non-existence of flexible weakly convex decomposable polyhedra.

The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed the case for two classes of polyhedra: those obtained from a convex polyhedron b…

We study convex polyhedra in three-space that are inscribed in a quadric surface. Up to projective transformations, there are three such surfaces: the sphere, the hyperboloid, and the cylinder. Our main result is that a planar graph $Γ$ is realized as the $1$-skeleton of a polyhedron inscribed in the hyperboloid or cyl…

We present an improved algorithm for {\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \log t$ halfspaces with constant-size margins in time polynomial in $t$ (where $t$ is the nu…

We study convex polyhedra in $\mathbb{R}\mathbb{P}^3$ with all their vertices on a sphere. We do not require, in particular, that the polyhedra lie in the interior of the sphere, hence the term "weakly inscribed". Such polyhedra can be interpreted as ideal polyhedra, if we regard $\mathbb{R}\mathbb{P}^3$ as a combinati…

New tilings of the 2-sphere from convex polyhedra in 3-sphere.

Proves Gromov's conjecture and answers Stoker's polyhedron conjecture.

In this paper, we prove the existence of energy minimizers in each free homotopy class of maps between polyhedra with target space without focal points. Our proof involves a careful study of some geometric properties of riemannian polhyedra without focal points. Among other things, we show that on the relevant polyhedr…

Classical H.Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H.Minkowski uniqueness theorem due to A.D.Alexandrov are extended to a class of nonconvex polyhedra which are called polyhedral herissons and may be de…

In this article, we describe symplectic and complex toric spaces associated to the five regular convex polyhedra. The regular tetrahedron and the cube are rational and simple, the regular octahedron is not simple, the regular dodecahedron is not rational and the regular icosahedron is neither simple nor rational. We re…

Given a combinatorial description $C$ of a polyhedron having $E$ edges, the space of dihedral angles of all compact hyperbolic polyhedra that realize $C$ is generally not a convex subset of $\mathbb{R}^E$ \cite{DIAZ}. If $C$ has five or more faces, Andreev's Theorem states that the corresponding space of dihedral angle…

The paper is centered around a new proof of the infinitesimal rigidity of convex polyhedra. The proof is based on studying derivatives of the discrete Hilbert-Einstein functional on the space of "warped polyhedra" with a fixed metric on the boundary. This approach is in a sense dual to using derivatives of the volume i…

Software finds ideal polyhedra with rational dihedral angles and volume maxima.

Let $P$ be a (non necessarily convex) embedded polyhedron in $\R^3$, with its vertices on an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then $P$ is infinitesimally rigid. More generally, let $P$ be a polyhedron bounding a domain which is the union of p…

The paper confirms conjectures about the topology of triangulated polyhedra and geodesic triangulations on spheres.

Let S be a compact surface of genus >1, and g be a metric on S of constant curvature K\in\{-1,0,1\} with conical singularities of negative singular curvature. When K=1 we add the condition that the lengths of the contractible geodesics are >2π. We prove that there exists a convex polyhedral surface P in the Lorentzian …

The Stoker problem, first formulated in 1968, consists in understanding to what extent a convex polyhedron is determined by its dihedral angles. By means of the double construction, this problem is intimately related to rigidity issues for 3-dimensional cone-manifolds. In a former paper, two such rigidity results were …

We study hyperideal polyhedra in the 3-dimensional anti-de Sitter space $AdS^3$, which are defined as the intersection of the projective model of $AdS^3$ with a convex polyhedron in $RP^3$ whose vertices are all outside of $AdS^3$ and whose edges all meet $AdS^3$. We show that hyperideal polyhedra in $AdS^3$ are unique…

In his paper "Shapes of Polyhedra and Triangulations of the Sphere", Thurston found that the set of shapes of convex polyhedra with prescribed cone-deficits has a complex hyperbolic structure. Inspired by his work, this paper studies the set of shapes of centrally symmetric octahedra with prescribed cone-deficits. We s…

By a result of W.~P. Thurston, the moduli space of flat metrics on the sphere with $n$ cone singularities of prescribed positive curvatures is a complex hyperbolic orbifold of dimension $n-3$. The Hermitian form comes from the area of the metric. Using geometry of Euclidean polyhedra, we observe that this space has a n…

Paper generalizes Andreev's theorem with obtuse angles.

We are generalizing to higher dimensions the Bavard-Ghys construction of the hyperbolic metric on the space of polygons with fixed directions of edges. The space of convex d-dimensional polyhedra with fixed directions of facet normals has a decomposition into type cones that correspond to different combinatorial types …

The integer hull of a polyhedron is the convex hull of the integer points contained in it. We show that the vertices of the integer hulls of a rational family of polyhedra of size O(n) have quasipolynomial coordinates. As a corollary, we show that the stable commutator length of elements in a surgery family is a ratio …

Discrete conformal maps on surfaces with vertex decorations are studied.

The main result is that every complete finite area hyperbolic metric on a sphere with punctures can be uniquely realized as the induced metric on the surface of a convex ideal polyhedron in hyperbolic 3-space. A number of other observations are included.

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 possible dihedral angles. We find as special cases the results of Bao and Bonah…

Duality principle for approximation of geometrical objects (also known as Eudoxus exhaustion method) was extended and perfected by Archimedes in his famous tractate "Measurement of circle". The main idea of the approximation method by Archimedes is to construct a sequence of pairs of inscribed and circumscribed polygon…

The study of comparison theorems in geometry has a rich history. In this paper, we establish a comparison theorem for polyhedra in 3-manifolds with nonnegative scalar curvature, answering affirmatively a dihedral rigidity conjecture by Gromov. For a large collections of polyhedra with interior non-negative scalar curva…

A planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in any given convex surface which is sufficiently close to the sphere, then we call …

Polyhedra's structure is uniquely defined by edge lengths and dihedral angles, even nonconvex.

We show the rigidity of the hexagonal Delaunay triangulated plane under Luo's PL conformality. As a consequence, we obtain a rigidity theorem for a particular type of locally finite convex ideal hyperbolic polyhedra.

We show that every convex polyhedron admits a simple edge unfolding after an affine transformation. In particular there exists no combinatorial obstruction to a positive resolution of Durer's unfoldability problem, which answers a question of Croft, Falconer, and Guy. Among other techniques, the proof employs a topolog…

Researchers explore valuations on polyhedra and topological arrangements without imposing algebraic structures.

Polyhedra can be Rupert if they can be slightly rotated to fit inside each other.

In this paper we give a new proof of a theorem by Alexandrov on the Gauss curvature prescription of Euclidean convex sets. This proof is based on the duality theory of convex sets and on optimal mass transport. A noteworthy property of this proof is that it does not rely neither on the theory of convex polyhedra nor on…

We provide a constructive, variational proof of Rivin's realization theorem for ideal hyperbolic polyhedra with prescribed intrinsic metric, which is equivalent to a discrete uniformization theorem for spheres. The same variational method is also used to prove a discrete uniformization theorem of Gu et al. and a corres…

We study analytic properties of harmonic maps from Riemannian polyhedra into CAT($κ$) spaces for $κ\in\{0,1\}$. Locally, on each top-dimensional face of the domain, this amounts to studying harmonic maps from smooth domains into CAT($κ$) spaces. We compute a target variation formula that captures the curvature bound in…

Let P and Q be convex polyhedra in E3 with face lattices F(P) and F(Q) and symmetry groups G(P) and G(Q), respectively. Then, P and Q are called face equivalent if there is a lattice isomorphism between F(P) and F(Q); P and Q are called symmetry equivalent if the action of G(P) on F(P) is equivalent to the action of G(…

We state that any constant curvature Riemannian metric with conical singularities of constant sign curvature on a compact (orientable) surface $S$ can be realized as a convex polyhedron in a Riemannian or Lorentzian) space-form. Moreover such a polyhedron is unique, up to global isometries, among convex polyhedra invar…

Geometric approach to majorizing measures for polyhedra and general compact objects.

Löbell polyhedra have small systoles and are quasi-arithmetic.