Identifier
-
Mp00199:
Dyck paths
—prime Dyck path⟶
Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St001169: Dyck paths ⟶ ℤ (values match St000015The number of peaks of a Dyck path., St000053The number of valleys of the Dyck path., St001068Number of torsionless simple modules in the corresponding Nakayama algebra.)
Values
[1,0] => [1,1,0,0] => [1,0,1,0] => [1,0,1,0] => 1
[1,0,1,0] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => [1,0,1,0,1,0] => 2
[1,1,0,0] => [1,1,1,0,0,0] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => 1
[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] => 3
[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,0,1,1,0,0] => 2
[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] => 2
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0] => 1
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => 1
[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] => 4
[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,0,1,0,1,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] => [1,0,1,0,1,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] => [1,0,1,1,0,0,1,1,0,0] => 2
[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] => [1,0,1,0,1,1,1,0,0,0] => 2
[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] => 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] => [1,0,1,1,0,0,1,1,0,0] => 2
[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] => [1,1,0,0,1,1,0,0,1,0] => 2
[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] => [1,0,1,1,0,0,1,1,0,0] => 2
[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] => [1,1,0,0,1,1,1,0,0,0] => 1
[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] => [1,0,1,1,1,0,0,0,1,0] => 2
[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] => [1,1,1,0,0,0,1,1,0,0] => 1
[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] => [1,1,0,0,1,1,1,0,0,0] => 1
[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] => [1,0,1,1,1,1,0,0,0,0] => 1
[1,0,1,0,1,0,1,0,1,0] => [1,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,0,1,0,1,0,1,0,1,0] => 5
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => 4
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => 4
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => 3
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => 3
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => 4
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,1,1,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => 3
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => 3
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [1,0,1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => 3
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [1,0,1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => 2
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [1,0,1,1,1,0,1,0,0,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => 3
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => 2
[1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,0,1,0,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => 2
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [1,0,1,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => 2
[1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => 4
[1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [1,1,0,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => 3
[1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => 3
[1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => 2
[1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => 2
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => 3
[1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => 2
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => 3
[1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => 2
[1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => 2
[1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0,1,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => 2
[1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => 2
[1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => 2
[1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 1
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => 3
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => 2
[1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [1,1,1,0,1,0,0,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => 2
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => 2
[1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 1
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0,1,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => 2
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => 2
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 1
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 1
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => 2
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => 1
[1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 1
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 1
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 1
[] => [1,0] => [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
Description
Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra.
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.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
bounce path
Description
Sends a Dyck path $D$ of length $2n$ to its bounce path.
This path is formed by starting at the endpoint $(n,n)$ of $D$ and travelling west until encountering the first vertical step of $D$, then south until hitting the diagonal, then west again to hit $D$, etc. until the point $(0,0)$ is reached.
This map is the first part of the zeta map Mp00030zeta map.
This path is formed by starting at the endpoint $(n,n)$ of $D$ and travelling west until encountering the first vertical step of $D$, then south until hitting the diagonal, then west again to hit $D$, etc. until the point $(0,0)$ is reached.
This map is the first part of the zeta map Mp00030zeta map.
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!