相关论文: Equivalence Between Four Models of Associahedra
In the early 1990's, Billera and Sturmfels introduced the monotone path polytope (MPP), a special case of the general theory of fiber polytopes that associates a polytope to a pair $(P,\varphi)$ of a polytope $P$ and linear functional…
The cosmohedron was recently proposed as a polytope underlying the cosmological wavefunction for $\text{Tr}(\Phi^3)$ theory. Its faces were conjectured to be in bijection with Matryoshkas, which are obtained from a subdivision of a polygon…
We study the connection between multimatroids and moduli spaces of rational curves with cyclic action. Multimatroids are generalizations of matroids and delta-matroids introduced by Bouchet, which naturally arise in topological graph…
We propose a simple formula for the coordinates of the vertices of the Stasheff polytope (associahedron) and we compare it to the permutohedron.
Standard combinatorial construction, due to Kontsevich, associates to any $\ai$-algebra with an invariant inner product, an inhomogeneous class in the cohomology of the moduli spaces of Riemann surfaces with marked points. We propose an…
A well-known construction of associahedra comes from truncations of simplices. Motivated by compactifications of point configurations, we show associahedra as truncations of certain products of simplices. This is then used to provide a…
We provide a piecewise linear isomorphism from the normal fan of the pivot polytope of a product of simplices to the normal fan of a shuffle of associahedra.
Two finitely generated monoids are constructed, one finitely presented the other not, whose (directed, unlabelled) Cayley graphs are isomorphic.
Taking a representation-theoretic viewpoint, we construct a continuous associahedron motivated by the realization of the generalized associahedron in the physical setting. We show that our associahedron shares important properties with the…
We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of…
A digraph is connected-homogeneous if every isomorphism between two finite connected induced subdigraphs extends to an automorphism of the whole digraph. In this paper, we completely classify the countable connected-homogeneous digraphs.
The second author introduced 2-associahedra as a tool for investigating functoriality properties of Fukaya categories, and he conjectured that they could be realized as face posets of convex polytopes. We introduce a family of posets called…
Wythoff's construction associates a uniform polytope to a Coxeter diagram whose vertices are decorated with crosses, which indicate the subgroup stabilizing a generic point. Champagne, Kjiri, Patera, and Sharp remarked that by associating…
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…
Let $K$ be a finite group and let $G$ be a finite group acting on $K$ by automorphisms. In this paper we study two different but intimately related subjects: on the one side we classify all possible multiplicative and associative structures…
This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…
We survey three settings in which dimensions of intersection cohomology groups of algebraic varieties provide deep combinatorial and representation-theoretic information, and computations of the groups themselves have been made using…
This paper investigates the problem of listing faces of combinatorial polytopes, such as hypercubes, permutahedra, associahedra, and their generalizations. Firstly, we consider the face lattice, which is the inclusion order of all faces of…
We work with combinatorial maps to represent graph embeddings into surfaces up to isotopy. The surface in which the graph is embedded is left implicit in this approach. The constructions herein are proof-relevant and stated with a subset of…
Monotone path polytopes arise as a special case of the construction of fiber polytopes, introduced by Billera and Sturmfels. A simple example is provided by the permutahedron, which is a monotone path polytope of the standard unit cube. The…