Computing tensor decompositions of finite matrix groups

Nurullah Ankaralioglu (1) , Akos Seress (2, 3)

1 Department of Mathematics [Erzurum]
2 School of Mathematics and Statistics [Crawley, Perth]
3 Department of Mathematics [Colombus]

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.

Domaines: Mathématique discrète [cs.DM]

Nurullah Ankaralioglu, Akos Seress. Computing tensor decompositions of finite matrix groups. Discrete Mathematics and Theoretical Computer Science, 2011, Vol. 13 no. 4 (4), pp.5--13. ⟨10.46298/dmtcs.562⟩. ⟨hal-00990483⟩