Your data matches 29 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Mp00203: Graphs coneGraphs
St001331: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> ([(0,1)],2)
=> 0
([],2)
=> ([(0,2),(1,2)],3)
=> 0
([(0,1)],2)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
([],3)
=> ([(0,3),(1,3),(2,3)],4)
=> 0
([(1,2)],3)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,2),(1,2)],3)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([],4)
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 0
([(2,3)],4)
=> ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,3),(2,3)],4)
=> ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(1,2)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
([(1,2),(1,3),(2,3)],4)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([],5)
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 0
([(3,4)],5)
=> ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(1,4),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(1,4),(2,3)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 1
([(1,4),(2,3),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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)
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,5),(1,2),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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)
=> 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(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)
=> 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3
Description
The size of the minimal feedback vertex set. A feedback vertex set is a set of vertices whose removal results in an acyclic graph.
St000272: Graphs ⟶ ℤResult quality: 98% values known / values provided: 98%distinct values known / distinct values provided: 100%
Values
([],1)
=> 0
([],2)
=> 0
([(0,1)],2)
=> 1
([],3)
=> 0
([(1,2)],3)
=> 1
([(0,2),(1,2)],3)
=> 1
([(0,1),(0,2),(1,2)],3)
=> 2
([],4)
=> 0
([(2,3)],4)
=> 1
([(1,3),(2,3)],4)
=> 1
([(0,3),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2)],4)
=> 1
([(0,3),(1,2),(2,3)],4)
=> 1
([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([],5)
=> 0
([(3,4)],5)
=> 1
([(2,4),(3,4)],5)
=> 1
([(1,4),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
([(1,4),(2,3)],5)
=> 1
([(1,4),(2,3),(3,4)],5)
=> 1
([(0,1),(2,4),(3,4)],5)
=> 1
([(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3
([],0)
=> ? = 0
Description
The treewidth of a graph. A graph has treewidth zero if and only if it has no edges. A connected graph has treewidth at most one if and only if it is a tree. A connected graph has treewidth at most two if and only if it is a series-parallel graph.
St000536: Graphs ⟶ ℤResult quality: 98% values known / values provided: 98%distinct values known / distinct values provided: 100%
Values
([],1)
=> 0
([],2)
=> 0
([(0,1)],2)
=> 1
([],3)
=> 0
([(1,2)],3)
=> 1
([(0,2),(1,2)],3)
=> 1
([(0,1),(0,2),(1,2)],3)
=> 2
([],4)
=> 0
([(2,3)],4)
=> 1
([(1,3),(2,3)],4)
=> 1
([(0,3),(1,3),(2,3)],4)
=> 1
([(0,3),(1,2)],4)
=> 1
([(0,3),(1,2),(2,3)],4)
=> 1
([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([],5)
=> 0
([(3,4)],5)
=> 1
([(2,4),(3,4)],5)
=> 1
([(1,4),(2,4),(3,4)],5)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
([(1,4),(2,3)],5)
=> 1
([(1,4),(2,3),(3,4)],5)
=> 1
([(0,1),(2,4),(3,4)],5)
=> 1
([(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 3
([],0)
=> ? = 0
Description
The pathwidth of a graph.
St000822: Graphs ⟶ ℤResult quality: 98% values known / values provided: 98%distinct values known / distinct values provided: 100%
Values
([],1)
=> 1 = 0 + 1
([],2)
=> 1 = 0 + 1
([(0,1)],2)
=> 2 = 1 + 1
([],3)
=> 1 = 0 + 1
([(1,2)],3)
=> 2 = 1 + 1
([(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> 3 = 2 + 1
([],4)
=> 1 = 0 + 1
([(2,3)],4)
=> 2 = 1 + 1
([(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,3),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,3),(1,2)],4)
=> 2 = 1 + 1
([(0,3),(1,2),(2,3)],4)
=> 2 = 1 + 1
([(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> 3 = 2 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
([],5)
=> 1 = 0 + 1
([(3,4)],5)
=> 2 = 1 + 1
([(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,4),(2,3)],5)
=> 2 = 1 + 1
([(1,4),(2,3),(3,4)],5)
=> 2 = 1 + 1
([(0,1),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> 2 = 1 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3 = 2 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 4 = 3 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
([],0)
=> ? = 0 + 1
Description
The Hadwiger number of the graph. Also known as clique contraction number, this is the size of the largest complete minor.
St001580: Graphs ⟶ ℤResult quality: 98% values known / values provided: 98%distinct values known / distinct values provided: 100%
Values
([],1)
=> 1 = 0 + 1
([],2)
=> 1 = 0 + 1
([(0,1)],2)
=> 2 = 1 + 1
([],3)
=> 1 = 0 + 1
([(1,2)],3)
=> 2 = 1 + 1
([(0,2),(1,2)],3)
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> 3 = 2 + 1
([],4)
=> 1 = 0 + 1
([(2,3)],4)
=> 2 = 1 + 1
([(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,3),(1,3),(2,3)],4)
=> 2 = 1 + 1
([(0,3),(1,2)],4)
=> 2 = 1 + 1
([(0,3),(1,2),(2,3)],4)
=> 2 = 1 + 1
([(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> 3 = 2 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4 = 3 + 1
([],5)
=> 1 = 0 + 1
([(3,4)],5)
=> 2 = 1 + 1
([(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(1,4),(2,3)],5)
=> 2 = 1 + 1
([(1,4),(2,3),(3,4)],5)
=> 2 = 1 + 1
([(0,1),(2,4),(3,4)],5)
=> 2 = 1 + 1
([(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> 2 = 1 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 3 = 2 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> 3 = 2 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 3 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 4 = 3 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
([],0)
=> ? = 0 + 1
Description
The acyclic chromatic number of a graph. This is the smallest size of a vertex partition $\{V_1,\dots,V_k\}$ such that each $V_i$ is an independent set and for all $i,j$ the subgraph inducted by $V_i\cup V_j$ does not contain a cycle.
Mp00276: Graphs to edge-partition of biconnected componentsInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00121: Dyck paths Cori-Le Borgne involutionDyck paths
St000955: Dyck paths ⟶ ℤResult quality: 50% values known / values provided: 67%distinct values known / distinct values provided: 50%
Values
([],1)
=> []
=> []
=> []
=> ? = 0
([],2)
=> []
=> []
=> []
=> ? = 0
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([],3)
=> []
=> []
=> []
=> ? = 0
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
([],4)
=> []
=> []
=> []
=> ? = 0
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> ? = 3
([],5)
=> []
=> []
=> []
=> ? = 0
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> [1,0,1,0]
=> 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> ? = 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0]
=> ? = 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> ? = 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0]
=> ? = 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> ? = 3
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [1,0,1,1,1,1,1,0,0,1,0,0,0,0]
=> ? = 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0]
=> ? = 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0]
=> ? = 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0]
=> ? = 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0,0,0]
=> ? = 3
([],0)
=> ?
=> ?
=> ?
=> ? = 0
Description
Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra.
Matching statistic: St001553
Mp00276: Graphs to edge-partition of biconnected componentsInteger partitions
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00227: Dyck paths Delest-Viennot-inverseDyck paths
St001553: Dyck paths ⟶ ℤResult quality: 50% values known / values provided: 63%distinct values known / distinct values provided: 50%
Values
([],1)
=> []
=> []
=> []
=> ? = 0 - 1
([],2)
=> []
=> []
=> []
=> ? = 0 - 1
([(0,1)],2)
=> [1]
=> [1,0]
=> [1,0]
=> 0 = 1 - 1
([],3)
=> []
=> []
=> []
=> ? = 0 - 1
([(1,2)],3)
=> [1]
=> [1,0]
=> [1,0]
=> 0 = 1 - 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 2 - 1
([],4)
=> []
=> []
=> []
=> ? = 0 - 1
([(2,3)],4)
=> [1]
=> [1,0]
=> [1,0]
=> 0 = 1 - 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 2 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 3 - 1
([],5)
=> []
=> []
=> []
=> ? = 0 - 1
([(3,4)],5)
=> [1]
=> [1,0]
=> [1,0]
=> 0 = 1 - 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1 = 2 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> ? = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? = 2 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? = 2 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> ? = 2 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 3 - 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? = 3 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 3 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? = 3 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 3 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0]
=> ? = 3 - 1
([],0)
=> ?
=> ?
=> ?
=> ? = 0 - 1
Description
The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. The statistic returns zero in case that bimodule is the zero module.
Mp00324: Graphs chromatic difference sequenceInteger compositions
Mp00038: Integer compositions reverseInteger compositions
Mp00184: Integer compositions to threshold graphGraphs
St000454: Graphs ⟶ ℤResult quality: 60% values known / values provided: 60%distinct values known / distinct values provided: 100%
Values
([],1)
=> [1] => [1] => ([],1)
=> 0
([],2)
=> [2] => [2] => ([],2)
=> 0
([(0,1)],2)
=> [1,1] => [1,1] => ([(0,1)],2)
=> 1
([],3)
=> [3] => [3] => ([],3)
=> 0
([(1,2)],3)
=> [2,1] => [1,2] => ([(1,2)],3)
=> 1
([(0,2),(1,2)],3)
=> [2,1] => [1,2] => ([(1,2)],3)
=> 1
([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 2
([],4)
=> [4] => [4] => ([],4)
=> 0
([(2,3)],4)
=> [3,1] => [1,3] => ([(2,3)],4)
=> 1
([(1,3),(2,3)],4)
=> [3,1] => [1,3] => ([(2,3)],4)
=> 1
([(0,3),(1,3),(2,3)],4)
=> [3,1] => [1,3] => ([(2,3)],4)
=> 1
([(0,3),(1,2)],4)
=> [2,2] => [2,2] => ([(1,3),(2,3)],4)
=> ? = 1
([(0,3),(1,2),(2,3)],4)
=> [2,2] => [2,2] => ([(1,3),(2,3)],4)
=> ? = 1
([(1,2),(1,3),(2,3)],4)
=> [2,1,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2] => [2,2] => ([(1,3),(2,3)],4)
=> ? = 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
([],5)
=> [5] => [5] => ([],5)
=> 0
([(3,4)],5)
=> [4,1] => [1,4] => ([(3,4)],5)
=> 1
([(2,4),(3,4)],5)
=> [4,1] => [1,4] => ([(3,4)],5)
=> 1
([(1,4),(2,4),(3,4)],5)
=> [4,1] => [1,4] => ([(3,4)],5)
=> 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [4,1] => [1,4] => ([(3,4)],5)
=> 1
([(1,4),(2,3)],5)
=> [3,2] => [2,3] => ([(2,4),(3,4)],5)
=> ? = 1
([(1,4),(2,3),(3,4)],5)
=> [3,2] => [2,3] => ([(2,4),(3,4)],5)
=> ? = 1
([(0,1),(2,4),(3,4)],5)
=> [3,2] => [2,3] => ([(2,4),(3,4)],5)
=> ? = 1
([(2,3),(2,4),(3,4)],5)
=> [3,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> [3,2] => [2,3] => ([(2,4),(3,4)],5)
=> ? = 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> [3,2] => [2,3] => ([(2,4),(3,4)],5)
=> ? = 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2] => [2,3] => ([(2,4),(3,4)],5)
=> ? = 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [3,2] => [2,3] => ([(2,4),(3,4)],5)
=> ? = 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> [3,2] => [2,3] => ([(2,4),(3,4)],5)
=> ? = 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 3
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3
([],0)
=> ? => ? => ?
=> ? = 0
Description
The largest eigenvalue of a graph if it is integral. If a graph is $d$-regular, then its largest eigenvalue equals $d$. One can show that the largest eigenvalue always lies between the average degree and the maximal degree. This statistic is undefined if the largest eigenvalue of the graph is not integral.
Mp00276: Graphs to edge-partition of biconnected componentsInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00032: Dyck paths inverse zeta mapDyck paths
St001526: Dyck paths ⟶ ℤResult quality: 50% values known / values provided: 58%distinct values known / distinct values provided: 50%
Values
([],1)
=> []
=> []
=> []
=> ? = 0 + 1
([],2)
=> []
=> []
=> []
=> ? = 0 + 1
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 2 = 1 + 1
([],3)
=> []
=> []
=> []
=> ? = 0 + 1
([(1,2)],3)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 2 = 1 + 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
([],4)
=> []
=> []
=> []
=> ? = 0 + 1
([(2,3)],4)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 2 = 1 + 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 3 = 2 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3 = 2 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 2 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 3 + 1
([],5)
=> []
=> []
=> []
=> ? = 0 + 1
([(3,4)],5)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 2 = 1 + 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 3 = 2 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3 = 2 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3 = 2 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 2 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> ? = 2 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 2 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 2 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 3 = 2 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 2 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 2 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 2 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> ? = 2 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 3 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> ? = 3 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 3 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 3 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 3 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 3 + 1
([],0)
=> ?
=> ?
=> ?
=> ? = 0 + 1
Description
The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001431
Mp00276: Graphs to edge-partition of biconnected componentsInteger partitions
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00227: Dyck paths Delest-Viennot-inverseDyck paths
St001431: Dyck paths ⟶ ℤResult quality: 50% values known / values provided: 56%distinct values known / distinct values provided: 50%
Values
([],1)
=> []
=> []
=> []
=> ? = 0 - 1
([],2)
=> []
=> []
=> []
=> ? = 0 - 1
([(0,1)],2)
=> [1]
=> [1,0]
=> [1,0]
=> ? = 1 - 1
([],3)
=> []
=> []
=> []
=> ? = 0 - 1
([(1,2)],3)
=> [1]
=> [1,0]
=> [1,0]
=> ? = 1 - 1
([(0,2),(1,2)],3)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 2 - 1
([],4)
=> []
=> []
=> []
=> ? = 0 - 1
([(2,3)],4)
=> [1]
=> [1,0]
=> [1,0]
=> ? = 1 - 1
([(1,3),(2,3)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
([(0,3),(1,3),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 2 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 3 - 1
([],5)
=> []
=> []
=> []
=> ? = 0 - 1
([(3,4)],5)
=> [1]
=> [1,0]
=> [1,0]
=> ? = 1 - 1
([(2,4),(3,4)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1 = 2 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> ? = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? = 2 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 2 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? = 2 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> ? = 2 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 3 - 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> ? = 3 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 3 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? = 3 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 3 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [9]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0]
=> ? = 3 - 1
([],0)
=> ?
=> ?
=> ?
=> ? = 0 - 1
Description
Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. The modified algebra B is obtained from the stable Auslander algebra kQ/I by deleting all relations which contain walks of length at least three (conjectural this step of deletion is not necessary as the stable higher Auslander algebras might be quadratic) and taking as B then the algebra kQ^(op)/J when J is the quadratic perp of the ideal I. See http://www.findstat.org/DyckPaths/NakayamaAlgebras for the definition of Loewy length and Nakayama algebras associated to Dyck paths.
The following 19 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001651The Frankl number of a lattice. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000741The Colin de Verdière graph invariant. St001890The maximum magnitude of the Möbius function of a poset. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001875The number of simple modules with projective dimension at most 1. St001330The hat guessing number of a graph. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001060The distinguishing index of a graph. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St001845The number of join irreducibles minus the rank of a lattice. St001645The pebbling number of a connected graph. St000455The second largest eigenvalue of a graph if it is integral.