A Composition Law for Local Defect Counting on Triangulated Surfaces

On a finite triangulated surface, let ι_≺ (v)=1-1/2 s_≺ (v), where s_≺ (v) counts the faces in which v is the median of its three vertices under a linear order ≺ on the vertices. Then ∑_v ι_≺ (v)=χ+1/2 n_∂ for every ≺, and the boundary coefficient -1/2 is forced rather than conventional. We give the two-line derivation, then prove a composition law: cutting the surface into blocks along paths or loops, the blockwise sums exceed χ+1/2 n_∂ by exactly the total number of distinct cut vertices, so the cut's own topology cancels and no global coordination is required. We then split the sum into a valence part and an order defect, prove that the order defect is supported only on faces straddling a frontier and therefore that an exact fragment readout costs O("perimeter"), and show that what a region carries is exactly its own valence deficit. The frontier sum then collapses to a signed census of frontier vertices: this gives a sharp worst case of N/4 on a balanced frontier, which is attained, so no sublinear deterministic bound exists, together with a square-root law in probability for random orders. We close with a regional index theorem: the ambient index summed over an arbitrary vertex set equals the Euler characteristic of the sub-complex that set induces, plus half the part of its boundary that lies on the ambient boundary, plus half a frontier turn count; and for two overlapping regions the inclusion-exclusion defect is itself a signed census of the cells on the band between them, so hierarchical decompositions cost the band and never sum an interior twice. Finally we record the three conditions under which the method fails — non-triangular faces, fixed-width accumulators, and residual (potential) formulations — each with an explicit statement of what breaks and a measurement.The closed-surface identity is Banchoff's (1967) and is not claimed as new. A final section logs the failed routes and the two errors found by our own checks.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-20
DOI
https://doi.org/10.5281/zenodo.24403089
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Composition Law for Local Defect Counting on Triangulated Surfaces

GenMin Li
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

A Composition Law for Local Defect Counting on Triangulated Surfaces

GenMin Li
preprint en

Abstract

On a finite triangulated surface, let ι_≺ (v)=1-1/2 s_≺ (v), where s_≺ (v) counts the faces in which v is the median of its three vertices under a linear order ≺ on the vertices. Then ∑_v ι_≺ (v)=χ+1/2 n_∂ for every ≺, and the boundary coefficient -1/2 is forced rather than conventional. We give the two-line derivation, then prove a composition law: cutting the surface into blocks along paths or loops, the blockwise sums exceed χ+1/2 n_∂ by exactly the total number of distinct cut vertices, so the cut's own topology cancels and no global coordination is required. We then split the sum into a valence part and an order defect, prove that the order defect is supported only on faces straddling a frontier and therefore that an exact fragment readout costs O("perimeter"), and show that what a region carries is exactly its own valence deficit. The frontier sum then collapses to a signed census of frontier vertices: this gives a sharp worst case of N/4 on a balanced frontier, which is attained, so no sublinear deterministic bound exists, together with a square-root law in probability for random orders. We close with a regional index theorem: the ambient index summed over an arbitrary vertex set equals the Euler characteristic of the sub-complex that set induces, plus half the part of its boundary that lies on the ambient boundary, plus half a frontier turn count; and for two overlapping regions the inclusion-exclusion defect is itself a signed census of the cells on the band between them, so hierarchical decompositions cost the band and never sum an interior twice. Finally we record the three conditions under which the method fails — non-triangular faces, fixed-width accumulators, and residual (potential) formulations — each with an explicit statement of what breaks and a measurement.The closed-surface identity is Banchoff's (1967) and is not claimed as new. A final section logs the failed routes and the two errors found by our own checks.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
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
A Composition Law for Local Defect Counting on Triangulated Surfaces — GenMin Li · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS