Average divisibility in character tables of
Abstract.
Let range over odd prime powers and let . 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 which are not divisible by , in the sense of divisibility in the ring of algebraic integers. We prove that for every , where denotes the number of entries which are not divisible by . We also show that the number of zero entries is . Consequently, the proportion of all entries not divisible by tends to , while the proportion of nonzero entries not divisible by tends to . 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 . We show that the arguments become equidistributed in . This proves an analogue of Millerβs question on the distribution of signs among the nonzero entries in character tables of symmetric groups.
Key words and phrases:
Character tables, finite general linear groups, divisibility, distribution questions2020 Mathematics Subject Classification:
20C33, 20C15, 11R451. Introduction
The characters of irreducible complex representations of finite groups exhibit interesting arithmetic behavior, especially when considered in infinite families. Note that the character values of finite groups are algebraic integers, in fact, they are sums of roots of unity. One may study the average arithmetic behavior of character tables for a family of finite groups and ask how often the entries satisfy a prescribed congruence or divisibility condition. The most prominent example is the family of symmetric groups . For this family, the character values are integers. The irreducible characters and conjugacy classes of are both parametrized by partitions of , and hence the character table has entries, where denotes the number of partitions of .
Miller [MIL19] conjectured, based on extensive computations, that for every fixed prime number , almost every entry in the character table of is divisible by as . This conjecture was proved by Peluse and Soundararajan [PS22]. They showed that if a prime , then the number of entries in the character table of which are not divisible by is . In particular, for every fixed prime , the proportion of entries in the character table of not divisible by tends to as . Prior to this, the conjecture was known for , cf. [MCK72, PEL20]. Subsequently, Peluse and Soundararajan [PS25] proved the stronger prime-power form of Millerβs conjecture. Namely, they showed that for every fixed prime power , almost every entry in the character table of is divisible by as . Such results rely on both combinatorial methods as well as tools from analytic number theory; they underscore the growing scope of arithmetic statistics in representation theory.
The purpose of the present paper is to investigate analogous questions for a different natural family of finite groups, namely , where ranges over powers of odd primes. We shall see that the answer for these groups is different from that of the family of symmetric groups as . We fix a prime number . Instead of almost every entry being divisible by , we show that the limiting proportion of entries not divisible by is exactly . For each odd prime power , let denote the number of entries in the character table of which are not divisible by , in the sense of divisibility in the ring of algebraic integers. Let (resp. ) be the number of entries in the character table that are equal (resp. not equal) to . The total number of entries in the character table of is
We define
and prove the following asymptotic formula.
Theorem 1.1.
Let be a fixed rational prime. As over odd prime powers, one has
That is, asymptotically one half of the entries in the character table of are not divisible by , and one half are divisible by . Further, most nonzero entries are not divisible by .
More precisely, we prove the following quantitative form of Theorem 1.1. For every fixed prime number and every , one has
as over odd prime powers. Moreover, the number of zero entries in the character table satisfies
For further details, we refer to Theorem 4.3. Thus the main contribution to the entries divisible by comes from the zero entries, while almost all nonzero entries are not divisible by .
Our result also settles the question for powers of . Indeed, if a nonzero algebraic integer is not divisible by , then it is not divisible by any power . Since almost all nonzero entries in the character table of are not divisible by , it follows a fortiori that, for every fixed , almost all nonzero entries are not divisible by . Thus the limiting proportion of all entries not divisible by is again , and the limiting proportion of nonzero entries not divisible by is .
The ideas used in the proof are quite different from those in [PS22]. Rather than relying on the combinatorics of partitions, our argument uses the standard classification of irreducible complex representations of into four families: namely one-dimensional, principal series, Steinberg twists, and cuspidal. On the conjugacy class side, there are also four natural families, namely scalar, split regular semisimple, elliptic, and Jordan (i.e., consisting of a single Jordan block). The character table naturally decomposes into blocks, with rows indexed by the four families of irreducible representations and columns indexed by the four families of conjugacy classes:
| scalar | split regular semisimple | elliptic | non-semisimple Jordan | |
|---|---|---|---|---|
| one-dimensional | ||||
| principal series | ||||
| Steinberg twists | ||||
| cuspidal |
Here denotes a block whose entries are not all zero. The one-dimensional representations and the Steinberg twists form small families, each of size . Since the total number of conjugacy classes is , the entries lying in these rows contribute only entries to the full character table. Thus, their contribution has density zero. Similarly, the scalar and Jordan conjugacy classes each form a family of size , and therefore the entries lying in these columns also have density zero.
Consequently, the limiting density is determined entirely by the four large blocks obtained by evaluating principal series and cuspidal representations on split regular semisimple and elliptic conjugacy classes. The situation is summarized in the following table:
| Split regular semisimple classes | Elliptic classes | |
|---|---|---|
| Principal series representations | nonzero in general | |
| Cuspidal representations | nonzero in general |
The -blocks contribute to the density of entries divisible by . The remaining two large blocks are the principal-series/split block and the cuspidal/elliptic block. Each of these blocks contributes a density of to the proportion of character entries that are not divisible by .
Miller [MIL14, QuestionΒ 3] also considered an archimedean analogue of the divisibility question for the symmetric groups. Since the character values of are integers, one may ask how often the nonzero entries in the character table of are positive or negative. For , the character values are in general complex rather than real, so the corresponding question is not a sign-distribution question but an angular-distribution question. We study how the arguments of the nonzero character values are distributed in .
Let be the set of isomorphism classes of complex irreducible representations of . For a nonzero complex number , write for its argument. If is an interval, let
Thus is the proportion of nonzero entries in the character table whose argument lies in .
Theorem 1.2.
Let . As over odd prime powers,
For related work on character values of finite general linear groups, we mention the work of Gurevich and Howe [GH21]. The authors study asymptotics for the normalized trace via a harmonic-analytic approach.
We conclude by mentioning some natural further directions. The results of this paper suggest that the statistics of character tables can vary substantially with the family of finite groups under consideration. It would be interesting to study the analogous questions for other families of finite groups of Lie type. A first natural case is , either with fixed and , or with fixed and . The irreducible characters of were parametrized by Green [GRE55]. More generally, DeligneβLusztig theory [DL76] provides a uniform framework for studying irreducible characters of finite reductive groups. We pose the following question for a fixed algebraic group and varying finite field.
Question 1.3.
Let be a reductive group scheme over , and write for its group of -points.
-
(1)
Fix a prime number . What is the limiting proportion, as over prime powers, of entries in the character table of which are not divisible by ? More generally, what is the limiting proportion of nonzero entries which are not divisible by ?
-
(2)
Is there a measure on with respect to which the arguments of the non-zero character values of irreducible representations become equidistributed as ?
We also pose the analogous question in fixed characteristic, where the rank of the group tends to infinity.
Question 1.4.
Let be a fixed finite field, and let be one of the standard families of finite classical groups, for instance , , , or .
-
(1)
Fix a prime number . What is the limiting proportion, as , of entries in the character table of which are not divisible by ? More generally, what is the limiting proportion of nonzero entries which are not divisible by ?
-
(2)
After discarding the zero entries, is there a natural probability measure on with respect to which the arguments of the remaining character values become equidistributed as ?
Acknowledgments
We thank Mathilde Gauthier, Sarah Peluse, Dipendra Prasad and Steven Spallone for helpful feedback on our paper. We are especially grateful to Sarah Peluse for suggesting that we study the equidistribution of arguments of nonzero character values, and for pointing us to Millerβs question on the distribution of signs among the nonzero entries in character tables of symmetric groups.
2. Preliminaries
2.1. Conjugacy classes in
Throughout the paper is a power of an odd prime number and . We write , , , and for the standard Borel subgroup, diagonal torus, unipotent subgroup, and center, respectively. In particular, consists of the upper triangular matrices in , of the diagonal matrices, of the matrices , with , and of the scalar matrices.
The conjugacy classes of are divided into four families. First, there are the scalar classes , where . Second, there are the split regular semisimple classes, represented by , where and . These are parametrized by unordered pairs . Third, there are the elliptic classes, namely the regular semisimple elements whose characteristic polynomial is irreducible over . If is viewed as a two-dimensional vector space over , multiplication gives an embedding
| (2.1) |
The elliptic classes are represented by , with . Finally, there are the non-semisimple Jordan classes represented by , with . The total number of conjugacy classes equals
This is summarized in the table below.
| Type | Representative | Description | Number of classes |
|---|---|---|---|
| Scalar | Central elements | ||
| Split semisimple | , | Diagonalizable over | |
| Elliptic | Irreducible characteristic polynomial | ||
| Jordan | Non-semisimple |
2.2. Irreducible representations of
Given a representation
the character of is defined as follows:
for . In this subsection, we recall the standard classification of the irreducible complex representations of following [BH06, Ch.2].
The first family consists of one-dimensional representations. Such representations are of the form , where is a character. There are one-dimensional representations.
The second family consists of principal series representations. Let be characters. We regard as a character of by sending to . If , the induced representation is irreducible. Moreover, interchanging and gives an isomorphic representation, and these are the only identifications. Therefore, the number of principal series representations is .
The third family consists of twists of the Steinberg representation. The representation decomposes as a direct sum , where is the Steinberg representation. We note that this is also the permutation representation of on . Twisting the dimensional representation by , where ranges over the characters of , gives irreducible representations.
The fourth family consists of cuspidal representations, i.e., the irreducible representations not containing the trivial character of . We recall the explicit construction following [BH06]. Let , viewed as a two-dimensional vector space over . Then embeds in via the map (see (2.1)). Fix a nontrivial character . If is a character, then its restriction to gives a character of . Hence, we obtain a character of by
where via .
A character is called regular if , where . Consider the virtual representation
where is interpreted as a character of . Then is in fact a cuspidal representation of of dimension , cf. [BH06, p.Β 47]. Moreover,
Every cuspidal representation of is obtained in this way.
The non-regular characters are precisely those fixed by Frobenius. These are exactly the characters which factor through the norm map , and hence there are of them. Since has characters in total, there are regular characters. Dividing by the Frobenius equivalence , we obtain cuspidal representations.
2.3. Divisibility of character values
Let be a number field containing the values of the characters under consideration, and let be its ring of integers. If , we say that divides if , equivalently if . This notion is independent of enlarging . In particular, since , the value is divisible by every prime .
We shall repeatedly use the following elementary observations about sums of roots of unity. Let denote the -th cyclotomic polynomial.
Lemma 2.1.
For , one has
Proof.
For , we have , and hence
For , we have that
Evaluating at , we get
We prove the desired formula by induction on . We have so the case is immediate. Assume that the formula has been proved for all integers with . We prove it for . First suppose that is a prime power. We find that
By the induction hypothesis, for , we have
Therefore,
Hence,
Now suppose that is not a prime power. Write its prime factorization as
where . By the induction hypothesis, for every proper divisor ,
Since itself is not a prime power, every prime-power divisor of is proper. Therefore
Thus,
Hence when is not a prime power, as required. β
Lemma 2.2.
Let be a root of unity and let be a rational prime. Then is an algebraic integer if and only if either , or and .
Proof.
If , then , and hence is an algebraic integer. If and , then , and this is again an algebraic integer.
Conversely, suppose that is an algebraic integer. Let be the order of . We work in the cyclotomic field , where is a primitive -th root of unity, and let be the -th cyclotomic polynomial. Replacing by , the assumption implies that is divisible by as an algebraic integer. Therefore divides . We observe that
According to Lemma 2.1, we have that
When with odd, the identity
implies that
From this one finds that
for . Assuming that , this contradicts the divisibility
Therefore the only possible cases are , with , and . Equivalently, either and , or . β
3. The Character values
The first step is to compute in all cases, where ranges over the four types of conjugacy classes in from section 2.1 and ranges over the four types of irreducible representations of from section 2.2. After computing them, we will be able to prove asymptotic formulas for .
If is a subgroup and is a class function on , then the character of the induced representation is given by
| (3.1) |
see [SER77, Theorem 12, p.Β 30]. We begin by considering the characters of the one-dimensional representations.
Lemma 3.1 (One-dimensional representations).
Let be a one-dimensional representation of . Then we have that
where is the natural inclusion from (2.1).
Proof.
The first three assertions are immediate. We note that for ,
Thus the last assertion follows. β
Next we compute the character values of principal series representations.
Lemma 3.2 (Principal series representations).
Let with , and let be its character. Then:
Proof.
We use the induced character formula (3.1) to find that
If , then every conjugate lies in , and the value is simply
since .
If is split semisimple, say with , then is conjugate into by where . The contribution of all (resp. ) is (resp. ). This gives the stated formula.
If is a Jordan block, then it lies in and has a unique eigenvalue . Any eigenvector of must lie in the line spanned by . Suppose that . Then since is not scalar and also has the same eigenvalues as , we may write
where . Thus any eigenvector of must also belong to the line spanned by . It follows that stabilizes the line spanned by , i.e., . We deduce that
Lastly, if for , then it is not conjugate into , since consists of matrices whose characteristic polynomial splits over . Hence . β
Lemma 3.3 (Steinberg representations).
Let , the Steinberg representation. The character of is given as follows.
Proof.
Next we consider characters of cuspidal representations.
Lemma 3.4 (Cuspidal representations).
Let be a regular character and let be the corresponding cuspidal representation as defined in section 2.2. Let denote its character. Then
Proof.
Recall from section 2.2 that we fix a nontrivial character
After identifying with the additive group of by
we interpret as an additive character . We identify with by . Since , the restriction of to gives a character of . We define a character by
| (3.2) |
for and . The standard construction gives the cuspidal representation attached to as the virtual representation
Thus we have
We now compute this difference for each of the four types of conjugacy classes in . First suppose that is scalar, with . Since is central, we have for every . Hence
Now
and so
Similarly,
Since , we get
Therefore
Subtracting, we obtain
Next suppose that
We show that both induced characters vanish. Every element of has the form
Such an element has only one eigenvalue, namely . In particular, no element of is conjugate to a split regular semisimple element with two distinct eigenvalues and . Hence there is no such that , and therefore
On the other hand, every element of is either scalar or has irreducible characteristic polynomial over . Indeed, if , then multiplication by has characteristic polynomial equal to the minimal polynomial of over , which is irreducible of degree . Thus no element of is conjugate to with . Hence
and consequently
Now suppose that is a non-semisimple Jordan block, with eigenvalue . We write
It is more convenient to compute with . This gives the same conjugacy class, since all nontrivial unipotent Jordan blocks with eigenvalue are conjugate.
First consider the contribution from . Every element of is semisimple as an element of , because is contained in a torus. But is not semisimple. Hence is not conjugate to any element of , and therefore
It remains to compute . By the induced character formula,
Suppose that satisfies . Then from (3.2), we have that
Since and both its eigenvalues are equal to , we have that . Therefore,
Thus we find that
It is easy to see that if and only if , the Borel subgroup of . Writing , a direct computation gives
and therefore,
The summand does not depend on , so the sum over contributes a factor of . We obtain
For fixed , the quotient runs once through as runs through . Therefore
Since is a nontrivial additive character of , we have
and hence
It follows that
Substituting this into the induced character formula gives
Since the -induced character contributes , we obtain
on the non-semisimple Jordan classes.
Finally suppose that for some Note that is not conjugate to any element of , because every element of has a repeated eigenvalue in , whereas has irreducible characteristic polynomial. Therefore
It suffices to compute . By the induced character formula,
We need to understand the elements such that . Moreover, if , then it has the same characteristic polynomial as with roots and . Thus we have that . First suppose that . The centralizer of is since is regular semisimple. Thus there are such elements, and their total contribution is .
Next consider the elements such that
Choose one -linear automorphism of representing the Frobenius map and identify it with an element . Note that . We have that
Now, if and only if
It follows that all solutions to form the coset . Once again, there are such elements, and their total contribution is
Therefore
Dividing by , we get
Since the -induced character contributes , we conclude that
This completes the proof. β
4. Density results for average divisibility
In this section, we shall prove the main result of the article. The first large nonzero block comes from evaluating principal series representations on split regular semisimple conjugacy classes. In this block, the character values have the form
which is a sum of two roots of unity.
Given a real valued function and a positive function , we write
to mean that is bounded. Let be a positive real number and be a positive function which depends on . We write
to mean that there is a constant which depends on such that
for all values of .
The following lemma shows that the entries in this block which are divisible by are rare enough to contribute only to the error term.
Lemma 4.1.
Let . Then the number of ordered quadruples
with and , for which divides
is .
Proof.
Setting
we find that
Since is a root of unity, it is a unit in the ring of algebraic integers. Therefore divisibility of by is equivalent to divisibility of by . By Lemma 2.2, is divisible by if and only if either:
-
β’
, or,
-
β’
and .
We show that these cases occur for at most quadruples .
We set . There are ordered character pairs with and ordered element pairs with . For each fixed nontrivial character , there are exactly ordered pairs with . Likewise, for each fixed , there are exactly ordered pairs with . We call a pair
exceptional if is divisible by . It remains to count the number of exceptional pairs. Let be the order of . Then and . The image of is the cyclic group of -th roots of unity, and every value in the image has exactly preimages in .
First consider the condition . This has solutions if and only if belongs to the image of , equivalently if is even. The number of solutions is exactly . If is odd, there are no solutions. In either case, the number of solutions to is at most . Next consider the condition , which only matters when . The kernel of has size . Therefore, for a fixed character of order , the number of exceptional βs is at most .
There are characters of order in . Hence the number of exceptional pairs is at most
Since , this is bounded by
where denotes the number of positive divisors of . It is a standard fact (see for example [MUR08, p.Β 10]) that . In particular,
Now we count the number of quadruples such that divides , where and . By earlier remarks, each arises from ordered quadruples . Hence their count is at most
β
We next analyze the second large nonzero block, namely the cuspidal representations evaluated on elliptic conjugacy classes. The character values in this block are controlled by expressions of the form
As in the principal-series case, divisibility by reduces to a root-of-unity condition. The relevant cyclic group is now , which has order .
Lemma 4.2.
Let . Then the total number of pairs where is a regular character and , such that divides
is at most .
Proof.
We write
Setting , we have that
The element is a unit in the ring of algebraic integers. Thus divisibility by is equivalent to divisibility of by . The character is trivial on and therefore factors through the quotient . This quotient is cyclic of order
Since is regular, . Consider the map which is defined by
The kernel of consists exactly of the Frobenius-invariant characters, i.e., the characters satisfying : there are such elements. Since has characters, the image of has size . This is precisely the number of characters of the quotient . Thus every character of occurs as , and each occurs for exactly choices of .
A cuspidal representation is determined by the Frobenius orbit of a regular character , and an elliptic conjugacy class is determined by the Frobenius orbit , with . Both orbits have size . Hence, if we count ordered pairs , then each entry in the cuspidal/elliptic block is counted exactly four times.
We now count the pairs such that is divisible by . Since is trivial on , the value depends only on the coset . The condition is equivalent to . Therefore the ordered data relevant to the divisibility question reduce to pairs
We call such a pair exceptional if is divisible by . By Lemma 2.2, this can happen only when:
-
β’
, or,
-
β’
and .
Let be the order of the nontrivial character . Then . Since is cyclic of order , every value in the image of has exactly preimages in . Thus has no solutions unless is even, and in all cases it has at most solutions. Similarly, the equation , after imposing , has at most solutions. Hence, for a fixed of order , there are at most exceptional choices of .
For every , there are characters of order in . The total number of exceptional pairs is at most
Each pair lifts to exactly ordered pairs : there are choices of with , and elements of lying above the coset . Hence the number of exceptional ordered pairs is at most
β
We now assemble the estimates from the two large nonzero blocks together with the vanishing of the two large off-diagonal blocks. The principal series characters vanish on elliptic classes, while the cuspidal characters vanish on split regular semisimple classes. These two zero blocks give the main term for . On the other hand, Lemmas 4.1 and 4.2 show that almost all entries in the two large nonzero blocks are not divisible by , and therefore give the main term for .
Theorem 4.3.
Let be a prime number and . Then,
and
Proof.
We first prove the estimate for . From Tables 1 and 3, one can see that the one-dimensional and Steinberg families together contain representations. Since there are conjugacy classes, the total number of entries in rows and of Table 1 is . Similarly, the scalar and Jordan classes together give columns and thus all entries in columns and together have density zero. Thus only the principal series and cuspidal rows evaluated on split regular semisimple and elliptic classes can affect the main term, whereas all other entries in Table 1 contribute to the error term.
By Lemma 3.2, principal series characters vanish on elliptic classes, and therefore, this block does not contribute to . By Lemma 3.4, cuspidal characters vanish on split regular semisimple classes, hence this block also does not contribute to . It remains to analyze principal series characters on split regular semisimple classes and cuspidal characters on elliptic classes.
First, we analyze the character values in principal-series rows on the split regular semisimple columns. Let where and let with and . By Lemma 3.2, the relevant character value is
It follows from Lemma 4.1 that the total number of pairs such that divides is at most .
We now treat the cuspidal rows on the elliptic columns. Let and let
be a regular character. Let be the corresponding cuspidal representation, as explained in section 2.2. Let be the character of . If with , then Lemma 3.4 gives
According to Lemma 4.2, there are at most pairs for which divides .
Combining the preceding estimates, we have that
The main contribution to comes from the two large blocks which vanish identically. Namely, principal-series characters vanish on elliptic classes, and cuspidal characters vanish on split regular semisimple classes. Thus these two blocks contribute
zero entries.
It remains to check that the number of entries outside of these blocks that vanish is . The small rows and columns contribute entries in total. In the principal-series/split and cuspidal/elliptic blocks, a zero entry is in particular divisible by , so Lemmas 4.1 and 4.2 show that the number of zero entries in these blocks is . Hence, we find that
This completes the proof. β
We now prove Theorem 1.1.
Proof of Theorem 1.1.
Fix . By the preceding theorem, we have
as through odd prime powers. Since
it follows that
Dividing numerator and denominator by , and using , we obtain
It remains to compute the limiting proportion among the nonzero entries. By the same preceding theorem,
Hence
and therefore
Consequently
Again dividing by , we get
Finally, since the proportion of entries not divisible by tends to , the proportion of entries divisible by is
and hence also tends to . This proves the theorem. β
5. Angular distribution for nonzero character values
This section is devoted to the proof of Theorem 1.2. The proof will make use of the following variant of Weylβs criterion (see [KN74, ChapterΒ 1, TheoremΒ 2.1]).
Proposition 5.1.
For every odd prime power , let be a finite multiset of real numbers in . Suppose that for every nonzero integer , one has
| (5.1) |
as . Then for any closed interval we have that
Proof.
We note that the statement of the result does not follow directly from Weylβs criterion, but the proof is similar. For let be the Dirac measure supported at . Let be the probability measure on defined by
where multiplicities are included. Given a set , we have that
Let denote normalized Lebesgue measure on , so that
By (5.1),
for every . Since also
this is equivalent to saying that
for every .
By linearity, the same convergence holds for every trigonometric polynomial. We now pass from trigonometric polynomials to arbitrary continuous functions on the circle by uniform approximation. Let be a continuous function on . By the StoneβWeierstrass theorem, for every there exists a trigonometric polynomial such that
Since and are probability measures, we have
Therefore
The last term tends to as , since is a trigonometric polynomial. Hence
Since is arbitrary, it follows that
for every continuous function on . Thus converges weakly to normalized Lebesgue measure on the circle.
Recall that a subset is called an -continuity set if its boundary has Lebesgue measure . It follows from the Portmanteau theorem (see [BIL99, TheoremΒ 2.1, (i) implies (v)]) that
Since is an -continuity set, we deduce that
This completes the proof. β
Let be an odd prime and be the set of isomorphism classes of complex irreducible representations of . The group of characters acts on by twisting:
where and .
Lemma 5.2.
Let , let be a regular character and denote the associated cuspidal representation. Let be a character. Then
Proof.
We first recall a general elementary fact about induction. Let , let be a representation of , and let be a one-dimensional representation of . Then
see [FH91, Exercise 3.16, p.Β 34]. We apply this with . Recall that the cuspidal representation attached to is constructed as the virtual representation
where
We claim that twisting both induced terms by replaces by
First consider the -term. For , viewed as an element of via the embedding , one has
Therefore
By the induction-tensor compatibility recalled above,
Next consider the -term. For and , we have
On the other hand, regarding as an element of , one has
since . Thus
Hence
This is precisely the character of . Therefore
Combining the two terms in the virtual construction of , we obtain
Since , this proves the lemma. β
Denote by the stabilizer of , consisting of such that .
Lemma 5.3.
Let be the set of the one-dimensional representations, the Steinberg twists, and those principal-series or cuspidal representations for which is nontrivial. Then we have that
Proof.
The one-dimensional representations and the Steinberg twists together contribute rows. We now count the remaining rows with nontrivial stabilizer.
Let with be a principal-series representation. Suppose that has nontrivial stabilizer under twisting. Then there exists a nontrivial character such that
Using the standard equivalence relation for principal series, this implies
Since , the equality cannot hold with and . Therefore one must have and . It follows that . Since is odd, there is a unique nontrivial quadratic character of . Thus the principal-series rows with nontrivial stabilizer are precisely of the form where is the quadratic character. There are at most such representations.
We next consider the cuspidal representation with nontrivial stabilizer. Let , and let be the cuspidal representation attached to a regular character . Assume that there exists a nontrivial character such that . By Lemma 5.2 we have that:
and therefore,
This means that
The first equality gives . Since the norm map is surjective, this implies , contrary to our assumption. Thus the second equality must hold:
Restricting this equality to , we obtain
because for . It follows that , and therefore must be the unique quadratic character of .
It remains to count the possible satisfying . Consider the homomorphism
Let and be characters of such that
Then is in the kernel of the above homomorphism. This kernel consists exactly of the Frobenius-invariant characters and has size . Suppose that is a solution to , then any other solution is of the form . Since there are at most choices for there are consequently at most choices for satisfying Passing from regular characters to cuspidal representations can only decrease this number. Hence there are at most cuspidal representations with nontrivial stabilizer. This proves that
β
Proof of Theorem 1.2.
Let denote the set of conjugacy classes of . For a complex number , write
Let be the multiset of arguments
where each pair with is counted once. Thus
the number of nonzero entries in the character table of . By Theorem 4.3,
By Proposition 5.1, it is enough to show that for every ,
| (5.2) |
Fixing , we prove the stronger estimate
| (5.3) |
where is an absolute constant. Since and is fixed, the limit (5.2) must vanish.
If , then is independent of the choice of ; we denote this common value by . For every , every , and every , one has
and therefore,
| (5.4) |
We recall from the statement of Lemma 5.3 that consists of one-dimensional representations, the Steinberg twists, and those principal-series or cuspidal representations for which is nontrivial. Since each term has absolute value , we have that
Note that and by Lemma 5.3, . Therefore, we find that
Therefore, (5.3) follows if we prove that
| (5.5) |
for some absolute constant .
Since representations outside have trivial stabilizer, decomposes into free -orbits . For each orbit , fix a representation . From (5.4), we deduce that
| (5.6) |
We note that . By the orthogonality of characters of the finite abelian group ,
| (5.7) |
Consequently, a free orbit can contribute in the column only if . Let be the -th roots of unity in . Observe that
From (5.6) and (5.7), we find that
For fixed and , we claim that
The characteristic polynomial
has a repeated root whenever . First consider the case when is irreducible over and let be a root. Then and are the roots of and is conjugacy class of either or . Thus there are two choices for . Next, assume that splits in and let be its roots up to multiplicity. If then is the conjugacy class of . On the other hand, if then is the conjugacy class of or . Thus in either case, there are at most choices for . This proves the claim.
References
- [BIL99] (1999) Convergence of probability measures. Second edition, Wiley Series in Probability and Statistics: Probability and Statistics, John Wiley & Sons, Inc., New York. Note: A Wiley-Interscience Publication Cited by: Β§5.
- [BH06] (2006) The local langlands conjecture for GL(2). Grundlehren der Mathematischen Wissenschaften, Vol. 335, Springer-Verlag, Berlin. Cited by: Β§2.2, Β§2.2, Β§2.2.
- [DL76] (1976) Representations of reductive groups over finite fields. Ann. of Math. (2) 103 (1), pp.Β 103β161. Cited by: Β§1.
- [FH91] (1991) Representation theory. Graduate Texts in Mathematics, Vol. 129, Springer-Verlag, New York. Note: A first course, Readings in Mathematics Cited by: Β§5.
- [GRE55] (1955) The characters of the finite general linear groups. Trans. Amer. Math. Soc. 80, pp.Β 402β447. Cited by: Β§1.
- [GH21] (2021) Harmonic analysis on over finite fields. Pure Appl. Math. Q. 17 (4), pp.Β 1387β1463. Cited by: Β§1.
- [KN74] (1974) Uniform distribution of sequences. Pure and Applied Mathematics, Wiley-Interscience [John Wiley & Sons], New York-London-Sydney. Cited by: Β§5.
- [MCK72] (1972) Irreducible representations of odd degree. J. Algebra 20, pp.Β 416β418. Cited by: Β§1.
- [MIL14] (2014) The probability that a character value is zero for the symmetric group. Math. Z. 277 (3-4), pp.Β 1011β1015. Cited by: Β§1.
- [MIL19] (2019) On parity and characters of symmetric groups. J. Combin. Theory Ser. A 162, pp.Β 231β240. Cited by: Β§1.
- [MUR08] (2008) Problems in analytic number theory. Second edition, Graduate Texts in Mathematics, Vol. 206, Springer, New York. Note: Readings in Mathematics Cited by: Β§4.
- [PS22] (2022) Almost all entries in the character table of the symmetric group are multiples of any given prime. J. Reine Angew. Math. 786, pp.Β 45β53. Cited by: Β§1, Β§1.
- [PS25] (2025) Divisibility of character values of the symmetric group by prime powers. Algebra Number Theory 19 (2), pp.Β 365β382. Cited by: Β§1.
- [PEL20] (2020) On even entries in the character table of the symmetric group. Note: Preprint, arXiv:2007.06652 [math.CO] (2020) External Links: Link Cited by: Β§1.
- [SER77] (1977) Linear representations of finite groups. Graduate Texts in Mathematics, Vol. 42, Springer-Verlag, New York. Cited by: Β§3.