Counting geodesics between surface triangulations

08/10/2023
by   Hugo Parlier, et al.
0

Given a surface Σ equipped with a set P of marked points, we consider the triangulations of Σ with vertex set P. The flip-graph of Σ whose vertices are these triangulations, and whose edges correspond to flipping arcs appears in the study of moduli spaces and mapping class groups. We consider the number of geodesics in the flip-graph of Σ between two triangulations as a function of their distance. We show that this number grows exponentially provided the surface has enough topology, and that in the remaining cases the growth is polynomial.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/29/2021

Counting orientations of graphs with no strongly connected tournaments

Let S_k(n) be the maximum number of orientations of an n-vertex graph G ...
research
03/30/2020

Subgraph densities in a surface

Given a fixed graph H that embeds in a surface Σ, what is the maximum nu...
research
02/26/2019

On Ramsey numbers of hedgehogs

The hedgehog H_t is a 3-uniform hypergraph on vertices 1,...,t+t2 such t...
research
03/08/2021

A Fully Polynomial Parameterized Algorithm for Counting the Number of Reachable Vertices in a Digraph

We consider the problem of counting the number of vertices reachable fro...
research
07/20/2021

Non-existence of annular separators in geometric graphs

Benjamini and Papasoglou (2011) showed that planar graphs with uniform p...
research
02/05/2018

The Sea Exploration Problem: Data-driven Orienteering on a Continuous Surface

This paper describes a problem arising in sea exploration, where the aim...
research
10/04/2021

An impossible utopia in distance geometry

The Distance Geometry Problem asks for a realization of a given weighted...

Please sign up or login with your details

Forgot password? Click here to reset