Identifier
-
Mp00201:
Dyck paths
—Ringel⟶
Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00241: Permutations —invert Laguerre heap⟶ Permutations
St000354: Permutations ⟶ ℤ
Values
[1,0] => [2,1] => [1,2] => [1,2] => 0
[1,0,1,0] => [3,1,2] => [1,3,2] => [1,3,2] => 1
[1,1,0,0] => [2,3,1] => [1,2,3] => [1,2,3] => 0
[1,0,1,0,1,0] => [4,1,2,3] => [1,4,3,2] => [1,4,3,2] => 2
[1,0,1,1,0,0] => [3,1,4,2] => [1,3,4,2] => [1,4,2,3] => 1
[1,1,0,0,1,0] => [2,4,1,3] => [1,2,4,3] => [1,2,4,3] => 1
[1,1,0,1,0,0] => [4,3,1,2] => [1,4,2,3] => [1,3,4,2] => 1
[1,1,1,0,0,0] => [2,3,4,1] => [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,0,1,0] => [5,1,2,3,4] => [1,5,4,3,2] => [1,5,4,3,2] => 3
[1,0,1,0,1,1,0,0] => [4,1,2,5,3] => [1,4,5,3,2] => [1,5,3,2,4] => 2
[1,0,1,1,0,0,1,0] => [3,1,5,2,4] => [1,3,5,4,2] => [1,5,4,2,3] => 2
[1,0,1,1,0,1,0,0] => [5,1,4,2,3] => [1,5,3,4,2] => [1,4,2,5,3] => 1
[1,0,1,1,1,0,0,0] => [3,1,4,5,2] => [1,3,4,5,2] => [1,5,2,3,4] => 1
[1,1,0,0,1,0,1,0] => [2,5,1,3,4] => [1,2,5,4,3] => [1,2,5,4,3] => 2
[1,1,0,0,1,1,0,0] => [2,4,1,5,3] => [1,2,4,5,3] => [1,2,5,3,4] => 1
[1,1,0,1,0,0,1,0] => [5,3,1,2,4] => [1,5,4,2,3] => [1,3,5,4,2] => 2
[1,1,0,1,0,1,0,0] => [5,4,1,2,3] => [1,5,3,2,4] => [1,4,5,3,2] => 2
[1,1,0,1,1,0,0,0] => [4,3,1,5,2] => [1,4,5,2,3] => [1,3,5,2,4] => 2
[1,1,1,0,0,0,1,0] => [2,3,5,1,4] => [1,2,3,5,4] => [1,2,3,5,4] => 1
[1,1,1,0,0,1,0,0] => [2,5,4,1,3] => [1,2,5,3,4] => [1,2,4,5,3] => 1
[1,1,1,0,1,0,0,0] => [5,3,4,1,2] => [1,5,2,3,4] => [1,3,4,5,2] => 1
[1,1,1,1,0,0,0,0] => [2,3,4,5,1] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,0,1,0] => [6,1,2,3,4,5] => [1,6,5,4,3,2] => [1,6,5,4,3,2] => 4
[1,0,1,0,1,0,1,1,0,0] => [5,1,2,3,6,4] => [1,5,6,4,3,2] => [1,6,4,3,2,5] => 3
[1,0,1,0,1,1,0,0,1,0] => [4,1,2,6,3,5] => [1,4,6,5,3,2] => [1,6,5,3,2,4] => 3
[1,0,1,0,1,1,0,1,0,0] => [6,1,2,5,3,4] => [1,6,4,5,3,2] => [1,5,3,2,6,4] => 2
[1,0,1,0,1,1,1,0,0,0] => [4,1,2,5,6,3] => [1,4,5,6,3,2] => [1,6,3,2,4,5] => 2
[1,0,1,1,0,0,1,0,1,0] => [3,1,6,2,4,5] => [1,3,6,5,4,2] => [1,6,5,4,2,3] => 3
[1,0,1,1,0,0,1,1,0,0] => [3,1,5,2,6,4] => [1,3,5,6,4,2] => [1,6,4,2,3,5] => 2
[1,0,1,1,0,1,0,0,1,0] => [6,1,4,2,3,5] => [1,6,5,3,4,2] => [1,4,2,6,5,3] => 2
[1,0,1,1,0,1,0,1,0,0] => [6,1,5,2,3,4] => [1,6,4,2,3,5] => [1,3,5,6,4,2] => 2
[1,0,1,1,0,1,1,0,0,0] => [5,1,4,2,6,3] => [1,5,6,3,4,2] => [1,4,2,6,3,5] => 2
[1,0,1,1,1,0,0,0,1,0] => [3,1,4,6,2,5] => [1,3,4,6,5,2] => [1,6,5,2,3,4] => 2
[1,0,1,1,1,0,0,1,0,0] => [3,1,6,5,2,4] => [1,3,6,4,5,2] => [1,5,2,3,6,4] => 1
[1,0,1,1,1,0,1,0,0,0] => [6,1,4,5,2,3] => [1,6,3,4,5,2] => [1,5,2,4,6,3] => 2
[1,0,1,1,1,1,0,0,0,0] => [3,1,4,5,6,2] => [1,3,4,5,6,2] => [1,6,2,3,4,5] => 1
[1,1,0,0,1,0,1,0,1,0] => [2,6,1,3,4,5] => [1,2,6,5,4,3] => [1,2,6,5,4,3] => 3
[1,1,0,0,1,0,1,1,0,0] => [2,5,1,3,6,4] => [1,2,5,6,4,3] => [1,2,6,4,3,5] => 2
[1,1,0,0,1,1,0,0,1,0] => [2,4,1,6,3,5] => [1,2,4,6,5,3] => [1,2,6,5,3,4] => 2
[1,1,0,0,1,1,0,1,0,0] => [2,6,1,5,3,4] => [1,2,6,4,5,3] => [1,2,5,3,6,4] => 1
[1,1,0,0,1,1,1,0,0,0] => [2,4,1,5,6,3] => [1,2,4,5,6,3] => [1,2,6,3,4,5] => 1
[1,1,0,1,0,0,1,0,1,0] => [6,3,1,2,4,5] => [1,6,5,4,2,3] => [1,3,6,5,4,2] => 3
[1,1,0,1,0,0,1,1,0,0] => [5,3,1,2,6,4] => [1,5,6,4,2,3] => [1,3,6,4,2,5] => 2
[1,1,0,1,0,1,0,0,1,0] => [6,4,1,2,3,5] => [1,6,5,3,2,4] => [1,4,6,5,3,2] => 3
[1,1,0,1,0,1,0,1,0,0] => [5,6,1,2,3,4] => [1,5,3,2,6,4] => [1,6,4,5,3,2] => 3
[1,1,0,1,0,1,1,0,0,0] => [5,4,1,2,6,3] => [1,5,6,3,2,4] => [1,4,6,3,2,5] => 3
[1,1,0,1,1,0,0,0,1,0] => [4,3,1,6,2,5] => [1,4,6,5,2,3] => [1,3,6,5,2,4] => 3
[1,1,0,1,1,0,0,1,0,0] => [6,3,1,5,2,4] => [1,6,4,5,2,3] => [1,3,5,2,6,4] => 2
[1,1,0,1,1,0,1,0,0,0] => [6,4,1,5,2,3] => [1,6,3,2,4,5] => [1,4,5,6,3,2] => 2
[1,1,0,1,1,1,0,0,0,0] => [4,3,1,5,6,2] => [1,4,5,6,2,3] => [1,3,6,2,4,5] => 2
[1,1,1,0,0,0,1,0,1,0] => [2,3,6,1,4,5] => [1,2,3,6,5,4] => [1,2,3,6,5,4] => 2
[1,1,1,0,0,0,1,1,0,0] => [2,3,5,1,6,4] => [1,2,3,5,6,4] => [1,2,3,6,4,5] => 1
[1,1,1,0,0,1,0,0,1,0] => [2,6,4,1,3,5] => [1,2,6,5,3,4] => [1,2,4,6,5,3] => 2
[1,1,1,0,0,1,0,1,0,0] => [2,6,5,1,3,4] => [1,2,6,4,3,5] => [1,2,5,6,4,3] => 2
[1,1,1,0,0,1,1,0,0,0] => [2,5,4,1,6,3] => [1,2,5,6,3,4] => [1,2,4,6,3,5] => 2
[1,1,1,0,1,0,0,0,1,0] => [6,3,4,1,2,5] => [1,6,5,2,3,4] => [1,3,4,6,5,2] => 2
[1,1,1,0,1,0,0,1,0,0] => [6,3,5,1,2,4] => [1,6,4,2,3,5] => [1,3,5,6,4,2] => 2
[1,1,1,0,1,0,1,0,0,0] => [6,5,4,1,2,3] => [1,6,3,4,2,5] => [1,4,2,5,6,3] => 1
[1,1,1,0,1,1,0,0,0,0] => [5,3,4,1,6,2] => [1,5,6,2,3,4] => [1,3,4,6,2,5] => 2
[1,1,1,1,0,0,0,0,1,0] => [2,3,4,6,1,5] => [1,2,3,4,6,5] => [1,2,3,4,6,5] => 1
[1,1,1,1,0,0,0,1,0,0] => [2,3,6,5,1,4] => [1,2,3,6,4,5] => [1,2,3,5,6,4] => 1
[1,1,1,1,0,0,1,0,0,0] => [2,6,4,5,1,3] => [1,2,6,3,4,5] => [1,2,4,5,6,3] => 1
[1,1,1,1,0,1,0,0,0,0] => [6,3,4,5,1,2] => [1,6,2,3,4,5] => [1,3,4,5,6,2] => 1
[1,1,1,1,1,0,0,0,0,0] => [2,3,4,5,6,1] => [1,2,3,4,5,6] => [1,2,3,4,5,6] => 0
[1,0,1,1,0,1,0,0,1,0,1,0] => [7,1,4,2,3,5,6] => [1,7,6,5,3,4,2] => [1,4,2,7,6,5,3] => 3
[1,0,1,1,0,1,0,0,1,1,0,0] => [6,1,4,2,3,7,5] => [1,6,7,5,3,4,2] => [1,4,2,7,5,3,6] => 2
[1,0,1,1,0,1,0,1,0,0,1,0] => [7,1,5,2,3,4,6] => [1,7,6,4,2,3,5] => [1,3,5,7,6,4,2] => 3
[1,0,1,1,0,1,0,1,0,1,0,0] => [6,1,7,2,3,4,5] => [1,6,4,2,3,7,5] => [1,3,7,5,6,4,2] => 3
[1,0,1,1,0,1,0,1,1,0,0,0] => [6,1,5,2,3,7,4] => [1,6,7,4,2,3,5] => [1,3,5,7,4,2,6] => 3
[1,0,1,1,0,1,1,0,0,0,1,0] => [5,1,4,2,7,3,6] => [1,5,7,6,3,4,2] => [1,4,2,7,6,3,5] => 3
[1,0,1,1,0,1,1,0,0,1,0,0] => [7,1,4,2,6,3,5] => [1,7,5,6,3,4,2] => [1,4,2,6,3,7,5] => 2
[1,0,1,1,0,1,1,0,1,0,0,0] => [7,1,5,2,6,3,4] => [1,7,4,2,3,5,6] => [1,3,5,6,7,4,2] => 2
[1,0,1,1,0,1,1,1,0,0,0,0] => [5,1,4,2,6,7,3] => [1,5,6,7,3,4,2] => [1,4,2,7,3,5,6] => 2
[1,0,1,1,1,0,1,0,0,1,0,0] => [7,1,4,6,2,3,5] => [1,7,5,2,3,4,6] => [1,3,4,6,7,5,2] => 2
[1,0,1,1,1,0,1,0,1,0,0,0] => [7,1,6,5,2,3,4] => [1,7,4,5,2,3,6] => [1,3,5,2,6,7,4] => 2
[1,1,0,0,1,0,1,0,1,0,1,0] => [2,7,1,3,4,5,6] => [1,2,7,6,5,4,3] => [1,2,7,6,5,4,3] => 4
[1,1,0,0,1,0,1,0,1,1,0,0] => [2,6,1,3,4,7,5] => [1,2,6,7,5,4,3] => [1,2,7,5,4,3,6] => 3
[1,1,0,0,1,0,1,1,0,0,1,0] => [2,5,1,3,7,4,6] => [1,2,5,7,6,4,3] => [1,2,7,6,4,3,5] => 3
[1,1,0,0,1,0,1,1,0,1,0,0] => [2,7,1,3,6,4,5] => [1,2,7,5,6,4,3] => [1,2,6,4,3,7,5] => 2
[1,1,0,0,1,0,1,1,1,0,0,0] => [2,5,1,3,6,7,4] => [1,2,5,6,7,4,3] => [1,2,7,4,3,5,6] => 2
[1,1,0,0,1,1,0,0,1,0,1,0] => [2,4,1,7,3,5,6] => [1,2,4,7,6,5,3] => [1,2,7,6,5,3,4] => 3
[1,1,0,0,1,1,0,0,1,1,0,0] => [2,4,1,6,3,7,5] => [1,2,4,6,7,5,3] => [1,2,7,5,3,4,6] => 2
[1,1,0,0,1,1,0,1,0,0,1,0] => [2,7,1,5,3,4,6] => [1,2,7,6,4,5,3] => [1,2,5,3,7,6,4] => 2
[1,1,0,0,1,1,0,1,0,1,0,0] => [2,7,1,6,3,4,5] => [1,2,7,5,3,4,6] => [1,2,4,6,7,5,3] => 2
[1,1,0,0,1,1,0,1,1,0,0,0] => [2,6,1,5,3,7,4] => [1,2,6,7,4,5,3] => [1,2,5,3,7,4,6] => 2
[1,1,0,0,1,1,1,0,0,0,1,0] => [2,4,1,5,7,3,6] => [1,2,4,5,7,6,3] => [1,2,7,6,3,4,5] => 2
[1,1,0,0,1,1,1,0,0,1,0,0] => [2,4,1,7,6,3,5] => [1,2,4,7,5,6,3] => [1,2,6,3,4,7,5] => 1
[1,1,0,0,1,1,1,0,1,0,0,0] => [2,7,1,5,6,3,4] => [1,2,7,4,5,6,3] => [1,2,6,3,5,7,4] => 2
[1,1,0,0,1,1,1,1,0,0,0,0] => [2,4,1,5,6,7,3] => [1,2,4,5,6,7,3] => [1,2,7,3,4,5,6] => 1
[1,1,0,1,0,0,1,0,1,0,1,0] => [7,3,1,2,4,5,6] => [1,7,6,5,4,2,3] => [1,3,7,6,5,4,2] => 4
[1,1,0,1,0,0,1,0,1,1,0,0] => [6,3,1,2,4,7,5] => [1,6,7,5,4,2,3] => [1,3,7,5,4,2,6] => 3
[1,1,0,1,0,0,1,1,0,0,1,0] => [5,3,1,2,7,4,6] => [1,5,7,6,4,2,3] => [1,3,7,6,4,2,5] => 3
[1,1,0,1,0,0,1,1,0,1,0,0] => [7,3,1,2,6,4,5] => [1,7,5,6,4,2,3] => [1,3,6,4,2,7,5] => 2
[1,1,0,1,0,0,1,1,1,0,0,0] => [5,3,1,2,6,7,4] => [1,5,6,7,4,2,3] => [1,3,7,4,2,5,6] => 2
[1,1,0,1,0,1,1,0,0,1,0,0] => [7,4,1,2,6,3,5] => [1,7,5,6,3,2,4] => [1,4,6,3,2,7,5] => 3
[1,1,0,1,1,0,0,0,1,0,1,0] => [4,3,1,7,2,5,6] => [1,4,7,6,5,2,3] => [1,3,7,6,5,2,4] => 4
[1,1,0,1,1,0,0,0,1,1,0,0] => [4,3,1,6,2,7,5] => [1,4,6,7,5,2,3] => [1,3,7,5,2,4,6] => 3
[1,1,0,1,1,0,0,1,0,0,1,0] => [7,3,1,5,2,4,6] => [1,7,6,4,5,2,3] => [1,3,5,2,7,6,4] => 3
[1,1,0,1,1,0,0,1,0,1,0,0] => [7,3,1,6,2,4,5] => [1,7,5,2,3,4,6] => [1,3,4,6,7,5,2] => 2
[1,1,0,1,1,0,0,1,1,0,0,0] => [6,3,1,5,2,7,4] => [1,6,7,4,5,2,3] => [1,3,5,2,7,4,6] => 3
[1,1,0,1,1,0,1,0,0,0,1,0] => [7,4,1,5,2,3,6] => [1,7,6,3,2,4,5] => [1,4,5,7,6,3,2] => 3
>>> Load all 153 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 recoils of a permutation.
A recoil, or inverse descent of a permutation $\pi$ is a value $i$ such that $i+1$ appears to the left of $i$ in $\pi_1,\pi_2,\dots,\pi_n$.
In other words, this is the number of descents of the inverse permutation. It can be also be described as the number of occurrences of the mesh pattern $([2,1], {(0,1),(1,1),(2,1)})$, i.e., the middle row is shaded.
A recoil, or inverse descent of a permutation $\pi$ is a value $i$ such that $i+1$ appears to the left of $i$ in $\pi_1,\pi_2,\dots,\pi_n$.
In other words, this is the number of descents of the inverse permutation. It can be also be described as the number of occurrences of the mesh pattern $([2,1], {(0,1),(1,1),(2,1)})$, i.e., the middle row is shaded.
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.
Map
cycle-as-one-line notation
Description
Return the permutation obtained by concatenating the cycles of a permutation, each written with minimal element first, sorted by minimal element.
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.
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!