Let be a prime and a finite group. A complex character of is called almost -rational if its values belong to a cyclotomic field for some prime to or precisely divisible by . We prove that, in contrast to usual -rational characters, there are always “many” almost -rational irreducible characters in finite groups. We obtain both explicit and asymptotic bounds for the number of almost -rational irreducible characters of in terms of . In fact, motivated by the McKay-Navarro conjecture, we obtain the same bound for the number of such characters of -degree and prove that, in the minimal situation, the number of almost -rational irreducible -characters of coincides with that of for . Lastly, we propose a new way to detect the cyclicity of Sylow -subgroups of a finite group from its character table, using almost -rational irreducible -characters and the blockwise refinement of the McKay-Navarro conjecture.

生成讲解博客的中文版本

生成AI智能校验的中文版本