On almost $p$-rational characters in principal blocks
Attila Mar\'oti, J. Miquel Mart\'inez, A. A. Schaeffer Fry, Carolina, Vallejo

TL;DR
This paper establishes a lower bound on the number of almost p-rational characters with degree coprime to p in the principal p-block of finite groups, and characterizes the groups where this bound is achieved.
Contribution
It introduces a new lower bound for almost p-rational characters in principal p-blocks and describes the p-local structure of groups attaining this bound.
Findings
Lower bound for the number of almost p-rational characters
Characterization of groups where the bound is sharp
Insights into the p-local structure of these groups
Abstract
Let p be a prime. In this paper we provide a lower bound for the number of almost p-rational characters of degree coprime to p in the principal p-block of a finite group of order divisible by p. We further describe the p-local structure of the groups for which the above-mentioned bound is sharp.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Coding theory and cryptography
