Identifier
Mp00033: Dyck paths —to two-row standard tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00069: Permutations —complement⟶ Permutations
Mp00109: Permutations —descent word⟶ Binary words
Images
=>
Cc0005;cc-rep-0Cc0007;cc-rep-1
[1,0]=>[[1],[2]]=>[2,1]=>[1,2]=>0 [1,0,1,0]=>[[1,3],[2,4]]=>[2,4,1,3]=>[3,1,4,2]=>101 [1,1,0,0]=>[[1,2],[3,4]]=>[3,4,1,2]=>[2,1,4,3]=>101 [1,0,1,0,1,0]=>[[1,3,5],[2,4,6]]=>[2,4,6,1,3,5]=>[5,3,1,6,4,2]=>11011 [1,0,1,1,0,0]=>[[1,3,4],[2,5,6]]=>[2,5,6,1,3,4]=>[5,2,1,6,4,3]=>11011 [1,1,0,0,1,0]=>[[1,2,5],[3,4,6]]=>[3,4,6,1,2,5]=>[4,3,1,6,5,2]=>11011 [1,1,0,1,0,0]=>[[1,2,4],[3,5,6]]=>[3,5,6,1,2,4]=>[4,2,1,6,5,3]=>11011 [1,1,1,0,0,0]=>[[1,2,3],[4,5,6]]=>[4,5,6,1,2,3]=>[3,2,1,6,5,4]=>11011 [1,0,1,0,1,0,1,0]=>[[1,3,5,7],[2,4,6,8]]=>[2,4,6,8,1,3,5,7]=>[7,5,3,1,8,6,4,2]=>1110111 [1,0,1,0,1,1,0,0]=>[[1,3,5,6],[2,4,7,8]]=>[2,4,7,8,1,3,5,6]=>[7,5,2,1,8,6,4,3]=>1110111 [1,0,1,1,0,0,1,0]=>[[1,3,4,7],[2,5,6,8]]=>[2,5,6,8,1,3,4,7]=>[7,4,3,1,8,6,5,2]=>1110111 [1,0,1,1,0,1,0,0]=>[[1,3,4,6],[2,5,7,8]]=>[2,5,7,8,1,3,4,6]=>[7,4,2,1,8,6,5,3]=>1110111 [1,0,1,1,1,0,0,0]=>[[1,3,4,5],[2,6,7,8]]=>[2,6,7,8,1,3,4,5]=>[7,3,2,1,8,6,5,4]=>1110111 [1,1,0,0,1,0,1,0]=>[[1,2,5,7],[3,4,6,8]]=>[3,4,6,8,1,2,5,7]=>[6,5,3,1,8,7,4,2]=>1110111 [1,1,0,0,1,1,0,0]=>[[1,2,5,6],[3,4,7,8]]=>[3,4,7,8,1,2,5,6]=>[6,5,2,1,8,7,4,3]=>1110111 [1,1,0,1,0,1,0,0]=>[[1,2,4,6],[3,5,7,8]]=>[3,5,7,8,1,2,4,6]=>[6,4,2,1,8,7,5,3]=>1110111 [1,1,1,0,0,1,0,0]=>[[1,2,3,6],[4,5,7,8]]=>[4,5,7,8,1,2,3,6]=>[5,4,2,1,8,7,6,3]=>1110111 [1,1,1,1,0,0,0,0]=>[[1,2,3,4],[5,6,7,8]]=>[5,6,7,8,1,2,3,4]=>[4,3,2,1,8,7,6,5]=>1110111
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
complement
Description
Sents a permutation to its complement.
The complement of a permutation $\sigma$ of length $n$ is the permutation $\tau$ with $\tau(i) = n+1-\sigma(i)$
Map
descent word
Description
The descent positions of a permutation as a binary word.
For a permutation $\pi$ of $n$ letters and each $1\leq i\leq n-1$ such that $\pi(i) > \pi(i+1)$ we set $w_i=1$, otherwise $w_i=0$.
Thus, the length of the word is one less the size of the permutation. In particular, the descent word is undefined for the empty permutation.