DocumentCode
1632795
Title
Algebras of minimal rank over perfect fields
Author
Blaser, M.
Author_Institution
Inst. fur Theor. Informatik, Med. Univ. zu Lubeck
fYear
2002
fDate
6/24/1905 12:00:00 AM
Firstpage
92
Lastpage
101
Abstract
Let R(A) denote the rank (also called the bilinear complexity) of a finite-dimensional associative algebra A. A fundamental lower bound for R(A) is the so-called Alder-Strassen (1981) bound: R(A) ⩾ 2 dim A-t, where t is the number of maximal two-sided ideals of A. The class of algebras for which the Alder-Strassen bound is sharp, the so-called "algebras of minimal rank", has received wide attention in algebraic complexity theory. We characterize all algebras of minimal rank over perfect fields. This solves an open problem in algebraic complexity theory over perfect fields [as discussed by V. Strassen (1990) and P. Bürgisser et al. (1997)]. As a by-product, we determine all algebras A of minimal rank with A/rad A ≅ kt over arbitrary fields
Keywords
algebra; computational complexity; Alder-Strassen bound; algebraic complexity theory; arbitrary fields; bilinear complexity; finite-dimensional associative algebra; lower bound; maximal 2-sided ideals; minimal-rank algebras; perfect fields; Algebra; Complexity theory; Computational modeling; Costs; Polynomials; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on
Conference_Location
Montreal, Que.
ISSN
1093-0159
Print_ISBN
0-7695-1468-5
Type
conf
DOI
10.1109/CCC.2002.1004346
Filename
1004346
Link To Document