A note on the maximal perimeter and maximal width of a convex small polygon
Abstract
The polygon P is small if its diameter equals one. When n=2s, it is still an open problem to find the maximum perimeter or the maximum width of a small n-gon. Motivated by Bingane's series of works, we improve the lower bounds for the maximum perimeter and the maximum width.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.