Related papers: Counting geodesics of given commutator length

A set of vertices $S$ of a graph $G$ is a geodetic set of $G$ if every vertex $v\not\in S$ lies on a shortest path between two vertices of $S$. The minimum cardinality of a geodetic set of $G$ is the geodetic number of $G$ and it is denoted…

If X is a geodesic metric space and $x_1,x_2,x_3\in X$, a {\it geodesic triangle} $T=\{x_1,x_2,x_3\}$ is the union of the three geodesics $[x_1x_2]$, $[x_2x_3]$ and $[x_3x_1]$ in $X$. The space $X$ is $\delta$-\emph{hyperbolic} $($in the…

This paper shows that many hyperbolic manifolds obtained by glueing arithmetic pieces embed into higher-dimensional hyperbolic manifolds as codimension-one totally geodesic submanifolds. As a consequence, many Gromov--Pyatetski-Shapiro and…

We show that the geodesic period spectrum of a Riemannian 2-orbifold all of whose geodesics are closed depends, up to a constant, only on its orbifold topology and compute it. In the manifold case we recover the fact proved by Gromoll,…

In this paper we study the asymptotic behavior of Weil-Petersson volumes of moduli spaces of hyperbolic surfaces of genus $g$ as $g \rightarrow \infty.$ We apply these asymptotic estimates to study the geometric properties of random…

Let $(M,g)$ be a closed Riemannian manifold and $\sigma$ be a closed 2-form on $M$ representing an integer cohomology class. In this paper, using symplectic reduction, we show how the problem of existence of closed magnetic geodesics for…

The study of random surfaces, especially in the asymptotics of large genus, has been of increasing interest in recent years. Many geometrical questions have analogous formulations in the theory of random graphs with a large number of…

Let $\Gamma$ be a lattice in $\mathrm{SO}_0(n, 1)$. We prove that if the associated locally symmetric space contains infinitely many maximal totally geodesic subspaces of dimension at least $2$, then $\Gamma$ is arithmetic. This answers a…

Let $S$ be a compact hyperbolic Riemann surface of genus $g \geq 2$. We call a systole a shortest simple closed geodesic in $S$ and denote by $\mathop{sys}(S)$ its length. Let $\mathop{msys(g)}$ be the maximal value that…

We study the distribution of closed geodesics for the modular surface. We improve the error term in the prime geodesic theorem, and obtain results on prime geodesics in very short intervals conditionally on the generalized Riemann…

For $\Gamma$ a cofinite Kleinian group acting on $\mathbb{H}^3$, we study the Prime Geodesic Theorem on $M=\Gamma \backslash \mathbb{H}^3$, which asks about the asymptotic behaviour of lengths of primitive closed geodesics (prime geodesics)…

We show that every word hyperbolic, surface-by-(noncyclic) free group Gamma is as rigid as possible: the quasi-isometry group of Gamma equals the abstract commensurator group Comm(Gamma), which in turn contains Gamma as a finite index…

In this paper we define the notion of $(p,\delta)$--Gromov hyperbolic space where we relax Gromov's {\it slimness} condition to allow that not all but a positive fraction of all triangles are $\delta$--slim. Furthermore, we study maximum…

We introduce a numerical invariant $\zeta(\Sigma)$ measuring the end-complexity of $\Sigma$ and use it to organize coarse-geometric features of Map($\Sigma$). Our main tool is the \emph{non-peripheral curve graph} $C_{\rm np}(\Sigma)$,…

A geodesic is a shortest path which connects a pair of vertices of a graph G. In this paper we define the geodesic subpath number gpn(G) of a graph G as the number of geodesics in G. The number of subtrees and subpaths are already studied…

Call a periodic map $h$ on the closed orientable surface $\Sigma_g$ extendable if $h$ extends to a periodic map over the pair $(S^3, \Sigma_g)$ for possible embeddings $e: \Sigma_g\to S^3$. We determine the extendabilities for all…

We study the asymptotic behaviour of 1-parameter subgroups with respect to Hofer's metric when the underlying symplectic manifold is an open surface of infinite area. We prove that, depending on the topology of the level sets of the…

An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that…

Given a hyperelliptic hyperbolic surface $S$ of genus $g \geq 2$, we find bounds on the lengths of homologically independent loops on $S$. As a consequence, we show that for any $\lambda \in (0,1)$ there exists a constant $N(\lambda)$ such…

A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…