Character and class parameters from entries of character tables of symmetric groups

2023/12/12 by Miller, Alexander R.
#20C30 #Combinatorics (math.CO) #FOS: Mathematics #Representation Theory (math.RT)

paper · doi:10.48550/arxiv.2312.07267

Abstract

If all of the entries of a large S_n character table are covered up and you are allowed to uncover one entry at a time, then how can you quickly identify all of the indexing characters and conjugacy classes? We present a fast algorithmic solution that works even when n is so large that almost none of the entries of the character table can be computed. The fraction of the character table that needs to be uncovered has exponential decay, and for many of these entries we are only interested in whether the entry is zero.

Related

• A Database of Groups with Equivalent Character Tables
• Character table sudokus
• Labelling the character tables of symmetric and alternating groups
• Identities in character tables of S_n
• Constructing the ordinary character tables of some Atlas groups using\n character theoretic methods