English

Volumes of flow polytopes related to caracol graphs

Combinatorics 2019-11-26 v1

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,,1)(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.

Keywords

Cite

@article{arxiv.1911.10703,
  title  = {Volumes of flow polytopes related to caracol graphs},
  author = {Jihyeug Jang and Jang Soo Kim},
  journal= {arXiv preprint arXiv:1911.10703},
  year   = {2019}
}

Comments

20 pages, 5 figures