Counting equivalence classes of irreducible representations

Details Counting equivalence classes of irreducible representations Counting equivalence classes of irreducible representations

2001-06-05

arxiv.org/abs/math/0106033v1

Mathematics

Rings and Algebras

5 pages. To appear in Algebra Montpelier Announcements

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

Counting equivalence classes of irreducible representations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting equivalence classes of irreducible representations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting equivalence classes of irreducible representations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-595571