{
  "id": "2312.07267",
  "version": "v1",
  "published": "2023-12-12T13:46:37.000Z",
  "updated": "2023-12-12T13:46:37.000Z",
  "title": "Character and class parameters from entries of character tables of symmetric groups",
  "authors": [
    "Alexander R. Miller"
  ],
  "categories": [
    "math.RT",
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2023-12-12T13:46:37.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "20C30"
    ],
    "keywords": [
      "character table",
      "symmetric groups",
      "class parameters",
      "fast algorithmic solution",
      "conjugacy classes"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}