Identifier
Mp00231:
Integer compositions
—bounce path⟶
Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00109: Permutations —descent word⟶ Binary words
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00109: Permutations —descent word⟶ Binary words
Images
[1] => [1,0] => [1] =>
[1,1] => [1,0,1,0] => [1,2] => 0
[2] => [1,1,0,0] => [2,1] => 1
[1,1,1] => [1,0,1,0,1,0] => [1,2,3] => 00
[1,2] => [1,0,1,1,0,0] => [1,3,2] => 01
[2,1] => [1,1,0,0,1,0] => [2,1,3] => 10
[3] => [1,1,1,0,0,0] => [3,1,2] => 10
[1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => 000
[1,1,2] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => 001
[1,2,1] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => 010
[1,3] => [1,0,1,1,1,0,0,0] => [1,4,2,3] => 010
[2,1,1] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => 100
[2,2] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => 101
[3,1] => [1,1,1,0,0,0,1,0] => [3,1,2,4] => 100
[4] => [1,1,1,1,0,0,0,0] => [4,1,2,3] => 100
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => 0000
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => 0001
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => 0010
[1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,3,4] => 0010
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => 0100
[1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => 0101
[1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,4,2,3,5] => 0100
[1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,5,2,3,4] => 0100
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => 1000
[2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => 1001
[2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => 1010
[2,3] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,3,4] => 1010
[3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [3,1,2,4,5] => 1000
[3,2] => [1,1,1,0,0,0,1,1,0,0] => [3,1,2,5,4] => 1001
[4,1] => [1,1,1,1,0,0,0,0,1,0] => [4,1,2,3,5] => 1000
[5] => [1,1,1,1,1,0,0,0,0,0] => [5,1,2,3,4] => 1000
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => 00000
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => 00001
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => 00010
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,4,5] => 00010
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => 00100
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => 00101
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,3,4,6] => 00100
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,3,4,5] => 00100
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => 01000
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => 01001
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => 01010
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,4,5] => 01010
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,2,3,5,6] => 01000
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,2,3,6,5] => 01001
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,5,2,3,4,6] => 01000
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,6,2,3,4,5] => 01000
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [2,1,3,4,5,6] => 10000
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [2,1,3,4,6,5] => 10001
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [2,1,3,5,4,6] => 10010
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [2,1,3,6,4,5] => 10010
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [2,1,4,3,5,6] => 10100
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [2,1,4,3,6,5] => 10101
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [2,1,5,3,4,6] => 10100
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [2,1,6,3,4,5] => 10100
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [3,1,2,4,5,6] => 10000
[3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [3,1,2,4,6,5] => 10001
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [3,1,2,5,4,6] => 10010
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [3,1,2,6,4,5] => 10010
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [4,1,2,3,5,6] => 10000
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [4,1,2,3,6,5] => 10001
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [5,1,2,3,4,6] => 10000
[6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [6,1,2,3,4,5] => 10000
[1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6,7] => 000000
[1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,5,7,6] => 000001
[1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,4,6,5,7] => 000010
[1,1,1,1,3] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,4,7,5,6] => 000010
[1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,3,5,4,6,7] => 000100
[1,1,1,2,2] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,3,5,4,7,6] => 000101
[1,1,1,3,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,3,6,4,5,7] => 000100
[1,1,1,4] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,3,7,4,5,6] => 000100
[1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => [1,2,4,3,5,6,7] => 001000
[1,1,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0] => [1,2,4,3,5,7,6] => 001001
[1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0] => [1,2,4,3,6,5,7] => 001010
[1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0] => [1,2,4,3,7,5,6] => 001010
[1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0] => [1,2,5,3,4,6,7] => 001000
[1,1,3,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0] => [1,2,5,3,4,7,6] => 001001
[1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0] => [1,2,6,3,4,5,7] => 001000
[1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0] => [1,2,7,3,4,5,6] => 001000
[1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0] => [1,3,2,4,5,6,7] => 010000
[1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0] => [1,3,2,4,5,7,6] => 010001
[1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0] => [1,3,2,4,6,5,7] => 010010
[1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0] => [1,3,2,4,7,5,6] => 010010
[1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0] => [1,3,2,5,4,6,7] => 010100
[1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4,7,6] => 010101
[1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0] => [1,3,2,6,4,5,7] => 010100
[1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0] => [1,3,2,7,4,5,6] => 010100
[1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0] => [1,4,2,3,5,6,7] => 010000
[1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0] => [1,4,2,3,5,7,6] => 010001
[1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => [1,4,2,3,6,5,7] => 010010
[1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => [1,4,2,3,7,5,6] => 010010
[1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => [1,5,2,3,4,6,7] => 010000
[1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => [1,5,2,3,4,7,6] => 010001
[1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => [1,6,2,3,4,5,7] => 010000
[1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,7,2,3,4,5,6] => 010000
[2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [2,1,3,4,5,6,7] => 100000
[2,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => [2,1,3,4,5,7,6] => 100001
[2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0] => [2,1,3,4,6,5,7] => 100010
[2,1,1,3] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0] => [2,1,3,4,7,5,6] => 100010
[2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => [2,1,3,5,4,6,7] => 100100
[2,1,2,2] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0] => [2,1,3,5,4,7,6] => 100101
>>> Load all 350 entries. <<<Map
bounce path
Description
The bounce path determined by an integer composition.
Map
to 321-avoiding permutation (Krattenthaler)
Description
Krattenthaler's bijection to 321-avoiding permutations.
Draw the path of semilength $n$ in an $n\times n$ square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
Draw the path of semilength $n$ in an $n\times n$ square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
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.
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.
searching the database
Sorry, this map was not found in the database.