Related papers: Amplitubes: Graph Cosmohedra
Generalized permutahedra are the polytopes obtained from the permutahedron by changing the edge lengths while preserving the edge directions, possibly identifying vertices along the way. We introduce a "lifting" construction for these…
In this note we continue the exploration of the polytope picture for scattering amplitudes, where amplitudes are associated with the volumes of polytopes in generalized momentum-twistor spaces. After a quick warm-up example illustrating the…
We describe many different realizations with integer coordinates for the associahedron (i.e. the Stasheff polytope) and for the cyclohedron (i.e. the Bott-Taubes polytope) and compare them to the permutahedron of type A_n and B_n…
We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…
Given an undirected graph, the non-empty subgraph polytope is the convex hull of the characteristic vectors of pairs (F, S) where S is a non-empty subset of nodes and F is a subset of the edges with both endnodes in S. We obtain a strong…
Given a graph $G$ one can define the cut polytope CUTP(G) and the metric polytope METP(G) of this graph and those polytopes encode in a nice way the metric on the graph. According to Seymour's theorem, CUTP(G) = METP(G) if and only if K_5…
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…
Inspired by the closed contour of momentum conservation in an interaction, we introduce an integrable one-dimensional theory that underlies some integrable models such as the Kadomtsev-Petviashvili (KP)-hierarchy and the amplituhedron. In…
An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…
For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…
The amplituhedron is a mathematical object which was introduced to provide a geometric origin of scattering amplitudes in $\mathcal{N}=4$ super Yang Mills theory. It generalizes \emph{cyclic polytopes} and the \emph{positive Grassmannian},…
The (tree) amplituhedron A(n,k,m) is the image in the Grassmannian Gr(k,k+m) of the totally nonnegative part of Gr(k,n), under a (map induced by a) linear map which is totally positive. It was introduced by Arkani-Hamed and Trnka in 2013 in…
We give a simple algebraic description of opetopes in terms of chain complexes, and we show how this description is related to combinatorial descriptions in terms of treelike structures. More generally, we show that the chain complexes…
The symmetric edge polytope ($\mathrm{SEP}$) of a finite simple graph $G$ is a centrally symmetric lattice polytope whose vertices are defined by the edges of the graph. Among the information encoded by these polytopes are the symmetries of…
Higher derivations on an associative algebra generalizes higher order derivatives. We call a tuple consisting of an algebra and a higher derivation on it by an AssHDer pair. We define a cohomology for AssHDer pairs with coefficients in a…
The hypersimplex $\Delta_{k+1,n}$ is the image of the positive Grassmannian $Gr^{\geq 0}_{k+1,n}$ under the moment map. It is a polytope of dimension $n-1$ in $\mathbb{R}^n$. Meanwhile, the amplituhedron $\mathcal{A}_{n,k,2}(Z)$ is the…
Candelas and Font introduced the notion of a `top' as half of a three dimensional reflexive polytope and noticed that Dynkin diagrams of enhanced gauge groups in string theory can be read off from them. We classify all tops satisfying a…
Given a configuration $A$ of $n$ points in $\mathbb{R}^{d-1}$, we introduce the higher secondary polytopes $\Sigma_{A,1},\dots, \Sigma_{A,n-d}$, which have the property that $\Sigma_{A,1}$ agrees with the secondary polytope of…
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
Recent progress on flow polytopes indicates many interesting families with product formulas for their volume. These product formulas are all proved using analytic techniques. Our work breaks from this pattern. We define a family of closely…