2021/04/07 by Hung, Nguyen Ngoc, Malle, Gunter, Maróti, Attila · 2 citations
#20D10 #20D20 #20E45 #FOS: Mathematics #Group Theory (math.GR) #Primary 20C15 #Representation Theory (math.RT) #Secondary 20D05
paper · doi:10.48550/arxiv.2104.02994
Let p be a prime and G a finite group. A complex character of G is called almost p-rational if its values belong to a cyclotomic field ℚ(e2πi/n) for some n∈ ℤ+ prime to p or precisely divisible by p. We prove that, in contrast to usual p-rational characters, there are always "many" almost p-rational irreducible characters in finite groups. We obtain both explicit and asymptotic bounds for the number of almost p-rational irreducible characters of G in terms of p. In fact, motivated by the McKay-Navarro conjecture, we obtain the same bound for the number of such characters of p'-degree and prove that, in the minimal situation, the number of almost p-rational irreducible p'-characters of G coincides with that of NG(P) for P\inSylp(G). Lastly, we propose a new way to detect the cyclicity of Sylow p-subgroups of a finite group G from its character table, using almost p-rational irreducible p'-characters and the blockwise refinement of the McKay-Navarro conjecture.