Identifier
-
Mp00132:
Dyck paths
—switch returns and last double rise⟶
Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
St000327: Posets ⟶ ℤ
Values
[1,0] => [1,0] => [1,1,0,0] => ([(0,1)],2) => 1
[1,0,1,0] => [1,0,1,0] => [1,1,0,1,0,0] => ([(0,2),(2,1)],3) => 2
[1,1,0,0] => [1,1,0,0] => [1,1,1,0,0,0] => ([(0,1),(0,2),(1,3),(2,3)],4) => 4
[1,0,1,0,1,0] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => ([(0,3),(2,1),(3,2)],4) => 3
[1,1,0,0,1,0] => [1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => 5
[1,1,0,1,0,0] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => 5
[1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
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 cover relations in a poset.
Equivalently, this is also the number of edges in the Hasse diagram [1].
Equivalently, this is also the number of edges in the Hasse diagram [1].
Map
switch returns and last double rise
Description
An alternative to the Adin-Bagno-Roichman transformation of a Dyck path.
This is a bijection preserving the number of up steps before each peak and exchanging the number of components with the position of the last double rise.
This is a bijection preserving the number of up steps before each peak and exchanging the number of components with the position of the last double rise.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
Map
parallelogram poset
Description
The cell poset of the parallelogram polyomino corresponding to the Dyck path.
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.
This map returns the cell poset of $\gamma(D)$. In this partial order, the cells of the polyomino are the elements and a cell covers those cells with which it shares an edge and which are closer to the origin.
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.
This map returns the cell poset of $\gamma(D)$. In this partial order, the cells of the polyomino are the elements and a cell covers those cells with which it shares an edge and which are closer to the origin.
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!