Plumbing the 7-vertex torus

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.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24357821
Primary Topic
Geometric and Algebraic Topology
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Plumbing the 7-vertex torus

Matthew Gifford
Zenodo (CERN European Organization for Nuclear Research)
Geometric and Algebraic Topology
preprint

Plumbing the 7-vertex torus

Matthew Gifford
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
Geometric and Algebraic Topology
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon