Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2201.11185 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909315295608832 |
|---|---|
| author | Dougherty, Michael |
| author_facet | Dougherty, Michael |
| contents | The tree complex is a simplicial complex defined in recent work of Belk, Lanier, Margalit, and Winarski with natural applications to mapping class groups and complex dynamics. In this article, we connect this setting with the study of certain convex polytopes: 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2201_11185 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | The Polyhedral Tree Complex Dougherty, Michael Combinatorics Geometric Topology The tree complex is a simplicial complex defined in recent work of Belk, Lanier, Margalit, and Winarski with natural applications to mapping class groups and complex dynamics. In this article, we connect this setting with the study of certain convex polytopes: 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. |
| title | The Polyhedral Tree Complex |
| topic | Combinatorics Geometric Topology |
| url | https://arxiv.org/abs/2201.11185 |