vix.ing · top · new · best · stats · spec

Local geometry of the k-curve graph

2015/08/03 by Aougab, Tarik
#Combinatorics (math.CO) #FOS: Mathematics #Geometric Topology (math.GT)

paper · doi:10.48550/arxiv.1508.00502

Abstract

Let S be an orientable surface with negative Euler characteristic. For k ∈ ℕ, let Ck(S) denote the k-curve graph, whose vertices are isotopy classes of essential simple closed curves on S, and whose edges correspond to pairs of curves that can be realized to intersect at most k times. The theme of this paper is that the geometry of Teichmüller space and of the mapping class group captures local combinatorial properties of Ck(S). Using techniques for measuring distance in Teichmüller space, we obtain upper bounds on the following three quantities for large k: the clique number of Ck(S) (exponential in k, which improves on all previously known bounds and which is essentially sharp); the maximum size of the intersection, whenever it is finite, of a pair of links in Ck (quasi-polynomial in k); and the diameter in C0(S) of a large clique in Ck(S) (uniformly bounded). As an application, we obtain quasi-polynomial upper bounds, depending only on the topology of S, on the number of short simple closed geodesics on any square-tiled surface homeomorphic to S.

Related