Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Groups Complexity Cryptology

Managing Editor: Shpilrain, Vladimir / Weil, Pascal

Editorial Board: Ciobanu, Laura / Conder, Marston / Eick, Bettina / Elder, Murray / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Perret, Ludovic / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura / Lohrey, Markus


CiteScore 2018: 0.80

SCImago Journal Rank (SJR) 2018: 0.368
Source Normalized Impact per Paper (SNIP) 2018: 1.061

Mathematical Citation Quotient (MCQ) 2018: 0.38

Online
ISSN
1869-6104
See all formats and pricing
More options …

A fast search algorithm for 〈m,m,m〉 Triple Product Property triples and an application for 5×5 matrix multiplication

Sarah Hart
  • Department of Economics, Mathematics & Statistics, Birkbeck, University of London, Malet Street, London, WC1E 7HX, United Kingdom
  • Email
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Ivo Hedtke / Matthias Müller-Hannemann
  • Institute of Computer Science, Martin Luther University Halle-Wittenberg, Von-Seckendorff-Platz 1, 06120 Halle (Saale), Germany
  • Email
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Sandeep Murthy
Published Online: 2015-03-21 | DOI: https://doi.org/10.1515/gcc-2015-0001

Abstract

We present a new fast search algorithm for 〈m,m,m〉 Triple Product Property (TPP) triples as defined by Cohn and Umans in 2003. The new algorithm achieves a speed-up factor of 40 up to 194 in comparison to the best known search algorithm. With a parallelized version of the new algorithm we are able to search for TPP triples in groups up to order 55. As an application we identify lists “C1” and “C2” of groups that, if they contain a 〈5,5,5〉 TPP triple, could realize 5×5 matrix multiplication with under 100, respectively under 125, scalar multiplications, i.e., the best known upper bound by Makarov (1987), respectively the trivial upper bound. With our new algorithm we show that no group in this list can realize 5×5 matrix multiplication better than Makarov's algorithm. We also show a direction towards a modified group-theoretic search, not covered by the C1 list.

Keywords: Fast matrix multiplication; search algorithm; triple product property; group algebra rank

MSC: 20-04; 68Q25; 20D60; 68Q17; 68R05

About the article

Received: 2014-01-22

Published Online: 2015-03-21

Published in Print: 2015-05-01


Citation Information: Groups Complexity Cryptology, Volume 7, Issue 1, Pages 31–46, ISSN (Online) 1869-6104, ISSN (Print) 1867-1144, DOI: https://doi.org/10.1515/gcc-2015-0001.

Export Citation

© 2015 by De Gruyter.Get Permission

Citing Articles

Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.

Comments (0)

Please log in or register to comment.
Log in