Every graph is a cut locus (Q500097): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Jin-ichi Itoh / rank | |||
Property / author | |||
Property / author: Jin-ichi Itoh / rank | |||
Normal rank | |||
Property / review text | |||
This short and elegant paper shows that every connected length graph can be realized (isometrically) as the cut locus of a point on a closed Riemannian surface. Moreover, if the graph is cyclic and regular, then this surface can be arranged to have constant curvature. Finally, the stability and generic behavior of this realization are also studied. The proof of the main result is by induction on the number of generating cycles of the graph, and uses a deformation result of \textit{A. D. Weinstein} [Ann. Math. (2) 87, 29--41 (1968; Zbl 0159.23902)]. | |||
Property / review text: This short and elegant paper shows that every connected length graph can be realized (isometrically) as the cut locus of a point on a closed Riemannian surface. Moreover, if the graph is cyclic and regular, then this surface can be arranged to have constant curvature. Finally, the stability and generic behavior of this realization are also studied. The proof of the main result is by induction on the number of generating cycles of the graph, and uses a deformation result of \textit{A. D. Weinstein} [Ann. Math. (2) 87, 29--41 (1968; Zbl 0159.23902)]. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Renato G. Bettiol / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 53C22 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C62 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6491869 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
cut locus | |||
Property / zbMATH Keywords: cut locus / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph | |||
Property / zbMATH Keywords: graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Riemannian geometry | |||
Property / zbMATH Keywords: Riemannian geometry / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1898586754 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1103.1759 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 15:30, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Every graph is a cut locus |
scientific article |
Statements
Every graph is a cut locus (English)
0 references
8 October 2015
0 references
This short and elegant paper shows that every connected length graph can be realized (isometrically) as the cut locus of a point on a closed Riemannian surface. Moreover, if the graph is cyclic and regular, then this surface can be arranged to have constant curvature. Finally, the stability and generic behavior of this realization are also studied. The proof of the main result is by induction on the number of generating cycles of the graph, and uses a deformation result of \textit{A. D. Weinstein} [Ann. Math. (2) 87, 29--41 (1968; Zbl 0159.23902)].
0 references
cut locus
0 references
graph
0 references
Riemannian geometry
0 references