Identifier
-
Mp00159:
Permutations
—Demazure product with inverse⟶
Permutations
Mp00241: Permutations —invert Laguerre heap⟶ Permutations
Mp00170: Permutations —to signed permutation⟶ Signed permutations
St001864: Signed permutations ⟶ ℤ
Values
[1] => [1] => [1] => [1] => 0
[1,2] => [1,2] => [1,2] => [1,2] => 0
[2,1] => [2,1] => [2,1] => [2,1] => 1
[1,2,3] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,3,2] => [1,3,2] => [1,3,2] => [1,3,2] => 1
[2,1,3] => [2,1,3] => [2,1,3] => [2,1,3] => 1
[2,3,1] => [3,2,1] => [3,2,1] => [3,2,1] => 1
[3,1,2] => [3,2,1] => [3,2,1] => [3,2,1] => 1
[3,2,1] => [3,2,1] => [3,2,1] => [3,2,1] => 1
[1,2,3,4] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,2,4,3] => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 1
[1,3,2,4] => [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 1
[1,3,4,2] => [1,4,3,2] => [1,4,3,2] => [1,4,3,2] => 1
[1,4,2,3] => [1,4,3,2] => [1,4,3,2] => [1,4,3,2] => 1
[1,4,3,2] => [1,4,3,2] => [1,4,3,2] => [1,4,3,2] => 1
[2,1,3,4] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 1
[2,1,4,3] => [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 2
[2,3,1,4] => [3,2,1,4] => [3,2,1,4] => [3,2,1,4] => 1
[2,3,4,1] => [4,2,3,1] => [3,1,4,2] => [3,1,4,2] => 2
[2,4,1,3] => [3,4,1,2] => [2,4,1,3] => [2,4,1,3] => 2
[2,4,3,1] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 2
[3,1,2,4] => [3,2,1,4] => [3,2,1,4] => [3,2,1,4] => 1
[3,1,4,2] => [4,2,3,1] => [3,1,4,2] => [3,1,4,2] => 2
[3,2,1,4] => [3,2,1,4] => [3,2,1,4] => [3,2,1,4] => 1
[3,2,4,1] => [4,2,3,1] => [3,1,4,2] => [3,1,4,2] => 2
[3,4,1,2] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 2
[3,4,2,1] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 2
[4,1,2,3] => [4,2,3,1] => [3,1,4,2] => [3,1,4,2] => 2
[4,1,3,2] => [4,2,3,1] => [3,1,4,2] => [3,1,4,2] => 2
[4,2,1,3] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 2
[4,2,3,1] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 2
[4,3,1,2] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 2
[4,3,2,1] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 2
[1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => 1
[1,2,4,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => 1
[1,2,4,5,3] => [1,2,5,4,3] => [1,2,5,4,3] => [1,2,5,4,3] => 1
[1,2,5,3,4] => [1,2,5,4,3] => [1,2,5,4,3] => [1,2,5,4,3] => 1
[1,2,5,4,3] => [1,2,5,4,3] => [1,2,5,4,3] => [1,2,5,4,3] => 1
[1,3,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => 1
[1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 2
[1,3,4,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => 1
[1,3,4,5,2] => [1,5,3,4,2] => [1,4,2,5,3] => [1,4,2,5,3] => 2
[1,3,5,2,4] => [1,4,5,2,3] => [1,3,5,2,4] => [1,3,5,2,4] => 2
[1,3,5,4,2] => [1,5,4,3,2] => [1,5,4,3,2] => [1,5,4,3,2] => 2
[1,4,2,3,5] => [1,4,3,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => 1
[1,4,2,5,3] => [1,5,3,4,2] => [1,4,2,5,3] => [1,4,2,5,3] => 2
[1,4,3,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => 1
[1,4,3,5,2] => [1,5,3,4,2] => [1,4,2,5,3] => [1,4,2,5,3] => 2
[1,4,5,2,3] => [1,5,4,3,2] => [1,5,4,3,2] => [1,5,4,3,2] => 2
[1,4,5,3,2] => [1,5,4,3,2] => [1,5,4,3,2] => [1,5,4,3,2] => 2
[1,5,2,3,4] => [1,5,3,4,2] => [1,4,2,5,3] => [1,4,2,5,3] => 2
[1,5,2,4,3] => [1,5,3,4,2] => [1,4,2,5,3] => [1,4,2,5,3] => 2
[1,5,3,2,4] => [1,5,4,3,2] => [1,5,4,3,2] => [1,5,4,3,2] => 2
[1,5,3,4,2] => [1,5,4,3,2] => [1,5,4,3,2] => [1,5,4,3,2] => 2
[1,5,4,2,3] => [1,5,4,3,2] => [1,5,4,3,2] => [1,5,4,3,2] => 2
[1,5,4,3,2] => [1,5,4,3,2] => [1,5,4,3,2] => [1,5,4,3,2] => 2
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 excedances of a signed permutation.
For a signed permutation $\pi\in\mathfrak H_n$, this is $\lvert\{i\in[n] \mid \pi(i) > i\}\rvert$.
For a signed permutation $\pi\in\mathfrak H_n$, this is $\lvert\{i\in[n] \mid \pi(i) > i\}\rvert$.
Map
to signed permutation
Description
The signed permutation with all signs positive.
Map
invert Laguerre heap
Description
The permutation obtained by inverting the corresponding Laguerre heap, according to Viennot.
Let $\pi$ be a permutation. Following Viennot [1], we associate to $\pi$ a heap of pieces, by considering each decreasing run $(\pi_i, \pi_{i+1}, \dots, \pi_j)$ of $\pi$ as one piece, beginning with the left most run. Two pieces commute if and only if the minimal element of one piece is larger than the maximal element of the other piece.
This map yields the permutation corresponding to the heap obtained by reversing the reading direction of the heap.
Equivalently, this is the permutation obtained by flipping the noncrossing arc diagram of Reading [2] vertically.
By definition, this map preserves the set of decreasing runs.
Let $\pi$ be a permutation. Following Viennot [1], we associate to $\pi$ a heap of pieces, by considering each decreasing run $(\pi_i, \pi_{i+1}, \dots, \pi_j)$ of $\pi$ as one piece, beginning with the left most run. Two pieces commute if and only if the minimal element of one piece is larger than the maximal element of the other piece.
This map yields the permutation corresponding to the heap obtained by reversing the reading direction of the heap.
Equivalently, this is the permutation obtained by flipping the noncrossing arc diagram of Reading [2] vertically.
By definition, this map preserves the set of decreasing runs.
Map
Demazure product with inverse
Description
This map sends a permutation $\pi$ to $\pi^{-1} \star \pi$ where $\star$ denotes the Demazure product on permutations.
This map is a surjection onto the set of involutions, i.e., the set of permutations $\pi$ for which $\pi = \pi^{-1}$.
This map is a surjection onto the set of involutions, i.e., the set of permutations $\pi$ for which $\pi = \pi^{-1}$.
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!