论文标题
布尔排列的Run和RSK Tableaux
Runs and RSK tableaux of boolean permutations
论文作者
论文摘要
我们定义并构建了布尔置换的“规范简化单词”，并表明该排列的RSK Tableaux可以直接从此简化的单词中读取。我们还描述了那些可以与布尔置换相对应的tableaux，并列举它们。此外，我们概括了Mazorchuk和Tenner的结果，表明“运行”统计量会影响RSK Tableau的任意排列的形状，而不仅仅是布尔值的统计数据。
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.
