Identifier
-
Mp00043:
Integer partitions
—to Dyck path⟶
Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001232: Dyck paths ⟶ ℤ
Values
[1] => [1,0,1,0] => [1,1,0,0] => [1,0,1,0] => 1
[2] => [1,1,0,0,1,0] => [1,1,1,0,0,0] => [1,1,0,1,0,0] => 2
[1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => [1,0,1,1,0,0] => 2
[1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => 3
[3,1] => [1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0] => 3
[2,2] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0] => 4
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => 3
[1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0] => 5
[3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => 4
[2,2,2] => [1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 5
[2,2,1,1] => [1,0,1,1,0,1,1,0,0,0] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => 4
[2,1,1,1,1] => [1,0,1,1,1,1,0,1,0,0,0,0] => [1,1,0,0,1,1,1,0,1,0,0,0] => [1,0,1,1,1,1,0,0,1,0,0,0] => 7
[4,2,1] => [1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 4
[3,3,1] => [1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => 6
[3,2,2] => [1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => 6
[3,2,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => 4
[4,1,1,1,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,0,1,1,1,0,0,1,1,0,0,0] => 7
[2,2,2,2] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => 8
[2,2,2,1,1] => [1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => [1,0,1,1,1,1,0,0,0,1,0,0] => 6
[3,3,1,1,1] => [1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => 5
[3,2,1,1,1,1] => [1,0,1,1,1,1,0,1,0,1,0,0,0,0] => [1,1,0,0,1,1,1,0,1,0,1,0,0,0] => [1,0,1,1,1,1,1,0,0,1,0,0,0,0] => 9
[4,3,1,1,1] => [1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => 5
[4,2,2,2] => [1,1,0,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,0,1,1,0,0] => 6
[4,2,2,1,1] => [1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => [1,0,1,1,1,0,0,0,1,1,0,0] => 5
[3,3,3,1] => [1,1,0,1,0,0,1,1,1,0,0,0] => [1,1,1,0,1,0,0,0,1,1,0,0] => [1,1,1,0,1,1,0,0,0,0,1,0] => 7
[3,3,2,2] => [1,1,0,0,1,1,0,1,1,0,0,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => 7
[3,3,2,1,1] => [1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => 5
[5,3,2,1] => [1,1,0,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => 5
[5,2,1,1,1,1] => [1,0,1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,0,0,1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,1,0,0,1,1,0,0,0,0] => 10
[4,4,2,1] => [1,1,0,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => 8
[4,3,3,1] => [1,1,0,1,0,0,1,1,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => 9
[4,3,2,2] => [1,1,0,0,1,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => 8
[4,3,2,1,1] => [1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => 5
[3,2,2,2,2] => [1,1,0,0,1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,0,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,1,0,0,0,1,0,0,0] => 11
[3,2,2,2,1,1] => [1,0,1,1,0,1,1,1,0,1,0,0,0,0] => [1,1,0,0,1,0,1,1,1,0,1,0,0,0] => [1,0,1,1,1,1,1,0,0,0,1,0,0,0] => 8
[4,4,1,1,1,1] => [1,0,1,1,1,1,0,0,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0,1,1,0,0] => [1,0,1,1,1,0,0,1,1,0,0,0,1,0] => 8
[3,3,3,1,1,1] => [1,0,1,1,1,0,0,1,1,1,0,0,0,0] => [1,1,0,0,1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,1,0,0] => 7
[5,4,1,1,1,1] => [1,0,1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0,1,0] => [1,0,1,1,1,0,0,1,1,1,0,0,0,0] => 9
[5,2,2,2,2] => [1,1,0,0,1,1,1,1,0,0,0,1,0,0] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,1,0,0,0] => 10
[5,2,2,2,1,1] => [1,0,1,1,0,1,1,1,0,0,0,1,0,0] => [1,1,0,0,1,0,1,1,1,0,0,0,1,0] => [1,0,1,1,1,1,0,0,0,1,1,0,0,0] => 8
[3,3,3,3,1] => [1,1,0,1,0,0,1,1,1,1,0,0,0,0] => [1,1,1,0,1,0,0,0,1,1,1,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,1,0,0] => 11
[3,3,3,2,2] => [1,1,0,0,1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,1,0,0] => 10
[3,3,3,2,1,1] => [1,0,1,1,0,1,0,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0] => [1,0,1,1,1,1,1,0,0,0,0,1,0,0] => 7
[5,3,3,1,1,1] => [1,0,1,1,1,0,0,1,1,0,0,1,0,0] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => 6
[4,4,3,1,1,1] => [1,0,1,1,1,0,0,1,0,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0] => 6
[4,4,2,2,2] => [1,1,0,0,1,1,1,0,0,1,1,0,0,0] => [1,1,1,0,0,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,1,0,0,1,0] => 7
[4,4,2,2,1,1] => [1,0,1,1,0,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => 6
[5,4,3,1,1,1] => [1,0,1,1,1,0,0,1,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0] => 6
[5,4,2,2,2] => [1,1,0,0,1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,0,1,1,1,0,0,0] => 7
[5,4,2,2,1,1] => [1,0,1,1,0,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => 6
[5,3,3,3,1] => [1,1,0,1,0,0,1,1,1,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,1,0,0,1,0] => [1,1,1,0,1,1,0,0,0,0,1,1,0,0] => 8
[5,3,3,2,2] => [1,1,0,0,1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,0,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,0,0,0,0,1,1,0,0] => 8
[5,3,3,2,1,1] => [1,0,1,1,0,1,0,1,1,0,0,1,0,0] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => 6
[4,4,4,2,1] => [1,1,0,1,0,1,0,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0,1,1,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0,1,0] => 9
[4,4,3,3,1] => [1,1,0,1,0,0,1,1,0,1,1,0,0,0] => [1,1,1,0,1,0,0,0,1,0,1,1,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0,1,0] => 10
[4,4,3,2,2] => [1,1,0,0,1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0,1,1,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0,1,0] => 9
[4,4,3,2,1,1] => [1,0,1,1,0,1,0,1,0,1,1,0,0,0] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => 6
[6,4,3,2,1] => [1,1,0,1,0,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,1,0,1,0,0,0] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => 6
[5,5,3,2,1] => [1,1,0,1,0,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0,1,0] => [1,1,1,1,1,0,1,1,0,0,0,0,0,0] => 10
[5,4,4,2,1] => [1,1,0,1,0,1,0,0,1,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0,1,0,1,0] => [1,1,1,1,0,1,1,1,0,0,0,0,0,0] => 12
[5,4,3,3,1] => [1,1,0,1,0,0,1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0,1,0,1,0] => [1,1,1,0,1,1,1,1,0,0,0,0,0,0] => 12
[5,4,3,2,2] => [1,1,0,0,1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0] => [1,1,0,1,1,1,1,1,0,0,0,0,0,0] => 10
[5,4,3,2,1,1] => [1,0,1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => 6
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 indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
Map
Delest-Viennot-inverse
Description
Return the Dyck path obtained by applying the inverse of Delest-Viennot's bijection to the corresponding parallelogram polyomino.
Let $D$ be a Dyck path of semilength $n$. The parallelogram polyomino $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
The Delest-Viennot bijection $\beta$ returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path $(\beta^{(-1)}\circ\gamma)(D)$.
Let $D$ be a Dyck path of semilength $n$. The parallelogram polyomino $\gamma(D)$ is defined as follows: let $\tilde D = d_0 d_1 \dots d_{2n+1}$ be the Dyck path obtained by prepending an up step and appending a down step to $D$. Then, the upper path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with even indices, and the lower path of $\gamma(D)$ corresponds to the sequence of steps of $\tilde D$ with odd indices.
The Delest-Viennot bijection $\beta$ returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path $(\beta^{(-1)}\circ\gamma)(D)$.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
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.
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.
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!