Greedy elements in rank 2 cluster algebras

By Kyungyong Lee, Li Li, Andrei Zelevinsky. 2012

51 citations recorded by the source corpus.

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.

Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/ed87a1a79403310925adc84699181a300fec625a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. Dylan Rupel
  2. Max Glick
  3. Ralf Schiffler
  4. Kyungyong Lee
  5. Fan Qin
  6. Ilke Çanakçi
  7. Lauren K. Williams
  8. Gregg Musiker

In Discrete Mathematics and Combinatorics

  1. Kyungyong Lee
  2. Dylan Rupel
  3. Fan Qin
  4. Ralf Schiffler
  5. Max Glick
  6. Gregg Musiker
  7. Ilke Çanakçi
  8. Greg Muller

In Geometry and Topology

  1. Dylan Rupel
  2. Max Glick
  3. Fan Qin
  4. Ralf Schiffler
  5. Kyungyong Lee
  6. Ilke Çanakçi
  7. B. Keller
  8. Lauren K. Williams

Citations in the corpus