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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.