2000 character limit reached
Geodesic nets with three boundary vertices (1803.03728v3)
Published 10 Mar 2018 in math.MG, math.CO, and math.DG
Abstract: We prove that a geodesic net with three boundary (= unbalanced) vertices on a non-positively curved plane has at most one balanced vertex. We do not assume any a priori bound for the degrees of unbalanced vertices. The result seems to be new even in the Euclidean case. We demonstrate by examples that the result is not true for metrics of positive curvature on the plane, and that there are no immediate generalizations of this result for geodesic nets with four unbalanced vertices.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.