Identifier
-
Mp00227:
Dyck paths
—Delest-Viennot-inverse⟶
Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000831: Permutations ⟶ ℤ
Values
[1,0,1,0] => [1,1,0,0] => [1,0,1,0] => [1,2] => 0
[1,1,0,0] => [1,0,1,0] => [1,1,0,0] => [2,1] => 1
[1,0,1,0,1,0] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => [1,2,3] => 0
[1,0,1,1,0,0] => [1,1,0,0,1,0] => [1,0,1,1,0,0] => [1,3,2] => 1
[1,1,0,0,1,0] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => [2,1,3] => 1
[1,1,0,1,0,0] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => [3,2,1] => 2
[1,1,1,0,0,0] => [1,1,0,1,0,0] => [1,1,0,1,0,0] => [2,3,1] => 2
[1,0,1,0,1,0,1,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,1,0,0] => [1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => 1
[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,3,2,4] => 1
[1,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => [1,4,3,2] => 2
[1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0] => [1,3,4,2] => 2
[1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => 1
[1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => 2
[1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [3,2,1,4] => 2
[1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [4,3,2,1] => 3
[1,1,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0] => [1,1,1,0,0,1,0,0] => [3,2,4,1] => 3
[1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0] => [1,1,0,1,0,0,1,0] => [2,3,1,4] => 2
[1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => [2,4,3,1] => 3
[1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,0,0] => [2,3,4,1] => 2
[1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [3,4,2,1] => 3
[1,0,1,0,1,0,1,0,1,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,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => 1
[1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => 1
[1,0,1,0,1,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => 2
[1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => 2
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => 1
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => 2
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => 2
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => 3
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => [1,4,3,5,2] => 3
[1,0,1,1,1,0,0,0,1,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] => 2
[1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => [1,3,5,4,2] => 3
[1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => 2
[1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,1,0,0,0] => [1,4,5,3,2] => 3
[1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => 2
[1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => 2
[1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => 3
[1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => 3
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => 2
[1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => 3
[1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => 3
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => 4
[1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0] => [4,3,2,5,1] => 4
[1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => [1,1,1,0,0,1,0,0,1,0] => [3,2,4,1,5] => 3
[1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => [3,2,5,4,1] => 4
[1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => [3,2,4,5,1] => 3
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [4,3,5,2,1] => 4
[1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => 2
[1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => 3
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [2,4,3,1,5] => 3
[1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => [2,5,4,3,1] => 4
[1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0] => [2,4,3,5,1] => 4
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => 2
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => [2,3,5,4,1] => 3
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => 2
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [2,4,5,3,1] => 3
[1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,0,0,1,0] => [3,4,2,1,5] => 3
[1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => [3,5,4,2,1] => 4
[1,1,1,1,0,0,1,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,1,0,0] => [3,4,2,5,1] => 3
[1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => [4,5,3,2,1] => 4
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [3,4,5,2,1] => 4
[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,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => 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] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => 1
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => 1
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => 2
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,0,1,0,1,0,1,1,0,1,0,0] => [1,2,3,5,6,4] => 2
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => 1
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => 2
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => 2
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => 3
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,1,0,0,0,1,1,0,1,0,0] => [1,0,1,0,1,1,1,0,0,1,0,0] => [1,2,5,4,6,3] => 3
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => [1,2,4,5,3,6] => 2
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => [1,0,1,0,1,1,0,1,1,0,0,0] => [1,2,4,6,5,3] => 3
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,2,4,5,6,3] => 2
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,0,1,0,1,1,1,0,1,0,0,0] => [1,2,5,6,4,3] => 3
[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,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => 1
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => 2
[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,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => 2
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => 3
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,1,0,0] => [1,3,2,5,6,4] => 3
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,3,2,5,6] => 2
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => 3
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,5,4,3,2,6] => 3
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,6,5,4,3,2] => 4
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,5,4,3,6,2] => 4
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0,1,0] => [1,4,3,5,2,6] => 3
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => [1,0,1,1,1,0,0,1,1,0,0,0] => [1,4,3,6,5,2] => 4
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,4,3,5,6,2] => 3
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,1,0,0,0] => [1,5,4,6,3,2] => 4
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => [1,3,4,2,5,6] => 2
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0,1,0] => [1,0,1,1,0,1,0,0,1,1,0,0] => [1,3,4,2,6,5] => 3
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,1,0,0] => [1,0,1,1,0,1,1,0,0,0,1,0] => [1,3,5,4,2,6] => 3
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0,1,0] => [1,0,1,1,0,1,1,1,0,0,0,0] => [1,3,6,5,4,2] => 4
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [1,0,1,1,0,1,1,0,0,1,0,0] => [1,3,5,4,6,2] => 4
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => [1,3,4,5,2,6] => 2
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0,1,0] => [1,0,1,1,0,1,0,1,1,0,0,0] => [1,3,4,6,5,2] => 3
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,0,1,1,0,1,0,1,0,1,0,0] => [1,3,4,5,6,2] => 2
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [1,0,1,1,0,1,1,0,1,0,0,0] => [1,3,5,6,4,2] => 3
[1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0,1,0] => [1,4,5,3,2,6] => 3
>>> Load all 304 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 that are either descents or recoils.
This is, for a permutation $\pi$ of length $n$, this statistics counts the set
$$\{ 1 \leq i < n : \pi(i) > \pi(i+1) \text{ or } \pi^{-1}(i) > \pi^{-1}(i+1)\}.$$
This is, for a permutation $\pi$ of length $n$, this statistics counts the set
$$\{ 1 \leq i < n : \pi(i) > \pi(i+1) \text{ or } \pi^{-1}(i) > \pi^{-1}(i+1)\}.$$
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
Delest-Viennot-inverse
Description
Return the Dyck path obtained by applying the inverse of Delest-Viennot's bijection to the corresponding parallelogram polyomino.
Let $D$ be a Dyck path of semilength $n$. The parallelogram polyomino $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
The Delest-Viennot bijection $\beta$ returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path $(\beta^{(-1)}\circ\gamma)(D)$.
Let $D$ be a Dyck path of semilength $n$. The parallelogram polyomino $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
The Delest-Viennot bijection $\beta$ returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path $(\beta^{(-1)}\circ\gamma)(D)$.
Map
to 312-avoiding permutation
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!