Algebraic structures on graph associahedra
Stefan Forcey, Mar\'ia Ronco

TL;DR
This paper provides an algebraic framework for understanding graph associahedra, introducing operations on tubings that describe their face structures and connect to operadic categories, extending previous geometric and combinatorial insights.
Contribution
It introduces a substitution operation on tubings, enabling an algebraic description of graph associahedra as free objects generated by connected graphs.
Findings
Algebraic description of graph associahedra via substitution operations
Faces of graph-associahedra form a free object under these operations
Connection of substitution operations to operadic categories
Abstract
M. Carr and S. Devadoss introduced in [7] the notion of tubing on a finite simple graph , in the context of configuration spaces on the Hilbert plane. To any finite simple graph they associated a finite partially ordered set, whose elements are the tubings of and whose geometric realization is a convex polytope , the graph-associahedron. For the complete graphs they recovered permutahedra, for linear graphs they got Stasheff's associahedra, while for simple graph they obtained the standard simplexes. The goal of the present work is to give an \emph{algebraic} description of graph associahedra. We introduce a substitution operation on tubings, which allows us to describe the set of faces of graph-associahedra as a free object, spanned by the set of all connected simple graphs, under operations given via connected subgraphs. The boundary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHomotopy and Cohomology in Algebraic Topology · Advanced Topology and Set Theory · Advanced Topics in Algebra
