A Four Vertex Theorem for Polygons
The author shows: Let \(P\) be a convex polygon with vertices \(A_1,\dots,A_n\) and let \(l_i\), \(i=1,\dots ,n\), be a line through \(A_i\) intersecting the interior of \(P\) and oriented inwards such that \(B_i:=l_i\cap l_{i+1}\) and \(B_i\neq B_{i+1}\). Denote by \(\alpha_i, \beta_i\) the angles between \(l_i\) and \(A_iA_{i+1}\) and \(A_iA_{i-1}\) inside the polygon and let furthermore \(\Pi _1^n\sin \alpha _i=\Pi _1^n\sin \beta _i\). Denote \(B_i\) a cusp vertex of the polygon \(Q=(B_1,\dots ,B_n)\) when \(B_{i-1}B_i\) and \(B_iB_{i+1}\) have different orientations with respect to the orientations of the \(l_i\). Then \(Q\) has at least 4 cusp vertices. The theorem generalizes a classical result which states that a closed smooth convex plane curve has at least 4 curvature extrema.
- Akempic triangulations with 4 odd vertices
- Theorem on four support vertices of a polygonal line
- Nowhere vanishing torsion closed curves always hide twice
- Curvature extrema and four-vertex theorems for polygons and polyhedra
- Discrete cycloids from convex symmetric polygons
- Centroaffine duality for spatial polygons
- Iterating evolutes and involutes
- Four Vertices of a Convex Space Curve
- The Four-Vertex Theorem Revisited--Two Variations on the Old Theme
- THE FOUR EQUILATERAL TRIANGLES CONNECTED WITH AN ARBITRARY TRIANGLE
- A discrete four vertex theorem for hyperbolic polygons
- Vertex classification of planar \(C\)-polygons
- Polygon vertex extremality and decomposition of polygons
- Affine properties of convex equal-area polygons
- A four-vertex theorem for polygons and its generalization to polytopes
This page was built for publication: A Four Vertex Theorem for Polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757517)
