A Carousel Property for Compact Convex Sets
Yiming Song
TL;DR
The authors generalize the weak carousel rule from disks in a triangle to arbitrary compact convex sets A_0,A_1 contained in a convex n-gon G, showing that if the number s of common supporting lines is less than n, then there exist i∈{0,1} and j∈{1,...,n} with A_i ⊆ Conv(A_{1−i}, Vert(G)\{g_j}). They develop a geometric framework based on support functions, common supporting lines, sectors, and slide-turning to control how sectors can expand and intersect G’s boundary, enabling a combinatorial-geometric proof that yields the desired containment. The main result subsumes and extends Adaricheva–Bolat and Czédli’s work, provides sharpness for even n, and yields corollaries for algebraic-curve boundaries and ellipses; the paper also raises several open questions about odd n, higher-dimensional analogues, and convex-hull generalizations. Overall, the work advances understanding of how complex convex shapes interact inside polygonal envelopes and informs representation questions for convex geometries.
Abstract
We prove that if $A_0$ and $A_1$ are compact convex sets contained in a convex $n$-gon with vertices $g_1, \dots, g_n$, and $n$ is strictly greater than the number of common supporting lines of $A_0$ and $A_1$, then there exist $i \in \{0,1\}$ and $j \in \{1,\dots, n\}$ such that $A_i$ is in the convex hull of $A_{1-i}$ and $(\{g_1, \dots, g_n\} \setminus \{g_j\})$. This recovers and generalizes previous results of Adaricheva--Bolat and Cz{é}dli. We also show that this bound is sharp for even $n$.
