Upper and lower bounds on Chillag table sums
From MaRDI portal
Publication:6282995
arXiv1702.02871MaRDI QIDQ6282995FDOQ6282995
H. P. Tong-Viet, Xiaoyou Chen, Mark L. Lewis
Publication date: 9 February 2017
Abstract: Chillag has showed that there is a single generalization showing that the sums of ordinary character tables, Brauer character, and projective indecomposable characters are positive integers. We show that Chillag's construction also applies to Isaacs' -partial characters. We show that if an extra condition is assumed, then we can obtain upper and lower bounds on the Chillag's table sums. We will demonstrate that this condition holds for Brauer characters, -partial characters, and projective indecomposable characters, and so we obtain upper and lower bounds for the table sums in those cases. We also obtain results regarding the sums of rows and columns in these tables.
This page was built for publication: Upper and lower bounds on Chillag table sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6282995)