Processing math: 57%

Your data matches 87 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000857
Mapping
St000857: Finite Cartan types ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => 1
['A',2]
 => 3
['B',2]
 => 4
['G',2]
 => 6
['A',3]
 => 6
['B',3]
 => 9
['C',3]
 => 9
['A',4]
 => 10
['B',4]
 => 16
['C',4]
 => 16
['D',4]
 => 12
['A',5]
 => 15
['A',6]
 => 21
Description
The number of reflections of the Weyl group of a finite Cartan type. By the one-to-one correspondence between reflections and reflecting hyperplanes, this is also the number of reflecting hyperplanes. This is given by nh/2 where n is the rank and h is the Coxeter number.
Matching statistic: St000293
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00095: Integer partitions —to binary word⟶ Binary words
St000293: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => [1]
 => 10 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => 1010 => 3
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 10010 => 4
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 1000010 => 6
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => 101010 => 6
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 10010010 => 9
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 10010010 => 9
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => [4,3,2,1]
 => 10101010 => 10
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => [7,5,3,1]
 => 10010010010 => 16
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => [7,5,3,1]
 => 10010010010 => 16
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => [5,3,3,1]
 => 100110010 => 12
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => [5,4,3,2,1]
 => 1010101010 => 15
['A',6]
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,13),(4,18),(5,14),(5,19),(7,9),(8,10),(9,11),(10,12),(11,6),(12,6),(13,7),(14,8),(15,9),(15,17),(16,10),(16,17),(17,11),(17,12),(18,7),(18,15),(19,8),(19,16),(20,15),(20,16)],21)
 => [6,5,4,3,2,1]
 => 101010101010 => 21
Description
The number of inversions of a binary word.
Matching statistic: St001814
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St001814: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',1]
 => ([],1)
 => ([],1)
 => [1]
 => 2 = 1 + 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => [3]
 => 4 = 3 + 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => [4]
 => 5 = 4 + 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => [6]
 => 7 = 6 + 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => [6]
 => 7 = 6 + 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => [9]
 => 10 = 9 + 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => [9]
 => 10 = 9 + 1
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
 => [10]
 => 11 = 10 + 1
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => [16]
 => 17 = 16 + 1
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => [16]
 => 17 = 16 + 1
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
 => [12]
 => 13 = 12 + 1
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => ([(0,11),(1,10),(2,8),(2,9),(3,10),(3,13),(4,11),(4,14),(5,13),(5,14),(6,8),(6,10),(6,13),(7,9),(7,11),(7,14),(8,12),(9,12),(12,13),(12,14)],15)
 => [15]
 => 16 = 15 + 1
['A',6]
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,13),(4,18),(5,14),(5,19),(7,9),(8,10),(9,11),(10,12),(11,6),(12,6),(13,7),(14,8),(15,9),(15,17),(16,10),(16,17),(17,11),(17,12),(18,7),(18,15),(19,8),(19,16),(20,15),(20,16)],21)
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,11),(4,12),(5,13),(5,18),(6,14),(6,19),(7,9),(7,13),(7,18),(8,10),(8,14),(8,19),(9,11),(9,15),(10,12),(10,16),(11,17),(12,17),(15,17),(15,18),(15,20),(16,17),(16,19),(16,20)],21)
 => [21]
 => 22 = 21 + 1
Description
The number of partitions interlacing the given partition.
Matching statistic: St001279
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
St001279: Integer partitions ⟶ ℤResult quality: 90% ●values known / values provided: 92%●distinct values known / distinct values provided: 90%
Values
['A',1]
 => ([],1)
 => [1]
 => 0 = 1 - 1
['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => 2 = 3 - 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => 3 = 4 - 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => 5 = 6 - 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => 5 = 6 - 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 8 = 9 - 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [5,3,1]
 => 8 = 9 - 1
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => [4,3,2,1]
 => 9 = 10 - 1
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => [7,5,3,1]
 => 15 = 16 - 1
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => [7,5,3,1]
 => 15 = 16 - 1
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => [5,3,3,1]
 => 11 = 12 - 1
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => [5,4,3,2,1]
 => 14 = 15 - 1
['A',6]
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,13),(4,18),(5,14),(5,19),(7,9),(8,10),(9,11),(10,12),(11,6),(12,6),(13,7),(14,8),(15,9),(15,17),(16,10),(16,17),(17,11),(17,12),(18,7),(18,15),(19,8),(19,16),(20,15),(20,16)],21)
 => [6,5,4,3,2,1]
 => ? = 21 - 1
