Abstract
We develop further the linear Todd-Coxeter algorithm described previously. In particular, by slightly extending the algorithm, we obtain a simpler description of the calculation which it performs. We also describe an application of this method to a problem in computational representation theory, which itself has applications in algebraic topology and possibly other areas.
Original language | English |
---|---|
Pages (from-to) | 235-248 |
Number of pages | 14 |
Journal | Linear Algebra and its Applications |
Volume | 192 |
Publication status | Published - Oct 1993 |
Keywords
- MATRIX REPRESENTATIONS