{'fraction_non_alphanumeric': 0.02037617554858934, 'fraction_numerical': 0.001567398119122257, 'mean_word_length': 4.97196261682243, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Symmetric group character degrees and hook numbers

In this article we prove the following result: for any two natural numbers k and ℓ, and for all sufficiently large symmetric groups Sn, there are k disjoint sets of ℓ irreducible characters of Sn, such that each set consists of characters with the same degree, and distinct sets have different degrees. In particular, this resolves a conjecture most recently made by Moretó in [5]. The methods employed here are based upon the duality between irreducible characters of the symmetric groups and the partitions to which they correspond. Consequently, the paper is combinatorial in nature.