Description
The sum of the parts of an integer partition that are at least two.
Matching statistic: St000147
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St000147: Integer partitions ⟶ ℤResult quality: 90% ●values known / values provided: 92%●distinct values known / distinct values provided: 90%
Values
['A',1]
 => ([],1)
 => ([],1)
 => [1]
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => [3]
 => 3
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => [4]
 => 4
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => [6]
 => 6
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => [6]
 => 6
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => [9]
 => 9
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => [9]
 => 9
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
 => [10]
 => 10
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => [16]
 => 16
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => [16]
 => 16
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
 => [12]
 => 12
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => ([(0,11),(1,10),(2,8),(2,9),(3,10),(3,13),(4,11),(4,14),(5,13),(5,14),(6,8),(6,10),(6,13),(7,9),(7,11),(7,14),(8,12),(9,12),(12,13),(12,14)],15)
 => [15]
 => 15
['A',6]
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,13),(4,18),(5,14),(5,19),(7,9),(8,10),(9,11),(10,12),(11,6),(12,6),(13,7),(14,8),(15,9),(15,17),(16,10),(16,17),(17,11),(17,12),(18,7),(18,15),(19,8),(19,16),(20,15),(20,16)],21)
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,11),(4,12),(5,13),(5,18),(6,14),(6,19),(7,9),(7,13),(7,18),(8,10),(8,14),(8,19),(9,11),(9,15),(10,12),(10,16),(11,17),(12,17),(15,17),(15,18),(15,20),(16,17),(16,19),(16,20)],21)
 => [21]
 => ? = 21
Description
The largest part of an integer partition.
Matching statistic: St000459
(load all 3 compositions to match this statistic)
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St000459: Integer partitions ⟶ ℤResult quality: 90% ●values known / values provided: 92%●distinct values known / distinct values provided: 90%
Values
['A',1]
 => ([],1)
 => ([],1)
 => [1]
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => [3]
 => 3
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => [4]
 => 4
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => [6]
 => 6
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => [6]
 => 6
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => [9]
 => 9
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => [9]
 => 9
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
 => [10]
 => 10
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => [16]
 => 16
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => [16]
 => 16
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
 => [12]
 => 12
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => ([(0,11),(1,10),(2,8),(2,9),(3,10),(3,13),(4,11),(4,14),(5,13),(5,14),(6,8),(6,10),(6,13),(7,9),(7,11),(7,14),(8,12),(9,12),(12,13),(12,14)],15)
 => [15]
 => 15
['A',6]
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,13),(4,18),(5,14),(5,19),(7,9),(8,10),(9,11),(10,12),(11,6),(12,6),(13,7),(14,8),(15,9),(15,17),(16,10),(16,17),(17,11),(17,12),(18,7),(18,15),(19,8),(19,16),(20,15),(20,16)],21)
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,11),(4,12),(5,13),(5,18),(6,14),(6,19),(7,9),(7,13),(7,18),(8,10),(8,14),(8,19),(9,11),(9,15),(10,12),(10,16),(11,17),(12,17),(15,17),(15,18),(15,20),(16,17),(16,19),(16,20)],21)
 => [21]
 => ? = 21
Description
The hook length of the base cell of a partition. This is also known as the perimeter of a partition. In particular, the perimeter of the empty partition is zero.
Matching statistic: St001360
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St001360: Integer partitions ⟶ ℤResult quality: 90% ●values known / values provided: 92%●distinct values known / distinct values provided: 90%
Values
['A',1]
 => ([],1)
 => ([],1)
 => [1]
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => [3]
 => 3
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => [4]
 => 4
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => [6]
 => 6
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => [6]
 => 6
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => [9]
 => 9
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => [9]
 => 9
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
 => [10]
 => 10
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => [16]
 => 16
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => [16]
 => 16
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
 => [12]
 => 12
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => ([(0,11),(1,10),(2,8),(2,9),(3,10),(3,13),(4,11),(4,14),(5,13),(5,14),(6,8),(6,10),(6,13),(7,9),(7,11),(7,14),(8,12),(9,12),(12,13),(12,14)],15)
 => [15]
 => 15
