Related papers: Counting statistics for geodesics on flat surfaces
We investigate the geometry of word metrics on fundamental groups of manifolds associated with the generating sets consisting of elements represented by closed geodesics. We ask whether the diameter of such a metric is finite or infinite.…
We study the statistics of edges and vertices in the vicinity of a reference vertex (origin) within random planar quadrangulations and Eulerian triangulations. Exact generating functions are obtained for theses graphs with fixed numbers of…
The paper is a study of geodesic in two-dimensional pseudo-Riemannian metrics. Firstly, the local properties of geodesics in a neighborhood of generic parabolic points are investigated. The equation of the geodesic flow has singularities at…
We consider the the intersections of the complex nodal set of the analytic continuation of an eigenfunction of the Laplacian on a real analytic surface with the complexification of a geodesic. We prove that if the geodesic flow is ergodic…
Motivated by the problem of counting finite BPS webs, we count certain immersed metric graphs, tripods, on the flat torus. Classical Euclidean geometry turns this into a lattice point counting problem in $\mathbb C^2$, and we give an…
This paper studies length estimates for trajectories on flat cone surfaces in terms of their self-intersection numbers. For an area-one flat cone surface, we obtain a lower bound for the length of a trajectory, with constants depending only…
We study geometric and topological properties of locally compact, geodesically complete spaces with an upper curvature bound. We control the size of singular subsets, discuss homotopical and measure-theoretic stratifications and regularity…
We solve a technical problem related to adeles on an algebraic surface. Given a finite set of natural numbers up to two, one associates an adelic group. We show that this operation commutes with taking intersections if the surface is…
Short geodesics are important in the study of the geometry and the spectra of Riemann surfaces. Bers' theorem gives a global bound on the length of the first $3g-3$ geodesics. We use the construction of Brooks and Makover of random Riemann…
We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…
We study the behaviour of geodesics on a Riemannian manifold near a generalized conical or cuspidal singularity. We show that geodesics entering a small neighbourhood of the singularity either hit the singularity or approach it to a…
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…
We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result extends well known enumerative formulae concerning lattice paths, and its derivation involves a classical…
We give a lower bound on the number of non-simple closed curves on a hyperbolic surface, given upper bounds on both length and self-intersection number. In particular, we carefully show how to construct closed geodesics on pairs of pants,…
We investigate the logarithmic convexity of the length of the level curves for harmonic functions on surfaces and related isoperimetric type inequalities. The results deal with smooth surfaces, as well as with singular Alexandrov surfaces…
We obtain sharp bounds for the number of n--cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. We prove sharp estimates on both the sum of k-th…
We work out the graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function $W(x,y)$ on the unit square, with $x$ and $y$ uniform on the interval $(0,1)$.…
A geometric graph is a graph whose vertices are points in general position in the plane and its edges are straight line segments joining these points. In this paper we give an $O(n^2 \log n)$ algorithm to compute the number of pairs of…
Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…
This note is about the geometry of the pants graph P(S), a natural simplicial graph associated to a finite type topological surface S where vertices represents pants decompositions. The main result in this note ascserts that for a…