Identifier
-
Mp00025:
Dyck paths
—to 132-avoiding permutation⟶
Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
Mp00170: Permutations —to signed permutation⟶ Signed permutations
St001863: Signed permutations ⟶ ℤ
Values
[1,0] => [1] => [1] => [1] => 1
[1,0,1,0] => [2,1] => [2,1] => [2,1] => 1
[1,1,0,0] => [1,2] => [1,2] => [1,2] => 2
[1,0,1,0,1,0] => [3,2,1] => [3,2,1] => [3,2,1] => 2
[1,0,1,1,0,0] => [2,3,1] => [3,1,2] => [3,1,2] => 1
[1,1,0,0,1,0] => [3,1,2] => [1,3,2] => [1,3,2] => 2
[1,1,0,1,0,0] => [2,1,3] => [2,1,3] => [2,1,3] => 2
[1,1,1,0,0,0] => [1,2,3] => [1,2,3] => [1,2,3] => 3
[1,0,1,0,1,0,1,0] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 2
[1,0,1,0,1,1,0,0] => [3,4,2,1] => [4,3,1,2] => [4,3,1,2] => 2
[1,0,1,1,0,0,1,0] => [4,2,3,1] => [4,1,3,2] => [4,1,3,2] => 2
[1,0,1,1,0,1,0,0] => [3,2,4,1] => [4,2,1,3] => [4,2,1,3] => 2
[1,0,1,1,1,0,0,0] => [2,3,4,1] => [4,1,2,3] => [4,1,2,3] => 1
[1,1,0,0,1,0,1,0] => [4,3,1,2] => [1,4,3,2] => [1,4,3,2] => 3
[1,1,0,0,1,1,0,0] => [3,4,1,2] => [1,4,2,3] => [1,4,2,3] => 2
[1,1,0,1,0,0,1,0] => [4,2,1,3] => [3,1,4,2] => [3,1,4,2] => 2
[1,1,0,1,0,1,0,0] => [3,2,1,4] => [3,2,1,4] => [3,2,1,4] => 3
[1,1,0,1,1,0,0,0] => [2,3,1,4] => [3,1,2,4] => [3,1,2,4] => 2
[1,1,1,0,0,0,1,0] => [4,1,2,3] => [1,2,4,3] => [1,2,4,3] => 3
[1,1,1,0,0,1,0,0] => [3,1,2,4] => [1,3,2,4] => [1,3,2,4] => 3
[1,1,1,0,1,0,0,0] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 3
[1,1,1,1,0,0,0,0] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 4
[1,1,0,0,1,0,1,0,1,0] => [5,4,3,1,2] => [1,5,4,3,2] => [1,5,4,3,2] => 3
[1,1,0,0,1,0,1,1,0,0] => [4,5,3,1,2] => [1,5,4,2,3] => [1,5,4,2,3] => 3
[1,1,0,0,1,1,0,0,1,0] => [5,3,4,1,2] => [1,5,2,4,3] => [1,5,2,4,3] => 3
[1,1,0,0,1,1,0,1,0,0] => [4,3,5,1,2] => [1,5,3,2,4] => [1,5,3,2,4] => 3
[1,1,0,0,1,1,1,0,0,0] => [3,4,5,1,2] => [1,5,2,3,4] => [1,5,2,3,4] => 2
[1,1,1,0,0,0,1,0,1,0] => [5,4,1,2,3] => [1,2,5,4,3] => [1,2,5,4,3] => 4
[1,1,1,0,0,0,1,1,0,0] => [4,5,1,2,3] => [1,2,5,3,4] => [1,2,5,3,4] => 3
[1,1,1,0,0,1,0,0,1,0] => [5,3,1,2,4] => [1,4,2,5,3] => [1,4,2,5,3] => 3
[1,1,1,0,0,1,0,1,0,0] => [4,3,1,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => 4
[1,1,1,0,0,1,1,0,0,0] => [3,4,1,2,5] => [1,4,2,3,5] => [1,4,2,3,5] => 3
[1,1,1,1,0,0,0,0,1,0] => [5,1,2,3,4] => [1,2,3,5,4] => [1,2,3,5,4] => 4
[1,1,1,1,0,0,0,1,0,0] => [4,1,2,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => 4
[1,1,1,1,0,0,1,0,0,0] => [3,1,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => 4
[1,1,1,1,1,0,0,0,0,0] => [1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
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 weak excedances of a signed permutation.
For a signed permutation $\pi\in\mathfrak H_n$, this is $\lvert\{i\in[n] \mid \pi(i) \geq i\}\rvert$.
For a signed permutation $\pi\in\mathfrak H_n$, this is $\lvert\{i\in[n] \mid \pi(i) \geq i\}\rvert$.
Map
to signed permutation
Description
The signed permutation with all signs positive.
Map
major-index to inversion-number bijection
Description
Return the permutation whose Lehmer code equals the major code of the preimage.
This map sends the major index to the number of inversions.
This map sends the major index to the number of 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].
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!