Identifier
-
Mp00229:
Dyck paths
—Delest-Viennot⟶
Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001206: Dyck paths ⟶ ℤ (values match St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$.)
Values
[1,1,0,1,0,1,0,0] => [1,1,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 2
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 2
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => 2
[1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => 2
[1,1,0,1,0,1,1,0,0,0] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => 2
[1,1,0,1,1,0,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => 2
[1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 2
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 2
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => 2
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => 2
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 2
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => 2
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 2
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 2
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => 2
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => 2
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => 2
[1,1,0,0,1,1,0,1,0,1,0,0] => [1,0,1,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => 2
[1,1,0,1,0,1,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 2
[1,1,0,1,0,1,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 2
[1,1,0,1,0,1,0,1,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => 2
[1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => 2
[1,1,0,1,0,1,0,1,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => 2
[1,1,0,1,0,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 2
[1,1,0,1,0,1,1,0,0,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 2
[1,1,0,1,0,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => 2
[1,1,0,1,0,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 2
[1,1,0,1,1,0,0,1,0,1,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => 2
[1,1,0,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 2
[1,1,0,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => 2
[1,1,0,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => 2
[1,1,0,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,0,1,0,0,0,1,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 2
[1,1,0,1,1,1,0,1,0,0,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => 2
[1,1,1,0,0,1,0,1,0,0,1,0] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 2
[1,1,1,0,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => 2
[1,1,1,0,0,1,0,1,1,0,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 2
[1,1,1,0,0,1,1,0,1,0,0,0] => [1,0,1,1,1,1,0,0,1,0,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 2
[1,1,1,0,1,0,0,1,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 2
[1,1,1,0,1,0,0,1,0,1,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,1,0,0,0,1,0,1,1,0,0] => 2
[1,1,1,0,1,0,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 2
[1,1,1,0,1,0,1,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => 2
[1,1,1,0,1,0,1,0,0,1,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,1,0,0] => 2
[1,1,1,0,1,0,1,0,1,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => 3
[1,1,1,0,1,0,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => 2
[1,1,1,0,1,1,0,0,1,0,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,1,1,0,0,0] => 2
[1,1,1,0,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => 2
[1,1,1,1,0,0,0,1,0,1,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => 2
[1,1,1,1,0,0,1,0,0,1,0,0] => [1,0,1,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => 2
[1,1,1,1,0,0,1,0,1,0,0,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => 2
[1,1,1,1,0,1,0,0,0,1,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => 2
[1,1,1,1,0,1,0,0,1,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => 2
[1,1,1,1,0,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => 2
search for individual values
searching the database for the individual values of this statistic
Description
The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$.
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
Delest-Viennot
Description
Return the Dyck path corresponding to the parallelogram polyomino obtained by applying Delest-Viennot's bijection.
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 $(\gamma^{(-1)}\circ\beta)(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 $(\gamma^{(-1)}\circ\beta)(D)$.
Map
peeling map
Description
Send a Dyck path to its peeled Dyck path.
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!