Greedy bases in rank 2 generalized cluster algebras
Rings and Algebras
2013-09-11 v1 Combinatorics
Abstract
In this note we extend the notion of greedy bases developed by Lee, Li, and Zelevinsky to rank two generalized cluster algebras, i.e. binomial exchange relations are replaced by polynomial exchange relations. In the process we give a combinatorial construction in terms of a refined notion of compatible pairs on a maximal Dyck path.
Keywords
Cite
@article{arxiv.1309.2567,
title = {Greedy bases in rank 2 generalized cluster algebras},
author = {Dylan Rupel},
journal= {arXiv preprint arXiv:1309.2567},
year = {2013}
}
Comments
25 pages