Identifier
-
Mp00276:
Graphs
—to edge-partition of biconnected components⟶
Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00123: Dyck paths —Barnabei-Castronuovo involution⟶ Dyck paths
St001204: Dyck paths ⟶ ℤ
Values
([(0,2),(1,2)],3) => [1,1] => [1,1,0,0] => [1,1,0,0] => 0
([(0,1),(0,2),(1,2)],3) => [3] => [1,0,1,0,1,0] => [1,1,0,1,0,0] => 0
([(1,3),(2,3)],4) => [1,1] => [1,1,0,0] => [1,1,0,0] => 0
([(0,3),(1,3),(2,3)],4) => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 1
([(0,3),(1,2)],4) => [1,1] => [1,1,0,0] => [1,1,0,0] => 0
([(0,3),(1,2),(2,3)],4) => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 1
([(1,2),(1,3),(2,3)],4) => [3] => [1,0,1,0,1,0] => [1,1,0,1,0,0] => 0
([(0,3),(1,2),(1,3),(2,3)],4) => [3,1] => [1,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,0] => 1
([(0,2),(0,3),(1,2),(1,3)],4) => [4] => [1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => [5] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => [6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 1
([(2,4),(3,4)],5) => [1,1] => [1,1,0,0] => [1,1,0,0] => 0
([(1,4),(2,4),(3,4)],5) => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 1
([(0,4),(1,4),(2,4),(3,4)],5) => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0] => 0
([(1,4),(2,3)],5) => [1,1] => [1,1,0,0] => [1,1,0,0] => 0
([(1,4),(2,3),(3,4)],5) => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 1
([(0,1),(2,4),(3,4)],5) => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 1
([(2,3),(2,4),(3,4)],5) => [3] => [1,0,1,0,1,0] => [1,1,0,1,0,0] => 0
([(0,4),(1,4),(2,3),(3,4)],5) => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0] => 0
([(1,4),(2,3),(2,4),(3,4)],5) => [3,1] => [1,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,0] => 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => [3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 0
([(1,3),(1,4),(2,3),(2,4)],5) => [4] => [1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5) => [4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [5] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5) => [3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5) => [6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 1
([(0,4),(1,3),(2,3),(2,4)],5) => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0] => 0
([(0,1),(2,3),(2,4),(3,4)],5) => [3,1] => [1,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,0] => 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5) => [3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5) => [3,3] => [1,1,1,0,1,0,0,0] => [1,0,1,1,0,0,1,0] => 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => [5] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5) => [6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5) => [5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 1
([(3,5),(4,5)],6) => [1,1] => [1,1,0,0] => [1,1,0,0] => 0
([(2,5),(3,5),(4,5)],6) => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 1
([(1,5),(2,5),(3,5),(4,5)],6) => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0] => 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => [1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 1
([(2,5),(3,4)],6) => [1,1] => [1,1,0,0] => [1,1,0,0] => 0
([(2,5),(3,4),(4,5)],6) => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 1
([(1,2),(3,5),(4,5)],6) => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 1
([(3,4),(3,5),(4,5)],6) => [3] => [1,0,1,0,1,0] => [1,1,0,1,0,0] => 0
([(1,5),(2,5),(3,4),(4,5)],6) => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0] => 0
([(0,1),(2,5),(3,5),(4,5)],6) => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0] => 0
([(2,5),(3,4),(3,5),(4,5)],6) => [3,1] => [1,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,0] => 1
([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => [1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 1
([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => [3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => [3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => 0
([(2,4),(2,5),(3,4),(3,5)],6) => [4] => [1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0] => 1
([(0,5),(1,5),(2,4),(3,4)],6) => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0] => 0
([(1,5),(2,3),(2,4),(3,5),(4,5)],6) => [4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => 0
([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => [1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 1
([(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [5] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 0
([(1,5),(2,4),(3,4),(3,5),(4,5)],6) => [3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 0
([(0,5),(1,5),(2,4),(3,4),(4,5)],6) => [1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 1
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6) => [4,1,1] => [1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,1,0,0] => 1
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => 1
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6) => [3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => 0
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6) => [6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 1
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6) => [4,1,1] => [1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,1,0,0] => 1
([(0,5),(1,4),(2,3)],6) => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 1
([(1,5),(2,4),(3,4),(3,5)],6) => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0] => 0
([(0,1),(2,5),(3,4),(4,5)],6) => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0] => 0
([(1,2),(3,4),(3,5),(4,5)],6) => [3,1] => [1,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,0] => 1
([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => [1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 1
([(1,4),(2,3),(2,5),(3,5),(4,5)],6) => [3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 0
([(0,1),(2,5),(3,4),(3,5),(4,5)],6) => [3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 0
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => [3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => 0
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => [3,3] => [1,1,1,0,1,0,0,0] => [1,0,1,1,0,0,1,0] => 1
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => [3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => 0
([(1,4),(1,5),(2,3),(2,5),(3,4)],6) => [5] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 0
([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6) => [4,1,1] => [1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,1,0,0] => 1
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6) => [6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 1
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6) => [5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => 1
([(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6) => [5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => 1
([(0,5),(1,4),(2,3),(3,4),(3,5),(4,5)],6) => [3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => 0
([(0,5),(1,4),(2,3),(2,4),(3,5)],6) => [1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 1
([(0,1),(2,4),(2,5),(3,4),(3,5)],6) => [4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => 0
([(0,5),(1,5),(2,3),(2,4),(3,4)],6) => [3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 0
([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6) => [4,1,1] => [1,0,1,0,1,0,1,1,0,1,0,0] => [1,0,1,0,1,0,1,1,0,1,0,0] => 1
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5)],6) => [3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => 0
([(0,4),(1,2),(2,5),(3,4),(3,5),(4,5)],6) => [3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => 0
([(0,1),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [5,1] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => 1
([(0,4),(1,4),(2,3),(2,5),(3,5),(4,5)],6) => [3,1,1,1] => [1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => 0
([(0,3),(0,4),(1,2),(1,5),(2,5),(3,5),(4,5)],6) => [4,3] => [1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,0,0,0,1,0,0] => 0
([(0,4),(1,2),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => [3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => 0
([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [5,3] => [1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0,1,0,1,0] => 0
([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => [6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 1
([(0,4),(0,5),(1,2),(1,3),(2,5),(3,4)],6) => [6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 1
([(0,4),(0,5),(1,2),(1,3),(2,3),(4,5)],6) => [3,3] => [1,1,1,0,1,0,0,0] => [1,0,1,1,0,0,1,0] => 1
([(0,1),(0,5),(1,5),(2,3),(2,4),(3,4),(4,5)],6) => [3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => 0
([(0,1),(0,5),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6) => [5,3] => [1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0,1,0,1,0] => 0
([(4,6),(5,6)],7) => [1,1] => [1,1,0,0] => [1,1,0,0] => 0
([(3,6),(4,6),(5,6)],7) => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 1
([(2,6),(3,6),(4,6),(5,6)],7) => [1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,0] => 0
([(1,6),(2,6),(3,6),(4,6),(5,6)],7) => [1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,0,1,0,1,0,1,0] => 1
([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7) => [1,1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 0
([(3,6),(4,5)],7) => [1,1] => [1,1,0,0] => [1,1,0,0] => 0
([(3,6),(4,5),(5,6)],7) => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 1
([(2,3),(4,6),(5,6)],7) => [1,1,1] => [1,1,0,1,0,0] => [1,0,1,0,1,0] => 1
>>> Load all 206 entries. <<<
search for individual values
searching the database for the individual values of this statistic
Description
Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series L=[c0,c1,...,cn−1] such that n=c0<ci for all i>0 a special CNakayama algebra.
Associate to this special CNakayama algebra a Dyck path as follows:
In the list L delete the first entry c0 and substract from all other entries n−1 and then append the last element 1. The result is a Kupisch series of an LNakayama algebra.
The statistic gives the (t−1)/2 when t is the projective dimension of the simple module Sn−2.
Associate to this special CNakayama algebra a Dyck path as follows:
In the list L delete the first entry c0 and substract from all other entries n−1 and then append the last element 1. The result is a Kupisch series of an LNakayama algebra.
The statistic gives the (t−1)/2 when t is the projective dimension of the simple module Sn−2.
Map
Barnabei-Castronuovo involution
Description
The Barnabei-Castronuovo Schützenberger involution on Dyck paths.
The image of a Dyck path is obtained by reversing the canonical decompositions of the two halves of the Dyck path. More precisely, let D1,1,D2,1,… be the canonical decomposition of the first half, then the canonical decomposition of the first half of the image is …,1,D2,1,D1.
The image of a Dyck path is obtained by reversing the canonical decompositions of the two halves of the Dyck path. More precisely, let D1,1,D2,1,… be the canonical decomposition of the first half, then the canonical decomposition of the first half of the image is …,1,D2,1,D1.
Map
parallelogram polyomino
Description
Return the Dyck path corresponding to the partition interpreted as a parallogram polyomino.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
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!