The k-Plancherel measure and a Finite Markov Chain

Abstract

Let Pk(n) denote the set of partitions of n whose largest part is bounded by k, which are in well-known bijection with (k+1)-cores Ck. We study a growth process on Ck, whose stationary distribution is the k-Plancherel measure, which is a natural extension of the Plancherel measure in the context of k-Schur functions. When k∞ it converges to the Plancherel measure for partitions, a limit studied first by Vershik-Kerov. However, when k is fixed and n ∞, we conjecture that it converges to a shape close to the limit shape from the uniform growth of partitions, as studied by Rost. We show that the limiting behavior, for fixed k, is governed by a finite Markov chain with k! states over a subset of the k-bounded partitions or equivalently as a TASEP over cyclic permutations of length k+1. This paper initiates the study of these processes, state some theorems and several intriguing conjectures found by computations of the finite Markov chain.

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…