STACS 2003: STACS 2003 pp 403-414 | Cite as
Algebras of Minimal Rank over Arbitrary Fields
Abstract
Let R(A) denote the rank (also called bilinear complexity) of a finite dimensional associative algebra A. A fundamental lower bound for R(A) is the so-called Alder-Strassen bound R(A) ≥ 2 dim A-t, where t is the number of maximal twosided ideals of A. The class of algebras for which the Alder-Strassen bound is sharp, the so-called algebras of minimal rank, has received a wide attention in algebraic complexity theory.
As the main contribution of this work, we characterize all algebras of minimal rank over arbitrary fields. This finally solves an open problem in algebraic complexity theory, see for instance [12], Sect. 12, Problem 4] or [6], Problem 17.5].
Preview
Unable to display preview. Download preview PDF.
References
- 1.A. Alder and V. Strassen. On the algorithmic complexity of associative algebras. Theoret. Comput. Sci., 15:201–211, 1981.MATHCrossRefMathSciNetGoogle Scholar
- 2.Markus Bläser. Lower bounds for the multiplicative complexity of matrix multiplication. Comput. Complexity, 8:203–226, 1999.MATHCrossRefMathSciNetGoogle Scholar
- 3.Markus Bläser. Lower bounds for the bilinear complexity of associative algebras. Comput. Complexity, 9:73–112, 2000.MATHCrossRefMathSciNetGoogle Scholar
- 4.Markus Bläser. Algebras of minimal rank over perfect fields. In Proc. 17th Ann. IEEE Computational Complexity Conf. (CCC), pages 113–122, 2002.Google Scholar
- 5.Werner Büchi and Michael Clausen. On a class of primary algebras of minimal rank. Lin. Alg. Appl., 69:249–268, 1985.MATHCrossRefGoogle Scholar
- 6.Peter Bürgisser, Michael Clausen, and M. Amin Shokrollahi. Algebraic Complexity Theory. Springer, 1997.Google Scholar
- 7.Yurij A. Drozd and Vladimir V. Kirichenko. Finite Dimensional Algebras. Springer, 1994.Google Scholar
- 8.Hans F. de Groote. Characterization of division algebras of minimal rank and the structure of their algorithm varieties. SIAM J. Comput., 12:101–117, 1983.MATHCrossRefMathSciNetGoogle Scholar
- 9.Hans F. de Groote and Joos Heintz. Commutative algebras of minimal rank. Lin. Alg. Appl., 55:37–68, 1983.MATHCrossRefGoogle Scholar
- 10.Joos Heintz and Jacques Morgenstern. On associative algebras of minimal rank. In Proc. 2nd Applied Algebra and Error Correcting Codes Conf. (AAECC), Lecture Notes in Comput. Sci. 228, pages 1–24. Springer, 1986.Google Scholar
- 11.Volker Strassen. Gaussian elimination is not optimal. Num. Math., 13:354–356, 1969.MATHCrossRefMathSciNetGoogle Scholar
- 12.Volker Strassen. Algebraic complexity theory. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science Vol. A, pages 634–672. Elsevier Science Publishers B.V., 1990.Google Scholar
- 13.Shmuel Winograd. On multiplication in algebraic extension fields. Theoret. Comput. Sci., 8:359–377, 1979.MATHCrossRefMathSciNetGoogle Scholar