Hostname: page-component-8448b6f56d-sxzjt Total loading time: 0 Render date: 2024-04-19T04:51:38.587Z Has data issue: false hasContentIssue false

THE COINVARIANT ALGEBRA AND REPRESENTATION TYPES OF BLOCKS OF CATEGORY O

Published online by Cambridge University Press:  28 November 2001

TH. BRÜSTLE
Affiliation:
Fakultät für Mathematik, Universität Bielefeld, Postfach 100131, D-33501, Bielefeld, FRG; bruestle@mathematik.uni-bielefeld.de, koenig@mathematik.uni-bielefeld.de
S. KÖNIG
Affiliation:
Fakultät für Mathematik, Universität Bielefeld, Postfach 100131, D-33501, Bielefeld, FRG; bruestle@mathematik.uni-bielefeld.de, koenig@mathematik.uni-bielefeld.de Present address: Department of Mathematics and Computer Science, University of Leicester, Leicester, LE1 7RH; sck5@mcs.le.ac.uk
V. MAZORCHUK
Affiliation:
Algebra, Mechanics and Mathematics Department, Kyiv Taras Shevchenko University, 64 Volodymyrska st., 01033, Kyiv, Ukraine; mazor@mechmat.univ.kiev.ua Present address: Department of Mathematics, Uppsala University, Box 480, SE-75106, Sweden; mazor@math.uu.se
Get access

Abstract

Let [Gfr ] be a finite-dimensional semisimple Lie algebra over the complex numbers. Let A be the finite-dimensional algebra of a (regular or singular) block of the BGG-category [Oscr ] . By results of Soergel, A has a combinatorial description in terms of a subalgebra C0 of the coinvariant algebra C. König and Mazorchuk have constructed an embedding from C0-mod into the category [Fscr ](Δ) of A-modules having a Verma flag. This is the main tool for the classification of [Fscr ] (Δ) into finite, tame and wild representation types presented here. As a consequence a classification of A-mod into finite, tame and wild representation types is obtained, thus re-proving a recent result of Futorny, Nakano and Pollack.

Type
NOTES AND PAPERS
Copyright
© The London Mathematical Society 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)