关于四元数代数乘法的双线性算法
On bilinear algorithms for multiplication in quaternion algebras
摘要:
我们证明了特征不同于2的域上的非分裂四元数代数乘法的双线性复杂度为8。这个问题是由Blaeser和de Voltaire在[1]中研究的几乎最小秩代数的特征问题所激发的。本文是作者在第十一届“离散数学及其应用”国际研讨会上所作报告的译文。
英文摘要:
We show that the bilinear complexity of multiplication in a non-split quaternion algebra over a field of characteristic distinct from 2 is 8. This question is motivated by the problem of characterising algebras of almost minimal rank studied by Blaeser and de Voltaire in [1]. This paper is a translation of a report submitted by the author to the XI international seminar "Discrete mathematics and applications" (in Russian).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。