Lower Bound for The Number of Zeros in The Character Table of The Symmetric Group

Abstract

For any two partitions λ and μ of a positive integer N, let λ(μ) be the value of the irreducible character of the symmetric group SN associated with λ, evaluated at the conjugacy class of elements whose cycle type is determined by μ. Let Z(N) be the number of zeros in the character table of SN, and Zt(N) be defined as Zt(N):= \#\(λ,μ): λ(μ) = 0 \; with λ a t-core\. We prove Z(N) 2\, p(N)2 N (1+O(1 N)), where p(N) denotes the number of partitions of N. We also give explicit lower bounds for Zt(N) in various ranges of t.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…