Processing math: 100%

Identifier
Values
[1,0] => [1,1,0,0] => [1,0,1,0] => [1,0,1,0] => 4
[1,0,1,0] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => [1,0,1,0,1,0] => 5
[1,1,0,0] => [1,1,1,0,0,0] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => 6
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => 6
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,0] => 7
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => 7
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => 9
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => 7
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 7
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0] => 8
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,0,1,0] => 8
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => 10
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0] => 8
[1,1,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] => [1,0,1,1,0,0,1,0,1,0] => 8
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 10
[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,0,1,1,1,0,0,1,0,0] => 10
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => 13
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => 10
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => 8
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,1,1,0,0,0] => 9
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => 8
[1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => 10
[] => [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 indecomposable modules with projective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path.
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 ζrevζ(1), where ζ is Mp00030zeta map.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
Delest-Viennot-inverse
Description
Return the Dyck path obtained by applying the inverse of Delest-Viennot's bijection to the corresponding parallelogram polyomino.
Let D be a Dyck path of semilength n. The parallelogram polyomino γ(D) is defined as follows: let ˜D=d0d1d2n+1 be the Dyck path obtained by prepending an up step and appending a down step to D. Then, the upper path of γ(D) corresponds to the sequence of steps of ˜D with even indices, and the lower path of γ(D) corresponds to the sequence of steps of ˜D with odd indices.
The Delest-Viennot bijection β returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path (β(1)γ)(D).