Distribution of the shape of Markovian random words

The distribution of the shape λ of the semi-standard tableau of a random word in k letters is asymptotically given by the distribution of the spectrum of a random traceless k×k Gaussian Unitary Ensemble (GUE) matrix provided that these letters are independent with uniform distribution. Kuperberg (2002) conjectured that this result by Johansson (2001) remains valid if the letters of the word are generated by an irreducible Markov chain on the alphabet with cyclic transition matrix. In this paper we give a proof of this conjecture for an alphabet with k=2 letters.