Factorial cluster algebras

Abstract

We show that cluster algebras do not contain non-trivial units and that all cluster variables are irreducible elements. Both statements follow from Fomin and Zelevinsky's Laurent phenomenon. As an application we give a criterion for a cluster algebra to be a factorial algebra. This can be used to construct cluster algebras, which are isomorphic to polynomial rings. We also study various kinds of upper bounds for cluster algebras, and we prove that factorial cluster algebras coincide with their upper bounds.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…