An algorithm for constructing irreducible decompositions of permutation representations of wreath products of finite groups
Publication:2211307
DOI10.1007/s10958-020-05098-0zbMath1451.81269OpenAlexW3095333048MaRDI QIDQ2211307
Publication date: 11 November 2020
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-020-05098-0
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) Extensions, wreath products, and other compositions of groups (20E22) Applications of group representations to physics and other areas of science (20C35) General theory for finite permutation groups (20B05) Computational methods for problems pertaining to group theory (20-08) Particle exchange symmetries in quantum theory (general) (81V72)
Uses Software
Cites Work
- Building up spacetime with quantum entanglement
- Splitting permutation representations of finite groups by polynomial algebra methods
- An algorithm for decomposing representations of finite groups using invariant projections
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An algorithm for constructing irreducible decompositions of permutation representations of wreath products of finite groups