English

The $k$-Plancherel measure and a Finite Markov Chain

Combinatorics 2026-01-01 v1 Probability

Abstract

Let Pk(n)\mathcal{P}_k(n) denote the set of partitions of nn whose largest part is bounded by k,k, which are in well-known bijection with (k+1)(k+1)-cores Ck\mathcal{C}_k. We study a growth process on Ck\mathcal{C}_k, whose stationary distribution is the kk-Plancherel measure, which is a natural extension of the Plancherel measure in the context of kk-Schur functions. When kk\to\infty it converges to the Plancherel measure for partitions, a limit studied first by Vershik-Kerov. However, when kk is fixed and nn\to \infty, 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 kk, is governed by a finite Markov chain with k!k! states over a subset of the kk-bounded partitions or equivalently as a TASEP over cyclic permutations of length k+1k+1. This paper initiates the study of these processes, state some theorems and several intriguing conjectures found by computations of the finite Markov chain.

Keywords

Cite

@article{arxiv.2512.24346,
  title  = {The $k$-Plancherel measure and a Finite Markov Chain},
  author = {Svante Linusson and Alperen Özdemir},
  journal= {arXiv preprint arXiv:2512.24346},
  year   = {2026}
}

Comments

22 pages