Identifier
-
Mp00043:
Integer partitions
—to Dyck path⟶
Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000355: Permutations ⟶ ℤ
Values
[1] => [1,0,1,0] => [1,1,0,0] => [2,1] => 0
[2] => [1,1,0,0,1,0] => [1,0,1,1,0,0] => [1,3,2] => 0
[1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => [2,1,3] => 1
[3] => [1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0] => [2,4,1,3] => 0
[2,1] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => [3,1,2] => 0
[1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [3,1,4,2] => 1
[4] => [1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => [2,3,5,1,4] => 0
[3,1] => [1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => 0
[2,2] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => 1
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => 2
[1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => [3,1,4,5,2] => 2
[5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [3,4,6,1,2,5] => 0
[4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => [3,5,1,2,4] => 0
[3,2] => [1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => [1,4,2,3] => 0
[3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => 2
[2,2,1] => [1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [3,1,2,4] => 1
[2,1,1,1] => [1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [4,1,5,2,3] => 1
[1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [4,1,5,6,2,3] => 2
[5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [2,3,4,6,1,5] => 0
[4,2] => [1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => 2
[4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => [1,3,5,2,4] => 0
[3,3] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [2,4,1,3,5] => 1
[3,2,1] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [4,1,2,3] => 0
[3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => [3,1,4,2,5] => 3
[2,2,2] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0] => [1,4,2,5,3] => 1
[2,2,1,1] => [1,0,1,1,0,1,1,0,0,0] => [1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => 3
[2,1,1,1,1] => [1,0,1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [3,1,4,5,6,2] => 3
[5,2] => [1,1,1,1,0,0,1,0,0,0,1,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [2,4,6,1,3,5] => 0
[5,1,1] => [1,1,1,0,1,1,0,0,0,0,1,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => [3,4,1,6,2,5] => 2
[4,3] => [1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => [2,5,1,3,4] => 0
[4,2,1] => [1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => 0
[4,1,1,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => [3,1,5,2,4] => 2
[3,3,1] => [1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => 1
[3,2,2] => [1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => 2
[3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => 3
[3,1,1,1,1] => [1,0,1,1,1,1,0,0,1,0,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => [3,1,5,6,2,4] => 3
[2,2,2,1] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [4,1,2,5,3] => 1
[2,2,1,1,1] => [1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [4,1,5,2,6,3] => 3
[5,3] => [1,1,1,1,0,0,0,1,0,0,1,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => [2,3,4,1,6,5] => 2
[5,2,1] => [1,1,1,0,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [4,6,1,2,3,5] => 0
[5,1,1,1] => [1,1,0,1,1,1,0,0,0,0,1,0] => [1,0,1,1,0,1,0,1,1,0,0,0] => [1,3,4,6,2,5] => 0
[4,4] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0,1,0] => [2,3,5,1,4,6] => 1
[4,3,1] => [1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,3,4] => 0
[4,2,2] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => 2
[4,2,1,1] => [1,0,1,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => 3
[4,1,1,1,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,1,0,1,0,0,1,0] => [3,1,4,5,2,6] => 4
[3,3,2] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [1,4,2,3,5] => 1
[3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => 4
[3,2,2,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => [3,1,2,4,5] => 2
[3,2,1,1,1] => [1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [5,1,6,2,3,4] => 1
[2,2,2,2] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,4,2,5,6,3] => 2
[2,2,2,1,1] => [1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => [2,1,4,5,6,3] => 4
[5,4] => [1,1,1,1,0,0,0,0,1,0,1,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [2,3,6,1,4,5] => 0
[5,3,1] => [1,1,1,0,1,0,0,1,0,0,1,0] => [1,1,1,0,1,0,0,0,1,1,0,0] => [3,4,1,2,6,5] => 2
[5,2,2] => [1,1,1,0,0,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [2,4,1,6,3,5] => 2
[5,2,1,1] => [1,1,0,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,1,1,0,0,0,0] => [1,4,6,2,3,5] => 0
[5,1,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [3,1,4,6,2,5] => 3
[4,4,1] => [1,1,1,0,1,0,0,0,1,1,0,0] => [1,1,1,0,1,1,0,0,0,0,1,0] => [3,5,1,2,4,6] => 1
[4,3,2] => [1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => [1,5,2,3,4] => 0
[4,3,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,3,4] => 3
[4,2,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [3,1,2,5,4] => 2
[4,2,1,1,1] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0,1,0] => [4,1,5,2,3,6] => 3
[3,3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [2,5,1,3,6,4] => 1
[3,3,2,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [4,1,2,3,5] => 1
[3,3,1,1,1] => [1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [3,1,5,2,6,4] => 4
[3,2,2,2] => [1,1,0,0,1,1,1,0,1,0,0,0] => [1,0,1,1,1,1,0,0,1,0,0,0] => [1,5,2,6,3,4] => 1
[3,2,2,1,1] => [1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,1,0,0,0] => [2,1,5,6,3,4] => 4
[2,2,2,2,1] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [4,1,2,5,6,3] => 2
[6,1,1,1,1] => [1,1,0,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,0,1,0,1,1,0,0,0,0] => [1,4,5,7,2,3,6] => 0
[5,4,1] => [1,1,1,0,1,0,0,0,1,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [3,6,1,2,4,5] => 0
[5,3,2] => [1,1,1,0,0,1,0,1,0,0,1,0] => [1,1,0,1,0,0,1,0,1,1,0,0] => [2,3,1,4,6,5] => 3
[5,3,1,1] => [1,1,0,1,1,0,0,1,0,0,1,0] => [1,0,1,1,0,1,0,0,1,1,0,0] => [1,3,4,2,6,5] => 2
[5,2,2,1] => [1,1,0,1,0,1,1,0,0,0,1,0] => [1,0,1,0,1,1,0,1,1,0,0,0] => [1,2,4,6,3,5] => 0
[5,2,1,1,1] => [1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [4,1,6,2,3,5] => 2
[4,4,2] => [1,1,1,0,0,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,0,1,0] => [2,3,1,5,4,6] => 4
[4,4,1,1] => [1,1,0,1,1,0,0,0,1,1,0,0] => [1,0,1,1,0,1,1,0,0,0,1,0] => [1,3,5,2,4,6] => 1
[4,3,3] => [1,1,1,0,0,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0,1,0] => [2,4,1,3,5,6] => 2
[4,3,2,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => [5,1,2,3,4] => 0
[4,3,1,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0,1,0] => [3,1,4,2,5,6] => 5
[4,2,2,2] => [1,1,0,0,1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0,1,0] => [1,4,2,5,3,6] => 3
[4,2,2,1,1] => [1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => [2,1,4,5,3,6] => 5
[3,3,3,1] => [1,1,0,1,0,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,1,0,0] => [1,2,5,3,6,4] => 1
[3,3,2,2] => [1,1,0,0,1,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,0,1,0,0] => [1,3,2,5,6,4] => 3
[3,3,2,1,1] => [1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => [2,1,3,5,6,4] => 4
[3,2,2,2,1] => [1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [5,1,2,6,3,4] => 1
[6,2,1,1,1] => [1,1,0,1,1,1,0,1,0,0,0,0,1,0] => [1,0,1,1,0,1,0,1,0,1,1,0,0,0] => [1,3,4,5,7,2,6] => 0
[5,4,2] => [1,1,1,0,0,1,0,0,1,0,1,0] => [1,1,0,1,0,0,1,1,1,0,0,0] => [2,3,1,6,4,5] => 3
[5,4,1,1] => [1,1,0,1,1,0,0,0,1,0,1,0] => [1,0,1,1,0,1,1,1,0,0,0,0] => [1,3,6,2,4,5] => 0
[5,3,3] => [1,1,1,0,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,0,1,1,0,0] => [2,4,1,3,6,5] => 2
[5,3,2,1] => [1,1,0,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => 0
[5,3,1,1,1] => [1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,1,0,0] => [3,1,4,2,6,5] => 5
[5,2,2,2] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,1,1,0,0,0] => [1,4,2,6,3,5] => 2
[5,2,2,1,1] => [1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => [2,1,4,6,3,5] => 4
[4,4,3] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => [2,5,1,3,4,6] => 1
[4,4,2,1] => [1,1,0,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => 1
[4,4,1,1,1] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0,1,0] => [3,1,5,2,4,6] => 4
[4,3,3,1] => [1,1,0,1,0,0,1,1,0,1,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => 2
[4,3,2,2] => [1,1,0,0,1,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => 3
[4,3,2,1,1] => [1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => [2,1,3,4,5,6] => 4
[4,2,2,2,1] => [1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => [4,1,2,5,3,6] => 3
[3,3,3,2] => [1,1,0,0,1,0,1,1,1,0,0,0] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,5,2,3,6,4] => 1
>>> Load all 205 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The number of occurrences of the pattern 21-3.
See Permutations/#Pattern-avoiding_permutations for the definition of the pattern $21\!\!-\!\!3$.
See Permutations/#Pattern-avoiding_permutations for the definition of the pattern $21\!\!-\!\!3$.
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
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
Map
Delest-Viennot-inverse
Description
Return the Dyck path obtained by applying the inverse of Delest-Viennot's bijection to the corresponding parallelogram polyomino.
Let $D$ be a Dyck path of semilength $n$. The parallelogram polyomino $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
The Delest-Viennot bijection $\beta$ returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path $(\beta^{(-1)}\circ\gamma)(D)$.
Let $D$ be a Dyck path of semilength $n$. The parallelogram polyomino $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
The Delest-Viennot bijection $\beta$ returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path $(\beta^{(-1)}\circ\gamma)(D)$.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!