['A',6]
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,13),(4,18),(5,14),(5,19),(7,9),(8,10),(9,11),(10,12),(11,6),(12,6),(13,7),(14,8),(15,9),(15,17),(16,10),(16,17),(17,11),(17,12),(18,7),(18,15),(19,8),(19,16),(20,15),(20,16)],21)
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,11),(4,12),(5,13),(5,18),(6,14),(6,19),(7,9),(7,13),(7,18),(8,10),(8,14),(8,19),(9,11),(9,15),(10,12),(10,16),(11,17),(12,17),(15,17),(15,18),(15,20),(16,17),(16,19),(16,20)],21)
 => [21]
 => ? = 21
Description
The number of covering relations in Young's lattice below a partition.
Matching statistic: St001389
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St001389: Integer partitions ⟶ ℤResult quality: 90% ●values known / values provided: 92%●distinct values known / distinct values provided: 90%
Values
['A',1]
 => ([],1)
 => ([],1)
 => [1]
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => [3]
 => 3
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => [4]
 => 4
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => [6]
 => 6
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => [6]
 => 6
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => [9]
 => 9
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => [9]
 => 9
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
 => [10]
 => 10
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => [16]
 => 16
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => [16]
 => 16
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
 => [12]
 => 12
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => ([(0,11),(1,10),(2,8),(2,9),(3,10),(3,13),(4,11),(4,14),(5,13),(5,14),(6,8),(6,10),(6,13),(7,9),(7,11),(7,14),(8,12),(9,12),(12,13),(12,14)],15)
 => [15]
 => 15
['A',6]
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,13),(4,18),(5,14),(5,19),(7,9),(8,10),(9,11),(10,12),(11,6),(12,6),(13,7),(14,8),(15,9),(15,17),(16,10),(16,17),(17,11),(17,12),(18,7),(18,15),(19,8),(19,16),(20,15),(20,16)],21)
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,11),(4,12),(5,13),(5,18),(6,14),(6,19),(7,9),(7,13),(7,18),(8,10),(8,14),(8,19),(9,11),(9,15),(10,12),(10,16),(11,17),(12,17),(15,17),(15,18),(15,20),(16,17),(16,19),(16,20)],21)
 => [21]
 => ? = 21
Description
The number of partitions of the same length below the given integer partition. For a partition λ1≥…λk>0, this number is \det\left( \binom{\lambda_{k+1-i}}{j-i+1} \right)_{1 \le i,j \le k}.
Matching statistic: St001527
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St001527: Integer partitions ⟶ ℤResult quality: 90% ●values known / values provided: 92%●distinct values known / distinct values provided: 90%
Values
['A',1]
 => ([],1)
 => ([],1)
 => [1]
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => [3]
 => 3
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => [4]
 => 4
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => [6]
 => 6
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => [6]
 => 6
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => [9]
 => 9
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => [9]
 => 9
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
 => [10]
 => 10
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => [16]
 => 16
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => [16]
 => 16
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
 => [12]
 => 12
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => ([(0,11),(1,10),(2,8),(2,9),(3,10),(3,13),(4,11),(4,14),(5,13),(5,14),(6,8),(6,10),(6,13),(7,9),(7,11),(7,14),(8,12),(9,12),(12,13),(12,14)],15)
 => [15]
 => 15
['A',6]
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,13),(4,18),(5,14),(5,19),(7,9),(8,10),(9,11),(10,12),(11,6),(12,6),(13,7),(14,8),(15,9),(15,17),(16,10),(16,17),(17,11),(17,12),(18,7),(18,15),(19,8),(19,16),(20,15),(20,16)],21)
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,11),(4,12),(5,13),(5,18),(6,14),(6,19),(7,9),(7,13),(7,18),(8,10),(8,14),(8,19),(9,11),(9,15),(10,12),(10,16),(11,17),(12,17),(15,17),(15,18),(15,20),(16,17),(16,19),(16,20)],21)
 => [21]
 => ? = 21
