Identifier
-
Mp00051:
Ordered trees
—to Dyck path⟶
Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001526: Dyck paths ⟶ ℤ
Values
[] => [] => [1,0] => [1,0] => 1
[[]] => [1,0] => [1,1,0,0] => [1,0,1,0] => 2
[[],[]] => [1,0,1,0] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 2
[[[]]] => [1,1,0,0] => [1,1,1,0,0,0] => [1,1,0,1,0,0] => 3
[[],[],[]] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => 2
[[],[[]]] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0] => 3
[[[]],[]] => [1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => 3
[[[],[]]] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,0,0] => 3
[[[[]]]] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,1,0,1,0,0,0] => 4
[[],[],[],[]] => [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] => 2
[[],[],[[]]] => [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] => 3
[[],[[]],[]] => [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] => 3
[[],[[],[]]] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => 3
[[],[[[]]]] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => 4
[[[]],[],[]] => [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] => 3
[[[]],[[]]] => [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] => 3
[[[],[]],[]] => [1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 3
[[[[]]],[]] => [1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => 4
[[[],[],[]]] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => 3
[[[],[[]]]] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => 4
[[[[]],[]]] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,1,1,0,1,0,0,1,0,0] => 4
[[[[],[]]]] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 4
[[[[[]]]]] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 5
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 Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
to Dyck path
Description
Return the Dyck path of the corresponding ordered tree induced by the recurrence of the Catalan numbers, see wikipedia:Catalan_number.
This sends the maximal height of the Dyck path to the depth of the tree.
This sends the maximal height of the Dyck path to the depth of the tree.
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.
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.
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!