Search arXivSearch

arXiv · 1804.05460

Generalized permutohedra in the kinematic space

Abstract

In this note, we study the permutohedral geometry of the poles of a certain differential form introduced in recent work of Arkani-Hamed, Bai, He and Yan. There it was observed that the poles of the form determine a family of polyhedra which have the same face lattice as that of the permutohedron. We realize that family explicitly, proving that it in fact fills out the configuration space of a particularly well-behaved family of generalized permutohedra, the zonotopal generalized permutohedra, that are obtained as the Minkowski sums of line segments parallel to the root directions $e_i-e_j$. Finally we interpret Mizera's formula for the biadjoint scalar amplitude $m(\mathbb{I}_n,\mathbb{I}_n)$, restricted to a certain dimension $n-2$ subspace of the kinematic space, as a sum over the boundary components of the standard root cone, which is the conical hull of the roots $e_1-e_2,\ldots, e_{n-2}-e_{n-1}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nick Early. 2024-05-20. Generalized permutohedra in the kinematic space. https://arxiv.org/abs/1804.05460

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO