Computing tensor decompositions of finite matrix groups
Nurullah Ankaralioglu, Ákos Seress
Abstract
We describe an algorithm to compute tensor decompositions of central products of groups. The novelty over previous algorithms is that in the case of matrix groups that are both tensor decomposable and imprimitive, the new algorithm more often outputs the more desirable tensor decomposition.
Full Text: PDF PostScript