Georgia Institute of Technology College of Sciences

In this presentation, interactions between spectra of classical Gaussian ensembles and subsequence problems are studied with the help of the powerful machinery of Young tableaux. For the random word problem, from an ordered finite alphabet, the shape of the associated Young tableaux is shown to converge to the spectrum of the (generalized) traceless GUE. Various properties of the (generalized) traceless GUE are established, such as a law of large number for the extreme eigenvalues and the convergence of the spectral measure towards the semicircle law. The limiting shape of the whole tableau is also obtained as a Brownian functional. The Poissonized word problem is finally talked, and, with it, the convergence of the whole Poissonized tableaux is derived.