2000 character limit reached
Volumes of flow polytopes related to caracol graphs (1911.10703v1)
Published 25 Nov 2019 in math.CO
Abstract: Recently, Benedetti et al. introduced an Ehrhart-like polynomial associated to a graph. This polynomial is defined as the volume of a certain flow polytope related to a graph and has the property that the leading coefficient is the volume of the flow polytope of the original graph with net flow vector $(1,1,\dots,1)$. Benedetti et al. conjectured a formula for the Ehrhart-like polynomial of what they call a caracol graph. In this paper their conjecture is proved using constant term identities, labeled Dyck paths, and a cyclic lemma.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.