On the maximum area of inscribed polygons
Abstract
Given a convex n-gon P and a positive integer m such that 3 m n-1, let Q denote the largest area convex m-gon contained in P. We are interested in the minimum value of (Q)/(P), the ratio of the areas of these two polygons. More precisely, given positive integers n and m, with 3 m n-1, define equation* fn(m)=P∈ Pn Q ⊂ P,|Q|=m (Q)(P) equation* where the maximum is taken over all m-gons contained in P, and the minimum is taken over Pn, the entire class of convex n-gons. The values of f4(3), f5(4) and f6(3) are known. In this paper we compute the values of f5(3), f6(5) and f6(4). In addition, we prove that for all n 6 we have equation* 4n·2(πn) 1-fn(n-1) (1n, 4n·2(2πn)). equation* These bounds can be used to improve the known estimates for fn(m).
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.