An explicit concentric annular construction produces isometric fillings of C_n with at most (1/6 + o(1))n² vertices, proving D* ≤ 1/6.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.DG 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
An Upper Bound for Discrete Isometric Filling of Cycles
An explicit concentric annular construction produces isometric fillings of C_n with at most (1/6 + o(1))n² vertices, proving D* ≤ 1/6.