Stasheff Polytopes: Combinatorics & Geometry

• Stasheff polytopes are convex polytopes encoding associativity via full parenthetizations and triangulations, laying the combinatorial groundwork for operad theory.
• They are realized through various models, including order polytopes and nestohedra, and provide practical insights into configuration spaces and moduli tessellations.
• Their elegant structure, captured by the Tamari lattice and enumerative invariants like Narayana and Catalan numbers, links combinatorial geometry with algebraic applications.

Stasheff polytopes, also known as associahedra, are a distinguished family of simple convex polytopes that encode the combinatorics of associativity. Originally introduced in the context of homotopy theory to model iterated multiplications and their associativity constraints, these polytopes appear at the intersection of diverse areas: from operad theory and geometric combinatorics to configuration spaces, tropical and cluster geometry, and the algebraic and lattice theory of discrete structures. Each Stasheff polytope $K_n$ is uniquely determined (up to affine equivalence) by its face lattice, whose elements correspond to compatible collections of non-crossing diagonals in a convex polygon, partial bracketings of a product, or planar rooted trees. Their role as objects mediating between poset geometry, moduli spaces, canonical bases in cluster algebras, and integrable systems has led to a corpus of equivalent models and deep combinatorial and algebraic structure.

1. Foundational Definitions and Models

Stasheff polytopes admit multiple, combinatorially equivalent definitions:

• Polygonal/Bracketing Model: The $n$-dimensional Stasheff polytope $K_n$ has vertices indexed by full parenthetizations (bracketings) of a product of $n+2$ factors, or, equivalently, by the set of triangulations of a convex $(n+3)$-gon. More generally, each $k$-dimensional face corresponds to a partial bracketization (or partial triangulation), i.e., a maximal set of $n-k$ pairwise non-crossing diagonals in the polygon (Adaricheva, 2011).
• Poset-Polytope and Order Polytope Construction: For the chain poset $P=[n]=\{1<2<\cdots<n\}$, consider the order cone $$C(P) = \{x\in \mathbb{R}^n\ |\ x_1\leq x_2\leq\cdots\leq x_n\}$$ and the linear functional $\alpha_P(x) = \sum_{i=1}^{n-1}(x_{i+1}-x_i)$. The classical associahedron $n$0 (of dimension $n$1) is realized as the affine section $n$2, yielding the classical Stasheff polytope after an affine change of coordinates (Galashin, 2021).
• Nestohedra (Hypergraph Polytopes) Perspective: Viewing $n$3 as a nestohedron $n$4 via a building set $n$5 of all nonempty consecutive intervals in $n$6 (the path graph), the faces correspond to nested sets of intervals, generalizing the approach to arbitrary graphs and yielding variants such as the cyclohedron and permutohedron as limiting cases (Dosen et al., 2010).
• Loday’s Integer-Coodinate Realization and Inductive Constructions: Through explicit integer-weight coordinates derived from planar binary trees and conic inductive structures, Stasheff polytopes can be embedded into $n$7 as the convex hull of these tree-derived points (Basu et al., 2022).
• Tropical and Cluster Algebra Model: In the tropical positive space $n$8, Stasheff polytopes appear as Newton polytopes cut out by piecewise-linear inequalities associated to tropical Plücker functions (cluster variables), with facets parameterized by almost positive roots and vertices by integral laminations (weighted non-crossing diagonals) (Shen, 2011).
• Multiplihedron and Graph Cubic Realization: The face posets of certain degenerations of the multiplihedron and of graph cubeahedra for path graphs are combinatorially isomorphic to $n$9 (Basu et al., 2022).

2. Face Lattice, Combinatorics, and Enumerative Properties

The combinatorial structure of $K_n$0 is uniform across all realizations:

• Face Poset as Tamari Lattice: The faces of $K_n$1 are organized into a graded lattice (the Tamari lattice), with cover relations given by right-rotation moves (associativity steps) between bracketed words or by diagonal-flip operations in triangulations (Adaricheva, 2011).
• Explicit Face Enumeration: The $K_n$2-face count of $K_n$3 is given by the Narayana number:

$K_n$4

yielding $K_n$5, the $K_n$6st Catalan number, for vertices (Galashin, 2021, Dosen et al., 2010, Basu et al., 2022, Adaricheva, 2011).

