Nurullah Ankaralioglu ; Akos Seress - Computing tensor decompositions of finite matrix groups

dmtcs:562 - Discrete Mathematics & Theoretical Computer Science, November 10, 2011, Vol. 13 no. 4 -
Computing tensor decompositions of finite matrix groupsArticle

Authors: 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.

Volume: Vol. 13 no. 4
Published on: November 10, 2011
Accepted on: June 9, 2015
Submitted on: August 8, 2011
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
    Source : OpenAIRE Graph
  • Efficient computation in finite groups with applications in algebra and graph theory; Funder: Australian Research Council (ARC); Code: DP1096525

Consultation statistics

This page has been seen 730 times.
This article's PDF has been downloaded 382 times.