Related papers: Existence of a polyhedron which does not have a no…

Given an undirected graph, the non-empty subgraph polytope is the convex hull of the characteristic vectors of pairs (F, S) where S is a non-empty subset of nodes and F is a subset of the edges with both endnodes in S. We obtain a strong…

Any planar graph has a crossing-free straight-line drawing in the plane. A simultaneous geometric embedding of two n-vertex graphs is a straight-line drawing of both graphs on a common set of n points, such that the edges withing each…

We prove that every homogeneous convex polyhedron with only one unstable equilibrium (known as a mono-unstable convex polyhedron) has at least $7$ vertices. Although it has been long known that no mono-unstable tetrahedra exist, and…

A polygonal surface in the pseudo-hyperbolic space H^(2,n) is a complete maximal surface bounded by a lightlike polygon in the Einstein universe Ein^(1,n) with finitely many vertices. In this article, we give several characterizations of…

Consider all geodesics between two given points on a polyhedron. On the regular tetrahedron, we describe all the geodesics from a vertex to a point, which could be another vertex. Using the Stern--Brocot tree to explore the recursive…

Skeletal polyhedra are discrete structures made up of finite, flat or skew, or infinite, helical or zigzag, polygons as faces, with two faces on each edge and a circular vertex-figure at each vertex. When a variant of Wythoff's construction…

We classify projective toric manifolds whose dual variety is not a hypersurface in the dual projective space. Under the standard dictionary between toric geometry and convex geometry, they correspond to certain convex Delzant integer…

Generalizing Heegaard splittings of 3-manifolds and trisections of 4-manifolds, we consider multisections of higher-dimensional smooth (or PL) closed orientable manifolds, namely decompositions into 1-handlebodies whose subcollections…

In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an $\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each…

We review the theory of intrinsic geometry of convex surfaces in the Euclidean space and prove the following theorem: if the surface of a convex body K contains arbitrary long closed simple geodesics, then K is an isosceles tetrahedron.

We prove that a closed convex subset $C$ of a complete linear metric space $X$ is polyhedral in its closed linear hull if and only if no infinite subset $A\subset X\backslash C$ can be hidden behind $C$ in the sense $[x,y]\cap C\not =…

An example is given of a hyperconvex manifold without non-constant bounded holomorphic functions, which is realized as a domain with real-analytic Levi-flat boundary in a projective surface.

We prove that every positively-weighted tree T can be realized as the cut locus C(x) of a point x on a convex polyhedron P, with T weights matching C(x) lengths. If T has n leaves, P has (in general) n+1 vertices. We show there are in fact…

While intersections of convex sets are convex, their unions have rather complicated behavior. Some natural contexts where they appear include duality arguments involving boundaries of convex sets and valuations, which have an Euler…

This paper investigates the rigidity of bordered polyhedral surfaces. Using the variational principle, we show that bordered polyhedral surfaces are determined by boundary value and discrete curvatures on the interior edges. As a corollary,…

Each finite configuration of points in the plane determines a corresponding lattice of noncrossing partitions. When these points form the vertex set of a convex polygon, the associated lattice is the classical noncrossing partition lattice…

Let the Euclidean plane be simultaneously and independently endowed with a Poisson point process and a Poisson line process, each of unit intensity. Consider a triangle T whose vertices all belong to the point process. The triangle is…

A polyhedron is a graph $G$ which is simple, planar and 3-connected. In this note, we classify the family of strongly involutive self-dual polyhedra. The latter is done by using a well-known result due to Tutte characterizing 3-connected…

Mr. C. Stephanos posed the following question in the Interm\'ediaire des Math\'ematiciens: "Do there exist polyhedra with invariant facets that are susceptible to an infinite family of transformations that only alter solid angles and…

We construct a sphere-homeomorphic flexible self-intersection free polyhedron in Euclidean 3-space such that all its dihedral angles change during some flex of this polyhedron. The constructed polyhedron has 26 vertices, 72 edges and 48…