Description
The cyclic permutation representation number of an integer partition. This is the size of the largest cyclic group C such that the fake degree is the character of a permutation representation of C.
Matching statistic: St001659
Mapping
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St001659: Integer partitions ⟶ ℤResult quality: 90% ●values known / values provided: 92%●distinct values known / distinct values provided: 90%
Values
['A',1]
 => ([],1)
 => ([],1)
 => [1]
 => 1
['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => [3]
 => 3
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => [4]
 => 4
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
 => [6]
 => 6
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
 => [6]
 => 6
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => [9]
 => 9
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
 => [9]
 => 9
['A',4]
 => ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
 => ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
 => [10]
 => 10
['B',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => [16]
 => 16
['C',4]
 => ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
 => ([(0,15),(1,11),(2,10),(3,13),(3,15),(4,14),(4,15),(5,10),(5,13),(6,11),(6,14),(7,8),(7,9),(7,12),(8,10),(8,13),(9,11),(9,14),(12,13),(12,14),(12,15)],16)
 => [16]
 => 16
['D',4]
 => ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
 => ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
 => [12]
 => 12
['A',5]
 => ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
 => ([(0,11),(1,10),(2,8),(2,9),(3,10),(3,13),(4,11),(4,14),(5,13),(5,14),(6,8),(6,10),(6,13),(7,9),(7,11),(7,14),(8,12),(9,12),(12,13),(12,14)],15)
 => [15]
 => 15
['A',6]
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,13),(4,18),(5,14),(5,19),(7,9),(8,10),(9,11),(10,12),(11,6),(12,6),(13,7),(14,8),(15,9),(15,17),(16,10),(16,17),(17,11),(17,12),(18,7),(18,15),(19,8),(19,16),(20,15),(20,16)],21)
 => ([(0,14),(1,13),(2,18),(2,20),(3,19),(3,20),(4,11),(4,12),(5,13),(5,18),(6,14),(6,19),(7,9),(7,13),(7,18),(8,10),(8,14),(8,19),(9,11),(9,15),(10,12),(10,16),(11,17),(12,17),(15,17),(15,18),(15,20),(16,17),(16,19),(16,20)],21)
 => [21]
 => ? = 21
Description
The number of ways to place as many non-attacking rooks as possible on a Ferrers board.
The following 77 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000548The number of different non-empty partial sums of an integer partition. St000734The last entry in the first row of a standard tableau. St000738The first entry in the last row of a standard tableau. St001034The area of the parallelogram polyomino associated with the Dyck path. St001400The total number of Littlewood-Richardson tableaux of given shape. St000384The maximal part of the shifted composition of an integer partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000531The leading coefficient of the rook polynomial of an integer partition. St000667The greatest common divisor of the parts of the partition. St000784The maximum of the length and the largest part of the integer partition. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000992The alternating sum of the parts of an integer partition. St001055The Grundy value for the game of removing cells of a row in an integer partition. St000063The number of linear extensions of a certain poset defined for an integer partition. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000532The total number of rook placements on a Ferrers board. St000228The size of a partition. St000184The size of the centralizer of any permutation of given cycle type. St000477The weight of a partition according to Alladi. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St001571The Cartan determinant of the integer partition. St000108The number of partitions contained in the given partition. St000145The Dyson rank of a partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000681The Grundy value of Chomp on Ferrers diagrams. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000934The 2-degree of an integer partition. St000806The semiperimeter of the associated bargraph. St001651The Frankl number of a lattice. St000189The number of elements in the poset. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001342The number of vertices in the center of a graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001391The disjunction number of a graph. St000171The degree of the graph. St000271The chromatic index of a graph. St000479The Ramsey number of a graph. St000636The hull number of a graph. St000722The number of different neighbourhoods in a graph. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001118The acyclic chromatic index of a graph. St001120The length of a longest path in a graph. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. 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. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001725The harmonious chromatic number of a graph. St001746The coalition number of a graph. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001723The differential of a graph. St001724The 2-packing differential of a graph. St000656The number of cuts of a poset. St000939The number of characters of the symmetric group whose value on the partition is positive. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St001917The order of toric promotion on the set of labellings of a graph. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St001117The game chromatic index of a graph. St000450The number of edges minus the number of vertices plus 2 of a graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001869The maximum cut size of a graph. St000095The number of triangles of a graph. St000309The number of vertices with even degree. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001742The difference of the maximal and the minimal degree in a graph. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001706The number of closed sets in a graph.