Identifier
-
Mp00231:
Integer compositions
—bounce path⟶
Dyck paths
Mp00121: Dyck paths —Cori-Le Borgne involution⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000486: Permutations ⟶ ℤ
Values
[1,1] => [1,0,1,0] => [1,0,1,0] => [1,2] => 0
[2] => [1,1,0,0] => [1,1,0,0] => [2,1] => 0
[1,1,1] => [1,0,1,0,1,0] => [1,0,1,0,1,0] => [1,2,3] => 0
[1,2] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => [2,3,1] => 1
[2,1] => [1,1,0,0,1,0] => [1,1,0,0,1,0] => [2,1,3] => 0
[3] => [1,1,1,0,0,0] => [1,1,1,0,0,0] => [3,2,1] => 0
[1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => 0
[1,1,2] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0] => [2,3,4,1] => 1
[1,2,1] => [1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,0] => [2,3,1,4] => 1
[1,3] => [1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,0,0] => [4,2,3,1] => 0
[2,1,1] => [1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => 0
[2,2] => [1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => 0
[3,1] => [1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,0,0] => [3,2,4,1] => 1
[4] => [1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => [4,3,2,1] => 0
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => 0
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => 1
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => 1
[1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [5,2,3,4,1] => 0
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => 1
[1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => 1
[1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [4,2,3,5,1] => 1
[1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [5,3,4,2,1] => 1
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => 0
[2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => 1
[2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => 0
[2,3] => [1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,0,0,0] => [3,2,5,4,1] => 1
[3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [3,2,4,5,1] => 1
[3,2] => [1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => 0
[4,1] => [1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,0,1,0,0,0] => [5,3,2,4,1] => 0
[5] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => 0
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => 0
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [2,3,4,5,6,1] => 1
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => [2,3,4,5,1,6] => 1
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [6,2,3,4,5,1] => 0
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => [2,3,4,1,5,6] => 1
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => [2,1,4,5,6,3] => 1
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [5,2,3,4,6,1] => 1
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [6,3,4,5,2,1] => 1
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => [2,3,1,4,5,6] => 1
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,1,0,0] => [2,3,1,5,6,4] => 2
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => [2,1,4,5,3,6] => 1
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => [3,2,6,4,5,1] => 1
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [4,2,3,5,6,1] => 1
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,1,0,0,0,1,1,0,0] => [4,2,3,1,6,5] => 0
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [6,3,4,2,5,1] => 1
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [6,5,3,4,2,1] => 0
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => [2,1,3,4,5,6] => 0
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => [2,3,4,1,6,5] => 1
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0,1,0] => [2,3,1,5,4,6] => 1
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => [4,2,3,6,5,1] => 1
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [2,1,4,3,5,6] => 0
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => [2,1,4,3,6,5] => 0
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [3,2,5,4,6,1] => 1
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [6,3,2,5,4,1] => 0
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [3,2,4,5,6,1] => 1
[3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,1,0,0] => [3,2,1,5,6,4] => 1
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,1,0,0] => [3,2,4,1,6,5] => 1
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => [3,2,1,6,5,4] => 0
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [6,3,2,4,5,1] => 0
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [4,3,2,6,5,1] => 1
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [6,4,3,5,2,1] => 1
[6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [6,5,4,3,2,1] => 0
[1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6,7] => 0
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 cycles of length at least 3 of a permutation.
Map
Cori-Le Borgne involution
Description
The Cori-Le Borgne involution on Dyck paths.
Append an additional down step to the Dyck path and consider its (literal) reversal. The image of the involution is then the unique rotation of this word which is a Dyck word followed by an additional down step. Alternatively, it is the composite $\zeta\circ\mathrm{rev}\circ\zeta^{(-1)}$, where $\zeta$ is Mp00030zeta map.
Append an additional down step to the Dyck path and consider its (literal) reversal. The image of the involution is then the unique rotation of this word which is a Dyck word followed by an additional down step. Alternatively, it is the composite $\zeta\circ\mathrm{rev}\circ\zeta^{(-1)}$, where $\zeta$ is Mp00030zeta map.
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
bounce path
Description
The bounce path determined by an integer composition.
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!