Cluster automorphism groups of cluster algebras of finite type (Q897777): Difference between revisions

The authors study cluster automorphisms over coefficient free cluster algebras of finite type. The notion of cluster automorphism was introduced by \textit{I. Assem} et al. [Proc. Lond. Math. Soc. (3) 104, No. 6, 1271--1302 (2012; Zbl 1284.16011)]. Such automorphism is an algebra automorphism that is compatible with mutations, the combinatoric process that defines a cluster algebra. On the other hand, the finite type classification was given by \textit{S. Fomin} and \textit{A. Zelevinsky} [J. Am. Math. Soc. 15, No. 2, 497--529 (2002; Zbl 1021.16017)]. In finite type, there is a correspondence between cluster variables and positive roots in the corresponding Cartan-Killing classification. One of the proposes of this work is to understand the action of the cluster automorphism group over the positive root system \(\Phi_{\geq -1}\). The \(\tau_{\pm}\)-transforms, induced from the ones over \(\Phi_{\geq -1}\), define inverse cluster automorphisms and generate a subgroup \(\mathcal D\) of the cluster automorphism group Aut. These groups turn out to be isomorphic, except for the Dynkin types \(D_n\) with \(n\) even. On a second stage, the authors study non-simply laced cases and how cluster automorphisms in this setting are induced by cluster automorphisms in the simply laced cases via foldings. The authors obtain all the cluster automorphism groups, and provide a characterization of Dynkin finite types (over all finite types) in terms of existences of bipartite seeds. The last main result compares cluster automorphism groups of a finite type cluster algebra and the corresponding one in the universal cluster algebra, the las concept was defined by \textit{S. Fomin} and \textit{A. Zelevinsky} [Compos. Math. 143, No. 1, 112--164 (2007; Zbl 1127.16023)], proving that their automorphism group is isomorphic in finite types.