Identifier
Values
[.,.] => [1,0] => [1,0] => ([],1) => 1
[.,[.,.]] => [1,0,1,0] => [1,0,1,0] => ([(0,1)],2) => 1
[[.,.],.] => [1,1,0,0] => [1,1,0,0] => ([(0,1)],2) => 1
[.,[.,[.,.]]] => [1,0,1,0,1,0] => [1,0,1,0,1,0] => ([(0,2),(2,1)],3) => 1
[.,[[.,.],.]] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => ([(0,2),(2,1)],3) => 1
[[.,.],[.,.]] => [1,1,0,0,1,0] => [1,1,0,0,1,0] => ([(0,2),(2,1)],3) => 1
[[.,[.,.]],.] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => ([(0,2),(2,1)],3) => 1
[[[.,.],.],.] => [1,1,1,0,0,0] => [1,1,1,0,0,0] => ([(0,1),(0,2),(1,3),(2,3)],4) => 1
[.,[.,[.,[.,.]]]] => [1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => ([(0,3),(2,1),(3,2)],4) => 1
[.,[.,[[.,.],.]]] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0] => ([(0,3),(2,1),(3,2)],4) => 1
[.,[[.,.],[.,.]]] => [1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,0] => ([(0,3),(2,1),(3,2)],4) => 1
[.,[[.,[.,.]],.]] => [1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,0] => ([(0,3),(2,1),(3,2)],4) => 1
[[.,.],[.,[.,.]]] => [1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => ([(0,3),(2,1),(3,2)],4) => 1
[[.,.],[[.,.],.]] => [1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0] => ([(0,3),(2,1),(3,2)],4) => 1
[[.,[.,.]],[.,.]] => [1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => ([(0,3),(2,1),(3,2)],4) => 1
[[[.,.],.],[.,.]] => [1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,0,0] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => 1
[[.,[.,[.,.]]],.] => [1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,0] => ([(0,3),(2,1),(3,2)],4) => 1
[[.,[[.,.],.]],.] => [1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,0,0] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => 1
[[[.,.],[.,.]],.] => [1,1,1,0,0,1,0,0] => [1,1,1,0,0,0,1,0] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => 1
[[[.,[.,.]],.],.] => [1,1,1,0,1,0,0,0] => [1,0,1,1,1,0,0,0] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => 1
[.,[.,[.,[.,[.,.]]]]] => [1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[.,[.,[.,[[.,.],.]]]] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[.,[.,[[.,.],[.,.]]]] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[.,[.,[[.,[.,.]],.]]] => [1,0,1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[.,[[.,.],[.,[.,.]]]] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,0,1,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[.,[[.,.],[[.,.],.]]] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[.,[[.,[.,.]],[.,.]]] => [1,0,1,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[.,[[.,[.,[.,.]]],.]] => [1,0,1,1,0,1,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[[.,.],[.,[.,[.,.]]]] => [1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[[.,.],[.,[[.,.],.]]] => [1,1,0,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[[.,.],[[.,.],[.,.]]] => [1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[[.,.],[[.,[.,.]],.]] => [1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[[.,[.,.]],[.,[.,.]]] => [1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[[.,[.,.]],[[.,.],.]] => [1,1,0,1,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[[.,[.,[.,.]]],[.,.]] => [1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
[[.,[.,[.,[.,.]]]],.] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 1
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 connected components of the Hasse diagram for the poset.
Map
to Dyck path: up step, left tree, down step, right tree
Description
Return the associated Dyck path, using the bijection 1L0R.
This is given recursively as follows:
  • a leaf is associated to the empty Dyck Word
  • a tree with children $l,r$ is associated with the Dyck path described by 1L0R where $L$ and $R$ are respectively the Dyck words associated with the trees $l$ and $r$.
Map
Cori-Le Borgne involution
Description
The Cori-Le Borgne involution on Dyck paths.
Append an additional down step to the Dyck path and consider its (literal) reversal. The image of the involution is then the unique rotation of this word which is a Dyck word followed by an additional down step. Alternatively, it is the composite $\zeta\circ\mathrm{rev}\circ\zeta^{(-1)}$, where $\zeta$ is Mp00030zeta map.
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.