Identifier
-
Mp00227:
Dyck paths
—Delest-Viennot-inverse⟶
Dyck paths
Mp00034: Dyck paths —to binary tree: up step, left tree, down step, right tree⟶ Binary trees
Mp00013: Binary trees —to poset⟶ Posets
St001668: Posets ⟶ ℤ
Values
[1,0,1,0] => [1,1,0,0] => [[.,.],.] => ([(0,1)],2) => 1
[1,1,0,0] => [1,0,1,0] => [.,[.,.]] => ([(0,1)],2) => 1
[1,0,1,0,1,0] => [1,1,1,0,0,0] => [[[.,.],.],.] => ([(0,2),(2,1)],3) => 2
[1,0,1,1,0,0] => [1,1,0,0,1,0] => [[.,.],[.,.]] => ([(0,2),(1,2)],3) => 1
[1,1,0,0,1,0] => [1,0,1,1,0,0] => [.,[[.,.],.]] => ([(0,2),(2,1)],3) => 2
[1,1,0,1,0,0] => [1,0,1,0,1,0] => [.,[.,[.,.]]] => ([(0,2),(2,1)],3) => 2
[1,1,1,0,0,0] => [1,1,0,1,0,0] => [[.,[.,.]],.] => ([(0,2),(2,1)],3) => 2
[1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [[[[.,.],.],.],.] => ([(0,3),(2,1),(3,2)],4) => 3
[1,0,1,0,1,1,0,0] => [1,1,1,0,0,0,1,0] => [[[.,.],.],[.,.]] => ([(0,3),(1,2),(2,3)],4) => 2
[1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [[.,.],[[.,.],.]] => ([(0,3),(1,2),(2,3)],4) => 2
[1,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,0] => [[.,.],[.,[.,.]]] => ([(0,3),(1,2),(2,3)],4) => 2
[1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => [[[.,.],[.,.]],.] => ([(0,3),(1,3),(3,2)],4) => 2
[1,1,0,0,1,0,1,0] => [1,0,1,1,1,0,0,0] => [.,[[[.,.],.],.]] => ([(0,3),(2,1),(3,2)],4) => 3
[1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [.,[[.,.],[.,.]]] => ([(0,3),(1,3),(3,2)],4) => 2
[1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0] => [.,[.,[[.,.],.]]] => ([(0,3),(2,1),(3,2)],4) => 3
[1,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0] => [.,[.,[.,[.,.]]]] => ([(0,3),(2,1),(3,2)],4) => 3
[1,1,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0] => [.,[[.,[.,.]],.]] => ([(0,3),(2,1),(3,2)],4) => 3
[1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0] => [[.,[[.,.],.]],.] => ([(0,3),(2,1),(3,2)],4) => 3
[1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => [[.,[.,.]],[.,.]] => ([(0,3),(1,2),(2,3)],4) => 2
[1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0] => [[[.,[.,.]],.],.] => ([(0,3),(2,1),(3,2)],4) => 3
[1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,0] => [[.,[.,[.,.]]],.] => ([(0,3),(2,1),(3,2)],4) => 3
[1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => [[[[[.,.],.],.],.],.] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [[[[.,.],.],.],[.,.]] => ([(0,4),(1,2),(2,3),(3,4)],5) => 3
[1,0,1,0,1,1,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [[[.,.],.],[[.,.],.]] => ([(0,3),(1,2),(2,4),(3,4)],5) => 3
[1,0,1,0,1,1,0,1,0,0] => [1,1,1,0,0,0,1,0,1,0] => [[[.,.],.],[.,[.,.]]] => ([(0,3),(1,2),(2,4),(3,4)],5) => 3
[1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => [[[[.,.],.],[.,.]],.] => ([(0,4),(1,2),(2,4),(4,3)],5) => 3
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,1,0,0,0] => [[.,.],[[[.,.],.],.]] => ([(0,4),(1,2),(2,3),(3,4)],5) => 3
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [[.,.],[[.,.],[.,.]]] => ([(0,4),(1,3),(2,3),(3,4)],5) => 2
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => [[.,.],[.,[[.,.],.]]] => ([(0,4),(1,2),(2,3),(3,4)],5) => 3
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => [[.,.],[.,[.,[.,.]]]] => ([(0,4),(1,2),(2,3),(3,4)],5) => 3
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,0,1,1,0,1,0,0] => [[.,.],[[.,[.,.]],.]] => ([(0,4),(1,2),(2,3),(3,4)],5) => 3
[1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => [[[.,.],[[.,.],.]],.] => ([(0,4),(1,2),(2,4),(4,3)],5) => 3
[1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => [[[.,.],[.,.]],[.,.]] => ([(0,4),(1,3),(2,3),(3,4)],5) => 2
[1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [[[[.,.],[.,.]],.],.] => ([(0,4),(1,4),(2,3),(4,2)],5) => 3
[1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => [[[.,.],[.,[.,.]]],.] => ([(0,4),(1,2),(2,4),(4,3)],5) => 3
[1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,1,1,0,0,0,0] => [.,[[[[.,.],.],.],.]] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [.,[[[.,.],.],[.,.]]] => ([(0,4),(1,2),(2,4),(4,3)],5) => 3
[1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [.,[[.,.],[[.,.],.]]] => ([(0,4),(1,2),(2,4),(4,3)],5) => 3
[1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => [.,[[.,.],[.,[.,.]]]] => ([(0,4),(1,2),(2,4),(4,3)],5) => 3
[1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,1,0,0,1,0,0] => [.,[[[.,.],[.,.]],.]] => ([(0,4),(1,4),(2,3),(4,2)],5) => 3
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,1,0,0,0] => [.,[.,[[[.,.],.],.]]] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => [.,[.,[[.,.],[.,.]]]] => ([(0,4),(1,4),(2,3),(4,2)],5) => 3
[1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => [.,[.,[.,[[.,.],.]]]] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => [.,[.,[.,[.,[.,.]]]]] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => [.,[.,[[.,[.,.]],.]]] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => [.,[[.,[[.,.],.]],.]] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => [.,[[.,[.,.]],[.,.]]] => ([(0,4),(1,2),(2,4),(4,3)],5) => 3
[1,1,0,1,1,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => [.,[[[.,[.,.]],.],.]] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,1,0,1,0,1,0,0] => [.,[[.,[.,[.,.]]],.]] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => [[.,[[[.,.],.],.]],.] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [[.,[[.,.],.]],[.,.]] => ([(0,4),(1,2),(2,3),(3,4)],5) => 3
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => [[.,[.,.]],[[.,.],.]] => ([(0,3),(1,2),(2,4),(3,4)],5) => 3
[1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => [[.,[.,.]],[.,[.,.]]] => ([(0,3),(1,2),(2,4),(3,4)],5) => 3
[1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,0,0,1,0,0] => [[.,[[.,.],[.,.]]],.] => ([(0,4),(1,4),(2,3),(4,2)],5) => 3
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => [[[.,[[.,.],.]],.],.] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => [[[.,[.,.]],.],[.,.]] => ([(0,4),(1,2),(2,3),(3,4)],5) => 3
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [[[[.,[.,.]],.],.],.] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,0,0,1,0,0] => [[[.,[.,.]],[.,.]],.] => ([(0,4),(1,2),(2,4),(4,3)],5) => 3
[1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => [[.,[.,[[.,.],.]]],.] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [[.,[.,[.,.]]],[.,.]] => ([(0,4),(1,2),(2,3),(3,4)],5) => 3
[1,1,1,1,0,0,1,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => [[.,[[.,[.,.]],.]],.] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => [[.,[.,[.,[.,.]]]],.] => ([(0,4),(2,3),(3,1),(4,2)],5) => 4
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,0,1,0,1,0,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 points of the poset minus the width of the poset.
Map
to binary tree: up step, left tree, down step, right tree
Description
Return the binary tree corresponding to the Dyck path under the transformation up step - left tree - down step - right tree.
A Dyck path $D$ of semilength $n$ with $ n > 1$ may be uniquely decomposed into $1L0R$ for Dyck paths L,R of respective semilengths $n_1, n_2$ with $n_1 + n_2 = n-1$.
This map sends $D$ to the binary tree $T$ consisting of a root node with a left child according to $L$ and a right child according to $R$ and then recursively proceeds.
The base case of the unique Dyck path of semilength $1$ is sent to a single node.
A Dyck path $D$ of semilength $n$ with $ n > 1$ may be uniquely decomposed into $1L0R$ for Dyck paths L,R of respective semilengths $n_1, n_2$ with $n_1 + n_2 = n-1$.
This map sends $D$ to the binary tree $T$ consisting of a root node with a left child according to $L$ and a right child according to $R$ and then recursively proceeds.
The base case of the unique Dyck path of semilength $1$ is sent to a single node.
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 poset
Description
Return the poset obtained by interpreting the tree as a Hasse diagram.
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!