Identifier
-
Mp00229:
Dyck paths
—Delest-Viennot⟶
Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St001082: Permutations ⟶ ℤ
Values
[1,0,1,0] => [1,1,0,0] => [1,2] => 0
[1,1,0,0] => [1,0,1,0] => [2,1] => 0
[1,0,1,0,1,0] => [1,1,0,1,0,0] => [2,1,3] => 0
[1,0,1,1,0,0] => [1,1,0,0,1,0] => [3,1,2] => 0
[1,1,0,0,1,0] => [1,0,1,1,0,0] => [2,3,1] => 0
[1,1,0,1,0,0] => [1,1,1,0,0,0] => [1,2,3] => 1
[1,1,1,0,0,0] => [1,0,1,0,1,0] => [3,2,1] => 0
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [3,2,1,4] => 0
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => [4,2,1,3] => 0
[1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [3,4,1,2] => 0
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0] => [2,3,1,4] => 1
[1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => [4,3,1,2] => 0
[1,1,0,0,1,0,1,0] => [1,0,1,1,0,1,0,0] => [3,2,4,1] => 0
[1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [4,2,3,1] => 0
[1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [3,1,2,4] => 1
[1,1,0,1,0,1,0,0] => [1,1,1,1,0,0,0,0] => [1,2,3,4] => 2
[1,1,0,1,1,0,0,0] => [1,1,1,0,0,0,1,0] => [4,1,2,3] => 1
[1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,0,0] => [3,4,2,1] => 0
[1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0] => [2,3,4,1] => 1
[1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0] => [2,1,3,4] => 2
[1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => [4,3,2,1] => 0
[1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [4,3,2,1,5] => 0
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [5,3,2,1,4] => 0
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => [4,5,2,1,3] => 0
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [3,4,2,1,5] => 1
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => [5,4,2,1,3] => 0
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,0] => [4,3,5,1,2] => 0
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [5,3,4,1,2] => 0
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [4,2,3,1,5] => 1
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0] => [2,3,4,1,5] => 2
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,0,0,1,0] => [5,2,3,1,4] => 1
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => [4,5,3,1,2] => 0
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => [3,4,5,1,2] => 1
[1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => [3,2,4,1,5] => 2
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => [5,4,3,1,2] => 0
[1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,1,0,1,0,0] => [4,3,2,5,1] => 0
[1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => [5,3,2,4,1] => 0
[1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [4,5,2,3,1] => 0
[1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,1,1,0,0,0] => [3,4,2,5,1] => 1
[1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => [5,4,2,3,1] => 0
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [4,3,1,2,5] => 1
[1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => [5,3,1,2,4] => 1
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [4,1,2,3,5] => 2
[1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => [2,1,3,4,5] => 3
[1,1,0,1,0,1,1,0,0,0] => [1,1,1,1,0,0,0,0,1,0] => [5,1,2,3,4] => 2
[1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [4,5,1,2,3] => 1
[1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [3,4,1,2,5] => 2
[1,1,0,1,1,0,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [3,1,2,4,5] => 3
[1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => [5,4,1,2,3] => 1
[1,1,1,0,0,0,1,0,1,0] => [1,0,1,0,1,1,0,1,0,0] => [4,3,5,2,1] => 0
[1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => [5,3,4,2,1] => 0
[1,1,1,0,0,1,0,0,1,0] => [1,0,1,1,1,0,0,1,0,0] => [4,2,3,5,1] => 1
[1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 2
[1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => [5,2,3,4,1] => 1
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [4,2,1,3,5] => 2
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,0,0] => [2,3,1,4,5] => 3
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 3
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,0,0,0,1,0] => [5,2,1,3,4] => 2
[1,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => [4,5,3,2,1] => 0
[1,1,1,1,0,0,0,1,0,0] => [1,0,1,0,1,1,1,0,0,0] => [3,4,5,2,1] => 1
[1,1,1,1,0,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => [3,2,4,5,1] => 2
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [3,2,1,4,5] => 3
[1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => [5,4,3,2,1] => 0
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [5,4,3,2,1,6] => 0
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => [6,4,3,2,1,5] => 0
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => [5,6,3,2,1,4] => 0
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [4,5,3,2,1,6] => 1
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => [6,5,3,2,1,4] => 0
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,0,1,1,0,1,0,0] => [5,4,6,2,1,3] => 0
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,0,1,0] => [6,4,5,2,1,3] => 0
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [5,3,4,2,1,6] => 1
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [3,4,5,2,1,6] => 2
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,0,1,1,0,0,0,1,0] => [6,3,4,2,1,5] => 1
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,0,1,0,1,1,0,0] => [5,6,4,2,1,3] => 0
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,1,1,0,0,0] => [4,5,6,2,1,3] => 1
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [4,3,5,2,1,6] => 2
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => [6,5,4,2,1,3] => 0
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => [5,4,3,6,1,2] => 0
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => [6,4,3,5,1,2] => 0
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => [5,6,3,4,1,2] => 0
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => [4,5,3,6,1,2] => 1
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [6,5,3,4,1,2] => 0
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [5,4,2,3,1,6] => 1
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,0,0,1,0] => [6,4,2,3,1,5] => 1
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [5,2,3,4,1,6] => 2
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [3,2,4,5,1,6] => 3
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => [6,2,3,4,1,5] => 2
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0,1,1,0,0] => [5,6,2,3,1,4] => 1
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [4,5,2,3,1,6] => 2
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [4,2,3,5,1,6] => 3
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,1,1,0,0,0,1,0,1,0] => [6,5,2,3,1,4] => 1
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => [5,4,6,3,1,2] => 0
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => [6,4,5,3,1,2] => 0
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => [5,3,4,6,1,2] => 1
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => [3,4,5,6,1,2] => 2
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => [6,3,4,5,1,2] => 1
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [5,3,2,4,1,6] => 2
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [3,4,2,5,1,6] => 3
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [2,3,4,5,1,6] => 3
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,0,1,0,0,0,1,0] => [6,3,2,4,1,5] => 2
[1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => [5,6,4,3,1,2] => 0
>>> 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 boxed occurrences of 123 in a permutation.
This is the number of occurrences of the pattern $123$ such that any entry between the three matched entries is either larger than the largest matched entry or smaller than the smallest matched entry.
This is the number of occurrences of the pattern $123$ such that any entry between the three matched entries is either larger than the largest matched entry or smaller than the smallest matched entry.
Map
to 132-avoiding permutation
Description
Sends a Dyck path to a 132-avoiding permutation.
This bijection is defined in [1, Section 2].
This bijection is defined in [1, Section 2].
Map
Delest-Viennot
Description
Return the Dyck path corresponding to the parallelogram polyomino obtained by applying Delest-Viennot's bijection.
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 $(\gamma^{(-1)}\circ\beta)(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 $(\gamma^{(-1)}\circ\beta)(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!