Skip to main content
Log in

An Algorithm for Constructing Irreducible Decompositions of Permutation Representations of Wreath Products of Finite Groups

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

We describe an algorithm for decomposing permutation representations of wreath products of finite groups into irreducible components. The algorithm is based on the construction of a complete set of mutually orthogonal projections to irreducible invariant subspaces of the Hilbert space of the representation under consideration. In constructive models of quantum mechanics, the invariant subspaces of representations of wreath products describe the states of multicomponent quantum systems. The suggested algorithm uses methods of computer algebra and computational group theory. The C implementation of the algorithm is capable of constructing irreducible decompositions of representations of wreath products of high dimensions and ranks. Examples of calculations are given. Bibliography: 15 titles.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M. Van Raamsdonk, “Building up spacetime from quantum entanglement,” Gen. Relativ. Grav., 42, 2323–2329 (2010).

    Article  Google Scholar 

  2. C. Cao, S. M. Carroll, and S. Michalakis, “Space from Hilbert space: Recovering geometry from bulk entanglement,” Phys. Rev. D, 95, 024031 (2017).

    Article  MathSciNet  Google Scholar 

  3. V. V. Kornyak, “Modeling quantum behavior in the framework of permutation groups,” https://doi.org/10.1051/epjconf/201817301007EPJ Web of Conf., 173, 01007 (2018).

    Article  Google Scholar 

  4. V. V. Kornyak, “Quantum models based on finite groups,” J. Phys.: Conf. Ser., 965, 012023 (2018).

    Google Scholar 

  5. J. D. P. Meldrum, Wreath Products of Groups and Semigroups, Longman/Wiley, New York (1995).

    MATH  Google Scholar 

  6. G. D. James and A. Kerber, The Representation Theory of the Symmetric Group, Addison-Wesley, Reading (1981).

    MATH  Google Scholar 

  7. M. Hall Jr., The Theory Of Groups, Dover, Mineola (2018).

    MATH  Google Scholar 

  8. P. J. Cameron, Permutation Groups, Cambridge Univ. Press, Cambridge (1999).

    Book  Google Scholar 

  9. E. Bannai and T. Ito, Algebraic Combinatorics I: Association Schemes, Benjamin/Cummings, Menlo Park (1984).

    MATH  Google Scholar 

  10. V. V. Kornyak, “Splitting permutation representations of finite groups by polynomial algebra methods,” in: V. P. Gerdt et al. (eds.), CASC 2018, Lect. Notes Comput. Sci., 11077, Springer, (2018), pp. 304–318.

  11. V. V. Kornyak, “An algorithm for decomposing representations of finite groups using invariant projections,” J. Math. Sci., 240, 651–664 (2019).

    Article  MathSciNet  Google Scholar 

  12. N. Jacobson, Structure of Rings, Amer. Math. Soc., Providence, Rhode Island (1956).

    Book  Google Scholar 

  13. L. H. Rowen, Ring Theory, Academic Press, Boston (1991).

    MATH  Google Scholar 

  14. R. Wilson et al., “Atlas of finite group representations,” http://brauer.maths.qmul.ac.uk/Atlas/v3.

  15. W.-H. Steeb, Matrix Calculus and the Kronecker Product with Applications and C++ Programs, World Scientific, River Edge (1997).

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. V. Kornyak.

Additional information

Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 485, 2019, pp. 107–139.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kornyak, V.V. An Algorithm for Constructing Irreducible Decompositions of Permutation Representations of Wreath Products of Finite Groups. J Math Sci 251, 375–394 (2020). https://doi.org/10.1007/s10958-020-05098-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-020-05098-0

Navigation