The k-cycle shuffling with repeated cards

Abstract

We investigate the k-cycle shuffle on repeated cards, namely on a deck consisting of l identical copies of each of m card types, with total size n=ml. We establish asymptotic results for the total variation mixing of this shuffle, including cutoff and explicit limiting profiles. For fixed l, we show that the walk exhibits cutoff at time nk n with window of order nk, and we identify the limiting profile in terms of the total variation distance between Poisson distributions arising from quotient fixed-point statistics. When l∞ with sufficiently slow growth, more precisely when l=o( n), we prove that the cutoff location shifts to nk( n- 12 l), again with window of order nk, and that the limiting profile is asymptotically Gaussian, arising from a Poisson comparison after normal approximation. The proof is based on an approximation of the shuffling measure by an explicitly tractable auxiliary measure, generalizing the k=2 case from Jain and Sawhney (arXiv:2410.23944). The representation-theoretic framework underlying the analysis of this auxiliary measure follows from the work of Hough (arXiv:1605.00911) and Nestoridi and Olesker-Taylor (arXiv:2005.13437)

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…