Identifier
-
Mp00199:
Dyck paths
—prime Dyck path⟶
Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St000120: Dyck paths ⟶ ℤ
Values
[1,0] => [1,1,0,0] => [1,1,1,0,0,0] => 0
[1,0,1,0] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => 1
[1,1,0,0] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => 0
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => 1
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => 1
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => 2
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 1
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => 0
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => 2
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => 2
[1,0,1,1,0,0,1,0] => [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,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,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => 1
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => 2
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => 2
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => 2
[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,1,0,0,0,0] => 1
[1,1,0,1,1,0,0,0] => [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,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 3
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 2
[1,1,1,0,1,0,0,0] => [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,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => 0
[] => [1,0] => [1,1,0,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
The number of left tunnels of a Dyck path.
A tunnel is a pair (a,b) where a is the position of an open parenthesis and b is the position of the matching close parenthesis. If a+b<n then the tunnel is called left.
A tunnel is a pair (a,b) where a is the position of an open parenthesis and b is the position of the matching close parenthesis. If a+b<n then the tunnel is called left.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
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!