arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1003.4679cs.CCmath.RT
收藏

非交换群代数双线性复杂度的界

Bounds for Bilinear Complexity of Noncommutative Group Algebras

Alexey Pospelov

摘要:

研究了非交换群代数中乘法运算的复杂性,它与矩阵乘法运算的复杂性密切相关。我们刻画了这样的半单群代数的最小双线性复杂性,并显示了非平凡的下界为其余的组代数。这些下界是建立在Bläser的半单代数和具有大根的代数的结果以及Alder和Strassen的任意结合代数的下界之上的。我们还显示了次二次上界的所有群代数变成“几乎线性”的矩阵乘法的指数等于2。

英文摘要:

We study the complexity of multiplication in noncommutative group algebras which is closely related to the complexity of matrix multiplication. We characterize such semisimple group algebras of the minimal bilinear complexity and show nontrivial lower bounds for the rest of the group algebras. These lower bounds are built on the top of Bläser's results for semisimple algebras and algebras with large radical and the lower bound for arbitrary associative algebras due to Alder and Strassen. We also show subquadratic upper bounds for all group algebras turning into "almost linear" provided the exponent of matrix multiplication equals 2.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