Poset Associahedra: Combinatorial Extensions

• Poset associahedra are convex polytopes defined on finite connected posets, where faces correspond to nested convex and connected subposets meeting acyclicity conditions.
• They are explicitly realized via configuration-space compactification of order-preserving maps, linking geometric structures to combinatorial collision data.
• Special cases recover classical associahedra, permutohedra, and cyclohedra, while exhibiting properties such as real-rootedness, invariance under comparability graphs, and recursive factorization.

Poset associahedra are polyhedral objects that extend the classical associahedron from linear orders to partially ordered sets. In the modern formulation introduced by Galashin, for a finite connected poset $P$, the poset associahedron $A(P)=\mathscr A(P)$ is a simple convex polytope of dimension $|P|-2$ whose face structure is governed by nested convex connected subposets satisfying an acyclicity condition; classical associahedra, permutohedra, cyclohedra, and type $B$ permutohedra arise as special cases (Galashin, 2021). The term also has an earlier use for a different family of simple convex polytopes built from filled connected lower sets and bundles, so the literature contains two non-equivalent constructions under the same name (Devadoss et al., 2013).

1. Combinatorial definition in the sense of Galashin

Let $P$ be a finite connected poset. A proper tube is a subset $\tau\subsetneq P$ such that $|\tau|\ge 2$, $\tau$ is convex, and $\tau$ is connected in the Hasse diagram of $P$. A proper tubing is a set $A(P)=\mathscr A(P)$0 of proper tubes such that any two tubes are either nested or disjoint, and a directed graph $A(P)=\mathscr A(P)$1 associated to $A(P)=\mathscr A(P)$2 is acyclic. The face lattice of $A(P)=\mathscr A(P)$3 is isomorphic to the poset of proper tubings ordered by reverse inclusion, and the polytope is simple of dimension $A(P)=\mathscr A(P)$4. The codimension of the face corresponding to a tubing $A(P)=\mathscr A(P)$5 is $A(P)=\mathscr A(P)$6, so $A(P)=\mathscr A(P)$7-dimensional faces correspond to proper tubings with $A(P)=\mathscr A(P)$8 tubes (Nguyen et al., 2023).

Galashin’s original notation uses pipes and pipings rather than tubes and tubings. In that formulation, a $A(P)=\mathscr A(P)$9-pipe is a convex, connected, nonempty subset of $|P|-2$0, proper pipes are those with $|P|-2$1, and a $|P|-2$2-piping is a collection of pipes that are pairwise nested or disjoint and satisfy the same acyclicity condition via the directed graph $|P|-2$3 (Galashin, 2021). The change in terminology does not alter the central combinatorial principle: faces are indexed by controlled collision patterns of convex connected subposets.

Vertices of $|P|-2$4 correspond to maximal tubings. Facets correspond to proper tubes. Galashin also proves that each face of $|P|-2$5 is combinatorially a product of smaller $|P|-2$6-associahedra, so recursive factorization is built into the face structure (Galashin, 2021).

2. Explicit realizations and compactification of order-preserving maps

A major development after the abstract construction was an explicit realization of $|P|-2$7 as a convex polytope in $|P|-2$8. For

$|P|-2$9

and for a subset $B$0,

$B$1

one defines affine hyperplanes and half-spaces

$B$2

where $B$3. The realization theorem states that

$B$4

is a realization of Galashin’s poset associahedron (Sack, 2023).

This realization is motivated by compactifying the configuration space of order-preserving maps $B$5. In Galashin’s framework, the classical associahedron appears as a compactification of the configuration space of $B$6 points on a line, and $B$7 is recovered as the analogous compactification of the space of order-preserving maps $B$8 modulo translations and positive rescalings (Galashin, 2021). The realization in $B$9 makes that compactification concrete. The order cone

$P$0

and the corresponding order-polytope slice provide the undeformed configuration model, while the inequalities indexed by proper tubes refine it so that the boundary records infinitesimal collision data rather than only equalities of coordinates (Sack, 2023).

The same paper gives an analogous realization for affine poset cyclohedra. In the affine setting, one works with periodic posets and periodically affine coordinate systems; the resulting polytopes generalize cyclohedra in the same way that $P$1 generalizes associahedra (Sack, 2023).

