Identifier
-
Mp00230:
Integer partitions
—parallelogram polyomino⟶
Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
St001465: Permutations ⟶ ℤ
Values
[1] => [1,0] => [1,0] => [1] => 0
[2] => [1,0,1,0] => [1,1,0,0] => [1,2] => 0
[1,1] => [1,1,0,0] => [1,0,1,0] => [2,1] => 1
[3] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => [1,2,3] => 0
[2,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => [1,3,2] => 1
[1,1,1] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => [2,3,1] => 0
[4] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [1,2,3,4] => 0
[3,1] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => [1,2,4,3] => 1
[2,2] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => [2,1,3] => 1
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0] => [1,3,4,2] => 0
[1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0] => [2,3,4,1] => 0
[5] => [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
[4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,2,3,5,4] => 1
[3,2] => [1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0] => [1,3,2,4] => 1
[3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,2,4,5,3] => 0
[2,2,1] => [1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,0] => [2,1,3,4] => 1
[2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,3,4,5,2] => 0
[1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 0
[6] => [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
[5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [1,2,3,4,6,5] => 1
[4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,2,4,3,5] => 1
[4,1,1] => [1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [1,2,3,5,6,4] => 0
[3,3] => [1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,0,0] => [2,4,1,3] => 0
[3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0] => [1,3,2,4,5] => 1
[3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [1,2,4,5,6,3] => 0
[2,2,2] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => [2,1,4,3] => 2
[2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [2,1,3,4,5] => 1
[2,1,1,1,1] => [1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [1,3,4,5,6,2] => 0
[1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => [2,3,4,5,6,1] => 0
[7] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,2,3,4,5,6,7] => 0
[6,1] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => [1,2,3,4,5,7,6] => 1
[5,2] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [1,2,3,5,4,6] => 1
[5,1,1] => [1,0,1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,1,0,1,1,0,0,0,0,0,0] => [1,2,3,4,6,7,5] => 0
[4,3] => [1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,3,5,2,4] => 0
[4,2,1] => [1,0,1,0,1,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
[4,1,1,1] => [1,0,1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,1,0,1,1,1,0,0,0,0,0,0] => [1,2,3,5,6,7,4] => 0
[3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [2,5,1,3,4] => 0
[3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => [1,3,2,5,4] => 2
[3,2,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [1,3,2,4,5,6] => 1
[3,1,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,1,1,1,0,0,0,0,0,0] => [1,2,4,5,6,7,3] => 0
[2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => [2,1,5,3,4] => 1
[2,2,1,1,1] => [1,1,1,0,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => [2,1,3,4,5,6] => 1
[2,1,1,1,1,1] => [1,0,1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,0,1,1,1,1,1,0,0,0,0,0,0] => [1,3,4,5,6,7,2] => 0
[1,1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [2,3,4,5,6,7,1] => 0
[8] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [1,2,3,4,5,6,7,8] => 0
[7,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0] => [1,2,3,4,5,6,8,7] => 1
[6,2] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,1,0,1,0,1,0,0,0,0,0] => [1,2,3,4,6,5,7] => 1
[5,3] => [1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [1,2,4,6,3,5] => 0
[5,2,1] => [1,0,1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,1,1,0,1,1,0,0,1,0,0,0,0] => [1,2,3,5,4,6,7] => 1
[4,4] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [2,4,5,1,3] => 0
[4,3,1] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [1,3,6,2,4,5] => 0
[4,2,2] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,2,4,3,6,5] => 2
[4,2,1,1] => [1,0,1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,1,1,1,0,0,0,1,0,0,0] => [1,2,4,3,5,6,7] => 1
[4,1,1,1,1] => [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,0,1,1,1,1,0,0,0,0,0,0,0] => [1,2,3,5,6,7,8,4] => 0
[3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => [2,4,1,5,3] => 0
[3,3,1,1] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [2,6,1,3,4,5] => 0
[3,2,2,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [1,3,2,6,4,5] => 1
[3,2,1,1,1] => [1,0,1,1,1,0,0,1,0,1,0,1,0,0] => [1,1,0,1,1,1,1,0,0,0,0,1,0,0] => [1,3,2,4,5,6,7] => 1
[2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0] => [2,4,1,3,5] => 0
[2,2,2,1,1] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => [2,1,6,3,4,5] => 1
[2,2,1,1,1,1] => [1,1,1,0,0,1,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => [2,1,3,4,5,6,7] => 1
[1,1,1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,1] => 0
[9] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0] => [1,2,3,4,5,6,7,8,9] => 0
[8,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0] => [1,2,3,4,5,6,7,9,8] => 1
[7,2] => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0] => [1,2,3,4,5,7,6,8] => 1
[6,3] => [1,0,1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,1,0,0,0,0,0] => [1,2,3,5,7,4,6] => 0
[5,4] => [1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [1,3,5,6,2,4] => 0
[5,3,1] => [1,0,1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,1,0,0,0,0] => [1,2,4,7,3,5,6] => 0
[5,2,2] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,1,0,1,0,1,0,0,0,0] => [1,2,3,5,4,7,6] => 2
[5,2,1,1] => [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,1,1,1,0,0,0,1,0,0,0,0] => [1,2,3,5,4,6,7,8] => 1
[4,4,1] => [1,1,1,0,1,0,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [2,5,6,1,3,4] => 0
[4,3,2] => [1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [1,3,5,2,6,4] => 0
[4,3,1,1] => [1,0,1,1,1,0,1,0,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,1,1,0,0,0] => [1,3,7,2,4,5,6] => 0
[4,2,2,1] => [1,0,1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,1,0,0,0] => [1,2,4,3,7,5,6] => 1
[3,3,3] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => [2,1,4,3,5] => 2
[3,3,2,1] => [1,1,1,0,1,1,0,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,1,0,0] => [2,5,1,6,3,4] => 0
[3,3,1,1,1] => [1,1,1,0,1,0,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => [2,7,1,3,4,5,6] => 0
[3,2,2,2] => [1,0,1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [1,3,5,2,4,6] => 0
[3,2,2,1,1] => [1,0,1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,1,0,1,0,0] => [1,3,2,7,4,5,6] => 1
[3,2,1,1,1,1] => [1,0,1,1,1,0,0,1,0,1,0,1,0,1,0,0] => [1,1,0,1,1,1,1,1,0,0,0,0,0,1,0,0] => [1,3,2,4,5,6,7,8] => 1
[2,2,2,2,1] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => [2,5,1,3,6,4] => 0
[2,2,2,1,1,1] => [1,1,1,1,0,0,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => [2,1,7,3,4,5,6] => 1
[2,2,1,1,1,1,1] => [1,1,1,0,0,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0,1,0] => [2,1,3,4,5,6,7,8] => 1
[1,1,1,1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 0
[10] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [1,2,3,4,5,6,7,8,9,10] => 0
[9,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0,0] => [1,2,3,4,5,6,7,8,10,9] => 1
[6,4] => [1,0,1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,1,0,1,0,1,1,1,0,0,0,0,0] => [1,2,4,6,7,3,5] => 0
[5,5] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => [2,4,5,6,1,3] => 0
[5,4,1] => [1,0,1,1,1,0,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,1,1,0,0,0,0] => [1,3,6,7,2,4,5] => 0
[5,3,2] => [1,0,1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,0,1,1,0,1,0,0,0,0] => [1,2,4,6,3,7,5] => 0
[5,2,2,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,0,1,1,0,0,1,0,1,0,0,0,0] => [1,2,3,5,4,8,6,7] => 1
[4,4,2] => [1,1,1,0,1,0,1,1,0,0,0,0] => [1,0,1,0,1,1,1,0,1,0,0,0] => [2,4,5,1,6,3] => 0
[4,4,1,1] => [1,1,1,0,1,0,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => [2,6,7,1,3,4,5] => 0
[4,3,3] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,3,2,5,4,6] => 2
[4,3,2,1] => [1,0,1,1,1,0,1,1,0,0,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] => 0
[4,2,2,2] => [1,0,1,0,1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,1,0,1,0,1,1,0,0,0,0] => [1,2,4,6,3,5,7] => 0
[3,3,3,1] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [2,1,5,3,6,4] => 1
[3,3,2,2] => [1,1,1,0,1,1,0,1,0,0,0,0] => [1,0,1,0,1,1,0,1,1,0,0,0] => [2,4,5,1,3,6] => 0
[3,3,2,1,1] => [1,1,1,0,1,1,0,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,1,0,0] => [2,6,1,7,3,4,5] => 0
[3,3,1,1,1,1] => [1,1,1,0,1,0,0,1,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,1,0,0,0,0,0,1,1,0,0] => [2,8,1,3,4,5,6,7] => 0
[3,2,2,2,1] => [1,0,1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,1,1,0,0,0] => [1,3,6,2,4,7,5] => 0
>>> Load all 144 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 adjacent transpositions in the cycle decomposition of a permutation.
Map
parallelogram polyomino
Description
Return the Dyck path corresponding to the partition interpreted as a parallogram polyomino.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
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
decomposition reverse
Description
This map is recursively defined as follows.
The unique empty path of semilength $0$ is sent to itself.
Let $D$ be a Dyck path of semilength $n > 0$ and decompose it into $1 D_1 0 D_2$ with Dyck paths $D_1, D_2$ of respective semilengths $n_1$ and $n_2$ such that $n_1$ is minimal. One then has $n_1+n_2 = n-1$.
Now let $\tilde D_1$ and $\tilde D_2$ be the recursively defined respective images of $D_1$ and $D_2$ under this map. The image of $D$ is then defined as $1 \tilde D_2 0 \tilde D_1$.
The unique empty path of semilength $0$ is sent to itself.
Let $D$ be a Dyck path of semilength $n > 0$ and decompose it into $1 D_1 0 D_2$ with Dyck paths $D_1, D_2$ of respective semilengths $n_1$ and $n_2$ such that $n_1$ is minimal. One then has $n_1+n_2 = n-1$.
Now let $\tilde D_1$ and $\tilde D_2$ be the recursively defined respective images of $D_1$ and $D_2$ under this map. The image of $D$ is then defined as $1 \tilde D_2 0 \tilde D_1$.
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!