Rooted Clusters for Graph LP Algebras
arXiv:2107.14785 · doi:10.3842/SIGMA.2022.089
Abstract
LP algebras, introduced by Lam and Pylyavskyy, are a generalization of cluster algebras. These algebras are known to have the Laurent phenomenon, but positivity remains conjectural. Graph LP algebras are finite LP algebras encoded by a graph. For the graph LP algebra defined by a tree, we define a family of clusters called rooted clusters. We prove positivity for these clusters by giving explicit formulas for each cluster variable. We also give a combinatorial interpretation for these expansions using a generalization of -paths.
References in corpus (8)
- Cluster algebras and triangulated surfaces. Part II: Lambda lengths
- Noncrossing partitions and representations of quivers
- Bipartite Field Theories: from D-Brane Probes to Scattering Amplitudes
- Discrete integrable systems and Poisson algebras from cluster maps
- Enumerative properties of generalized associahedra
- Tilting theory and cluster algebras
- T-Path Formula and Atomic Bases for Cluster Algebras of Type D
- An Expansion Formula for Decorated Super-Teichmüller Spaces