Exact Reachability under Vertex- and Area-Centroid Control
Abstract
A vertex-centroid move slides one vertex of a polygon along the line through it and the centroid of all vertices; Problem 60 of The Open Problems Project asks whether such moves can make every polygon regular. We prove that two simple labeled n-gons, with straight angles allowed, are joined through simple polygons by finitely many positive moves exactly when they have the same orientation; a nonconstant move is positive if the vertex remains on the same side of the centroid of the other vertices. The same holds for flows toward or away from the instantaneous area centroid. Inward-only or outward-only moves reach every target of the same orientation up to translation and positive scaling. The common mechanism is a first-order criterion: a symmetric definite center response makes the one-vertex fields of a smooth affine-equivariant center bracket generating. The response is a weighted covariance for point barycenters and (d+2) times the volume covariance for polyhedral centroids. Once translation and scale are factored out, the fields sum to zero, giving exact one-sided control. We resolve Problem 60 under both conventions for a vertex at the centroid. For the vertex-centroid system on n affinely spanning points in ℝd, we classify positive-move reachability and prove a local 3dn-move bound.
Related
- Reachability and exact controllability of linear Stieltjes differential systems
- Exact Realization of Edge and Induced Three-Vertex Subgraph Counts
- The Last Isolated Vertex in Random-Order Uncovering of Cycles and Their Powers: Exact Enumeration and Weibull Limits
- Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles
- A positive solution to the Lp projection centroid conjecture
BibTeX
@misc{guan2026exact,
title = {{Exact Reachability under Vertex- and Area-Centroid Control}},
author = {Yongjie Guan},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2607.22981},
eprint = {2607.22981},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2607.22981},
}
RIS
TY - UNPB
TI - Exact Reachability under Vertex- and Area-Centroid Control
AU - Yongjie Guan
PY - 2026
DA - 2026/10/23
PB - arXiv
DO - 10.48550/arxiv.2607.22981
UR - https://arxiv.org/abs/2607.22981
AB - A vertex-centroid move slides one vertex of a polygon along the line through it and the centroid of all vertices; Problem 60 of The Open Problems Project asks whether such moves can make every polygon regular. We prove that two simple labeled n-gons, with straight angles allowed, are joined through simple polygons by finitely many positive moves exactly when they have the same orientation; a nonconstant move is positive if the vertex remains on the same side of the centroid of the other vertices. The same holds for flows toward or away from the instantaneous area centroid. Inward-only or outward-only moves reach every target of the same orientation up to translation and positive scaling. The common mechanism is a first-order criterion: a symmetric definite center response makes the one-vertex fields of a smooth affine-equivariant center bracket generating. The response is a weighted covariance for point barycenters and (d+2) times the volume covariance for polyhedral centroids. Once translation and scale are factored out, the fields sum to zero, giving exact one-sided control. We resolve Problem 60 under both conventions for a vertex at the centroid. For the vertex-centroid system on n affinely spanning points in ℝ^d, we classify positive-move reachability and prove a local 3dn-move bound.
ER -