Celebrating Loday’s associahedron

We survey Jean-Louis Loday’s vertex description of the associahedron, and its far reaching influence in combinatorics, discrete geometry, and algebra. We present in particular four topics where it plays a central role: lattice congruences of the weak order and their quotientopes, cluster algebras and their generalized associahedra, nested complexes and their nestohedra, and operads and the associahedron diagonal.

On the occasion of the 75th anniversary of Archiv der Mathematik and the 20th anniversary of J.-L.Loday's paper [Lod04], we review in this paper the far-reaching influence of Loday's associahedron.It has to be mentioned that this same realization was already described in [SS93] by simple facet inequalities, one for each interval of [n], but it became extremely useful and popular only when J.-L.Loday provided his elementary description of the vertices, one for each binary tree.Namely, each binary tree T corresponds to a vertex with coordinates (T, i) • r(T, i), where (T, i) and r(T, i) respectively denote the numbers of leaves in the left and right subtrees of the ith node of T (in infix labeling).The same realization of associahedron was later described in [Pos09] as the Minkowski sum of all faces of the standard simplex corresponding to intervals of [n].See Section 1.
This realization has several advantages.Some were already underlined by J.-L.Loday in [Lod04]: "it admits simple vertex and facet descriptions, respects the symmetry, and fits with the classical realization of the permutahedron".But we believe that the real reason that makes this realization ubiquitous in the literature is that its normal fan transparently encodes each binary tree by a very natural cone: the cone with one inequality x i ≤ x j for each edge i → j in the tree.This implies in particular that the natural surjective map from permutations to binary trees [Ton97] translates geometrically to fans and polytopes, and that the oriented graph of this associahedron is the Hasse diagram of the Tamari lattice [Tam51] (Section 1).
To summarize, the simplicity of Loday's description of the associahedron has fundamentally contributed to break the psychological barrier of realizing this "mythical polytope" [Hai84].It resulted in several constructions of polytopes with a combinatorial flavor similar to that of the associahedron, some of which are directly constructed from this associahedron (by Cartesian products and Minkowski sums, as sections or projections, or as polyhedral decompositions).We conclude this survey with a (incomplete and partial) list of these constructions (Section 6), and invite the reader to discover many more descendants of Loday's associahedron.
We hope that this survey can serve as an invitation to the "multiple facets of the associahedron" [Lod05].Besides bibliographic pointers to the original literature, we have reproduced many pictures that should already give an idea of the topics covered in this survey.Much of the material of this survey is derived from the Habilitation thesis of V. Pilaud [Pil20], who should be considered the main contributor.
1. Permutahedra, associahedra, cubes J.-L.Loday's paper [Lod04] is a tale of three magical families (permutations, binary trees, and binary sequences) and their fantastic adventures in the lands of lattices, polytopes, and Hopf algebras.This section proposes a brief recollection of these structures, summarized by the Asso(n) [Lod04] generated by e i+1 − e i

