Character and class parameters from entries of character tables of symmetric groups
Representation Theory
2023-12-13 v1 Combinatorics
Abstract
If all of the entries of a large 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.
Cite
@article{arxiv.2312.07267,
title = {Character and class parameters from entries of character tables of symmetric groups},
author = {Alexander R. Miller},
journal= {arXiv preprint arXiv:2312.07267},
year = {2023}
}