WorksMathematics
Divisibility of Character Values of Wreath Products of Symmetric Groups
Abstract
Let be a finite group whose character table is integer-valued, and let be any fixed positive integer. We prove that almost every entry of the character table of the wreath product is divisible by as .
Introduction
Let be the symmetric group on letters, and let be a finite group with conjugacy classes. By the Murnaghan–Nakayama rule [7 Theorem 2.4.7], the irreducible characters of are integer-valued. Moreover, the number of irreducible characters of is equal to , the number of partitions of .
Based on extensive numerical calculations, Miller [11, 12] conjectured that, for every fixed prime power , the proportion of entries in the character table of divisible by tends to as . Peluse and Soundararajan [15] proved this conjecture. They also proved that, for every fixed positive integer , almost all entries in the character table of are divisible by as .
These results naturally lead to the question of whether similar divisibility properties hold for other families of groups with integer-valued character tables. In this paper, we study this question for the wreath product . By the Murnaghan–Nakayama rule [7 Theorem 4.4.10] (see also [4 Proposition 2.8]), if has an integer-valued character table, then the character table of is also integer-valued. Thus, it is natural to investigate the divisibility properties of its character values. We also mention that, in our recent work [3], we obtained a lower bound for the number of zeros in the character table of without assuming that has an integer-valued character table.
Dong et al. [4] proved that, for every fixed prime , almost all entries in the character table of are divisible by . Our first result extends their theorem from primes to prime powers. It also generalizes the result of Peluse and Soundararajan [15] from symmetric groups to wreath products.
Theorem 1.1. Let be a finite group with an integer-valued character table, and let be the wreath product of with the symmetric group . Then, for every fixed prime power , the proportion of entries in the character table of divisible by tends to 1 as .
The proof of Theorem 1.1 uses the combinatorial description of the irreducible representations and conjugacy classes of . If has conjugacy classes, then both the irreducible representations and the conjugacy classes of are indexed by -multipartitions of .
A -multipartition of a positive integer is a sequence , where each is an integer partition, possibly empty, satisfying . Here, denotes the sum of the parts of .
James and Kerber [7 Corollary 4.4.4] showed that the number of irreducible representations of is given by
This sum is precisely the number of -multipartitions of . Counting -multipartitions according to the size of their first component, we obtain
Equivalently, the generating function is
General methods for obtaining asymptotic formulas from generating functions are discussed in [1, 10, 14]. In [2], we established the following asymptotic formula for the number of -multipartitions of when is fixed.
Theorem 1.2 ([2 Corollary 1.4]; see also [14 Theorem 4]). Let be any fixed positive integer. Then,
For this is the Hardy–Ramanujan [6] formula .
Let denote the set of all -multipartitions of , and let . We now state a quantitative result from which Theorem 1.1 follows.
Theorem 1.3. Let be a finite group with an integer-valued character table and conjugacy classes. Let be sufficiently large, and let be a prime power satisfying
Then the number of pairs such that is
Here, denotes the value of the irreducible character of indexed by on the conjugacy class indexed by . When is the trivial group, we have , and Theorem 1.3 reduces to the result of Peluse and Soundararajan [15 Theorem 1.1].
By expressing a fixed positive integer as a product of prime powers and applying the union bound, we obtain the following corollary.
Corollary 1.4. Let be as in Theorem 1.1, and let be a fixed positive integer. Then the proportion of entries in the character table of divisible by tends to as .
Our results also have applications to Weyl groups. All Weyl groups have rational-valued characters, and hence their character values are integers. The Weyl groups of types and are both isomorphic to . Therefore, Theorem 1.1 applies directly to these two families. The remaining infinite family of type can be treated using Clifford theory. This gives the following corollary.
Corollary 1.5. Let be a fixed prime power. As , the proportion of entries in the character table of the Weyl group of type that are divisible by tends to . Hence, the same holds for every fixed positive integer in place of .
Acknowledgments
J. Barman is grateful to the University Grants Commission (UGC), India, for financial support through its Fellowship Programme. K. Mahatab is supported by the ARG-MATRICS Programme (Grant No. ANRF/ARGM/2025/002540/MTR).
Preliminaries
In this section, we first discuss the conjugacy classes and irreducible characters of and their correspondence with multipartitions. We then recall some basic definitions concerning hooks, border strips, and core partitions. Finally, we state the Murnaghan–Nakayama rule for .
Wreath products, conjugacy classes and irreducible characters
Let be a finite group. The wreath product of with the symmetric group is defined by . Its elements are of the form , where and . The multiplication is given by
The group can also be viewed as the group of monomial matrices with nonzero entries in . Its order is .
Let denote the conjugacy classes of , and let be its irreducible characters, where is the trivial character. Consider an element of . For a cycle of , the conjugacy class of in is called the cycle product associated with this cycle [7 (4.2.1)].
The conjugacy classes of can be described using -multipartitions of . We recall the following result of James and Kerber.
Proposition 3.1 ([7 Theorem 4.2.8]). The conjugacy classes of are indexed by the elements of . More precisely, the conjugacy class of corresponds to the -multipartition , where is the partition consisting of the lengths of those cycles of whose cycle products belong to .
Let be the irreducible representations of corresponding to the irreducible characters , respectively. We recall the following result of James and Kerber.
Proposition 3.2 ([7 Theorem 4.4.3]). The irreducible representations of are indexed by the elements of . Let , and put . Then the corresponding irreducible representation is given by
where denotes the Specht module of corresponding to the partition .
Let denote the character of , and let be its value on the conjugacy class indexed by . If has an integer-valued character table, that is, for all , then the character values of are also integers. In particular, for all [7 Corollary 4.4.11].
Moreover, by [16 §13.1], the character table of is integer-valued if and only if every element is conjugate to for every integer relatively prime to the order of .
Throughout the paper, we assume that is a finite group with an integer-valued character table and conjugacy classes.
Hooks, border strips and the Murnaghan–Nakayama rule
Let be a partition. The hook corresponding to a box in the Young diagram of consists of and all boxes to its right and below it. The hook length is the total number of boxes in the hook, while its height is one less than the number of rows occupied by the hook.
The border strip, also called a rim hook, associated with is denoted by . It consists of connected boxes along the south-east boundary of the Young diagram, starting from the rightmost box of and ending at its bottommost box. The border strip has boxes and the same height as . Removing from gives a partition of . Conversely, every removable border strip of corresponds to a unique hook of . Here, a border strip is a connected skew Young diagram containing no square.
For a positive integer , a partition is called a -core if none of its hook lengths is divisible by .
Let . For an index and a hook of , we denote by the -multipartition of obtained by removing the border strip from , while leaving the other components unchanged.
Similarly, let . If contains a part equal to , then denotes the -multipartition obtained by deleting one such part from .
Proposition 3.3 (Murnaghan–Nakayama rule for ). Let , and suppose that contains a part equal to . Then
where the inner sum runs over all hooks of length in . Here, .
Proof. By the Murnaghan–Nakayama rule for wreath products [7 Theorem 4.4.10] (see also [4 Proposition 2.8]), the character value can be expressed as a sum over all rim hook decompositions of corresponding to . In each decomposition, border strips are removed successively from the components of , with lengths equal to the parts of in a fixed order.
If a border strip is removed from corresponding to a part of , then it contributes the factor together with the sign , where is the corresponding hook.
Since the rule holds for any fixed ordering of the parts of , we choose the part of first. We then group the rim hook decompositions according to the component and the hook of length removed in the first step.
After removing this border strip, the remaining decomposition corresponds to and . Summing over all possible components and hooks of length , we obtain (3.1). □
When is the trivial group, we have , and (3.1) reduces to the classical Murnaghan–Nakayama rule [7 Theorem 2.4.7].
Permutation characters
Let , and write . Let be the Young subgroup of corresponding to , and put . Following [4 Definition 2.9], we define the permutation module
We denote the value of its character on the conjugacy class indexed by by .
Definition 1 ([4 Definition 2.10]). Let . We treat each row of the components of and as a distinct object, even if some rows have the same length. A row decomposition of by is a map from the rows of to the rows of such that, for each row of , the
sum of the lengths of the rows in equals the length of . We denote the set of all such row decompositions by .
The following proposition gives a formula for the permutation character values.
Proposition 3.4 ([4 Proposition 2.11]). For , we have
where is the number of rows of assigned to rows of by .
Recall that the dominance order on partitions of the same size is defined by if
for every . For -multipartitions and with equal corresponding component sizes, we write if for every .
Lemma 3.5 ([4 Lemma 2.13]). For , we have
if for every , and otherwise. Here denotes the Kostka number. In particular, the matrix is unitriangular with respect to a total ordering refining the componentwise dominance order, and hence is invertible over .
Corollary 3.6. Every irreducible character of is an integral linear combination of the permutation characters , where .
Proof. By Lemma 3.5, the character of satisfies
The matrix of multiplicities is unitriangular with integer entries, so its inverse also has integer entries. Therefore, every irreducible character is an integral linear combination of the permutation characters.
Counting partitions and multipartitions
We recall the following results on the number of partitions and multipartitions.
Lemma 3.7. Let be fixed. Then there exist positive constants and such that, for every , the following hold.
If , then
(2) If , then
Proof. (1) Let be sufficiently large and . Since , Lemma 1.2 gives
Now, and . Therefore,
which proves (1).
(2) Suppose that . Since is non-decreasing, we have
Applying part (1) with , we obtain
for some constant and all sufficiently large . This completes the proof. □
We next recall a lemma that will be useful in the proof of Lemma 7.1.
Lemma 3.8 ([13 Lemma 5]). For integers , the number of partitions of that are not -cores is at most .
Proofs of the Main Results
In this section, we first define the relation on multipartitions.
Definition 2. Let , where is a prime and , and let . We say that is obtained from by a -reduction if there exist and such that for every , and is obtained from by replacing parts of size with parts of size . Let denote the equivalence relation on generated by these reductions.
We now state a congruence relation for the character values of .
Proposition 4.1. If , then
for every .
Starting with , we repeatedly apply -reductions whenever a part occurs at least times in some component. Each reduction decreases the total number of parts, so the process terminates.
The final multipartition does not depend on the order in which the reductions are performed. Indeed, reductions involving different components or different part sizes can be performed in either order and give the same result. If two reductions involve the same component and the same part size, they produce the same multipartition. Since each reduction decreases the total number of parts, the process eventually stops, and the final multipartition is uniquely determined.
We denote the resulting multipartition by . By construction, each component is obtained from by the reduction procedure described in [15 Proposition 2.3]. Hence, Proposition 4.1 gives
for every .
Theorem 4.2 (Divisibility criterion). Let be distinct positive integers, and let , not necessarily distinct. Suppose that is such that, for each , the component contains at least parts equal to . Define
If every component , , is a -core for every , then
When , the result gives if every component of is an -core, as used in [4].
Proposition 4.3. Let be fixed. Then there exist constants and such that, for every and every prime power satisfying (1.2), the following holds. For all but at most
multipartitions , there exists a such that and contains distinct parts , each occurring at least times, with
Proposition 4.4. Let be fixed. Then there exist constants and such that, for every , every , and every integer
the number of multipartitions for which at least one component is not a -core is at most
The preceding results provide the necessary tools to prove Theorem 1.3.
Proof of Theorem 1.3. Assume Propositions 4.1, 4.3, 4.4, and Theorem 4.2. Let be sufficiently large, and let satisfy (2). Set . We divide the pairs for which into two cases.
Case 1.
Suppose that belongs to the exceptional set in Proposition 4.3. The number of such pairs is at most
Case 2.
Suppose that does not belong to the exceptional set. By Proposition 4.3, there exist an index and distinct positive integers satisfying (5). Let . For every , we have for some . Hence, by (5),
Moreover,
since there are choices for an index with , and each of the remaining entries can take any integer value from to . Thus, there are at most such -tuples.
By Proposition 4.4, for each , the number of multipartitions having at least one component that is not a -core is at most
Therefore, the number of multipartitions having at least one component that is not a -core for some is at most
For every remaining , all components are -cores for every . Since contains at least parts equal to each , Theorem 4.2 gives
By (4), we also have
Thus, for each non-exceptional , there are at most
choices of for which .
Combining the two cases, the total number of pairs with is at most
It remains to estimate these two terms. Write . By (1.2), we have
Hence,
and
Since and , we obtain
Also, for sufficiently large , so . Therefore,
It follows that the second term in (4.3) is bounded by
Similarly, the first term is at most
Hence, the number of pairs satisfying is
This completes the proof of Theorem 1.3. □
We now turn to the proof of Theorem 1.1.
Proof of Theorem 1.1. For any fixed prime power , the condition (1.2) holds for all sufficiently large . By Theorem 1.3, the proportion of entries in the character table that are not divisible by is
This proves Theorem 1.1. □
The preceding result allows us to prove the following Corollary.
Proof of Corollary 1.4. Now let be a fixed positive integer with prime power factorization , where the are pairwise coprime. An integer is divisible by if and only if it is divisible by every . Therefore, the proportion of character table entries not divisible by is at most
This proves Corollary 1.4. □
Proof of Proposition 4.1
To prove Proposition 4.1, we first establish some necessary results, which are discussed below. We then use these results to prove the proposition.
Lemma 5.1. Let , and write . Then, for every integer , we have
Proof. First, suppose that . Write , where . By the multinomial theorem, we have
for some , since every multinomial coefficient involving at least two distinct terms is divisible by . By Fermat’s little theorem, . Hence,
for some .
Now let . Taking the -th power on both sides of (5.1), we obtain
For , we have
Therefore,
where denotes the exponent of dividing . Since , it follows that
Thus, every term in the sum is divisible by , which proves the lemma.
Remark 1. Taking , where , Lemma 5.1 gives
When , this follows from Euler’s theorem, since . When , both terms are divisible by , since . The polynomial congruence in Lemma 5.1 allows us to extend this result to the sums arising in the row decomposition formula.
In the following subsection, we discuss how can be expressed as a coefficient of a polynomial. Related results can be found in [9 Chapter I, Appendix B] and [8].
Permutation characters as coefficients
Fix . For each row of , introduce a variable , where and . Define
For and , let
where we use the assumption that . For any polynomial , let denote the coefficient of in .
Lemma 5.2. For every , we have
where the inner product runs over all parts of , counted with multiplicity.
Proof. We label the rows of by , where and . Similarly, we label the rows of by , where and . By the definition of , we have
When we expand the product
we choose one term from each factor. This is equivalent to assigning each row of to a row of . Thus, each choice determines a map from the rows of to the rows of .
For each row of , let be the sum of the lengths of the rows of assigned to . Then the corresponding monomial is
This monomial equals if and only if
for every row of . By the definition of a row decomposition, this holds precisely when . For such a row decomposition , the corresponding coefficient is
where is the number of rows of assigned to rows of .
Therefore, the coefficient of is
where the last equality follows from Proposition 3.4. □
Example 1. Let , with conjugacy classes and . The irreducible characters of satisfy
Consider the -multipartitions
We compute using Proposition 3.4 and Lemma 5.2.
Using Proposition 3.4. We first compute using the row decomposition formula. The components and have rows of lengths , and , respectively. Similarly, and have rows of lengths , , and , , respectively. We treat the two rows of length as distinct rows.
A row decomposition assigns each row of to a row of so that the sum of the assigned row lengths equals the length of the corresponding row of . Each row contributes a factor of $1$, except when a row of is sent to , in which case it contributes $-1.
We consider two cases depending on where the row of length in is assigned.
Case 1. Suppose this row is assigned to the row of length in . The remaining rows have lengths and must fill the rows of lengths in . Use the rows (the two rows of length are distinct). This can be done in three ways:
Possibility 1
Possibility 2
Possibility 3
Each decomposition has weight . Thus, the total contribution is .
Case 2.
Suppose the row of length in is assigned to the row of length in . One of the two rows of length must also be assigned to this row. The row of length in is then filled by a row of length and the remaining row of length . The other row of length fills the row of length in .
There are two choices for the row of length and two choices for the row of length . Hence, there are four decompositions. Two have weight , and the other two have weight . Their total contribution is therefore .
Thus, there are seven row decompositions, and Proposition 3.4 gives
Using Lemma 5.2. We now compute using the coefficient formula. Since has two rows and has one row, we introduce the variables . By the definition of , we have
Using the character values of in the definition of , we obtain
Since and , the product in Lemma 5.2 becomes
Therefore,
Thus, we need to find the coefficient of in the polynomial . For simplicity, write , and . Then
which agrees with the result obtained from Proposition 3.4.
We are now ready to prove Proposition 4.1.
Proof of Proposition 4.1. It is enough to consider a single -reduction. Suppose that and , for some partition , and for . Fix , and define
Thus, is the product corresponding to all parts of except the selected parts of size in . It is also the product corresponding to all parts of except the selected parts of size in . Since
Lemma 5.2 gives
By Lemma 5.1, we have
Since , it follows that
Finally, by Corollary 3.6, every irreducible character can be written as an integral linear combination of permutation characters:
Therefore,
This proves the proposition. □
Proof of Theorem 4.2
In this section, we extends [15 Proposition 5.2] to wreath products. We then use this proposition to prove Theorem 4.2.
Proposition 6.1. Let , put , and fix . Suppose that and that contains at least parts equal to . Let be obtained from by removing parts equal to from .
Suppose that and each component is an -core. Then
where . The sum runs over all -multipartitions of such that each is obtained from by successively removing border strips of length , where
Proof. Apply the Murnaghan–Nakayama rule (3) times, using the selected parts of size in . Since these parts belong to the same component, their cycle products lie in the same conjugacy class . We obtain
Here and . The sum runs over all sequences in which is a hook of length in the component .
Now group the terms in (8) according to the final multipartition . For each , let
Thus, is the number of hooks removed from component , and .
Since removing a hook from one component does not affect the other components, a sequence leading to is determined by choosing an order for the components and a sequence of hook removals within each component. There are
ways to choose the order of the components. For each , let
denote the number of sequences of hooks of length leading from to , where if . Hence, the total number of sequences leading to is
Since all the selected parts belong to , the character factor is
which depends only on . Also, by [15 Lemma 5.4], the sign of each sequence is
Therefore,
Since , it remains to prove that
First, suppose that at least two of the are positive. Then there is an index such that . Since
the multinomial coefficient is divisible by . As , we have
Thus, the required divisibility holds. Note that this case cannot occur when , since then .
Now suppose that only one of the is positive. Then for some , and all other are zero. In this case,
Since is an -core, by [15 Lemma 5.5] gives
Hence, the required divisibility holds in this case as well.
Therefore, every coefficient of in the above sum is divisible by . This proves the proposition. □
Remark 2. The assumption that the cycles of length have their cycle products in the same conjugacy class ensures that the factor does not depend on the order of hook removals from different components. This condition holds in our application because -reductions do not move parts between components. Thus, the equal parts in belong to the same component.
Proof of Theorem 4.2. Let . For , let be obtained from by removing parts equal to from for each . Thus,
Since the are distinct, these selected parts are distinct. For , define
In particular, and . We prove by induction on that
where every component of each multipartition in the sum is a -core for all . For , this follows directly from the assumption on .
Now suppose that (9) holds for some . Let be a multipartition appearing in the sum, and put
Since , every component of is an -core. Also, contains at least parts equal to . Removing of these parts gives . Therefore, by Proposition 6.1,
where each component is obtained from by successively removing border strips of length . We now show that every component of is a -core for all . Fix . For every , we have
because already has a coefficient equal to at some index . Hence, every component is a -core for .
By [15 Lemma 5.3], removing one border strip of length preserves the -core property for . Repeating this argument times shows that is a -core for . In particular, is a -core. Thus, substituting the above expression for in (9), we obtain (9) with in place of .
Finally, taking in (9), we obtain
Since the coefficients and character values are integers, it follows that . This completes the proof. □
Proof of Proposition 4.4
Before proving Proposition 4.4, we state and prove the following lemma, which will be useful in the proof.
Lemma 7.1. Let be integers. Then the number of for which at least one component is not a -core is at most .
Proof. Fix . For each , we use Lemma 3.8 to count the multipartitions for which is not a -core. Their number is at most
where the last equality follows from (1.1). Summing over all gives the required bound. □
We now use this lemma to prove Proposition 4.4.
Proof of Proposition 4.4. Let . If , then every component of is a -core, since its size is at most . Thus, we may assume that . Let .
Case 1. .
By Lemma 7.1 and Lemma 3.7(1), the number of such multipartitions is at most
Let . Since is decreasing for , and
for all sufficiently large , we have . Also, . Therefore,
where we use and assume that is sufficiently large. Hence, the number of such multipartitions is at most
Case 2. .
By Lemma 7.1 and Lemma 3.7(2), the number of such multipartitions is at most
for all sufficiently large , since . This proves the proposition. □
Proof of Proposition 4.3
We first recall the following result of Peluse and Soundararajan for ordinary partitions. Its proof uses estimates for partitions into powers of and a saddle-point bound for the partition generating function (see [15 Sections 8–9]).
Proposition 8.1 ([15 Proposition 2.3]). There exist absolute constants and such that the following holds. Let , and suppose that
For a partition , let be the partition obtained by replacing equal parts with equal parts . We repeat this process until no part occurs more than times. Then, for all but at most
partitions , the partition contains distinct part sizes , each occurring at least times, such that
We call a partition -exceptional if it belongs to the exceptional set in Proposition 8.1. Let denote the number of -exceptional partitions of .
We now use Proposition 8.1 to prove Proposition 4.3.
Proof of Proposition 4.3. Let be sufficiently large so that , and suppose that satisfies (1.2). The function is increasing for . Hence, for every integer with , we have
Thus, Proposition 8.1 applies to partitions of , giving
Now let . Since , there is at least one index such that . Suppose that at least one such component is not exceptional in the sense of Proposition 8.1. Fix this , and put . By Proposition 8.1, the reduced partition contains distinct part sizes , each occurring at least times, such that
where the last inequality follows from and the fact that is increasing for . Hence, (4.2) holds. Therefore, the exceptional multipartitions must belong to
where is the set of such that and is exceptional in Proposition 8.1. For each fixed , counting according to , we obtain
where the last equality follows from (1.1).
Summing over , we conclude that the number of exceptional multipartitions is at most
This proves the proposition.
Weyl groups of type
In this section, we prove Corollary 1.5. Recall that the Weyl group of type is an index-2 subgroup of the Weyl group of type . Here, denotes the Weyl group, not the dihedral group. The conjugacy classes of are indexed by 2-multipartitions of , where .
Lemma 9.1 ([5 Proposition 3.4.12]). A conjugacy class of is contained in if and only if the corresponding 2-multipartition has an even number of parts in .
Such a conjugacy class remains a single conjugacy class of , except when and all parts of are even. In this case, it splits into two conjugacy classes of .
Since is a normal subgroup of of index 2, Clifford theory gives the following description of its irreducible characters.
Lemma 9.2 ([5 §5.6.1]). Let and be 2-multipartitions of $N. Then the following hold.
(1) If , then is irreducible, and
Distinct unordered pairs give distinct irreducible characters of .
(2) If , then is even, and
where and are distinct irreducible characters of .
Every irreducible character of arises from one of these two cases.
It follows from Lemma 9.2 that the number of irreducible characters of , which is also the number of its conjugacy classes, is
where
We are now ready to prove Corollary 1.5.
Proof of Corollary 1.5. The number of irreducible characters of obtained by restricting with is . By Theorem 1.2, we have as . Thus, the proportion of such irreducible characters of tends to 1.
Now, by Lemma 9.1, the conjugacy classes of contained in remain single conjugacy classes, except for classes, each of which splits into two classes of . Since is a subgroup of of index 2, at least half of the conjugacy classes of are contained in . Hence, these classes form a positive proportion of the conjugacy classes of .
By Corollary 1.4, applied with , the proportion of entries in the character table of not divisible by any fixed positive integer tends to 0. Therefore, the same holds when we restrict to the columns corresponding to conjugacy classes contained in . Moreover, the number of split classes and the number of irreducible characters arising from split restrictions are both negligible compared with .
It follows that the proportion of entries in the character table of not divisible by tends to 0. Hence, the proportion of entries divisible by tends to 1 as .
AI Declaration
The authors declare that no artificial intelligence tools or AI-assisted technologies were used in the preparation, writing, or mathematical analysis of this manuscript.
JAYANTA BARMAN, Indian Institute of Technology Kharagpur, Department of Mathematics, Kharagpur-721302, India.
Email address: [email protected], [email protected]
Kamalakshya Mahatab, Indian Institute of Technology Kharagpur, Department of Mathematics, Kharagpur-721302, India.
Email address: [email protected], [email protected]
References
- [1]G. E. Andrews, The theory of partitions, Encyclopedia of Mathematics and Its Applications, vol. 2, Addison-Wesley Publishing Co., Reading, MA, 1976.
- [2]J. Barman and K. Mahatab, Asymptotic formula for multipartitions, arXiv preprint arXiv:2607.09159 (2026).arxiv.org/abs/2607.09159
- [3]J. Barman and K. Mahatab, Zeros in the character table of the wreath product of the symmetric group, preprint (2026), arXiv:2609.13905.arxiv.org/abs/2609.13905
- [4]B. Dong, H. Graff, J. Mundinger, S. Rothstein and L. Vescovo, Almost all wreath product character values are divisible by given primes, Alebr. Comb., 6 (2023), no. 6, 1519–1531.DOI
- [5]M. Geck and G. Pfeiffer, Characters of finite Coxeter groups and Iwahori–Hecke algebras, London Mathematical Society Monographs, New Series, no. 21, Oxford University Press, New York, 2000.DOI
- [6]G. H. Hardy and S. Ramanujan, Asymptotic formulae in combinatory analysis, Proc. London Math. Soc. (2) 17 (1918), 75–115.
- [7]G. James and A. Kerber, The representation theory of the symmetric group, Encyclopedia of Mathematics and Its Applications, vol. 16, Addison-Wesley Publishing Co., Reading, MA, 1981.
- [8]A. Kerber and J. Tappe, On permutation characters of wreath products, Discrete Math., 15 (2) (1976), 151–161.DOI
- [9]I. G. Macdonald, Symmetric functions and Hall polynomials, 2nd ed., Oxford Mathematical Monographs, Oxford University Press, New York, 1995.DOI
- [10]G. Meinardus, Asymptotische Aussagen über Partitionen, Math. Z., 59 (1954), 388–398.DOI
- [11]A. R. Miller, On parity and characters of symmetric groups, J. Combin. Theory Ser. A, 162 (2019), 231–240.DOI
- [12]A. R. Miller, Congruences in character tables of symmetric groups, preprint (2019), arXiv:1908.03741.arxiv.org/abs/1908.03741
- [13]L. Morotti, On divisibility by primes in columns of character tables of symmetric groups, Arch. Math. (Basel), 114 (2020), no. 4, 361–365.arxiv.org/abs/1902.02625
- [14]M. R. Murty, The partition function revisited, in: The Legacy of Srinivasa Ramanujan, Ramanujan Math. Soc. Lect. Notes Ser., vol. 20, Ramanujan Math. Soc., Mysore, 2013, 261–279.
- [15]S. Peluse and K. Soundararajan, Divisibility of character values of the symmetric group by prime powers, Algebra Number Theory, 19 (2025), no. 2, 365–382.DOI
- [16]J.-P. Serre, Linear representations of finite groups, Graduate Texts in Mathematics, vol. 42, Springer-Verlag, New York, 1977.DOI