Identifier
-
Mp00028:
Dyck paths
—reverse⟶
Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St001005: Permutations ⟶ ℤ
Values
[1,0,1,0] => [1,0,1,0] => [1,1,0,0] => [2,1] => 2
[1,1,0,0] => [1,1,0,0] => [1,0,1,0] => [1,2] => 0
[1,0,1,0,1,0] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => [3,1,2] => 3
[1,0,1,1,0,0] => [1,1,0,0,1,0] => [1,1,0,0,1,0] => [2,1,3] => 2
[1,1,0,0,1,0] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => [2,3,1] => 3
[1,1,0,1,0,0] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => [1,3,2] => 2
[1,1,1,0,0,0] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => [1,2,3] => 0
[1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [4,1,2,3] => 4
[1,0,1,0,1,1,0,0] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0] => [3,1,2,4] => 3
[1,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [3,1,4,2] => 4
[1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => 4
[1,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => 2
[1,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => [3,4,1,2] => 4
[1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => [2,3,1,4] => 3
[1,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0] => [2,4,1,3] => 4
[1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0] => [1,4,2,3] => 3
[1,1,0,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => 2
[1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0] => [2,3,4,1] => 4
[1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0] => [1,3,4,2] => 3
[1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => 2
[1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => 0
[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,0,0,0,0,0] => [5,1,2,3,4] => 5
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => [4,1,2,3,5] => 4
[1,0,1,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [4,1,2,5,3] => 5
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [3,1,2,5,4] => 5
[1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0] => [3,1,2,4,5] => 3
[1,0,1,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,0] => [4,1,5,2,3] => 5
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,0] => [3,1,4,2,5] => 4
[1,0,1,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => [3,1,5,2,4] => 5
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,3,4] => 5
[1,0,1,1,0,1,1,0,0,0] => [1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => 4
[1,0,1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [3,1,4,5,2] => 5
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => 5
[1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => 4
[1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => 2
[1,1,0,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => [4,5,1,2,3] => 5
[1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => [3,4,1,2,5] => 4
[1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,0,0] => [3,4,1,5,2] => 5
[1,1,0,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => 5
[1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => 3
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,1,0,0] => [1,1,1,0,1,1,0,0,0,0] => [3,5,1,2,4] => 5
[1,1,0,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [2,4,1,3,5] => 4
[1,1,0,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0] => [2,5,1,3,4] => 5
[1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,5,2,3,4] => 4
[1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [1,4,2,3,5] => 3
[1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0] => [2,4,1,5,3] => 5
[1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => [1,4,2,5,3] => 4
[1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => 4
[1,1,0,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => 2
[1,1,1,0,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [3,4,5,1,2] => 5
[1,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => 4
[1,1,1,0,0,1,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => [2,4,5,1,3] => 5
[1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => [1,4,5,2,3] => 4
[1,1,1,0,0,1,1,0,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => 3
[1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,0,0,0] => [2,3,5,1,4] => 5
[1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,1,1,0,0,0] => [1,3,5,2,4] => 4
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,3,4] => 3
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => 2
[1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => 5
[1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => 4
[1,1,1,1,0,0,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => 3
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => 2
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => 0
[1,0,1,0,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,0,0,0,0,0,0] => [6,1,2,3,4,5] => 6
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => [5,1,2,3,4,6] => 5
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [5,1,2,3,6,4] => 6
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [4,1,2,3,6,5] => 6
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => [4,1,2,3,5,6] => 4
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [5,1,2,6,3,4] => 6
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => [4,1,2,5,3,6] => 5
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [4,1,2,6,3,5] => 6
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => [3,1,2,6,4,5] => 6
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,1,0,0,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => [3,1,2,5,4,6] => 5
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [4,1,2,5,6,3] => 6
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,0,1,0,0] => [3,1,2,5,6,4] => 6
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => [3,1,2,4,6,5] => 5
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => [3,1,2,4,5,6] => 3
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [5,1,6,2,3,4] => 6
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,0,1,0] => [4,1,5,2,3,6] => 5
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [4,1,5,2,6,3] => 6
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,1,0,0] => [3,1,4,2,6,5] => 6
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,0,1,0] => [3,1,4,2,5,6] => 4
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [4,1,6,2,3,5] => 6
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0,1,0] => [3,1,5,2,4,6] => 5
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [3,1,6,2,4,5] => 6
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => [2,1,6,3,4,5] => 6
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,0,1,0,1,0,0,1,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => [2,1,5,3,4,6] => 5
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [3,1,5,2,6,4] => 6
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => [2,1,5,3,6,4] => 6
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => [2,1,4,3,6,5] => 6
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [2,1,4,3,5,6] => 4
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [4,1,5,6,2,3] => 6
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,0,1,0,0,1,0] => [3,1,4,5,2,6] => 5
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => [3,1,5,6,2,4] => 6
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,0,1,1,0,0,0,1,0] => [1,1,0,0,1,1,1,0,1,0,0,0] => [2,1,5,6,3,4] => 6
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,1,0,0,1,1,0,0,0,1,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => [2,1,4,5,3,6] => 5
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [3,1,4,6,2,5] => 6
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0,1,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => [2,1,4,6,3,5] => 6
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => [2,1,3,6,4,5] => 5
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => [2,1,3,5,4,6] => 4
[1,0,1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [3,1,4,5,6,2] => 6
>>> Load all 305 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 indices for a permutation that are either left-to-right maxima or right-to-left minima but not both.
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 1D10D2 with Dyck paths D1,D2 of respective semilengths n1 and n2 such that n1 is minimal. One then has n1+n2=n−1.
Now let ˜D1 and ˜D2 be the recursively defined respective images of D1 and D2 under this map. The image of D is then defined as 1˜D20˜D1.
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 1D10D2 with Dyck paths D1,D2 of respective semilengths n1 and n2 such that n1 is minimal. One then has n1+n2=n−1.
Now let ˜D1 and ˜D2 be the recursively defined respective images of D1 and D2 under this map. The image of D is then defined as 1˜D20˜D1.
Map
to 321-avoiding permutation (Krattenthaler)
Description
Krattenthaler's bijection to 321-avoiding permutations.
Draw the path of semilength n in an n×n square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
Draw the path of semilength n in an n×n square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
Map
reverse
Description
The reversal of a Dyck path.
This is the Dyck path obtained by reading the path backwards.
This is the Dyck path obtained by reading the path backwards.
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!