表和的上下界

Pub Date : 2021-11-08 DOI:10.1142/s1005386721000432

Xiaoyou Chen, M. Lewis, H. Tong-Viet

{"title":"表和的上下界","authors":"Xiaoyou Chen, M. Lewis, H. Tong-Viet","doi":"10.1142/s1005386721000432","DOIUrl":null,"url":null,"abstract":"For a group [Formula: see text], we produce upper and lower bounds for the sum of the entries of the Brauer character table of [Formula: see text] and the projective indecomposable character table of [Formula: see text]. When [Formula: see text] is a [Formula: see text]-separable group, we show that the sum of the entries in the table of Isaacs' partial characters is a real number, and we obtain upper and lower bounds for this sum.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Upper and Lower Bounds of Table Sums\",\"authors\":\"Xiaoyou Chen, M. Lewis, H. Tong-Viet\",\"doi\":\"10.1142/s1005386721000432\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a group [Formula: see text], we produce upper and lower bounds for the sum of the entries of the Brauer character table of [Formula: see text] and the projective indecomposable character table of [Formula: see text]. When [Formula: see text] is a [Formula: see text]-separable group, we show that the sum of the entries in the table of Isaacs' partial characters is a real number, and we obtain upper and lower bounds for this sum.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2021-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1142/s1005386721000432\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1142/s1005386721000432","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

对于一个群[公式:见文]，我们给出了[公式:见文]的Brauer字符表和[公式:见文]的投影不可分解字符表的条目之和的上界和下界。当[Formula: see text]是[Formula: see text]-可分群时，我们证明了Isaacs部分字符表中条目的和是一个实数，并得到了这个和的上界和下界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

Upper and Lower Bounds of Table Sums

For a group [Formula: see text], we produce upper and lower bounds for the sum of the entries of the Brauer character table of [Formula: see text] and the projective indecomposable character table of [Formula: see text]. When [Formula: see text] is a [Formula: see text]-separable group, we show that the sum of the entries in the table of Isaacs' partial characters is a real number, and we obtain upper and lower bounds for this sum.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助