Work

Plumbing the 7-vertex torus

Year: 2026
Type: preprint
Abstract: Plumbing the 7-vertex torus (Matthew Gifford, 2026). Preprint, arXiv math.CO format. We glue copies of the 7-vertex triangulated torus (the Császár torus, whose 1-skeleton is K7) along triangular faces, according to a bonding graph, and ask when the result is a simplicial closed surface. Main results A general criterion. A necessary and sufficient condition for any bonding multigraph, orientable or not, stated through the graphs of identified vertices (Theorem 4.1). An exact degree formula turns vertex counting into a strong obstruction. Trees and cycles. Trees always give surfaces; cycles are classified completely. Four tori. No gluing of four tori in the tetrahedral pattern is ever a simplicial surface, and at most five of the six pairs can be bonded. The cube. For eight tori in the cube pattern, a simplicial orientable surface of genus 11 exists, and three of the five possible values of the total cycle rank are excluded. One value remains open. Random cycles. A closed formula for the probability fk that a uniformly random gluing of k tori in a cycle is simplicial. 1 − fk decays like k2(5/13)k, where 5/13 comes from the face incidences of the torus. Embeddings in R3. Small integer or rational coordinates, certified in exact arithmetic, for tight polyhedral embeddings of several of these surfaces, including a 15-vertex genus-5 surface, together with non-tight embeddings of three of the same triangulations. Verification Every theorem with a proof is also checked against a direct computational test, and every stated result has at least two independent checks. All programs, data and verification logs are deposited separately: doi:10.5281/zenodo.24357684. The proofs, verification programs and text were developed with AI assistance. The author checked the results and takes full responsibility for the content.
Language: English
Open Access status: green
OpenAlex ID: W7236696692
Cites:
Cited by:
Related to: 10