<p>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 <i>T</i>-path.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Hydra Graphs for Graph LP Algebras

  • Esther Banaian,
  • Sunita Chepuri,
  • Elizabeth Kelley,
  • Sylvester W. Zhang

摘要

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.