DocumentCode
2653436
Title
Matrix Isomorphism of Matrix Lie Algebras
Author
Grochow, Joshua A.
Author_Institution
Dept. of Comput. Sci., Univ. of Chicago Chicago, Chicago, IL, USA
fYear
2012
fDate
26-29 June 2012
Firstpage
203
Lastpage
213
Abstract
We study the problem of matrix isomorphism of matrix Lie algebras (MatIsoLie). Lie algebras arise centrally in areas as diverse as differential equations, particle physics, group theory, and the Mulmuley -- Sohoni Geometric Complexity Theory program. A matrix Lie algebra is a set L of matrices that is closed under linear combinations and the operation [A, B] = AB - BA. Two matrix Lie algebras L, L´ are matrix isomorphic if there is an invertible matrix M such that conjugating every matrix in L by M yields the set L´. We show that certain cases of MatIsoLie -- for the wide and widely studied classes of semi simple and abelian Lie algebras -- are equivalent to graph isomorphism and linear code equivalence, respectively. On the other hand, we give polynomial-time algorithms for other cases of MatIsoLie, which allow us to mostly derandomize a recent result of Kayal on affine equivalence of polynomials.
Keywords
Lie algebras; computational complexity; graph theory; matrix algebra; MatIsoLie; Mulmuley -- Sohoni geometric complexity theory program; affine equivalence; differential equations; graph isomorphism; group theory; linear code equivalence; matrix Lie algebras; matrix isomorphism; particle physics; polynomial-time algorithms; Abstracts; Complexity theory; Matrices; Polynomials; Tin; Vectors; Lie algebras; affine equivalence of polynomials; algorithms; determinant; graph isomorphism; linear code equivalence;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Complexity (CCC), 2012 IEEE 27th Annual Conference on
Conference_Location
Porto
ISSN
1093-0159
Print_ISBN
978-1-4673-1663-7
Type
conf
DOI
10.1109/CCC.2012.34
Filename
6243396
Link To Document