Skip to main content
eScholarship
Open Access Publications from the University of California

Combinatorial Theory

Combinatorial Theory banner

The polyhedral tree complex

Published Web Location

https://doi.org/10.5070/C62359156Creative Commons 'BY' version 4.0 license
Abstract

The tree complex is a simplicial complex defined in recent work of Belk, Lanier, Margalit, and Winarski with applications to mapping class groups and complex dynamics. This article introduces a connection between this setting and the convex polytopes known as associahedra and cyclohedra. Specifically, we describe a characterization of these polytopes using planar embeddings of trees and show that the tree complex is the barycentric subdivision of a polyhedral cell complex for which the cells are products of associahedra and cyclohedra.

Mathematics Subject Classifications: 05C05, 05C10, 20F65, 52B11

Keywords: Associahedra, cyclohedra, planar trees, mapping class groups

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View