Related papers: Shortest k-Geodesics on Hyperbolic Surfaces

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

In arrangements of pseudocircles (Jordan curves) the weight of a vertex (intersection point) is the number of pseudocircles that contain the vertex in its interior. We give improved upper bounds on the number of vertices of weight <=k in…

In the early 2000s, Frigerio, Martelli, and Petronio studied $3$-manifolds of smallest combinatorial complexity that admit hyperbolic structures. As part of this work they defined and studied the class $M_{g,k}$ of smallest complexity…

We establish sharp universal upper bounds on the length of the shortest closed geodesic on a punctured sphere with three or four ends endowed with a complete Riemannian metric of finite area. These sharp curvature-free upper bounds are…

We study configurations of immersed curves in surfaces and surfaces in 3-manifolds. Among other results, we show that primitive curves have only finitely many configurations which minimize the number of double points. We give examples of…

We give the asymptotic growth of the number of (multi-)arcs of bounded length between boundary components on complete finite-area hyperbolic surfaces with boundary. Specifically, if $S$ has genus $g$, $n$ boundary components and $p$…

The geodesic complexity of a length space $X$ quantifies the required number of case distinctions to continuously choose a shortest path connecting any given start and end point. We prove a local lower bound for the geodesic complexity of…

Given a closed geodesic on a compact arithmetic hyperbolic surface, we show the existence of a sequence of Laplacian eigenfunctions whose integrals along the geodesic exhibit nontrivial growth. Via Waldspurger's formula we deduce a lower…

Intersection graphs of planar geometric objects such as intervals, disks, rectangles and pseudo-disks are well studied. Motivated by various applications, Butman et al. in SODA 2007 considered algorithmic questions in intersection graphs of…

It has been shown beneficial for many types of data which present an underlying hierarchical structure to be embedded in hyperbolic spaces. Consequently, many tools of machine learning were extended to such spaces, but only few…

We construct a weakly complete flat surface in hyperbolic 3-space having a pair of hyperbolic Gauss maps both of whose images are contained in an arbitrarily given open disc in the ideal boundary of H^3. This construction is accomplished as…

This paper is about closed hyperbolic surface amalgams with a focus on the growth of the number of closed geodesics. As in the case of surfaces, we show that topological and volume entropies coincide, but we show stark differences in how…

The topological (resp. geodesic) complexity of a topological (resp. metric) space is roughly the smallest number of continuous rules required to choose paths (resp. shortest paths) between any points of the space. We prove that the geodesic…

We study the time complexity of the discrete $k$-center problem and related (exact) geometric set cover problems when $k$ or the size of the cover is small. We obtain a plethora of new results: - We give the first subquadratic algorithm for…

We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by…

A closed quasigeodesic is a closed curve on the surface of a polyhedron with at most $180^\circ$ of surface on both sides at all points; such curves can be locally unfolded straight. In 1949, Pogorelov proved that every convex polyhedron…

In this article, we study geometric aspects of semi-arithmetic Riemann surfaces by means of number theory and hyperbolic geometry. First, we show the existence of infinitely many semi-arithmetic Riemann surfaces of various shapes and prove…

We show that if the edges or vertices of an undirected graph $G$ can be covered by $k$ shortest paths, then the pathwidth of $G$ is upper-bounded by a single-exponential function of $k$. As a corollary, we prove that the problem Isometric…

We give an identity involving sums of functions of lengths of simple closed geodesics, known as a McShane identity, on any non-orientable hyperbolic surface with boundary which generalises Mirzakhani's identities on orientable hyperbolic…

Motivated by the fact that in a space where shortest paths are unique, no two shortest paths meet twice, we study a question posed by Greg Bodwin: Given a geodetic graph $G$, i.e., an unweighted graph in which the shortest path between any…