Separating Characters by Blocks

We investigate the problem of finding a set of prime divisors of the order of a finite group, such that no two irreducible characters are in the same p‐block for all primes p in the set. Our main focus is on the simple and quasi‐simple groups. For results on the alternating and symmetric groups and their double covers, some combinatorial results on the cores of partitions are proved, which may be of independent interest. We also study the problem for groups of Lie type. The sporadic groups (and their relatives) are checked using GAP.