- FindStat

Identifier

Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
St000120: Dyck paths ⟶ ℤ

Values

[1,0] => [1,0] => [1,1,0,0] => [1,0,1,0] => 1
[1,0,1,0] => [1,1,0,0] => [1,1,1,0,0,0] => [1,0,1,1,0,0] => 1
[1,1,0,0] => [1,0,1,0] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 1
[1,0,1,0,1,0] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [1,0,1,1,0,1,0,0] => 1
[1,0,1,1,0,0] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,0,1,1,1,0,0,0] => 1
[1,1,0,0,1,0] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [1,0,1,0,1,1,0,0] => 2
[1,1,0,1,0,0] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => 2
[1,1,1,0,0,0] => [1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,0] => 1
[1,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,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,1,0,1,1,0,0,0,0] => [1,0,1,1,0,1,1,0,0,0] => 2
[1,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,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] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => 1
[1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0] => 1
[1,1,0,0,1,0,1,0] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => 2
[1,1,0,0,1,1,0,0] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => 2
[1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,1,0,0] => 2
[1,1,0,1,0,1,0,0] => [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,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [1,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] => [1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,0,0] => 3
[1,1,1,0,0,1,0,0] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => 3
[1,1,1,0,1,0,0,0] => [1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => 2
[1,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => 1
[1,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] => [1,0,1,1,0,1,0,1,0,1,0,0] => 2
[1,0,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] => [1,0,1,1,0,1,0,1,1,0,0,0] => 2
[1,0,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,0,1,1,0,1,1,0,0,1,0,0] => 2
[1,0,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,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,1,0,1,1,1,0,0,0,0,0] => [1,0,1,1,0,1,1,1,0,0,0,0] => 2
[1,0,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] => [1,0,1,1,1,0,0,1,0,1,0,0] => 3
[1,0,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] => [1,0,1,1,1,0,0,1,1,0,0,0] => 3
[1,0,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] => [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] => [1,1,1,1,0,1,0,1,0,0,0,0] => [1,0,1,1,1,0,1,0,1,0,0,0] => 2
[1,0,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,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,1,1,1,0,0,0,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] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,0,1,1,1,1,0,0,1,0,0,0] => 1
[1,0,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,0,1,1,1,1,0,1,0,0,0,0] => 1
[1,0,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] => [1,0,1,1,1,1,1,0,0,0,0,0] => 1
[1,1,0,0,1,0,1,0,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,0,1,0,1,1,0,1,0,1,0,0] => 2
[1,1,0,0,1,0,1,1,0,0] => [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,0,1,1,0,1,1,0,0,0] => 2
[1,1,0,0,1,1,0,0,1,0] => [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,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,0,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,1,1,0,1,0,0,0] => 2
[1,1,0,0,1,1,1,0,0,0] => [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,0,1,1,1,1,0,0,0,0] => 2
[1,1,0,1,0,0,1,0,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,0,1,0,1,0,1,1,0,1,0,0] => 3
[1,1,0,1,0,0,1,1,0,0] => [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,0,1,1,1,0,0,0] => 3
[1,1,0,1,0,1,0,0,1,0] => [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,0,1,1,0,0] => 3
[1,1,0,1,0,1,0,1,0,0] => [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] => 3
[1,1,0,1,0,1,1,0,0,0] => [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,0,1,1,0,0,1,0] => 3
[1,1,0,1,1,0,0,0,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,0,1,0,1,1,0,0,1,1,0,0] => 2
[1,1,0,1,1,0,0,1,0,0] => [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,0,1,1,0,0,1,0,1,0] => 2
[1,1,0,1,1,0,1,0,0,0] => [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,0,1,1,0,1,0,0,1,0] => 2
[1,1,0,1,1,1,0,0,0,0] => [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,0,1,1,1,0,0,0,1,0] => 2
[1,1,1,0,0,0,1,0,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,0,1,1,0,0,1,1,0,1,0,0] => 3
[1,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => 3
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => 3
[1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => 3
[1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => 3
[1,1,1,0,1,0,0,0,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,0,1,1,0,1,0,0,1,1,0,0] => 3
[1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => 3
[1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => 2
[1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [1,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] => [1,1,1,1,0,0,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => 4
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => 4
[1,1,1,1,0,0,1,0,0,0] => [1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0,1,0] => 3
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,0,1,1,1,0,1,0,0,0,1,0] => 2
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => 1
[] => [] => [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

click to show known generating functions

$F_{1} = q$

$F_{2} = 2\ q$

$F_{3} = 3\ q + 2\ q^{2}$

$F_{4} = 4\ q + 8\ q^{2} + 2\ q^{3}$

$F_{5} = 5\ q + 20\ q^{2} + 15\ q^{3} + 2\ q^{4}$

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.

Map

promotion

Description

The promotion of the two-row standard Young tableau of a Dyck path.
Dyck paths of semilength

$n$ are in bijection with standard Young tableaux of shape

$(n^2)$ , see Mp00033to two-row standard tableau.
This map is the bijection on such standard Young tableaux given by Schützenberger's promotion. For definitions and details, see [1] and the references therein.

Map

prime Dyck path

Description

Return the Dyck path obtained by adding an initial up and a final down step.

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.