Identifier
-
Mp00023:
Dyck paths
—to non-crossing permutation⟶
Permutations
Mp00069: Permutations —complement⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000365: Permutations ⟶ ℤ
Values
[1,0] => [1] => [1] => [1] => 0
[1,0,1,0] => [1,2] => [2,1] => [2,1] => 0
[1,1,0,0] => [2,1] => [1,2] => [1,2] => 0
[1,0,1,0,1,0] => [1,2,3] => [3,2,1] => [3,2,1] => 0
[1,0,1,1,0,0] => [1,3,2] => [3,1,2] => [1,3,2] => 0
[1,1,0,0,1,0] => [2,1,3] => [2,3,1] => [3,1,2] => 0
[1,1,0,1,0,0] => [2,3,1] => [2,1,3] => [2,1,3] => 0
[1,1,1,0,0,0] => [3,2,1] => [1,2,3] => [1,2,3] => 1
[1,0,1,0,1,0,1,0] => [1,2,3,4] => [4,3,2,1] => [4,3,2,1] => 0
[1,0,1,0,1,1,0,0] => [1,2,4,3] => [4,3,1,2] => [1,4,3,2] => 0
[1,0,1,1,0,0,1,0] => [1,3,2,4] => [4,2,3,1] => [4,1,3,2] => 0
[1,0,1,1,0,1,0,0] => [1,3,4,2] => [4,2,1,3] => [3,1,4,2] => 0
[1,0,1,1,1,0,0,0] => [1,4,3,2] => [4,1,2,3] => [1,2,4,3] => 1
[1,1,0,0,1,0,1,0] => [2,1,3,4] => [3,4,2,1] => [4,3,1,2] => 0
[1,1,0,0,1,1,0,0] => [2,1,4,3] => [3,4,1,2] => [1,4,2,3] => 0
[1,1,0,1,0,0,1,0] => [2,3,1,4] => [3,2,4,1] => [4,2,1,3] => 0
[1,1,0,1,0,1,0,0] => [2,3,4,1] => [3,2,1,4] => [3,2,1,4] => 0
[1,1,0,1,1,0,0,0] => [2,4,3,1] => [3,1,2,4] => [1,3,2,4] => 0
[1,1,1,0,0,0,1,0] => [3,2,1,4] => [2,3,4,1] => [4,1,2,3] => 1
[1,1,1,0,0,1,0,0] => [3,2,4,1] => [2,3,1,4] => [3,1,2,4] => 1
[1,1,1,0,1,0,0,0] => [4,2,3,1] => [1,3,2,4] => [2,3,1,4] => 0
[1,1,1,1,0,0,0,0] => [4,3,2,1] => [1,2,3,4] => [1,2,3,4] => 2
[1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => [5,4,3,2,1] => [5,4,3,2,1] => 0
[1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => [5,4,3,1,2] => [1,5,4,3,2] => 0
[1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => [5,4,2,3,1] => [5,1,4,3,2] => 0
[1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => [5,4,2,1,3] => [4,1,5,3,2] => 0
[1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => [5,4,1,2,3] => [1,2,5,4,3] => 1
[1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => [5,3,4,2,1] => [5,4,1,3,2] => 0
[1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [5,3,4,1,2] => [1,5,2,4,3] => 0
[1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => [5,3,2,4,1] => [5,3,1,4,2] => 0
[1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => [5,3,2,1,4] => [4,3,1,5,2] => 0
[1,0,1,1,0,1,1,0,0,0] => [1,3,5,4,2] => [5,3,1,2,4] => [1,4,2,5,3] => 0
[1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => [5,2,3,4,1] => [5,1,2,4,3] => 1
[1,0,1,1,1,0,0,1,0,0] => [1,4,3,5,2] => [5,2,3,1,4] => [4,1,2,5,3] => 1
[1,0,1,1,1,0,1,0,0,0] => [1,5,3,4,2] => [5,1,3,2,4] => [2,4,1,5,3] => 0
[1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => [5,1,2,3,4] => [1,2,3,5,4] => 2
[1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => [4,5,3,2,1] => [5,4,3,1,2] => 0
[1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => [4,5,3,1,2] => [1,5,4,2,3] => 0
[1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => [4,5,2,3,1] => [5,1,4,2,3] => 0
[1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => [4,5,2,1,3] => [4,1,5,2,3] => 0
[1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [4,5,1,2,3] => [1,2,5,3,4] => 1
[1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => [4,3,5,2,1] => [5,4,2,1,3] => 0
[1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => [4,3,5,1,2] => [1,5,3,2,4] => 0
[1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => [4,3,2,5,1] => [5,3,2,1,4] => 0
[1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => [4,3,2,1,5] => [4,3,2,1,5] => 0
[1,1,0,1,0,1,1,0,0,0] => [2,3,5,4,1] => [4,3,1,2,5] => [1,4,3,2,5] => 0
[1,1,0,1,1,0,0,0,1,0] => [2,4,3,1,5] => [4,2,3,5,1] => [5,1,3,2,4] => 0
[1,1,0,1,1,0,0,1,0,0] => [2,4,3,5,1] => [4,2,3,1,5] => [4,1,3,2,5] => 0
[1,1,0,1,1,0,1,0,0,0] => [2,5,3,4,1] => [4,1,3,2,5] => [2,4,3,1,5] => 0
[1,1,0,1,1,1,0,0,0,0] => [2,5,4,3,1] => [4,1,2,3,5] => [1,2,4,3,5] => 1
[1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => [3,4,5,2,1] => [5,4,1,2,3] => 1
[1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => [3,4,5,1,2] => [1,5,2,3,4] => 1
[1,1,1,0,0,1,0,0,1,0] => [3,2,4,1,5] => [3,4,2,5,1] => [5,3,1,2,4] => 1
[1,1,1,0,0,1,0,1,0,0] => [3,2,4,5,1] => [3,4,2,1,5] => [4,3,1,2,5] => 1
[1,1,1,0,0,1,1,0,0,0] => [3,2,5,4,1] => [3,4,1,2,5] => [1,4,2,3,5] => 1
[1,1,1,0,1,0,0,0,1,0] => [4,2,3,1,5] => [2,4,3,5,1] => [5,2,3,1,4] => 0
[1,1,1,0,1,0,0,1,0,0] => [4,2,3,5,1] => [2,4,3,1,5] => [4,2,3,1,5] => 0
[1,1,1,0,1,0,1,0,0,0] => [5,2,3,4,1] => [1,4,3,2,5] => [3,4,2,1,5] => 0
[1,1,1,0,1,1,0,0,0,0] => [5,2,4,3,1] => [1,4,2,3,5] => [2,1,4,3,5] => 0
[1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => [2,3,4,5,1] => [5,1,2,3,4] => 2
[1,1,1,1,0,0,0,1,0,0] => [4,3,2,5,1] => [2,3,4,1,5] => [4,1,2,3,5] => 2
[1,1,1,1,0,0,1,0,0,0] => [5,3,2,4,1] => [1,3,4,2,5] => [2,4,1,3,5] => 1
[1,1,1,1,0,1,0,0,0,0] => [5,3,4,2,1] => [1,3,2,4,5] => [2,3,1,4,5] => 1
[1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => [1,2,3,4,5] => [1,2,3,4,5] => 3
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => [6,5,4,3,2,1] => [6,5,4,3,2,1] => 0
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => [6,5,4,3,1,2] => [1,6,5,4,3,2] => 0
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => [6,5,4,2,3,1] => [6,1,5,4,3,2] => 0
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,2,3,5,6,4] => [6,5,4,2,1,3] => [5,1,6,4,3,2] => 0
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => [6,5,4,1,2,3] => [1,2,6,5,4,3] => 1
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => [6,5,3,4,2,1] => [6,5,1,4,3,2] => 0
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [6,5,3,4,1,2] => [1,6,2,5,4,3] => 0
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,2,4,5,3,6] => [6,5,3,2,4,1] => [6,4,1,5,3,2] => 0
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,2,4,5,6,3] => [6,5,3,2,1,4] => [5,4,1,6,3,2] => 0
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,2,4,6,5,3] => [6,5,3,1,2,4] => [1,5,2,6,4,3] => 0
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => [6,5,2,3,4,1] => [6,1,2,5,4,3] => 1
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,2,5,4,6,3] => [6,5,2,3,1,4] => [5,1,2,6,4,3] => 1
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,2,6,4,5,3] => [6,5,1,3,2,4] => [2,5,1,6,4,3] => 0
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => [6,5,1,2,3,4] => [1,2,3,6,5,4] => 2
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => [6,4,5,3,2,1] => [6,5,4,1,3,2] => 0
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => [6,4,5,3,1,2] => [1,6,5,2,4,3] => 0
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => [6,4,5,2,3,1] => [6,1,5,2,4,3] => 0
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,3,2,5,6,4] => [6,4,5,2,1,3] => [5,1,6,2,4,3] => 0
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => [6,4,5,1,2,3] => [1,2,6,3,5,4] => 1
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,3,4,2,5,6] => [6,4,3,5,2,1] => [6,5,3,1,4,2] => 0
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,3,4,2,6,5] => [6,4,3,5,1,2] => [1,6,4,2,5,3] => 0
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,3,4,5,2,6] => [6,4,3,2,5,1] => [6,4,3,1,5,2] => 0
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,3,4,5,6,2] => [6,4,3,2,1,5] => [5,4,3,1,6,2] => 0
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,3,4,6,5,2] => [6,4,3,1,2,5] => [1,5,4,2,6,3] => 0
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,3,5,4,2,6] => [6,4,2,3,5,1] => [6,1,4,2,5,3] => 0
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,3,5,4,6,2] => [6,4,2,3,1,5] => [5,1,4,2,6,3] => 0
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,3,6,4,5,2] => [6,4,1,3,2,5] => [2,5,4,1,6,3] => 0
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,3,6,5,4,2] => [6,4,1,2,3,5] => [1,2,5,3,6,4] => 1
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,3,2,5,6] => [6,3,4,5,2,1] => [6,5,1,2,4,3] => 1
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => [6,3,4,5,1,2] => [1,6,2,3,5,4] => 1
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,4,3,5,2,6] => [6,3,4,2,5,1] => [6,4,1,2,5,3] => 1
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,4,3,5,6,2] => [6,3,4,2,1,5] => [5,4,1,2,6,3] => 1
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,4,3,6,5,2] => [6,3,4,1,2,5] => [1,5,2,3,6,4] => 1
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,5,3,4,2,6] => [6,2,4,3,5,1] => [6,2,4,1,5,3] => 0
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,5,3,4,6,2] => [6,2,4,3,1,5] => [5,2,4,1,6,3] => 0
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,6,3,4,5,2] => [6,1,4,3,2,5] => [3,5,4,1,6,2] => 0
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,6,3,5,4,2] => [6,1,4,2,3,5] => [2,1,5,3,6,4] => 0
>>> Load all 232 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 double ascents of a permutation.
A double ascent of a permutation $\pi$ is a position $i$ such that $\pi(i) < \pi(i+1) < \pi(i+2)$.
A double ascent of a permutation $\pi$ is a position $i$ such that $\pi(i) < \pi(i+1) < \pi(i+2)$.
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
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
complement
Description
Sents a permutation to its complement.
The complement of a permutation $\sigma$ of length $n$ is the permutation $\tau$ with $\tau(i) = n+1-\sigma(i)$
The complement of a permutation $\sigma$ of length $n$ is the permutation $\tau$ with $\tau(i) = n+1-\sigma(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!