An algorithm for constructing irreducible decompositions of permutation representations of wreath products of finite groups
Computational methods for problems pertaining to group theory (20-08) General theory for finite permutation groups (20B05) Applications of group representations to physics and other areas of science (20C35) Extensions, wreath products, and other compositions of groups (20E22) Invariant subspaces of linear operators (47A15) Computational methods for problems pertaining to quantum theory (81-08) Finite-dimensional groups and algebras motivated by physics and their representations (81R05) Particle exchange symmetries in quantum theory (general) (81V72)
- Computation of irreducible decompositions of permutation representations of wreath products of finite groups
- An algorithm for computing invariant projectors in representations of wreath products
- An algorithm for decomposing representations of finite groups using invariant projections
- Splitting permutation representations of finite groups by polynomial algebra methods
- Wreath decompositions of finite permutation groups
- An algorithm for decomposing representations of finite groups using invariant projections
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3121681 (Why is no real title available?)
- scientific article; zbMATH DE number 1187240 (Why is no real title available?)
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- scientific article; zbMATH DE number 51127 (Why is no real title available?)
- scientific article; zbMATH DE number 1261512 (Why is no real title available?)
- scientific article; zbMATH DE number 1338263 (Why is no real title available?)
- scientific article; zbMATH DE number 781164 (Why is no real title available?)
- Splitting permutation representations of finite groups by polynomial algebra methods
- The theory of groups
- Splitting permutation representations of finite groups by polynomial algebra methods
- An algorithm for computing invariant projectors in representations of wreath products
- Computation of irreducible decompositions of permutation representations of wreath products of finite groups
- An algorithm for decomposing representations of finite groups using invariant projections
- scientific article; zbMATH DE number 4158945 (Why is no real title available?)
- Wreath decompositions of finite permutation groups
This page was built for publication: An algorithm for constructing irreducible decompositions of permutation representations of wreath products of finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2211307)