Search arXivSearch

arXiv · 2406.15803

Root polytopes, flow polytopes, and order polytopes

Abstract

In this paper we study the class of polytopes which can be obtained by taking the convex hull of some subset of the points $\{e_i-e_j \ \vert \ i \neq j\} \cup \{\pm e_i\}$ in $\mathbb{R}^n$, where $e_1,\dots,e_n$ is the standard basis of $\mathbb{R}^n$. Such a polytope can be encoded by a quiver $Q$ with vertices $V \subseteq \{v_1,\dots,v_n\} \cup \{\star\}$, where each edge $v_j\to v_i$ or $\star \to v_i$ or $v_i\to \star$ gives rise to the point $e_i-e_j$ or $e_i$ or $-e_i$, respectively; we denote the corresponding polytope as $\operatorname{Root}(Q)$. These polytopes have been studied extensively under names such as edge polytope and root polytope. We show that if the quiver $Q$ is strongly-connected then the root polytope $\operatorname{Root}(Q)$ is reflexive and terminal; we moreover give a combinatorial description of the facets of $\operatorname{Root}(Q)$. We also show that if $Q$ is planar, then $\operatorname{Root}(Q)$ is (integrally equivalent to the) polar dual of the flow polytope of the dual quiver. Finally we consider the case that $Q$ comes from a ranked poset $P$, and show that $\operatorname{Root}(Q)$ is polar dual to (a translation of) a marked poset polytope. We then study the toric variety $Y(\mathcal{F}_Q)$ associated to the face fan $\mathcal{F}_Q$ of $\operatorname{Root}(Q)$. If $Q$ comes from a ranked poset $P$ we give a combinatorial description of the Picard group of $Y(\mathcal{F}_Q)$, and we show that $Y(\mathcal{F}_Q)$ is a small partial desingularisation of the Hibi toric variety $Y_{\mathcal{O}(P)}$ of the order polytope $\mathcal{O}(P)$. We show that $Y(\mathcal{F}_Q)$ has a small crepant toric resolution of singularities $Y(\widehat{\mathcal{F}}_Q)$, and as a consequence that the Hibi toric variety $Y_{\mathcal{O}(P)}$ has a small resolution of singularities for any ranked poset $P$. These results have applications to mirror symmetry.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Konstanze Rietsch, Lauren Williams. 2025-06-12. Root polytopes, flow polytopes, and order polytopes. https://arxiv.org/abs/2406.15803

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