Related papers: Every Combinatorial Polyhedron Can Unfold with Ove…

Let F be a foliation of codimension 2 on a compact manifold with at least one non-compact leaf. We show that then F must contain uncountably many non-compact leaves. We prove the same statement for oriented p-dimensional foliations of…

In this paper we show that bending a finite volume hyperbolic $d$-manifold $M$ along a totally geodesic hypersurface $\Sigma$ results in a properly convex projective structure on $M$ with finite volume. We also discuss various geometric…

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

A Fuchsian polyhedron in hyperbolic space is a polyhedral surface invariant under the action of a Fuchsian group of isometries (i.e. a group of isometries leaving globally invariant a totally geodesic surface, on which it acts cocompactly).…

Given a polygon $P$ in the plane, a {\em pop} operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, and show that any polygon from this family cannot be…

Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…

Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.

This addendum to [O'R17] establishes that a nearly flat acutely triangulated convex cap in the sense of that paper can be edge-unfolded even if closed to a polyhedron by adding the convex polygonal base under the cap.

We consider compact 3-manifolds M having a submersion h to R in which each generic point inverse is a planar surface. The standard height function on a submanifold of the 3-sphere is a motivating example. To (M, h) we associate a…

We investigate the combinatorial analogues, in the context of normal surfaces, of taut and transversely measured (codimension 1) foliations of 3-manifolds. We establish that the existence of certain combinatorial structures, a priori weaker…

Consider a bicolored point set $P$ in general position in the plane consisting of $n$ blue and $n$ red points. We show that if a subset of the red points forms the vertices of a convex polygon separating the blue points, lying inside the…

The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. We prove the conjecture for a multivariate generalization of the matching polynomial. This is further…

The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph on two vertices. A graph $G$ is prism-hamiltonian if the prism over $G$ is hamiltonian. We prove that every polyhedral graph (i.e. 3-connected planar graph)…

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…

Let $P$ be a polygon with $r>0$ reflex vertices and possibly with holes and islands. A subsuming polygon of $P$ is a polygon $P'$ such that $P \subseteq P'$, each connected component $R$ of $P$ is a subset of a distinct connected component…

Which convex 3D polyhedra can be obtained by gluing several regular hexagons edge-to-edge? It turns out that there are only 15 possible types of shapes, 5 of which are doubly-covered 2D polygons. We give examples for most of them, including…

We investigate the graphs formed from the vertices and creases of an origami pattern that can be folded flat along all of its creases. As we show, this is possible for a tree if and only if the internal vertices of the tree all have even…

In this note we gather and review some facts about existence of toric spaces over 3-dimensional simple polytopes. First, over every combinatorial 3-polytope there exists a quasitoric manifold. Second, there exist combinatorial 3-polytopes,…

We analyze the problem of folding one polyhedron, viewed as a metric graph of its edges, into the shape of another, similar to 1D origami. We find such foldings between all pairs of Platonic solids and prove corresponding lower bounds,…