On almost p-rational characters of p'-degree

Abstract

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 Q(e2π i/n) for some n∈ Z+ 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∈Sylp(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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…