2014/04/17 by Eugenio Giannelli, Giannelli, Eugenio
Computer Science · Engineering · Mathematics · #20C30 #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Representation Theory (math.RT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1404.4578
openalex publication_date 2014/04/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the indecomposable summands of the permutation module obtained by inducing the trivial \mathbbF(Sa\wr Sn)-module to the full symmetric group San for any field \mathbbF of odd prime characteristic p such that a