Results 111 to 120 of about 11,311 (139)
Permutation tableaux and permutation patterns
Clarification of proofs (thanks to referees); report on progress on our open problems by Burstein, Corteel, Eriksen, Reifegerste, and Viennot. 25 pages, 7 figures.
Einar Steingrímsson, Lauren K Williams
exaly +3 more sources
On the sign-imbalance of permutation tableaux
18 ...
Joanna N Chen, Robin D P Zhou
exaly +4 more sources
Combinatorics on permutation tableaux of type A and type B
20 pages, 9 figures, final ...
Sylvie Corteel, Jang Soo Kim
exaly +3 more sources
Block decomposition and statistics arising from permutation tableaux
Permutation statistics $\wnm$ and $\rlm$ are both arising from permutation tableaux. $\wnm$ was introduced by Chen and Zhou, which was proved equally distributed with the number of unrestricted rows of a permutation tableau. While $\rlm$ is showed by Nadeau equally distributed with the number of $1$'s in the first row of a permutation tableau.
Joanna N Chen
exaly +4 more sources
Runs and RSK Tableaux of Boolean Permutations
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
Emily Gunawan +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The parity of the number of permutation tableaux in a fixed shape
Applied Mathematics and Computation, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carol J. Wang, Zhongjin Chen
exaly +2 more sources
A labeling scheme for young tableaux spanning representations of permutation groupS(N) [PDF]
A structure-dependent labeling scheme for the Standard Young Tableaux spanning the representations of the permutation group is outlined in the present work. This scheme is used to generate the representations of a select class of permutations such as dense cycles and general transpositions of the group using minimal storage requirements.
C R Sarma
exaly +2 more sources

