Area Problems Involving Kasner Polygons
Dan Ismailescu, Minsuk Kim, Kyung Jae Lee, Seong Hoon Lee, Taehyeun, Park

TL;DR
This paper investigates the area ratios of convex polygons and their Kasner descendants, providing a comprehensive analysis of how the area changes when vertices are placed at specific ratios along edges.
Contribution
It offers a complete characterization of the area ratio between a convex polygon and its Kasner descendant for any fixed ratio m and polygon size n.
Findings
Derived formulas for area ratios of Kasner polygons.
Established bounds for area ratios based on polygon shape.
Generalized results for polygons with any number of sides n.
Abstract
Sequences of polygons generated by performing iterative processes on an initial polygon have been studied extensively. One of the most popular sequences is the one sometimes referred to as {\it Kasner polygons}. Given a polygon , the first Kasner descendant of is obtained by placing the vertices of at the midpoints of the edges of . More generally, for any fixed in one may define a sequence of polygons where each polygon is obtained by dividing every edge of into the ratio in the counterclockwise (or clockwise) direction and taking these division points to be the vertices of . We are interested in the following problem {\it Let be a fixed number in and let be a fixed integer. Further, let be a convex -gon and denote by , the first -Kasner descendant of ,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · Advanced Combinatorial Mathematics · Point processes and geometric inequalities
