Related papers: Geodesic nets with three boundary vertices
The geometry of closed surfaces equipped with a Euclidean metric with finitely many conical points of arbitrary angle is studied. The main result is that the set of closed geodesics is dense in the space of geodesics.
To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every n-vertex geometric planar graph can be untangled while…
We prove that for every $\Q$-homological Finsler 3-sphere $(M,F)$ with a bumpy and irreversible metric $F$, either there exist two non-hyperbolic prime closed geodesics, or there exist at least three prime closed geodesics.
We give examples of rank one compact surfaces on which there exist recurrent geodesics that cannot be shadowed by periodic geodesics. We build rank one compact surfaces such that ergodic measures on the unit tangent bundle of the surface…
We obtain an important generalization of the inverse weighted Fermat-Torricelli problem for tetrahedra in R^3 by assigning at the corresponding weighted Fermat-Torricelli point a remaining positive number (residual weight). As a…
We prove that bounded solutions to an overdetermined fully nonlinear free boundary problem in the plane are one dimensional. Our proof relies on maximum principle techniques and convexity arguments.
We discuss the existence of the angle between two curves in Teichm\"uller spaces and show that, in any infinite dimensional Teichm\"uller space, there exist infinitely many geodesic triangles each of which has the same three vertices and…
This is a study of a problem in geodesy with methods from complex algebraic geometry: for a fixed number of measure points and target points at unknown position in the Euclidean plane, we study the problem of determining their relative…
A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining…
Consider a broken geodesics $\alpha([0,l])$ on a compact Riemannian manifold $(M,g)$ with boundary of dimension $n\geq 3$. The broken geodesics are unions of two geodesics with the property that they have a common end point. Assume that for…
We prove that the asymptotic completion of a developable M\"obius strip in Euclidean three-space must have at least one singular point other than cuspidal edge singularities. Moreover, if the strip contains a closed geodesic, then the…
We prove that a closed, simply connected, positively curved, cohomogeneity-three manifold whose quotient space has no boundary is rationally elliptic, thus providing a generalization of similar results regarding rational ellipticity of…
A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…
We find an upper bound for geodesic distances associated to monotone Riemannian metrics on positive definite matrices and density matrices.
We show that the abelian girth of a graph is at least three times its girth. We prove an analogue of the Moore bound for the abelian girth of regular graphs, where the degree of the graph is fixed and the number of vertices is large. We…
In this paper, we prove that for every Finsler $4$-dimensional sphere $(S^4,F)$ with reversibility $\lambda$ and flag curvature $K$ satisfying $\frac{25}{9}\left(\frac{\lambda}{1+\lambda}\right)^2<K\le 1$ with $\lambda<\frac{3}{2}$, either…
A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…
In this paper, we give the sharp upper bound for the number of vertices with positive curvature in a planar graph with nonnegative combinatorial curvature. Based on this, we show that the automorphism group of a planar---possibly…
We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…
We explore a connection between geodesic nets and quantum graphs optimising certain functionals from spectral theory. For surfaces, critical metrics for the normalised $k^{\mathrm{th}}$ eigenvalue of the Laplacian give rise to isometric…