Cluster algebras II: Finite type classification

By Sergey Fomin, Andrei Zelevinsky. 2002

1,087 citations recorded by the source corpus.

This paper continues the study of cluster algebras initiated in math.RT/0104151. Its main result is the complete classification of the cluster algebras of finite type, i.e., those with finitely many clusters. This classification turns out to be identical to the Cartan-Killing classification of semisimple Lie algebras and finite root systems, which is intriguing since in most cases, the symmetry exhibited by the Cartan-Killing type of a cluster algebra is not at all apparent from its geometric origin. The combinatorial structure behind a cluster algebra of finite type is captured by its cluster complex. We identify this complex as the normal fan of a generalized associahedron introduced and studied in hep-th/0111053 and math.CO/0202004. Another essential combinatorial ingredient of our arguments is a new characterization of the Dynkin diagrams.

Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematical Physics

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

How researchers see this paper

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

In Discrete Mathematics and Combinatorics

  1. B. Keller
  2. I. Reiten
  3. Bernard Leclerc
  4. Ralf Schiffler
  5. Pierre-Guy Plamondon
  6. Aslak Bakke Buan
  7. Sergey Fomin
  8. Osamu Iyama

In Geometry and Topology

  1. B. Keller
  2. I. Reiten
  3. Ralf Schiffler
  4. Bernard Leclerc
  5. Osamu Iyama
  6. Pierre-Guy Plamondon
  7. Aslak Bakke Buan
  8. Sergey Fomin

In Mathematical Physics

  1. B. Keller
  2. I. Reiten
  3. Osamu Iyama
  4. Bernard Leclerc
  5. Pierre-Guy Plamondon
  6. Ralf Schiffler
  7. C. Geiss
  8. Aslak Bakke Buan

Citations in the corpus