کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5771899 | 1630424 | 2017 | 22 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Separable equivalence, complexity and representation type
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We generalise the notion of separable equivalence, originally presented by Linckelmann in [13], to an equivalence relation on additive categories. We use this generalisation to show that from an initial equivalence between two algebras we may build equivalences between many related categories. We also show that separable equivalence preserves the representation type of an algebra. This generalises Linckelmann's result in [13], where he showed this in the case of symmetric algebras. We use these theorems to show that the group algebras of several small cyclic groups cannot be separably equivalent. This gives several examples of algebras that have the same complexity but are not separably equivalent.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Algebra - Volume 490, 15 November 2017, Pages 219-240
Journal: Journal of Algebra - Volume 490, 15 November 2017, Pages 219-240
نویسندگان
Simon F. Peacock,