Hopf algebras
Malvenuto-Reutenauer Loday-Ronco Recoil Hopf Hopf algebra [MR95] Hopf algebra [LR98] algebra [GKL + 95] 1.1.Lattices.We start with three lattices illustrated in Figure 1: Weak order.We denote by S n the set of permutations of [n] := {1, . . ., n}.The (right) weak order on S n is the partial order ≤ W defined by inclusion of inversion sets (an inversion of σ ∈ S n is a pair of values i, j ∈ [n] such that i is smaller than j but i appears after j in σ).Its cover relations are given by transpositions of two consecutive letters.Its minimal and maximal elements are the permutations 1 . . .n and n . . . 1, respectively.It was shown in [GR63,Bjö84] that the weak order is a lattice (i.e.minimal upper bounds and maximal lower bounds are unique).
Tamari lattice.We denote by T n be the set of rooted binary trees with n internal nodes (equivalently, with n+1 leaves).The Tamari lattice on T n is the lattice ≤ T whose cover relations are given by right rotations on binary trees.Its minimal and maximal elements are the left and right combs, respectively.We consider the n internal nodes of a binary tree labeled by [n] in infix order: first the left subtree is labeled, then the root, then the right subtree, recursively in subtrees.Observe that this makes node i + 1 be a descendant or an ancestor of i.
Boolean lattice.We denote by B n the set of binary sequences of n − 1 signs + or −.The boolean lattice on B n is the lattice Its cover relations are given by replacements of a − by a +.Its minimal and maximal elements are the sequences − n−1 and + n−1 , respectively.
Remark 1. Observe that we denote by B n the boolean lattice on n − 1 elements, not n.We take this convention for their relation to permutations of n elements and binary trees with n internal nodes, where our use of n is standard.Our sets S n , T n , and B n are respectively denoted by S n , Y n and Q n in J.-L.-Loday's paper [Lod04].
These three lattices are related by the following commutative diagram of lattice morphisms: where • the binary tree map (or Tonks projection) sends a permutation σ := σ 1 . . .σ n ∈ S n to the binary tree bt(σ) ∈ T n obtained by successive insertions of σ n , . . ., σ 1 in a binary search tree.That is, σ n is the root, and its left and right subtrees are constructed recursively from the permutations obtained by restriction of σ to {i | i < σ n } and to {i | i > σ n }, respectively.Equivalently, the bt fiber of a tree T is precisely the set of linear extensions of T , i.e. all permutations σ such that for any i, j ∈ [n], if i is a descendant of j in T , then i appears before j in σ.This map was considered in [Ton97, Lod04, HNT05, Rea06].• the canopy map (or Loday-Ronco projection) sends a binary tree T ∈ T n to the binary sequence can(T ) ∈ B n where at position i ∈ [n−1] there is a − if i appears below i+1 and a + if i appears above i + 1 in T .This map was first used by J.-L.Loday and M. Ronco in [LR98], but the name "canopy" was coined by X. Viennot [Vie07].
• the recoil map is the composition of the previous two.It sends a permutation σ ∈ S n to the binary sequence rec(σ) ∈ B n where at position i ∈ [n − 1] there is a − if i appears before i + 1 and a + if i + 1 appears after i in σ.Note that the cover graphs of these lattices are classical combinatorial graphs, namely the simple transposition graph on S n , the rotation graph on T n , and the bit change graph on B n .Their combinatorial properties have been extensively investigated; in particular: • they all admit Hamiltonian cycles.This is classical for S n by the Steinhaus-Johnson-Trotter algorithm [Ste64,Joh63,Tro62], and for B n by the seminal work of F. Gray [Knu11].
For T n , it was shown in [Luc87] and later revisited in [HN99, HM21].• their exact diameter is known.It is obviously n 2 for S n and n − 1 for B n .For T n , there is an immediate lower bound of n and, via the bijection between binary trees and triangulations of the (n + 2)-gon, it is relatively easy to show an upper bound of 2n − 6 + 12 n+2 (see e.g.[DRS10, Proposition 1.1.5]).In particular, the diameter is at most 2n − 6 for all n > 10.Using volumetric arguments in hyperbolic geometry it was shown in [STT88] that the diameter indeed equals 2n − 6 for n sufficiently large, but it took another 25 years until a (purely combinatorial, yet sophisticated) proof for all n > 10 was given in [Pou14].Along the way, a lower bound of 2n − 2 √ 2n valid for all n was obtained in [Deh10] using Thompson's groups.1.2.Polytopes.We denote by (e i ) i∈[n] the canonical basis of R n and 1 := i∈[n] e i .All our polytopal constructions will lie in the affine subspace 2 , and their normal fans will lie in the vector subspace The main objects of J.-L.Loday's paper [Lod04] are the following three polytopes illustrated in Figure 2: Permutahedron.The permutahedron Perm(n) is the polytope in R n obtained equivalently as: • the convex hull of the points i∈[n] i e σ(i) for all permutations σ ∈ S n , see [Sch11], • the intersection of the hyperplane H with the halfspaces • (a translate of) the Minkowski sum of all segments [e i , e j ] for all (i, j) ∈ [n]   2 (where the Minkowski sum of two polytopes P, Q ⊆ R n is the polytope P+Q := {p + q | p ∈ P, q ∈ Q}).
The face lattice of the permutahedron Perm(n) is the refinement lattice on ordered partitions of [n].The normal fan of the permutahedron Perm(n) is the braid fan F(n) defined by the (type A) Coxeter arrangement formed by the hyperplanes x ∈ 1 ⊥ x i = x j for all 1 ≤ i < j ≤ n.Namely, each permutation σ ∈ S n corresponds to the maximal cone C (σ of the braid fan F(n), consisting of all points whose coordinates are ordered by the permutation σ.
Associahedron.The associahedron Asso(n) is the polytope in R n obtained equivalently as: • the convex hull of the points i∈[n] (T, i) r(T, i) e i for all binary trees T ∈ T n , where (T, i) and r(T, i) respectively denote the numbers of leaves in the left and right subtrees of the ith node of T in infix labeling, see [Lod04], • the intersection of the hyperplane H with the halfspaces The face lattice of the associahedron Asso(n) is the edge contraction lattice on Schröder trees with n + 1 leaves (rooted plane trees where each node has at least 2 children).The normal fan of the associahedron is the sylvester fan.Each binary tree T ∈ T n corresponds to a normal cone C (T ) := x ∈ 1 ⊥ x i ≤ x j for i child of j in T .
Parallelepiped.Finally, we consider the parallelepiped Para(n) in R n obtained equivalently as: • the convex hull of the points n+1 2 1+ n−1 2 i∈[n−1] χ i (e i −e i+1 ) for all binary sequences χ ∈ B n , • the intersection of the hyperplane H with the halfspaces • (a translate of) the Minkowski sum of the segments (n − 1) The face lattice of the parallelepiped Para(n) is the lattice on ternary words on {−, 0, +} given by the componentwise order, where the order on {−, 0, +} is defined by 0 ≤ − and 0 ≤ +.The normal fan of the parallalepiped Para(n) is the coordinate fan.Each binary sequence χ ∈ B n corresponds to a normal cone C (χ Remark 2. Observe that we stick to our convention of Remark 1 and depart form Loday's notation; the polytopes Perm(n), Asso(n) and Para(n) (which are of dimension n − 1 but are naturally embedded in a hyperplane in R n ) are denoted by P n−1 , K n−1 , and These three polytopes and fans refine each other: • the facet description of Perm(n) contains the facet description of Asso(n), which contains the facet description of Para(n) (see Section 1.4.1 for more details).• the braid fan refines the sylvester fan, which refines the coordinate fan.Namely, Moreover, these polytopes geometrically realize the lattices of Section 1.1.Indeed, oriented in the direction ω := (n, . . ., 1) − (1, . . ., n) = i∈[n] (n + 1 − 2i) e i , the graph of the permutahedron Perm(n) (resp. of the associahedron Asso(n), resp. of the parallelepiped Para(n)) is the Hasse diagram of the weak order on S n (resp. of the Tamari lattice on T n , resp. of the boolean lattice on B n ).
1.3.Hopf algebras.Recall that a combinatorial Hopf algebra is a combinatorial vector space A endowed with an associative product • : A ⊗ A → A and a coassociative coproduct : A → A ⊗ A, subject to the compatibility relation (a • b) = (a) • (b), where the right hand side product has to be understood componentwise.As discussed in [Lod05], the construction of J.-L.Loday's paper [Lod04] was fundamentally motivated by the following three Hopf algebras: Malvenuto-Reutenauer Hopf algebra.For ρ ∈ S m and σ ∈ S n , the shuffle ρ ¡ σ (resp.the convolution ρ σ) denotes the set of permutations of S m+1 where the order of the first m and last n values (resp.positions) is given by ρ and σ respectively.For instance Let S := n∈N S n be the set of all finitary permutations (any size) and kS denote its k-vector span with basis (F τ ) τ ∈S .The Malvenuto-Reutenauer Hopf algebra [MR95] is the Hopf algebra on kS where the product • and coproduct are defined by Loday-Ronco Hopf algebra.The Loday-Ronco Hopf algebra [LR98] is the Hopf subalgebra kT of kS generated by the elements for all binary trees T ∈ T of any size.
Recoil Hopf algebra.The recoil Hopf algebra [GKL + 95] is the Hopf subalgebra kB of kS generated by the elements for all binary sequences χ ∈ B of any size.By definition, these three Hopf algebras are closely related: the recoil algebra is a Hopf subalgebra of the Loday-Ronco algebra, which is a subalgebra of the Malvenuto-Reutenauer algebra.Moreover, there are close connections between these Hopf algebras, the lattices of Section 1.1 and the polytopes of Section 1.2.Namely, • the product of two elements in kS (resp. in kT, resp. in kB) is a sum over an interval in a weak order (resp.a Tamari lattice, resp.a boolean lattice) [LR02].• the product in kS (resp. in kT, resp. in kB) can be interpreted as the product (as formal power series) of the non-negative integer point enumerators of the normal cones of the permutahedra (resp.associahedra, resp.parallelepipeds) [Cha07, CHNT08 where sc(i, j, P ) is the connected component of i in the Hasse diagram of P minus (i, j).We note that these three Hopf algebras can be extended to Hopf algebras on all faces of the permutahedra, associahedra and cubes [Cha00].
We refer to [AA17, MR95, AS05, LR98, AS06, HNT05, GKL + 95, Cha00] for more details on the topic of this section, but we want to highlight the work [AA17].In this paper, M. Aguiar and F. Ardila use Loday's realization to explain the role of the face structure of the associahedron in the compositional inverse of power series, which was a question asked by J.-L.Loday in [Lod05].Quoting from [AA17]: there are many other realizations of the associahedron as a generalized permutahedron.[...] Surprisingly, to answer Loday's question within this algebro-polytopal context, Loday's realization of the associahedron is precisely the one that we need!1.4.Three surprising geometric properties.To close this section, we present three surprising geometric properties connecting the permutahedron Perm(n) to the associahedron Asso(n).The first two were already partially discussed in [Lod04], while the last one is more recent.1.4.1.Removahedra.A removahedron of a polytope P is a polytope obtained by removing some inequalities from the facet description of P. As already mentioned, Para(n) is a removahedron of Asso(n), which is a removahedron of Perm(n).This is illustrated in Figure 2, where the facets which are not deleted to pass to the next polytope are shaded.This property motivates the following observations: (1) Asso(n) has precisely n pairs of parallel facets, which are the pairs of parallel facets of Para(n).
(2) Perm(n) and Asso(n) have precisely 2 n−2 common vertices, which correspond to the permutations where all values before i or all values after i are larger than i for all i ∈ [n], and to the binary trees where every node has at most one (internal) child.
(3) Asso(n) and Para(n) have precisely n common vertices, which correspond to the binary trees where the left subtree of the root is a left comb and the right subtree of the root is a right comb, and to the binary sequences of the form − i + n−1−i .(4) Perm(n), Asso(n) and Para(n) have precisely 2 common vertices, which correspond to the permutations 12 . . .n and n . . .21, to the left and right combs, and to the binary sequences − n−1 and + n−1 .
1.4.2.Vertex barycenter.The vertex barycenter of a polytope P is the isobarycenter of the vertices of P (note that it is in general not the center of mass of P). Surprisingly, the vertex barycenters of Perm(n), of Asso(n), and of Para(n) all coincide.This was observed by F. Chapoton and reported in [Lod04,Lod05].However, note that the argument given in [Lod04,Lod05] is wrong: the contribution of the vertex of Asso(n) corresponding to a binary tree T is not the sum of the contributions of the vertices of Perm(n) corresponding to the linear extensions of T .A correct argument, involving averaging over orbits of the dihedral rotation on triangulations, appeared later in [HLR10] and was simplified in [LP18].An alternative approach based on brick polytopes (see Section 3.2) appeared in [PS15b].Finally, an argument based on the universal associahedron (see Section 3.1) appeared in [HPS18].
1.4.3.Deformation cone.A deformation of a polytope P can be equivalently described as (i) a polytope whose normal fan coarsens the normal fan of P [McM73], (ii) a Minkowski summand of a dilate of P [Mey74, She63], (iii) a polytope obtained from P by perturbing the vertices so that the directions of all edges are preserved [Pos09, PRW08], (iv) a polytope obtained from P by gliding its facets in the direction of their normal vectors without passing a vertex [Pos09,PRW08].The deformations of P form a cone under positive dilations and Minkowski sums, called the deformation cone of P [McM73,PRW08].Polytopes in the deformation cone of P are parametrized by the values of the support functions in the directions normal to the facets of P.Under this parametrization, this cone is defined by the wall-crossing inequalities, corresponding to the pairs of maximal adjacent cones of the normal fan of P.
For instance, the deformations of the permutahedron Perm(n) have been studied extensively (historically as polymatroids [Edm70], or more recently as generalized permutahedra [Pos09, PRW08, AA17]).They are parametrized by the cone of submodular functions.While the facets of this cone correspond to (minimal) submodular inequalities, its rays are still poorly understood (it is still an open question to determine its number of rays).
Surprisingly, the deformation cone of the associahedron Asso(n) is a simplicial cone [BMCLD + 18, PPPP19, PPR22].Its facets are given by the wall-crossing inequalities corresponding to the exchanges of pairs of rays given by two intervals of the form [i, j] and [i+1, j +1].Its rays are (all positive dilations of) the faces [i,j] of the standard simplex corresponding to intervals of [n].Hence, the sylvester fan is the normal fan of any Minkowski sum of positive dilates of the faces [i,j] .It is however arguable that Loday's associahedron is the most natural realization of the sylvester fan, as it is the isobarycenter of the rays of its simplicial deformation cone.

Lattice congruences and quotientopes
In this section, we survey the deep influence of Loday's associahedron in the construction of polytopal realizations of lattice quotients of the weak order, in particular (type A) Cambrian and permutree lattices [Rea06,PP18].Alternative detailed sources include the original papers [Rea04,Rea06,Rea05,Rea15] and the survey articles [Rea12,Rea16a,Rea16b] for lattice quotients of the weak order, and the original papers [HL07, PP18, PS19, PPR22] for their polytopal realizations.
2.1.Sylvester congruence.A lattice congruence of a lattice (L, ≤, ∧, ∨) is an equivalence relation on L that respects the meet and the join, i.e. such that x ≡ x and y ≡ y implies x ∧ y ≡ x ∧ y and x ∨ y ≡ x ∨ y .A lattice congruence ≡ automatically defines a lattice quotient L/≡ on the congruence classes of ≡ where the order relation is given by X ≤ Y if and only if there exists x ∈ X and y ∈ Y such that x ≤ y.The meet X ∧ Y (resp.the join X ∨ Y ) of two congruence classes X and Y is the congruence class of x∧y (resp. of x∨y) for arbitrary representatives x ∈ X and y ∈ Y .
Our prototypical example of lattice congruence is the sylvester congruence of the weak order (the term "sylvester", coined in [HNT05], is an adjective meaning "woody" and is not referring to the mathematician James Joseph Sylvester).Its equivalence classes are the sets of linear extensions of the binary trees of B n , or equivalently, the fibers of the binary tree map bt of Section 1.1.It can be defined equivalently as the transitive closure of the rewriting rule U acV bW ≡ sylv U caV bW where a < b < c are letters and U, V, W are words on [n].It was studied in particular in [Ton97, HNT05, Rea04, Rea06, CP17, PP18].The quotient ≤ W /≡ sylv of the weak order by the sylvester congruence is the Tamari lattice [Tam51].In other words, for any T, T ∈ T n , we have T ≤ T T if and only if there exist σ, σ ∈ S n such that bt(σ) = T , bt(σ ) = T and σ ≤ W σ .

Cambrian and permutree congruences.
A permutree [PP18] is a tree whose nodes are labeled bijectively by [n] and whose edges are oriented with the following local rules around each node: • each node may have either one or two parents and either one or two children, • if a node j has two parents (resp.children), all nodes in the left parent (resp.child) of j are smaller than j, while all nodes in the right parent (resp.child) of j are larger than j.We decorate each node with the symbols , , , depending on their number of parents and children, and the sequence δ(T ) of these symbols is called the decoration of the permutree T .As illustrated in Figure 3, the permutrees extend and interpolate between permutations when δ(T ) = n , binary trees when δ(T ) = n , and binary sequences when δ(T ) = n .The permutrees with δ(T ) ∈ { , } are called Cambrian trees [LP18,CP17].
Generalizing Section 1, it was shown in [PP18] that for each δ ∈ { , , , } n , (1) the sets of linear extensions of the δ-permutrees define a lattice congruence of the weak order, the δ-permutree congruence ≡ δ .These sets are also the fiber of the δ-permutree map sending permutations to δ-permutrees.The δ-permutree congruence ≡ δ is also the transitive closure of the rewriting rules  (2) the quotient ≤ W /≡ δ is the δ-permutree lattice, whose cover relations are right rotations on permutrees.See [PP18, Sect.2.6].For instance, the δ-permutree lattice is the weak order when δ = n , the Tamari lattice [Tam51] when δ = n , the (type A) Cambrian lattices [Rea06] when δ ∈ { , } n and the boolean lattice when δ = n .See Figure 4 (midddle left) for a generic example.(3) the cones C (T ) := x ∈ 1 ⊥ x i ≤ x j , ∀ i → j in T for all δ-permutrees form a complete simplicial fan, the δ-permutree fan F(δ).In other words, the maximal cones of F(δ) are obtained by glueing together the maximal cones of the braid fan F(n) which correspond to permutations in the same equivalence class for ≡ δ .See [PP18, Sect.3.1].For instance, F(δ) is the braid fan when δ = n , the sylvester fan when δ = n , the (type A) Cambrian fans of [RS09] when δ ∈ { , } n , and the coordinate fan when δ = n .See Figure 4 (middle right) for a generic example, drawn in stereographic projection.(4) the fan F(δ) is the normal fan of the δ-permutreehedron PT(δ), which can be equivalently defined as • the convex hull of the points p(T ) for all δ-permutrees T , whose ith coordinate is defined by p(T ) i = 1 + d + r − r, where d denotes the number of descendants of i in T , and r denote the sizes of the left and right descendant subtrees of i in T when δ i ∈ { , } (otherwise, = r = 0), and and r denote the sizes of the left and right ancestor subtrees of i in T when For instance, PT(δ) is the permutahedron Perm(n) when δ = n , Loday's associahedron Asso(n) [SS93,Lod04] when δ = n , Hohlweg-Lange's associahedra Asso(δ) [HL07, LP18] when δ ∈ { , } n , and the parallelepiped Para(n) when δ = n .See Figure 4 (right) for a generic example.The face lattice of the δ-permutreehedron PT(δ) can be described in terms of Schröder permutrees, see [PP18,Sect. 5].We note that the very simple expression of the vertex coordinates of Asso(n) given in [Lod04] was particularly influencial in the definition of Hohlweg-Lange's associahedra [HL07], which in turn motivated the definition of the permutreehedra of [PP18].
Finally, we briefly mention that the combinatorial Hopf algebras of Section 1.3 extend to a big combinatorial Hopf algebra on all permutrees (all sizes, all decorations), see [CP17] and [PP18,Sect. 4].Similarly, the Hopf algebras of [Cha00] extend to a Hopf algebra on all Schröder permutrees, see [PP18, Sect.5].

All congruences.
We now consider all lattice quotients of the weak order on S n .To keep this section short, we refrain from presenting the wonderful combinatorics of these lattice quotients in terms of non-crossing arc diagrams [Rea15], and focus on their geometric realizations.
Any lattice congruence ≡ of the weak order on S n defines a quotient fan F(≡) [Rea05], whose maximal cones are obtained by glueing together the maximal cones of the braid fan F(n) which correspond to permutations in the same equivalence class for ≡.This fan F(≡) is complete but not necessarily simplicial (the congruences for which the quotient fan is simplicial are characterized in [HM21, Sect.4.4], see also [DIR + 23, Thm.1.13] for a representation theoretic approach, and [BNP23] for a shorter combinatorial proof and the connection to the permutrees of Section 2.2).This fan F(≡) is the normal fan of a quotientope QT(≡) which was constructed • in [PS19] by a direct but quite intricate facet description, • in [PPR22] as a Minkowski sum of certain simple pieces called shard polytopes.See Figure 6.The graph of the quotientope, oriented in a linear direction, is the Hasse diagram of the quotient of the weak order by ≡.We note that these quotientopes somehow simultaneously reach the limit and use the full power of Loday's simple construction of the associahedron: • there is no simple formula for the vertex coordinates of the quotientopes similar to [Lod04].
• the only lattice congruences of the weak order which can be realized by a removahedron of Perm(n) are the permutree congruences [APR21].• however, as observed in [PPR22], any quotient fan can be realized as the normal fan of a Minkowski sum of well-chosen associahedra Asso(δ) of [HL07], which admit a simple vertex description inspired from [Lod04] and are removahedra of Perm(n), as discussed in Section 2.2.For instance, the diagonal rectangulation polytope [LR12] (orange in Figure 6) is the Minkowski sum of two opposite associahedra of [Lod04] (blue and purple in Figure 6).To complete our comparison between associahedra and arbitrary quotientopes from the perspective of Section 1, we observe that • the graphs of the quotientopes all admit Hamiltonian paths [HM21] (it is open to prove that they all admit a Hamiltonian cycle).• the vertex barycenters of the quotientopes do not coincide (not even for permutreehedra),  H, B) is always a lattice when the fan F is simplicial, and never a lattice when the chamber B is not simplicial [BEZ90].See also the survey of N. Reading [Rea16b] for further conditions, in particular a discussion on tight arrangements.Assume now that R(H, B) is a lattice, and consider a lattice congruence ≡ of R(H, B).It was proved in [Rea05] that the lattice congruence ≡ defines a complete fan F(≡) obtained by glueing together the cones of the fan F that belong to the same congruence class of ≡.It remains an open question whether these quotient fans are polytopal.The answer is known to be positive in for: • the braid arrangement (whose poset of regions is the weak order on permutations) by [PS19,PPR22] as discussed in Section 2.3, • graphical arrangements of skeletal graphs (whose poset of regions are precisely the acyclic reorientation lattices) by [Pil21], • the hyperoctahedral arrangement (or type B Coxeter arrangement) by [PPR22].Using quiver representation theory (see Section 3.3), [DHT23] also recently proposed candidates for shard polytopes, which should lead to quotientopes for arbitrary finite Coxeter arrangements.We note also that quotientopes for the braid arrangement and for graphical arrangements can be constructed as Minkowski sums of (lower dimensional) associahedra of [HL07], showing again the longlasting influence of Loday's associahedron [Lod04].

Cluster algebras, brick polytopes, and quiver representation theory
In this section, we present some polytope constructions in the theory of cluster algebras, of subword complexes, and of quiver representation theory, in which Loday's associahedra were instrumental.Alternative surveys on this section include [FWZ, FR07, Hoh12, Tho12, Tho21].
3.1.Cluster algebras and generalized associahedra.Cluster algebras were introduced in the series of papers [FZ02, FZ03a, BFZ05, FZ07].Their motivations came from total positivity and canonical bases, but cluster algebras quickly appeared to be a fundamental structure in many areas of mathematics (representation theory of quivers, Poisson geometry, integrable systems, etc).See the cluster algebra portal [Fom], or the surveys [FR07,FWZ].
A cluster algebra is a commutative ring generated by a set of cluster variables grouped into overlapping clusters.One can choose an initial cluster as a seed from which all other clusters are obtained by a mutation process controlled by a combinatorial object (a skew-symmetrizable matrix, or a weighted quiver).During a mutation, a single variable in the cluster is perturbed and the new variable is computed by an exchange relation.One fundamental aspect of this process is the Laurent phenomenon [FZ02]: all cluster variables are Laurent polynomials with respect to the cluster variables of the initial seed.
An important combinatorial and geometric object associated to a cluster algebra is its cluster complex: the simplicial complex with cluster variables as vertices and clusters as facets.A cluster algebra is of finite type if its cluster complex is finite.Finite type cluster algebras are classified by the same Cartan-Killing classification of finite root systems [FZ03a], and there are combinatorial models for the cluster variables and clusters of the cluster algebras of non-exceptional finite types.In particular, the cluster complex of the cluster algebra of type A n−1 is isomorphic to the simplicial associahedron: cluster variables correspond to internal diagonals of an (n + 2)-gon, clusters correspond to triangulations of this polygon, a mutation between clusters corresponds to a flip between triangulations, and the exchange relation can even be interpreted as a Ptolemy relation in a quadrilateral.
A finite type cluster algebra (together with a choice of initial seed) naturally defines two complete simplicial fans, both combinatorially isomorphic to the cluster complex but geometrically different: the d-vector fan [FZ03b] and the g-vector fan [FZ07].The information needed to construct these fans is encoded in the algebra as follows: the d-vectors are given by the denominators of the cluster variables, while the g-vectors are given by exponents of coefficients in the cluster algebra with principal coefficients.In type A n−1 , the d-vector fan is the compatibility fan (the ray corresponding to a diagonal δ of the (n + 2)-gon consists of all positive multiples of the characteristic vector of the diagonals of the initial triangulation of the (n + 2)-gon crossed by δ), while the g-vector fan is the sylvester fan introduced in Section 1.2.In fact, the g-vector fans of finite type cluster algebras with respect to acyclic initial seeds are precisely the Cambrian fans of [RS09] realizing the Cambrian lattices of [Rea06] in crystallographic types.The Cambrian lattices are particular lattice quotients of the weak orders on Coxeter groups [Hum90,BB05].(Note that g-vector fans are not limited to acyclic initial seeds but are restricted to Weyl groups, while Cambrian lattices and fans are limited to acyclic initial seeds, but are defined for arbitrary finite Coxeter groups).See Figure 8 for illustrations of g-vector fans.
The generalized associahedron of a finite type cluster algebra is a simple polytope whose polar realizes the cluster complex.Generalized associahedra were first constructed in [CFZ02] using the d-vector fans, and alternative realizations were obtained in [HLT11] using the g-vector fans with respect to acyclic initial seeds (in fact, the Cambrian fans of [RS09] for arbitrary finite Coxeter groups).The latter realizations are direct descendants of Loday's associahedra.Namely, generalizing the construction of the associahedra of [HL07] (directly inspired by [Lod04] as discussed in Section 2.2), they are obtained by deleting inequalities in the facet description of the Coxeter permutahedron, the convex hull of the orbit of a generic point under the action of the reflection group.The remaining facets are those that contain at least one singleton, i.e. a point of the Coxeter permutahedron corresponding to a singleton class of the Cambrian congruence (thus a common point with the resulting generalized associahedron).The isometry classes of generalized associahedra of [HLT11] were described in [BHLT09].See Figure 7 and the first two columns of Figure 8 for illustrations.We refer to [Hoh12] for a very instructive presentation.
The construction of [HLT11] was revisited in [Ste13] with an approach similar to the original one of [CFZ02], and in [PS15a] via brick polytopes (see Section 3.2).Later, it was proved in [HPS18] that all g-vector fans with respect to any initial seed (acyclic or not) are actually polytopal (this construction yields the same generalized associahedron as [HLT11] when it starts from an acyclic initial seed).See the last two columns of Figure 8 for illustrations.This construction also led to the definition of a universal associahedron [HPS18], a polytope whose normal fan simultaneously contains all g-vector fans of a given finite type cluster algebra.
To complete our connection between Loday's associahedra [Lod04] and the generalized associahedra of [HLT11,HPS18] from the perspective of Section 1, we observe that Finally, let us mention that cluster algebras and in particular the associahedron appear in an extremely promising recent line of research in high energy physics.In quantum field theory, the scattering amplitudes (the probabilities that particular interactions occur among particles) are traditionally expressed as sums over all possible Feynman diagrams for the interaction.In [AHT14], N. Arkani-Hamed and J. Trnka introduce amplituhedra, geometric objects that greatly simplify these computations.Although the theory is still under construction, in the case treated in [AHT14] (Super Yang-Mills theory with N = 4), the amplituhedron is a linear image of the positive Grassmannian and the scattering amplitudes are computed by evaluating a certain form in it, conjecturally the volume of a "dual amplituhedron" which should exist.
In [AHBHY18], this approach is applied to the so-called "bi-adjoint φ 3 scalar theory", for which the amplituhedron turns out to be exactly Loday's associahedron.The relation is as follows: in this theory n cyclically ordered particles in the plane interact via ternary trees.Hence, there is one Feynman diagram corresponding to each vertex of Asso(n − 2), that is, to each facet F of the polar Asso(n − 2) .It turns out that the summand of each ternary tree in the expression for the scattering amplitude equals the volume of the simplex obtained coning the corresponding facet F to the origin, so indeed the total sum equals the volume of Asso(n − 2) .There is a deformation of Asso(n − 2) involved in the process.Before computing the polar, each facet of Asso(n − 2) is translated by an amount depending in the momenta of the two particles defining that facet.In fact, the treatment of deformed associahedra in [AHBHY18] inspired the works [BMCLD + 18, PPPP19] mentioned above.
3.2.Subword complexes and brick polytopes.Subword complexes were introduced in [KM05] in the context of Gröbner geometry of Schubert varieties, and extended to all finite Coxeter groups in [KM04].Given a finite Coxeter system (W, S) [Hum90, BB05], a word Q of S m , and an element w of W , the subword complex SC(Q, w) is the simplicial complex of subwords of Q whose complements contain a reduced expression of w.In other words, its ground set is the set [m] of positions in Q, and its facets are the complements of the reduced expressions of w in Q.Here, . Some g-vector fans and generalized associahedra of finite type cluster algebras.Top: all type A 3 and the cyclic type C 3 initial exchange matrices.Middle: The corresponding dual c-vector fans (thin red) and g-vector fans (bold blue).Bottom: The corresponding zonotopes (thin red) and generalized associahedra (bold blue).In type A, the generalized associahedra are removahedra of the corresponding zonotope.In cyclic type C 3 , the shaded facets of the zonotope and of the associahedron are parallel but do not coincide.Adapted from [HPS18, Figs. 2, 3, 5 & 6].we only consider the case where w = w • is the longest element of W , and Q contains a subword which is a reduced expression for w • , and we just write SC(Q) for SC(Q, w • ).
To a facet I of SC(Q) and a position k ∈ [m], we associate a root r(I, k , where ΠQ X denotes the product of the reflections q x ∈ Q, for x ∈ X, in the order given by Q.The root configuration of I is the set R(I) := {r(I, i) | i ∈ I} and the brick vector is the vector b(I) := k∈[ ] w(I, k).The brick polytope BP(Q) of the word Q is the convex hull of the brick vectors of all facets of SC(Q) [PS12,PS15a].It was shown in [PS12, PS15a, JS21] that the vertices of BP(Q) correspond to the facets I of SC(Q) whose root configuration R(I) is acyclic (i.e.form a pointed cone).It follows that the brick polytope BP(Q) realizes the subword complex SC(Q) if and only if the root configurations of all (or equivalently, of one of) the facets of SC(Q) is linearly independant.
Subword complexes have a simple visual interpretation in type A n−1 , i.e. when W = S n and S = {τ p | p ∈ [n − 1]} where τ p is the simple transposition (p p + 1).A (primitive) sorting network N is formed by n horizontal lines (its levels, labeled from bottom to top) together with m vertical segments (its commutators, labeled from left to right) joining two consecutive levels.A pseudoline arrangement on N is a collection of n x-monotone paths supported by N which cross pairwise precisely once at a commutator and have no other intersection.The commutators where two pseudolines cross are called crossings while the others are called contacts of the pseudoline arrangement.A word Q := q 1 q 2 • • • q m on S is represented by the sorting network N Q whose kth commutator lies between the pth and (p + 1)th levels if q k = τ p .A facet I of SC(Q) is then represented by the pseudoline arrangements whose contacts lie at the positions given by I. See Figure 9.As pointed out in [PP12], type A subword complexes can be used to provide a combinatorial model for many relevant families of geometric graphs (see Figure 10 In particular, for subword complexes corresponding to triangulations of a convex polygon, the brick polytopes precisely recover the associahedra of [Lod04,HL07] (up to a translation).
More generally, the subword complex interpretation of [PP12, Stu11, SS12] for triangulations and multitriangulations of convex polygons where extended to arbitrary finite Coxeter groups in [CLS14].In particular, for a Coxeter element c of a finite Coxeter group, the c-cluster complex is isomorphic to the subword complex SC(cw • (c)) where w • (c) denotes the c-sorting word of w • (meaning the lexicographic minimal reduced word in c ∞ := ccc • • • ).The corresponding brick polytope BP(cw • (c)) then coincides (up to translation) with the c-associahedra Asso(c) of [HLT11] discussed in Section 3.1 [PS15a].This alternative interpretation provides an explicit vertex description of Asso(c), and thus enables to easily derive some of their geometric properties, for instance that their barycenter all coincide with that of the Coxeter permutahedron [PS15b].
For completeness, let us mention that non-spherical subword complexes also have their brick polyhedra [JS21], whose oriented skeleta are sometimes lattice quotients of intervals of the weak order [BCCP23].
3.3.Quiver representation theory and gentle associahedra.To illustrate the far reaching influence of Loday's associahedra, we conclude with some of its apparitions and generalizations in the quiver representation theory.
There are several connections between representation theory and the associahedron.For instance, the introductory paper [Tho12] connects the lattice of torsion classes of the linear A n−1 quiver to the Tamari lattice.Here, we prefer to follow [Tho23] to go straight from representation theory to Loday's associahedron.
A quiver Q := (Q 0 , Q 1 ) is a directed graph with vertices Q 0 and arrows Q 1 .A representation V of Q is an assignment of a finite dimensional vector space V i (over a fixed algebraic closed field) for each vertex i of Q 0 , and of a linear map V α : V i → V j for each arrow i α − → j of Q 1 .Representations are considered up to isomorphisms, meaning basis changes in each of the vector spaces V i .
Note that the representations of Q correspond to the modules over the path algebra of Q (the algebra of oriented paths on Q, where the product of two paths π, π is the concatenation ππ when π starts where π ends, and 0 otherwise).As any (basic) finite dimensional algebra is the path algebra of a quiver with relations, the theory of quiver representations (with relations) thus corresponds to the theory of modules over finite dimensional algebras.We refer to the textbooks [ASS06,Sch14].
The dimension vector of a representation V is dim be decomposed as the direct sum of two non-zero representations.A subrepresentation of a representation V is a representation W such that W i is a vector subspace of V i for each vertex i of Q 0 , and V α (W i ) ⊆ W j for each arrow i α − → j of Q 1 .The Harder-Narasimhan polytope HN(V ) of a representation V is the convex hull of the dimension vectors of the subrepresentations of V .It transports direct sums to Minkowski sums: HN(V ⊕ W ) = HN(V ) + HN(W ).In particular, if Q admits only finitely many indecomposable representations (up to isomorphism), it is natural to consider HN(Q) := HN( V V ) = V HN(V ), where the (direct and Minkowski) sums range over all (representatives of the isomorphism classes of) indecomposable representations of Q.
Consider now the linear Up to isomorphism, its indecomposable representations are precisely the representations E ij for 1 ≤ i ≤ j ≤ n − 1, consisting in a one-dimensional vector space at each vertex between i and j (included) with identity maps between them, and zero vector spaces and maps elsewhere.One can check the Harder-Narasimhan polytope HN(E ij ) is (up to a change of basis) the face [i,j+1] of the standard simplex corresponding to the interval [i, j +1].Hence, HN(Q) coincides with Loday's associahedron Asso(n).Moreover, as already mentioned, the Tamari lattice given by the linear orientation of the graph of Asso(n) corresponds to the lattice of torsion classes of Q [DIR + 23].
Note that starting from any orientation Q of a type A/D/E Dynkin quiver, the polytopes HN(V ) of the indecomposable representations V would be the Newton polytopes of the F -polynomials of the corresponding cluster algebra [BMCLD + 18], the polytope HN(Q) would coincide with another associahedron of [HLT11], and the lattice of torsion classes of Q would be a Cambrian lattice [Rea06] of type A/D/E [IT09].
Even more powerful statements arise in the situation of quivers with relations (see [ASS06,Sch14] for definitions).Two families of examples deserve a particular mention here as they are closely connected to Loday's associahedron and the material discussed here.
The first family is that of preprojective quivers of type A/D/E.The polytope HN(Q) is the corresponding Coxeter permutahedron [AHI + 22], and the lattice of torsion classes is the weak order of the corresponding finite Coxeter group [Miz14].Moreover, the Harder-Narasimhan polytopes HN(V ) of the indecomposable brick representations of Q are natural candidates for shard polytopes [DHT23], which would enable to realize all lattice quotients of these weak orders, as mentioned in Section 2.4.The same construction should extend to arbitrary finite Weyl groups, working with quiver representations on non algebraically closed fields.
The second family is that of gentle quivers [AS87,BR87].The lattice of torsion classes of a gentle quiver was interpreted combinatorially in terms of non-kissing walks of a blossoming quiver, or equivalently in terms of non-crossing accordions on a dissection of a surface [BDM + 20, PPP21, PPP19].Moreover, gentle quivers with finitely many indecomposables naturally define a gentle fan (generalizing the sylvester fan) and a gentle associahedron (generalizing Loday's associahedron), whose constructions were directly inspired from that of Section 1, see [PPP21,PPPP19].See Figure 12 for illustrations.These gentle associahedra specialize to and uniformize grid associahedra previously considered in [PPS10,SSW17,McC17,GM17], and accordiohedra previously considered in [Bar01,Cha16,GM18,MP19].

Graph associahedra and nestohedra
In this section, we briefly present the families of graph associahedra and hypergraph associahedra (or nestohedra).They were constructed in [CD06, Dev09, Pos09, FS05, DP11] in connection to wonderful compactifications of hyperplane arrangements [DCP95].The associahedron of [Lod04] served again as the prototype in these constructions.4.1.Graph associahedra.Consider a simple graph G with vertex set V .A tube of G is a nonempty subset of V which induces a connected subgraph of G. Two tubes are compatible if they are either nested, or disjoint and non-adjacent (their union is not a tube).A tubing of G is a set of pairwise compatible tubes, which contains the connected components of G.The nested complex of G is the simplicial complex of tubings of G.It can be geometrically realized by the nested fan, with a ray g(t) for each tube t of G, given by (the projection of) the characteristic vector of t.Moreover, the nested fan is the normal fan of a polytope, called graph associahedron Asso(G), and first constructed in [CD06] (see also [DJS03]).This polytope can be obtained • by truncating some faces of the standard simplex [CD06], • as the intersection of H with the hyperplanes g(t) | x ≤ −3 |t| for all tubes t of G [Dev09], • as the Minkowski sum t t of the faces of the standard simplex given by all tubes t of G [Pos09].See the first two columns of Figure 14 for two generic examples.As illustrated in Figure 13, the graph associahedra of certain special families of graphs coincide with well-known families of Figure 13.The permutahedron (left), the associahedron (middle), and the cyclohedron (right) as graph associahedra.Adapted from [MPP22].polytopes: complete graph associahedra are permutahedra, path associahedra are classical associahedra, cycle associahedra are cyclohedra, star associahedra are stellohedra, and parallelotopes are empty graph associahedra (meaning graphs with no edges).
We restrict ourselves to a few observations motivated by Section 1: • graph properties of graph associahedra have been investigated in [MP15, CMM22, CPVP22]: their graphs are Hamiltonian, and their diameters are partially understood.• the oriented graphs of graph associahedra are not always Hasse diagrams of lattices.The ones which are lattice quotients of the weak order have been characterized in [BM21].• the nested fan of G is realized as a removahedron of Perm(n) if and only if every cycle of G induces a clique [Pil17].In particular, the cyclohedron is not a removahedron of Perm(n).• the deformation cone of the graph associahedra are described in [PPP23].In particular, the Cartesian products of associahedra are the only graph associahedra whose deformation cone is simplicial.• Hopf algebraic structures on graph associahedra were investigated in [FS10, Ron12, BM21].4.2.Hypergraph associahedra and nestohedra.Hypergraph associahedra [DP11] are obtained exactly as graph associahedra by replacing the initial graph data by a hypergraph [Ber89].They were described independently as nestohedra of building sets [Pos09,FS05,Zel06].They are constructed as the Minkowski sums of the faces of the standard simplex corresponding to their tubes [Pos09], and thus belong to the family of hypergraphical polytopes [BBM19] inside the rich family of generalized permutahedra [Pos09].See the last two columns of Figure 14 for two generic examples.
A particularly interesting family of hypergraph associahedra is obtained from interval hypergraphs (hypergraphs all of whose hyperedges are intervals of [n]): they contain • the classical associahedron of [SS93,Lod04] for the building set with all intervals of [n], • the Pitman-Stanley polytope of [SP02] for the building set with all singletons {i} and all initial intervals [i] for i ∈ [n], • the freehedron of [San09] for the building set with all singletons {i}, all initial intervals [i] for i ∈ [n], and all final intervals • the fertilotopes of [Def21] for the binary building sets defined as the interval building sets where any two intervals are either nested or disjoint.For completeness, we just briefly mention that • the hypergraph associahedra which are removahedra of Perm(n) were characterized in [Pil17].

Operads and diagonals
In this section, we come to the relation of the associahedron to loop spaces.Although this was the original motivation for J. Stasheff [Sta63], we have delayed this topic until the end since in Stasheff's original work only the combinatorics of the associahedron is important.In fact, he defined it as a CW-complex with no particular embedding as a polytope.Only recently Loday's realization has acquired importance in this area, for the construction of diagonals of associahedra.
We briefly introduce loop spaces and the notion of A ∞ -operad, and then focus on the diagonal of the associahedron where (a weighted version of) Loday's construction was fundamentally exploited [MTTV21].Expository texts for this section include [Sta04,LV12,Val14].5.1.Loop spaces and operads.In a pointed topological space (X, * ), a loop is a continuous map f : [0, 1] → X with f (0) = f (1) = * .The concatenation product f g of two loops f and g is defined by fg(t) = f (2t) if t ≤ 1/2 and fg(t) = g(2t − 1) if t ≥ 1/2.This product fails to be associative: for three loops f, g, h, the images of f (gh) and (fg)h coincide, but their parametrizations differ.However, one can easily find a homotopy that deforms f (gh) to (fg)h.
If we now consider four loops f, g, h, k, then their five possible concatenations (parenthesizations of the word fghk) are homotopic, but also the two possible ways to compose homotopies between the loops f (g(hk)) and ((fg)h)k are homotopic.Continuing this process, J. Stasheff [Sta63] was led to the definition of an A ∞ -algebra, or homotopy associative algebra, that is, a topological monoid together with an infinite tower of homotopies correcting coherently the defect of associativity of the product.Such a structure defines a homotopy invariant characterization of loop spaces: a space is a loop space if and only if it possesses an A ∞ -algebra structure, encoded by the associahedra.
These associahedra in turn form an A ∞ operad, equivalent to the little intervals operads.An operad is an algebraic structure encoding a type of algebras (for instance, associative, commutative, Lie algebras, or A ∞ -algebras in this case).See [Sta04,MSS02,LV12,Val14,Gir18]    on iterated loop spaces, where he proved the recognition principle, generalizing J. Stasheff's result: a space is a k-fold loop space (space of functions from the k-dimensional sphere to a pointed topological space, sending the north pole to the base point) if and only if it is an algebra over the little k-cubes operad.Today, operads are ubiquitous in mathematics: in addition to algebraic topology, they are used in differential geometry, algebraic geometry, non-commutative geometry, mathematical physics and probability, among other fields [MSS02,LV12].Many of these fields interact in the work [DSV19] where the toric varieties associated with Loday's associahedra are used to define a non-symmetric analogue of the little 2-cubes operad, leading to a non-commutative notion of cohomological field theory with Givental-type symmetries.5.2.Cellular diagonal of the associahedron.Taking cellular chains on associahedra one arrives to the algebraic version of an A ∞ -algebra.This algebraic structure plays a prominent role in many fields, for instance in symplectic topology where it describes the fine structure of the Fukaya category of a symplectic manifold [Sei08].In this context, but also in others such as the study of the homology of fibered spaces [Pro86], one is led to the problem of defining a universal tensor product of A ∞ -algebras, which can be achieved by the construction of a cellular approximation of the diagonal of the associahedra.
The diagonal of a polytope P is the map δ : P → P × P defined by x → (x, x).A cellular diagonal of P is a map δ : P → P × P homotopic to δ, which agrees with δ on the vertices of P , and whose image is a union of faces of P × P .For face-coherent families of polytopes (i.e. when faces are products of polytopes in the family, like simplices, cubes, permutahedra or associahedra), some algebraic purposes additionally require the cellular diagonal to be compatible with the face structure.Finding cellular diagonals in such families of polytopes is an important challenge at the crossroad of operad theory, homotopical algebra, combinatorics and discrete geometry, see [SU04,MS06,Lod11,MTTV21,LA22].
For the family of associahedra, algebraic diagonals were described in [SU04] and later in [MS06,Lod11].However, there were no known topological diagonals as defined above, until the recent work of [MTTV21] defining a cellular diagonal ∆ n for (a weighted version of) the associahedron Asso(n) of [Lod04,SS93] (and recovering, at the cellular level, all the previous formulas [SU22, DOJVLA + 23]).We note that the method of [MTTV21] essentially relies on the theory of fiber polytopes of [BS92], and enables to see the cellular diagonal of the associahedron as a polytopal complex refining the associahedron, see Figure 15.
The face structure of the cellular diagonal ∆ n is given by the magical formula [MTTV21].Namely, the k-dimensional faces correspond to the pairs (F, G) of faces of the associahedron Asso(n) with dim(F ) + dim(G) = k and max(F ) ≤ min(G) (where ≤, max and min refer to the order given by the Tamari lattice).See Figure 16.In particular, the vertices of ∆ n correspond to intervals of the Tamari lattice, which are counted by 2 (3n + 1)(3n + 2) 4n + 1 n + 1 as proved in [Cha07,Cha18].This formula also counts the rooted 3-connected planar triangulations with 2n+2 faces, and explicit bijections were given in [BB09,FFN23].More generally, the f -vector of ∆ n is given by as proved in [BCP23,FFN23].Note that the construction of the diagonal ∆ n , its face description by the magical formula, and the product formulas for its f -vector all rely essentially on the fact that the normal fan of the associahedron is the sylvester fan and behaves nicely with the Tamari lattice (Section 1).

Further generalizations
We believe that the main impact of Loday's description of the associahedron was to break the psychological barrier of realizing this "mythical polytope" [Hai84] by showing a natural and well-behaved realization.Consequently, this construction was the first seed of a teeming forest of polytopal realizations of combinatorial structures.Even if it is impossible to cite all its descendants, we conclude with a partial list of polytopes obtained from Loday's associahedron, with pointers to the literature for the interested readers.
We hope that this survey invites the reader to develop further the family of these associahedra.

Figure 3 .
Figure 3. Four examples of permutrees.The first is generic, and the last three use specific decorations corresponding to permutations, binary trees, and binary sequences.[PP18, Fig. 2 & 3].
• the deformation cone of a quotientope QT(≡) is simplicial if and only if the congruence ≡ is refined by a Cambrian congruence [APR21, PP23].• generalizing the Hopf algebras of [MR95, LR98, GKL + 95] described in Section 1.3, various Hopf algebra structures have been investigated, either on specific congruences [Rea05, LR12, Gir12, CP17, PP18, Pil18, Law14, NRT11], or on all lattice quotients [Pil19].2.4.Beyond the braid arrangement.Consider now a central hyperplane arrangement H defining a fan F, and a distinguished base region B of F. The poset of regions R(H, B) is the set of regions of F ordered by inclusion of their separating sets (the set of hyperplanes of H that separate the given region form the base region B).For instance, the poset of region is the weak order on W when H is the Coxeter arrangement of a finite Coxeter group W [Hum90, BB05].In general, the poset of regions R( the diameters of the mutation graphs of the finite type cluster algebras have been determined in[Pou14,CP16,Pou17], see[CP16, Tab.2].Moreover, all generalized associahedra have the non-leaving face property[CP16,Wil17].• the realizations of[HPS18] are removahedra of the underlying zonotope only when the initial seed is acyclic (hence the resulting generalized associahedron coincides with that of[HLT11]) or when the cluster algebra is of type A. See Figure 8. • the vertex barycenters of all generalized associahedra of [HLT11, HPS18] coincide with that of the Coxeter permutahedron [PS15b, HPS18].• the deformation cone of a generalized associahedron of [HLT11, HPS18] is always simplicial [BMCLD + 18, PPPP19].The rays of this deformation cone are (positive dilations of) the Newton polytopes of the F -polynomials [FZ07] of the cluster variables of the cluster algebra [BMCLD + 18].
for illustrations): • triangulations of a convex polygon [Woo04, PP12, Stu11, SS12].• k-triangulations of a convex polygon [PS09, PP12, Stu11, SS12].A k-triangulation of a convex (n + 2k)-gon is a maximal set of diagonals such that no k + 1 of them are pairwise crossing [CP92, Jon05, Nak00, DKM02, PS09].Some of the corresponding brick polytopes are illustrated in Figure 11.We note that these particular subword complexes have various connections with lattice quotients and Hopf algebras discussed in Sections 1 and 2 [Pil18].• pseudotriangulations of a point set P in general position (no line contains three points).A pseudotriangulations of P is a maximal pointed crossing-free set of edges between points of P [PV96, RSS08].Pseudotriangulations correspond to the vertices of the pseudotriangulation polytope of [RSS03].• pseudotriangulations of a set of disjoint convex bodies in general position (no line is tangent to three convex bodies).

Figure 10 .
Figure 10.Sorting networks interpretations of certain geometric graphs: a triangulation of the convex octagon, a 2-triangulation of the convex octagon, a pseudotriangulation of a point set, and a pseudotriangulation of a set of disjoint convex bodies.[PS15a, Fig. 6].
for introductions and references.The notion of operad first appeared in the seminal work of P. May[May72]

Figure 16 .
Figure 16.The diagonal of the 2-dimensional associahedron, where faces are labeled by pairs of Schröder trees (left) and attached to their max-min pair of binary trees given by the magical formula (right).Adapted from [BCP23, Fig. 2].