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

dmtcs:562 - Discrete Mathematics & Theoretical Computer Science, November 10, 2011, vol. 13:4, Special Issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity - https://doi.org/10.46298/dmtcs.562
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]

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity

[en]
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.

https://doi.org/10.46298/dmtcs.562
Source: HAL:hal-00990483v1
Volume: vol. 13:4, Special Issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity
Published on: November 10, 2011
Imported on: August 8, 2011
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Licence: Hal authorisation v1
Funding:
    Source : OpenAIRE Graph
  • Efficient computation in finite groups with applications in algebra and graph theory; Funder: Australian Research Council (ARC); Code: DP1096525

Share and export

Consultation statistics

This page has been seen 1043 times.
This article's PDF has been downloaded 760 times.