Counting equivalence classes of irreducible representations
| dc.creator | Letzter, Edward S. | |
| dc.date | 2001-06-05 | |
| dc.date.accessioned | 2026-07-07T04:42:00Z | |
| dc.date.available | 2026-07-07T04:42:00Z | |
| dc.description | 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). | |
| dc.description | 5 pages. To appear in Algebra Montpelier Announcements | |
| dc.identifier | https://arxiv.org/abs/math/0106033 | |
| dc.identifier | http://arxiv.org/abs/math/0106033 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/61594 | |
| dc.subject | Rings and Algebras | |
| dc.title | Counting equivalence classes of irreducible representations | |
| dc.type | text |