Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2601.08150

Flows on graphs with cycles, locally gentle algebras, and the Mutoperhedron

Antoine Abram·Jose Bastidas·Benjamin Dequêne·Alejandro H. Morales·GaYee Park·Hugh Thomas
View original source ↗Read source document ↗Export metadata ↓

Abstract

Flow cones of a directed acyclic graph admit a family of unimodular triangulations given by Danilov, Karzanov, and Koshevoy (DKK) whose normal fans are related to (generalizations) of the associahedron and permutahedron. A correspondence between these triangulations for certain graphs and maximal cones of a $g$-vector fan of a gentle quiver associated to the graph was discovered by von Bell, Braun, Bruegge, Hanely, Peterson, Serhiyenko, and Yip in 2022. This correspondence has been fruitful in uncovering lattice structures in the triangulations. We start by showing that this correspondence is actually a linear isomorphism. We then consider flow cones of certain graphs with cycles. For this case, we give a DKK-like triangulation of the cone, and extend the correspondence to the finite $g$-vector fan of a corresponding locally gentle quiver. In addition, we extend to cyclic graphs a mysterious result of Postnikov--Stanley and Baldoni--Vergne, giving the volume of flow polytopes of acyclic graphs as the number of certain integer flows on the same graph. We illustrate our results with a two-parameter family of cyclic graphs that includes a cycle graph and nested 2-cycles as special cases. We show that the fans of its DKK-like triangulations are respectively isomorphic to the normal fan of the cyclohedron and of a new polytope with the same $f$-vector but different combinatorial type than the permutohedron, which we call the mutoperhedron.

Explore related subjects

math.COmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antoine Abram, Jose Bastidas, Benjamin Dequêne, Alejandro H. Morales, GaYee Park, Hugh Thomas. 2026-03-16. Flows on graphs with cycles, locally gentle algebras, and the Mutoperhedron. https://arxiv.org/abs/2601.08150

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