Constructing Irreducible Representations of Finitely Presented Algebras

We describe an algorithmic test, using the “standard polynomial identity" (and elementary computational commutative algebra), for determining whether or not a finitely presented associative algebra has an irreducible n -dimensional representation. When n -dimensional irreducible representations do exist, our proposed procedure can (in principle) produce explicit constructions