Testing isomorphism of modules.

DOI10.1016/j.jalgebra.2008.07.014zbMath1172.16022OpenAlexW2038660785MaRDI QIDQ959773

Peter A. Brooksbank, Eugene M. Luks

Publication date: 12 December 2008

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2008.07.014

zbMATH Keywords

modulesmatrix algebrasdeterministic algorithmsMagmapolynomial-time algorithmsfinitely generated algebrasfinite-dimensional modulesalgebras over finite fieldsmodule isomorphismsweakly-closed sets

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Endomorphism rings; matrix rings (16S50) Finite rings and finite-dimensional associative algebras (16P10) Representations of orders, lattices, algebras over commutative rings (16G30) Computational aspects of associative rings (general theory) (16Z05) Software, source code, etc. for problems pertaining to associative rings and algebras (16-04)

Related Items

Algorithms for Group Isomorphism via Group Extensions and Cohomology ⋮ On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ Tensor isomorphism by conjugacy of Lie algebras ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Non-commutative Edmonds' problem and matrix semi-invariants ⋮ Computing the Conley Index: A Cautionary Tale ⋮ Ranks of linear matrix pencils separate simultaneous similarity orbits ⋮ Linear Representation of Graphs: Applications to Molecular Graphs ⋮ Interactions of computational complexity theory and mathematics ⋮ The graph isomorphism problem and approximate categories ⋮ Generalizations of \(k\)-dimensional Weisfeiler-Leman stabilization ⋮ Computing the interleaving distance is NP-hard ⋮ Algorithms for orbit closure separation for invariants and semi-invariants of matrices ⋮ The module isomorphism problem reconsidered. ⋮ Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization ⋮ Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing ⋮ A fast isomorphism test for groups whose Lie algebra has genus 2 ⋮ On the normal forms of modules with respect to parametrizing bimodules. ⋮ Computational Complexity of the Interleaving Distance ⋮ Topological variability of collectives and its import for social epistemology ⋮ Elder-Rule-Staircodes for Augmented Metric Spaces ⋮ Finding central decompositions of p-groups ⋮ Testing isomorphism of graded algebras

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• Finding the radical of an algebra of linear transformations
• The Magma algebra system. I: The user language
• Modules with decompositions that complement direct summands
• Computing the structure of finite algebras
• Effective procedures in field theory
• Treating the Exceptional Cases of the MeatAxe
• Computing Homomorphism Spaces between Modules over Finite Dimensional Algebras
• Determination of socle series using the condensation method