Identifier
-
Mp00043:
Integer partitions
—to Dyck path⟶
Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
St000654: Permutations ⟶ ℤ
Values
[1] => [1,0,1,0] => [1,1,0,1,0,0] => [1,3,2] => 2
[2] => [1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,4,2,3] => 2
[1,1] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,3,4,2] => 3
[3] => [1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,5,2,3,4] => 2
[2,1] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,3,2,4] => 2
[1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,3,4,5,2] => 4
[4] => [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] => 2
[3,1] => [1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,4,2,3,5] => 2
[2,2] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,4,5,2,3] => 3
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,3,4,2,5] => 3
[1,1,1,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] => 5
[4,1] => [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] => 2
[3,2] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,4,2,5,3] => 2
[3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,3,2,4,5] => 2
[2,2,1] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,3,5,2,4] => 3
[2,1,1,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] => 4
[1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,1,1,1,1,1,0,0,0,0,0,0] => [1,3,4,5,6,7,2] => 6
[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
[4,1,1] => [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] => 2
[3,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] => 3
[3,2,1] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [1,3,2,5,4] => 2
[3,1,1,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] => 3
[2,2,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] => 4
[2,2,1,1] => [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] => 4
[2,1,1,1,1] => [1,0,1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,1,1,1,0,1,0,0,0,0,0] => [1,3,4,5,6,2,7] => 5
[4,3] => [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] => 2
[4,2,1] => [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
[4,1,1,1] => [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] => 2
[3,3,1] => [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] => 3
[3,2,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] => 3
[3,2,1,1] => [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] => 3
[3,1,1,1,1] => [1,0,1,1,1,1,0,0,1,0,0,0] => [1,1,0,1,1,1,1,0,0,1,0,0,0,0] => [1,3,4,5,2,6,7] => 4
[2,2,2,1] => [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] => 4
[2,2,1,1,1] => [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] => 5
[5,1,1,1] => [1,1,0,1,1,1,0,0,0,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,1,0,0] => [1,4,2,3,5,6,7] => 2
[4,3,1] => [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] => 2
[4,2,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
[4,2,1,1] => [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
[4,1,1,1,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,1,1,1,0,0,0,1,0,0,0] => [1,3,4,2,5,6,7] => 3
[3,3,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] => 3
[3,3,1,1] => [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] => 3
[3,2,2,1] => [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] => 3
[3,2,1,1,1] => [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] => 4
[2,2,2,2] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,1,1,1,0,0,0,0,0] => [1,4,5,6,7,2,3] => 5
[2,2,2,1,1] => [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] => 5
[5,2,1,1] => [1,1,0,1,1,0,1,0,0,0,1,0] => [1,1,1,0,1,1,0,1,0,0,0,1,0,0] => [1,4,2,3,5,7,6] => 2
[5,1,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,1,1,1,0,0,0,0,1,0,0] => [1,3,2,4,5,6,7] => 2
[4,3,2] => [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
[4,3,1,1] => [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] => 2
[4,2,2,1] => [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
[4,2,1,1,1] => [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] => 3
[3,3,2,1] => [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] => 3
[3,3,1,1,1] => [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] => 4
[3,2,2,2] => [1,1,0,0,1,1,1,0,1,0,0,0] => [1,1,1,0,0,1,1,1,0,1,0,0,0,0] => [1,4,5,6,2,7,3] => 4
[3,2,2,1,1] => [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] => 4
[2,2,2,2,1] => [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] => 5
[5,3,1,1] => [1,1,0,1,1,0,0,1,0,0,1,0] => [1,1,1,0,1,1,0,0,1,0,0,1,0,0] => [1,4,2,3,7,5,6] => 2
[5,2,2,1] => [1,1,0,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,0,1,1,0,0,0,1,0,0] => [1,4,2,3,6,7,5] => 2
[5,2,1,1,1] => [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
[4,3,2,1] => [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
[4,3,1,1,1] => [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
[4,2,2,2] => [1,1,0,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,1,1,0,0,1,0,0,0] => [1,4,5,2,6,7,3] => 3
[4,2,2,1,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,3,4,2,6,7,5] => 3
[3,3,2,2] => [1,1,0,0,1,1,0,1,1,0,0,0] => [1,1,1,0,0,1,1,0,1,1,0,0,0,0] => [1,4,5,6,2,3,7] => 4
[3,3,2,1,1] => [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] => 4
[3,2,2,2,1] => [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] => 4
[5,4,1,1] => [1,1,0,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,1,0,0] => [1,4,2,7,3,5,6] => 2
[5,3,2,1] => [1,1,0,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,1,0,0,1,0,0] => [1,4,2,3,6,5,7] => 2
[5,3,1,1,1] => [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] => 2
[5,2,2,2] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,1,0,0] => [1,4,2,5,6,7,3] => 2
[5,2,2,1,1] => [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
[4,4,2,1] => [1,1,0,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,1,0,0,1,1,0,0,0] => [1,4,6,2,3,5,7] => 3
[4,4,1,1,1] => [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] => 3
[4,3,3,1] => [1,1,0,1,0,0,1,1,0,1,0,0] => [1,1,1,0,1,0,0,1,1,0,1,0,0,0] => [1,4,6,2,7,3,5] => 3
[4,3,2,2] => [1,1,0,0,1,1,0,1,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,1,0,0,0] => [1,4,5,2,6,3,7] => 3
[4,3,2,1,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,3,4,2,6,5,7] => 3
[4,2,2,2,1] => [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] => 3
[3,3,3,2] => [1,1,0,0,1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,1,1,1,0,0,0,0] => [1,4,5,7,2,3,6] => 4
[3,3,3,1,1] => [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] => 4
[3,3,2,2,1] => [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] => 4
[5,4,2,1] => [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,4,2,6,3,5,7] => 2
[5,4,1,1,1] => [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] => 2
[5,3,3,1] => [1,1,0,1,0,0,1,1,0,0,1,0] => [1,1,1,0,1,0,0,1,1,0,0,1,0,0] => [1,4,2,6,7,3,5] => 2
[5,3,2,2] => [1,1,0,0,1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,1,0,1,0,0,1,0,0] => [1,4,2,5,6,3,7] => 2
[5,3,2,1,1] => [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
[5,2,2,2,1] => [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
[4,4,3,1] => [1,1,0,1,0,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,1,0,1,1,0,0,0] => [1,4,6,2,3,7,5] => 3
[4,4,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,1,1,0,0,0] => [1,4,5,2,3,6,7] => 3
[4,4,2,1,1] => [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] => 3
[4,3,3,2] => [1,1,0,0,1,0,1,1,0,1,0,0] => [1,1,1,0,0,1,0,1,1,0,1,0,0,0] => [1,4,5,2,7,3,6] => 3
[4,3,3,1,1] => [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
[4,3,2,2,1] => [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] => 3
[3,3,3,2,1] => [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] => 4
[5,4,3,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,4,2,6,3,7,5] => 2
[5,4,2,2] => [1,1,0,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,1,0,0] => [1,4,2,5,3,6,7] => 2
[5,4,2,1,1] => [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] => 2
[5,3,3,2] => [1,1,0,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,1,1,0,0,1,0,0] => [1,4,2,5,7,3,6] => 2
[5,3,3,1,1] => [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] => 2
[5,3,2,2,1] => [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
[4,4,3,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,0,1,1,0,0,0] => [1,4,5,2,3,7,6] => 3
[4,4,3,1,1] => [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
>>> Load all 109 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 first descent of a permutation.
For a permutation $\pi$ of $\{1,\ldots,n\}$, this is the smallest index $0 < i \leq n$ such that $\pi(i) > \pi(i+1)$ where one considers $\pi(n+1)=0$.
For a permutation $\pi$ of $\{1,\ldots,n\}$, this is the smallest index $0 < i \leq n$ such that $\pi(i) > \pi(i+1)$ where one considers $\pi(n+1)=0$.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
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
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
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!