Convexly generic curves in \(\mathbb{R}^3\) (Q1108588): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00147797 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2089516527 / rank | |||
Normal rank |
Latest revision as of 08:39, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Convexly generic curves in \(\mathbb{R}^3\) |
scientific article |
Statements
Convexly generic curves in \(\mathbb{R}^3\) (English)
0 references
1988
0 references
The four vertex theorem for space curves has a long history. It was proved for curves on a convex surface by \textit{H. Mohrmann} [Sitzungsber., Bayer. Akad. Wiss., Math.-Phys. Kl. 1917, 1-3 (1917)], for strong notions of convexity of skew curves by \textit{B. Segre} [Mem. Accad. Ital. 7, 365- 397 (1936; Zbl 0015.36802), Rend. Mat., VI. Ser. 1, 237-297 (1968; Zbl 0185.24802)] (these two references are not mentioned by the author) and \textit{M. Barner} [Abh. Math. Semin. Univ. Hamb. 20, 196-215 (1956; Zbl 0071.15601)]. The author uses Morse functions to prove the theorem in the generic general case in the form: Total number of vertices \(=4+\) Total number of tritangent planes. For nonconvex curves, he obtains a counting formula for extremal vertices involving the singularities of the extremal set of the curve.
0 references
four vertex theorem
0 references
space curves
0 references
tritangent planes
0 references
extremal vertices
0 references