Computing generators of free modules over orders in group algebras II

DOI10.1090/S0025-5718-2011-02488-9zbMath1273.16016arXiv1006.4381OpenAlexW2964075452MaRDI QIDQ3094303

Henri Johnston, Werner Bley

Publication date: 24 October 2011

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.4381

zbMATH Keywords

algorithmsgroup algebrasGalois module structureWedderburn decompositionsassociated ordersleft lattices

Mathematics Subject Classification ID

Group rings (16S34) Group rings of finite groups and their modules (group-theoretic aspects) (20C05) Computational aspects of associative rings (general theory) (16Z05) Other algebras and orders, and their zeta and (L)-functions (11R54) Orders in separable algebras (16H10)

Related Items

Computation of lattice isomorphisms and the integral matrix similarity problem ⋮ Numerical evidence for the equivariant Birch and Swinnerton-Dyer conjecture (Part II) ⋮ Computing isomorphisms between lattices ⋮ Numerical Evidence for the Equivariant Birch and Swinnerton-Dyer Conjecture

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing representations over number fields. II: Computations in the Brauer group.
• Computing generators of free modules over orders in group algebras.
• Stably free rings of integers over \(\mathbb{Z}[H_8\times C_2\)]
• The Magma algebra system. I: The user language
• Units of classical orders: A survey
• The Schur subgroup. II
• Corrigendum: Algorithmic Enumeration of Ideal Classes for Quaternion Orders
• Computations in Relative Algebraic K-Groups
• Projective modules over binary polyhedral groups.
• Un anneau d'entiers stablement libre et non libre
• Advanced Topics in Computional Number Theory
• Cancellation in totally definite quaternion algebras
• Algorithmic Number Theory