Abstract:We prove asymptotic equivalents of characters for finite-level representations of symmetric groups, that is, for Young diagrams which have all but finitely many boxes on their first row. The proofs rely on computing the number of ribbon tableaux of different types, which allows us to estimate characters via the Murnaghan--Nakayama rule. We deduce that random walks on symmetric groups generated by conjugacy classes with a macroscopic number of fixed points have a Poissonian cutoff profile. We also prove that the random involution walk exhibits cutoff and find its cutoff profile. Finally, we obtain numerics for the random transposition walk on a deck of 52 cards, giving concrete estimates on the question that originally motivated Diaconis and Shahshahani.
From: Lucas Teyssier [view email]
[v1]
Wed, 27 May 2026 17:27:47 UTC (28 KB)
[v2]
Thu, 25 Jun 2026 22:39:45 UTC (54 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。