加载中…
In this paper we introduce a strict monoidal subcategory of the category of matrices, suitable to address a higher representation theoretic analogue of radicals (non-semisimplicity) in ordinary representation theory. We show the extent to which this analogue has analogous representation theoretic properties. To illustrate, we apply to two key problems in the study of braid representations (strict monoidal functors from the braid category to the matrix category): the classification problem; and the problem of analysing the ordinary braid group representations that braid representations generate in towers.

生成讲解博客的中文版本

生成AI智能校验的中文版本