On random shifted standard Young tableaux and 132-avoiding sorting networks
Combinatorics
2018-04-06 v1 Probability
Abstract
We study shifted standard Young tableaux (SYT). The limiting surface of uniformly random shifted SYT of staircase shape is determined, with the integers in the SYT as heights. This implies via properties of the Edelman-Greene bijection results about random 132-avoiding sorting networks, including limit shapes for trajectories and intermediate permutations. Moreover, the expected number of adjacencies in SYT is considered. It is shown that on average each row and each column of a shifted SYT of staircase shape contains precisely one adjacency.
Cite
@article{arxiv.1804.01795,
title = {On random shifted standard Young tableaux and 132-avoiding sorting networks},
author = {Svante Linusson and Samu Potka and Robin Sulzgruber},
journal= {arXiv preprint arXiv:1804.01795},
year = {2018}
}
Comments
26 pages, 21 figures