Identifier
-
Mp00199:
Dyck paths
—prime Dyck path⟶
Dyck paths
St001932: Dyck paths ⟶ ℤ
Values
[1,0] => [1,1,0,0] => 0
[1,0,1,0] => [1,1,0,1,0,0] => 0
[1,1,0,0] => [1,1,1,0,0,0] => 0
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => 1
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => 0
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => 0
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => 0
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => 0
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 3
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => 1
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => 0
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => 0
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => 0
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => 0
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => 0
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => 0
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => 1
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => 0
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => 0
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => 0
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 0
[1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => 0
[1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 6
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 3
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => 1
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => 1
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => 1
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => 1
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => 0
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => 0
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => 1
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => 0
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => 0
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => 0
[1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => 0
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => 0
[1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => 1
[1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => 0
[1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => 0
[1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => 0
[1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => 0
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => 0
[1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => 0
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => 1
[1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => 3
[1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => 1
[1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => 0
[1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => 0
[1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => 0
[1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => 0
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => 0
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => 0
[1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => 0
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => 0
[1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => 0
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => 0
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => 0
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => 1
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => 0
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 0
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 0
[1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 0
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => 0
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => 0
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => 10
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,1,0,0,0] => 6
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,1,0,0] => 3
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,0,1,1,0,1,0,0,0] => 3
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,1,1,1,0,0,0,0] => 3
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,1,0,0] => 3
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,1,1,0,0,0] => 1
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,0,1,1,0,1,0,0,1,0,0] => 1
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,1,0,0,0] => 2
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,0,1,1,0,1,1,0,0,0,0] => 1
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,1,0,0,0,1,0,0] => 1
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,0,1,1,1,0,0,1,0,0,0] => 1
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,1,0,1,0,0,0,0] => 1
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,1,1,1,0,0,0,0,0] => 1
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,1,0,0] => 3
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,1,1,0,0,1,0,1,1,0,0,0] => 1
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,1,0,0,1,0,0] => 0
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,1,1,0,1,0,0,0] => 0
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,1,1,0,0,1,1,1,0,0,0,0] => 0
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,1,0,0] => 1
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,1,0,1,0,0,1,1,0,0,0] => 0
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,1,0,0,1,0,0] => 1
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,1,0,0,0] => 3
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,1,1,0,0,0,0] => 1
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,1,0,1,1,0,0,0,1,0,0] => 0
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,1,1,0,0,1,0,0,0] => 0
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,1,1,0,1,1,0,1,0,0,0,0] => 0
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,1,1,0,1,1,1,0,0,0,0,0] => 0
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,1,0,0] => 1
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,1,0,0,0,1,1,0,0,0] => 0
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,1,1,0,0,1,0,0,1,0,0] => 0
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,1,0,0,0] => 0
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,1,0,0,1,1,0,0,0,0] => 0
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,1,1,0,1,0,0,0,1,0,0] => 0
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,1,0,1,0,0,1,0,0,0] => 0
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,1,0,0,0,0] => 1
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,1,0,1,1,0,0,0,0,0] => 0
>>> Load all 197 entries. <<<
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 pairs of singleton blocks in the noncrossing set partition corresponding to a Dyck path, that can be merged to create another noncrossing set partition.
Let $D$ be a Dyck path, and let $P$ be the noncrossing set partition obtained by applying Mp00138to noncrossing partition. For each pair of singleton blocks $\{a\}, \{b\}$, let $P'$ be the set partition obtained from $P$ by merging the two blocks. This statistic enumerates the number of (unordered) pairs of singleton blocks such that $P'$ is noncrossing.
Let $D$ be a Dyck path, and let $P$ be the noncrossing set partition obtained by applying Mp00138to noncrossing partition. For each pair of singleton blocks $\{a\}, \{b\}$, let $P'$ be the set partition obtained from $P$ by merging the two blocks. This statistic enumerates the number of (unordered) pairs of singleton blocks such that $P'$ is noncrossing.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
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!