Polynomial recognition of cluster algebras of finite type

DOI10.1016/j.jalgebra.2016.03.027zbMath1378.13016arXiv1507.03844OpenAlexW2962806090MaRDI QIDQ279747

Diane Castonguay, Elisângela Silva Dias

Publication date: 29 April 2016

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.03844

zbMATH Keywords

algorithmfinite typecluster algebra

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cluster algebras (13F60)

Related Items (1)

Polynomial-time Classification of Skew-symmetrizable Matrices with a Positive Definite Quasi-Cartan Companion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Positivity for cluster algebras from surfaces
• Recognizing cluster algebras of finite type
• A correction to Colbourn's paper on the complexity of matrix symmetrizability
• Cluster algebras. II: Finite type classification
• On cyclically orientable graphs
• Cluster algebras I: Foundations
• The Mutation Class ofD_nQuivers
• Cluster algebras of infinite rank
• CLUSTER ALGEBRAS OF FINITE TYPE AND POSITIVE SYMMETRIZABLE MATRICES
• Depth-First Search and Linear Graph Algorithms
• Quivers with relations arising from clusters (𝐴_{𝑛} case)

This page was built for publication: Polynomial recognition of cluster algebras of finite type