Separable equivalence, complexity and representation type (Q2401712)

In [Bull. Lond. Math. Soc. 43, No. 5, 871--885 (2011; Zbl 1239.20005)], \textit{M. Linckelmann} introduced the notion of separable equivalence of categories. In the present article, the author generalises the notion of separable equivalence to an equivalence relation on additive categories. In this context, two algebras are separably equivalent if and only if their module categories are separably equivalent. Using this generalisation, he proves several results: for instance, finite dimensional algebras over a field which are separably equivalent have the same complexity. Also, if we begin with a separable equivalence of algebras we may construct new categories that must also be separably equivalent. The author then defines a stronger form of separable equivalence, called symmetrical separably equivalence, and he shows that separably equivalent symmetric algebras can be assumed to be symmetrically separably equivalent. Another result is that a separable equivalence preserves the representation type of an algebra, generalising Linckelmann's result [loc. cit.] in the above-mentioned paper. The author uses these theorems to show that the group algebras of several small cyclic groups cannot be separably equivalent, obtaining in this fashion examples of algebras that have the same complexity but are not separably equivalent.