Identifier
-
Mp00031:
Dyck paths
—to 312-avoiding permutation⟶
Permutations
Mp00241: Permutations —invert Laguerre heap⟶ Permutations
Mp00066: Permutations —inverse⟶ Permutations
St000446: Permutations ⟶ ℤ
Values
[1,0] => [1] => [1] => [1] => 0
[1,0,1,0] => [1,2] => [1,2] => [1,2] => 0
[1,1,0,0] => [2,1] => [2,1] => [2,1] => 1
[1,0,1,0,1,0] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,0,1,1,0,0] => [1,3,2] => [1,3,2] => [1,3,2] => 1
[1,1,0,0,1,0] => [2,1,3] => [2,1,3] => [2,1,3] => 2
[1,1,0,1,0,0] => [2,3,1] => [3,1,2] => [2,3,1] => 2
[1,1,1,0,0,0] => [3,2,1] => [3,2,1] => [3,2,1] => 3
[1,0,1,0,1,0,1,0] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0] => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 1
[1,0,1,1,0,0,1,0] => [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 2
[1,0,1,1,0,1,0,0] => [1,3,4,2] => [1,4,2,3] => [1,3,4,2] => 2
[1,0,1,1,1,0,0,0] => [1,4,3,2] => [1,4,3,2] => [1,4,3,2] => 3
[1,1,0,0,1,0,1,0] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 3
[1,1,0,0,1,1,0,0] => [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 4
[1,1,0,1,0,0,1,0] => [2,3,1,4] => [3,1,2,4] => [2,3,1,4] => 3
[1,1,0,1,0,1,0,0] => [2,3,4,1] => [4,1,2,3] => [2,3,4,1] => 3
[1,1,0,1,1,0,0,0] => [2,4,3,1] => [4,3,1,2] => [3,4,2,1] => 5
[1,1,1,0,0,0,1,0] => [3,2,1,4] => [3,2,1,4] => [3,2,1,4] => 5
[1,1,1,0,0,1,0,0] => [3,2,4,1] => [4,1,3,2] => [2,4,3,1] => 4
[1,1,1,0,1,0,0,0] => [3,4,2,1] => [4,2,1,3] => [3,2,4,1] => 5
[1,1,1,1,0,0,0,0] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 6
[1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => 1
[1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => 2
[1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => [1,2,5,3,4] => [1,2,4,5,3] => 2
[1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => [1,2,5,4,3] => [1,2,5,4,3] => 3
[1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => 3
[1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 4
[1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => [1,4,2,3,5] => [1,3,4,2,5] => 3
[1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => [1,5,2,3,4] => [1,3,4,5,2] => 3
[1,0,1,1,0,1,1,0,0,0] => [1,3,5,4,2] => [1,5,4,2,3] => [1,4,5,3,2] => 5
[1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => 5
[1,0,1,1,1,0,0,1,0,0] => [1,4,3,5,2] => [1,5,2,4,3] => [1,3,5,4,2] => 4
[1,0,1,1,1,0,1,0,0,0] => [1,4,5,3,2] => [1,5,3,2,4] => [1,4,3,5,2] => 5
[1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => [1,5,4,3,2] => [1,5,4,3,2] => 6
[1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => [2,1,3,4,5] => [2,1,3,4,5] => 4
[1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => 5
[1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => [2,1,4,3,5] => [2,1,4,3,5] => 6
[1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => [2,1,5,3,4] => [2,1,4,5,3] => 6
[1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [2,1,5,4,3] => [2,1,5,4,3] => 7
[1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => [3,1,2,4,5] => [2,3,1,4,5] => 4
[1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => [3,1,2,5,4] => [2,3,1,5,4] => 5
[1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => [4,1,2,3,5] => [2,3,4,1,5] => 4
[1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => [5,1,2,3,4] => [2,3,4,5,1] => 4
[1,1,0,1,0,1,1,0,0,0] => [2,3,5,4,1] => [5,4,1,2,3] => [3,4,5,2,1] => 7
[1,1,0,1,1,0,0,0,1,0] => [2,4,3,1,5] => [4,3,1,2,5] => [3,4,2,1,5] => 7
[1,1,0,1,1,0,0,1,0,0] => [2,4,3,5,1] => [5,1,2,4,3] => [2,3,5,4,1] => 5
[1,1,0,1,1,0,1,0,0,0] => [2,4,5,3,1] => [5,3,1,2,4] => [3,4,2,5,1] => 7
[1,1,0,1,1,1,0,0,0,0] => [2,5,4,3,1] => [5,4,3,1,2] => [4,5,3,2,1] => 9
[1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => [3,2,1,4,5] => [3,2,1,4,5] => 7
[1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => [3,2,1,5,4] => [3,2,1,5,4] => 8
[1,1,1,0,0,1,0,0,1,0] => [3,2,4,1,5] => [4,1,3,2,5] => [2,4,3,1,5] => 6
[1,1,1,0,0,1,0,1,0,0] => [3,2,4,5,1] => [5,1,3,2,4] => [2,4,3,5,1] => 6
[1,1,1,0,0,1,1,0,0,0] => [3,2,5,4,1] => [5,4,1,3,2] => [3,5,4,2,1] => 8
[1,1,1,0,1,0,0,0,1,0] => [3,4,2,1,5] => [4,2,1,3,5] => [3,2,4,1,5] => 7
[1,1,1,0,1,0,0,1,0,0] => [3,4,2,5,1] => [5,1,4,2,3] => [2,4,5,3,1] => 6
[1,1,1,0,1,0,1,0,0,0] => [3,4,5,2,1] => [5,2,1,3,4] => [3,2,4,5,1] => 7
[1,1,1,0,1,1,0,0,0,0] => [3,5,4,2,1] => [5,4,2,1,3] => [4,3,5,2,1] => 9
[1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => [4,3,2,1,5] => [4,3,2,1,5] => 9
[1,1,1,1,0,0,0,1,0,0] => [4,3,2,5,1] => [5,1,4,3,2] => [2,5,4,3,1] => 7
[1,1,1,1,0,0,1,0,0,0] => [4,3,5,2,1] => [5,2,1,4,3] => [3,2,5,4,1] => 8
[1,1,1,1,0,1,0,0,0,0] => [4,5,3,2,1] => [5,3,2,1,4] => [4,3,2,5,1] => 9
[1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => [5,4,3,2,1] => [5,4,3,2,1] => 10
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => [1,2,3,4,5,6] => [1,2,3,4,5,6] => 0
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => [1,2,3,4,6,5] => [1,2,3,4,6,5] => 1
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => [1,2,3,5,4,6] => [1,2,3,5,4,6] => 2
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,2,3,5,6,4] => [1,2,3,6,4,5] => [1,2,3,5,6,4] => 2
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => [1,2,3,6,5,4] => [1,2,3,6,5,4] => 3
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => [1,2,4,3,5,6] => [1,2,4,3,5,6] => 3
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [1,2,4,3,6,5] => [1,2,4,3,6,5] => 4
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,2,4,5,3,6] => [1,2,5,3,4,6] => [1,2,4,5,3,6] => 3
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,2,4,5,6,3] => [1,2,6,3,4,5] => [1,2,4,5,6,3] => 3
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,2,4,6,5,3] => [1,2,6,5,3,4] => [1,2,5,6,4,3] => 5
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => [1,2,5,4,3,6] => [1,2,5,4,3,6] => 5
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,2,5,4,6,3] => [1,2,6,3,5,4] => [1,2,4,6,5,3] => 4
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,2,5,6,4,3] => [1,2,6,4,3,5] => [1,2,5,4,6,3] => 5
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => [1,2,6,5,4,3] => [1,2,6,5,4,3] => 6
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => [1,3,2,4,5,6] => [1,3,2,4,5,6] => 4
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => [1,3,2,4,6,5] => [1,3,2,4,6,5] => 5
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => [1,3,2,5,4,6] => [1,3,2,5,4,6] => 6
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,3,2,5,6,4] => [1,3,2,6,4,5] => [1,3,2,5,6,4] => 6
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => [1,3,2,6,5,4] => [1,3,2,6,5,4] => 7
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,3,4,2,5,6] => [1,4,2,3,5,6] => [1,3,4,2,5,6] => 4
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,3,4,2,6,5] => [1,4,2,3,6,5] => [1,3,4,2,6,5] => 5
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,3,4,5,2,6] => [1,5,2,3,4,6] => [1,3,4,5,2,6] => 4
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,3,4,5,6,2] => [1,6,2,3,4,5] => [1,3,4,5,6,2] => 4
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,3,4,6,5,2] => [1,6,5,2,3,4] => [1,4,5,6,3,2] => 7
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,3,5,4,2,6] => [1,5,4,2,3,6] => [1,4,5,3,2,6] => 7
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,3,5,4,6,2] => [1,6,2,3,5,4] => [1,3,4,6,5,2] => 5
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,3,5,6,4,2] => [1,6,4,2,3,5] => [1,4,5,3,6,2] => 7
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,3,6,5,4,2] => [1,6,5,4,2,3] => [1,5,6,4,3,2] => 9
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,3,2,5,6] => [1,4,3,2,5,6] => [1,4,3,2,5,6] => 7
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => [1,4,3,2,6,5] => [1,4,3,2,6,5] => 8
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,4,3,5,2,6] => [1,5,2,4,3,6] => [1,3,5,4,2,6] => 6
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,4,3,5,6,2] => [1,6,2,4,3,5] => [1,3,5,4,6,2] => 6
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,4,3,6,5,2] => [1,6,5,2,4,3] => [1,4,6,5,3,2] => 8
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,4,5,3,2,6] => [1,5,3,2,4,6] => [1,4,3,5,2,6] => 7
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,4,5,3,6,2] => [1,6,2,5,3,4] => [1,3,5,6,4,2] => 6
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,4,5,6,3,2] => [1,6,3,2,4,5] => [1,4,3,5,6,2] => 7
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,4,6,5,3,2] => [1,6,5,3,2,4] => [1,5,4,6,3,2] => 9
>>> Load all 305 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 disorder of a permutation.
Consider a permutation $\pi = [\pi_1,\ldots,\pi_n]$ and cyclically scanning $\pi$ from left to right and remove the elements $1$ through $n$ on this order one after the other. The disorder of $\pi$ is defined to be the number of times a position was not removed in this process.
For example, the disorder of $[3,5,2,1,4]$ is $8$ since on the first scan, 3,5,2 and 4 are not removed, on the second, 3,5 and 4, and on the third and last scan, 5 is once again not removed.
Consider a permutation $\pi = [\pi_1,\ldots,\pi_n]$ and cyclically scanning $\pi$ from left to right and remove the elements $1$ through $n$ on this order one after the other. The disorder of $\pi$ is defined to be the number of times a position was not removed in this process.
For example, the disorder of $[3,5,2,1,4]$ is $8$ since on the first scan, 3,5,2 and 4 are not removed, on the second, 3,5 and 4, and on the third and last scan, 5 is once again not removed.
Map
inverse
Description
Sends a permutation to its inverse.
Map
to 312-avoiding permutation
Description
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!