pith. sign in

arxiv: 1109.6338 · v2 · pith:EPGTFVMMnew · submitted 2011-09-28 · 🧮 math.GT · math.MG

Spheres in the curve complex

classification 🧮 math.GT math.MG
keywords complexcurvespheresaveragingdistancemetricpointspossible
0
0 comments X
read the original abstract

In this paper we study the geometry of metric spheres in the curve complex of a surface, with the goal of determining the "average" distance between points on a given sphere. Averaging is not technically possible because metric spheres in the curve complex are countably infinite and do not support any invariant probability measures. To make sense of the idea of averaging, we instead develop definitions of null and generic subsets in a way that is compatible with the topological structure of the curve complex. With respect to this notion of genericity, we show that pairs of points on a sphere of radius R almost always have distance exactly 2R apart, which is as large as possible.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.