An algorithm for constructing irreducible decompositions of permutation representations of wreath products of finite groups

DOI10.1007/s10958-020-05098-0zbMath1451.81269MaRDI QIDQ2211307

Vladimir V. Kornyak

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

Mathematics Subject Classification ID

47A15: Invariant subspaces of linear operators

81-08: Computational methods for problems pertaining to quantum theory

81R05: Finite-dimensional groups and algebras motivated by physics and their representations

20E22: Extensions, wreath products, and other compositions of groups

20C35: Applications of group representations to physics and other areas of science

20B05: General theory for finite permutation groups

20-08: Computational methods for problems pertaining to group theory

81V72: Particle exchange symmetries in quantum theory (general)

Uses Software

• REPSN
• ATLAS Group Representations

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