Identifier
-
Mp00230:
Integer partitions
—parallelogram polyomino⟶
Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
St001301: Posets ⟶ ℤ
Values
[1] => [1,0] => [1,0] => ([],1) => 0
[2] => [1,0,1,0] => [1,1,0,0] => ([(0,1)],2) => 0
[1,1] => [1,1,0,0] => [1,0,1,0] => ([(0,1)],2) => 0
[3] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => ([(0,1),(0,2),(1,3),(2,3)],4) => 0
[2,1] => [1,0,1,1,0,0] => [1,0,1,1,0,0] => ([(0,2),(2,1)],3) => 0
[1,1,1] => [1,1,0,1,0,0] => [1,1,0,0,1,0] => ([(0,2),(2,1)],3) => 0
[4] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 0
[3,1] => [1,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5) => 0
[2,2] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => ([(0,2),(2,1)],3) => 0
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,1,0,0,0,1,0] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => 0
[1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0] => ([(0,3),(2,1),(3,2)],4) => 0
[3,2] => [1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,0] => ([(0,3),(2,1),(3,2)],4) => 0
[2,2,1] => [1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => ([(0,3),(2,1),(3,2)],4) => 0
[2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6) => 0
[1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6) => 0
[4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6) => 0
[3,3] => [1,1,1,0,1,0,0,0] => [1,1,0,0,1,0,1,0] => ([(0,3),(2,1),(3,2)],4) => 0
[3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 0
[2,2,2] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => ([(0,3),(2,1),(3,2)],4) => 0
[2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[4,3] => [1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6) => 0
[3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,0,0,1,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[4,4] => [1,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[3,2,2,1] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,0,1,1,0,0,0,1,0] => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7) => 0
[2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[2,2,2,1,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) => 0
[5,4] => [1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7) => 0
[3,3,3] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => ([(0,4),(2,3),(3,1),(4,2)],5) => 0
[2,2,2,2,1] => [1,1,1,1,0,1,0,0,0,1,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) => 0
[5,5] => [1,1,1,0,1,0,1,0,1,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) => 0
[4,4,2] => [1,1,1,0,1,0,1,1,0,0,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) => 0
[4,3,3] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[3,3,3,1] => [1,1,1,1,1,0,0,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) => 0
[3,3,2,2] => [1,1,1,0,1,1,0,1,0,0,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) => 0
[2,2,2,2,2] => [1,1,1,1,0,1,0,1,0,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) => 0
[4,4,3] => [1,1,1,0,1,1,1,0,0,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) => 0
[3,3,3,2] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[4,4,4] => [1,1,1,1,1,0,1,0,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[3,3,3,3] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
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 first Betti number of the order complex associated with the poset.
The order complex of a poset is the simplicial complex whose faces are the chains of the poset. This statistic is the rank of the first homology group of the order complex.
The order complex of a poset is the simplicial complex whose faces are the chains of the poset. This statistic is the rank of the first homology group of the order complex.
Map
parallelogram polyomino
Description
Return the Dyck path corresponding to the partition interpreted as a parallogram polyomino.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
Map
inverse zeta map
Description
The inverse zeta map on Dyck paths.
See its inverse, the zeta map Mp00030zeta map, for the definition and details.
See its inverse, the zeta map Mp00030zeta map, for the definition and details.
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!