searching the database
Your data matches 439 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: St001720
(load all 14 compositions to match this statistic)
(load all 14 compositions to match this statistic)
Values
([],1)
=> ([],1)
=> 1
([],2)
=> ([],1)
=> 1
([(0,1)],2)
=> ([(0,1)],2)
=> 2
([],3)
=> ([],1)
=> 1
([(1,2)],3)
=> ([(0,1)],2)
=> 2
([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> 2
([],4)
=> ([],1)
=> 1
([(2,3)],4)
=> ([(0,1)],2)
=> 2
([(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> 2
([(0,3),(1,2)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> 2
([(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,7),(1,8),(2,6),(2,8),(3,5),(3,8),(4,5),(4,6),(4,7),(5,9),(6,9),(7,9),(8,9)],10)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(6,11),(7,11),(8,11),(9,11),(10,11)],12)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,10),(1,11),(2,8),(2,9),(2,11),(3,6),(3,7),(3,11),(4,7),(4,9),(4,10),(5,6),(5,8),(5,10),(6,12),(7,12),(8,12),(9,12),(10,12),(11,12)],13)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,9),(1,11),(1,13),(2,9),(2,10),(2,12),(3,8),(3,10),(3,13),(4,8),(4,11),(4,12),(5,7),(5,12),(5,13),(6,7),(6,10),(6,11),(7,14),(8,14),(9,14),(10,14),(11,14),(12,14),(13,14)],15)
=> 2
([],5)
=> ([],1)
=> 1
([(3,4)],5)
=> ([(0,1)],2)
=> 2
([(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> 2
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(5,14),(6,11),(6,12),(7,11),(7,13),(8,12),(8,14),(9,13),(9,14),(10,12),(10,13),(11,15),(12,15),(13,15),(14,15)],16)
=> 2
([(1,4),(2,3)],5)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
([(1,4),(2,3),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> 2
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,5),(1,6),(2,4),(2,6),(3,4),(3,5),(4,7),(5,7),(6,7)],8)
=> 2
([(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(5,14),(6,11),(6,12),(7,11),(7,13),(8,12),(8,14),(9,13),(9,14),(10,12),(10,13),(11,15),(12,15),(13,15),(14,15)],16)
=> 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,7),(1,8),(2,6),(2,8),(3,5),(3,8),(4,5),(4,6),(4,7),(5,9),(6,9),(7,9),(8,9)],10)
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,9),(1,12),(1,16),(2,8),(2,11),(2,16),(3,7),(3,10),(3,16),(4,6),(4,10),(4,11),(4,12),(5,6),(5,7),(5,8),(5,9),(6,13),(6,14),(6,15),(7,13),(7,17),(8,14),(8,17),(9,15),(9,17),(10,13),(10,18),(11,14),(11,18),(12,15),(12,18),(13,19),(14,19),(15,19),(16,17),(16,18),(17,19),(18,19)],20)
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(6,11),(7,11),(8,11),(9,11),(10,11)],12)
=> 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,9),(1,10),(1,11),(1,15),(2,7),(2,8),(2,11),(2,14),(3,6),(3,8),(3,10),(3,13),(4,6),(4,7),(4,9),(4,12),(5,12),(5,13),(5,14),(5,15),(6,18),(6,22),(7,16),(7,22),(8,17),(8,22),(9,19),(9,22),(10,20),(10,22),(11,21),(11,22),(12,16),(12,18),(12,19),(13,17),(13,18),(13,20),(14,16),(14,17),(14,21),(15,19),(15,20),(15,21),(16,23),(17,23),(18,23),(19,23),(20,23),(21,23),(22,23)],24)
=> 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,10),(1,11),(2,8),(2,9),(2,11),(3,6),(3,7),(3,11),(4,7),(4,9),(4,10),(5,6),(5,8),(5,10),(6,12),(7,12),(8,12),(9,12),(10,12),(11,12)],13)
=> 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,9),(1,12),(1,16),(2,8),(2,11),(2,16),(3,7),(3,10),(3,16),(4,6),(4,10),(4,11),(4,12),(5,6),(5,7),(5,8),(5,9),(6,13),(6,14),(6,15),(7,13),(7,17),(8,14),(8,17),(9,15),(9,17),(10,13),(10,18),(11,14),(11,18),(12,15),(12,18),(13,19),(14,19),(15,19),(16,17),(16,18),(17,19),(18,19)],20)
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(1,20),(1,21),(2,9),(2,14),(2,15),(2,21),(3,8),(3,12),(3,13),(3,21),(4,11),(4,13),(4,15),(4,20),(5,10),(5,12),(5,14),(5,20),(6,7),(6,8),(6,9),(6,10),(6,11),(7,22),(7,23),(8,16),(8,17),(8,22),(9,18),(9,19),(9,22),(10,16),(10,18),(10,23),(11,17),(11,19),(11,23),(12,16),(12,24),(13,17),(13,24),(14,18),(14,24),(15,19),(15,24),(16,25),(17,25),(18,25),(19,25),(20,23),(20,24),(21,22),(21,24),(22,25),(23,25),(24,25)],26)
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,9),(1,11),(1,15),(1,20),(1,21),(2,9),(2,10),(2,14),(2,18),(2,19),(3,8),(3,13),(3,17),(3,19),(3,21),(4,8),(4,12),(4,16),(4,18),(4,20),(5,7),(5,14),(5,15),(5,16),(5,17),(6,7),(6,10),(6,11),(6,12),(6,13),(7,31),(7,32),(8,30),(8,32),(9,30),(9,31),(10,22),(10,23),(10,31),(11,24),(11,25),(11,31),(12,22),(12,24),(12,32),(13,23),(13,25),(13,32),(14,26),(14,27),(14,31),(15,28),(15,29),(15,31),(16,26),(16,28),(16,32),(17,27),(17,29),(17,32),(18,22),(18,26),(18,30),(19,23),(19,27),(19,30),(20,24),(20,28),(20,30),(21,25),(21,29),(21,30),(22,33),(23,33),(24,33),(25,33),(26,33),(27,33),(28,33),(29,33),(30,33),(31,33),(32,33)],34)
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,28),(1,29),(1,30),(2,9),(2,13),(2,18),(2,19),(2,30),(3,8),(3,12),(3,16),(3,17),(3,30),(4,11),(4,15),(4,17),(4,19),(4,29),(5,10),(5,14),(5,16),(5,18),(5,29),(6,12),(6,13),(6,14),(6,15),(6,28),(7,8),(7,9),(7,10),(7,11),(7,28),(8,20),(8,21),(8,32),(9,22),(9,23),(9,32),(10,20),(10,22),(10,33),(11,21),(11,23),(11,33),(12,24),(12,25),(12,32),(13,26),(13,27),(13,32),(14,24),(14,26),(14,33),(15,25),(15,27),(15,33),(16,20),(16,24),(16,31),(17,21),(17,25),(17,31),(18,22),(18,26),(18,31),(19,23),(19,27),(19,31),(20,34),(21,34),(22,34),(23,34),(24,34),(25,34),(26,34),(27,34),(28,32),(28,33),(29,31),(29,33),(30,31),(30,32),(31,34),(32,34),(33,34)],35)
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,8),(1,9),(1,10),(2,6),(2,7),(2,10),(3,5),(3,7),(3,9),(4,5),(4,6),(4,8),(5,11),(5,14),(6,11),(6,12),(7,11),(7,13),(8,12),(8,14),(9,13),(9,14),(10,12),(10,13),(11,15),(12,15),(13,15),(14,15)],16)
=> 2
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,7),(1,8),(2,6),(2,8),(3,5),(3,8),(4,5),(4,6),(4,7),(5,9),(6,9),(7,9),(8,9)],10)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,9),(1,12),(1,16),(2,8),(2,11),(2,16),(3,7),(3,10),(3,16),(4,6),(4,10),(4,11),(4,12),(5,6),(5,7),(5,8),(5,9),(6,13),(6,14),(6,15),(7,13),(7,17),(8,14),(8,17),(9,15),(9,17),(10,13),(10,18),(11,14),(11,18),(12,15),(12,18),(13,19),(14,19),(15,19),(16,17),(16,18),(17,19),(18,19)],20)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,13),(1,14),(1,15),(1,17),(2,10),(2,11),(2,12),(2,17),(3,7),(3,8),(3,9),(3,17),(4,9),(4,12),(4,15),(4,16),(5,8),(5,11),(5,14),(5,16),(6,7),(6,10),(6,13),(6,16),(7,18),(7,21),(8,19),(8,21),(9,20),(9,21),(10,18),(10,22),(11,19),(11,22),(12,20),(12,22),(13,18),(13,23),(14,19),(14,23),(15,20),(15,23),(16,21),(16,22),(16,23),(17,18),(17,19),(17,20),(18,24),(19,24),(20,24),(21,24),(22,24),(23,24)],25)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,12),(1,13),(1,14),(1,15),(2,9),(2,10),(2,11),(2,15),(3,7),(3,8),(3,11),(3,14),(4,6),(4,8),(4,10),(4,13),(5,6),(5,7),(5,9),(5,12),(6,16),(6,19),(6,22),(7,16),(7,17),(7,20),(8,16),(8,18),(8,21),(9,17),(9,19),(9,23),(10,18),(10,19),(10,24),(11,17),(11,18),(11,25),(12,20),(12,22),(12,23),(13,21),(13,22),(13,24),(14,20),(14,21),(14,25),(15,23),(15,24),(15,25),(16,26),(17,26),(18,26),(19,26),(20,26),(21,26),(22,26),(23,26),(24,26),(25,26)],27)
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,16),(1,17),(1,18),(1,25),(2,13),(2,14),(2,15),(2,25),(3,10),(3,11),(3,12),(3,25),(4,8),(4,9),(4,12),(4,15),(4,18),(5,7),(5,9),(5,11),(5,14),(5,17),(6,7),(6,8),(6,10),(6,13),(6,16),(7,21),(7,24),(7,29),(8,19),(8,22),(8,29),(9,20),(9,23),(9,29),(10,26),(10,29),(11,27),(11,29),(12,28),(12,29),(13,19),(13,21),(13,26),(14,20),(14,21),(14,27),(15,19),(15,20),(15,28),(16,22),(16,24),(16,26),(17,23),(17,24),(17,27),(18,22),(18,23),(18,28),(19,30),(20,30),(21,30),(22,30),(23,30),(24,30),(25,26),(25,27),(25,28),(26,30),(27,30),(28,30),(29,30)],31)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(1,11),(1,24),(1,26),(2,8),(2,9),(2,24),(2,25),(3,16),(3,17),(3,18),(3,19),(3,24),(4,9),(4,14),(4,15),(4,17),(4,26),(5,8),(5,12),(5,13),(5,16),(5,26),(6,11),(6,13),(6,15),(6,19),(6,25),(7,10),(7,12),(7,14),(7,18),(7,25),(8,27),(8,31),(9,28),(9,31),(10,29),(10,32),(11,30),(11,32),(12,20),(12,27),(12,29),(13,21),(13,27),(13,30),(14,22),(14,28),(14,29),(15,23),(15,28),(15,30),(16,20),(16,21),(16,31),(17,22),(17,23),(17,31),(18,20),(18,22),(18,32),(19,21),(19,23),(19,32),(20,33),(21,33),(22,33),(23,33),(24,31),(24,32),(25,27),(25,28),(25,32),(26,29),(26,30),(26,31),(27,33),(28,33),(29,33),(30,33),(31,33),(32,33)],34)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(1,20),(1,21),(2,9),(2,14),(2,15),(2,21),(3,8),(3,12),(3,13),(3,21),(4,11),(4,13),(4,15),(4,20),(5,10),(5,12),(5,14),(5,20),(6,7),(6,8),(6,9),(6,10),(6,11),(7,22),(7,23),(8,16),(8,17),(8,22),(9,18),(9,19),(9,22),(10,16),(10,18),(10,23),(11,17),(11,19),(11,23),(12,16),(12,24),(13,17),(13,24),(14,18),(14,24),(15,19),(15,24),(16,25),(17,25),(18,25),(19,25),(20,23),(20,24),(21,22),(21,24),(22,25),(23,25),(24,25)],26)
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,9),(1,11),(1,13),(2,9),(2,10),(2,12),(3,8),(3,10),(3,13),(4,8),(4,11),(4,12),(5,7),(5,12),(5,13),(6,7),(6,10),(6,11),(7,14),(8,14),(9,14),(10,14),(11,14),(12,14),(13,14)],15)
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,9),(1,16),(1,21),(1,23),(2,8),(2,16),(2,20),(2,22),(3,10),(3,15),(3,20),(3,23),(4,11),(4,15),(4,21),(4,22),(5,13),(5,14),(5,22),(5,23),(6,12),(6,14),(6,20),(6,21),(7,8),(7,9),(7,10),(7,11),(7,12),(7,13),(8,17),(8,24),(8,26),(9,17),(9,25),(9,27),(10,18),(10,24),(10,27),(11,18),(11,25),(11,26),(12,19),(12,24),(12,25),(13,19),(13,26),(13,27),(14,19),(14,28),(15,18),(15,28),(16,17),(16,28),(17,29),(18,29),(19,29),(20,24),(20,28),(21,25),(21,28),(22,26),(22,28),(23,27),(23,28),(24,29),(25,29),(26,29),(27,29),(28,29)],30)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(0,8),(1,9),(1,26),(1,27),(1,28),(2,9),(2,10),(2,11),(2,29),(2,30),(3,13),(3,17),(3,21),(3,28),(3,30),(4,12),(4,16),(4,21),(4,27),(4,29),(5,15),(5,18),(5,20),(5,27),(5,30),(6,14),(6,19),(6,20),(6,28),(6,29),(7,11),(7,16),(7,17),(7,18),(7,19),(7,26),(8,10),(8,12),(8,13),(8,14),(8,15),(8,26),(9,35),(9,38),(10,31),(10,32),(10,35),(11,33),(11,34),(11,35),(12,22),(12,31),(12,36),(13,22),(13,32),(13,37),(14,23),(14,31),(14,37),(15,23),(15,32),(15,36),(16,24),(16,33),(16,36),(17,24),(17,34),(17,37),(18,25),(18,34),(18,36),(19,25),(19,33),(19,37),(20,23),(20,25),(20,38),(21,22),(21,24),(21,38),(22,39),(23,39),(24,39),(25,39),(26,35),(26,36),(26,37),(27,36),(27,38),(28,37),(28,38),(29,31),(29,33),(29,38),(30,32),(30,34),(30,38),(31,39),(32,39),(33,39),(34,39),(35,39),(36,39),(37,39),(38,39)],40)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,9),(1,10),(1,28),(1,29),(2,12),(2,16),(2,20),(2,22),(2,29),(3,11),(3,15),(3,20),(3,21),(3,28),(4,13),(4,17),(4,19),(4,21),(4,29),(5,14),(5,18),(5,19),(5,22),(5,28),(6,8),(6,10),(6,15),(6,16),(6,17),(6,18),(7,8),(7,9),(7,11),(7,12),(7,13),(7,14),(8,27),(8,34),(8,35),(9,27),(9,30),(9,31),(10,27),(10,32),(10,33),(11,23),(11,30),(11,34),(12,24),(12,31),(12,34),(13,23),(13,31),(13,35),(14,24),(14,30),(14,35),(15,25),(15,32),(15,34),(16,26),(16,33),(16,34),(17,25),(17,33),(17,35),(18,26),(18,32),(18,35),(19,35),(19,36),(20,34),(20,36),(21,23),(21,25),(21,36),(22,24),(22,26),(22,36),(23,37),(24,37),(25,37),(26,37),(27,37),(28,30),(28,32),(28,36),(29,31),(29,33),(29,36),(30,37),(31,37),(32,37),(33,37),(34,37),(35,37),(36,37)],38)
=> 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(0,8),(1,16),(1,20),(1,24),(1,30),(1,32),(2,15),(2,19),(2,23),(2,30),(2,31),(3,17),(3,21),(3,23),(3,29),(3,32),(4,18),(4,22),(4,24),(4,29),(4,31),(5,10),(5,13),(5,14),(5,17),(5,18),(5,30),(6,10),(6,11),(6,12),(6,15),(6,16),(6,29),(7,9),(7,11),(7,13),(7,19),(7,22),(7,32),(8,9),(8,12),(8,14),(8,20),(8,21),(8,31),(9,35),(9,36),(9,41),(10,33),(10,34),(10,41),(11,25),(11,38),(11,41),(12,26),(12,37),(12,41),(13,28),(13,39),(13,41),(14,27),(14,40),(14,41),(15,25),(15,33),(15,37),(16,26),(16,33),(16,38),(17,27),(17,34),(17,39),(18,28),(18,34),(18,40),(19,25),(19,35),(19,39),(20,26),(20,36),(20,40),(21,27),(21,36),(21,37),(22,28),(22,35),(22,38),(23,37),(23,39),(24,38),(24,40),(25,42),(26,42),(27,42),(28,42),(29,34),(29,37),(29,38),(30,33),(30,39),(30,40),(31,35),(31,37),(31,40),(32,36),(32,38),(32,39),(33,42),(34,42),(35,42),(36,42),(37,42),(38,42),(39,42),(40,42),(41,42)],43)
=> 2
Description
The minimal length of a chain of small intervals in a lattice.
An interval $[a, b]$ is small if $b$ is a join of elements covering $a$.
Matching statistic: St000535
(load all 32 compositions to match this statistic)
(load all 32 compositions to match this statistic)
Mp00324: Graphs —chromatic difference sequence⟶ 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] => ([],2)
=> 0 = 1 - 1
([(0,1)],2)
=> [1,1] => ([(0,1)],2)
=> 1 = 2 - 1
([],3)
=> [3] => ([],3)
=> 0 = 1 - 1
([(1,2)],3)
=> [2,1] => ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,2),(1,2)],3)
=> [2,1] => ([(0,2),(1,2)],3)
=> 1 = 2 - 1
([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1 = 2 - 1
([],4)
=> [4] => ([],4)
=> 0 = 1 - 1
([(2,3)],4)
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(1,3),(2,3)],4)
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,3),(1,3),(2,3)],4)
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,3),(1,2)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,3),(1,2),(2,3)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(1,2),(1,3),(2,3)],4)
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 2 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1 = 2 - 1
([],5)
=> [5] => ([],5)
=> 0 = 1 - 1
([(3,4)],5)
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(2,4),(3,4)],5)
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(1,4),(2,4),(3,4)],5)
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(1,4),(2,3)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(1,4),(2,3),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,1),(2,4),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1 = 2 - 1
Description
The rank-width of a graph.
Matching statistic: St000013
Mp00152: Graphs —Laplacian multiplicities⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St000013: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St000013: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1] => [1,0]
=> [1,0]
=> 1
([],2)
=> [2] => [1,1,0,0]
=> [1,0,1,0]
=> 1
([(0,1)],2)
=> [1,1] => [1,0,1,0]
=> [1,1,0,0]
=> 2
([],3)
=> [3] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 1
([(1,2)],3)
=> [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
([(0,2),(1,2)],3)
=> [1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 2
([(0,1),(0,2),(1,2)],3)
=> [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([],4)
=> [4] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
([(2,3)],4)
=> [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
([(1,3),(2,3)],4)
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
([(0,3),(1,3),(2,3)],4)
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
([(0,3),(1,2)],4)
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2
([(0,3),(1,2),(2,3)],4)
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2
([(1,2),(1,3),(2,3)],4)
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 2
([],5)
=> [5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
([(3,4)],5)
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 2
([(2,4),(3,4)],5)
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 2
([(1,4),(2,4),(3,4)],5)
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
([(1,4),(2,3)],5)
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
([(1,4),(2,3),(3,4)],5)
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2
([(0,1),(2,4),(3,4)],5)
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2
([(2,3),(2,4),(3,4)],5)
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
([(0,1),(2,3),(2,4),(3,4)],5)
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,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,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
Description
The height of a Dyck path.
The height of a Dyck path $D$ of semilength $n$ is defined as the maximal height of a peak of $D$. The height of $D$ at position $i$ is the number of up-steps minus the number of down-steps before position $i$.
Matching statistic: St000258
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Values
([],1)
=> [1] => ([],1)
=> ([],1)
=> 1
([],2)
=> [2] => ([],2)
=> ([],1)
=> 1
([(0,1)],2)
=> [1,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 2
([],3)
=> [3] => ([],3)
=> ([],1)
=> 1
([(1,2)],3)
=> [1,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> 2
([(0,2),(1,2)],3)
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(1,2)],3)
=> [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2
([],4)
=> [4] => ([],4)
=> ([],1)
=> 1
([(2,3)],4)
=> [1,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> 2
([(1,3),(2,3)],4)
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,3),(2,3)],4)
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 2
([(0,3),(1,2),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(1,2),(1,3),(2,3)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2
([],5)
=> [5] => ([],5)
=> ([],1)
=> 1
([(3,4)],5)
=> [1,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> 2
([(2,4),(3,4)],5)
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(1,4),(2,4),(3,4)],5)
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(1,4),(2,3)],5)
=> [2,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2
([(1,4),(2,3),(3,4)],5)
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(2,4),(3,4)],5)
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(2,3),(2,4),(3,4)],5)
=> [2,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> [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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(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)
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> [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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,1),(2,3),(2,4),(3,4)],5)
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(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)
=> [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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [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)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
Description
The burning number of a graph.
This is the minimum number of rounds needed to burn all vertices of a graph. In each round, the neighbours of all burned vertices are burnt. Additionally, an unburned vertex may be chosen to be burned.
Matching statistic: St000397
Mp00152: Graphs —Laplacian multiplicities⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00026: Dyck paths —to ordered tree⟶ Ordered trees
St000397: Ordered trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00026: Dyck paths —to ordered tree⟶ Ordered trees
St000397: Ordered trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1] => [1,0]
=> [[]]
=> 1
([],2)
=> [2] => [1,1,0,0]
=> [[[]]]
=> 1
([(0,1)],2)
=> [1,1] => [1,0,1,0]
=> [[],[]]
=> 2
([],3)
=> [3] => [1,1,1,0,0,0]
=> [[[[]]]]
=> 1
([(1,2)],3)
=> [1,2] => [1,0,1,1,0,0]
=> [[],[[]]]
=> 2
([(0,2),(1,2)],3)
=> [1,1,1] => [1,0,1,0,1,0]
=> [[],[],[]]
=> 2
([(0,1),(0,2),(1,2)],3)
=> [2,1] => [1,1,0,0,1,0]
=> [[[]],[]]
=> 2
([],4)
=> [4] => [1,1,1,1,0,0,0,0]
=> [[[[[]]]]]
=> 1
([(2,3)],4)
=> [1,3] => [1,0,1,1,1,0,0,0]
=> [[],[[[]]]]
=> 2
([(1,3),(2,3)],4)
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> [[],[],[[]]]
=> 2
([(0,3),(1,3),(2,3)],4)
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [[],[[]],[]]
=> 2
([(0,3),(1,2)],4)
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [[[]],[[]]]
=> 2
([(0,3),(1,2),(2,3)],4)
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [[],[],[],[]]
=> 2
([(1,2),(1,3),(2,3)],4)
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [[[]],[[]]]
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [[],[],[],[]]
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [[],[[]],[]]
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [[[]],[],[]]
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [[[[]]],[]]
=> 2
([],5)
=> [5] => [1,1,1,1,1,0,0,0,0,0]
=> [[[[[[]]]]]]
=> 1
([(3,4)],5)
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [[],[[[[]]]]]
=> 2
([(2,4),(3,4)],5)
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [[],[],[[[]]]]
=> 2
([(1,4),(2,4),(3,4)],5)
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [[],[[]],[[]]]
=> 2
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [[],[[[]]],[]]
=> 2
([(1,4),(2,3)],5)
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [[[]],[[[]]]]
=> 2
([(1,4),(2,3),(3,4)],5)
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [[],[],[],[[]]]
=> 2
([(0,1),(2,4),(3,4)],5)
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [[],[],[],[[]]]
=> 2
([(2,3),(2,4),(3,4)],5)
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [[[]],[[[]]]]
=> 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [[],[],[],[],[]]
=> 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [[],[],[],[[]]]
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [[],[],[[]],[]]
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [[],[[]],[[]]]
=> 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [[],[],[],[],[]]
=> 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [[[]],[],[[]]]
=> 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [[],[],[],[],[]]
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [[],[],[],[],[]]
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [[],[],[[]],[]]
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [[[]],[[]],[]]
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [[],[],[],[],[]]
=> 2
([(0,1),(2,3),(2,4),(3,4)],5)
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [[[]],[],[[]]]
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [[],[],[],[],[]]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [[],[[]],[],[]]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [[[]],[[]],[]]
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [[],[],[],[],[]]
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [[],[],[],[],[]]
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [[],[],[],[],[]]
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [[[[]]],[[]]]
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,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,1,0,0,1,0,1,0,1,0]
=> [[[]],[],[],[]]
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [[],[],[],[],[]]
=> 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [[[]],[[]],[]]
=> 2
Description
The Strahler number of a rooted tree.
Matching statistic: St001784
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00284: Standard tableaux —rows⟶ Set partitions
St001784: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00284: Standard tableaux —rows⟶ Set partitions
St001784: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> [[1]]
=> {{1}}
=> 1
([],2)
=> [1,1]
=> [[1],[2]]
=> {{1},{2}}
=> 1
([(0,1)],2)
=> [2]
=> [[1,2]]
=> {{1,2}}
=> 2
([],3)
=> [1,1,1]
=> [[1],[2],[3]]
=> {{1},{2},{3}}
=> 1
([(1,2)],3)
=> [2,1]
=> [[1,2],[3]]
=> {{1,2},{3}}
=> 2
([(0,2),(1,2)],3)
=> [3]
=> [[1,2,3]]
=> {{1,2,3}}
=> 2
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [[1,2,3]]
=> {{1,2,3}}
=> 2
([],4)
=> [1,1,1,1]
=> [[1],[2],[3],[4]]
=> {{1},{2},{3},{4}}
=> 1
([(2,3)],4)
=> [2,1,1]
=> [[1,2],[3],[4]]
=> {{1,2},{3},{4}}
=> 2
([(1,3),(2,3)],4)
=> [3,1]
=> [[1,2,3],[4]]
=> {{1,2,3},{4}}
=> 2
([(0,3),(1,3),(2,3)],4)
=> [4]
=> [[1,2,3,4]]
=> {{1,2,3,4}}
=> 2
([(0,3),(1,2)],4)
=> [2,2]
=> [[1,2],[3,4]]
=> {{1,2},{3,4}}
=> 2
([(0,3),(1,2),(2,3)],4)
=> [4]
=> [[1,2,3,4]]
=> {{1,2,3,4}}
=> 2
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [[1,2,3],[4]]
=> {{1,2,3},{4}}
=> 2
([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [[1,2,3,4]]
=> {{1,2,3,4}}
=> 2
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [[1,2,3,4]]
=> {{1,2,3,4}}
=> 2
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [[1,2,3,4]]
=> {{1,2,3,4}}
=> 2
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [[1,2,3,4]]
=> {{1,2,3,4}}
=> 2
([],5)
=> [1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> {{1},{2},{3},{4},{5}}
=> 1
([(3,4)],5)
=> [2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> {{1,2},{3},{4},{5}}
=> 2
([(2,4),(3,4)],5)
=> [3,1,1]
=> [[1,2,3],[4],[5]]
=> {{1,2,3},{4},{5}}
=> 2
([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [[1,2,3,4],[5]]
=> {{1,2,3,4},{5}}
=> 2
([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(1,4),(2,3)],5)
=> [2,2,1]
=> [[1,2],[3,4],[5]]
=> {{1,2},{3,4},{5}}
=> 2
([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> [[1,2,3,4],[5]]
=> {{1,2,3,4},{5}}
=> 2
([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [[1,2,3],[4,5]]
=> {{1,2,3},{4,5}}
=> 2
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [[1,2,3],[4],[5]]
=> {{1,2,3},{4},{5}}
=> 2
([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [[1,2,3,4],[5]]
=> {{1,2,3,4},{5}}
=> 2
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> [[1,2,3,4],[5]]
=> {{1,2,3,4},{5}}
=> 2
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [[1,2,3,4],[5]]
=> {{1,2,3,4},{5}}
=> 2
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [[1,2,3],[4,5]]
=> {{1,2,3},{4,5}}
=> 2
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [[1,2,3,4],[5]]
=> {{1,2,3,4},{5}}
=> 2
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> {{1,2,3,4,5}}
=> 2
Description
The minimum of the smallest closer and the second element of the block containing 1 in a set partition.
A closer of a set partition is the maximal element of a non-singleton block. This statistic is defined as $1$ if $\{1\}$ is a singleton block, and otherwise the minimum of the smallest closer and the second element of the block containing $1$.
Matching statistic: St000256
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St000256: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St000256: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1] => ([],1)
=> [1]
=> 0 = 1 - 1
([],2)
=> [2] => ([],2)
=> [1,1]
=> 0 = 1 - 1
([(0,1)],2)
=> [1,1] => ([(0,1)],2)
=> [2]
=> 1 = 2 - 1
([],3)
=> [3] => ([],3)
=> [1,1,1]
=> 0 = 1 - 1
([(1,2)],3)
=> [2,1] => ([(0,2),(1,2)],3)
=> [3]
=> 1 = 2 - 1
([(0,2),(1,2)],3)
=> [2,1] => ([(0,2),(1,2)],3)
=> [3]
=> 1 = 2 - 1
([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1 = 2 - 1
([],4)
=> [4] => ([],4)
=> [1,1,1,1]
=> 0 = 1 - 1
([(2,3)],4)
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(1,3),(2,3)],4)
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(0,3),(1,3),(2,3)],4)
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(0,3),(1,2)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> [3,1]
=> 1 = 2 - 1
([(0,3),(1,2),(2,3)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> [3,1]
=> 1 = 2 - 1
([(1,2),(1,3),(2,3)],4)
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> [3,1]
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([],5)
=> [5] => ([],5)
=> [1,1,1,1,1]
=> 0 = 1 - 1
([(3,4)],5)
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(2,4),(3,4)],5)
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(1,4),(2,4),(3,4)],5)
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(1,4),(2,3)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(1,4),(2,3),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(0,1),(2,4),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
Description
The number of parts from which one can substract 2 and still get an integer partition.
Matching statistic: St000473
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00324: Graphs —chromatic difference sequence⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St000473: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St000473: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1] => ([],1)
=> [1]
=> 0 = 1 - 1
([],2)
=> [2] => ([],2)
=> [1,1]
=> 0 = 1 - 1
([(0,1)],2)
=> [1,1] => ([(0,1)],2)
=> [2]
=> 1 = 2 - 1
([],3)
=> [3] => ([],3)
=> [1,1,1]
=> 0 = 1 - 1
([(1,2)],3)
=> [2,1] => ([(0,2),(1,2)],3)
=> [3]
=> 1 = 2 - 1
([(0,2),(1,2)],3)
=> [2,1] => ([(0,2),(1,2)],3)
=> [3]
=> 1 = 2 - 1
([(0,1),(0,2),(1,2)],3)
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1 = 2 - 1
([],4)
=> [4] => ([],4)
=> [1,1,1,1]
=> 0 = 1 - 1
([(2,3)],4)
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(1,3),(2,3)],4)
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(0,3),(1,3),(2,3)],4)
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(0,3),(1,2)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> [3,1]
=> 1 = 2 - 1
([(0,3),(1,2),(2,3)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> [3,1]
=> 1 = 2 - 1
([(1,2),(1,3),(2,3)],4)
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> [3,1]
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([],5)
=> [5] => ([],5)
=> [1,1,1,1,1]
=> 0 = 1 - 1
([(3,4)],5)
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(2,4),(3,4)],5)
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(1,4),(2,4),(3,4)],5)
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(1,4),(2,3)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(1,4),(2,3),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(0,1),(2,4),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
Description
The number of parts of a partition that are strictly bigger than the number of ones.
This is part of the definition of Dyson's crank of a partition, see [[St000474]].
Matching statistic: St000480
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00152: Graphs —Laplacian multiplicities⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St000480: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St000480: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1] => ([],1)
=> [1]
=> 0 = 1 - 1
([],2)
=> [2] => ([],2)
=> [1,1]
=> 0 = 1 - 1
([(0,1)],2)
=> [1,1] => ([(0,1)],2)
=> [2]
=> 1 = 2 - 1
([],3)
=> [3] => ([],3)
=> [1,1,1]
=> 0 = 1 - 1
([(1,2)],3)
=> [1,2] => ([(1,2)],3)
=> [2,1]
=> 1 = 2 - 1
([(0,2),(1,2)],3)
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1 = 2 - 1
([(0,1),(0,2),(1,2)],3)
=> [2,1] => ([(0,2),(1,2)],3)
=> [3]
=> 1 = 2 - 1
([],4)
=> [4] => ([],4)
=> [1,1,1,1]
=> 0 = 1 - 1
([(2,3)],4)
=> [1,3] => ([(2,3)],4)
=> [2,1,1]
=> 1 = 2 - 1
([(1,3),(2,3)],4)
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> 1 = 2 - 1
([(0,3),(1,3),(2,3)],4)
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(0,3),(1,2)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> [3,1]
=> 1 = 2 - 1
([(0,3),(1,2),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(1,2),(1,3),(2,3)],4)
=> [2,2] => ([(1,3),(2,3)],4)
=> [3,1]
=> 1 = 2 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> [4]
=> 1 = 2 - 1
([],5)
=> [5] => ([],5)
=> [1,1,1,1,1]
=> 0 = 1 - 1
([(3,4)],5)
=> [1,4] => ([(3,4)],5)
=> [2,1,1,1]
=> 1 = 2 - 1
([(2,4),(3,4)],5)
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> 1 = 2 - 1
([(1,4),(2,4),(3,4)],5)
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(1,4),(2,3)],5)
=> [2,3] => ([(2,4),(3,4)],5)
=> [3,1,1]
=> 1 = 2 - 1
([(1,4),(2,3),(3,4)],5)
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(0,1),(2,4),(3,4)],5)
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(2,3),(2,4),(3,4)],5)
=> [2,3] => ([(2,4),(3,4)],5)
=> [3,1,1]
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [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)
=> [5]
=> 1 = 2 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [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)
=> [5]
=> 1 = 2 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [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)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [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)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [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)
=> [5]
=> 1 = 2 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [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)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [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)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [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)
=> [5]
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [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)
=> [5]
=> 1 = 2 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> 1 = 2 - 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [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)
=> [5]
=> 1 = 2 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> 1 = 2 - 1
Description
The number of lower covers of a partition in dominance order.
According to [1], Corollary 2.4, the maximum number of elements one element (apparently for $n\neq 2$) can cover is
$$
\frac{1}{2}(\sqrt{1+8n}-3)
$$
and an element which covers this number of elements is given by $(c+i,c,c-1,\dots,3,2,1)$, where $1\leq i\leq c+2$.
Matching statistic: St000651
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000651: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000651: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> [[1]]
=> [1] => 0 = 1 - 1
([],2)
=> [1,1]
=> [[1],[2]]
=> [2,1] => 0 = 1 - 1
([(0,1)],2)
=> [2]
=> [[1,2]]
=> [1,2] => 1 = 2 - 1
([],3)
=> [1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => 0 = 1 - 1
([(1,2)],3)
=> [2,1]
=> [[1,2],[3]]
=> [3,1,2] => 1 = 2 - 1
([(0,2),(1,2)],3)
=> [3]
=> [[1,2,3]]
=> [1,2,3] => 1 = 2 - 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [[1,2,3]]
=> [1,2,3] => 1 = 2 - 1
([],4)
=> [1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => 0 = 1 - 1
([(2,3)],4)
=> [2,1,1]
=> [[1,2],[3],[4]]
=> [4,3,1,2] => 1 = 2 - 1
([(1,3),(2,3)],4)
=> [3,1]
=> [[1,2,3],[4]]
=> [4,1,2,3] => 1 = 2 - 1
([(0,3),(1,3),(2,3)],4)
=> [4]
=> [[1,2,3,4]]
=> [1,2,3,4] => 1 = 2 - 1
([(0,3),(1,2)],4)
=> [2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => 1 = 2 - 1
([(0,3),(1,2),(2,3)],4)
=> [4]
=> [[1,2,3,4]]
=> [1,2,3,4] => 1 = 2 - 1
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [[1,2,3],[4]]
=> [4,1,2,3] => 1 = 2 - 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [[1,2,3,4]]
=> [1,2,3,4] => 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [[1,2,3,4]]
=> [1,2,3,4] => 1 = 2 - 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [[1,2,3,4]]
=> [1,2,3,4] => 1 = 2 - 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [[1,2,3,4]]
=> [1,2,3,4] => 1 = 2 - 1
([],5)
=> [1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => 0 = 1 - 1
([(3,4)],5)
=> [2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> [5,4,3,1,2] => 1 = 2 - 1
([(2,4),(3,4)],5)
=> [3,1,1]
=> [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => 1 = 2 - 1
([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [[1,2,3,4],[5]]
=> [5,1,2,3,4] => 1 = 2 - 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(1,4),(2,3)],5)
=> [2,2,1]
=> [[1,2],[3,4],[5]]
=> [5,3,4,1,2] => 1 = 2 - 1
([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> [[1,2,3,4],[5]]
=> [5,1,2,3,4] => 1 = 2 - 1
([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [[1,2,3],[4,5]]
=> [4,5,1,2,3] => 1 = 2 - 1
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => 1 = 2 - 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [[1,2,3,4],[5]]
=> [5,1,2,3,4] => 1 = 2 - 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> [[1,2,3,4],[5]]
=> [5,1,2,3,4] => 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [[1,2,3,4],[5]]
=> [5,1,2,3,4] => 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [[1,2,3],[4,5]]
=> [4,5,1,2,3] => 1 = 2 - 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [[1,2,3,4],[5]]
=> [5,1,2,3,4] => 1 = 2 - 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 1 = 2 - 1
Description
The maximal size of a rise in a permutation.
This is $\max_i \sigma_{i+1}-\sigma_i$, except for the permutations without rises, where it is $0$.
The following 429 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001280The number of parts of an integer partition that are at least two. St001335The cardinality of a minimal cycle-isolating set of a graph. St000444The length of the maximal rise of a Dyck path. St000253The crossing number of a set partition. St000254The nesting number of a set partition. St000442The maximal area to the right of an up step of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St000730The maximal arc length of a set partition. St000919The number of maximal left branches of a binary tree. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001261The Castelnuovo-Mumford regularity of a graph. St001333The cardinality of a minimal edge-isolating set of a graph. St001393The induced matching number of a graph. St001657The number of twos in an integer partition. St000003The number of standard Young tableaux of the partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000275Number of permutations whose sorted list of non zero multiplicities of the Lehmer code is the given partition. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000517The Kreweras number of an integer partition. St000847The number of standard Young tableaux whose descent set is the binary word. St000913The number of ways to refine the partition into singletons. St001568The smallest positive integer that does not appear twice in the partition. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St000290The major index of a binary word. St000291The number of descents of a binary word. St000293The number of inversions of a binary word. St000347The inversion sum of a binary word. St000629The defect of a binary word. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000921The number of internal inversions of a binary word. St000929The constant term of the character polynomial of an integer partition. St001214The aft of an integer partition. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001485The modular major index of a binary word. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St000182The number of permutations whose cycle type is the given integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001093The detour number of a graph. St001674The number of vertices of the largest induced star graph in the graph. St000264The girth of a graph, which is not a tree. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St001593This is the number of standard Young tableaux of the given shifted shape. St000260The radius of a connected graph. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000455The second largest eigenvalue of a graph if it is integral. St000451The length of the longest pattern of the form k 1 2. St000662The staircase size of the code of a permutation. St001786The number of total orderings of the north steps of a Dyck path such that steps after the k-th east step are not among the first k positions in the order. St000379The number of Hamiltonian cycles in a graph. St000655The length of the minimal rise of a Dyck path. St000326The position of the first one in a binary word after appending a 1 at the end. St000296The length of the symmetric border of a binary word. St000297The number of leading ones in a binary word. St000141The maximum drop size of a permutation. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000259The diameter of a connected graph. St001349The number of different graphs obtained from the given graph by removing an edge. 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$. St001586The number of odd parts smaller than the largest even part in an integer partition. St001570The minimal number of edges to add to make a graph Hamiltonian. St000742The number of big ascents of a permutation after prepending zero. St001340The cardinality of a minimal non-edge isolating set of a graph. St000862The number of parts of the shifted shape of a permutation. St001592The maximal number of simple paths between any two different vertices of a graph. 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. St001141The number of occurrences of hills of size 3 in a Dyck path. St001371The length of the longest Yamanouchi prefix of a binary word. St001307The number of induced stars on four vertices in a graph. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001732The number of peaks visible from the left. 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. St000464The Schultz index of a connected graph. St001545The second Elser number of a connected graph. St000456The monochromatic index of a connected graph. St001118The acyclic chromatic index of a graph. St001281The normalized isoperimetric number of a graph. St000699The toughness times the least common multiple of 1,. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000376The bounce deficit of a Dyck path. St000661The number of rises of length 3 of a Dyck path. St001139The number of occurrences of hills of size 2 in a Dyck path. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St000322The skewness of a graph. St001518The number of graphs with the same ordinary spectrum as the given graph. St001578The minimal number of edges to add or remove to make a graph a line graph. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001196The global dimension of $A$ minus the global dimension of $eAe$ for the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St000658The number of rises of length 2 of a Dyck path. St001172The number of 1-rises at odd height of a Dyck path. St001584The area statistic between a Dyck path and its bounce path. St000763The sum of the positions of the strong records of an integer composition. St000764The number of strong records in an integer composition. St000768The number of peaks in an integer composition. St001309The number of four-cliques in a graph. St000449The number of pairs of vertices of a graph with distance 4. St001890The maximum magnitude of the Möbius function of a poset. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St001256Number of simple reflexive modules that are 2-stable reflexive. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. St001204Call 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 special CNakayama algebra. 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. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001347The number of pairs of vertices of a graph having the same neighbourhood. 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. St000542The number of left-to-right-minima of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St001737The number of descents of type 2 in a permutation. St000298The order dimension or Dushnik-Miller dimension of a poset. St000299The number of nonisomorphic vertex-induced subtrees. St000378The diagonal inversion number of an integer partition. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000918The 2-limited packing number of a graph. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. 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. St000010The length of the partition. St000183The side length of the Durfee square of an integer partition. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001271The competition number of a graph. St001354The number of series nodes in the modular decomposition of a graph. St001484The number of singletons of an integer partition. St001512The minimum rank of a graph. St000147The largest part of an integer partition. St000286The number of connected components of the complement of a graph. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000383The last part of an integer composition. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. 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. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000808The number of up steps of the associated bargraph. St000903The number of different parts of an integer composition. St000917The open packing number of a graph. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St001111The weak 2-dynamic chromatic number of a graph. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001316The domatic number of a graph. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001530The depth of a Dyck path. St001642The Prague dimension of a graph. St001746The coalition number of a graph. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001814The number of partitions interlacing the given partition. St000143The largest repeated part of a partition. St000257The number of distinct parts of a partition that occur at least twice. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000386The number of factors DDU in a Dyck path. St000481The number of upper covers of a partition in dominance order. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000741The Colin de Verdière graph invariant. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001092The number of distinct even parts of a partition. St001185The number of indecomposable injective modules of grade at least 2 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. 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. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. 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. St001395The number of strictly unfriendly partitions of a graph. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001587Half of the largest even part of an integer partition. St001689The number of celebrities in a graph. St001691The number of kings in a graph. St001692The number of vertices with higher degree than the average degree in a graph. St001730The number of times the path corresponding to a binary word crosses the base line. St001743The discrepancy of a graph. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000511The number of invariant subsets when acting with a permutation of given cycle type. St000159The number of distinct parts of the integer partition. St000160The multiplicity of the smallest part of a partition. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000548The number of different non-empty partial sums of an integer partition. St000783The side length of the largest staircase partition fitting into a partition. St000897The number of different multiplicities of parts of an integer partition. St000759The smallest missing part in an integer partition. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000006The dinv of a Dyck path. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St001488The number of corners of a skew partition. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001330The hat guessing number of a graph. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000643The size of the largest orbit of antichains under Panyushev complementation. St000284The Plancherel distribution on integer partitions. St000524The number of posets with the same order polynomial. St000525The number of posets with the same zeta polynomial. St000526The number of posets with combinatorially isomorphic order polytopes. 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. St000717The number of ordinal summands of a poset. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000906The length of the shortest maximal chain in a poset. St000993The multiplicity of the largest part of an integer partition. St001095The number of non-isomorphic posets with precisely one further covering relation. St001128The exponens consonantiae of a partition. St001780The order of promotion on the set of standard tableaux of given shape. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001967The coefficient of the monomial corresponding to the integer partition in a certain power series. St001968The coefficient of the monomial corresponding to the integer partition in a certain power series. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000567The sum of the products of all pairs of parts. St000640The rank of the largest boolean interval in a poset. 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. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001175The size of a partition minus the hook length of the base cell. St001176The size of a partition minus its first part. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. 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. St000668The least common multiple of the parts of the partition. St000678The number of up steps after the last double rise of a Dyck path. St000418The number of Dyck paths that are weakly below a Dyck path. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000735The last entry on the main diagonal of a standard tableau. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000933The number of multipartitions of sizes given by an integer partition. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001389The number of partitions of the same length below the given integer partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001531Number of partial orders contained in the poset determined by the Dyck path. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001959The product of the heights of the peaks of a Dyck path. St000369The dinv deficit of a Dyck path. St000421The number of Dyck paths that are weakly below a Dyck path, except for the path itself. St000478Another weight of a partition according to Alladi. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000693The modular (standard) major index of a standard tableau. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000874The position of the last double rise in a Dyck path. St000931The number of occurrences of the pattern UUU in a Dyck path. St000934The 2-degree of an integer partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000946The sum of the skew hook positions in a Dyck path. St000976The sum of the positions of double up-steps of a Dyck path. St000977MacMahon's equal index of a Dyck path. St000978The sum of the positions of double down-steps of a Dyck path. St000984The number of boxes below precisely one peak. St001248Sum of the even parts of a partition. St001279The sum of the parts of an integer partition that are at least two. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001480The number of simple summands of the module J^2/J^3. St001541The Gini index of an integer partition. St000618The number of self-evacuating tableaux of given shape. St001432The order dimension of the partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St000225Difference between largest and smallest parts in a partition. 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. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St000667The greatest common divisor of the parts of the partition. St001571The Cartan determinant of the integer partition. St000944The 3-degree of an integer partition. St000327The number of cover relations in a poset. St001668The number of points of the poset minus the width of the poset. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000287The number of connected components of a graph. St000388The number of orbits of vertices of a graph under automorphisms. 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. St000916The packing number of a graph. St001272The number of graphs with the same degree sequence. St001282The number of graphs with the same chromatic polynomial. St001496The number of graphs with the same Laplacian spectrum as the given 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. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001775The degree of the minimal polynomial of the largest eigenvalue of a graph. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St000311The number of vertices of odd degree in a graph. St000323The minimal crossing number of a graph. St000370The genus of a graph. St000447The number of pairs of vertices of a graph with distance 3. St000552The number of cut vertices of a graph. St001323The independence gap of a graph. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001350Half of the Albertson index of a graph. St001351The Albertson index of a graph. St001479The number of bridges of a graph. St001521Half the total irregularity of a graph. St001522The total irregularity of a graph. St001574The minimal number of edges to add or remove to make a graph regular. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001646The number of edges that can be added without increasing the maximal degree of a graph. St001647The number of edges that can be added without increasing the clique number. St001708The number of pairs of vertices of different degree in a graph. St001742The difference of the maximal and the minimal degree in a graph. St001826The maximal number of leaves on a vertex of a graph. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000095The number of triangles of a graph. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001305The number of induced cycles on four vertices in a graph. St001310The number of induced diamond graphs in a graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001573The minimal number of edges to remove to make a graph triangle-free. St001690The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path. St001871The number of triconnected components of a graph. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001463The number of distinct columns in the nullspace of a graph. St000344The number of strongly connected outdegree sequences of a graph. St000274The number of perfect matchings of a graph. St001969The difference in the number of possibilities of choosing a pair of negative eigenvalues and the signature of a graph. St000422The energy of a graph, if it is integral. St000718The largest Laplacian eigenvalue of a graph if it is integral. 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. St001616The number of neutral elements in a lattice. St001754The number of tolerances of a finite lattice. St001613The binary logarithm of the size of the center of a lattice. St001617The dimension of the space of valuations of a lattice. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St001060The distinguishing index of a graph. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001875The number of simple modules with projective dimension at most 1. St001877Number of indecomposable injective modules with projective dimension 2. St001651The Frankl number of a lattice. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000671The maximin edge-connectivity for choosing a subgraph. St000454The largest eigenvalue of a graph if it is integral. St001621The number of atoms of a lattice. St001624The breadth of a lattice. St000907The number of maximal antichains of minimal length in a poset. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000941The number of characters of the symmetric group whose value on the partition is even. St000914The sum of the values of the Möbius function 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!