• Compatibility and Nested Set Structure: Faces correspond to sets of mutually compatible diagonals (no two crossing), or, equivalently, to nested collections of path intervals. Codimension $K_n$7 faces correspond to partial triangulations with $K_n$8 missing diagonals (Basu et al., 2022, Dosen et al., 2010).
• Geometric Simplicity and Product Structure: $K_n$9 is a simple polytope, with normal fan coinciding with the type-$n+2$0 cluster fan. Each face is affinely equivalent to a product of smaller associahedra (Galashin, 2021).
• f- and h-Vector Properties: The $n+2$1-vector entries are Narayana numbers, and the unimodality and symmetry of these sequences reflects deep combinatorial symmetry (Galashin, 2021, Konoike, 2024).

3. Geometric Realizations and Polyhedral Models

Several explicit polyhedral and combinatorial realizations exist:

• Intersection of Halfspaces and Simplex Truncation: $n+2$2 can be represented as an intersection of the standard simplex in $n+2$3 with halfspaces corresponding to sums over consecutive variables, each encoding an interval. Truncating the simplex along these hyperplanes successively realizes Stasheff polytopes (Dosen et al., 2010).
• Inequality Description: Stasheff polytopes in $n+2$4 are given by the system:

$n+2$5

This realization is rational (integer-affinely equivalent) and reflects the face lattice induced by bracketings or partial triangulations (Konoike, 2024).

• Duality with Reflexive Polytopes: Let $n+2$6 be the convex hull of $n+2$7 and all partial sum vectors $n+2$8, $n+2$9. $(n+3)$0 is the polar dual: $(n+3)$1, and $(n+3)$2 is reflexive (Konoike, 2024).
• Products, Secondary Polytopes, Cyclohedra: $(n+3)$3 is the secondary polytope of an $(n+3)$4-gon; identification of end-vertices yields the cyclohedron (Galashin, 2021).
• Equivalence of Models: Via explicit bijections of their underlying posets, the classical (Stasheff–Tamari) associahedron, Loday’s integer embedding, collapsed multiplihedron, and the path-graph cubeahedron all realize the same polytope structure, and the various structural and enumerative properties translate directly among them (Basu et al., 2022).

4. Connections to Configuration Spaces, Moduli, and Operad Theory

Stasheff polytopes appear naturally as moduli and compactifications:

• Compactification of Ordered Configuration Spaces: The interior of the associahedron $(n+3)$5 is homeomorphic to the configuration space of $(n+3)$6 distinct points on the real line modulo affine transformations. Boundary strata correspond to colliding blocks of points and are themselves products of associahedra of lower dimension, yielding a recursive (stratified) structure homeomorphic to $(n+3)$7 (Galashin, 2021).
• Moduli Space Tessellations: The real Deligne–Mumford–Knudsen moduli space $(n+3)$8 is tessellated by $(n+3)$9 copies of $k$0, whose faces encode the boundary divisors associated to degenerating configurations of points on $k$1. This tessellation reflects the combinatorics of separation coordinates and Stäckel systems on spheres $k$2 (Schöbel et al., 2013).
• Operad and Mosaic Operad Structures: The family $k$3 is endowed with a natural operad structure: partial composition corresponds to grafting planar trees or inserting bracketings, mirroring the operadic composition in $k$4-algebras. The mosaic operad on the moduli space side is reflected at polytope level by inclusion and decomposition of faces (Schöbel et al., 2013).

5. Algebraic, Cluster, and Lattice-Theoretic Aspects

Stasheff polytopes serve as native combinatorial environments in several algebraic contexts:

• Cluster Algebras and Canonical Bases: In cluster algebras of type $k$5, the supports of products of theta basis elements in the cluster $k$6-variety are exactly the Stasheff polytopes in the tropical positive space $k$7. The facet and face structure is governed by almost positive roots, and the supports correspond to inequalities in tropical cluster variables (Shen, 2011).
• Newton Polytopes and Scattering Diagrams: Stasheff polytopes coincide with Newton polytopes of theta functions, and their normal fans correspond to cluster scattering diagrams; their chamber decomposition organizes wall-crossing data and canonical basis multiplication (Shen, 2011).
• Tamari Lattice and Subposet of the Permutohedron: The Tamari lattice formed by faces or vertices of $k$8 embeds naturally as a sublattice of the Bruhat/Premutation lattice of the permutohedron $k$9. The embedding corresponds to associativity as a deformation of permutation order, and operations in the Tamari lattice lift to the permutohedron via explicit inversion-set maps (Adaricheva, 2011).

