On the maximum area of inscribed polygons
Abstract
Given a convex -gon and a positive integer such that , let denote the largest area convex -gon contained in . We are interested in the minimum value of , the ratio of the areas of these two polygons. More precisely, given positive integers and , with , define \begin{equation*} f_n(m)=\min_{P\in \mathcal {P}_n} \max_{Q \subset P,|Q|=m} \frac{\Delta(Q)}{\Delta(P)} \end{equation*} where the maximum is taken over all -gons contained in , and the minimum is taken over , the entire class of convex -gons. The values of , and are known. In this paper we compute the values of , and . In addition, we prove that for all we have \begin{equation*} \frac{4}{n}\cdot\sin^2\left(\frac{\pi}{n}\right)\le 1-f_n(n-1)\le \min\left(\frac{1}{n}, \frac{4}{n}\cdot\sin^2\left(\frac{2\pi}{n}\right)\right). \end{equation*} These bounds can be used to improve the known estimates for .
Cite
@article{arxiv.2104.12172,
title = {On the maximum area of inscribed polygons},
author = {Dan Ismailescu and Min Jung Kim and Eric Wang},
journal= {arXiv preprint arXiv:2104.12172},
year = {2021}
}
Comments
15 pages, 3 figures