{"title":"A Combinatorial Proof of a Symmetric Group Character Involution","authors":"P. Renteln","doi":"10.1080/00029890.2023.2242042","DOIUrl":null,"url":null,"abstract":"We give a short combinatorial proof based on the Murnaghan-Nakayama rule of the symmetric group character identity χ λ χ (1 n ) = χ λ (cid:48) , where λ (cid:48) is the conjugate of the partition λ .","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1080/00029890.2023.2242042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We give a short combinatorial proof based on the Murnaghan-Nakayama rule of the symmetric group character identity χ λ χ (1 n ) = χ λ (cid:48) , where λ (cid:48) is the conjugate of the partition λ .