Indexed metadata
Positivity for graph Laurent phenomenon algebras
Ross Glew
Source abstract
Laurent phenomenon algebras were introduced by Lam and Pylyavskyy as a generalisation of cluster algebras. For a family associated with directed graphs, they showed that every cluster variable is a Laurent polynomial in the variables of any cluster and conjectured that these expansions have nonnegative coefficients. We prove this conjecture for all directed graphs without loops or multiple edges with respect to an arbitrary seed cluster.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.