Runs and RSK tableaux of boolean permutations

MaRDI QIDQ6506230arXivFDO

Authors Emily Gunawan, Jian-Ping Pan, Heather M. Russell, Bridget Eileen Tenner

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial identities, bijective combinatorics (05A19) Combinatorics of partially ordered sets (06A07) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

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.

This page was built for publication: Runs and RSK tableaux of boolean permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6506230)