A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
An algorithm for the construction of matrix representationsfor finitely presented non-commutative algebras
1990
Journal of symbolic computation
Let a finite presentation be given for an associative, in general non-commulative algebra E, with identity, over a field. We study an algorithm for the construction, from this presentation, of linear, i.e, matrix, representations of this algebra. A set of vector constraints which is given as part of the initial data determines which particular representation of E is produced. This construction problem for the algebra is solved through a reduction of it to the much simpler problem of
doi:10.1016/s0747-7171(08)80004-1
fatcat:73aexvqwy5d6japwgpjzzojgpa