Semisimple Algebras of Almost Minimal Rank over the Reals
A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are called algebras of minimal rank. After 25 years of research, these algebras are now well understood. We here start the investigation of the algebras for which the Alder–Strassen bound is off by one. As a first result, we completely characterize the semisimple algebras over ℝ whose bilinear complexity is by one larger than the Alder–Strassen bound.
Unable to display preview. Download preview PDF.
- 9.Heintz, J., Morgenstern, J.: On associative algebras of minimal rank. In: Poli, A. (ed.) Applied Algebra, Algorithmics and Error-Correcting Codes. LNCS, vol. 228, pp. 1–24. Springer, Heidelberg (1986)Google Scholar
- 10.Strassen, V.: Algebraic complexity theory. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. A, pp. 634–672. Elsevier Science Publishers B.V, Amsterdam (1990)Google Scholar