Identifier
-
Mp00276:
Graphs
—to edge-partition of biconnected components⟶
Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St000443: Dyck paths ⟶ ℤ (values match St000024The number of double up and double down steps of a Dyck path., St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path., St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra., St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra.)
Values
([(0,1)],2) => [1] => [1,0,1,0] => [1,1,0,0] => 2
([(1,2)],3) => [1] => [1,0,1,0] => [1,1,0,0] => 2
([(0,2),(1,2)],3) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 2
([(0,1),(0,2),(1,2)],3) => [3] => [1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0] => 3
([(2,3)],4) => [1] => [1,0,1,0] => [1,1,0,0] => 2
([(1,3),(2,3)],4) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 2
([(0,3),(1,3),(2,3)],4) => [1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 3
([(0,3),(1,2)],4) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 2
([(0,3),(1,2),(2,3)],4) => [1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 3
([(1,2),(1,3),(2,3)],4) => [3] => [1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0] => 3
([(0,3),(1,2),(1,3),(2,3)],4) => [3,1] => [1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0] => 2
([(0,2),(0,3),(1,2),(1,3)],4) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => 3
([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => 4
([(3,4)],5) => [1] => [1,0,1,0] => [1,1,0,0] => 2
([(2,4),(3,4)],5) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 2
([(1,4),(2,4),(3,4)],5) => [1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 3
([(0,4),(1,4),(2,4),(3,4)],5) => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => 3
([(1,4),(2,3)],5) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 2
([(1,4),(2,3),(3,4)],5) => [1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 3
([(0,1),(2,4),(3,4)],5) => [1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 3
([(2,3),(2,4),(3,4)],5) => [3] => [1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0] => 3
([(0,4),(1,4),(2,3),(3,4)],5) => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => 3
([(1,4),(2,3),(2,4),(3,4)],5) => [3,1] => [1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0] => 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 3
([(1,3),(1,4),(2,3),(2,4)],5) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => 3
([(0,4),(1,2),(1,3),(2,4),(3,4)],5) => [4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => 4
([(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => 4
([(0,4),(1,3),(2,3),(2,4),(3,4)],5) => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 3
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 3
([(0,4),(1,3),(2,3),(2,4)],5) => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => 3
([(0,1),(2,3),(2,4),(3,4)],5) => [3,1] => [1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0] => 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5) => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 3
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5) => [3,3] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 3
([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => 4
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5) => [5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 3
([(4,5)],6) => [1] => [1,0,1,0] => [1,1,0,0] => 2
([(3,5),(4,5)],6) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 2
([(2,5),(3,5),(4,5)],6) => [1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 3
([(1,5),(2,5),(3,5),(4,5)],6) => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => 3
([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => [1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => 4
([(2,5),(3,4)],6) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 2
([(2,5),(3,4),(4,5)],6) => [1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 3
([(1,2),(3,5),(4,5)],6) => [1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 3
([(3,4),(3,5),(4,5)],6) => [3] => [1,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0] => 3
([(1,5),(2,5),(3,4),(4,5)],6) => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => 3
([(0,1),(2,5),(3,5),(4,5)],6) => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => 3
([(2,5),(3,4),(3,5),(4,5)],6) => [3,1] => [1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0] => 2
([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => [1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => 4
([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 3
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => 3
([(2,4),(2,5),(3,4),(3,5)],6) => [4] => [1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => 3
([(0,5),(1,5),(2,4),(3,4)],6) => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => 3
([(1,5),(2,3),(2,4),(3,5),(4,5)],6) => [4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => 4
([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => [1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => 4
([(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => 4
([(1,5),(2,4),(3,4),(3,5),(4,5)],6) => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 3
([(0,5),(1,5),(2,4),(3,4),(4,5)],6) => [1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => 4
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6) => [4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => 3
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 3
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => 3
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [5,1,1] => [1,1,1,0,1,1,0,0,0,0,1,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => 4
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6) => [4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => 3
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [5,1,1] => [1,1,1,0,1,1,0,0,0,0,1,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => 4
([(0,5),(1,4),(2,3)],6) => [1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 3
([(1,5),(2,4),(3,4),(3,5)],6) => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => 3
([(0,1),(2,5),(3,4),(4,5)],6) => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => 3
([(1,2),(3,4),(3,5),(4,5)],6) => [3,1] => [1,1,0,1,0,0,1,0] => [1,0,1,0,1,1,0,0] => 2
([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => [1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => 4
([(1,4),(2,3),(2,5),(3,5),(4,5)],6) => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 3
([(0,1),(2,5),(3,4),(3,5),(4,5)],6) => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 3
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => 3
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => [3,3] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 3
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => [3,3,1] => [1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => 2
([(1,4),(1,5),(2,3),(2,5),(3,4)],6) => [5] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => 4
([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6) => [4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => 3
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6) => [5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 3
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6) => [5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 3
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => 3
([(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [5,1,1] => [1,1,1,0,1,1,0,0,0,0,1,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => 4
([(0,5),(1,4),(2,3),(2,4),(3,5)],6) => [1,1,1,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => 4
([(0,1),(2,4),(2,5),(3,4),(3,5)],6) => [4,1] => [1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => 4
([(0,5),(1,5),(2,3),(2,4),(3,4)],6) => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 3
([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6) => [4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,0,1,1,0,1,1,0,0,0] => 3
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => 3
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => 3
([(0,1),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 3
([(0,4),(1,4),(2,3),(2,5),(3,5),(4,5)],6) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => 3
([(0,3),(0,4),(1,2),(1,5),(2,5),(3,5),(4,5)],6) => [4,3] => [1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => 4
([(0,3),(1,4),(1,5),(2,4),(2,5),(3,5),(4,5)],6) => [5,1,1] => [1,1,1,0,1,1,0,0,0,0,1,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => 4
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => [3,3,1] => [1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => 2
([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [5,3] => [1,1,1,1,0,0,0,1,0,0,1,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => 3
([(0,5),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6) => [5,1,1] => [1,1,1,0,1,1,0,0,0,0,1,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => 4
([(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5)],6) => [5,1,1] => [1,1,1,0,1,1,0,0,0,0,1,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => 4
([(0,4),(0,5),(1,2),(1,3),(2,3),(4,5)],6) => [3,3] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => 3
([(0,2),(1,4),(1,5),(2,3),(3,4),(3,5),(4,5)],6) => [5,1,1] => [1,1,1,0,1,1,0,0,0,0,1,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => 4
([(0,1),(0,5),(1,5),(2,3),(2,4),(3,4),(4,5)],6) => [3,3,1] => [1,1,0,1,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => 2
([(0,1),(0,5),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6) => [5,3] => [1,1,1,1,0,0,0,1,0,0,1,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => 3
([(5,6)],7) => [1] => [1,0,1,0] => [1,1,0,0] => 2
([(4,6),(5,6)],7) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 2
([(3,6),(4,6),(5,6)],7) => [1,1,1] => [1,0,1,1,1,0,0,0] => [1,1,1,0,0,1,0,0] => 3
([(2,6),(3,6),(4,6),(5,6)],7) => [1,1,1,1] => [1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,0,1,0,1,0,0] => 3
>>> Load all 262 entries. <<<
search for individual values
searching the database for the individual values of this statistic
Description
The number of long tunnels of a Dyck path.
A long tunnel of a Dyck path is a longest sequence of consecutive usual tunnels, i.e., a longest sequence of tunnels where the end point of one is the starting point of the next. See [1] for the definition of tunnels.
A long tunnel of a Dyck path is a longest sequence of consecutive usual tunnels, i.e., a longest sequence of tunnels where the end point of one is the starting point of the next. See [1] for the definition of tunnels.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
Map
Delest-Viennot-inverse
Description
Return the Dyck path obtained by applying the inverse of Delest-Viennot's bijection to the corresponding parallelogram polyomino.
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.
The Delest-Viennot bijection $\beta$ returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path $(\beta^{(-1)}\circ\gamma)(D)$.
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.
The Delest-Viennot bijection $\beta$ returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path $(\beta^{(-1)}\circ\gamma)(D)$.
Map
to edge-partition of biconnected components
Description
Sends a graph to the partition recording the number of edges in its biconnected components.
The biconnected components are also known as blocks of a graph.
The biconnected components are also known as blocks of a graph.
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!