Skip to Main content Skip to Navigation
Journal articles

Computing tensor decompositions of finite matrix groups

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990483
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 3:39:10 PM
Last modification on : Monday, December 16, 2019 - 11:44:04 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:14:01 PM

File

2047-6573-2-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990483, version 1

Collections

Citation

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

Share

Metrics

Record views

155

Files downloads

842