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.