RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

Zap. Nauchn. Sem. POMI, 2018 Volume 468, Pages 228–248 (Mi znsl6587)

This article is cited in 2 papers

II

An algorithm for decomposition of finite group representations by means of invariant projectors

V. V. Kornyak

Laboratory of Information Technologies, Joint Institute for Nuclear Research, Dubna, Russia

Abstract: We describe an algorithm for decomposition of permutation representations of finite groups over fields of characteristic zero into irreducible components.
The algorithm is based on the fact that the components of the invariant inner product in invariant subspaces are operators of projection into these subspaces. This allows us to reduce the problem to solving systems of quadratic equations. The current implementation of the proposed algorithm allows us to split representationû of dimensions up to hundreds of thousands. Computational examples are given.

Key words and phrases: finite group, permutation representation, irreducible representation, invariant bilinear form, computational group theory.

UDC: 512.547.2

Received: 10.09.2018


 English version:
Journal of Mathematical Sciences (New York), 2019, 240:5, 651–664

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025