An Algorithm for Constructing Irreducible Decompositions of Permutation Representations of Wreath Products of Finite Groups
Crossref DOI link: https://doi.org/10.1007/s10958-020-05098-0
Published Online: 2020-10-30
Published Print: 2020-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kornyak, V. V.
Text and Data Mining valid from 2020-10-30
Version of Record valid from 2020-10-30
Article History
Received: 10 October 2019
First Online: 30 October 2020