Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Algebra
Complexity And Unsolvability Properties Of Nilpotency, Irvin R. Hentzel, David Pokrass Jacobs
Complexity And Unsolvability Properties Of Nilpotency, Irvin R. Hentzel, David Pokrass Jacobs
Irvin Roy Hentzel
A nonassociative algebra is nilpotent if there is some n such that the product of any n elements, no matter how they are associated, is zero. Several related, but more general, notions are left nilpotency, solvability, local nilpotency, and nillity. First the complexity of several decision problems for these properties is examined. In finite-dimensional algebras over a finite field it is shown that solvability and nilpotency can be decided in polynomial time. Over Q, nilpotency can be decided in polynomial time, while the algorithm for testing solvability uses a polynomial number of arithmetic operations, but is not polynomial time. Also …