Identifier
-
Mp00230:
Integer partitions
—parallelogram polyomino⟶
Dyck paths
Mp00121: Dyck paths —Cori-Le Borgne involution⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St000871: Permutations ⟶ ℤ
Values
[1] => [1,0] => [1,0] => [2,1] => 0
[2] => [1,0,1,0] => [1,0,1,0] => [3,1,2] => 0
[1,1] => [1,1,0,0] => [1,1,0,0] => [2,3,1] => 0
[3] => [1,0,1,0,1,0] => [1,0,1,0,1,0] => [4,1,2,3] => 0
[2,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => [4,3,1,2] => 0
[1,1,1] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => [3,1,4,2] => 1
[4] => [1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 0
[3,1] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0] => [5,4,1,2,3] => 0
[2,2] => [1,1,1,0,0,0] => [1,1,1,0,0,0] => [2,3,4,1] => 0
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,0] => [5,1,4,2,3] => 1
[1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => [4,1,2,5,3] => 1
[5] => [1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => [6,1,2,3,4,5] => 0
[4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => [5,6,1,2,3,4] => 0
[3,2] => [1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,0,0] => [5,3,4,1,2] => 0
[3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0] => [6,1,5,2,3,4] => 1
[2,2,1] => [1,1,1,0,0,1,0,0] => [1,1,1,0,0,0,1,0] => [2,3,5,1,4] => 1
[2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0] => [6,1,2,5,3,4] => 1
[1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => [5,1,2,3,6,4] => 1
[6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => [7,1,2,3,4,5,6] => 0
[5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [7,6,1,2,3,4,5] => 0
[4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [6,5,4,1,2,3] => 0
[3,3] => [1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 1
[3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => [6,3,4,1,2,5] => 1
[2,2,2] => [1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 0
[2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => [2,3,6,1,4,5] => 2
[1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [6,1,2,3,4,7,5] => 1
[7] => [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] => [8,1,2,3,4,5,6,7] => 0
[6,1] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [8,7,1,2,3,4,5,6] => 0
[4,3] => [1,0,1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => [6,1,4,5,2,3] => 1
[3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [3,1,4,6,2,5] => 2
[3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [6,3,4,5,1,2] => 0
[3,2,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0,1,0] => [7,3,4,1,2,5,6] => 1
[2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0] => [2,3,6,5,1,4] => 2
[1,1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [7,1,2,3,4,5,8,6] => 1
[8] => [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,0,1,0] => [9,1,2,3,4,5,6,7,8] => 0
[7,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0] => [8,9,1,2,3,4,5,6,7] => 0
[6,2] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,1,0,1,0,0,0] => [6,7,8,1,2,3,4,5] => 0
[4,4] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [4,1,2,5,6,3] => 1
[4,2,2] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [7,6,4,5,1,2,3] => 0
[3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [4,3,1,5,6,2] => 1
[2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => [3,1,4,5,6,2] => 1
[1,1,1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [8,1,2,3,4,5,6,9,7] => 1
[9] => [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,0,1,0,1,0,1,0] => [10,1,2,3,4,5,6,7,8,9] => 0
[8,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0] => [10,9,1,2,3,4,5,6,7,8] => 0
[7,2] => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,1,0,1,0,1,0,0,0] => [9,7,8,1,2,3,4,5,6] => 0
[3,3,3] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [2,3,4,5,6,1] => 0
[1,1,1,1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [9,1,2,3,4,5,6,7,10,8] => 1
[10] => [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,0,1,0,1,0,1,0,1,0,1,0] => [11,1,2,3,4,5,6,7,8,9,10] => 0
[8,2] => [1,0,1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,0] => [10,9,8,1,2,3,4,5,6,7] => 0
[6,4] => [1,0,1,0,1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,1,0,1,0,0,0] => [8,1,2,7,6,3,4,5] => 1
[5,5] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [5,1,2,3,6,7,4] => 1
[7,2,2] => [1,0,1,0,1,0,1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,1,0,1,0,1,0,1,0,1,0,0,0,0] => [7,8,9,10,1,2,3,4,5,6] => 0
[5,3,3] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,1,0,1,0,0,0,0,0] => [8,7,4,5,6,1,2,3] => 0
[3,3,3,2] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => [2,3,4,5,7,1,6] => 1
[4,4,3,1] => [1,1,1,0,1,1,1,0,0,0,0,1,0,0] => [1,1,1,0,1,1,1,0,0,0,1,0,0,0] => [8,3,4,1,6,7,2,5] => 2
[3,3,3,3] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [2,3,4,5,6,7,1] => 0
[4,4,4,4] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,1] => 0
[] => [] => [] => [1] => 0
[4,4,4,4,4] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 0
[5,5,5,5,5,5] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 0
[5,5,5,5,5] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,1] => 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 very big ascents of a permutation.
A very big ascent of a permutation $\pi$ is an index $i$ such that $\pi_{i+1} - \pi_i > 2$.
For the number of ascents, see St000245The number of ascents of a permutation. and for the number of big ascents, see St000646The number of big ascents of a permutation.. General $r$-ascents were for example be studied in [1, Section 2].
A very big ascent of a permutation $\pi$ is an index $i$ such that $\pi_{i+1} - \pi_i > 2$.
For the number of ascents, see St000245The number of ascents of a permutation. and for the number of big ascents, see St000646The number of big ascents of a permutation.. General $r$-ascents were for example be studied in [1, Section 2].
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
parallelogram polyomino
Description
Return the Dyck path corresponding to the partition interpreted as a parallogram polyomino.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.
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!