Identifier
-
Mp00228:
Dyck paths
—reflect parallelogram polyomino⟶
Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000240: Permutations ⟶ ℤ
Values
[1,0] => [1,0] => [1] => 1
[1,0,1,0] => [1,1,0,0] => [2,1] => 1
[1,1,0,0] => [1,0,1,0] => [1,2] => 2
[1,0,1,0,1,0] => [1,1,0,1,0,0] => [2,3,1] => 1
[1,0,1,1,0,0] => [1,1,0,0,1,0] => [2,1,3] => 2
[1,1,0,0,1,0] => [1,0,1,1,0,0] => [1,3,2] => 2
[1,1,0,1,0,0] => [1,0,1,0,1,0] => [1,2,3] => 3
[1,1,1,0,0,0] => [1,1,1,0,0,0] => [3,2,1] => 3
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [2,3,4,1] => 1
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => [2,3,1,4] => 2
[1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => 2
[1,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => 3
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,0,0,0] => [2,4,3,1] => 3
[1,1,0,0,1,0,1,0] => [1,0,1,1,0,1,0,0] => [1,3,4,2] => 2
[1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => 3
[1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => 3
[1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => 4
[1,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,4,3,2] => 4
[1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,0,0] => [3,2,4,1] => 3
[1,1,1,0,0,1,0,0] => [1,1,1,0,0,0,1,0] => [3,2,1,4] => 4
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,0,0,0] => [4,3,2,1] => 3
[1,1,1,1,0,0,0,0] => [1,1,1,0,1,0,0,0] => [4,2,3,1] => 4
[1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => 1
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => 2
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => 2
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => 3
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,0,0,0] => [2,3,5,4,1] => 3
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => 2
[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] => 3
[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
[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] => 4
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => 4
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [2,4,3,5,1] => 3
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [2,4,3,1,5] => 4
[1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [2,5,4,3,1] => 3
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => [2,5,3,4,1] => 4
[1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => 2
[1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => 3
[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] => 3
[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] => 4
[1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,1,1,0,0,0] => [1,3,5,4,2] => 4
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => 3
[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] => 4
[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] => 4
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => 5
[1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => 5
[1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,1,0,0] => [1,4,3,5,2] => 4
[1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => 5
[1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => 4
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => [1,5,3,4,2] => 5
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [3,2,4,5,1] => 3
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => [3,2,4,1,5] => 4
[1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => 4
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => 5
[1,1,1,0,0,1,1,0,0,0] => [1,1,1,0,0,1,1,0,0,0] => [3,2,5,4,1] => 5
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [4,3,2,5,1] => 3
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => 4
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [5,3,4,2,1] => 3
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [5,3,2,4,1] => 4
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [4,2,3,5,1] => 4
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => [4,2,3,1,5] => 5
[1,1,1,1,0,0,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [5,2,4,3,1] => 4
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [5,2,3,4,1] => 5
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => 5
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [2,3,4,5,6,1] => 1
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => [2,3,4,5,1,6] => 2
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => [2,3,4,1,6,5] => 2
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => [2,3,4,1,5,6] => 3
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [2,3,4,6,5,1] => 3
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,0,1,1,0,1,0,0] => [2,3,1,5,6,4] => 2
[1,0,1,0,1,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] => 3
[1,0,1,0,1,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
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => [2,3,1,4,5,6] => 4
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,0,0,1,1,1,0,0,0] => [2,3,1,6,5,4] => 4
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [2,3,5,4,6,1] => 3
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,0,1,1,0,0,0,1,0] => [2,3,5,4,1,6] => 4
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [2,3,6,5,4,1] => 3
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [2,3,6,4,5,1] => 4
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => [2,1,4,5,6,3] => 2
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => [2,1,4,5,3,6] => 3
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => [2,1,4,3,6,5] => 3
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [2,1,4,3,5,6] => 4
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => [2,1,4,6,5,3] => 4
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => [2,1,3,5,6,4] => 3
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => [2,1,3,5,4,6] => 4
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => [2,1,3,4,6,5] => 4
[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] => 5
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => [2,1,3,6,5,4] => 5
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => [2,1,5,4,6,3] => 4
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => [2,1,5,4,3,6] => 5
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => [2,1,6,5,4,3] => 4
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,0,1,1,1,0,1,0,0,0] => [2,1,6,4,5,3] => 5
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [2,4,3,5,6,1] => 3
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,0,0,1,0] => [2,4,3,5,1,6] => 4
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,1,0,0,0,1,1,0,0] => [2,4,3,1,6,5] => 4
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0,1,0] => [2,4,3,1,5,6] => 5
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [2,4,3,6,5,1] => 5
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [2,5,4,3,6,1] => 3
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => [2,5,4,3,1,6] => 4
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [2,6,4,5,3,1] => 3
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [2,6,4,3,5,1] => 4
>>> Load all 196 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 indices that are not small excedances.
A small excedance is an index $i$ for which $\pi_i = i+1$.
A small excedance is an index $i$ for which $\pi_i = i+1$.
Map
to non-crossing permutation
Description
Sends a Dyck path $D$ with valley at positions $\{(i_1,j_1),\ldots,(i_k,j_k)\}$ to the unique non-crossing permutation $\pi$ having descents $\{i_1,\ldots,i_k\}$ and whose inverse has descents $\{j_1,\ldots,j_k\}$.
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to $n(n-1)$ minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to $n(n-1)$ minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
Map
reflect parallelogram polyomino
Description
Reflect the corresponding parallelogram polyomino, such that the first column becomes the first row.
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.
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.
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!