Identifier
-
Mp00099:
Dyck paths
—bounce path⟶
Dyck paths
St000443: Dyck paths ⟶ ℤ (values match St000024The number of double up and double down steps of a Dyck path., St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path., St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra., St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra.)
Values
[1,0] => [1,0] => 1
[1,0,1,0] => [1,0,1,0] => 1
[1,1,0,0] => [1,1,0,0] => 2
[1,0,1,0,1,0] => [1,0,1,0,1,0] => 1
[1,0,1,1,0,0] => [1,0,1,1,0,0] => 2
[1,1,0,0,1,0] => [1,1,0,0,1,0] => 2
[1,1,0,1,0,0] => [1,0,1,1,0,0] => 2
[1,1,1,0,0,0] => [1,1,1,0,0,0] => 3
[1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => 1
[1,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,0] => 2
[1,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => 2
[1,0,1,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => 2
[1,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => 3
[1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => 2
[1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0] => 3
[1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => 2
[1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0] => 3
[1,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0] => 3
[1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0] => 3
[1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0] => 3
[1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => 3
[1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => 4
[1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => 1
[1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => 2
[1,0,1,0,1,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => 2
[1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => 2
[1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => 3
[1,0,1,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => 2
[1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => 3
[1,0,1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => 2
[1,0,1,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => 3
[1,0,1,1,0,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => 3
[1,0,1,1,1,0,0,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,0,1,1,0,0,1,1,0,0] => 3
[1,0,1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => 3
[1,0,1,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => 4
[1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => 2
[1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => 3
[1,1,0,0,1,1,0,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,0,0,1,0,1,1,0,0] => 3
[1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => 4
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => 2
[1,1,0,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => 3
[1,1,0,1,0,1,0,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,0,1,1,0,0,1,1,0,0] => 3
[1,1,0,1,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => 4
[1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => 3
[1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => 3
[1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => 4
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => 4
[1,1,1,0,0,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,0,0,0,1,1,0,0] => 4
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => 3
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => 4
[1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => 4
[1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => 3
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => 4
[1,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => 4
[1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => 4
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => 4
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => 4
[1,1,1,1,0,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => 4
[1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => 4
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => 5
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 1
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => 2
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => 2
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => 2
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => 3
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => 2
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => 3
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => 2
[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,0,1,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => 3
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => 3
[1,0,1,0,1,1,1,0,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,1,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => 3
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => 4
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => 2
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => 3
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => 3
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => 3
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => 4
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => 2
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => 3
[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,1,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => 3
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => 4
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => 3
[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,1,0,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => 4
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => 4
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => 3
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => 4
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => 3
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => 4
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => 4
[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,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => 4
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => 4
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => 4
>>> Load all 196 entries. <<<
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 number of long tunnels of a Dyck path.
A long tunnel of a Dyck path is a longest sequence of consecutive usual tunnels, i.e., a longest sequence of tunnels where the end point of one is the starting point of the next. See [1] for the definition of tunnels.
A long tunnel of a Dyck path is a longest sequence of consecutive usual tunnels, i.e., a longest sequence of tunnels where the end point of one is the starting point of the next. See [1] for the definition of tunnels.
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!