The sharp local centering gap for symmetric decagons

For origin-symmetric planar polygons with at most ten actual extreme vertices, the sharp local coefficient of the centering gap W(K)-V(K), normalized by the square of the Banach-Mazur distance excess from the affine-regular hexagon, is 1/4. The result is a provisional candidate conditional on the stated hexagon premises and identified local results. A labelled-vertex limit argument and full-body containment repair give the upper bound, including multiscale approaches. Genuine decagons provide the matching iterated-limit lower bound. With the earlier all-body sharpness result, twelve is the minimum polygon vertex count that can approach the all-body coefficient. No exact unrestricted minimum, effective neighborhood or complete extremizer classification is asserted.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-06
DOI
https://doi.org/10.5281/zenodo.24026564
Citations
1
Primary Topic
Point processes and geometric inequalities
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The sharp local centering gap for symmetric decagons

Robert Barritz
1 citations
Zenodo (CERN European Organization for Nuclear Research)
Point processes and geometric inequalities
preprint

The sharp local centering gap for symmetric decagons

Robert Barritz
preprint en
1 citations

Abstract

For origin-symmetric planar polygons with at most ten actual extreme vertices, the sharp local coefficient of the centering gap W(K)-V(K), normalized by the square of the Banach-Mazur distance excess from the affine-regular hexagon, is 1/4. The result is a provisional candidate conditional on the stated hexagon premises and identified local results. A labelled-vertex limit argument and full-body containment repair give the upper bound, including multiscale approaches. Genuine decagons provide the matching iterated-limit lower bound. With the earlier all-body sharpness result, twelve is the minimum polygon vertex count that can approach the all-body coefficient. No exact unrestricted minimum, effective neighborhood or complete extremizer classification is asserted.

Zenodo (CERN European Organization for Nuclear Research)
Point processes and geometric inequalities
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