2011/01/28 by Ivo Hedtke, Hedtke, Ivo
Computer Science · Engineering · Mathematics · #20D60 #68Q17 #68R05 #Coding theory and cryptography #FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR) #Interconnection Networks and Systems #Symbolic Computation (cs.SC) #cs.SC #graph theory and CDMA systems #math.GR #msc:20D60 #msc:68Q17 #msc:68R05
paper · pdf · doi:10.48550/arxiv.1101.5598
5 pages
openalex publication_date 2011/01/28 · arxiv created 2011/05/11 · arxiv updated 2011/05/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In 2003 COHN and UMANS introduced a group-theoretic approach to fast matrix multiplication. This involves finding large subsets S, T and U of a group G satisfying the Triple Product Property (TPP) as a means to bound the exponent ω of the matrix multiplication. We show that S, T and U may be be assumed to contain the identity and be otherwise disjoint. We also give a much shorter proof of the upper bound |S|+|T|+|U| <= |G|+2.