Identifier
-
Mp00199:
Dyck paths
—prime Dyck path⟶
Dyck paths
Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St000352: Permutations ⟶ ℤ
Values
[1,0] => [1,1,0,0] => [1,0,1,0] => [3,1,2] => 1
[1,0,1,0] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => [4,1,2,3] => 1
[1,1,0,0] => [1,1,1,0,0,0] => [1,1,0,0,1,0] => [2,4,1,3] => 1
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 1
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => 1
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,1,0,0,1,0,1,0] => [2,5,1,3,4] => 1
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,1,0,1,0,0,1,0] => [5,3,1,2,4] => 2
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 1
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => [6,1,2,3,4,5] => 1
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => [4,1,2,6,3,5] => 1
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => [3,1,6,2,4,5] => 1
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => [6,1,4,2,3,5] => 1
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => [3,1,4,6,2,5] => 1
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => [2,6,1,3,4,5] => 1
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0] => [2,4,1,6,3,5] => 1
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => [6,3,1,2,4,5] => 2
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0] => [6,4,1,2,3,5] => 2
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,0,0,0,1,0] => [4,3,1,6,2,5] => 2
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => [2,3,6,1,4,5] => 1
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,1,1,0,0,1,0,0,1,0] => [2,6,4,1,3,5] => 1
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,1,0,0,0,1,0] => [6,3,4,1,2,5] => 2
[1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,0,0,0,1,0] => [2,3,4,6,1,5] => 1
[1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => [7,1,2,3,4,5,6] => 1
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [5,1,2,3,7,4,6] => 1
[1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => [2,7,1,3,4,5,6] => 1
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => [7,3,1,2,4,5,6] => 2
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => [7,4,1,2,3,5,6] => 2
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0,1,0] => [7,3,4,1,2,5,6] => 2
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => [2,3,4,7,1,5,6] => 1
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => [2,3,4,5,7,1,6] => 1
[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,0,1,0,1,0,1,0,1,0,1,0,1,0] => [8,1,2,3,4,5,6,7] => 1
[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,0,1,1,0,1,0,1,0,1,0,0,1,0] => [6,1,8,2,3,4,5,7] => 1
[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,0,1,1,0,1,1,0,0,1,0,0,1,0] => [8,1,4,2,6,3,5,7] => 1
[1,1,0,0,1,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [2,8,1,3,4,5,6,7] => 1
[1,1,0,1,0,0,1,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0,1,0] => [8,3,1,2,4,5,6,7] => 2
[1,1,0,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0,1,0] => [8,4,1,2,3,5,6,7] => 2
[1,1,0,1,1,1,0,0,1,0,0,0] => [1,1,1,0,1,1,1,0,0,1,0,0,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0,1,0] => [8,3,1,5,6,2,4,7] => 2
[1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => [2,3,4,5,6,8,1,7] => 1
[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,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [9,1,2,3,4,5,6,7,8] => 1
[1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0] => [2,9,1,3,4,5,6,7,8] => 1
[1,1,0,1,0,0,1,0,1,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0,1,0,1,0] => [9,3,1,2,4,5,6,7,8] => 2
[1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0] => [2,3,4,5,6,7,9,1,8] => 1
[1,0,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,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [10,1,2,3,4,5,6,7,8,9] => 1
[1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [2,10,1,3,4,5,6,7,8,9] => 1
[] => [1,0] => [1,0] => [2,1] => 1
[1,0,1,0,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,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [11,1,2,3,4,5,6,7,8,9,10] => 1
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 Elizalde-Pak rank of a permutation.
This is the largest $k$ such that $\pi(i) > k$ for all $i\leq k$.
According to [1], the length of the longest increasing subsequence in a $321$-avoiding permutation is equidistributed with the rank of a $132$-avoiding permutation.
This is the largest $k$ such that $\pi(i) > k$ for all $i\leq k$.
According to [1], the length of the longest increasing subsequence in a $321$-avoiding permutation is equidistributed with the rank of a $132$-avoiding permutation.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.
Map
inverse promotion
Description
The inverse promotion of a Dyck path.
This is the bijection obtained by applying the inverse of Schützenberger's promotion to the corresponding two rowed standard Young tableau.
This is the bijection obtained by applying the inverse of Schützenberger's promotion to the corresponding two rowed standard Young tableau.
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!