Upper bound on distance in the pants complex

2011/09/13 by Harriet H. Moser, Moser, Harriet H. · 1 citation
Computer Science · Mathematics · #57M50 (Primary) 57M15 (Secondary) #Advanced Combinatorial Mathematics #FOS: Mathematics #Geometric Topology (math.GT) #Geometric and Algebraic Topology #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.1109.2952

openalex publication_date 2011/09/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Cited by

• Compressed data structures for Heegaard splittings

Related

• The Pants Complex Has Only One End
• Bounds for the number of moves between pants decompositions, and between triangulations
• Estimating the distances between hyperbolic structures in the moduli space
• The automorphism group of the pants complex
• Pants Decompositions of Surfaces