Related papers: Higher-Categorical Associahedra
For any $r\geq 1$ and $\mathbf{n} \in \mathbb{Z}_{\geq0}^r \setminus \{\mathbf0\}$ we construct a poset $W_{\mathbf{n}}$ called a 2-associahedron. The 2-associahedra arose in symplectic geometry, where they are expected to control maps…
A~$k$-associahedron is a simplicial complex whose facets, called~$k$-triangulations, are the inclusion maximal sets of diagonals of a convex polygon where no~$k+1$ diagonals mutually cross. Such complexes are conjectured for about a decade…
Hohlweg and Lange (2007) and Santos (2004, unpublished) have found two different ways of constructing exponential families of realizations of the n-dimensional associahedron with normal vectors in {0,1,-1}^n, generalizing the constructions…
A new construction of the associahedron was recently given by Arkani-Hamed, Bai, He, and Yan in connection with the physics of scattering amplitudes. We show that their construction (suitably understood) can be applied to construct…
Given a finite Coxeter system $(W,S)$ and a Coxeter element $c$, we construct a simple polytope whose outer normal fan is N. Reading's Cambrian fan $F_c$, settling a conjecture of Reading that this is possible. We call this polytope the…
Graph associahedra are natural generalizations of the classical associahedra. They provide polytopal realizations of the nested complex of a graph $G$, defined as the simplicial complex whose vertices are the tubes (i.e. connected induced…
An associahedron is a polytope whose vertices correspond to the triangulations of a convex polygon and whose edges correspond to flips between them. A particularly elegant realization of the associahedron, due to S. Shnider and S. Sternberg…
In hep-th/0111053, a complete simplicial fan was associated to an arbitrary finite root system. It was conjectured that this fan is the normal fan of a simple convex polytope (a generalized associahedron of the corresponding type). Here we…
Motivated by the graph associahedron KG, a polytope whose face poset is based on connected subgraphs of G, we consider the notion of associativity and tubes on posets. This leads to a new family of simple convex polytopes obtained by…
This note which can be viewed as a complement to Alex Postnikov's paper math.CO/0507163, presents a self-contained overview of basic properties of nested complexes and their two dual polyhedral realizations: as complete simplicial fans, and…
A classic problem connecting algebraic and geometric combinatorics is the realization problem: given a poset, determine whether there exists a polytope whose face lattice is the poset. In 1990s, Kapranov defined a poset as a hybrid between…
Motivated by the theory of cluster algebras, F. Chapoton, S. Fomin and A. Zelevinsky associated to each finite type root system a simple convex polytope called \emph{generalized associahedron}. They provided an explicit realization of this…
We present complete simplicial fan realizations of any spherical subword complex of type $A_n$ for $n\leq 3$. This provides complete simplicial fan realizations of simplicial multi-associahedra $\Delta_{2k+4,k}$, whose facets are in…
In this paper, we introduce the notion of an admissible partition of a simplicial polyhedral fan and define the category of a partitioned fan as a generalisation of the $\tau$-cluster morphism category of a finite-dimensional algebra. This…
Motivated by the authors' work on permuto-associahedra, which can be considered as a symmetrization of the associahedron using the symmetric group, we introduce and study the $\mathfrak{G}$-symmetrization of an arbitrary polytope $P$ for…
For each poset $P$, we construct a polytope $A(P)$ called the $P$-associahedron. Similarly to the case of graph associahedra, the faces of $A(P)$ correspond to certain nested collections of subsets of $P$. The Stasheff associahedron is a…
We define a family of convex polytopes called constrainahedra, which index collisions of horizontal and vertical lines. Our construction proceeds by first defining a poset $C(m,n)$ of good rectangular preorders, then proving that $C(m,n)$…
We show that the mesh mutations are the minimal relations among the $\boldsymbol{g}$-vectors with respect to any initial seed in any finite type cluster algebra. We then use this algebraic result to derive geometric properties of the…
This paper introduces a new method to solve the problem of the approximation of the diagonal for face-coherent families of polytopes. We recover the classical cases of the simplices and the cubes and we solve it for the associahedra, also…
A famous construction of Gelfand, Kapranov and Zelevinsky associates to each finite point configuration $A \subset \mathbb{R}^d$ a polyhedral fan, which stratifies the space of weight vectors by the combinatorial types of regular…