A combinatorial model for computing volumes of flow polytopes
Article with Carolina Benedetti, Rafael Gonzalez D’Leon, Christopher R. H. Hanusa, Apoorva Khare, Alejandro Morales and Martha Yip.
Abstract
We introduce new families of combinatorial objects whose enumeration com- putes volumes of flow polytopes. These objects provide an interpretation, based on parking functions, of Baldoni and Vergne’s generalization of a volume formula originally due to Lid- skii. We recover known flow polytope volume formulas and prove new volume formulas for flow polytopes that were seemingly unapproachable. A highlight of our model is an elegant formula for the flow polytope of a graph we call the caracol graph.
As by-products of our work, we uncover a new triangle of numbers that interpolates between Catalan numbers and the number of parking functions, we prove the log-concavity of rows of this triangle along with other sequences derived from volume computations, and we introduce a new Ehrhart-like polynomial for flow polytope volume and conjecture product formulas for the polytopes we consider.
Really enjoying the caracol graph result here - love how parking functions tie into this so elegantly. By the way, if anyone wants to check if your screen is running smooth while reading papers like this, a quick monitor fps test or display fps test online can be handy. I ran a monitor frame rate test earlier and everything looked great.
I liked the practical information shared in this post. It gives readers a clear idea of the subject without making the explanation complicated. While doing some research, I also came across jaya9 best. Looking at related resources can provide useful background and help readers become more familiar with online entertainment topics.
Every race in Smash Karts can become unpredictable when players use different power-ups, change their routes, avoid incoming attacks, and look for the right moment to overtake opponents or create an advantage during the competition.