Identifier
-
Mp00023:
Dyck paths
—to non-crossing permutation⟶
Permutations
Mp00064: Permutations —reverse⟶ Permutations
St000001: Permutations ⟶ ℤ
Values
[1,0] => [1] => [1] => 1
[1,0,1,0] => [1,2] => [2,1] => 1
[1,1,0,0] => [2,1] => [1,2] => 1
[1,0,1,0,1,0] => [1,2,3] => [3,2,1] => 2
[1,0,1,1,0,0] => [1,3,2] => [2,3,1] => 1
[1,1,0,0,1,0] => [2,1,3] => [3,1,2] => 1
[1,1,0,1,0,0] => [2,3,1] => [1,3,2] => 1
[1,1,1,0,0,0] => [3,2,1] => [1,2,3] => 1
[1,0,1,0,1,0,1,0] => [1,2,3,4] => [4,3,2,1] => 16
[1,0,1,0,1,1,0,0] => [1,2,4,3] => [3,4,2,1] => 5
[1,0,1,1,0,0,1,0] => [1,3,2,4] => [4,2,3,1] => 6
[1,0,1,1,0,1,0,0] => [1,3,4,2] => [2,4,3,1] => 3
[1,0,1,1,1,0,0,0] => [1,4,3,2] => [2,3,4,1] => 1
[1,1,0,0,1,0,1,0] => [2,1,3,4] => [4,3,1,2] => 5
[1,1,0,0,1,1,0,0] => [2,1,4,3] => [3,4,1,2] => 2
[1,1,0,1,0,0,1,0] => [2,3,1,4] => [4,1,3,2] => 3
[1,1,0,1,0,1,0,0] => [2,3,4,1] => [1,4,3,2] => 2
[1,1,0,1,1,0,0,0] => [2,4,3,1] => [1,3,4,2] => 1
[1,1,1,0,0,0,1,0] => [3,2,1,4] => [4,1,2,3] => 1
[1,1,1,0,0,1,0,0] => [3,2,4,1] => [1,4,2,3] => 1
[1,1,1,0,1,0,0,0] => [4,2,3,1] => [1,3,2,4] => 1
[1,1,1,1,0,0,0,0] => [4,3,2,1] => [1,2,3,4] => 1
[1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => [5,4,3,2,1] => 768
[1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => [4,5,3,2,1] => 168
[1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => [5,3,4,2,1] => 216
[1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => [3,5,4,2,1] => 70
[1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => [3,4,5,2,1] => 14
[1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => [5,4,2,3,1] => 216
[1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [4,5,2,3,1] => 56
[1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => [5,2,4,3,1] => 90
[1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => [2,5,4,3,1] => 35
[1,0,1,1,0,1,1,0,0,0] => [1,3,5,4,2] => [2,4,5,3,1] => 9
[1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => [5,2,3,4,1] => 20
[1,0,1,1,1,0,0,1,0,0] => [1,4,3,5,2] => [2,5,3,4,1] => 10
[1,0,1,1,1,0,1,0,0,0] => [1,5,3,4,2] => [2,4,3,5,1] => 4
[1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => [2,3,4,5,1] => 1
[1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => [5,4,3,1,2] => 168
[1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => [4,5,3,1,2] => 42
[1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => [5,3,4,1,2] => 56
[1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => [3,5,4,1,2] => 21
[1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [3,4,5,1,2] => 5
[1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => [5,4,1,3,2] => 70
[1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => [4,5,1,3,2] => 21
[1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => [5,1,4,3,2] => 35
[1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => [1,5,4,3,2] => 16
[1,1,0,1,0,1,1,0,0,0] => [2,3,5,4,1] => [1,4,5,3,2] => 5
[1,1,0,1,1,0,0,0,1,0] => [2,4,3,1,5] => [5,1,3,4,2] => 10
[1,1,0,1,1,0,0,1,0,0] => [2,4,3,5,1] => [1,5,3,4,2] => 6
[1,1,0,1,1,0,1,0,0,0] => [2,5,3,4,1] => [1,4,3,5,2] => 3
[1,1,0,1,1,1,0,0,0,0] => [2,5,4,3,1] => [1,3,4,5,2] => 1
[1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => [5,4,1,2,3] => 14
[1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => [4,5,1,2,3] => 5
[1,1,1,0,0,1,0,0,1,0] => [3,2,4,1,5] => [5,1,4,2,3] => 9
[1,1,1,0,0,1,0,1,0,0] => [3,2,4,5,1] => [1,5,4,2,3] => 5
[1,1,1,0,0,1,1,0,0,0] => [3,2,5,4,1] => [1,4,5,2,3] => 2
[1,1,1,0,1,0,0,0,1,0] => [4,2,3,1,5] => [5,1,3,2,4] => 4
[1,1,1,0,1,0,0,1,0,0] => [4,2,3,5,1] => [1,5,3,2,4] => 3
[1,1,1,0,1,0,1,0,0,0] => [5,2,3,4,1] => [1,4,3,2,5] => 2
[1,1,1,0,1,1,0,0,0,0] => [5,2,4,3,1] => [1,3,4,2,5] => 1
[1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => [5,1,2,3,4] => 1
[1,1,1,1,0,0,0,1,0,0] => [4,3,2,5,1] => [1,5,2,3,4] => 1
[1,1,1,1,0,0,1,0,0,0] => [5,3,2,4,1] => [1,4,2,3,5] => 1
[1,1,1,1,0,1,0,0,0,0] => [5,3,4,2,1] => [1,2,4,3,5] => 1
[1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => [1,2,3,4,5] => 1
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => [6,5,4,3,2,1] => 292864
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => [5,6,4,3,2,1] => 48048
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => [6,4,5,3,2,1] => 64064
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,2,3,5,6,4] => [4,6,5,3,2,1] => 15015
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => [4,5,6,3,2,1] => 2112
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => [6,5,3,4,2,1] => 68640
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [5,6,3,4,2,1] => 12870
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,2,4,5,3,6] => [6,3,5,4,2,1] => 21450
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,2,4,5,6,3] => [3,6,5,4,2,1] => 5775
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,2,4,6,5,3] => [3,5,6,4,2,1] => 990
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => [6,3,4,5,2,1] => 3520
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,2,5,4,6,3] => [3,6,4,5,2,1] => 1155
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,2,6,4,5,3] => [3,5,4,6,2,1] => 288
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => [3,4,5,6,2,1] => 42
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => [6,5,4,2,3,1] => 64064
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => [5,6,4,2,3,1] => 11583
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => [6,4,5,2,3,1] => 16016
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,3,2,5,6,4] => [4,6,5,2,3,1] => 4158
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => [4,5,6,2,3,1] => 660
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,3,4,2,5,6] => [6,5,2,4,3,1] => 21450
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,3,4,2,6,5] => [5,6,2,4,3,1] => 4455
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,3,4,5,2,6] => [6,2,5,4,3,1] => 7700
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,3,4,5,6,2] => [2,6,5,4,3,1] => 2310
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,3,4,6,5,2] => [2,5,6,4,3,1] => 450
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,3,5,4,2,6] => [6,2,4,5,3,1] => 1540
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,3,5,4,6,2] => [2,6,4,5,3,1] => 567
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,3,6,4,5,2] => [2,5,4,6,3,1] => 162
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,3,6,5,4,2] => [2,4,5,6,3,1] => 28
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,3,2,5,6] => [6,5,2,3,4,1] => 3520
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => [5,6,2,3,4,1] => 825
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,4,3,5,2,6] => [6,2,5,3,4,1] => 1540
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,4,3,5,6,2] => [2,6,5,3,4,1] => 525
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,4,3,6,5,2] => [2,5,6,3,4,1] => 120
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,5,3,4,2,6] => [6,2,4,3,5,1] => 448
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,5,3,4,6,2] => [2,6,4,3,5,1] => 189
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,6,3,4,5,2] => [2,5,4,3,6,1] => 64
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,6,3,5,4,2] => [2,4,5,3,6,1] => 14
>>> Load all 248 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 reduced words for a permutation.
This is the number of ways to write a permutation as a minimal length product of simple transpositions. E.g., there are two reduced words for the permutation $[3,2,1]$, which are $(1,2)(2,3)(1,2) = (2,3)(1,2)(2,3)$.
This is the number of ways to write a permutation as a minimal length product of simple transpositions. E.g., there are two reduced words for the permutation $[3,2,1]$, which are $(1,2)(2,3)(1,2) = (2,3)(1,2)(2,3)$.
Map
to non-crossing permutation
Description
Sends a Dyck path $D$ with valley at positions $\{(i_1,j_1),\ldots,(i_k,j_k)\}$ to the unique non-crossing permutation $\pi$ having descents $\{i_1,\ldots,i_k\}$ and whose inverse has descents $\{j_1,\ldots,j_k\}$.
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to $n(n-1)$ minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to $n(n-1)$ minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
Map
reverse
Description
Sends a permutation to its reverse.
The reverse of a permutation $\sigma$ of length $n$ is given by $\tau$ with $\tau(i) = \sigma(n+1-i)$.
The reverse of a permutation $\sigma$ of length $n$ is given by $\tau$ with $\tau(i) = \sigma(n+1-i)$.
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!