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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
