Vertex-minimal hyperbolic origami 2-torus
Zhengyu Zou
TL;DR
The paper proves that a hyperbolic origami 2-torus, a genus-2 surface triangulated with 10 vertices, can be isometrically embedded into $\mathbb{H}^3$ via a geodesic triangulation. The authors construct a candidate 10-vertex model $\hat{S}$ that is $10^{-28}$-flat and robustly embedded, and then use a high-precision, computer-assisted Newton-type method to perturb coordinates and obtain an exact isometric embedding $S$ with cone angles exactly $2\pi$. To facilitate and validate the search, they also develop a 12-vertex model with a 2-fold symmetry, $\hat{S}_{12}$, illustrating a symmetric pathway toward vertex-minimal configurations; the embedding is shown to respect a hyperelliptic involution and exhibits a near-ideal isometric tiling in the universal cover. The work combines detailed geometric analysis (via the Beltrami–Klein model and hyperbolic trigonometry) with rigorous, high-precision numerical proofs, yielding a definitive minimum of 10 vertices for a hyperbolic origami 2-torus and enabling the construction of a family of such tori for all $n\ge 10$ by interior refinement. The results have potential to inform broader questions about hyperbolic polyhedral embeddings and the moduli of hyperbolic tori, with explicit coordinates and open-source visualization tools provided for reproducibility.
Abstract
We show that there exists a geodesic triangulation $T$ of a hyperbolic genus 2 surface $Σ_2$ with 10 vertices and an isometric polyhedral embedding $S: Σ_2 \hookrightarrow \mathbb{H}^3$ that sends the triangles in $T$ to geodesic triangles in $\mathbb{H}^3$. We call this type of embedding a hyperbolic origami 2-torus. Since 10 is the combinatorially minimum number of vertices required to triangulate a genus 2 surface, this paper settles the question of minimum number of vertices required to obtain a hyperbolic origami 2-torus.
