Effective Computation of Mutation Paths and Generators of Cluster Automorphism Groups

Abstract

In this paper, we improve the marked-vertex strategy introduced by Fu and Liang, and design the algorithm to compute all mutation paths and generator elements of cluster automorphism groups efficiently. As an application, we get generators of cluster automorphism groups of cluster algebras of finite mutation type of rank 4.