Algebras with polynomial identities and computing the determinant

Nisan (1991) proved an exponential lower bound on the size of an algebraic branching program (ABP) that computes the determinant of a matrix in the non-commutative "free algebra" setting, in which there are no non-trivial relationships between the matrix entries. By contrast, when the matrix entries commute there are polynomial size ABPs for the determinant. This paper extends Nisan's result to a much wider class of non-commutative algebras, including all non-trivial matrix algebras over any field of characteristic 0, group algebras of all non-abelian finite groups over algebraically closed fields of characteristic 0, the quaternion algebra and the Clifford algebras. As a result, we obtain more compelling evidence for the essential role played by commutativity in the efficient computation of the determinant. The key to our approach is a characterization of non-commutative algebras by means of the polynomial identities that they satisfy. Extending Nisan's lower bound framework, we find that any reduction in complexity compared to the free algebra must arise from the ability of the identities to reduce the rank of certain naturally associated matrices. Using results from the theory of algebras with polynomial identities, we are able to show that none of the identities of the above classes of algebras is able to achieve such a rank reduction.

[1]  M. Vaughan-Lee,et al.  VARIETIES OF LIE ALGEBRAS , 1970 .

[2]  Meena Mahajan,et al.  A combinatorial algorithm for the determinant , 1997, SODA '97.

[3]  L. Valiant.  Why is Boolean complexity theory difficult , 1992 .

[4]  Ran Raz,et al.  Deterministic polynomial identity testing in non-commutative models , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[5]  Ran Raz,et al.  Multi-linear formulas for permanent and determinant are of super-polynomial size , 2004, STOC '04.

[6]  Aleksandr Robertovich Kemer,et al.  Ideals of Identities of Associative Algebras , 1991 .

[7]  K. Kalorkoti,et al.  A Lower Bound for the Formula Size of Rational Functions , 1982, SIAM J. Comput..

[8]  V. S. Drenski,et al.  A minimal basis of identities for a second-order matrix algebra over a field of characteristic o , 1981 .

[9]  Steve Chien,et al.  Clifford algebras and approximating the permanent , 2003, J. Comput. Syst. Sci..

[10]  A. S. Amitsur,et al.  Minimal identities for algebras , 1950 .

[11]  E. Artin,et al.  Geometric Algebra: Artin/Geometric , 1988 .

[12]  Noam Nisan,et al.  Lower bounds for non-commutative computation , 1991, STOC '91.

[13]  Tsit Yuen Lam,et al.  The algebraic theory of quadratic forms , 1973 .

[14]  Meena Mahajan,et al.  Determinant: Old Algorithms, New Insights , 1998, SIAM J. Discret. Math..

[15]  J. M Varah,et al.  Computational methods in linear algebra , 1984 .

[16]  Ran Raz,et al.  Deterministic polynomial identity testing in non-commutative models , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[17]  Alexander Barvinok,et al.  New Permanent Estimators via Non-Commutative Determinants , 2000 .

[18]  Tsit Yuen Lam,et al.  Introduction To Quadratic Forms Over Fields , 2004 .

[19]  T. Y. Lam,et al.  A Theorem of Burnside on Matrix Rings , 1998 .

[20]  Jean-Pierre Serre,et al.  Linear representations of finite groups , 1977, Graduate texts in mathematics.

[21]  Noam Nisan,et al.  Lower bounds on arithmetic circuits via partial derivatives , 2005, computational complexity.

[22]  Marek Karpinski,et al.  An exponential lower bound for depth 3 arithmetic circuits , 1998, STOC '98.

[23]  Alexander A. Razborov,et al.  Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields , 2000, Applicable Algebra in Engineering, Communication and Computing.

[24]  R. F. Hoskins,et al.  Computational Methods in Linear Algebra , 1976, The Mathematical Gazette.

[25]  Meena Mahajan,et al.  Determinant: Combinatorics, Algorithms, and Complexity , 1997, Chic. J. Theor. Comput. Sci..

[26]  Francesca Benanti,et al.  Computational Approach to Polynomial Identities of Matrices – a Survey , 2004 .