Efficient computation in finite groups with applications in algebra and graph theory
Indicators
1104
Views
844
Downloads
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]
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.
