zbMATH — the first resource for mathematics

Greedy elements in rank 2 cluster algebras. (English) Zbl 1295.13031
Cluster algebras, invented by S. Fomin and A. Zelevinsky [J. Am. Math. Soc. 15, No. 2, 497–529 (2002; Zbl 1021.16017)] in order to study total positivity in algebraic groups and canonical bases in quantum groups, are a class of commutative algebras endowed with a distinguished set of generators, the cluster variables. The cluster variables are grouped into finite subsets, called clusters, and are defined recursively from initial variables through mutation on the clusters. A lot of recent activity in the field has been directed towards various constructions of “natural” bases in cluster algebras. One of the approaches to this problem was developed by P. Sherman and A. Zelevinsky [Mosc. Math. J. 4, No. 4, 947–974 (2004; Zbl 1103.16018)] who have shown that the indecomposable positive elements form an integer basis in any rank \(2\) cluster algebra of finite or affine type and suspected that this property does not extend beyond affine types. Sherman and Zelevinsky introduced a special family of greedy elements in (the completion of) an arbitrary rank 2 cluster algebra \(\mathcal{A}\), and made several conjectures about them, including the claim that all these elements are indecomposable positive elements, and that they form a \(\mathbb{Z}\)-basis in \(\mathcal{A}\).
In the present paper, the authors study greedy elements and proved all the conjectures mentioned above. In particularly, the authors constructed a new basis in any rank 2 cluster algebra called the greedy basis which consists of a special family of indecomposable positive elements called greedy elements. The key new ingredient is an explicit combinatorial expression for greedy elements inspired by an expression for cluster variables given in [K. Lee and R. Schiffler, J. Algebr. Comb. 37, No. 1, 67–85 (2013; Zbl 1266.13017); Compos. Math. 148, No. 6, 1821–1832 (2012; Zbl 1266.16027); D. Rupel, C. R., Math., Acad. Sci. Paris 350, No. 21–22, 929–932 (2012; Zbl 1266.16028)].

13F60 Cluster algebras
Full Text: DOI arXiv
[1] Berenstein, A; Fomin, S; Zelevinsky, A, Cluster algebras III: upper bounds and double Bruhat cells, Duke Math. J., 126, 1-52, (2005) · Zbl 1135.16013
[2] Berenstein, A., Zelevinsky, A.: Triangular bases in quantum cluster algebras. Intern. Math. Res. Notices (to appear). · Zbl 1303.13026
[3] Fomin, S; Zelevinsky, A, The Laurent phenomenon, Adv. Appl. Math., 28, 119-144, (2002) · Zbl 1012.05012
[4] Fomin, S; Zelevinsky, A, Cluster algebras I: foundations, J. Am. Math. Soc., 15, 497-529, (2002) · Zbl 1021.16017
[5] Fomin, S; Zelevinsky, A, Cluster algebras IV: coefficients, Compos. Math., 143, 112-164, (2007) · Zbl 1127.16023
[6] Kac, V.: Infinite Dimensional Lie Algebras, 3rd edn. Cambridge University Press, Cambridge (1990) · Zbl 0716.17022
[7] Lee, K., Schiffler, R.: A combinatorial formula for rank 2 cluster variables. J. Algebraic Comb. (to appear). http://www.springerlink.com/content/66v123492t622337 · Zbl 1266.13017
[8] Lee, K., Schiffler, R.: Proof of a positivity conjecture of M. Kontsevich on noncommutative cluster variables. Compos. Math. (to appear). http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=8730703&fulltextType=RA&fileId=S0010437X12000425 · Zbl 1266.16027
[9] Plamondon, P.-G.: Generic bases for cluster algebras from the cluster category. Intern. Math. Res. Notices (to appear). http://imrn.oxfordjournals.org/content/early/2012/04/11/imrn.rns102.short?rss=1 · Zbl 1317.13055
[10] Rupel, D.: Proof of the Kontsevich non-commutative cluster positivity conjecture. Comptes Rendus Math. 350(21-22), 929-932 (2012) · Zbl 1266.16028
[11] Sherman, P; Zelevinsky, A, Positivity and canonical bases in rank 2 cluster algebras of finite and affine types, Mosc. Math. J., 4, 947-974, (2004) · Zbl 1103.16018
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.