Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000120
Mapping
Mp00276: Graphs —to edge-partition of biconnected components⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000120: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
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]
 => 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]
 => 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]
 => 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]
 => 2
([(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]
 => 2
([(1,2),(1,3),(2,3)],4)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(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,1,0,1,1,0,0,0,0]
 => 1
([(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,1,0,1,1,0,0,0,0,0]
 => 1
([(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]
 => 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]
 => 2
([(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,1,0,0,1,0,0,0]
 => 2
([(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]
 => 2
([(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]
 => 2
([(2,3),(2,4),(3,4)],5)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(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,1,0,0,1,0,0,0]
 => 2
([(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]
 => 2
([(1,3),(1,4),(2,3),(2,4)],5)
 => [4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,0,1,1,0,0,0,0]
 => 1
([(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,0,1,0,1,1,0,0,0]
 => 2
([(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,1,0,1,1,0,0,0,0,0]
 => 1
([(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,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,1,0,1,0,1,1,0,0,0,0]
 => 2
([(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,1,0,0,1,0,0,0]
 => 2
([(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]
 => 2
([(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]
 => 2
([(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,1,0,1,1,0,0,0,0,0]
 => 1
([(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,1,0,1,0,1,1,0,0,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]
 => 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]
 => 2
([(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,1,0,0,1,0,0,0]
 => 2
([(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,1,0,0,1,0,0,0,0]
 => 2
([(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]
 => 2
([(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]
 => 2
([(3,4),(3,5),(4,5)],6)
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
([(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,1,0,0,1,0,0,0]
 => 2
([(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,1,0,0,1,0,0,0]
 => 2
([(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,1,0,0,1,0,0,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,1,0,0,1,0,0,1,0]
 => 3
Description
The number of left tunnels of a Dyck path. A tunnel is a pair (a,b) where a is the position of an open parenthesis and b is the position of the matching close parenthesis. If a+b