- FindStat

Identifier

Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
St001095: Posets ⟶ ℤ

Values

[1] => [1,0,1,0] => [1,0,1,0] => ([(0,1)],2) => 0
[2] => [1,1,0,0,1,0] => [1,1,0,0,1,0] => ([(0,2),(2,1)],3) => 0
[1,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => ([(0,2),(2,1)],3) => 0
[3] => [1,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,0] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => 0
[2,1] => [1,0,1,0,1,0] => [1,0,1,0,1,0] => ([(0,2),(2,1)],3) => 0
[1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,0,0] => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => 1
[3,1] => [1,1,0,1,0,0,1,0] => [1,0,1,1,0,0,1,0] => ([(0,3),(2,1),(3,2)],4) => 0
[2,2] => [1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,0,0] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5) => 0
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,0,1,1,0,1,0,0] => ([(0,3),(2,1),(3,2)],4) => 0
[4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,0,1,1,1,0,0,0,1,0] => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 0
[3,2] => [1,1,0,0,1,0,1,0] => [1,1,0,0,1,0,1,0] => ([(0,3),(2,1),(3,2)],4) => 0
[3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,0] => ([(0,3),(2,1),(3,2)],4) => 0
[2,2,1] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0] => ([(0,3),(2,1),(3,2)],4) => 0
[4,2] => [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) => 0
[4,1,1] => [1,1,0,1,1,0,0,0,1,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
[3,2,1] => [1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => ([(0,3),(2,1),(3,2)],4) => 0
[3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 0
[5,2] => [1,1,1,1,0,0,1,0,0,0,1,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
[4,3] => [1,1,1,0,0,0,1,0,1,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
[4,2,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) => 0
[3,3,1] => [1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,0,0] => ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6) => 0
[3,2,2] => [1,1,0,0,1,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
[3,2,1,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) => 0
[5,2,1] => [1,1,1,0,1,0,1,0,0,0,1,0] => [1,0,1,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
[4,3,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) => 0
[4,2,2] => [1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,0] => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6) => 0
[4,2,1,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) => 0
[3,3,2] => [1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,0,0] => ([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6) => 0
[3,2,2,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) => 0
[5,3,1] => [1,1,1,0,1,0,0,1,0,0,1,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
[5,2,1,1] => [1,1,0,1,1,0,1,0,0,0,1,0] => [1,0,1,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
[4,3,2] => [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) => 0
[4,3,1,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) => 0
[4,2,2,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) => 0
[4,2,1,1,1] => [1,0,1,1,1,0,1,0,0,1,0,0] => [1,0,1,0,1,1,1,0,0,1,0,0] => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7) => 0
[3,3,2,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) => 0
[5,3,2] => [1,1,1,0,0,1,0,1,0,0,1,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
[5,3,1,1] => [1,1,0,1,1,0,0,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[5,2,2,1] => [1,1,0,1,0,1,1,0,0,0,1,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
[4,3,2,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) => 0
[4,3,1,1,1] => [1,0,1,1,1,0,0,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) => 0
[4,2,2,2] => [1,1,0,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7) => 0
[4,2,2,1,1] => [1,0,1,1,0,1,1,0,0,1,0,0] => [1,0,1,1,0,1,1,0,0,1,0,0] => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7) => 0
[5,4,2] => [1,1,1,0,0,1,0,0,1,0,1,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
[5,3,2,1] => [1,1,0,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[4,4,2,1] => [1,1,0,1,0,1,0,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7) => 0
[4,3,3,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) => 0
[4,3,2,2] => [1,1,0,0,1,1,0,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) => 0
[4,3,2,1,1] => [1,0,1,1,0,1,0,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) => 0
[5,4,2,1] => [1,1,0,1,0,1,0,0,1,0,1,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
[5,3,2,2] => [1,1,0,0,1,1,0,1,0,0,1,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[5,3,2,1,1] => [1,0,1,1,0,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[4,3,3,2] => [1,1,0,0,1,0,1,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
[4,3,2,2,1] => [1,0,1,0,1,1,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) => 0
[5,4,3,1] => [1,1,0,1,0,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) => 0
[5,4,2,1,1] => [1,0,1,1,0,1,0,0,1,0,1,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[5,3,2,2,1] => [1,0,1,0,1,1,0,1,0,0,1,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[4,3,3,2,1] => [1,0,1,0,1,0,1,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) => 0
[5,4,3,2] => [1,1,0,0,1,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) => 0
[5,4,3,1,1] => [1,0,1,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) => 0
[5,4,2,2,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => 0
[5,3,3,2,1] => [1,0,1,0,1,0,1,1,0,0,1,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
[4,4,3,2,1] => [1,0,1,0,1,0,1,0,1,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) => 0
[5,4,3,2,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) => 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

click to show known generating functions

$F_{1} = 1$

$F_{2} = 2$

$F_{3} = 2 + q$

Description

The number of non-isomorphic posets with precisely one further covering relation.

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.

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.

Map

to Dyck path

Description

Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.