An algorithm for computing invariant projectors in representations of wreath products

DOI10.1007/978-3-030-26831-2_20MaRDI QIDQ2175586zbMATH OpenOpenAlexFDO

Authors Vladimir V. Kornyak

Publication date 29 April 2020

Full work available at URL https://arxiv.org/abs/1906.00858

zbMATH Keywords

invariant projectorsirreducible decompositionmultipartite quantum systemwreath product

Mathematics Subject Classification ID

Applications of group representations to physics and other areas of science (20C35) Extensions, wreath products, and other compositions of groups (20E22) Symbolic computation and algebraic computation (68W30) Finite-dimensional groups and algebras motivated by physics and their representations (81R05) Particle exchange symmetries in quantum theory (general) (81V72)

Abstract: We describe an algorithm for computing the complete set of primitive orthogonal idempotents in the centralizer ring of the permutation representation of a wreath product. This set of idempotents determines the decomposition of the representation into irreducible components. In the formalism of quantum mechanics, these idempotents are projection operators into irreducible invariant subspaces of the Hilbert space of a multipartite quantum system. The C implementation of the algorithm constructs irreducible decompositions of high-dimensional representations of wreath products. Examples of computations are given.

Recommendations

• An algorithm for constructing irreducible decompositions of permutation representations of wreath products of finite groups
• Computation of irreducible decompositions of permutation representations of wreath products of finite groups
• An algorithm for decomposing representations of finite groups using invariant projections
• An algorithm for the decomposition of ideals of the group ring of a symmetric group
• Splitting permutation representations of finite groups by polynomial algebra methods

Cited in

(5)

• Dynamic simulation of quantum entanglement in finite quantum mechanics: a computer algebra approach
• Computation of irreducible decompositions of permutation representations of wreath products of finite groups
• An algorithm for constructing irreducible decompositions of permutation representations of wreath products of finite groups
• An algorithm for decomposing representations of finite groups using invariant projections
• Computing Isotypic Projections with the Lanczos Iteration

This page was built for publication: An algorithm for computing invariant projectors in representations of wreath products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175586)