Identifier
Values
[2] => [1,1,0,0,1,0] => [1,1,0,0,1,0] => [1,0,1,1,0,0] => 2
[1,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 3
[3] => [1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => 3
[1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,0,0] => 3
[4] => [1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,0,1,0,0,0] => [1,1,1,0,1,0,0,1,0,0] => 3
[3,1] => [1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 2
[2,2] => [1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => 3
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,0] => 3
[1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 3
[4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => 3
[3,2] => [1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => 2
[3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0] => 3
[2,2,1] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => 3
[2,1,1,1] => [1,0,1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => 3
[4,2] => [1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => 3
[4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => 3
[3,3] => [1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 3
[3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => 3
[2,2,2] => [1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,0,0,1,0,0] => 3
[2,2,1,1] => [1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => 4
[4,3] => [1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 3
[4,2,1] => [1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 2
[4,1,1,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 4
[3,3,1] => [1,1,0,1,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => 3
[3,2,2] => [1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
[3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => 3
[2,2,2,1] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => 4
[4,3,1] => [1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => 2
[4,2,2] => [1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => 3
[4,2,1,1] => [1,0,1,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => 3
[3,3,2] => [1,1,0,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => 3
[3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => 3
[3,2,2,1] => [1,0,1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => 3
[4,3,2] => [1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 2
[4,3,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0] => 3
[4,2,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => 3
[3,3,2,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 3
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
click to show known generating functions       
Description
The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$.
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.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
Map
peaks-to-valleys
Description
Return the path that has a valley wherever the original path has a peak of height at least one.
More precisely, the height of a valley in the image is the height of the corresponding peak minus $2$.
This is also (the inverse of) rowmotion on Dyck paths regarded as order ideals in the triangular poset.