Average divisibility in character tables of GL2(Fq)
Abstract
Let q range over odd prime powers and let Gq=GL2(Fq). Fix a prime number . Motivated by work of Peluse and Soundararajan on Miller's conjecture for character tables of symmetric groups, we study the proportion of entries in the character table of Gq which are not divisible by , in the sense of divisibility in the ring of algebraic integers. We prove that N(q)=q42+Oε(q3+ε) for every ε>0, where N(q) denotes the number of entries which are not divisible by . We also show that the number of zero entries is q42+Oε(q3+ε). Consequently, the proportion of all entries not divisible by tends to 1/2, while the proportion of nonzero entries not divisible by tends to 1. This differs significantly from the symmetric-group case, where almost every character-table entry is divisible by any fixed prime. We also prove an angular equidistribution result for the nonzero character values as q∞. We show that the arguments become equidistributed in [0,2π]. This proves an analogue of Miller's question on the distribution of signs among the nonzero entries in character tables of symmetric groups.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.