On the local dimensions of solutions of Brent equations

Let 〈m,n,p〉 be the matrix multiplication tensor. The solution set of Brent equations corresponds to the tensor decompositions of 〈m,n,p〉. We study the local dimensions of solutions of the Brent equations over the field of complex numbers. The rank of Jacobian matrix of Brent equations provides an upper bound of the local dimension, which is well-known. We calculate the ranks for some typical known solutions, which are provided in the databases [16] and [17]. We show that the automorphism group of the natural algorithm computing 〈m,n,p〉 is (P_m×P_n×P_p)⋊Q(m,n,p), where P_m, P_n and P_p are groups of generalized permutation matrices, Q(m,n,p) is a subgroup of S₃ depending on m, n and p. For other algorithms computing 〈m,n,p〉, some conditions are given, which imply the corresponding automorphism groups are isomorphic to subgroups of (P_m×P_n×P_p)⋊Q(m,n,p). So under these conditions, m²+n²+p²−m−n−p−3 is a lower bound for the local dimensions of solutions of Brent equations. Moreover, the gap between the lower and upper bounds is discussed.