Search arXivSearch

arXiv · 2501.17249

When alcoved polytopes add

Abstract

Alcoved polytopes are characterized by the property that all facet normal directions are parallel to the roots $e_i-e_j$. Unlike other prominent families of polytopes, like generalized permutahedra, alcoved polytopes are not closed under Minkowski sums. We nonetheless show that the Minkowski sum of a collection of alcoved polytopes is alcoved if and only if each pairwise sum is alcoved. This implies that the type fan of alcoved polytopes is determined by its two-dimensional cones. Moreover, we provide a complete characterization of when the Minkowski sum of alcoved simplices is again alcoved via a graphical criterion on pairs of ordered set partitions. Our characterization reduces to checking conditions on restricted partitions of length at most six. In particular, we show how the Minkowski sum decompositions of the two most well-known families of alcoved polytopes, the associahedron and the cyclohedron, fit in our framework. Additionally, inspired by the physical construction of one-loop scattering amplitudes, we present a new infinite family of alcoved polytopes, called $\widehat{D}_n$ polytopes. We conclude by drawing a connection to matroidal blade arrangements and the Dressian.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nick Early, Lukas Kühne, Leonid Monin. 2025-11-04. When alcoved polytopes add. https://arxiv.org/abs/2501.17249

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