Identifier
-
Mp00231:
Integer compositions
—bounce path⟶
Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
St000034: Permutations ⟶ ℤ
Values
[1] => [1,0] => [1,0] => [1] => 0
[1,1] => [1,0,1,0] => [1,1,0,0] => [1,2] => 0
[2] => [1,1,0,0] => [1,0,1,0] => [2,1] => 0
[1,1,1] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => [1,2,3] => 0
[1,2] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => [3,1,2] => 0
[2,1] => [1,1,0,0,1,0] => [1,0,1,1,0,0] => [2,3,1] => 0
[3] => [1,1,1,0,0,0] => [1,1,0,1,0,0] => [1,3,2] => 0
[1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [1,2,3,4] => 0
[1,1,2] => [1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [4,1,2,3] => 0
[1,2,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [3,4,1,2] => 1
[1,3] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [1,4,2,3] => 0
[2,1,1] => [1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => [2,3,4,1] => 0
[2,2] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [2,1,3,4] => 0
[3,1] => [1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0] => [1,3,4,2] => 0
[4] => [1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,0] => [1,3,2,4] => 0
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 0
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [5,1,2,3,4] => 0
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [4,5,1,2,3] => 1
[1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [1,5,2,3,4] => 0
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => [3,4,5,1,2] => 1
[1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [3,1,4,5,2] => 0
[1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => [1,4,5,2,3] => 1
[1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => [1,4,2,5,3] => 0
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 0
[2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [2,1,3,4,5] => 0
[2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [2,5,1,3,4] => 0
[2,3] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0] => [2,3,1,4,5] => 0
[3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => [1,3,4,5,2] => 0
[3,2] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [3,1,2,4,5] => 0
[4,1] => [1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => [1,3,5,2,4] => 0
[5] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,2,4,3,5] => 0
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,2,3,4,5,6] => 0
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => [6,1,2,3,4,5] => 0
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [5,6,1,2,3,4] => 2
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,6,2,3,4,5] => 0
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => [4,5,6,1,2,3] => 3
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => [4,1,5,6,2,3] => 1
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [1,5,6,2,3,4] => 1
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,5,2,6,3,4] => 1
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => [3,4,5,6,1,2] => 2
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => [3,1,4,5,6,2] => 0
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => [3,4,1,2,5,6] => 1
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => [3,4,1,5,6,2] => 1
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [1,4,5,6,2,3] => 1
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0,1,0] => [4,1,2,5,6,3] => 0
[1,4,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] => [1,4,5,2,3,6] => 1
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [1,2,5,3,6,4] => 0
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => [2,3,4,5,6,1] => 0
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => [2,1,3,4,5,6] => 0
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [2,6,1,3,4,5] => 0
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [1,0,1,1,1,1,0,0,0,1,0,0] => [2,3,1,4,5,6] => 0
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [2,5,6,1,3,4] => 1
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => [2,1,5,6,3,4] => 1
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,1,1,0,0,0] => [2,3,6,1,4,5] => 0
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,0,1,1,1,0,0,1,0,1,0,0] => [2,3,1,6,4,5] => 0
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [1,3,4,5,6,2] => 0
[3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => [3,1,2,4,5,6] => 0
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,0,1,1,0,0] => [3,6,1,2,4,5] => 1
[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] => [1,3,2,4,5,6] => 0
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [1,3,5,6,2,4] => 1
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0,1,0] => [3,1,2,5,6,4] => 0
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [1,2,4,6,3,5] => 0
[6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,2,4,3,6,5] => 0
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 maximum defect over any reduced expression for a permutation and any subexpression.
Map
bounce path
Description
The bounce path determined by an integer composition.
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)$.
Map
to 321-avoiding permutation
Description
Sends a Dyck path to a 321-avoiding permutation.
This bijection defined in [3, pp. 60] and in [2, Section 3.1].
It is shown in [1] that it sends the number of centered tunnels to the number of fixed points, the number of right tunnels to the number of exceedences, and the semilength plus the height of the middle point to 2 times the length of the longest increasing subsequence.
This bijection defined in [3, pp. 60] and in [2, Section 3.1].
It is shown in [1] that it sends the number of centered tunnels to the number of fixed points, the number of right tunnels to the number of exceedences, and the semilength plus the height of the middle point to 2 times the length of the longest increasing subsequence.
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!