Identifier
-
Mp00099:
Dyck paths
—bounce path⟶
Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000866: Permutations ⟶ ℤ
Values
[1,0,1,0] => [1,0,1,0] => [1,1,0,0] => [1,2] => 0
[1,1,0,0] => [1,1,0,0] => [1,0,1,0] => [2,1] => 0
[1,0,1,0,1,0] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => [1,2,3] => 0
[1,0,1,1,0,0] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => [3,1,2] => 2
[1,1,0,0,1,0] => [1,1,0,0,1,0] => [1,0,1,1,0,0] => [2,3,1] => 0
[1,1,0,1,0,0] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => [3,1,2] => 2
[1,1,1,0,0,0] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => [3,2,1] => 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] => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [4,1,2,3] => 3
[1,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [3,4,1,2] => 4
[1,0,1,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [4,1,2,3] => 3
[1,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => [4,3,1,2] => 4
[1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => [2,3,4,1] => 0
[1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [4,2,3,1] => 2
[1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [3,4,1,2] => 4
[1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [4,2,3,1] => 2
[1,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => [4,3,1,2] => 4
[1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,0,0] => [3,4,2,1] => 0
[1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [4,2,3,1] => 2
[1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => [4,3,1,2] => 4
[1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => [4,3,2,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,0,0,0,0,0] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [5,1,2,3,4] => 4
[1,0,1,0,1,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [4,5,1,2,3] => 6
[1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [5,1,2,3,4] => 4
[1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => [5,4,1,2,3] => 6
[1,0,1,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => [3,4,5,1,2] => 6
[1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [5,3,4,1,2] => 8
[1,0,1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [4,5,1,2,3] => 6
[1,0,1,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [5,3,4,1,2] => 8
[1,0,1,1,0,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => [5,4,1,2,3] => 6
[1,0,1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => [4,5,3,1,2] => 6
[1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [5,3,4,1,2] => 8
[1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => [5,4,1,2,3] => 6
[1,0,1,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => [5,4,3,1,2] => 6
[1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => [2,3,4,5,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,0,0,0,1,0] => [5,2,3,4,1] => 3
[1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [4,5,2,3,1] => 4
[1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [5,2,3,4,1] => 3
[1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => [5,4,2,3,1] => 4
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => [3,4,5,1,2] => 6
[1,1,0,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [5,3,4,1,2] => 8
[1,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [4,5,2,3,1] => 4
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [5,3,4,1,2] => 8
[1,1,0,1,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => [5,4,2,3,1] => 4
[1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => [4,5,3,1,2] => 6
[1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [5,3,4,1,2] => 8
[1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => [5,4,2,3,1] => 4
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => [5,4,3,1,2] => 6
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0] => [3,4,5,2,1] => 0
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => [5,3,4,2,1] => 2
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [4,5,2,3,1] => 4
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => [5,3,4,2,1] => 2
[1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => [5,4,2,3,1] => 4
[1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => [4,5,3,1,2] => 6
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => [5,3,4,2,1] => 2
[1,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => [5,4,2,3,1] => 4
[1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => [5,4,3,1,2] => 6
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => [4,5,3,2,1] => 0
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => [5,3,4,2,1] => 2
[1,1,1,1,0,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => [5,4,2,3,1] => 4
[1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => [5,4,3,1,2] => 6
[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] => [5,4,3,2,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,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,1,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => [6,1,2,3,4,5] => 5
[1,0,1,0,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,0,0,1,1,0,0] => [5,6,1,2,3,4] => 8
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => [6,1,2,3,4,5] => 5
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => [6,5,1,2,3,4] => 8
[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,0,0,0,1,1,1,0,0,0] => [4,5,6,1,2,3] => 9
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => [6,4,5,1,2,3] => 11
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [5,6,1,2,3,4] => 8
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => [6,4,5,1,2,3] => 11
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => [6,5,1,2,3,4] => 8
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => [5,6,4,1,2,3] => 9
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => [6,4,5,1,2,3] => 11
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => [6,5,1,2,3,4] => 8
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => [6,5,4,1,2,3] => 9
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => [3,4,5,6,1,2] => 8
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => [6,3,4,5,1,2] => 11
[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,0,0,1,1,0,0,1,1,0,0] => [5,6,3,4,1,2] => 12
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => [6,3,4,5,1,2] => 11
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [6,5,3,4,1,2] => 12
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => [4,5,6,1,2,3] => 9
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => [6,4,5,1,2,3] => 11
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => [5,6,3,4,1,2] => 12
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => [6,4,5,1,2,3] => 11
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [6,5,3,4,1,2] => 12
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => [5,6,4,1,2,3] => 9
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => [6,4,5,1,2,3] => 11
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [6,5,3,4,1,2] => 12
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => [6,5,4,1,2,3] => 9
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => [4,5,6,3,1,2] => 8
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => [6,4,5,3,1,2] => 10
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => [5,6,3,4,1,2] => 12
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => [6,4,5,3,1,2] => 10
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [6,5,3,4,1,2] => 12
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => [5,6,4,1,2,3] => 9
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => [6,4,5,3,1,2] => 10
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [6,5,3,4,1,2] => 12
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => [6,5,4,1,2,3] => 9
[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,0,0,1,0,1,0,1,1,0,0] => [5,6,4,3,1,2] => 8
>>> Load all 196 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 admissible inversions of a permutation in the sense of Shareshian-Wachs.
An admissible inversion of a permutation σ is a pair (σi,σj) such that
1. i<j and σi>σj and 2. either σj<σj+1 or there exists a i<k<j with σk<σj.
This version was introduced by John Shareshian and Michelle L. Wachs in [1], for a closely related version, see St000463The number of admissible inversions of a permutation..
An admissible inversion of a permutation σ is a pair (σi,σj) such that
1. i<j and σi>σj and 2. either σj<σj+1 or there exists a i<k<j with σk<σj.
This version was introduced by John Shareshian and Michelle L. Wachs in [1], for a closely related version, see St000463The number of admissible inversions of a permutation..
Map
Lalanne-Kreweras involution
Description
The Lalanne-Kreweras involution on Dyck paths.
Label the upsteps from left to right and record the labels on the first up step of each double rise. Do the same for the downsteps. Then form the Dyck path whose ascent lengths and descent lengths are the consecutives differences of the labels.
Label the upsteps from left to right and record the labels on the first up step of each double rise. Do the same for the downsteps. Then form the Dyck path whose ascent lengths and descent lengths are the consecutives differences of the labels.
Map
bounce path
Description
Sends a Dyck path D of length 2n to its bounce path.
This path is formed by starting at the endpoint (n,n) of D and travelling west until encountering the first vertical step of D, then south until hitting the diagonal, then west again to hit D, etc. until the point (0,0) is reached.
This map is the first part of the zeta map Mp00030zeta map.
This path is formed by starting at the endpoint (n,n) of D and travelling west until encountering the first vertical step of D, then south until hitting the diagonal, then west again to hit D, etc. until the point (0,0) is reached.
This map is the first part of the zeta map Mp00030zeta map.
Map
to 132-avoiding permutation
Description
Sends a Dyck path to a 132-avoiding permutation.
This bijection is defined in [1, Section 2].
This bijection is defined in [1, Section 2].
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!