searching the database
Your data matches 424 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000259
(load all 14 compositions to match this statistic)
(load all 14 compositions to match this statistic)
Values
[1] => ([],1)
=> ([],1)
=> 0
[1,1] => ([(0,1)],2)
=> ([],1)
=> 0
[1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 0
[2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[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)],2)
=> 1
[2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,1,1,1] => ([(0,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)
=> ([],1)
=> 0
[1,1,1,2,1] => ([(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)],2)
=> 1
[1,1,2,1,1] => ([(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)],2)
=> 1
[1,1,3,1] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,1,1,1] => ([(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)],2)
=> 1
[1,2,2,1] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,3,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[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)],2)
=> 1
[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,2),(1,2)],3)
=> 1
[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,2),(1,2)],3)
=> 1
[2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[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),(0,2),(1,2)],3)
=> 1
[3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([],1)
=> 0
[1,1,1,1,2,1] => ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,1,1,2,1,1] => ([(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,1,1,3,1] => ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,2,1,1,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,1,2,2,1] => ([(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,3,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,4,1] => ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,2,1,1,1,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,2,1,2,1] => ([(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,2,1,1] => ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,1,1,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,3,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,4,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,5,1] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[2,1,1,2,1] => ([(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
Description
The diameter of a connected graph.
This is the greatest distance between any pair of vertices.
Matching statistic: St000260
(load all 37 compositions to match this statistic)
(load all 37 compositions to match this statistic)
Values
[1] => ([],1)
=> ([],1)
=> 0
[1,1] => ([(0,1)],2)
=> ([],1)
=> 0
[1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 0
[2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[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)],2)
=> 1
[2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,1,1,1] => ([(0,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)
=> ([],1)
=> 0
[1,1,1,2,1] => ([(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)],2)
=> 1
[1,1,2,1,1] => ([(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)],2)
=> 1
[1,1,3,1] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,1,1,1] => ([(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)],2)
=> 1
[1,2,2,1] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,3,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[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)],2)
=> 1
[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,2),(1,2)],3)
=> 1
[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,2),(1,2)],3)
=> 1
[2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[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),(0,2),(1,2)],3)
=> 1
[3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([],1)
=> 0
[1,1,1,1,2,1] => ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,1,1,2,1,1] => ([(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,1,1,3,1] => ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,2,1,1,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,1,2,2,1] => ([(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,3,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,4,1] => ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,2,1,1,1,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,2,1,2,1] => ([(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,2,1,1] => ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,1,1,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,3,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,4,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,5,1] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[2,1,1,2,1] => ([(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
Description
The radius of a connected graph.
This is the minimum eccentricity of any vertex.
Matching statistic: St000535
(load all 43 compositions to match this statistic)
(load all 43 compositions to match this statistic)
Mp00041: Integer compositions —conjugate⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000535: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000535: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> 0
[1,1] => [2] => ([],2)
=> 0
[1,1,1] => [3] => ([],3)
=> 0
[2,1] => [2,1] => ([(0,2),(1,2)],3)
=> 1
[1,1,1,1] => [4] => ([],4)
=> 0
[1,2,1] => [2,2] => ([(1,3),(2,3)],4)
=> 1
[2,1,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,1,1] => [5] => ([],5)
=> 0
[1,1,2,1] => [2,3] => ([(2,4),(3,4)],5)
=> 1
[1,2,1,1] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,3,1] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[2,1,1,1] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[2,2,1] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[3,1,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[4,1] => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,1,1,1,1] => [6] => ([],6)
=> 0
[1,1,1,2,1] => [2,4] => ([(3,5),(4,5)],6)
=> 1
[1,1,2,1,1] => [3,3] => ([(2,5),(3,5),(4,5)],6)
=> 1
[1,1,3,1] => [2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[1,2,1,1,1] => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[1,2,2,1] => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[1,3,1,1] => [3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[1,4,1] => [2,1,1,2] => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,1,1,1,1] => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[2,1,2,1] => [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,2,1,1] => [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[2,3,1] => [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)
=> 1
[3,1,1,1] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[3,2,1] => [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)
=> 1
[4,1,1] => [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)
=> 1
[5,1] => [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)
=> 1
[1,1,1,1,1,1,1] => [7] => ([],7)
=> 0
[1,1,1,1,2,1] => [2,5] => ([(4,6),(5,6)],7)
=> 1
[1,1,1,2,1,1] => [3,4] => ([(3,6),(4,6),(5,6)],7)
=> 1
[1,1,1,3,1] => [2,1,4] => ([(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[1,1,2,1,1,1] => [4,3] => ([(2,6),(3,6),(4,6),(5,6)],7)
=> 1
[1,1,2,2,1] => [2,2,3] => ([(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[1,1,3,1,1] => [3,1,3] => ([(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[1,1,4,1] => [2,1,1,3] => ([(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[1,2,1,1,1,1] => [5,2] => ([(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 1
[1,2,1,2,1] => [2,3,2] => ([(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[1,2,2,1,1] => [3,2,2] => ([(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[1,2,3,1] => [2,1,2,2] => ([(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[1,3,1,1,1] => [4,1,2] => ([(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[1,3,2,1] => [2,2,1,2] => ([(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[1,4,1,1] => [3,1,1,2] => ([(1,4),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[1,5,1] => [2,1,1,1,2] => ([(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[2,1,1,1,1,1] => [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 1
[2,1,1,2,1] => [2,4,1] => ([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
Description
The rank-width of a graph.
Matching statistic: St000688
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000688: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St000688: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1,0]
=> 0
[1,1] => [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,1,1] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> 1
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 1
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 1
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 1
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> 1
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 1
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 1
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> 1
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 1
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> 1
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> 1
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,1,1,1] => [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]
=> 0
[1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> 1
[1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> 1
[1,1,1,3,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,1,0,0,0]
=> 1
[1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0,1,1,0,0]
=> 1
[1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,1,1,0,0,0,0]
=> 1
[1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,1,1,0,0,0,0]
=> 1
[1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,1,1,1,0,0,0,0,0]
=> 1
[1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,1,0,0]
=> 1
[1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,1,0,0,0]
=> 1
[1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,1,1,0,0,0]
=> 1
[1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,1,1,1,0,0,0,0,0]
=> 1
[1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0,1,1,0,0]
=> 1
[1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,1,1,0,0,0,0,0]
=> 1
[1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,1,1,0,0,0,0,0]
=> 1
[2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
[2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> 1
Description
The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path.
The global dimension is given by [[St000684]] and the dominant dimension is given by [[St000685]]. To every Dyck path there is an LNakayama algebra associated as described in [[St000684]].
Dyck paths for which the global dimension and the dominant dimension of the the LNakayama algebra coincide and both dimensions at least $2$ correspond to the LNakayama algebras that are higher Auslander algebras in the sense of [1].
Matching statistic: St000769
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
St000769: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
St000769: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => ([],1)
=> [1] => 0
[1,1] => ([(0,1)],2)
=> [1,1] => 0
[1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => 0
[2,1] => ([(0,2),(1,2)],3)
=> [2,1] => 1
[1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => 0
[1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => 1
[2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => 1
[3,1] => ([(0,3),(1,3),(2,3)],4)
=> [3,1] => 1
[1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => 0
[1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 1
[1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 1
[1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 1
[2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => 1
[2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 1
[3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => 1
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> [4,1] => 1
[1,1,1,1,1,1] => ([(0,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)
=> [1,1,1,1,1,1] => 0
[1,1,1,2,1] => ([(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [2,1,1,1,1] => 1
[1,1,2,1,1] => ([(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)
=> [2,1,1,1,1] => 1
[1,1,3,1] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1] => 1
[1,2,1,1,1] => ([(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)
=> [2,1,1,1,1] => 1
[1,2,2,1] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1] => 1
[1,3,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [3,1,1,1] => 1
[1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1] => 1
[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)
=> [2,1,1,1,1] => 1
[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)
=> [3,1,1,1] => 1
[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)
=> [3,1,1,1] => 1
[2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1] => 1
[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)
=> [3,1,1,1] => 1
[3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1] => 1
[4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [4,1,1] => 1
[5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [5,1] => 1
[1,1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [1,1,1,1,1,1,1] => 0
[1,1,1,1,2,1] => ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [2,1,1,1,1,1] => 1
[1,1,1,2,1,1] => ([(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [2,1,1,1,1,1] => 1
[1,1,1,3,1] => ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [3,1,1,1,1] => 1
[1,1,2,1,1,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [2,1,1,1,1,1] => 1
[1,1,2,2,1] => ([(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [3,1,1,1,1] => 1
[1,1,3,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [3,1,1,1,1] => 1
[1,1,4,1] => ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [4,1,1,1] => 1
[1,2,1,1,1,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [2,1,1,1,1,1] => 1
[1,2,1,2,1] => ([(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [3,1,1,1,1] => 1
[1,2,2,1,1] => ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [3,1,1,1,1] => 1
[1,2,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [4,1,1,1] => 1
[1,3,1,1,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [3,1,1,1,1] => 1
[1,3,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [4,1,1,1] => 1
[1,4,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [4,1,1,1] => 1
[1,5,1] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> [5,1,1] => 1
[2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [2,1,1,1,1,1] => 1
[2,1,1,2,1] => ([(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [3,1,1,1,1] => 1
Description
The major index of a composition regarded as a word.
This is the sum of the positions of the descents of the composition.
For the statistic which interprets the composition as a descent set, see [[St000008]].
Matching statistic: St000985
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Values
[1] => ([],1)
=> ([],1)
=> 0
[1,1] => ([(0,1)],2)
=> ([],1)
=> 0
[1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 0
[2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[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)],2)
=> 1
[2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,1,1,1] => ([(0,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)
=> ([],1)
=> 0
[1,1,1,2,1] => ([(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)],2)
=> 1
[1,1,2,1,1] => ([(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)],2)
=> 1
[1,1,3,1] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,1,1,1] => ([(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)],2)
=> 1
[1,2,2,1] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,3,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[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)],2)
=> 1
[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,2),(1,2)],3)
=> 1
[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,2),(1,2)],3)
=> 1
[2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[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),(0,2),(1,2)],3)
=> 1
[3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([],1)
=> 0
[1,1,1,1,2,1] => ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,1,1,2,1,1] => ([(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,1,1,3,1] => ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,2,1,1,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,1,2,2,1] => ([(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,3,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,4,1] => ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,2,1,1,1,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,2,1,2,1] => ([(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,2,1,1] => ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,1,1,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,3,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,4,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,5,1] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[2,1,1,2,1] => ([(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
Description
The number of positive eigenvalues of the adjacency matrix of the graph.
Matching statistic: St001011
(load all 36 compositions to match this statistic)
(load all 36 compositions to match this statistic)
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St001011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St001011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1,0]
=> 0
[1,1] => [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,1,1] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[2,1] => [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 1
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 1
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 1
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> 1
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 1
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> 1
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> 1
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 1
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> 1
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> 1
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> 1
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 1
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> 1
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 1
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,1,1,1,1,1] => [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]
=> 0
[1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> 1
[1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> 1
[1,1,1,3,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,1,0,0,0,0]
=> 1
[1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> 1
[1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,1,0,0,0]
=> 1
[1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,1,0,1,0,0,0]
=> 1
[1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> 1
[1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> 1
[1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,1,0,0]
=> 1
[1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,1,0,0,1,0,0]
=> 1
[1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,0,1,0,0,1,0,0]
=> 1
[1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,1,0,0]
=> 1
[1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,1,0,0]
=> 1
[1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> 1
[1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> 1
[2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 1
[2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0,1,0]
=> 1
Description
Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001026
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001026: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001026: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1,0]
=> 0
[1,1] => [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,1,1] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1
[3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1
[4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> 1
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> 1
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 1
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 1
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> 1
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 1
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> 1
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 1
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 1
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> 1
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 1
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> 1
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> 1
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,1,1,1] => [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]
=> 0
[1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> 1
[1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,1,0,0,0]
=> 1
[1,1,1,3,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,1,0,0,0]
=> 1
[1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0,1,1,0,0]
=> 1
[1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,1,1,0,0,0,0]
=> 1
[1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,1,1,0,0,0,0]
=> 1
[1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,1,1,1,0,0,0,0,0]
=> 1
[1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,1,0,0]
=> 1
[1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,0,1,1,1,0,0,0]
=> 1
[1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,1,1,0,0,0]
=> 1
[1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,1,1,1,0,0,0,0,0]
=> 1
[1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0,1,1,0,0]
=> 1
[1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,1,1,0,0,0,0,0]
=> 1
[1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,1,1,0,0,0,0,0]
=> 1
[2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
[2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> 1
Description
The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001271
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
[1] => ([],1)
=> ([],1)
=> 0
[1,1] => ([(0,1)],2)
=> ([],1)
=> 0
[1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([],1)
=> 0
[2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([],1)
=> 0
[1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([],1)
=> 0
[1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[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)],2)
=> 1
[2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,1,1,1] => ([(0,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)
=> ([],1)
=> 0
[1,1,1,2,1] => ([(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)],2)
=> 1
[1,1,2,1,1] => ([(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)],2)
=> 1
[1,1,3,1] => ([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,1,1,1] => ([(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)],2)
=> 1
[1,2,2,1] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,3,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[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)],2)
=> 1
[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,2),(1,2)],3)
=> 1
[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,2),(1,2)],3)
=> 1
[2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[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),(0,2),(1,2)],3)
=> 1
[3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([],1)
=> 0
[1,1,1,1,2,1] => ([(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,1,1,2,1,1] => ([(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,1,1,3,1] => ([(0,6),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,2,1,1,1] => ([(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,1,2,2,1] => ([(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,3,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,1,4,1] => ([(0,6),(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,2,1,1,1,1] => ([(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[1,2,1,2,1] => ([(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,2,1,1] => ([(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,1,1,1] => ([(0,4),(0,5),(0,6),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,3,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,4,1,1] => ([(0,5),(0,6),(1,5),(1,6),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,5,1] => ([(0,6),(1,6),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[2,1,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(0,6),(1,2),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1)],2)
=> 1
[2,1,1,2,1] => ([(0,6),(1,3),(1,4),(1,5),(1,6),(2,3),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
Description
The competition number of a graph.
The competition graph of a digraph $D$ is a (simple undirected) graph which has the same vertex set as $D$ and has an edge between $x$ and $y$ if and only if there exists a vertex $v$ in $D$ such that $(x, v)$ and $(y, v)$ are arcs of $D$. For any graph, $G$ together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number $k(G)$ is the smallest number of such isolated vertices.
Matching statistic: St001333
(load all 43 compositions to match this statistic)
(load all 43 compositions to match this statistic)
Mp00133: Integer compositions —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St001333: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St001333: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> 0
[1,1] => [2] => ([],2)
=> 0
[1,1,1] => [3] => ([],3)
=> 0
[2,1] => [1,1] => ([(0,1)],2)
=> 1
[1,1,1,1] => [4] => ([],4)
=> 0
[1,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[2,1,1] => [1,2] => ([(1,2)],3)
=> 1
[3,1] => [1,1] => ([(0,1)],2)
=> 1
[1,1,1,1,1] => [5] => ([],5)
=> 0
[1,1,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,2,1,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 1
[1,3,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[2,1,1,1] => [1,3] => ([(2,3)],4)
=> 1
[2,2,1] => [2,1] => ([(0,2),(1,2)],3)
=> 1
[3,1,1] => [1,2] => ([(1,2)],3)
=> 1
[4,1] => [1,1] => ([(0,1)],2)
=> 1
[1,1,1,1,1,1] => [6] => ([],6)
=> 0
[1,1,1,2,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,2,1,1] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,2,1,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 1
[1,2,2,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,1,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 1
[1,4,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[2,1,1,1,1] => [1,4] => ([(3,4)],5)
=> 1
[2,1,2,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[2,2,1,1] => [2,2] => ([(1,3),(2,3)],4)
=> 1
[2,3,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[3,1,1,1] => [1,3] => ([(2,3)],4)
=> 1
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[4,1,1] => [1,2] => ([(1,2)],3)
=> 1
[5,1] => [1,1] => ([(0,1)],2)
=> 1
[1,1,1,1,1,1,1] => [7] => ([],7)
=> 0
[1,1,1,1,2,1] => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[1,1,1,2,1,1] => [3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[1,1,1,3,1] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,2,1,1,1] => [2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[1,1,2,2,1] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,3,1,1] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,4,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,2,1,1,1,1] => [1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> 1
[1,2,1,2,1] => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,2,2,1,1] => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,2,3,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,3,1,1,1] => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 1
[1,3,2,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,4,1,1] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 1
[1,5,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[2,1,1,1,1,1] => [1,5] => ([(4,5)],6)
=> 1
[2,1,1,2,1] => [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
Description
The cardinality of a minimal edge-isolating set of a graph.
Let $\mathcal F$ be a set of graphs. A set of vertices $S$ is $\mathcal F$-isolating, if the subgraph induced by the vertices in the complement of the closed neighbourhood of $S$ does not contain any graph in $\mathcal F$.
This statistic returns the cardinality of the smallest isolating set when $\mathcal F$ contains only the graph with one edge.
The following 414 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001340The cardinality of a minimal non-edge isolating set of a graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001354The number of series nodes in the modular decomposition of a graph. St001393The induced matching number of a graph. St001512The minimum rank of a graph. St001673The degree of asymmetry of an integer composition. St000258The burning number of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000396The register function (or Horton-Strahler number) of a binary tree. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000767The number of runs in an integer composition. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000903The number of different parts of an integer composition. St000918The 2-limited packing number of a graph. St001093The detour number of a graph. St001111The weak 2-dynamic chromatic number of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001315The dissociation number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001674The number of vertices of the largest induced star graph in the graph. St000008The major index of the composition. St000010The length of the partition. St000141The maximum drop size of a permutation. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000183The side length of the Durfee square of an integer partition. St000225Difference between largest and smallest parts in a partition. St000256The number of parts from which one can substract 2 and still get an integer partition. St000272The treewidth of a graph. St000290The major index of a binary word. St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000480The number of lower covers of a partition in dominance order. St000481The number of upper covers of a partition in dominance order. St000536The pathwidth of a graph. St000552The number of cut vertices of a graph. St000651The maximal size of a rise in a permutation. St000660The number of rises of length at least 3 of a Dyck path. St000662The staircase size of the code of a permutation. St000741The Colin de Verdière graph invariant. St000742The number of big ascents of a permutation after prepending zero. St000761The number of ascents in an integer composition. St000766The number of inversions of an integer composition. St000845The maximal number of elements covered by an element in a poset. St000864The number of circled entries of the shifted recording tableau of a permutation. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000897The number of different multiplicities of parts of an integer partition. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001092The number of distinct even parts of a partition. St001277The degeneracy of a graph. St001280The number of parts of an integer partition that are at least two. St001335The cardinality of a minimal cycle-isolating set of a graph. St001358The largest degree of a regular subgraph of a graph. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001484The number of singletons of an integer partition. St001485The modular major index of a binary word. St001587Half of the largest even part of an integer partition. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001737The number of descents of type 2 in a permutation. St001743The discrepancy of a graph. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001792The arboricity of a graph. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000013The height of a Dyck path. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000147The largest part of an integer partition. St000159The number of distinct parts of the integer partition. St000172The Grundy number of a graph. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000273The domination number of a graph. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000298The order dimension or Dushnik-Miller dimension of a poset. St000346The number of coarsenings of a partition. St000388The number of orbits of vertices of a graph under automorphisms. St000390The number of runs of ones in a binary word. St000397The Strahler number of a rooted tree. St000451The length of the longest pattern of the form k 1 2. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000542The number of left-to-right-minima of a permutation. St000544The cop number of a graph. St000628The balance of a binary word. St000679The pruning number of an ordered tree. St000701The protection number of a binary tree. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000758The length of the longest staircase fitting into an integer composition. St000764The number of strong records in an integer composition. St000765The number of weak records in an integer composition. St000783The side length of the largest staircase partition fitting into a partition. St000810The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to monomial symmetric functions. St000847The number of standard Young tableaux whose descent set is the binary word. St000862The number of parts of the shifted shape of a permutation. St000916The packing number of a graph. St000920The logarithmic height of a Dyck path. St001029The size of the core of a graph. St001116The game chromatic number of a graph. St001322The size of a minimal independent dominating set in a graph. St001432The order dimension of the partition. St001463The number of distinct columns in the nullspace of a graph. St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St001642The Prague dimension of a graph. St001732The number of peaks visible from the left. St001741The largest integer such that all patterns of this size are contained in the permutation. St001746The coalition number of a graph. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001829The common independence number of a graph. St001884The number of borders of a binary word. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St001963The tree-depth of a graph. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000759The smallest missing part in an integer partition. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000253The crossing number of a set partition. St000254The nesting number of a set partition. St000659The number of rises of length at least 2 of a Dyck path. St000730The maximal arc length of a set partition. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St000251The number of nonsingleton blocks of a set partition. St000392The length of the longest run of ones in a binary word. St000442The maximal area to the right of an up step of a Dyck path. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000640The rank of the largest boolean interval in a poset. St000919The number of maximal left branches of a binary tree. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001592The maximal number of simple paths between any two different vertices of a graph. St000402Half the size of the symmetry class of a permutation. St000444The length of the maximal rise of a Dyck path. St000455The second largest eigenvalue of a graph if it is integral. St000668The least common multiple of the parts of the partition. St000678The number of up steps after the last double rise of a Dyck path. St001062The maximal size of a block of a set partition. St001128The exponens consonantiae of a partition. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001498The normalised height of a Nakayama algebra with magnitude 1. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000160The multiplicity of the smallest part of a partition. St000548The number of different non-empty partial sums of an integer partition. St001090The number of pop-stack-sorts needed to sort a permutation. St000511The number of invariant subsets when acting with a permutation of given cycle type. St001665The number of pure excedances of a permutation. St000287The number of connected components of a graph. St000485The length of the longest cycle of a permutation. St001734The lettericity of a graph. St000527The width of the poset. St001352The number of internal nodes in the modular decomposition of a graph. St001198The 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$. St001206The 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$. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000326The position of the first one in a binary word after appending a 1 at the end. St000667The greatest common divisor of the parts of the partition. St000781The number of proper colouring schemes of a Ferrers diagram. St000914The sum of the values of the Möbius function of a poset. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001256Number of simple reflexive modules that are 2-stable reflexive. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001593This is the number of standard Young tableaux of the given shifted shape. St001722The number of minimal chains with small intervals between a binary word and the top element. St001780The order of promotion on the set of standard tableaux of given shape. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. 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. St000296The length of the symmetric border of a binary word. St000379The number of Hamiltonian cycles in a graph. St000629The defect of a binary word. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St000699The toughness times the least common multiple of 1,. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain in a poset. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. 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. St001281The normalized isoperimetric number of a graph. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001371The length of the longest Yamanouchi prefix of a binary word. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001657The number of twos in an integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001961The sum of the greatest common divisors of all pairs of parts. St000264The girth of a graph, which is not a tree. St000353The number of inner valleys of a permutation. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St000092The number of outer peaks of a permutation. St001695The natural comajor index of a standard Young tableau. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001699The major index of a standard tableau minus the weighted size of its shape. St001712The number of natural descents of a standard Young tableau. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001525The number of symmetric hooks on the diagonal of a partition. St001561The value of the elementary symmetric function evaluated at 1. 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. St000618The number of self-evacuating tableaux of given shape. St000058The order of a permutation. St000506The number of standard desarrangement tableaux of shape equal to the given partition. 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. 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. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000647The number of big descents of a permutation. St001469The holeyness of a permutation. St000354The number of recoils of a permutation. St000884The number of isolated descents of a permutation. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001571The Cartan determinant of the integer partition. St001570The minimal number of edges to add to make a graph Hamiltonian. St000035The number of left outer peaks of a permutation. St000846The maximal number of elements covering an element of a poset. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St000284The Plancherel distribution on integer partitions. 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. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000834The number of right outer peaks of a permutation. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000993The multiplicity of the largest part of an integer partition. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001890The maximum magnitude of the Möbius function of a poset. St000478Another weight of a partition according to Alladi. St000567The sum of the products of all pairs of parts. 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. 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. St000374The number of exclusive right-to-left minima of a permutation. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St000146The Andrews-Garvan crank of a partition. St000703The number of deficiencies of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001729The number of visible descents of a permutation. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St000028The number of stack-sorts needed to sort a permutation. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St000486The number of cycles of length at least 3 of a permutation. St000710The number of big deficiencies of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001568The smallest positive integer that does not appear twice in the partition. St001928The number of non-overlapping descents in a permutation. St000007The number of saliances of the permutation. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St000470The number of runs in a permutation. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001095The number of non-isomorphic posets with precisely one further covering relation. St000352The Elizalde-Pak rank of a permutation. St000553The number of blocks of a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000785The number of distinct colouring schemes of a graph. 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. St001739The number of graphs with the same edge polytope as the given graph. St001740The number of graphs with the same symmetric edge polytope as the given graph. St000447The number of pairs of vertices of a graph with distance 3. St000449The number of pairs of vertices of a graph with distance 4. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001793The difference between the clique number and the chromatic number of a graph. 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$. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001060The distinguishing index of a graph. St001496The number of graphs with the same Laplacian spectrum as the given graph. St001307The number of induced stars on four vertices in a graph. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001518The number of graphs with the same ordinary spectrum as the given graph. St001765The number of connected components of the friends and strangers graph. St001578The minimal number of edges to add or remove to make a graph a line graph. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001530The depth of a Dyck path. St000021The number of descents of a permutation. St000023The number of inner peaks of a permutation. St000154The sum of the descent bottoms of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000671The maximin edge-connectivity for choosing a subgraph. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001353The number of prime nodes in the modular decomposition of a graph. St000062The length of the longest increasing subsequence of the permutation. St000099The number of valleys of a permutation, including the boundary. St000308The height of the tree associated to a permutation. St000325The width of the tree associated to a permutation. St000328The maximum number of child nodes in a tree. St000335The difference of lower and upper interactions. St000822The Hadwiger number of the graph. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000991The number of right-to-left minima of a permutation. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows:
St001273The projective dimension of the first term in an injective coresolution of the regular module. St001330The hat guessing number of a graph. St001471The magnitude of a Dyck path. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St000456The monochromatic index of a connected graph. St000145The Dyson rank of a partition. St001774The degree of the minimal polynomial of the smallest eigenvalue of a graph. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St000243The number of cyclic valleys and cyclic peaks of a permutation. St001367The smallest number which does not occur as degree of a vertex in a graph. St001720The minimal length of a chain of small intervals in a lattice. St000315The number of isolated vertices of a graph. St001394The genus of a permutation. St001877Number of indecomposable injective modules with projective dimension 2. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St000317The cycle descent number of a permutation. St000731The number of double exceedences of a permutation. St000779The tier of a permutation. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001470The cyclic holeyness of a permutation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001728The number of invisible descents of a permutation. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000314The number of left-to-right-maxima of a permutation. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001489The maximum of the number of descents and the number of inverse descents. St001555The order of a signed permutation. St001618The cardinality of the Frattini sublattice of a lattice. St000638The number of up-down runs of a permutation. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001960The number of descents of a permutation minus one if its first entry is not one. St001597The Frobenius rank of a skew partition. St001651The Frankl number of a lattice. St000893The number of distinct diagonal sums of an alternating sign matrix. St001769The reflection length of a signed permutation. St001864The number of excedances of a signed permutation. St001896The number of right descents of a signed permutations. St001624The breadth of a lattice. St001621The number of atoms of a lattice. St001569The maximal modular displacement of a permutation. St001413Half the length of the longest even length palindromic prefix of a binary word. St001823The Stasinski-Voll length of a signed permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000746The number of pairs with odd minimum in a perfect matching. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001267The length of the Lyndon factorization of the binary word. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000223The number of nestings in the permutation. St000302The determinant of the distance matrix of a connected graph. St000366The number of double descents of a permutation. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000441The number of successions of a permutation. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St000632The jump number of the poset. St000665The number of rafts of a permutation. St001115The number of even descents of a permutation. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001860The number of factors of the Stanley symmetric function associated with a signed permutation. St000307The number of rowmotion orbits of a poset. St000669The number of permutations obtained by switching ascents or descents of size 2. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001645The pebbling number of a connected graph. St000054The first entry of the permutation. St000891The number of distinct diagonal sums of a permutation matrix. St001268The size of the largest ordinal summand in the poset. St001399The distinguishing number of a poset. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001779The order of promotion on the set of linear extensions of a poset.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!