pith. sign in

arxiv: 1110.1199 · v4 · pith:TNPGETQTnew · submitted 2011-10-06 · 🧮 math.RA

Factorial cluster algebras

classification 🧮 math.RA
keywords clusteralgebrasfactorialalgebraboundsupperapplicationcoincide
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.