Mathematics – Group Theory
Scientific paper
2011-04-27
Mathematics
Group Theory
14 pages, 2 figures, 4 tables
Scientific paper
In 2003 COHN and UMANS introduced a group-theoretic approach to fast matrix multiplication. This involves finding large subsets of a group $G$ satisfying the Triple Product Property (TPP) as a means to bound the exponent $\omega$ of matrix multiplication. We present two new characterizations of the TPP, which are useful for theoretical considerations and for TPP test algorithms. With this we describe all known TPP tests and implement them in GAP algorithms. We also compare their runtime. Furthermore we show that the search for subgroup TPP triples of nontrivial size in a nonabelian group can be restricted to the set of all nonnormal subgroups of that group. Finally we describe brute-force search algorithms for maximal subgroup and subset TPP triples. In addition we present the results of the subset brute-force search for all groups of order less than 25 and selected results of the subgroup brute-force search for 2-groups, $SL(n,q)$ and $PSL(2,q)$.
Hedtke Ivo
Murthy Sandeep
No associations
LandOfFree
Search and test algorithms for Triple Product Property triples does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Search and test algorithms for Triple Product Property triples, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search and test algorithms for Triple Product Property triples will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-475369