A Discrete Isoperimetric Problem
暂无分享,去创建一个
We prove that the perimeter of any convex n-gons of diameter 1 is at most n2nsin (π/2n). Equality is attained here if and only if n has an odd factor. In the latter case, there are (up to congruence) only finitely many extremal n-gons. In fact, the convex n-gons of diameter 1 and perimeter n2n sin (π/2n) are in bijective correspondence with the solutions of a diophantine problem.
[1] V. Boltjansky,et al. Results and Problems in Combinatorial Geometry , 1985 .
[2] R. V. Benson. Euclidean Geometry and Convexity , 1966 .
[3] K. Reinhardt. Extremale Polygone gegebenen Durchmessers. , 1922 .
[4] Kenneth Falconer,et al. Unsolved Problems In Geometry , 1991 .