A discrete four vertex theorem (Q2427430)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5274031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A discrete four vertex theorem |
scientific article; zbMATH DE number 5274031 |
Statements
A discrete four vertex theorem (English)
0 references
13 May 2008
0 references
First, a new proof is presented for the classical four vertex theorem, using methods which may be applied also to the discrete version of the theorem. Next, an analogue (due to H. Guggenheimer) of the smooth four vertex theorem is formulated, preparing the discrete reformulation. Finally, the following discrete four vertex theorem is proved: If \(\gamma\) is a simple closed, locally regular plane polygon whose vertices are not on a circle, then the discrete curvature of \(\gamma\) has at least two local maxima and at least two local minima. The ideas presented in the paper may be fruitful in several directions.
0 references
four vertex theorem
0 references
polygons
0 references
discrete curvature
0 references
0.9002038836479187
0 references
0.8974653482437134
0 references
0.8537037372589111
0 references