Runs and RSK tableaux of boolean permutations
Combinatorics
2024-02-09 v2
Abstract
We define and construct the "canonical reduced word" of a boolean permutation, and show that the RSK tableaux for that permutation can be read off directly from this reduced word. We also describe those tableaux that can correspond to boolean permutations, and enumerate them. In addition, we generalize a result of Mazorchuk and Tenner, showing that the "run" statistic influences the shape of the RSK tableau of arbitrary permutations, not just of those that are boolean.
Cite
@article{arxiv.2207.05119,
title = {Runs and RSK tableaux of boolean permutations},
author = {Emily Gunawan and Jianping Pan and Heather M. Russell and Bridget Eileen Tenner},
journal= {arXiv preprint arXiv:2207.05119},
year = {2024}
}
Comments
final version, to appear in Annals of Combinatorics