6. Higher Stasheff–Tamari Orders and Bruhat Quotients

Stasheff polytopes provide the combinatorial underpinnings of higher-order generalizations:

• Higher Stasheff–Tamari Orders: For triangulations of cyclic polytopes $n-k$0, the first higher Stasheff–Tamari order $n-k$1 is the quotient of the higher Bruhat order by equivalence under cross-sections. This provides a hierarchy of combinatorial orders associated to secondary polytopes and their duals, with the classical Tamari order as the $n-k$2 case (Williams, 2020).
• Relation to Integrable Systems: These higher orders control certain combinatorics of phase algebra in KP soliton theory, and the polyhedral complexes dual to associahedra (and higher analogs) govern the primary stratifications in these systems (Williams, 2020).

7. Ehrhart Theory and Algebraic-Enumerative Invariants

Recent advances clarify enumerative and algebraic invariants:

• Ehrhart Polynomial and Magic Positivity: For the $n-k$3-dimensional Stasheff polytope $n-k$4, the Ehrhart polynomial $n-k$5 (counting lattice points in $n-k$6-dilates) admits a magic positive expansion (i.e., all coefficients nonnegative in the mixed binomial basis $n-k$7), implying that its $n-k$8-polynomial is real-rooted, log-concave, and unimodal (Konoike, 2024).
• Recursion and Unimodality: $n-k$9 satisfies a two-step recursion:

$P=[n]=\{1<2<\cdots<n\}$0

with $P=[n]=\{1<2<\cdots<n\}$1, ensuring magic positivity inductively in $P=[n]=\{1<2<\cdots<n\}$2 (Konoike, 2024).

• Duality and Reflexivity: $P=[n]=\{1<2<\cdots<n\}$3 is the dual of a reflexive polytope, and this structure underpins the real-rootedness and algebraic symmetry of its $P=[n]=\{1<2<\cdots<n\}$4-polynomial (Konoike, 2024).

Table: Models and Realizations of Stasheff Polytopes

Model	Combinatorial Object	Polytope Dimension
Parenthesis/Tree	Bracketings, binary trees	$P=[n]=\{1<2<\cdots<n\}$5
Polygonal	Triangulations of $P=[n]=\{1<2<\cdots<n\}$6-gon	$P=[n]=\{1<2<\cdots<n\}$7
Path Graph Nestohedron	Nested subpaths	$P=[n]=\{1<2<\cdots<n\}$8
Order Polytope	Order ideals, chains	$P=[n]=\{1<2<\cdots<n\}$9 ($$C(P) = \{x\in \mathbb{R}^n\ |\ x_1\leq x_2\leq\cdots\leq x_n\}$$0 model)
Cluster Tropical	$$C(P) = \{x\in \mathbb{R}^n\ |\ x_1\leq x_2\leq\cdots\leq x_n\}$$1-laminations, laminations	$$C(P) = \{x\in \mathbb{R}^n\ |\ x_1\leq x_2\leq\cdots\leq x_n\}$$2
Multiplihedron	Collapsed painted trees	$$C(P) = \{x\in \mathbb{R}^n\ |\ x_1\leq x_2\leq\cdots\leq x_n\}$$3
Cubeahedron (path)	Design tubings	$$C(P) = \{x\in \mathbb{R}^n\ |\ x_1\leq x_2\leq\cdots\leq x_n\}$$4

A plausible implication is that any structural or computational property proved in one realization readily extends to the others, due to the underlying combinatorial isomorphisms (Basu et al., 2022).

Key cited works providing detailed definitions, constructions, enumerative formulas, and algebraic applications include (Galashin, 2021, Dosen et al., 2010, Basu et al., 2022, Konoike, 2024, Adaricheva, 2011, Schöbel et al., 2013, Shen, 2011), and (Williams, 2020). These works collectively establish the centrality of Stasheff polytopes in combinatorial geometry, algebraic topology, moduli theory, and cluster algebra.