Identifier
-
Mp00199:
Dyck paths
—prime Dyck path⟶
Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
St000624: Permutations ⟶ ℤ
Values
[1,0] => [1,1,0,0] => [1,2] => 0
[1,0,1,0] => [1,1,0,1,0,0] => [1,3,2] => 1
[1,1,0,0] => [1,1,1,0,0,0] => [1,2,3] => 0
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,3,2,4] => 1
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,3,4,2] => 1
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,4,2,3] => 1
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,2,4,3] => 1
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,2,3,4] => 0
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [1,3,2,5,4] => 2
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,3,5,2,4] => 2
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,3,2,4,5] => 1
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,3,4,2,5] => 1
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,3,4,5,2] => 1
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,4,2,5,3] => 2
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,4,5,2,3] => 2
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,4,2,3,5] => 1
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,2,4,3,5] => 1
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,2,4,5,3] => 1
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,5,2,3,4] => 1
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,2,5,3,4] => 2
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,2,3,5,4] => 1
[1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,3,2,5,4,6] => 2
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [1,3,5,2,4,6] => 2
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [1,3,2,5,6,4] => 2
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [1,3,5,2,6,4] => 2
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [1,3,5,6,2,4] => 2
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [1,3,2,6,4,5] => 3
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [1,3,6,2,4,5] => 2
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [1,3,2,4,6,5] => 2
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [1,3,4,2,6,5] => 2
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [1,3,4,6,2,5] => 2
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [1,3,2,4,5,6] => 1
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [1,3,4,2,5,6] => 1
[1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [1,3,4,5,2,6] => 1
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [1,3,4,5,6,2] => 1
[1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [1,4,2,5,3,6] => 2
[1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [1,4,5,2,3,6] => 2
[1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [1,4,2,5,6,3] => 2
[1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => [1,4,5,2,6,3] => 2
[1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [1,4,5,6,2,3] => 2
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,4,2,6,3,5] => 3
[1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => [1,4,6,2,3,5] => 2
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [1,4,2,3,6,5] => 2
[1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,2,4,3,6,5] => 2
[1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [1,2,4,6,3,5] => 2
[1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [1,4,2,3,5,6] => 1
[1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => [1,2,4,3,5,6] => 1
[1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => [1,2,4,5,3,6] => 1
[1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [1,2,4,5,6,3] => 1
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,5,2,6,3,4] => 3
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [1,5,6,2,3,4] => 2
[1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [1,5,2,3,6,4] => 2
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [1,2,5,3,6,4] => 2
[1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [1,2,5,6,3,4] => 2
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,5,2,3,4,6] => 1
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [1,2,5,3,4,6] => 2
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [1,2,3,5,4,6] => 1
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [1,2,3,5,6,4] => 1
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,6,2,3,4,5] => 1
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [1,2,6,3,4,5] => 2
[1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,2,3,6,4,5] => 2
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [1,2,3,4,6,5] => 1
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,2,3,4,5,6] => 0
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [1,3,2,5,4,7,6] => 3
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,1,0,0,0] => [1,3,5,2,4,7,6] => 3
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,1,0,0] => [1,3,2,5,7,4,6] => 3
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,0,1,1,0,1,0,0,0] => [1,3,5,2,7,4,6] => 3
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,1,1,1,0,0,0,0] => [1,3,5,7,2,4,6] => 3
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,1,0,0] => [1,3,2,5,4,6,7] => 2
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,1,1,0,0,0] => [1,3,5,2,4,6,7] => 2
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,0,1,1,0,1,0,0,1,0,0] => [1,3,2,5,6,4,7] => 2
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,1,0,0,0] => [1,3,5,2,6,4,7] => 2
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,0,1,1,0,1,1,0,0,0,0] => [1,3,5,6,2,4,7] => 2
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,1,0,0,0,1,0,0] => [1,3,2,5,6,7,4] => 2
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,0,1,1,1,0,0,1,0,0,0] => [1,3,5,2,6,7,4] => 2
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,1,0,1,0,0,0,0] => [1,3,5,6,2,7,4] => 2
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,1,1,1,0,0,0,0,0] => [1,3,5,6,7,2,4] => 2
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,1,0,0] => [1,3,2,6,4,7,5] => 3
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,1,1,0,0,1,0,1,1,0,0,0] => [1,3,6,2,4,7,5] => 3
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,1,0,0,1,0,0] => [1,3,2,6,7,4,5] => 3
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,1,1,0,1,0,0,0] => [1,3,6,2,7,4,5] => 3
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,1,1,0,0,1,1,1,0,0,0,0] => [1,3,6,7,2,4,5] => 3
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,1,0,0] => [1,3,2,6,4,5,7] => 3
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,1,0,1,0,0,1,1,0,0,0] => [1,3,6,2,4,5,7] => 2
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,1,0,0,1,0,0] => [1,3,2,4,6,5,7] => 2
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,1,0,0,0] => [1,3,4,2,6,5,7] => 2
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,1,1,0,0,0,0] => [1,3,4,6,2,5,7] => 2
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,1,0,1,1,0,0,0,1,0,0] => [1,3,2,4,6,7,5] => 2
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,1,1,0,0,1,0,0,0] => [1,3,4,2,6,7,5] => 2
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,1,1,0,1,1,0,1,0,0,0,0] => [1,3,4,6,2,7,5] => 2
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,1,1,0,1,1,1,0,0,0,0,0] => [1,3,4,6,7,2,5] => 2
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,1,0,0] => [1,3,2,7,4,5,6] => 4
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,1,0,0,0,1,1,0,0,0] => [1,3,7,2,4,5,6] => 2
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,1,1,0,0,1,0,0,1,0,0] => [1,3,2,4,7,5,6] => 3
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,1,0,0,0] => [1,3,4,2,7,5,6] => 3
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,1,0,0,1,1,0,0,0,0] => [1,3,4,7,2,5,6] => 3
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,1,1,0,1,0,0,0,1,0,0] => [1,3,2,4,5,7,6] => 2
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,1,0,1,0,0,1,0,0,0] => [1,3,4,2,5,7,6] => 2
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,1,0,0,0,0] => [1,3,4,5,2,7,6] => 2
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,1,0,1,1,0,0,0,0,0] => [1,3,4,5,7,2,6] => 2
>>> Load all 174 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 normalized sum of the minimal distances to a greater element.
Set $\pi_0 = \pi_{n+1} = n+1$, then this statistic is
$$ \sum_{i=1}^n \min_d(\pi_{i-1-d}>\pi_i\text{ or }\pi_{i+1+d}>\pi_i) $$
A closely related statistic appears in [1].
The generating function for the sequence of maximal values attained on $\mathfrak S_r$, $r\geq 0$ apparently satisfies the functional equation
$$ (x-1)^2 (x+1)^3 f(x^2) - (x-1)^2 (x+1) f(x) + x^3 = 0. $$
Set $\pi_0 = \pi_{n+1} = n+1$, then this statistic is
$$ \sum_{i=1}^n \min_d(\pi_{i-1-d}>\pi_i\text{ or }\pi_{i+1+d}>\pi_i) $$
A closely related statistic appears in [1].
The generating function for the sequence of maximal values attained on $\mathfrak S_r$, $r\geq 0$ apparently satisfies the functional equation
$$ (x-1)^2 (x+1)^3 f(x^2) - (x-1)^2 (x+1) f(x) + x^3 = 0. $$
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.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
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!