A new algorithm for irreducible decomposition of representations of finite groups

12/23/2018
by   Vladimir V. Kornyak, et al.
0

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a complete set of mutually orthogonal projectors. By expressing the projectors through the basis elements of the centralizer ring of the representation, the problem is reduced to solving systems of quadratic equations. The current implementation of the algorithm is able to split representations of dimensions up to hundreds of thousands. Examples of calculations are given.

READ FULL TEXT
research
01/29/2018

An Algorithm to Decompose Permutation Representations of Finite Groups: Polynomial Algebra Approach

We describe an algorithm for splitting a permutation representation of a...
research
05/29/2019

An Algorithm for Computing Invariant Projectors in Representations of Wreath Products

We describe an algorithm for computing the complete set of primitive ort...
research
02/28/2017

Decomposition of polynomial sets into characteristic pairs

A characteristic pair is a pair (G,C) of polynomial sets in which G is a...
research
12/06/2022

Extending Snow's algorithm for computations in the finite Weyl groups

In 1990, D.Snow proposed an effective algorithm for computing the orbits...
research
07/08/2021

Graded Symmetry Groups: Plane and Simple

The symmetries described by Pin groups are the result of combining a fin...
research
01/13/2020

Solving Decomposable Sparse Systems

Amendola et al. proposed a method for solving systems of polynomial equa...
research
02/12/2022

Square-free Strong Triangular Decomposition of Zero-dimensional Polynomial Systems

Triangular decomposition with different properties has been used for var...

Please sign up or login with your details

Forgot password? Click here to reset