The fence conjecture for convex projective polygons
Abstract
We prove the fence conjecture of Dumas and Wolf: for a convex projective polygon with at least five vertices, every zero of the Pick differential lies in the interior of the region obtained by cutting off the triangles at consecutive triples of vertices. The proof gives a stronger estimate for arbitrary properly convex domains. In affine-sphere coordinates normalized at a Pick zero, the domain contains the closed disk of radius 2−1/4 and its closure lies in the open disk of radius 21/4, unless it is a rotated square. The proof compares the canonical Monge-Ampère potential of the domain with that of a normalized square. Their third-order contact gives alternating local sign sectors. A planar separation argument and the maximum principle show that the negative sectors belong to four distinct components, each meeting a different side of the square. Rotation gives the inner disk bound, and conormal duality gives the outer bound. Both constants are optimal for the class of properly convex domains normalized at a Pick zero. The argument requires neither boundary smoothness nor any restriction on the multiplicity of the Pick zero.
Related
- The Pólya--Szegő conjecture for convex polygons with many sides
- On weighted partial triangulations of convex polygons
- A Combinatorial Benders Decomposition Framework for Two-Dimensional Irregular Bin Packing Problems with Convex Polygons
- Proof of the local version of the Pólya--Szegö conjecture for the torsional rigidity of polygons
- Thermodynamic Formalism on SRB Measures of Compact Convex Projective manifolds, Geometry and Counting
BibTeX
@misc{wang2026fence,
title = {{The fence conjecture for convex projective polygons}},
author = {Erxiao Wang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.19664},
eprint = {2610.19664},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.19664},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - The fence conjecture for convex projective polygons
AU - Erxiao Wang
PY - 2026
DA - 2026/10/14
PB - arXiv
DO - 10.48550/arxiv.2610.19664
UR - https://arxiv.org/abs/2610.19664
AB - We prove the fence conjecture of Dumas and Wolf: for a convex projective polygon with at least five vertices, every zero of the Pick differential lies in the interior of the region obtained by cutting off the triangles at consecutive triples of vertices. The proof gives a stronger estimate for arbitrary properly convex domains. In affine-sphere coordinates normalized at a Pick zero, the domain contains the closed disk of radius 2^−1/4 and its closure lies in the open disk of radius 2^1/4, unless it is a rotated square. The proof compares the canonical Monge-Ampère potential of the domain with that of a normalized square. Their third-order contact gives alternating local sign sectors. A planar separation argument and the maximum principle show that the negative sectors belong to four distinct components, each meeting a different side of the square. Rotation gives the inner disk bound, and conormal duality gives the outer bound. Both constants are optimal for the class of properly convex domains normalized at a Pick zero. The argument requires neither boundary smoothness nor any restriction on the multiplicity of the Pick zero.
ER -