Decomposing homogeneous modules of finite groups in characteristic zero.

DOI10.1016/J.JALGEBRA.2009.05.008MaRDI QIDQ731260zbMATH OpenOpenAlexFDO

Authors Bernd Souvignier

Publication date 2 October 2009

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

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

zbMATH Keywords

algorithmsendomorphism ringshomogeneous modulesrepresentations of groupssingular elements

Mathematics Subject Classification ID

Group rings of finite groups and their modules (group-theoretic aspects) (20C05) Ordinary representations and characters (20C15)

Review text

Algorithms for splitting representations of groups over finite fields are well-developed, based on the `Meat-axe' methods pioneered by R. A. Parker in the early 1980s. Over fields of characteristic \(0\), however, the situation is much less satisfactory. Various approaches have been tried, perhaps the most successful being to use Meat-axe methods modulo several primes at once, followed by rational reconstruction. Plesken and Souvignier advocate a different approach, based on real (or rational) approximations. Here, the author constructs the endomorphism ring of a module by approximating the average over the group of the translates of an arbitrary matrix. The key to success is to use product replacement to get fast convergence, before rounding errors destroy the computation. Now suppose we are given a homogeneous module, so that its endomorphism ring is a full matrix algebra \(M\) over a division ring \(D\). The idea is to first compute a basis for a maximal order in \(M\), and then to use the LLL-algorithm to find short vectors in this maximal order. These short vectors are likely to have a reducible minimal polynomial, which is all that is required to split the module.

Recommendations

• scientific article; zbMATH DE number 1254262
• Constructing Rational Representations of Finite Groups
• scientific article; zbMATH DE number 1109639
• An algorithm for decomposing representations of finite groups using invariant projections
• Permutation modules for the symmetric group

Cites work

• Algorithms for finite soluble groups and applications
• Constructing Rational Representations of Finite Groups
• Factoring polynomials with rational coefficients
• Generating random elements of a finite group
• scientific article; zbMATH DE number 3884354 (Why is no real title available?)
• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 1187227 (Why is no real title available?)
• scientific article; zbMATH DE number 1187237 (Why is no real title available?)
• scientific article; zbMATH DE number 3477356 (Why is no real title available?)
• scientific article; zbMATH DE number 682071 (Why is no real title available?)
• scientific article; zbMATH DE number 1821102 (Why is no real title available?)
• Minimizing representations over number fields.
• Recognition of division algebras.
• The Magma algebra system. I: The user language
• What do we know about the product replacement algorithm?
• Writing representations over minimal fields

Cited in

(5)

• Splitting permutation representations of finite groups by polynomial algebra methods
• scientific article; zbMATH DE number 1160571 (Why is no real title available?)
• Computing Decompositions of Modules over Finite-Dimensional Algebras
• Irreducibility testing of finite nilpotent linear groups.
• Unitary discriminants of characters

Describes a project that uses

Uses Software

• Magma
• ATLAS Group Representations

This page was built for publication: Decomposing homogeneous modules of finite groups in characteristic zero.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731260)