searching the database
Your data matches 134 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St001213
(load all 17 compositions to match this statistic)
(load all 17 compositions to match this statistic)
St001213: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 2
[1,0,1,0]
=> 4
[1,1,0,0]
=> 3
[1,0,1,0,1,0]
=> 6
[1,0,1,1,0,0]
=> 5
[1,1,0,0,1,0]
=> 5
[1,1,0,1,0,0]
=> 6
[1,1,1,0,0,0]
=> 4
[1,0,1,0,1,0,1,0]
=> 8
[1,0,1,0,1,1,0,0]
=> 7
[1,0,1,1,0,0,1,0]
=> 7
[1,0,1,1,0,1,0,0]
=> 8
[1,0,1,1,1,0,0,0]
=> 6
[1,1,0,0,1,0,1,0]
=> 7
[1,1,0,0,1,1,0,0]
=> 6
[1,1,0,1,0,0,1,0]
=> 8
[1,1,0,1,0,1,0,0]
=> 9
[1,1,0,1,1,0,0,0]
=> 7
[1,1,1,0,0,0,1,0]
=> 6
[1,1,1,0,0,1,0,0]
=> 7
[1,1,1,0,1,0,0,0]
=> 8
[1,1,1,1,0,0,0,0]
=> 5
[1,0,1,0,1,0,1,0,1,0]
=> 10
[1,0,1,0,1,0,1,1,0,0]
=> 9
[1,0,1,0,1,1,0,0,1,0]
=> 9
[1,0,1,0,1,1,0,1,0,0]
=> 10
[1,0,1,0,1,1,1,0,0,0]
=> 8
[1,0,1,1,0,0,1,0,1,0]
=> 9
[1,0,1,1,0,0,1,1,0,0]
=> 8
[1,0,1,1,0,1,0,0,1,0]
=> 10
[1,0,1,1,0,1,0,1,0,0]
=> 11
[1,0,1,1,0,1,1,0,0,0]
=> 9
[1,0,1,1,1,0,0,0,1,0]
=> 8
[1,0,1,1,1,0,0,1,0,0]
=> 9
[1,0,1,1,1,0,1,0,0,0]
=> 10
[1,0,1,1,1,1,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,0,1,0]
=> 9
[1,1,0,0,1,0,1,1,0,0]
=> 8
[1,1,0,0,1,1,0,0,1,0]
=> 8
[1,1,0,0,1,1,0,1,0,0]
=> 9
[1,1,0,0,1,1,1,0,0,0]
=> 7
[1,1,0,1,0,0,1,0,1,0]
=> 10
[1,1,0,1,0,0,1,1,0,0]
=> 9
[1,1,0,1,0,1,0,0,1,0]
=> 11
[1,1,0,1,0,1,0,1,0,0]
=> 12
[1,1,0,1,0,1,1,0,0,0]
=> 10
[1,1,0,1,1,0,0,0,1,0]
=> 9
[1,1,0,1,1,0,0,1,0,0]
=> 10
[1,1,0,1,1,0,1,0,0,0]
=> 11
[1,1,0,1,1,1,0,0,0,0]
=> 8
Description
The number of indecomposable modules in the corresponding Nakayama algebra that have vanishing first Ext-group with the regular module.
Matching statistic: St000395
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St000395: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000395: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> 2
[1,0,1,0]
=> [1,1,0,1,0,0]
=> 4
[1,1,0,0]
=> [1,1,1,0,0,0]
=> 3
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 6
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 5
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 5
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 6
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 8
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 7
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 7
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 8
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 6
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 7
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 6
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 8
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 9
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 7
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 6
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 7
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 8
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 10
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 9
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> 9
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 10
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 8
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 9
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 8
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 10
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> 11
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> 9
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 8
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 9
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> 10
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 9
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 8
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 8
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> 9
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 7
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 10
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> 9
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> 11
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 12
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> 10
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 9
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> 10
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 11
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> 8
Description
The sum of the heights of the peaks of a Dyck path.
Matching statistic: St001034
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001034: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001034: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> 2
[1,0,1,0]
=> [1,1,0,1,0,0]
=> 3
[1,1,0,0]
=> [1,1,1,0,0,0]
=> 4
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 4
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 5
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 5
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 6
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 6
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 5
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 6
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 6
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 7
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 6
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 7
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 7
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 8
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 8
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 7
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 8
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 8
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 9
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 7
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> 7
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 8
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 8
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 7
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 8
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 8
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> 9
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> 9
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 8
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 9
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> 9
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 10
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 7
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 8
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 8
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> 9
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 9
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 8
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> 9
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> 9
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 10
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> 10
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 9
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> 10
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 10
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> 11
Description
The area of the parallelogram polyomino associated with the Dyck path.
The (bivariate) generating function is given in [1].
Matching statistic: St000070
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St000070: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00065: Permutations —permutation poset⟶ Posets
St000070: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> 2
[1,0,1,0]
=> [2,1] => ([],2)
=> 4
[1,1,0,0]
=> [1,2] => ([(0,1)],2)
=> 3
[1,0,1,0,1,0]
=> [2,3,1] => ([(1,2)],3)
=> 6
[1,0,1,1,0,0]
=> [2,1,3] => ([(0,2),(1,2)],3)
=> 5
[1,1,0,0,1,0]
=> [1,3,2] => ([(0,1),(0,2)],3)
=> 5
[1,1,0,1,0,0]
=> [3,1,2] => ([(1,2)],3)
=> 6
[1,1,1,0,0,0]
=> [1,2,3] => ([(0,2),(2,1)],3)
=> 4
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => ([(1,2),(2,3)],4)
=> 8
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => ([(0,3),(1,2),(2,3)],4)
=> 7
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 7
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => ([(0,3),(1,2),(1,3)],4)
=> 8
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => ([(0,3),(1,3),(3,2)],4)
=> 6
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => ([(0,2),(0,3),(3,1)],4)
=> 7
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => ([(0,1),(0,2),(1,3),(2,3)],4)
=> 6
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => ([(0,3),(1,2),(1,3)],4)
=> 8
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => ([(0,3),(1,2)],4)
=> 9
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => ([(0,3),(1,2),(2,3)],4)
=> 7
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => ([(0,3),(3,1),(3,2)],4)
=> 6
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => ([(0,2),(0,3),(3,1)],4)
=> 7
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => ([(1,2),(2,3)],4)
=> 8
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> 5
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => ([(1,4),(3,2),(4,3)],5)
=> 10
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => ([(0,4),(1,2),(2,3),(3,4)],5)
=> 9
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => ([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> 9
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => ([(0,4),(1,2),(2,3),(2,4)],5)
=> 10
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => ([(0,4),(1,2),(2,4),(4,3)],5)
=> 8
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => ([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> 9
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> 8
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => ([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> 10
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => ([(0,4),(1,2),(1,4),(2,3)],5)
=> 11
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => ([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> 9
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => ([(0,4),(1,4),(4,2),(4,3)],5)
=> 8
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => ([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> 9
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => ([(0,4),(1,2),(1,4),(4,3)],5)
=> 10
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => ([(0,4),(1,4),(2,3),(4,2)],5)
=> 7
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => ([(0,2),(0,4),(3,1),(4,3)],5)
=> 9
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 8
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 8
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> 9
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 7
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => ([(0,4),(1,2),(1,4),(4,3)],5)
=> 10
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => ([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> 9
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => ([(0,3),(1,2),(1,4),(3,4)],5)
=> 11
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => ([(0,3),(1,4),(4,2)],5)
=> 12
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => ([(0,3),(1,2),(2,4),(3,4)],5)
=> 10
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => ([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> 9
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => ([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> 10
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => ([(0,3),(1,2),(1,4),(3,4)],5)
=> 11
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => ([(0,4),(1,2),(2,4),(4,3)],5)
=> 8
Description
The number of antichains in a poset.
An antichain in a poset $P$ is a subset of elements of $P$ which are pairwise incomparable.
An order ideal is a subset $I$ of $P$ such that $a\in I$ and $b \leq_P a$ implies $b \in I$. Since there is a one-to-one correspondence between antichains and order ideals, this statistic is also the number of order ideals in a poset.
Matching statistic: St000229
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000229: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000229: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> {{1,2}}
=> 2
[1,0,1,0]
=> [1,1,0,1,0,0]
=> {{1,3},{2}}
=> 4
[1,1,0,0]
=> [1,1,1,0,0,0]
=> {{1,2,3}}
=> 3
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> {{1,4},{2},{3}}
=> 6
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> 5
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> 6
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> 5
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 4
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> {{1,5},{2},{3},{4}}
=> 8
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> {{1,4,5},{2},{3}}
=> 7
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> {{1,5},{2},{3,4}}
=> 8
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> {{1,3,5},{2},{4}}
=> 7
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> {{1,3,4,5},{2}}
=> 6
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> {{1,5},{2,3},{4}}
=> 8
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> {{1,4,5},{2,3}}
=> 7
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> {{1,5},{2,4},{3}}
=> 9
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> {{1,2,5},{3},{4}}
=> 7
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> {{1,2,4,5},{3}}
=> 6
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> {{1,5},{2,3,4}}
=> 8
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> {{1,2,5},{3,4}}
=> 7
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> {{1,2,3,5},{4}}
=> 6
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> {{1,2,3,4,5}}
=> 5
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> {{1,6},{2},{3},{4},{5}}
=> 10
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> {{1,5,6},{2},{3},{4}}
=> 9
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> {{1,6},{2},{3},{4,5}}
=> 10
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> {{1,4,6},{2},{3},{5}}
=> 9
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> {{1,4,5,6},{2},{3}}
=> 8
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> {{1,6},{2},{3,4},{5}}
=> 10
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> {{1,5,6},{2},{3,4}}
=> 9
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> {{1,6},{2},{3,5},{4}}
=> 11
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> {{1,3,6},{2},{4},{5}}
=> 9
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> {{1,3,5,6},{2},{4}}
=> 8
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> {{1,6},{2},{3,4,5}}
=> 10
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> {{1,3,6},{2},{4,5}}
=> 9
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> {{1,3,4,6},{2},{5}}
=> 8
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> {{1,3,4,5,6},{2}}
=> 7
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> {{1,6},{2,3},{4},{5}}
=> 10
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> {{1,5,6},{2,3},{4}}
=> 9
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> {{1,6},{2,3},{4,5}}
=> 10
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> {{1,4,6},{2,3},{5}}
=> 9
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> {{1,4,5,6},{2,3}}
=> 8
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> {{1,6},{2,4},{3},{5}}
=> 11
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> {{1,5,6},{2,4},{3}}
=> 10
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> {{1,6},{2,5},{3},{4}}
=> 12
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> {{1,2,6},{3},{4},{5}}
=> 9
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> {{1,2,5,6},{3},{4}}
=> 8
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> {{1,6},{2,4,5},{3}}
=> 11
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> {{1,2,6},{3},{4,5}}
=> 9
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> {{1,2,4,6},{3},{5}}
=> 8
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> {{1,2,4,5,6},{3}}
=> 7
Description
Sum of the difference between the maximal and the minimal elements of the blocks plus the number of blocks of a set partition.
This is, for a set partition $P = \{B_1,\ldots,B_k\}$ of $\{1,\ldots,n\}$, the statistic is
$$d(P) = \sum_i \big(\operatorname{max}(B_i)-\operatorname{min}(B_i)+1\big).$$
This statistic is called ''dimension index'' in [2]
Matching statistic: St000394
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St000394: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St000394: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 2
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 4
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 3
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 6
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 5
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 5
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 6
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 4
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 8
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> 7
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> 7
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 8
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> 6
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> 7
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> 6
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 8
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> 9
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> 7
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 6
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 7
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 8
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 5
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> 10
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,1,1,0,0,0,0]
=> 9
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,1,1,0,0,1,0,0,0]
=> 9
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,1,0,0,0,0]
=> 10
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,1,1,1,0,0,0,0,0]
=> 8
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,1,0,0,0]
=> 9
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,1,1,0,0,0,0]
=> 8
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,1,0,0,0]
=> 10
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,1,0,0,0,0]
=> 11
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,1,0,1,1,0,0,0,0,0]
=> 9
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,1,1,0,0,0,1,0,0,0]
=> 8
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> 9
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> 10
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,1,1,1,0,0,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> 9
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,1,1,0,0,0,0]
=> 8
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,1,0,0,1,0,0,0]
=> 8
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,1,0,0,0,0]
=> 9
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,1,1,0,0,0,0,0]
=> 7
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,1,0,0,0]
=> 10
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,1,1,0,0,0,0]
=> 9
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,1,0,0,1,0,0,0]
=> 11
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,0]
=> 12
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,1,1,0,0,0,0,0]
=> 10
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> 9
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,1,1,0,1,1,0,0,1,0,0,0,0]
=> 10
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,1,0,0,0,0,0]
=> 11
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> 8
Description
The sum of the heights of the peaks of a Dyck path minus the number of peaks.
Matching statistic: St001348
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
St001348: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00142: Dyck paths —promotion⟶ Dyck paths
St001348: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,1,0,0]
=> 4
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 5
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 6
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 6
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 5
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 6
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 7
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 7
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 6
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 8
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 9
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 8
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 8
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 8
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 7
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 7
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 6
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 7
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 7
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 8
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 8
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 7
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 9
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 10
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 9
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 9
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> 9
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 8
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> 8
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 7
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 8
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 10
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 11
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 12
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> 12
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 11
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 10
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> 11
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 10
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 10
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> 10
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> 10
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> 11
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> 10
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> 10
Description
The bounce of the parallelogram polyomino associated with the Dyck path.
A bijection due to Delest and Viennot [1] associates a Dyck path with a parallelogram polyomino. The bounce statistic is defined in [2].
Matching statistic: St000180
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St000180: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00064: Permutations —reverse⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St000180: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => ([],1)
=> 2
[1,0,1,0]
=> [1,2] => [2,1] => ([],2)
=> 3
[1,1,0,0]
=> [2,1] => [1,2] => ([(0,1)],2)
=> 4
[1,0,1,0,1,0]
=> [1,2,3] => [3,2,1] => ([],3)
=> 4
[1,0,1,1,0,0]
=> [1,3,2] => [2,3,1] => ([(1,2)],3)
=> 5
[1,1,0,0,1,0]
=> [2,1,3] => [3,1,2] => ([(1,2)],3)
=> 5
[1,1,0,1,0,0]
=> [2,3,1] => [1,3,2] => ([(0,1),(0,2)],3)
=> 6
[1,1,1,0,0,0]
=> [3,1,2] => [2,1,3] => ([(0,2),(1,2)],3)
=> 6
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [4,3,2,1] => ([],4)
=> 5
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [3,4,2,1] => ([(2,3)],4)
=> 6
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [4,2,3,1] => ([(2,3)],4)
=> 6
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [2,4,3,1] => ([(1,2),(1,3)],4)
=> 7
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [3,2,4,1] => ([(1,3),(2,3)],4)
=> 7
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [4,3,1,2] => ([(2,3)],4)
=> 6
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [3,4,1,2] => ([(0,3),(1,2)],4)
=> 7
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [4,1,3,2] => ([(1,2),(1,3)],4)
=> 7
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,4,3,2] => ([(0,1),(0,2),(0,3)],4)
=> 8
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [3,1,4,2] => ([(0,3),(1,2),(1,3)],4)
=> 8
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [4,2,1,3] => ([(1,3),(2,3)],4)
=> 7
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [2,4,1,3] => ([(0,3),(1,2),(1,3)],4)
=> 8
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [2,1,4,3] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 9
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [3,2,1,4] => ([(0,3),(1,3),(2,3)],4)
=> 8
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [5,4,3,2,1] => ([],5)
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [4,5,3,2,1] => ([(3,4)],5)
=> 7
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [5,3,4,2,1] => ([(3,4)],5)
=> 7
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [3,5,4,2,1] => ([(2,3),(2,4)],5)
=> 8
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [4,3,5,2,1] => ([(2,4),(3,4)],5)
=> 8
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [5,4,2,3,1] => ([(3,4)],5)
=> 7
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [4,5,2,3,1] => ([(1,4),(2,3)],5)
=> 8
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [5,2,4,3,1] => ([(2,3),(2,4)],5)
=> 8
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [2,5,4,3,1] => ([(1,2),(1,3),(1,4)],5)
=> 9
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [4,2,5,3,1] => ([(1,4),(2,3),(2,4)],5)
=> 9
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [5,3,2,4,1] => ([(2,4),(3,4)],5)
=> 8
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [3,5,2,4,1] => ([(1,4),(2,3),(2,4)],5)
=> 9
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [3,2,5,4,1] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> 10
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [4,3,2,5,1] => ([(1,4),(2,4),(3,4)],5)
=> 9
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [5,4,3,1,2] => ([(3,4)],5)
=> 7
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [4,5,3,1,2] => ([(1,4),(2,3)],5)
=> 8
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [5,3,4,1,2] => ([(1,4),(2,3)],5)
=> 8
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [3,5,4,1,2] => ([(0,4),(1,2),(1,3)],5)
=> 9
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [4,3,5,1,2] => ([(0,4),(1,4),(2,3)],5)
=> 9
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [5,4,1,3,2] => ([(2,3),(2,4)],5)
=> 8
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [4,5,1,3,2] => ([(0,4),(1,2),(1,3)],5)
=> 9
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [5,1,4,3,2] => ([(1,2),(1,3),(1,4)],5)
=> 9
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,5,4,3,2] => ([(0,1),(0,2),(0,3),(0,4)],5)
=> 10
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [4,1,5,3,2] => ([(0,4),(1,2),(1,3),(1,4)],5)
=> 10
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [5,3,1,4,2] => ([(1,4),(2,3),(2,4)],5)
=> 9
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [3,5,1,4,2] => ([(0,3),(0,4),(1,2),(1,4)],5)
=> 10
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [3,1,5,4,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> 11
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [4,3,1,5,2] => ([(0,4),(1,4),(2,3),(2,4)],5)
=> 10
Description
The number of chains of a poset.
Matching statistic: St000300
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000300: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00064: Permutations —reverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000300: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => ([],1)
=> 2
[1,0,1,0]
=> [1,2] => [2,1] => ([(0,1)],2)
=> 3
[1,1,0,0]
=> [2,1] => [1,2] => ([],2)
=> 4
[1,0,1,0,1,0]
=> [1,2,3] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 4
[1,0,1,1,0,0]
=> [1,3,2] => [2,3,1] => ([(0,2),(1,2)],3)
=> 5
[1,1,0,0,1,0]
=> [2,1,3] => [3,1,2] => ([(0,2),(1,2)],3)
=> 5
[1,1,0,1,0,0]
=> [2,3,1] => [1,3,2] => ([(1,2)],3)
=> 6
[1,1,1,0,0,0]
=> [3,1,2] => [2,1,3] => ([(1,2)],3)
=> 6
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 5
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 6
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 6
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [2,4,3,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 7
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 7
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 6
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 7
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [4,1,3,2] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 7
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 8
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> 8
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [4,2,1,3] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 7
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> 8
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [2,1,4,3] => ([(0,3),(1,2)],4)
=> 9
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 8
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [4,5,3,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 7
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [5,3,4,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 7
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [3,5,4,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 8
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [4,3,5,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 8
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [5,4,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 7
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 8
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [5,2,4,3,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 8
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [2,5,4,3,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 9
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [4,2,5,3,1] => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 9
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [5,3,2,4,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 8
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [3,5,2,4,1] => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 9
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [3,2,5,4,1] => ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 10
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [4,3,2,5,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 9
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [5,4,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 7
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 8
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 8
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [3,5,4,1,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 9
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [4,3,5,1,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 9
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [5,4,1,3,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 8
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [4,5,1,3,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 9
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [5,1,4,3,2] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 9
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 10
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [4,1,5,3,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 10
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [5,3,1,4,2] => ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 9
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [3,5,1,4,2] => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 10
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [3,1,5,4,2] => ([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 11
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [4,3,1,5,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 10
Description
The number of independent sets of vertices of a graph.
An independent set of vertices of a graph $G$ is a subset $U \subset V(G)$ such that no two vertices in $U$ are adjacent.
This is also the number of vertex covers of $G$ as the map $U \mapsto V(G)\setminus U$ is a bijection between independent sets of vertices and vertex covers.
The size of the largest independent set, also called independence number of $G$, is [[St000093]]
Matching statistic: St000476
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
St000476: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
St000476: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> 2
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 4
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 3
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 6
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 5
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 6
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 5
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 4
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 8
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0,1,0]
=> 7
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> 8
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> 7
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> 6
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> 8
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> 7
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> 9
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> 7
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> 6
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> 8
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> 7
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> 6
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 5
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> 10
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0,1,0]
=> 9
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0,1,0]
=> 10
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0,1,0]
=> 9
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0,1,0]
=> 8
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0,1,0]
=> 10
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0,1,0]
=> 9
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0,1,0]
=> 11
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0,1,0]
=> 9
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,1,0,1,1,0,0,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0,1,0]
=> 8
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,1,1,0,0,0,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0,1,0]
=> 10
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0,1,0]
=> 9
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0,1,0]
=> 8
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,1,1,1,0,0,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0,1,0]
=> 7
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0,1,0]
=> 10
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0,1,0]
=> 9
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0,1,0]
=> 10
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,1,0,0,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0,1,0]
=> 9
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,1,1,0,0,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0,1,0]
=> 8
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0,1,0]
=> 11
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0,1,0]
=> 10
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0,1,0]
=> 12
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0,1,0]
=> 9
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,1,1,0,0,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0,1,0]
=> 8
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0,1,0]
=> 11
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,1,1,0,1,1,0,0,1,0,0,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0,1,0]
=> 9
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,1,0,0,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0,1,0]
=> 8
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0,1,0]
=> 7
Description
The sum of the semi-lengths of tunnels before a valley of a Dyck path.
For each valley $v$ in a Dyck path $D$ there is a corresponding tunnel, which
is the factor $T_v = s_i\dots s_j$ of $D$ where $s_i$ is the step after the first intersection of $D$ with the line $y = ht(v)$ to the left of $s_j$. This statistic is
$$
\sum_v (j_v-i_v)/2.
$$
The following 124 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000728The dimension of a set partition. St000018The number of inversions of a permutation. St000081The number of edges of a graph. St001428The number of B-inversions of a signed permutation. St000639The number of relations in a poset. St000641The number of non-empty boolean intervals in a poset. St001033The normalized area of the parallelogram polyomino associated with the Dyck path. St001616The number of neutral elements in a lattice. St000019The cardinality of the support of a permutation. St000029The depth of a permutation. St000197The number of entries equal to positive one in the alternating sign matrix. St000030The sum of the descent differences of a permutations. St000224The sorting index of a permutation. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St000809The reduced reflection length of the permutation. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St000957The number of Bruhat lower covers of a permutation. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001726The number of visible inversions of a permutation. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000054The first entry of the permutation. St000141The maximum drop size of a permutation. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St000656The number of cuts of a poset. St001717The largest size of an interval in a poset. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000189The number of elements in the poset. St001894The depth of a signed permutation. St000579The number of occurrences of the pattern {{1},{2}} such that 2 is a maximal element. St000971The smallest closer of a set partition. St001645The pebbling number of a connected graph. St000572The dimension exponent of a set partition. St000271The chromatic index of a graph. St000505The biggest entry in the block containing the 1. St000651The maximal size of a rise in a permutation. St000747A variant of the major index of a set partition. St000216The absolute length of a permutation. St000316The number of non-left-to-right-maxima of a permutation. St000740The last entry of a permutation. St000796The stat' of a permutation. St001497The position of the largest weak excedence of a permutation. St000235The number of indices that are not cyclical small weak excedances. St000240The number of indices that are not small excedances. St000443The number of long tunnels of a Dyck path. St000673The number of non-fixed points of a permutation. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000722The number of different neighbourhoods in a graph. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000738The first entry in the last row of a standard tableau. St000824The sum of the number of descents and the number of recoils of a permutation. St000863The length of the first row of the shifted shape of a permutation. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. 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. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001458The rank of the adjacency matrix of a graph. St001725The harmonious chromatic number of a graph. St001778The largest greatest common divisor of an element and its image in a permutation. St000024The number of double up and double down steps of a Dyck path. St000060The greater neighbor of the maximum. St000171The degree of the graph. St000211The rank of the set partition. St000238The number of indices that are not small weak excedances. St000494The number of inversions of distance at most 3 of a permutation. St000495The number of inversions of distance at most 2 of a permutation. St000503The maximal difference between two elements in a common block. St000619The number of cyclic descents of a permutation. St000653The last descent of a permutation. St000831The number of indices that are either descents or recoils. St000841The largest opener of a perfect matching. St000956The maximal displacement of a permutation. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001117The game chromatic index of a graph. St001118The acyclic chromatic index of a graph. St001180Number of indecomposable injective modules with projective dimension at most 1. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001245The cyclic maximal difference between two consecutive entries of a permutation. St001246The maximal difference between two consecutive entries of a permutation. St001375The pancake length of a permutation. St001468The smallest fixpoint of a permutation. St001480The number of simple summands of the module J^2/J^3. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001760The number of prefix or suffix reversals needed to sort a permutation. St001807The lower middle entry of a permutation. St001883The mutual visibility number of a graph. St000133The "bounce" of a permutation. St000204The number of internal nodes of a binary tree. St000209Maximum difference of elements in cycles. St000222The number of alignments in the permutation. St000304The load of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000393The number of strictly increasing runs in a binary word. St000422The energy of a graph, if it is integral. St000605The number of occurrences of the pattern {{1},{2,3}} such that 3 is maximal, (2,3) are consecutive in a block. St000836The number of descents of distance 2 of a permutation. St001078The minimal number of occurrences of (12) in a factorization of a permutation into transpositions (12) and cycles (1,. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001388The number of non-attacking neighbors of a permutation. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001723The differential of a graph. St001724The 2-packing differential of a graph. St000711The number of big exceedences of a permutation. St001812The biclique partition number of a graph.
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!