Your data matches 95 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001001: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> 0
[1,0,1,0]
=> 0
[1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> 0
[1,1,0,0,1,0]
=> 0
[1,1,0,1,0,0]
=> 0
[1,1,1,0,0,0]
=> 3
[1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,0]
=> 0
[1,1,1,0,0,0,1,0]
=> 0
[1,1,1,0,0,1,0,0]
=> 0
[1,1,1,0,1,0,0,0]
=> 0
[1,1,1,1,0,0,0,0]
=> 6
[1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> 0
Description
The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path.
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00102: Dyck paths rise compositionInteger compositions
Mp00184: Integer compositions to threshold graphGraphs
St000455: Graphs ⟶ ℤResult quality: 17% values known / values provided: 66%distinct values known / distinct values provided: 17%
Values
[1,0]
=> [1,1,0,0]
=> [2] => ([],2)
=> ? = 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [2,1] => ([(0,2),(1,2)],3)
=> 0
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [3] => ([],3)
=> ? = 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> 0
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 0
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 0
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => ([],4)
=> ? = 3
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 0
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [2,3] => ([(2,4),(3,4)],5)
=> 0
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 0
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 0
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5] => ([],5)
=> ? = 6
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [2,1,1,2] => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [2,1,2,1] => ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [2,1,2,1] => ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [2,2,1,1] => ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [2,2,1,1] => ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [2,2,1,1] => ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [2,4] => ([(3,5),(4,5)],6)
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [3,1,1,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [3,3] => ([(2,5),(3,5),(4,5)],6)
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [3,1,1,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [3,1,1,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [3,1,1,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 0
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 0
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [3,3] => ([(2,5),(3,5),(4,5)],6)
=> 0
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> 0
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> 0
[1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
[1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> 0
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 0
[1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 0
[1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 0
[1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 0
[1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [6] => ([],6)
=> ? = 10
Description
The second largest eigenvalue of a graph if it is integral. This statistic is undefined if the second largest eigenvalue of the graph is not integral. Chapter 4 of [1] provides lots of context.
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
Mp00236: Permutations Clarke-Steingrimsson-Zeng inversePermutations
Mp00160: Permutations graph of inversionsGraphs
St000264: Graphs ⟶ ℤResult quality: 17% values known / values provided: 52%distinct values known / distinct values provided: 17%
Values
[1,0]
=> [1] => [1] => ([],1)
=> ? = 0 + 3
[1,0,1,0]
=> [2,1] => [2,1] => ([(0,1)],2)
=> ? = 0 + 3
[1,1,0,0]
=> [1,2] => [1,2] => ([],2)
=> ? = 1 + 3
[1,0,1,0,1,0]
=> [2,3,1] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 3 = 0 + 3
[1,0,1,1,0,0]
=> [2,1,3] => [2,1,3] => ([(1,2)],3)
=> ? = 0 + 3
[1,1,0,0,1,0]
=> [1,3,2] => [1,3,2] => ([(1,2)],3)
=> ? = 0 + 3
[1,1,0,1,0,0]
=> [3,1,2] => [3,1,2] => ([(0,2),(1,2)],3)
=> ? = 0 + 3
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => ([],3)
=> ? = 3 + 3
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 0 + 3
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 3 = 0 + 3
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => ([(0,3),(1,2)],4)
=> ? = 1 + 3
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [4,2,1,3] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 0 + 3
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => ([(2,3)],4)
=> ? = 0 + 3
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 3 = 0 + 3
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,3,2,4] => ([(2,3)],4)
=> ? = 0 + 3
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 0 + 3
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [4,1,3,2] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 0 + 3
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [3,1,2,4] => ([(1,3),(2,3)],4)
=> ? = 0 + 3
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,2,4,3] => ([(2,3)],4)
=> ? = 0 + 3
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,4,2,3] => ([(1,3),(2,3)],4)
=> ? = 0 + 3
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> ? = 0 + 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => ([],4)
=> ? = 6 + 3
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [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)
=> 3 = 0 + 3
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => ([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [5,3,2,1,4] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => ([(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => ([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> ? = 1 + 3
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [5,4,2,1,3] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [5,2,1,4,3] => ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [4,2,1,3,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> ? = 1 + 3
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [2,1,5,3,4] => ([(0,1),(2,4),(3,4)],5)
=> ? = 2 + 3
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [5,2,1,3,4] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => ([(3,4)],5)
=> ? = 0 + 3
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => ([(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> ? = 1 + 3
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,5,3,2,4] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => ([(3,4)],5)
=> ? = 0 + 3
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [5,4,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [4,3,1,2,5] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [5,4,1,3,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [5,1,4,3,2] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [4,1,3,2,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [3,1,2,5,4] => ([(0,1),(2,4),(3,4)],5)
=> ? = 2 + 3
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [5,3,1,2,4] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [5,1,3,2,4] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [3,1,2,4,5] => ([(2,4),(3,4)],5)
=> ? = 0 + 3
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => ([(3,4)],5)
=> ? = 0 + 3
[1,1,1,0,0,1,0,0,1,0]
=> [1,4,2,5,3] => [1,5,4,2,3] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => [1,5,2,4,3] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,1,0,0,1,1,0,0,0]
=> [1,4,2,3,5] => [1,4,2,3,5] => ([(2,4),(3,4)],5)
=> ? = 0 + 3
[1,1,1,0,1,0,0,0,1,0]
=> [4,1,2,5,3] => [5,4,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,1,0,1,0,0,1,0,0]
=> [4,1,5,2,3] => [5,1,2,4,3] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,1,0,1,0,1,0,0,0]
=> [4,5,1,2,3] => [5,1,4,2,3] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 0 + 3
[1,1,1,0,1,1,0,0,0,0]
=> [4,1,2,3,5] => [4,1,2,3,5] => ([(1,4),(2,4),(3,4)],5)
=> ? = 0 + 3
[1,1,1,1,0,0,0,0,1,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => ([(3,4)],5)
=> ? = 0 + 3
[1,1,1,1,0,0,0,1,0,0]
=> [1,2,5,3,4] => [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ? = 0 + 3
[1,1,1,1,0,0,1,0,0,0]
=> [1,5,2,3,4] => [1,5,2,3,4] => ([(1,4),(2,4),(3,4)],5)
=> ? = 0 + 3
[1,1,1,1,0,1,0,0,0,0]
=> [5,1,2,3,4] => [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ? = 0 + 3
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => ([],5)
=> ? = 10 + 3
Description
The girth of a graph, which is not a tree. This is the length of the shortest cycle in the graph.
Matching statistic: St001371
Mp00027: Dyck paths to partitionInteger partitions
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00093: Dyck paths to binary wordBinary words
St001371: Binary words ⟶ ℤResult quality: 17% values known / values provided: 48%distinct values known / distinct values provided: 17%
Values
[1,0]
=> []
=> []
=> => ? = 0
[1,0,1,0]
=> [1]
=> [1,0]
=> 10 => 0
[1,1,0,0]
=> []
=> []
=> => ? = 1
[1,0,1,0,1,0]
=> [2,1]
=> [1,0,1,1,0,0]
=> 101100 => 0
[1,0,1,1,0,0]
=> [1,1]
=> [1,1,0,0]
=> 1100 => 0
[1,1,0,0,1,0]
=> [2]
=> [1,0,1,0]
=> 1010 => 0
[1,1,0,1,0,0]
=> [1]
=> [1,0]
=> 10 => 0
[1,1,1,0,0,0]
=> []
=> []
=> => ? = 3
[1,0,1,0,1,0,1,0]
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1011100100 => ? = 0
[1,0,1,0,1,1,0,0]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 11100100 => 0
[1,0,1,1,0,0,1,0]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1010110100 => ? = 1
[1,0,1,1,0,1,0,0]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 10110100 => 0
[1,0,1,1,1,0,0,0]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 110100 => 0
[1,1,0,0,1,0,1,0]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> 10111000 => 0
[1,1,0,0,1,1,0,0]
=> [2,2]
=> [1,1,1,0,0,0]
=> 111000 => 0
[1,1,0,1,0,0,1,0]
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 10101100 => 0
[1,1,0,1,0,1,0,0]
=> [2,1]
=> [1,0,1,1,0,0]
=> 101100 => 0
[1,1,0,1,1,0,0,0]
=> [1,1]
=> [1,1,0,0]
=> 1100 => 0
[1,1,1,0,0,0,1,0]
=> [3]
=> [1,0,1,0,1,0]
=> 101010 => 0
[1,1,1,0,0,1,0,0]
=> [2]
=> [1,0,1,0]
=> 1010 => 0
[1,1,1,0,1,0,0,0]
=> [1]
=> [1,0]
=> 10 => 0
[1,1,1,1,0,0,0,0]
=> []
=> []
=> => ? = 6
[1,0,1,0,1,0,1,0,1,0]
=> [4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> 10111011000100 => ? = 0
[1,0,1,0,1,0,1,1,0,0]
=> [3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 111011000100 => ? = 0
[1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> 10101111000100 => ? = 0
[1,0,1,0,1,1,0,1,0,0]
=> [3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> 101111000100 => ? = 0
[1,0,1,0,1,1,1,0,0,0]
=> [2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1111000100 => ? = 0
[1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> 10111010010100 => ? = 0
[1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 111010010100 => ? = 1
[1,0,1,1,0,1,0,0,1,0]
=> [4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> 10101110010100 => ? = 0
[1,0,1,1,0,1,0,1,0,0]
=> [3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> 101110010100 => ? = 0
[1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1110010100 => ? = 0
[1,0,1,1,1,0,0,0,1,0]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> 10101011010100 => ? = 1
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 101011010100 => ? = 2
[1,0,1,1,1,0,1,0,0,0]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1011010100 => ? = 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 11010100 => 0
[1,1,0,0,1,0,1,0,1,0]
=> [4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> 101110110000 => ? = 0
[1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1110110000 => ? = 0
[1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 101011110000 => ? = 1
[1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1011110000 => ? = 0
[1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 11110000 => 0
[1,1,0,1,0,0,1,0,1,0]
=> [4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 101110100100 => ? = 0
[1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1110100100 => ? = 0
[1,1,0,1,0,1,0,0,1,0]
=> [4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> 101011100100 => ? = 0
[1,1,0,1,0,1,0,1,0,0]
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1011100100 => ? = 0
[1,1,0,1,0,1,1,0,0,0]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 11100100 => 0
[1,1,0,1,1,0,0,0,1,0]
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 101010110100 => ? = 2
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1010110100 => ? = 0
[1,1,0,1,1,0,1,0,0,0]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 10110100 => 0
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 110100 => 0
[1,1,1,0,0,0,1,0,1,0]
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1011101000 => ? = 0
[1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> 11101000 => 0
[1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1010111000 => ? = 0
[1,1,1,0,0,1,0,1,0,0]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> 10111000 => 0
[1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> [1,1,1,0,0,0]
=> 111000 => 0
[1,1,1,0,1,0,0,0,1,0]
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1010101100 => ? = 0
[1,1,1,0,1,0,0,1,0,0]
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 10101100 => 0
[1,1,1,0,1,0,1,0,0,0]
=> [2,1]
=> [1,0,1,1,0,0]
=> 101100 => 0
[1,1,1,0,1,1,0,0,0,0]
=> [1,1]
=> [1,1,0,0]
=> 1100 => 0
[1,1,1,1,0,0,0,0,1,0]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 10101010 => 0
[1,1,1,1,0,0,0,1,0,0]
=> [3]
=> [1,0,1,0,1,0]
=> 101010 => 0
[1,1,1,1,0,0,1,0,0,0]
=> [2]
=> [1,0,1,0]
=> 1010 => 0
[1,1,1,1,0,1,0,0,0,0]
=> [1]
=> [1,0]
=> 10 => 0
[1,1,1,1,1,0,0,0,0,0]
=> []
=> []
=> => ? = 10
Description
The length of the longest Yamanouchi prefix of a binary word. This is the largest index $i$ such that in each of the prefixes $w_1$, $w_1w_2$, $w_1w_2\dots w_i$ the number of zeros is greater than or equal to the number of ones.
Matching statistic: St001730
Mp00027: Dyck paths to partitionInteger partitions
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00093: Dyck paths to binary wordBinary words
St001730: Binary words ⟶ ℤResult quality: 17% values known / values provided: 48%distinct values known / distinct values provided: 17%
Values
[1,0]
=> []
=> []
=> => ? = 0
[1,0,1,0]
=> [1]
=> [1,0]
=> 10 => 0
[1,1,0,0]
=> []
=> []
=> => ? = 1
[1,0,1,0,1,0]
=> [2,1]
=> [1,0,1,1,0,0]
=> 101100 => 0
[1,0,1,1,0,0]
=> [1,1]
=> [1,1,0,0]
=> 1100 => 0
[1,1,0,0,1,0]
=> [2]
=> [1,0,1,0]
=> 1010 => 0
[1,1,0,1,0,0]
=> [1]
=> [1,0]
=> 10 => 0
[1,1,1,0,0,0]
=> []
=> []
=> => ? = 3
[1,0,1,0,1,0,1,0]
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1011100100 => ? = 0
[1,0,1,0,1,1,0,0]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 11100100 => 0
[1,0,1,1,0,0,1,0]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1010110100 => ? = 1
[1,0,1,1,0,1,0,0]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 10110100 => 0
[1,0,1,1,1,0,0,0]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 110100 => 0
[1,1,0,0,1,0,1,0]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> 10111000 => 0
[1,1,0,0,1,1,0,0]
=> [2,2]
=> [1,1,1,0,0,0]
=> 111000 => 0
[1,1,0,1,0,0,1,0]
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 10101100 => 0
[1,1,0,1,0,1,0,0]
=> [2,1]
=> [1,0,1,1,0,0]
=> 101100 => 0
[1,1,0,1,1,0,0,0]
=> [1,1]
=> [1,1,0,0]
=> 1100 => 0
[1,1,1,0,0,0,1,0]
=> [3]
=> [1,0,1,0,1,0]
=> 101010 => 0
[1,1,1,0,0,1,0,0]
=> [2]
=> [1,0,1,0]
=> 1010 => 0
[1,1,1,0,1,0,0,0]
=> [1]
=> [1,0]
=> 10 => 0
[1,1,1,1,0,0,0,0]
=> []
=> []
=> => ? = 6
[1,0,1,0,1,0,1,0,1,0]
=> [4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> 10111011000100 => ? = 0
[1,0,1,0,1,0,1,1,0,0]
=> [3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 111011000100 => ? = 0
[1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> 10101111000100 => ? = 0
[1,0,1,0,1,1,0,1,0,0]
=> [3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> 101111000100 => ? = 0
[1,0,1,0,1,1,1,0,0,0]
=> [2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1111000100 => ? = 0
[1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> 10111010010100 => ? = 0
[1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 111010010100 => ? = 1
[1,0,1,1,0,1,0,0,1,0]
=> [4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> 10101110010100 => ? = 0
[1,0,1,1,0,1,0,1,0,0]
=> [3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> 101110010100 => ? = 0
[1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1110010100 => ? = 0
[1,0,1,1,1,0,0,0,1,0]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> 10101011010100 => ? = 1
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 101011010100 => ? = 2
[1,0,1,1,1,0,1,0,0,0]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1011010100 => ? = 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 11010100 => 0
[1,1,0,0,1,0,1,0,1,0]
=> [4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> 101110110000 => ? = 0
[1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1110110000 => ? = 0
[1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 101011110000 => ? = 1
[1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1011110000 => ? = 0
[1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 11110000 => 0
[1,1,0,1,0,0,1,0,1,0]
=> [4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 101110100100 => ? = 0
[1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1110100100 => ? = 0
[1,1,0,1,0,1,0,0,1,0]
=> [4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> 101011100100 => ? = 0
[1,1,0,1,0,1,0,1,0,0]
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1011100100 => ? = 0
[1,1,0,1,0,1,1,0,0,0]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 11100100 => 0
[1,1,0,1,1,0,0,0,1,0]
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 101010110100 => ? = 2
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1010110100 => ? = 0
[1,1,0,1,1,0,1,0,0,0]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 10110100 => 0
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 110100 => 0
[1,1,1,0,0,0,1,0,1,0]
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1011101000 => ? = 0
[1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> 11101000 => 0
[1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1010111000 => ? = 0
[1,1,1,0,0,1,0,1,0,0]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> 10111000 => 0
[1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> [1,1,1,0,0,0]
=> 111000 => 0
[1,1,1,0,1,0,0,0,1,0]
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1010101100 => ? = 0
[1,1,1,0,1,0,0,1,0,0]
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 10101100 => 0
[1,1,1,0,1,0,1,0,0,0]
=> [2,1]
=> [1,0,1,1,0,0]
=> 101100 => 0
[1,1,1,0,1,1,0,0,0,0]
=> [1,1]
=> [1,1,0,0]
=> 1100 => 0
[1,1,1,1,0,0,0,0,1,0]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 10101010 => 0
[1,1,1,1,0,0,0,1,0,0]
=> [3]
=> [1,0,1,0,1,0]
=> 101010 => 0
[1,1,1,1,0,0,1,0,0,0]
=> [2]
=> [1,0,1,0]
=> 1010 => 0
[1,1,1,1,0,1,0,0,0,0]
=> [1]
=> [1,0]
=> 10 => 0
[1,1,1,1,1,0,0,0,0,0]
=> []
=> []
=> => ? = 10
Description
The number of times the path corresponding to a binary word crosses the base line. Interpret each $0$ as a step $(1,-1)$ and $1$ as a step $(1,1)$. Then this statistic counts the number of times the path crosses the $x$-axis.
Matching statistic: St001195
Mp00027: Dyck paths to partitionInteger partitions
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00199: Dyck paths prime Dyck pathDyck paths
St001195: Dyck paths ⟶ ℤResult quality: 17% values known / values provided: 42%distinct values known / distinct values provided: 17%
Values
[1,0]
=> []
=> []
=> [1,0]
=> ? = 0 + 1
[1,0,1,0]
=> [1]
=> [1,0]
=> [1,1,0,0]
=> ? = 0 + 1
[1,1,0,0]
=> []
=> []
=> [1,0]
=> ? = 1 + 1
[1,0,1,0,1,0]
=> [2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,1]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0]
=> [2]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0]
=> [1]
=> [1,0]
=> [1,1,0,0]
=> ? = 0 + 1
[1,1,1,0,0,0]
=> []
=> []
=> [1,0]
=> ? = 3 + 1
[1,0,1,0,1,0,1,0]
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> ? = 0 + 1
[1,0,1,0,1,1,0,0]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0]
=> [3,1,1]
=> [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,1,0,1,0,0]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,0]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0]
=> [2,2]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0]
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,0]
=> [2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0]
=> [1,1]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,0,1,0]
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0]
=> [2]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,1,0,1,0,0,0]
=> [1]
=> [1,0]
=> [1,1,0,0]
=> ? = 0 + 1
[1,1,1,1,0,0,0,0]
=> []
=> []
=> [1,0]
=> ? = 6 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> ? = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [3,3,2,1]
=> [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]
=> ? = 0 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,1,1,1,0,0,0,1,0,0,0]
=> ? = 0 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,1,1,0,0,0,1,0,0,0]
=> ? = 0 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> ? = 0 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,1,0,1,0,0,0]
=> ? = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [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,1,0,1,0,0,1,0]
=> [4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,0,1,0,1,0,0,0]
=> ? = 0 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,1,0,0,0]
=> ? = 0 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> ? = 0 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> ? = 1 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> ? = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> ? = 0 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,0,0]
=> ? = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> ? = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> ? = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,1,0,0,0]
=> ? = 0 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> ? = 0 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,1,1,1,0,0,1,0,0,0]
=> ? = 0 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> ? = 0 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> ? = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> ? = 0 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> ? = 0 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> ? = 0 + 1
[1,1,1,0,0,1,0,1,0,0]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,1,0,0,0,1,0]
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> ? = 0 + 1
[1,1,1,0,1,0,0,1,0,0]
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,1,0,1,0,0,0]
=> [2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,1]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[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 = 0 + 1
[1,1,1,1,0,0,0,1,0,0]
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,1,1,0,0,1,0,0,0]
=> [2]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,1,1,0,1,0,0,0,0]
=> [1]
=> [1,0]
=> [1,1,0,0]
=> ? = 0 + 1
[1,1,1,1,1,0,0,0,0,0]
=> []
=> []
=> [1,0]
=> ? = 10 + 1
Description
The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$.
Matching statistic: St000456
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
Mp00160: Permutations graph of inversionsGraphs
Mp00247: Graphs de-duplicateGraphs
St000456: Graphs ⟶ ℤResult quality: 17% values known / values provided: 34%distinct values known / distinct values provided: 17%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> ? = 0 + 1
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 1 = 0 + 1
[1,1,0,0]
=> [1,2] => ([],2)
=> ([],1)
=> ? = 1 + 1
[1,0,1,0,1,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [2,1,3] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,0,0,1,0]
=> [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,0,1,0,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1 = 0 + 1
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> ([],1)
=> ? = 3 + 1
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ? = 1 + 1
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 1 = 0 + 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1 = 0 + 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> ([],1)
=> ? = 6 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> ? = 0 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 1 = 0 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> ? = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ? = 1 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 0 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 1 = 0 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ? = 0 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ? = 1 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> ? = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 1 = 0 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ? = 1 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ? = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 1 = 0 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ? = 0 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 1 = 0 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 1 = 0 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> ? = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 0 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 1 = 0 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,4,2,5,3] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ? = 0 + 1
[1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,1,0,0,1,1,0,0,0]
=> [1,4,2,3,5] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,1,0,1,0,0,0,1,0]
=> [4,1,2,5,3] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 1 = 0 + 1
[1,1,1,0,1,0,0,1,0,0]
=> [4,1,5,2,3] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 1 = 0 + 1
[1,1,1,0,1,0,1,0,0,0]
=> [4,5,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 1 = 0 + 1
[1,1,1,0,1,1,0,0,0,0]
=> [4,1,2,3,5] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,1,1,0,0,0,1,0,0]
=> [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,5,2,3,4] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 1
[1,1,1,1,0,1,0,0,0,0]
=> [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1 = 0 + 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => ([],5)
=> ([],1)
=> ? = 10 + 1
Description
The monochromatic index of a connected graph. This is the maximal number of colours such that there is a colouring of the edges where any two vertices can be joined by a monochromatic path. For example, a circle graph other than the triangle can be coloured with at most two colours: one edge blue, all the others red.
Matching statistic: St001545
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
Mp00160: Permutations graph of inversionsGraphs
Mp00247: Graphs de-duplicateGraphs
St001545: Graphs ⟶ ℤResult quality: 17% values known / values provided: 34%distinct values known / distinct values provided: 17%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> ? = 0 + 2
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 2 = 0 + 2
[1,1,0,0]
=> [1,2] => ([],2)
=> ([],1)
=> ? = 1 + 2
[1,0,1,0,1,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2 = 0 + 2
[1,0,1,1,0,0]
=> [2,1,3] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,0,0,1,0]
=> [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,0,1,0,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2 = 0 + 2
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> ([],1)
=> ? = 3 + 2
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2 = 0 + 2
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ? = 1 + 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 0 + 2
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 0 + 2
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 2 = 0 + 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2 = 0 + 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> ([],1)
=> ? = 6 + 2
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2 = 0 + 2
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> ? = 0 + 2
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 0 + 2
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> ? = 0 + 2
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ? = 1 + 2
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 0 + 2
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 0 + 2
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ? = 0 + 2
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ? = 1 + 2
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> ? = 2 + 2
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 0 + 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ? = 1 + 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ? = 0 + 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 0 + 2
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ? = 0 + 2
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 0 + 2
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 2 = 0 + 2
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> ? = 2 + 2
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 0 + 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 0 + 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,1,0,0,1,0,0,1,0]
=> [1,4,2,5,3] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ? = 0 + 2
[1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,1,0,0,1,1,0,0,0]
=> [1,4,2,3,5] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,1,0,1,0,0,0,1,0]
=> [4,1,2,5,3] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 0 + 2
[1,1,1,0,1,0,0,1,0,0]
=> [4,1,5,2,3] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 0 + 2
[1,1,1,0,1,0,1,0,0,0]
=> [4,5,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 2 = 0 + 2
[1,1,1,0,1,1,0,0,0,0]
=> [4,1,2,3,5] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,1,1,0,0,0,0,1,0]
=> [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,1,1,0,0,0,1,0,0]
=> [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,1,1,0,0,1,0,0,0]
=> [1,5,2,3,4] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 0 + 2
[1,1,1,1,0,1,0,0,0,0]
=> [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2 = 0 + 2
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => ([],5)
=> ([],1)
=> ? = 10 + 2
Description
The second Elser number of a connected graph. For a connected graph $G$ the $k$-th Elser number is $$ els_k(G) = (-1)^{|V(G)|+1} \sum_N (-1)^{|E(N)|} |V(N)|^k $$ where the sum is over all nuclei of $G$, that is, the connected subgraphs of $G$ whose vertex set is a vertex cover of $G$. It is clear that this number is even. It was shown in [1] that it is non-negative.
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00123: Dyck paths Barnabei-Castronuovo involutionDyck paths
St001198: Dyck paths ⟶ ℤResult quality: 28% values known / values provided: 28%distinct values known / distinct values provided: 33%
Values
[1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> ? = 0 + 2
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 0 + 2
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> ? = 1 + 2
[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,1,0,0,1,0,0]
=> 2 = 0 + 2
[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]
=> 2 = 0 + 2
[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,0,1,1,1,0,0,1,0,0]
=> 2 = 0 + 2
[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,0,1,1,1,0,0,0,1,0]
=> 2 = 0 + 2
[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,1,0,0,0,0,0]
=> ? = 3 + 2
[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,0,1,0,1,1,0,0,1,0,1,0]
=> 2 = 0 + 2
[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,0,1,0,1,1,0,0,1,1,0,0]
=> 2 = 0 + 2
[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,1,0,1,1,0,0,1,0,0,0]
=> 3 = 1 + 2
[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,1,0,1,1,0,0,0,1,0,0]
=> 2 = 0 + 2
[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,1,0,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[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,0,0,1,1,0,0,1,0,1,0]
=> 2 = 0 + 2
[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,0,0,1,1,0,0,1,1,0,0]
=> 2 = 0 + 2
[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,0,1,1,1,0,0,1,0,0,0]
=> 2 = 0 + 2
[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,0,1,1,1,0,0,0,1,0,0]
=> 2 = 0 + 2
[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,0,1,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[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,0,1,1,1,1,0,0,1,0,0,0]
=> 2 = 0 + 2
[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,0,1,1,1,1,0,0,0,1,0,0]
=> 2 = 0 + 2
[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,0,1,1,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[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,1,0,0,0,0,0,0]
=> ? = 6 + 2
[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,1,0,0,1,0,1,0,0]
=> ? = 0 + 2
[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,1,0,0,1,1,0,0,0]
=> ? = 0 + 2
[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]
=> ? = 0 + 2
[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,0,0,1,0,1,0]
=> ? = 0 + 2
[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,0,0,0,1,1,0,0]
=> ? = 0 + 2
[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,0,1,1,0,1,1,0,0,1,0,1,0,0]
=> ? = 0 + 2
[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,0,1,1,0,1,1,0,0,1,1,0,0,0]
=> ? = 1 + 2
[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,0,1,1,0,1,1,0,0,1,0,0,1,0]
=> ? = 0 + 2
[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,0,1,1,0,1,1,0,0,0,1,0,1,0]
=> ? = 0 + 2
[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,0,1,1,0,1,1,0,0,0,1,1,0,0]
=> ? = 0 + 2
[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,1,1,0,1,1,0,0,1,0,0,0,0]
=> ? = 1 + 2
[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,1,1,0,1,1,0,0,0,1,0,0,0]
=> ? = 2 + 2
[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,1,1,0,1,1,0,0,0,0,1,0,0]
=> ? = 0 + 2
[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,1,1,0,1,1,0,0,0,0,0,1,0]
=> ? = 0 + 2
[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,1,0,0,1,0,1,0,0]
=> ? = 0 + 2
[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,1,0,0,1,1,0,0,0]
=> ? = 0 + 2
[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]
=> ? = 1 + 2
[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,0,0,1,0,1,0]
=> ? = 0 + 2
[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,0,0,0,1,1,0,0]
=> ? = 0 + 2
[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,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> ? = 0 + 2
[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,0,1,0,1,1,1,0,0,1,1,0,0,0]
=> ? = 0 + 2
[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,0,1,0,1,1,1,0,0,1,0,0,1,0]
=> ? = 0 + 2
[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,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 0 + 2
[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,0,1,0,1,1,1,0,0,0,1,1,0,0]
=> ? = 0 + 2
[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,1,0,0,1,0,0,0,0]
=> ? = 2 + 2
[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,1,0,0,0,1,0,0,0]
=> ? = 0 + 2
[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,1,0,0,0,0,1,0,0]
=> ? = 0 + 2
[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]
=> ? = 0 + 2
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,1,0,0]
=> ? = 0 + 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,0,0,1,1,0,0,0]
=> ? = 0 + 2
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0,1,0]
=> ? = 0 + 2
[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,1,1,0,0,1,0,1,0,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 0 + 2
[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,1,1,0,0,1,1,0,0,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,1,0,0]
=> ? = 0 + 2
[1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,1,0,0,0]
=> [1,1,0,1,1,1,1,0,0,1,0,0,0,0]
=> ? = 0 + 2
[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,1,1,0,1,0,0,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,1,0,0,0]
=> ? = 0 + 2
[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,1,1,0,1,0,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,1,0,0]
=> ? = 0 + 2
[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,1,1,0,1,1,0,0,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0,1,0]
=> ? = 0 + 2
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> [1,0,1,1,1,1,1,0,0,1,0,0,0,0]
=> ? = 0 + 2
[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,1,1,0,0,0,1,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,1,0,0,0]
=> ? = 0 + 2
[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,1,1,0,0,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,1,0,0]
=> ? = 0 + 2
[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,1,1,0,1,0,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> ? = 0 + 2
[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,1,1,0,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? = 10 + 2
Description
The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$.
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00123: Dyck paths Barnabei-Castronuovo involutionDyck paths
St001206: Dyck paths ⟶ ℤResult quality: 28% values known / values provided: 28%distinct values known / distinct values provided: 33%
Values
[1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> ? = 0 + 2
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 0 + 2
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> ? = 1 + 2
[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,1,0,0,1,0,0]
=> 2 = 0 + 2
[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]
=> 2 = 0 + 2
[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,0,1,1,1,0,0,1,0,0]
=> 2 = 0 + 2
[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,0,1,1,1,0,0,0,1,0]
=> 2 = 0 + 2
[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,1,0,0,0,0,0]
=> ? = 3 + 2
[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,0,1,0,1,1,0,0,1,0,1,0]
=> 2 = 0 + 2
[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,0,1,0,1,1,0,0,1,1,0,0]
=> 2 = 0 + 2
[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,1,0,1,1,0,0,1,0,0,0]
=> 3 = 1 + 2
[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,1,0,1,1,0,0,0,1,0,0]
=> 2 = 0 + 2
[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,1,0,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[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,0,0,1,1,0,0,1,0,1,0]
=> 2 = 0 + 2
[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,0,0,1,1,0,0,1,1,0,0]
=> 2 = 0 + 2
[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,0,1,1,1,0,0,1,0,0,0]
=> 2 = 0 + 2
[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,0,1,1,1,0,0,0,1,0,0]
=> 2 = 0 + 2
[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,0,1,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[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,0,1,1,1,1,0,0,1,0,0,0]
=> 2 = 0 + 2
[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,0,1,1,1,1,0,0,0,1,0,0]
=> 2 = 0 + 2
[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,0,1,1,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[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,1,0,0,0,0,0,0]
=> ? = 6 + 2
[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,1,0,0,1,0,1,0,0]
=> ? = 0 + 2
[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,1,0,0,1,1,0,0,0]
=> ? = 0 + 2
[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]
=> ? = 0 + 2
[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,0,0,1,0,1,0]
=> ? = 0 + 2
[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,0,0,0,1,1,0,0]
=> ? = 0 + 2
[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,0,1,1,0,1,1,0,0,1,0,1,0,0]
=> ? = 0 + 2
[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,0,1,1,0,1,1,0,0,1,1,0,0,0]
=> ? = 1 + 2
[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,0,1,1,0,1,1,0,0,1,0,0,1,0]
=> ? = 0 + 2
[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,0,1,1,0,1,1,0,0,0,1,0,1,0]
=> ? = 0 + 2
[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,0,1,1,0,1,1,0,0,0,1,1,0,0]
=> ? = 0 + 2
[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,1,1,0,1,1,0,0,1,0,0,0,0]
=> ? = 1 + 2
[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,1,1,0,1,1,0,0,0,1,0,0,0]
=> ? = 2 + 2
[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,1,1,0,1,1,0,0,0,0,1,0,0]
=> ? = 0 + 2
[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,1,1,0,1,1,0,0,0,0,0,1,0]
=> ? = 0 + 2
[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,1,0,0,1,0,1,0,0]
=> ? = 0 + 2
[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,1,0,0,1,1,0,0,0]
=> ? = 0 + 2
[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]
=> ? = 1 + 2
[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,0,0,1,0,1,0]
=> ? = 0 + 2
[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,0,0,0,1,1,0,0]
=> ? = 0 + 2
[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,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> ? = 0 + 2
[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,0,1,0,1,1,1,0,0,1,1,0,0,0]
=> ? = 0 + 2
[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,0,1,0,1,1,1,0,0,1,0,0,1,0]
=> ? = 0 + 2
[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,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 0 + 2
[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,0,1,0,1,1,1,0,0,0,1,1,0,0]
=> ? = 0 + 2
[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,1,0,0,1,0,0,0,0]
=> ? = 2 + 2
[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,1,0,0,0,1,0,0,0]
=> ? = 0 + 2
[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,1,0,0,0,0,1,0,0]
=> ? = 0 + 2
[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]
=> ? = 0 + 2
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,1,0,0]
=> ? = 0 + 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,0,0,1,1,0,0,0]
=> ? = 0 + 2
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0,1,0]
=> ? = 0 + 2
[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,1,1,0,0,1,0,1,0,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0,1,0]
=> ? = 0 + 2
[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,1,1,0,0,1,1,0,0,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,1,0,0]
=> ? = 0 + 2
[1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,1,0,0,0]
=> [1,1,0,1,1,1,1,0,0,1,0,0,0,0]
=> ? = 0 + 2
[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,1,1,0,1,0,0,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,1,0,0,0]
=> ? = 0 + 2
[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,1,1,0,1,0,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,1,0,0]
=> ? = 0 + 2
[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,1,1,0,1,1,0,0,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0,1,0]
=> ? = 0 + 2
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> [1,0,1,1,1,1,1,0,0,1,0,0,0,0]
=> ? = 0 + 2
[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,1,1,0,0,0,1,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,1,0,0,0]
=> ? = 0 + 2
[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,1,1,0,0,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,1,0,0]
=> ? = 0 + 2
[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,1,1,0,1,0,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> ? = 0 + 2
[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,1,1,0,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? = 10 + 2
Description
The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$.
The following 85 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001060The distinguishing index of a graph. St001722The number of minimal chains with small intervals between a binary word and the top element. St001330The hat guessing number of a graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000225Difference between largest and smallest parts in a partition. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000567The sum of the products of all pairs of parts. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000929The constant term of the character polynomial of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001175The size of a partition minus the hook length of the base cell. St001176The size of a partition minus its first part. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001525The number of symmetric hooks on the diagonal of a partition. St001561The value of the elementary symmetric function evaluated at 1. St001586The number of odd parts smaller than the largest even part in an integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001961The sum of the greatest common divisors of all pairs of parts. St000284The Plancherel distribution on integer partitions. St000618The number of self-evacuating tableaux of given shape. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000706The product of the factorials of the multiplicities of an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St000782The indicator function of whether a given perfect matching is an L & P matching. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000934The 2-degree of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001052The length of the exterior of a permutation. St001128The exponens consonantiae of a partition. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001280The number of parts of an integer partition that are at least two. St001432The order dimension of the partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001568The smallest positive integer that does not appear twice in the partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St000360The number of occurrences of the pattern 32-1. St000367The number of simsun double descents of a permutation. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000694The number of affine bounded permutations that project to a given permutation. St000454The largest eigenvalue of a graph if it is integral.