Resumen de Greedy elements in rank 2 cluster algebras

Kyungyong Lee, Li Li, Andrei Zelevinsky

• A lot of recent activity in the theory of cluster algebras has been directed toward various constructions of “natural” bases in them. One of the approaches to this problem was developed several years ago by Sherman and Zelevinsky who have shown that the indecomposable positive elements form an integer basis in any rank 2 cluster algebra of finite or affine type. It is strongly suspected (but not proved) that this property does not extend beyond affine types. Here, we go around this difficulty by constructing a new basis in any rank 2 cluster algebra that we call the greedy basis. It consists of a special family of indecomposable positive elements that we call greedy elements. Inspired by a recent work of Lee and Schiffler; Rupel, we give explicit combinatorial expressions for greedy elements using the language of Dyck paths.