Identifier
Mp00033: Dyck paths to two-row standard tableauStandard tableaux
Mp00081: Standard tableaux reading word permutationPermutations
Mp00131: Permutations descent bottomsBinary words
Images
=>
Cc0005;cc-rep-0Cc0007;cc-rep-1
[1,0]=>[[1],[2]]=>[2,1]=>1 [1,0,1,0]=>[[1,3],[2,4]]=>[2,4,1,3]=>100 [1,1,0,0]=>[[1,2],[3,4]]=>[3,4,1,2]=>100 [1,0,1,0,1,0]=>[[1,3,5],[2,4,6]]=>[2,4,6,1,3,5]=>10000 [1,0,1,1,0,0]=>[[1,3,4],[2,5,6]]=>[2,5,6,1,3,4]=>10000 [1,1,0,0,1,0]=>[[1,2,5],[3,4,6]]=>[3,4,6,1,2,5]=>10000 [1,1,0,1,0,0]=>[[1,2,4],[3,5,6]]=>[3,5,6,1,2,4]=>10000 [1,1,1,0,0,0]=>[[1,2,3],[4,5,6]]=>[4,5,6,1,2,3]=>10000 [1,0,1,0,1,0,1,0]=>[[1,3,5,7],[2,4,6,8]]=>[2,4,6,8,1,3,5,7]=>1000000 [1,0,1,1,1,0,0,0]=>[[1,3,4,5],[2,6,7,8]]=>[2,6,7,8,1,3,4,5]=>1000000 [1,1,0,1,0,1,0,0]=>[[1,2,4,6],[3,5,7,8]]=>[3,5,7,8,1,2,4,6]=>1000000 [1,1,0,1,1,0,0,0]=>[[1,2,4,5],[3,6,7,8]]=>[3,6,7,8,1,2,4,5]=>1000000 [1,1,1,0,0,0,1,0]=>[[1,2,3,7],[4,5,6,8]]=>[4,5,6,8,1,2,3,7]=>1000000 [1,1,1,0,1,0,0,0]=>[[1,2,3,5],[4,6,7,8]]=>[4,6,7,8,1,2,3,5]=>1000000 [1,1,1,1,0,0,0,0]=>[[1,2,3,4],[5,6,7,8]]=>[5,6,7,8,1,2,3,4]=>1000000 [1,0,1,0,1,0,1,0,1,0]=>[[1,3,5,7,9],[2,4,6,8,10]]=>[2,4,6,8,10,1,3,5,7,9]=>100000000 [1,0,1,0,1,0,1,0,1,0,1,0]=>[[1,3,5,7,9,11],[2,4,6,8,10,12]]=>[2,4,6,8,10,12,1,3,5,7,9,11]=>10000000000
Map
to two-row standard tableau
Description
Return a standard tableau of shape $(n,n)$ where $n$ is the semilength of the Dyck path.
Given a Dyck path $D$, its image is given by recording the positions of the up-steps in the first row and the positions of the down-steps in the second row.
Map
reading word permutation
Description
Return the permutation obtained by reading the entries of the tableau row by row, starting with the bottom-most row in English notation.
Map
descent bottoms
Description
The descent bottoms of a permutation as a binary word.