Elsevier

Journal of Algebra

Volume 320, Issue 11, 1 December 2008, Pages 4020-4029
Journal of Algebra

Testing isomorphism of modules

https://doi.org/10.1016/j.jalgebra.2008.07.014Get rights and content
Under an Elsevier user license
open archive

Abstract

We present a new deterministic algorithm to test constructively for isomorphism between two given finite-dimensional modules of a finitely generated algebra. The algorithm uses only basic field operations; for arbitrary fields, this is not possible with the existing methodology. Furthermore, the number of field operations used by the algorithm is bounded by a polynomial in the length of the input. The algorithm has been implemented in the computer algebra system Magma and we report on its performance. Our approach has applications to other problems concerning decompositions of modules.

Keywords

Matrix algebras
Modules
Polynomial-time algorithm
Weakly-closed set

Cited by (0)