Identifier
-
Mp00143:
Dyck paths
—inverse promotion⟶
Dyck paths
St000117: Dyck paths ⟶ ℤ
Values
[1,0] => [1,0] => 1
[1,0,1,0] => [1,1,0,0] => 2
[1,1,0,0] => [1,0,1,0] => 0
[1,0,1,0,1,0] => [1,1,0,1,0,0] => 1
[1,0,1,1,0,0] => [1,1,1,0,0,0] => 3
[1,1,0,0,1,0] => [1,0,1,1,0,0] => 0
[1,1,0,1,0,0] => [1,0,1,0,1,0] => 1
[1,1,1,0,0,0] => [1,1,0,0,1,0] => 0
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => 2
[1,0,1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => 1
[1,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => 1
[1,0,1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => 2
[1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => 4
[1,1,0,0,1,0,1,0] => [1,0,1,1,0,1,0,0] => 1
[1,1,0,0,1,1,0,0] => [1,0,1,1,1,0,0,0] => 0
[1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0] => 0
[1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => 0
[1,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,0] => 2
[1,1,1,0,0,0,1,0] => [1,1,0,0,1,1,0,0] => 0
[1,1,1,0,0,1,0,0] => [1,1,0,0,1,0,1,0] => 0
[1,1,1,0,1,0,0,0] => [1,1,0,1,0,0,1,0] => 1
[1,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0] => 0
[1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 1
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => 1
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => 3
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => 2
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => 1
[1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => 1
[1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => 1
[1,0,1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => 2
[1,0,1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => 3
[1,0,1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => 2
[1,0,1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => 1
[1,0,1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => 2
[1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 3
[1,0,1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => 5
[1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,1,0,1,0,0] => 0
[1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,1,1,0,0,0] => 0
[1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,1,0,0,1,0,0] => 2
[1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,1,0,1,0,0,0] => 1
[1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => 0
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,1,0,0] => 0
[1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,1,1,0,0,0] => 0
[1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => 1
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 1
[1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => 0
[1,1,0,1,1,0,0,0,1,0] => [1,0,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,0,1,0] => 0
[1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => 1
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => 3
[1,1,1,0,0,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,0] => 0
[1,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 0
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => 1
[1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => 1
[1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0] => 0
[1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => 0
[1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 0
[1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0] => 0
[1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,0,0,0,1,0] => 2
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 0
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => 0
[1,1,1,1,0,0,1,0,0,0] => [1,1,1,0,0,1,0,0,1,0] => 0
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,1,0,0,0,1,0] => 1
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,0,0,0,1,0] => 0
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 2
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 2
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => 1
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => 1
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => 1
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => 1
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => 1
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => 2
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => 1
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => 1
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => 4
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => 3
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => 2
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => 1
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => 2
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => 2
[1,0,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,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,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => 1
[1,0,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,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,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,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,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,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => 3
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => 4
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => 3
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => 2
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => 1
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => 1
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => 1
[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,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,0,1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => 2
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => 3
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => 4
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => 3
>>> 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 centered 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 centered.
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 centered.
Map
inverse promotion
Description
The inverse promotion of a Dyck path.
This is the bijection obtained by applying the inverse of Schützenberger's promotion to the corresponding two rowed standard Young tableau.
This is the bijection obtained by applying the inverse of Schützenberger's promotion to the corresponding two rowed standard Young tableau.
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!