3. Classical special cases and interpolation phenomena

Several classical polytopes are recovered by choosing specific posets. If $P$2 is a chain, then $P$3 is the classical associahedron. If $P$4 is a claw poset, then $P$5 is the permutohedron. In the affine setting, a circular chain gives the cyclohedron, while a circular claw gives the type $P$6 permutohedron (Galashin, 2021).

A particularly important family is

$P$7

where $P$8 is a chain with $P$9 elements, $\tau\subsetneq P$0 is an antichain with $\tau\subsetneq P$1 elements, and $\tau\subsetneq P$2 denotes ordinal sum. The poset associahedra $\tau\subsetneq P$3 interpolate between the classical permutohedron and associahedron: $\tau\subsetneq P$4 is the claw poset, and $\tau\subsetneq P$5 is the chain. This family is also isomorphic to the graph associahedron of the lollipop graph $\tau\subsetneq P$6, which places it at the interface of poset and graph associahedra (Nguyen et al., 2023).

Galashin’s construction is related to graph associahedra but is not merely a reformulation of them. The defining families of pipes are not closed under unions and fail the building set property, so $\tau\subsetneq P$7-associahedra are not, in general, nestohedra or standard graph associahedra (Galashin, 2021). A plausible implication is that their combinatorics is naturally adapted to order-theoretic collision data rather than to the building-set formalism.

4. $\tau\subsetneq P$8-vectors, stack-sorting, and real-rootedness

For the interpolating family $\tau\subsetneq P$9, the $|\tau|\ge 2$0-vector has a direct interpretation in the combinatorics of stack-sorting. Let $|\tau|\ge 2$1 be the $|\tau|\ge 2$2-vector of $|\tau|\ge 2$3, and define

$|\tau|\ge 2$4

Then

$|\tau|\ge 2$5

where $|\tau|\ge 2$6 is the stack-sorting map and $|\tau|\ge 2$7 is the number of descents of $|\tau|\ge 2$8. For $|\tau|\ge 2$9, this recovers the Narayana interpretation for associahedra via stack-sortable permutations; for $\tau$0, it recovers the permutohedral Eulerian distribution (Nguyen et al., 2023).

The same work proves additional positivity and real-rootedness phenomena. For the subfamily $\tau$1, if $\tau$2 denotes the $\tau$3-polynomial, then

$\tau$4

where $\tau$5 is the Narayana polynomial. Using the real-rootedness and interlacing properties of Narayana polynomials, the paper shows that $\tau$6 is real-rooted for all $\tau$7. It also derives $\tau$8-nonnegativity from Brändén’s theorem on descent enumerators of stack-sorting preimages (Nguyen et al., 2023).

These results locate poset associahedra within a broader enumerative framework linking polytope $\tau$9-vectors, descent polynomials, and sorting operators. This suggests that the poset structure can encode algorithmic permutation statistics as directly as it encodes face incidences.

5. Chain-to-antichain identities and type $\tau$0 Narayana polynomials

A separate enumerative direction concerns the behavior of $\tau$1-polynomials under replacing a chain subposet by an antichain. Let $\tau$2 contain a proper autonomous subposet $\tau$3 that is a chain of size $\tau$4, and for $\tau$5 let $\tau$6 be the poset obtained from $\tau$7 by replacing $\tau$8 by an antichain of size $\tau$9. If $P$0 denotes the $P$1-polynomial of $P$2, then

$P$3

where $P$4 is the number of cycles of $P$5, $P$6 for the cycle type $P$7, and

$P$8

is the type $P$9 Narayana polynomial (Nguyen, 2024).

The chain and claw specializations recover a concrete identity among classical polynomial families. When $A(P)=\mathscr A(P)$00 is a chain, $A(P)=\mathscr A(P)$01 is the type $A(P)=\mathscr A(P)$02 Narayana polynomial

$A(P)=\mathscr A(P)$03

For the corresponding $A(P)=\mathscr A(P)$04, the paper identifies $A(P)=\mathscr A(P)$05 with the Eulerian polynomial

$A(P)=\mathscr A(P)$06

yielding

$A(P)=\mathscr A(P)$07

Further corollaries involve broom posets, stack-sorting preimages, and convolution-type sums combining type $A(P)=\mathscr A(P)$08 Narayana and Eulerian polynomials (Nguyen, 2024).

