Identifier
-
Mp00123:
Dyck paths
—Barnabei-Castronuovo involution⟶
Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
St000741: Graphs ⟶ ℤ
Values
[1,0] => [1,0] => ([],1) => ([],1) => 0
[1,0,1,0] => [1,0,1,0] => ([(0,1)],2) => ([],2) => 1
[1,1,0,0] => [1,1,0,0] => ([(0,1)],2) => ([],2) => 1
[1,0,1,0,1,0] => [1,1,0,1,0,0] => ([(0,2),(2,1)],3) => ([],3) => 1
[1,0,1,1,0,0] => [1,1,0,0,1,0] => ([(0,2),(2,1)],3) => ([],3) => 1
[1,1,0,0,1,0] => [1,0,1,1,0,0] => ([(0,2),(2,1)],3) => ([],3) => 1
[1,1,0,1,0,0] => [1,0,1,0,1,0] => ([(0,2),(2,1)],3) => ([],3) => 1
[1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => ([(0,3),(2,1),(3,2)],4) => ([],4) => 1
[1,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,0] => ([(0,3),(2,1),(3,2)],4) => ([],4) => 1
[1,0,1,1,0,0,1,0] => [1,1,1,0,1,0,0,0] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => 1
[1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => ([(0,3),(2,1),(3,2)],4) => ([],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) => ([],4) => 1
[1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0] => ([(0,3),(2,1),(3,2)],4) => ([],4) => 1
[1,1,0,1,1,0,0,0] => [1,1,0,1,0,0,1,0] => ([(0,3),(2,1),(3,2)],4) => ([],4) => 1
[1,1,1,0,0,1,0,0] => [1,0,1,1,0,1,0,0] => ([(0,3),(2,1),(3,2)],4) => ([],4) => 1
[1,1,1,0,1,0,0,0] => [1,0,1,1,0,0,1,0] => ([(0,3),(2,1),(3,2)],4) => ([],4) => 1
[1,1,1,1,0,0,0,0] => [1,1,1,1,0,0,0,0] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => ([(2,5),(3,4),(4,5)],6) => 1
[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) => ([],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) => ([],5) => 1
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => 1
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,0,1,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => 1
[1,0,1,1,0,0,1,0,1,0] => [1,0,1,1,0,1,0,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],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) => ([],5) => 1
[1,0,1,1,0,1,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => 1
[1,0,1,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => 1
[1,1,0,1,0,0,1,0,1,0] => [1,0,1,0,1,1,0,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],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) => ([],5) => 1
[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) => ([],5) => 1
[1,1,0,1,0,1,1,0,0,0] => [1,0,1,0,1,0,1,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => 1
[1,1,1,0,0,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => 1
[1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => 1
[1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,0,1,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => 1
[1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,0,1,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => ([],5) => 1
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,0,1,0,1,0,1,0,1,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,0,1,0,1,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,0,1,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,0,1,0,1,1,0,1,0,0] => [1,0,1,1,0,0,1,1,0,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,1,0,0,1,0,1,0,1,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,1,0,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,1,0,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,0,1,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,1,0,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,1,0,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,1,0,1,1,0,0,1,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,1,0,1,1,0,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,1,0,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,1,1,0,0,1,0,1,0,0] => [1,0,1,1,0,1,0,1,0,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,1,1,0,1,0,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,0,1,1,0,1,1,0,0,0,0] => [1,0,1,1,0,1,0,0,1,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,1,0,1,0,0,1,0,1,0,0] => [1,0,1,0,1,1,0,1,0,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,1,0,1,0,1,0,0,1,0,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,1,0,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,1,0,1,0,1,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,1,1,0,0,0,1,0,1,0,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,1,1,0,0,1,0,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,1,1,0,0,1,0,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 1
[1,1,1,1,0,0,1,1,0,0,0,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => ([],6) => 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 Colin de Verdière graph invariant.
Map
incomparability graph
Description
The incomparability graph of a poset.
Map
Barnabei-Castronuovo involution
Description
The Barnabei-Castronuovo Schützenberger involution on Dyck paths.
The image of a Dyck path is obtained by reversing the canonical decompositions of the two halves of the Dyck path. More precisely, let $D_1, 1, D_2, 1, \dots$ be the canonical decomposition of the first half, then the canonical decomposition of the first half of the image is $\dots, 1, D_2, 1, D_1$.
The image of a Dyck path is obtained by reversing the canonical decompositions of the two halves of the Dyck path. More precisely, let $D_1, 1, D_2, 1, \dots$ be the canonical decomposition of the first half, then the canonical decomposition of the first half of the image is $\dots, 1, D_2, 1, D_1$.
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!