Identifier
-
Mp00027:
Dyck paths
—to partition⟶
Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00146: Dyck paths —to tunnel matching⟶ Perfect matchings
St000782: Perfect matchings ⟶ ℤ
Values
[1,0,1,0,1,0] => [2,1] => [1,0,1,0,1,0] => [(1,2),(3,4),(5,6)] => 1
[1,0,1,1,0,0] => [1,1] => [1,0,1,1,0,0] => [(1,2),(3,6),(4,5)] => 1
[1,1,0,0,1,0] => [2] => [1,1,0,0,1,0] => [(1,4),(2,3),(5,6)] => 1
[1,1,0,1,0,1,0,0] => [2,1] => [1,0,1,0,1,0] => [(1,2),(3,4),(5,6)] => 1
[1,1,0,1,1,0,0,0] => [1,1] => [1,0,1,1,0,0] => [(1,2),(3,6),(4,5)] => 1
[1,1,1,0,0,1,0,0] => [2] => [1,1,0,0,1,0] => [(1,4),(2,3),(5,6)] => 1
[1,1,1,0,1,0,1,0,0,0] => [2,1] => [1,0,1,0,1,0] => [(1,2),(3,4),(5,6)] => 1
[1,1,1,0,1,1,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [(1,2),(3,6),(4,5)] => 1
[1,1,1,1,0,0,1,0,0,0] => [2] => [1,1,0,0,1,0] => [(1,4),(2,3),(5,6)] => 1
[1,1,1,1,0,1,0,1,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [(1,2),(3,4),(5,6)] => 1
[1,1,1,1,0,1,1,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [(1,2),(3,6),(4,5)] => 1
[1,1,1,1,1,0,0,1,0,0,0,0] => [2] => [1,1,0,0,1,0] => [(1,4),(2,3),(5,6)] => 1
[1,1,1,1,1,0,1,0,1,0,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [(1,2),(3,4),(5,6)] => 1
[1,1,1,1,1,0,1,1,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [(1,2),(3,6),(4,5)] => 1
[1,1,1,1,1,1,0,0,1,0,0,0,0,0] => [2] => [1,1,0,0,1,0] => [(1,4),(2,3),(5,6)] => 1
[1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [(1,2),(3,4),(5,6)] => 1
[1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [(1,2),(3,6),(4,5)] => 1
[1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0] => [2] => [1,1,0,0,1,0] => [(1,4),(2,3),(5,6)] => 1
[1,1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [(1,2),(3,4),(5,6)] => 1
[1,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [(1,2),(3,6),(4,5)] => 1
[1,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0] => [2] => [1,1,0,0,1,0] => [(1,4),(2,3),(5,6)] => 1
[1,1,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [(1,2),(3,6),(4,5)] => 1
[1,1,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0,0] => [2] => [1,1,0,0,1,0] => [(1,4),(2,3),(5,6)] => 1
[1,1,1,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [(1,2),(3,6),(4,5)] => 1
[1,1,1,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0,0,0] => [2] => [1,1,0,0,1,0] => [(1,4),(2,3),(5,6)] => 1
[1,1,1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [(1,2),(3,4),(5,6)] => 1
[1,1,1,1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0,0,0] => [2,1] => [1,0,1,0,1,0] => [(1,2),(3,4),(5,6)] => 1
[1,1,1,1,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,0,0,0,0] => [1,1] => [1,0,1,1,0,0] => [(1,2),(3,6),(4,5)] => 1
search for individual values
searching the database for the individual values of this statistic
Description
The indicator function of whether a given perfect matching is an L & P matching.
An L&P matching is built inductively as follows:
starting with either a single edge, or a hairpin $([1,3],[2,4])$, insert a noncrossing matching or inflate an edge by a ladder, that is, a number of nested edges.
The number of L&P matchings is (see [thm. 1, 2])
$$\frac{1}{2} \cdot 4^{n} + \frac{1}{n + 1}{2 \, n \choose n} - {2 \, n + 1 \choose n} + {2 \, n - 1 \choose n - 1}$$
An L&P matching is built inductively as follows:
starting with either a single edge, or a hairpin $([1,3],[2,4])$, insert a noncrossing matching or inflate an edge by a ladder, that is, a number of nested edges.
The number of L&P matchings is (see [thm. 1, 2])
$$\frac{1}{2} \cdot 4^{n} + \frac{1}{n + 1}{2 \, n \choose n} - {2 \, n + 1 \choose n} + {2 \, n - 1 \choose n - 1}$$
Map
to tunnel matching
Description
Sends a Dyck path of semilength n to the noncrossing perfect matching given by matching an up-step with the corresponding down-step.
This is, for a Dyck path $D$ of semilength $n$, the perfect matching of $\{1,\dots,2n\}$ with $i < j$ being matched if $D_i$ is an up-step and $D_j$ is the down-step connected to $D_i$ by a tunnel.
This is, for a Dyck path $D$ of semilength $n$, the perfect matching of $\{1,\dots,2n\}$ with $i < j$ being matched if $D_i$ is an up-step and $D_j$ is the down-step connected to $D_i$ by a tunnel.
Map
to partition
Description
The cut-out partition of a Dyck path.
The partition $\lambda$ associated to a Dyck path is defined to be the complementary partition inside the staircase partition $(n-1,\ldots,2,1)$ when cutting out $D$ considered as a path from $(0,0)$ to $(n,n)$.
In other words, $\lambda_{i}$ is the number of down-steps before the $(n+1-i)$-th up-step of $D$.
This map is a bijection between Dyck paths of size $n$ and partitions inside the staircase partition $(n-1,\ldots,2,1)$.
The partition $\lambda$ associated to a Dyck path is defined to be the complementary partition inside the staircase partition $(n-1,\ldots,2,1)$ when cutting out $D$ considered as a path from $(0,0)$ to $(n,n)$.
In other words, $\lambda_{i}$ is the number of down-steps before the $(n+1-i)$-th up-step of $D$.
This map is a bijection between Dyck paths of size $n$ and partitions inside the staircase partition $(n-1,\ldots,2,1)$.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers 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!