arXiv:1109.2952 Abstract | arXiv Analytics

arXiv:1109.2952 [math.GT]Abstract References Reviews Resources

Upper bound on distance in the pants complex

Published 2011-09-13, updated 2012-05-02Version 4

The purpose of this paper is to establish an upper bound on the distance between two pants decompositions in the pants complex for a closed surface of genus g >= 2. This is done by use of graph theory. First distance is found in the pants graph modulo the action of the mapping class group, and then between pants decompositions within an orbit of this action.

Comments: A different method is used to find an upper bound on the diameter of the orbit graph, giving a smaller upper bound. Also, distance within an orbit is now calculated in a different orbit

Categories: math.GT

Subjects: 57M50, 57M15

Keywords: pants complex, upper bound, pants decompositions, pants graph modulo, graph theory

Related articles: Most relevant | Search more

arXiv:math/0312385 [math.GT] (Published 2003-12-19)

The Pants Complex Has Only One End

Howard Masur, Saul Schleimer

arXiv:math/0702837 [math.GT] (Published 2007-02-27)

Constructing convex planes in the pants complex

Javier Aramayona, Hugo Parlier, Kenneth J. Shackleton

arXiv:1106.1472 [math.GT] (Published 2011-06-07, updated 2011-10-31)

Separating Pants Decompositions in the Pants Complex