Processing math: 100%

Identifier
Values
[1,0] => [1,0] => [1,1,0,0] => [1,0,1,0] => 0
[1,0,1,0] => [1,1,0,0] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => 0
[1,1,0,0] => [1,0,1,0] => [1,1,0,1,0,0] => [1,1,0,0,1,0] => 1
[1,0,1,0,1,0] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 0
[1,0,1,1,0,0] => [1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,1,1,0,0,0,1,0] => 1
[1,1,0,0,1,0] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => 1
[1,1,0,1,0,0] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,0,1,1,0,0,1,0] => 1
[1,1,1,0,0,0] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0] => 2
[1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 0
[1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => 1
[1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => 1
[1,0,1,1,0,1,0,0] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => 1
[1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => 2
[1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => 1
[1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 2
[1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => 1
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => 1
[1,1,0,1,1,0,0,0] => [1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => 1
[1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => 2
[1,1,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0] => 2
[1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => 2
[1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 3
[] => [] => [1,0] => [1,0] => 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
click to show known generating functions       
Description
The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path.
The statistic returns zero in case that bimodule is the zero module.
Map
Lalanne-Kreweras involution
Description
The Lalanne-Kreweras involution on Dyck paths.
Label the upsteps from left to right and record the labels on the first up step of each double rise. Do the same for the downsteps. Then form the Dyck path whose ascent lengths and descent lengths are the consecutives differences of the labels.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
swap returns and last descent
Description
Return a Dyck path with number of returns and length of the last descent interchanged.
This is the specialisation of the map Φ in [1] to Dyck paths. It is characterised by the fact that the number of up steps before a down step that is neither a return nor part of the last descent is preserved.