Covering Numbers of Some Irreducible Characters of the Symmetric Group
Rijubrata Kundu, Velmurugan S

TL;DR
This paper calculates the covering numbers for specific irreducible characters of the symmetric group, focusing on characters associated with certain two-row and hook partitions, providing explicit values for these cases.
Contribution
It determines the covering numbers for irreducible characters of symmetric groups indexed by particular two-row and hook partitions, extending understanding of character coverings.
Findings
Covering numbers for characters indexed by (n-2,2) and ((n+1)/2, (n-1)/2) when n is odd.
Covering numbers for characters indexed by (n-2,1^2) and specific hook partitions.
Explicit values of covering numbers for these classes of irreducible characters.
Abstract
The covering number of a non-linear character of a finite group is the least positive integer such that every irreducible character of occurs in . We determine the covering numbers of irreducible characters of the symmetric group indexed by certain two-row partitions (and their conjugates), namely and when is odd. We also determine the covering numbers of irreducible characters indexed by certain hook-partitions (and their conjugates), namely , the almost self-conjugate hooks when is even, and the self-conjugate hooks when is odd.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Graph theory and applications · Graph Labeling and Dimension Problems
