Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
92 tokens/sec
Gemini 2.5 Pro Premium
46 tokens/sec
GPT-5 Medium
19 tokens/sec
GPT-5 High Premium
32 tokens/sec
GPT-4o
87 tokens/sec
DeepSeek R1 via Azure Premium
98 tokens/sec
GPT OSS 120B via Groq Premium
435 tokens/sec
Kimi K2 via Groq Premium
207 tokens/sec
2000 character limit reached

Factorial cluster algebras (1110.1199v4)

Published 6 Oct 2011 in math.RA

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.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube