Identifier
-
Mp00199:
Dyck paths
—prime Dyck path⟶
Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000538: Permutations ⟶ ℤ
Values
[1,0] => [1,1,0,0] => [1,1,1,0,0,0] => [1,2,3] => 0
[1,0,1,0] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [2,1,3,4] => 0
[1,1,0,0] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,2,3,4] => 0
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [3,2,1,4,5] => 1
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [2,3,1,4,5] => 1
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [3,1,2,4,5] => 1
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [2,1,3,4,5] => 0
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [4,3,2,1,5,6] => 2
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [3,4,2,1,5,6] => 2
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => [4,2,3,1,5,6] => 2
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => [3,2,4,1,5,6] => 1
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [2,3,4,1,5,6] => 1
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [4,3,1,2,5,6] => 2
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [3,4,1,2,5,6] => 2
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [4,2,1,3,5,6] => 1
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [3,2,1,4,5,6] => 1
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [2,3,1,4,5,6] => 1
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [4,1,2,3,5,6] => 1
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [3,1,2,4,5,6] => 1
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [2,1,3,4,5,6] => 0
[1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,2,3,4,5,6] => 0
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,2,3,4,5,6,7] => 0
[] => [1,0] => [1,1,0,0] => [1,2] => 0
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 even inversions of a permutation.
An inversion $i < j$ of a permutation is even if $i \equiv j~(\operatorname{mod} 2)$. See St000539The number of odd inversions of a permutation. for odd inversions.
An inversion $i < j$ of a permutation is even if $i \equiv j~(\operatorname{mod} 2)$. See St000539The number of odd inversions of a permutation. for odd inversions.
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].
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
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!