2000 character limit reached
A Note on the Group-theoretic Approach to Fast Matrix Multiplication
Published 28 Jan 2011 in math.GR and cs.SC | (1101.5598v2)
Abstract: 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 $\omega$ 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.