A Negative Answer to a Question of Santos on the Dual Diameter of Surfaces with Boundary

Let f̄(2,n) be the maximum diameter of the dual graph of a triangulated surface with boundary on n vertices. At a 2012 Oberwolfach workshop, Santos asked whether f̄(2,n) ≤ n − 3. We show that the answer is no. A triangulation M₇ of the real projective plane minus two disjoint open discs has 7 vertices, 10 triangles and dual diameter 5. The same complex appears in work of Holmes on Stanley–Reisner rings with Serre's property (S₂), where it is not identified as a surface. Gluing copies of M₇ along boundary edges gives f̄(2,n) ≥ n − 3 + ⌊(n − 2)/5⌋ for all n ≥ 3, so the excess over n − 3 is unbounded. An orientable surface of genus 2 with 10 vertices and dual diameter 8 gives the bound n − 3 + ⌊(n − 2)/8⌋ for orientable surfaces. A short layering argument shows f̄(2,n) ≤ max(n − 3, 2n − 8), and a theorem of Holmes gives max(2n − 10, n − 2). Computer searches with DRAT-certified unsatisfiability proofs, confirmed by an exhaustive enumeration of the surfaces with at most 10 vertices, show that f̄(2,n) = n − 3 for n ≤ 6 and f̄(2,n) = n − 2 for 7 ≤ n ≤ 10 (for 6 ≤ n ≤ 9 these values also follow from results of Holmes), that M₇ is the only counterexample with at most 7 vertices, and that orientable surfaces with at most 9 vertices satisfy the bound. This is an unrefereed note. Unrefereed preprint released for independent mathematical scrutiny. Publication on Zenodo does not constitute peer review. AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text. Corpus identifier: OWR-11786-023 (Oberwolfach Reports 24/2012, "Triangulations", problem session, problem 9 by F. Santos).

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-01
DOI
https://doi.org/10.5281/zenodo.23072343
Primary Topic
Computational Geometry and Mesh Generation
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

A Negative Answer to a Question of Santos on the Dual Diameter of Surfaces with Boundary

Alper Ferudun
Zenodo (CERN European Organization for Nuclear Research)
Computational Geometry and Mesh Generation
preprint

A Negative Answer to a Question of Santos on the Dual Diameter of Surfaces with Boundary

Alper Ferudun
preprint en

Abstract

Let f̄(2,n) be the maximum diameter of the dual graph of a triangulated surface with boundary on n vertices. At a 2012 Oberwolfach workshop, Santos asked whether f̄(2,n) ≤ n − 3. We show that the answer is no. A triangulation M₇ of the real projective plane minus two disjoint open discs has 7 vertices, 10 triangles and dual diameter 5. The same complex appears in work of Holmes on Stanley–Reisner rings with Serre's property (S₂), where it is not identified as a surface. Gluing copies of M₇ along boundary edges gives f̄(2,n) ≥ n − 3 + ⌊(n − 2)/5⌋ for all n ≥ 3, so the excess over n − 3 is unbounded. An orientable surface of genus 2 with 10 vertices and dual diameter 8 gives the bound n − 3 + ⌊(n − 2)/8⌋ for orientable surfaces. A short layering argument shows f̄(2,n) ≤ max(n − 3, 2n − 8), and a theorem of Holmes gives max(2n − 10, n − 2). Computer searches with DRAT-certified unsatisfiability proofs, confirmed by an exhaustive enumeration of the surfaces with at most 10 vertices, show that f̄(2,n) = n − 3 for n ≤ 6 and f̄(2,n) = n − 2 for 7 ≤ n ≤ 10 (for 6 ≤ n ≤ 9 these values also follow from results of Holmes), that M₇ is the only counterexample with at most 7 vertices, and that orientable surfaces with at most 9 vertices satisfy the bound. This is an unrefereed note. Unrefereed preprint released for independent mathematical scrutiny. Publication on Zenodo does not constitute peer review. AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text. Corpus identifier: OWR-11786-023 (Oberwolfach Reports 24/2012, "Triangulations", problem session, problem 9 by F. Santos).

Zenodo (CERN European Organization for Nuclear Research)
Computational Geometry and Mesh Generation
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.