arXiv · math/0106033
Counting equivalence classes of irreducible representations
Abstract
Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely many equivalence classes of $n$-dimensional irreducible representations. When $R$ does have only finitely many such equivalence classes, they can be effectively counted (assuming that $k[x]$ posesses a factoring algorithm).
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Edward S. Letzter. 2001-06-05. Counting equivalence classes of irreducible representations. https://arxiv.org/abs/math/0106033
Cite the original work for its findings. Save a collection to share your selection of sources.