Related papers: Amplitubes: Graph Cosmohedra
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…
M. Carr and S. Devadoss introduced in [7] the notion of tubing on a finite simple graph $\Gamma$, in the context of configuration spaces on the Hilbert plane. To any finite simple graph $\Gamma$ they associated a finite partially ordered…
We describe a new sequence of polytopes which characterize A_infinity maps from a topological monoid to an A_infinity space. Therefore each of these polytopes is a quotient of the corresponding multiplihedron. Later term(s) in our sequence…
In the recent works [arXiv:1803.05809],[arXiv: 1806.01842], Halohedron emerged as amplituhedron for 1-loop planar diagrams in bi-adjoint massless $\phi^3$ theory. Halohedron is a specific case of graph cubeahedron where the considered graph…
Generalized associahedra are a well-studied family of polytopes associated to a finite-type cluster algebra and choice of starting cluster. We show that the generalized associahedra constructed by Padrol, Palu, Pilaud, and Plamondon,…
Given a graph G, we construct a simple, convex polytope whose face poset is based on the connected subgraphs of G. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that…
This paper introduces an inductively defined tree notation for all the faces of polytopes arising from a simplex by truncations. This notation allows us to view inclusion of faces as the process of contracting tree edges. Our notation…
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…
Nestohedra are a family of convex polytopes that includes permutohedra, associahedra, and graph associahedra. In this paper, we study an extension of such polytopes, called extended nestohedra. We show that these objects are indeed the…
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…
An elimination tree of a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $v$ and recursing on the connected components of $G-v$ to obtain the subtrees of $v$. The graph associahedron of $G$ is a…
Brick polytopes constitute a remarkable family of polytopes associated to the spherical subword complexes of Knutson and Miller. They were introduced for finite Coxeter groups by Pilaud and Stump, who used them to produce geometric…
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…
This is a chapter in an upcoming Tamari Festscrift. Permutahedra are a class of convex polytopes arising naturally from the study of finite reflection groups, while generalized associahedra are a class of polytopes indexed by finite…
Motivated by the recent discovery of hidden zeros in particle and string amplitudes, we characterize zeros of individual graph contributions to the cosmological wavefunction of a scalar field theory. We demonstrate that these contributions…
The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…
We present a combinatorial isomorphism between Stasheff associahedra and an inductive cone construction of those complexes given by Loday. We give an alternate description of certain polytopes, known as multiplihedra, which arise in the…
The tree amplituhedra $\mathcal{A}_{n,k}^{(m)}$ are mathematical objects generalising the notion of polytopes into the Grassmannian. Proposed for $m=4$ as a geometric construction encoding tree-level scattering amplitudes in planar…
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…
Every n-edge colored n-regular graph G naturally gives rise to a simple abstract n-polytope, the colorful polytope of G, whose 1-skeleton is isomorphic to G. The paper describes colorful polytope versions of the associahedron and…