Modular zeros in the character table of the symmetric group

Abstract: In 2017, Miller conjectured, based on computational evidence, that for any fixed prime $p$ the density of entries in the character table of $S_n$ that are divisible by $p$ goes to $1$ as $n$ goes to infinity. I’ll describe a proof of this conjecture, which is joint work with K. Soundararajan. I will also discuss the (still open) problem of determining the asymptotic density of zeros in the character table of $S_n$, where it is not even clear from computational data what one should expect.

computational geometrydiscrete mathematicscommutative algebracombinatorics

Audience: researchers in the topic

Copenhagen-Jerusalem Combinatorics Seminar

Series comments: There is a mailing list for talk announcements. If you want to receive the announcements, send an e-mail to the organizer to subscribe to the mailing list.

The password for the zoom room is 123456