Vertex-minimal hyperbolic origami 2-torus
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 H3 that sends the triangles in T to geodesic triangles in H3. 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.