Within the theory of poset associahedra, these formulas show that chain-to-antichain replacements do not merely alter individual face numbers; they induce structured transforms of the full $A(P)=\mathscr A(P)$09-polynomial. The appearance of cycle types of permutations is a distinctive feature of this deformation theory.

6. Comparability invariance and the limits of the $A(P)=\mathscr A(P)$10-vector

The $A(P)=\mathscr A(P)$11-vector of Galashin’s poset associahedron is determined by the comparability graph of the underlying poset. If $A(P)=\mathscr A(P)$12 denotes the graph with vertex set $A(P)=\mathscr A(P)$13 and an edge between two vertices exactly when they are comparable, then

$A(P)=\mathscr A(P)$14

The proof proceeds by showing that posets with isomorphic comparability graphs can be related by flips of autonomous subsets and by constructing bijections between proper tubings that preserve the number of tubes (Nguyen et al., 2023).

This theorem yields nontrivial examples where the $A(P)=\mathscr A(P)$15-vector fails to determine the combinatorial type. For complete graded posets

$A(P)=\mathscr A(P)$16

the comparability graph depends only on the multiset $A(P)=\mathscr A(P)$17, so the $A(P)=\mathscr A(P)$18-polynomial is invariant under permutation of $A(P)=\mathscr A(P)$19. More strikingly, for $A(P)=\mathscr A(P)$20, $A(P)=\mathscr A(P)$21 is combinatorially equivalent to the permutohedron $A(P)=\mathscr A(P)$22, whereas $A(P)=\mathscr A(P)$23 is not combinatorially equivalent to the permutohedron, even though the two polytopes have the same $A(P)=\mathscr A(P)$24-vector. The example $A(P)=\mathscr A(P)$25 versus $A(P)=\mathscr A(P)$26 makes this explicit: only the former has a facet that is an octagon (Nguyen et al., 2023).

A common misconception is therefore that the comparability graph, or even the entire $A(P)=\mathscr A(P)$27-vector, should control the full face structure. The comparability theorem shows that it controls face counts, but the non-equivalence examples show that it does not control the complete combinatorial type.

7. Earlier constructions and terminological ambiguity

Before Galashin’s $A(P)=\mathscr A(P)$28-associahedra, Devadoss, Forcey, Reisdorf, and Showers introduced a different family also called poset associahedra. In that construction, one begins with a finite poset $A(P)=\mathscr A(P)$29, its lower sets, and its bundles

$A(P)=\mathscr A(P)$30

where $A(P)=\mathscr A(P)$31. A lower set is filled if, whenever it contains $A(P)=\mathscr A(P)$32, it also intersects $A(P)=\mathscr A(P)$33. A tube is then defined to be a filled, connected lower set, and a tubing is a collection of tubes, excluding all of $A(P)=\mathscr A(P)$34, such that any two are nested or disjoint and the union of any subcollection is a filled lower set. For a poset with $A(P)=\mathscr A(P)$35 elements partitioned into $A(P)=\mathscr A(P)$36 bundles, the resulting polytope $A(P)=\mathscr A(P)$37 has dimension $A(P)=\mathscr A(P)$38, and its face poset is the tubing poset under reverse containment (Devadoss et al., 2013).

This earlier family is constructed by iterated truncations and includes graph associahedra and nestohedra as special cases. If $A(P)=\mathscr A(P)$39 is disconnected with components $A(P)=\mathscr A(P)$40, then

$A(P)=\mathscr A(P)$41

The paper also states that these poset associahedra fall in a different category altogether than generalized permutohedra, and it exhibits examples with octagonal faces (Devadoss et al., 2013).

The coexistence of these two constructions is the main terminological subtlety of the subject. In the post-2021 literature, “poset associahedron” most often refers to Galashin’s polytope $A(P)=\mathscr A(P)$42, built from convex connected subposets and configuration-space compactification (Galashin, 2021). In earlier work, the same term denotes the truncation-based polytope $A(P)=\mathscr A(P)$43 built from filled connected lower sets and bundle data (Devadoss et al., 2013). The two theories overlap in motivation and in their recovery of classical examples, but they use different admissible substructures, have different dimension formulas, and organize different aspects of the combinatorics of posets.