Snake Graphs for Graph LP Algebras (2312.12313v1)

Abstract: Graph LP algebras are a generalization of cluster algebras introduced by Lam and Pylyavskyy. We provide a combinatorial proof of positivity for certain cluster variables in these algebras. This proof uses a hypergraph generalization of snake graphs, a class of planar graphs which were used by Musiker, Schiffler, and Williams to prove positivity for cluster algebras from surfaces. These results extend those given in our previous paper, where we used a related combinatorial object known as a $T$-path.