An approach to non simply laced cluster algebras
G. Dupont

TL;DR
This paper studies non simply laced cluster algebras via automorphisms of valued graphs, establishing their relation to quotient cluster algebras and proving mutation-finiteness for affine cases.
Contribution
It introduces a method to relate cluster algebras of valued graphs with automorphisms to quotient cluster algebras, extending understanding of their structure and finiteness properties.
Findings
Cluster algebra of the quotient graph is a subalgebra of the quotient of the original algebra.
For Dynkin diagrams, the quotient and the algebra of the automorphism group coincide.
Affine valued graphs are mutation-finite, providing an alternative proof to previous results.
Abstract
Let be an oriented valued graph equipped with a group of admissible automorphisms satisfying a certain stability condition. We prove that the (coefficient-free) cluster algebra associated to the valued quotient graph is a subalgebra of the quotient of the cluster algebra associated to by the action of . When is a Dynkin diagram, we prove that and coincide. As an example of application, we prove that affine valued graphs are mutation-finite, giving an alternative proof to a result of Seven.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Topics in Algebra · Advanced Algebra and Geometry
