Pith. sign in

REVIEW

A Fast Search Algorithm for <m,m,m> Triple Product Property Triples and an Application for 5x5 Matrix Multiplication

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1305.0448 v1 pith:K7IMMY32 submitted 2013-05-01 math.GR

Sarah Hart , Ivo Hedtke , Matthias Müller-Hannemann , Sandeep Murthy This is my paper · ORCID
classification math.GR
keywords algorithmsearchmatrixmultiplicationtripletriplesapplicationbest
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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 a list of groups that would realize 5x5 matrix multiplication with under 100 resp. 125 scalar multiplications (the best known upper bound by Makarov 1987 resp. the trivial upper bound) if they contain a <5,5,5> TPP triple. With our new algorithm we show that no group can realize 5x5 matrix multiplication better than Makarov's algorithm.

Discussion (0). Continue with ORCID to comment.

Pith tools