Related papers: Counting geodesics between surface triangulations

This article is about measuring and visualizing distances between domino tilings. Given two tilings of a simply connected square tiled surface, we're interested in the minimum number of flips between two tilings. Given a certain shape,…

A complete treatment of the intersections of two geodesics on the surface of an ellipsoid of revolution is given. With a suitable metric for the distances between intersections, bounds are placed on their spacing. This leads to fast and…

A piecewise flat Finsler metric on a triangulated surface $M$ is a metric whose restriction to any triangle is a flat triangle in some Minkowski space with straight edges. One of the main purposes of this work is to study the properties of…

We show that every triangulation (maximal planar graph) on $n\ge 6$ vertices can be flipped into a Hamiltonian triangulation using a sequence of less than $n/2$ combinatorial edge flips. The previously best upper bound uses $4$-connectivity…

Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in…

In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and…

For a compact surface $S$ with constant negative curvature $-\kappa$ (for some $\kappa>0$) and genus $g\geq2$, we show that the tails of the distribution of $i(\alpha,\beta)/l(\alpha)l(\beta)$ (where $i(\alpha,\beta)$ is the intersection…

The aim of the paper is to attach a noncommutative cluster-like structure to each marked surface $\Sigma$. This is a noncommutative algebra ${\mathcal A}_\Sigma$ generated by "noncommutative geodesics" between marked points subject to…

We consider the geodesic flow of a compact connected rank 1 surface. We prove a formula for the topological pressure as the exponential growth rate of rank 1 periodic geodesics generalizing a previous result of K. Gelfert and B. Schapira…

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…

A triangulation of a point configuration is regular if it can be given by a height function, that is every point gets lifted to a certain height and projecting the lower convex hull gives the triangulation. Checking regularity of a…

In this note we show that for any hyperbolic surface S, the number of geodesics of length bounded above by L in the mapping class group orbit of a fixed closed geodesic with a single double point is asymptotic to L raised to the dimension…

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…

We study the geodesics on an invariant surface of a three dimensional Riemannian manifold. The main results are: the characterization of geodesic orbits; a Clairaut's relation and its geometric interpretation in some remarkable three…

We establish the background for the study of geodesics on noncompact polygonal surfaces. For illustration, we study the recurrence of geodesics on $Z$-periodic polygonal surfaces. We prove, in particular, that almost all geodesics on a…

We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

Flips in triangulations of convex polygons arise in many different settings. They are isomorphic to rotations in binary trees, define edges in the 1-skeleton of the Associahedron and cover relations in the Tamari Lattice. The complexity of…

The paper concerns lattice triangulations, that is, triangulations of the integer points in a polygon in $\mathbb{R}^2$ whose vertices are also integer points. Lattice triangulations have been studied extensively both as geometric objects…

We consider triangulations of closed surfaces in which every vertex is incident to exactly $d$ edges. These triangulations can be identified with subgroups of the triangle group $\langle a,b,c\mid a^2,b^2,c^2,(ab)^3,(ac)^2,(bc)^d\rangle$…

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…