Related papers: Amplitubes: Graph Cosmohedra
It has been a long-standing challenge to find a geometric object underlying the cosmological wavefunction for Tr($\phi^3$) theory, generalizing associahedra and surfacehedra for scattering amplitudes. In this note we describe a new class of…
Scattering amplitudes of $\operatorname{tr}(\phi^3)$ theory can be encoded as the canonical form of the Stasheff associahedron. Similarly, the flat-space wavefunction coefficients of the same theory are captured by the recently proposed…
A graph associahedron is a polytope dual to a simplicial complex whose elements are induced connected subgraphs called tubes. Graph associahedra generalize permutahedra, associahedra, and cyclohedra, and therefore are of great interest to…
In a remarkable recent work [arXiv : 1711.09102] by Arkani-Hamed et al, the amplituhedron program was extended to the realm of non-supersymmetric scattering amplitudes. In particular it was shown that for tree-level planar diagrams in…
Graph associahedra are generalized permutohedra arising as special cases of nestohedra and hypergraphic polytopes. The graph associahedron of a graph $G$ encodes the combinatorics of search trees on $G$, defined recursively by a root $r$…
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…
Recently, "cosmohedra" have been introduced as polytopes underlying the cosmological wavefunction for conformally coupled Tr($\Phi^3$) theory in FRW cosmologies, generalizing associahedra for flat space scattering amplitudes. In this letter…
Given a graph its set of connected subgraphs (tubes) can be defined in two ways: either by considering subsets of edges, or by considering subsets of vertices. We refer to these as binary tubes and unary tubes respectively. Both notions…
The "amplituhedron" for tree-level scattering amplitudes in the bi-adjoint $\phi^3$ theory is given by the ABHY associahedron in kinematic space, which has been generalized to give a realization for all finite-type cluster algebra…
In this note we make a field-theoretical derivation of a series of new recursion relations by a one-parameter deformation of kinematic variables for tree and one-loop amplitudes of bi-adjoint $\phi^3$ theory. Tree amplitudes are given by…
We investigate a family of polytopes introduced by E.M.\ Feichtner, A.\ Postnikov and B.\ Sturmfels, which were named nestohedra. The vertices of these polytopes may intuitively be understood as constructions of hypergraphs. Limit cases in…
The geometric structure of S-matrix encapsulated by the "Amplituhedron program" has begun to reveal itself even in non-supersymmetric quantum field theories. Starting with the seminal work of Arkani-Hamed, Bai, He and Yan it is now…
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…
A graph associahedron is a simple polytope whose face lattice encodes the nested structure of the connected subgraphs of a given graph. In this paper, we study certain graph properties of the 1-skeleta of graph associahedra, such as their…
An associahedron is a polytope whose vertices correspond to triangulations of a convex polygon and whose edges correspond to flips between them. Using labeled polygons, C. Hohlweg and C. Lange constructed various realizations of the…
Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of…
Given a graph G, the graph associahedron is a simple convex polytope whose face poset is based on the connected subgraphs of G. With the additional assignment of a color palette, we define the colorful graph associahedron, show it to be a…
We consider amplituhedron-like geometries which are defined in a similar way to the intrinsic definition of the amplituhedron but with non-maximal winding number. We propose that for the cases with minimal number of points the canonical…
Given a simple graph G, the graph associahedron KG is a simple polytope whose face poset is based on the connected subgraphs of G. This paper defines and constructs graph associahedra in a general context, for pseudographs with loops and…
To any graph $G$ one can associate a toric variety $X(\mathcal{P}G)$, obtained as a blowup of projective space along coordinate subspaces corresponding to connected subgraphs of $G$. The polytope of this toric variety is the graph…