Identifier
-
Mp00276:
Graphs
—to edge-partition of biconnected components⟶
Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001232: Dyck paths ⟶ ℤ
Values
([(0,1)],2) => [1] => [1,0,1,0] => [1,1,0,0] => 0
([(1,2)],3) => [1] => [1,0,1,0] => [1,1,0,0] => 0
([(0,2),(1,2)],3) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
([(2,3)],4) => [1] => [1,0,1,0] => [1,1,0,0] => 0
([(1,3),(2,3)],4) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
([(0,3),(1,2)],4) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
([(0,3),(1,2),(1,3),(2,3)],4) => [3,1] => [1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => 2
([(3,4)],5) => [1] => [1,0,1,0] => [1,1,0,0] => 0
([(2,4),(3,4)],5) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
([(1,4),(2,3)],5) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
([(1,4),(2,3),(2,4),(3,4)],5) => [3,1] => [1,1,0,1,0,0,1,0] => [1,1,1,0,0,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] => 2
([(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] => 2
([(0,1),(2,3),(2,4),(3,4)],5) => [3,1] => [1,1,0,1,0,0,1,0] => [1,1,1,0,0,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] => 2
([(4,5)],6) => [1] => [1,0,1,0] => [1,1,0,0] => 0
([(3,5),(4,5)],6) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
([(2,5),(3,4)],6) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
([(2,5),(3,4),(3,5),(4,5)],6) => [3,1] => [1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => 2
([(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] => 2
([(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,0,0,1,1,1,0,0,0] => 3
([(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] => 2
([(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,1,1,0,0,0,1,1,0,0] => 2
([(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,0,0,1,1,1,0,0,0] => 3
([(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,1,1,0,0,0,1,1,0,0] => 2
([(1,2),(3,4),(3,5),(4,5)],6) => [3,1] => [1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => 2
([(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] => 2
([(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] => 2
([(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,0,0,1,1,1,0,0,0] => 3
([(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,1,1,0,0,0,1,1,0,0] => 2
([(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,0,0,1,1,1,0,0,0] => 3
([(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] => 2
([(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,1,1,0,0,0,1,1,0,0] => 2
([(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,0,0,1,1,1,0,0,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,0,0,1,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,0,0,1,1,1,0,0,0] => 3
([(5,6)],7) => [1] => [1,0,1,0] => [1,1,0,0] => 0
([(4,6),(5,6)],7) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
([(3,6),(4,5)],7) => [1,1] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 1
([(3,6),(4,5),(4,6),(5,6)],7) => [3,1] => [1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => 2
([(2,6),(3,6),(4,5),(4,6),(5,6)],7) => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 2
([(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 3
([(2,6),(3,5),(4,5),(4,6),(5,6)],7) => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 2
([(1,6),(2,6),(3,4),(3,5),(4,6),(5,6)],7) => [4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 2
([(1,6),(2,6),(3,5),(4,5),(4,6),(5,6)],7) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 3
([(1,6),(2,5),(3,5),(3,6),(4,5),(4,6)],7) => [4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 2
([(2,3),(4,5),(4,6),(5,6)],7) => [3,1] => [1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => 2
([(2,5),(3,4),(3,6),(4,6),(5,6)],7) => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 2
([(1,2),(3,6),(4,5),(4,6),(5,6)],7) => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 2
([(1,5),(2,6),(3,4),(3,6),(4,6),(5,6)],7) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 3
([(0,1),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 3
([(0,6),(1,6),(2,5),(2,6),(3,4),(3,6),(4,6),(5,6)],7) => [3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
([(1,6),(2,5),(3,4),(3,5),(4,6),(5,6)],7) => [4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 2
([(1,6),(2,5),(3,4),(4,5),(4,6),(5,6)],7) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 3
([(1,6),(2,6),(3,4),(3,5),(4,5)],7) => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 2
([(1,5),(2,3),(2,4),(3,6),(4,6),(5,6)],7) => [4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 2
([(0,1),(2,6),(3,5),(3,6),(4,5),(4,6)],7) => [4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 2
([(1,5),(2,3),(2,6),(3,6),(4,5),(4,6)],7) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 3
([(0,6),(1,3),(2,3),(4,5),(4,6),(5,6)],7) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 3
([(1,5),(2,3),(3,6),(4,5),(4,6),(5,6)],7) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 3
([(0,1),(2,6),(3,5),(4,5),(4,6),(5,6)],7) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 3
([(1,5),(2,5),(3,4),(3,6),(4,6),(5,6)],7) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 3
([(0,6),(1,5),(2,3),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => [3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
([(0,6),(1,6),(2,6),(3,4),(3,5),(4,5)],7) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 3
([(0,6),(1,6),(2,3),(2,5),(3,5),(4,5),(4,6),(5,6)],7) => [3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
([(0,6),(1,6),(2,4),(2,5),(3,4),(3,5)],7) => [4,1,1] => [1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => 2
([(0,5),(1,4),(2,4),(2,6),(3,5),(3,6),(4,6),(5,6)],7) => [3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
([(0,3),(1,2),(4,5),(4,6),(5,6)],7) => [3,1,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 2
([(0,1),(2,3),(3,6),(4,5),(4,6),(5,6)],7) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 3
([(0,5),(1,4),(1,6),(2,3),(2,6),(3,6),(4,6),(5,6)],7) => [3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
([(0,6),(1,5),(2,3),(2,4),(3,4),(5,6)],7) => [3,1,1,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => 3
([(0,4),(1,2),(1,6),(2,6),(3,5),(3,6),(4,5),(5,6)],7) => [3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
([(0,5),(1,4),(2,3),(2,6),(3,6),(4,5),(4,6),(5,6)],7) => [3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
([(0,6),(1,2),(1,6),(2,6),(3,4),(3,5),(4,5),(5,6)],7) => [3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
([(0,6),(1,2),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [6,3,1] => [1,1,1,1,0,1,0,0,1,0,0,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,1,0,0] => 11
([(0,1),(0,6),(1,6),(2,3),(2,5),(3,5),(4,5),(4,6)],7) => [3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
([(0,5),(1,2),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7) => [6,3,1] => [1,1,1,1,0,1,0,0,1,0,0,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,1,0,0] => 11
([(0,6),(1,2),(1,4),(2,4),(3,5),(3,6),(4,5),(5,6)],7) => [3,3,1,1] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 3
([(0,5),(1,5),(1,6),(2,3),(2,4),(2,6),(3,4),(3,6),(4,6),(5,6)],7) => [6,3,1] => [1,1,1,1,0,1,0,0,1,0,0,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,1,0,0] => 11
([(0,1),(0,5),(1,5),(2,3),(2,4),(2,6),(3,4),(3,6),(4,6),(5,6)],7) => [6,3,1] => [1,1,1,1,0,1,0,0,1,0,0,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,1,0,0] => 11
search for individual values
searching the database for the individual values of this statistic
Description
The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
Map
Delest-Viennot
Description
Return the Dyck path corresponding to the parallelogram polyomino obtained by applying Delest-Viennot's bijection.
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 $(\gamma^{(-1)}\circ\beta)(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 $(\gamma^{(-1)}\circ\beta)(D)$.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
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!