A Vershik-Kerov theorem for wreath products

TL;DR

This paper extends the Vershik-Kerov theorem to a specific class of wreath product groups, showing that the expected length of the longest increasing subsequence scales as 4 times the square root of the product of the parameters.

Contribution

It establishes a new asymptotic result for the expected longest increasing subsequence in a class of wreath product groups, expanding the scope of the Vershik-Kerov theorem.

Findings

Expected length of LIS asymptotic to 4√(nk)

Different behavior from colored permutations

Asymptotic mean derived for large n,k

Abstract

Let $G_{n,k}$ be the group of permutations of $\{1,2,\ldots, kn\}$ that permutes the first $k$ symbols arbitrarily, then the next $k$ symbols and so on through the last $k$ symbols. Finally the $n$ blocks of size $k$ are permuted in an arbitrary way. For $\sigma$ chosen uniformly in $G_{n,k}$, let $L_{n,k}$ be the length of the longest increasing subsequence in $\sigma$. For $k,n$ growing, we determine that the limiting mean of $L_{n,k}$ is asymptotic to $4\sqrt{nk}$. This is different from parallel variations of the Vershik-Kerov theorem for colored permutations.