A note on the Triple Product Property subgroup capacity of finite groups

2011/07/29 by Ivo Hedtke, Hedtke, Ivo
Computer Science · Mathematics · #Complexity and Algorithms in Graphs #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Interconnection Networks and Systems

paper · pdf · doi:10.48550/arxiv.1107.5969

openalex publication_date 2011/07/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In the context of group-theoretic fast matrix multiplication the TPP capacity is used to bound the exponent ω of matrix multiplication. We prove a new and sharper upper bound for the TPP subgroup capacity of a finite group

Related

• A Note on the Group-theoretic Approach to Fast Matrix Multiplication
• The Simultaneous Triple Product Property and Group-theoretic Results for the Exponent of Matrix Multiplication
• A Fast Search Algorithm for <m,m,m> Triple Product Property Triples and\n an Application for 5x5 Matrix Multiplication
• A Short Note on Disjointness Conditions for Triples of Group Subsets Satisfying the Triple Product Property
• Which groups are amenable to proving exponent two for matrix multiplication?