Testing isomorphism of modules

JOURNAL OF ALGEBRA

卷:320

Article

Brooksbank, Peter A.¹  Luks, Eugene M.² 

[1] Bucknell Univ, Dept Math, Lewisburg, PA 17837 USA

[2] Univ Oregon, Dept Comp & Informat Sci, Eugene, OR 97403 USA

关键词: Matrix algebras;    Modules;    Polynomial-time algorithm;    Weakly-closed set;   

DOI  :  10.1016/j.jalgebra.2008.07.014

来源: Elsevier

【 摘 要 】

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. (C) 2008 Elsevier Inc. All rights reserved.

【 授权许可】

Free