- FindStat

Your data matches 367 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)

Matching statistic: St001914

Mapping

Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St001914: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => [1]
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => [1]
 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => [1]
 => 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => [2,1]
 => 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]
 => [3,1]
 => 3
['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]
 => [3,1]
 => 3
['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]
 => [3,2,1]
 => 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]
 => [5,3,1]
 => 5
['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]
 => [5,3,1]
 => 5
['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]
 => [3,3,1]
 => 4
['F',4]
 => ([(0,18),(1,19),(2,18),(2,22),(3,19),(3,22),(4,6),(6,5),(7,11),(8,16),(9,17),(10,13),(10,14),(11,4),(12,23),(13,8),(13,23),(14,9),(14,23),(15,11),(16,15),(17,7),(17,15),(18,20),(19,21),(20,12),(20,13),(21,12),(21,14),(22,10),(22,20),(22,21),(23,16),(23,17)],24)
 => [11,7,5,1]
 => [7,5,1]
 => 7
['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]
 => [4,3,2,1]
 => 1
['B',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => [9,7,5,3,1]
 => [7,5,3,1]
 => 8
['C',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => [9,7,5,3,1]
 => [7,5,3,1]
 => 8
['D',5]
 => ([(0,13),(1,16),(2,15),(3,13),(3,17),(4,15),(4,16),(4,17),(6,10),(7,19),(8,19),(9,18),(10,5),(11,7),(11,18),(12,8),(12,18),(13,14),(14,7),(14,8),(15,9),(15,11),(16,9),(16,12),(17,11),(17,12),(17,14),(18,6),(18,19),(19,10)],20)
 => [7,5,4,3,1]
 => [5,4,3,1]
 => 5
['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]
 => [5,4,3,2,1]
 => 1

Description

The size of the orbit of an integer partition in Bulgarian solitaire. Bulgarian solitaire is the dynamical system where a move consists of removing the first column of the Ferrers diagram and inserting it as a row. This statistic returns the number of partitions that can be obtained from the given partition.

Matching statistic: St000698

Mapping

Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000698: Integer partitions ⟶ ℤResult quality: 50% ●values known / values provided: 50%●distinct values known / distinct values provided: 67%

Values

['A',2]
 => ([(0,2),(1,2)],3)
 => [2,1]
 => [1]
 => ? = 1 - 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [3,1]
 => [1]
 => ? = 1 - 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [5,1]
 => [1]
 => ? = 1 - 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [3,2,1]
 => [2,1]
 => 0 = 1 - 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]
 => [3,1]
 => 2 = 3 - 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]
 => [3,1]
 => 2 = 3 - 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]
 => [3,2,1]
 => 0 = 1 - 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]
 => [5,3,1]
 => 4 = 5 - 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]
 => [5,3,1]
 => 4 = 5 - 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]
 => [3,3,1]
 => 3 = 4 - 1
['F',4]
 => ([(0,18),(1,19),(2,18),(2,22),(3,19),(3,22),(4,6),(6,5),(7,11),(8,16),(9,17),(10,13),(10,14),(11,4),(12,23),(13,8),(13,23),(14,9),(14,23),(15,11),(16,15),(17,7),(17,15),(18,20),(19,21),(20,12),(20,13),(21,12),(21,14),(22,10),(22,20),(22,21),(23,16),(23,17)],24)
 => [11,7,5,1]
 => [7,5,1]
 => ? = 7 - 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]
 => [4,3,2,1]
 => 0 = 1 - 1
['B',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => [9,7,5,3,1]
 => [7,5,3,1]
 => ? = 8 - 1
['C',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => [9,7,5,3,1]
 => [7,5,3,1]
 => ? = 8 - 1
['D',5]
 => ([(0,13),(1,16),(2,15),(3,13),(3,17),(4,15),(4,16),(4,17),(6,10),(7,19),(8,19),(9,18),(10,5),(11,7),(11,18),(12,8),(12,18),(13,14),(14,7),(14,8),(15,9),(15,11),(16,9),(16,12),(17,11),(17,12),(17,14),(18,6),(18,19),(19,10)],20)
 => [7,5,4,3,1]
 => [5,4,3,1]
 => ? = 5 - 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]
 => [5,4,3,2,1]
 => ? = 1 - 1

Description

The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. For any positive integer

$k$ , one associates a

$k$ -core to a partition by repeatedly removing all rim hooks of size

$k$ . This statistic counts the

$2$ -rim hooks that are removed in this process to obtain a

$2$ -core.

Matching statistic: St001440

Mapping

Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00198: Posets —incomparability graph⟶ Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
St001440: Integer partitions ⟶ ℤResult quality: 33% ●values known / values provided: 44%●distinct values known / distinct values provided: 33%

Values

['A',2]
 => ([(0,2),(1,2)],3)
 => ([(1,2)],3)
 => [2,1]
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(2,3)],4)
 => [2,1,1]
 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => ([(4,5)],6)
 => [2,1,1,1,1]
 => 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
 => [5,1]
 => 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(2,7),(3,5),(3,8),(4,6),(4,8),(5,6),(5,7),(6,8),(7,8)],9)
 => [7,1,1]
 => 3
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ([(2,7),(3,5),(3,8),(4,6),(4,8),(5,6),(5,7),(6,8),(7,8)],9)
 => [7,1,1]
 => 3
['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)
 => ([(1,2),(1,7),(1,9),(2,6),(2,8),(3,4),(3,6),(3,8),(3,9),(4,7),(4,8),(4,9),(5,6),(5,7),(5,8),(5,9),(6,7),(6,9),(7,8),(8,9)],10)
 => [9,1]
 => 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)
 => ([(2,10),(3,6),(3,10),(3,13),(4,9),(4,11),(4,14),(4,15),(5,12),(5,13),(5,14),(5,15),(6,12),(6,14),(6,15),(7,8),(7,9),(7,12),(7,14),(7,15),(8,11),(8,13),(8,14),(8,15),(9,11),(9,13),(9,15),(10,12),(10,14),(10,15),(11,12),(11,14),(11,15),(12,13),(13,14),(13,15)],16)
 => [14,1,1]
 => ? = 5
['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)
 => ([(2,10),(3,6),(3,10),(3,13),(4,9),(4,11),(4,14),(4,15),(5,12),(5,13),(5,14),(5,15),(6,12),(6,14),(6,15),(7,8),(7,9),(7,12),(7,14),(7,15),(8,11),(8,13),(8,14),(8,15),(9,11),(9,13),(9,15),(10,12),(10,14),(10,15),(11,12),(11,14),(11,15),(12,13),(13,14),(13,15)],16)
 => [14,1,1]
 => ? = 5
['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)
 => ([(2,9),(2,10),(2,11),(3,4),(3,5),(3,8),(3,11),(4,5),(4,7),(4,10),(5,6),(5,9),(6,7),(6,8),(6,10),(6,11),(7,8),(7,9),(7,11),(8,9),(8,10),(9,10),(9,11),(10,11)],12)
 => [10,1,1]
 => ? = 4
['F',4]
 => ([(0,18),(1,19),(2,18),(2,22),(3,19),(3,22),(4,6),(6,5),(7,11),(8,16),(9,17),(10,13),(10,14),(11,4),(12,23),(13,8),(13,23),(14,9),(14,23),(15,11),(16,15),(17,7),(17,15),(18,20),(19,21),(20,12),(20,13),(21,12),(21,14),(22,10),(22,20),(22,21),(23,16),(23,17)],24)
 => ([(4,8),(5,20),(5,23),(6,7),(6,23),(7,8),(7,20),(8,23),(9,18),(9,19),(9,21),(9,22),(10,11),(10,18),(10,21),(10,22),(11,19),(11,21),(11,22),(12,15),(12,16),(12,17),(12,20),(12,23),(13,14),(13,16),(13,17),(13,19),(13,22),(13,23),(14,15),(14,17),(14,18),(14,20),(14,21),(15,16),(15,19),(15,22),(15,23),(16,18),(16,20),(16,21),(17,18),(17,19),(17,21),(17,22),(18,19),(18,22),(18,23),(19,20),(19,21),(20,22),(20,23),(21,22),(21,23)],24)
 => [20,1,1,1,1]
 => ? = 7
['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)
 => ([(1,2),(1,10),(1,12),(1,14),(2,9),(2,11),(2,13),(3,7),(3,8),(3,11),(3,12),(3,13),(3,14),(4,9),(4,10),(4,11),(4,12),(4,13),(4,14),(5,6),(5,8),(5,9),(5,11),(5,12),(5,13),(5,14),(6,7),(6,10),(6,11),(6,12),(6,13),(6,14),(7,8),(7,9),(7,11),(7,13),(7,14),(8,10),(8,12),(8,13),(8,14),(9,10),(9,12),(9,14),(10,11),(10,13),(11,12),(11,14),(12,13),(13,14)],15)
 => [14,1]
 => ? = 1
['B',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => ([(2,10),(3,6),(3,10),(3,20),(4,5),(4,19),(4,20),(4,22),(4,23),(4,24),(5,6),(5,10),(5,15),(5,20),(5,21),(6,19),(6,22),(6,23),(6,24),(7,15),(7,19),(7,20),(7,21),(7,22),(7,23),(7,24),(8,9),(8,16),(8,17),(8,18),(8,22),(8,23),(8,24),(9,14),(9,16),(9,17),(9,21),(9,23),(9,24),(10,19),(10,22),(10,23),(10,24),(11,14),(11,16),(11,17),(11,18),(11,21),(11,22),(11,23),(11,24),(12,13),(12,17),(12,18),(12,19),(12,21),(12,22),(12,23),(12,24),(13,14),(13,15),(13,16),(13,20),(13,21),(13,22),(13,23),(13,24),(14,17),(14,18),(14,19),(14,22),(14,23),(14,24),(15,17),(15,18),(15,19),(15,22),(15,23),(15,24),(16,17),(16,18),(16,19),(16,22),(16,23),(16,24),(17,20),(17,21),(17,24),(18,20),(18,21),(18,23),(18,24),(19,20),(19,21),(20,22),(20,23),(20,24),(21,22),(21,23),(21,24)],25)
 => [23,1,1]
 => ? = 8
['C',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => ([(2,10),(3,6),(3,10),(3,20),(4,5),(4,19),(4,20),(4,22),(4,23),(4,24),(5,6),(5,10),(5,15),(5,20),(5,21),(6,19),(6,22),(6,23),(6,24),(7,15),(7,19),(7,20),(7,21),(7,22),(7,23),(7,24),(8,9),(8,16),(8,17),(8,18),(8,22),(8,23),(8,24),(9,14),(9,16),(9,17),(9,21),(9,23),(9,24),(10,19),(10,22),(10,23),(10,24),(11,14),(11,16),(11,17),(11,18),(11,21),(11,22),(11,23),(11,24),(12,13),(12,17),(12,18),(12,19),(12,21),(12,22),(12,23),(12,24),(13,14),(13,15),(13,16),(13,20),(13,21),(13,22),(13,23),(13,24),(14,17),(14,18),(14,19),(14,22),(14,23),(14,24),(15,17),(15,18),(15,19),(15,22),(15,23),(15,24),(16,17),(16,18),(16,19),(16,22),(16,23),(16,24),(17,20),(17,21),(17,24),(18,20),(18,21),(18,23),(18,24),(19,20),(19,21),(20,22),(20,23),(20,24),(21,22),(21,23),(21,24)],25)
 => [23,1,1]
 => ? = 8
['D',5]
 => ([(0,13),(1,16),(2,15),(3,13),(3,17),(4,15),(4,16),(4,17),(6,10),(7,19),(8,19),(9,18),(10,5),(11,7),(11,18),(12,8),(12,18),(13,14),(14,7),(14,8),(15,9),(15,11),(16,9),(16,12),(17,11),(17,12),(17,14),(18,6),(18,19),(19,10)],20)
 => ([(2,5),(3,8),(3,9),(3,15),(3,18),(3,19),(4,7),(4,16),(4,17),(4,18),(4,19),(5,8),(5,9),(5,15),(5,18),(5,19),(6,12),(6,13),(6,14),(6,16),(6,17),(6,18),(6,19),(7,12),(7,13),(7,14),(7,16),(7,17),(7,19),(8,9),(8,11),(8,13),(8,14),(8,17),(9,10),(9,12),(9,14),(9,16),(10,11),(10,13),(10,14),(10,15),(10,17),(10,18),(10,19),(11,12),(11,14),(11,15),(11,16),(11,18),(11,19),(12,13),(12,15),(12,17),(12,18),(12,19),(13,15),(13,16),(13,18),(13,19),(14,15),(14,18),(14,19),(15,16),(15,17),(16,17),(16,18),(16,19),(17,18),(17,19)],20)
 => [18,1,1]
 => ? = 5
['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)
 => ([(1,2),(1,7),(1,16),(1,18),(1,20),(2,6),(2,15),(2,17),(2,19),(3,6),(3,7),(3,15),(3,16),(3,17),(3,18),(3,19),(3,20),(4,5),(4,11),(4,12),(4,14),(4,15),(4,17),(4,18),(4,19),(4,20),(5,11),(5,12),(5,13),(5,16),(5,17),(5,18),(5,19),(5,20),(6,7),(6,9),(6,11),(6,13),(6,16),(6,18),(6,20),(7,10),(7,12),(7,14),(7,15),(7,17),(7,19),(8,11),(8,12),(8,13),(8,14),(8,15),(8,16),(8,17),(8,18),(8,19),(8,20),(9,10),(9,12),(9,14),(9,15),(9,16),(9,17),(9,18),(9,19),(9,20),(10,11),(10,13),(10,15),(10,16),(10,17),(10,18),(10,19),(10,20),(11,12),(11,14),(11,15),(11,17),(11,19),(11,20),(12,13),(12,16),(12,18),(12,19),(12,20),(13,14),(13,15),(13,17),(13,18),(13,19),(13,20),(14,16),(14,17),(14,18),(14,19),(14,20),(15,16),(15,18),(15,20),(16,17),(16,19),(17,18),(17,20),(18,19),(19,20)],21)
 => [20,1]
 => ? = 1

Description

The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition.

Matching statistic: St000383

Mapping

Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00074: Posets —to graph⟶ Graphs
Mp00152: Graphs —Laplacian multiplicities⟶ Integer compositions
St000383: Integer compositions ⟶ ℤResult quality: 17% ●values known / values provided: 31%●distinct values known / distinct values provided: 17%

Values

['A',2]
 => ([(0,2),(1,2)],3)
 => ([(0,2),(1,2)],3)
 => [1,1,1] => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => ([(0,3),(1,3),(2,3)],4)
 => [1,2,1] => 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)
 => [1,1,1,1,1,1] => 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)
 => [1,1,1,1,1,1] => 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)
 => [1,1,1,1,1,1,1,1,1] => ? = 3
['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)
 => [1,1,1,1,1,1,1,1,1] => ? = 3
['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)
 => [1,1,1,1,1,1,1,1,1,1] => 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)
 => [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] => ? = 5
['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)
 => [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] => ? = 5
['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)
 => [1,3,3,1,3,1] => ? = 4
['F',4]
 => ([(0,18),(1,19),(2,18),(2,22),(3,19),(3,22),(4,6),(6,5),(7,11),(8,16),(9,17),(10,13),(10,14),(11,4),(12,23),(13,8),(13,23),(14,9),(14,23),(15,11),(16,15),(17,7),(17,15),(18,20),(19,21),(20,12),(20,13),(21,12),(21,14),(22,10),(22,20),(22,21),(23,16),(23,17)],24)
 => ([(0,15),(1,16),(2,9),(3,15),(3,22),(4,16),(4,22),(5,17),(5,19),(6,12),(6,17),(7,9),(7,12),(8,13),(8,18),(10,18),(10,19),(10,22),(11,20),(11,21),(11,23),(12,14),(13,14),(13,23),(14,17),(15,20),(16,21),(17,23),(18,20),(18,23),(19,21),(19,23),(20,22),(21,22)],24)
 => [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] => ? = 7
['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)
 => [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] => ? = 1
['B',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => ([(0,24),(1,15),(2,14),(3,20),(3,22),(4,21),(4,23),(5,20),(5,24),(6,21),(6,24),(7,14),(7,22),(8,15),(8,23),(9,12),(9,14),(9,22),(10,13),(10,15),(10,23),(11,12),(11,13),(11,17),(12,18),(13,19),(16,17),(16,20),(16,21),(16,24),(17,18),(17,19),(18,20),(18,22),(19,21),(19,23)],25)
 => [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] => ? = 8
['C',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => ([(0,24),(1,15),(2,14),(3,20),(3,22),(4,21),(4,23),(5,20),(5,24),(6,21),(6,24),(7,14),(7,22),(8,15),(8,23),(9,12),(9,14),(9,22),(10,13),(10,15),(10,23),(11,12),(11,13),(11,17),(12,18),(13,19),(16,17),(16,20),(16,21),(16,24),(17,18),(17,19),(18,20),(18,22),(19,21),(19,23)],25)
 => [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] => ? = 8
['D',5]
 => ([(0,13),(1,16),(2,15),(3,13),(3,17),(4,15),(4,16),(4,17),(6,10),(7,19),(8,19),(9,18),(10,5),(11,7),(11,18),(12,8),(12,18),(13,14),(14,7),(14,8),(15,9),(15,11),(16,9),(16,12),(17,11),(17,12),(17,14),(18,6),(18,19),(19,10)],20)
 => ([(0,17),(1,16),(2,11),(3,10),(4,10),(4,18),(5,11),(5,19),(6,16),(6,17),(6,18),(7,16),(7,17),(7,19),(8,12),(8,13),(8,14),(9,12),(9,13),(9,15),(10,12),(11,13),(12,18),(13,19),(14,16),(14,18),(14,19),(15,17),(15,18),(15,19)],20)
 => [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] => ? = 5
['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)
 => [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1] => ? = 1

Description

The last part of an integer composition.

Matching statistic: St001252

Mapping

Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00306: Posets —rowmotion cycle type⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St001252: Integer partitions ⟶ ℤResult quality: 31% ●values known / values provided: 31%●distinct values known / distinct values provided: 33%

Values

['A',2]
 => ([(0,2),(1,2)],3)
 => [3,2]
 => [2,2,1]
 => 2 = 1 + 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => [4,2]
 => [2,2,1,1]
 => 2 = 1 + 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => [6,2]
 => [2,2,1,1,1,1]
 => 2 = 1 + 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => [8,4,2]
 => [3,3,2,2,1,1,1,1]
 => ? = 1 + 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [6,6,6,2]
 => [4,4,3,3,3,3]
 => 4 = 3 + 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => [6,6,6,2]
 => [4,4,3,3,3,3]
 => 4 = 3 + 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)
 => [10,10,10,5,5,2]
 => [6,6,5,5,5,3,3,3,3,3]
 => ? = 1 + 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)
 => [8,8,8,8,8,8,8,8,4,2]
 => [10,10,9,9,8,8,8,8]
 => ? = 5 + 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)
 => [8,8,8,8,8,8,8,8,4,2]
 => [10,10,9,9,8,8,8,8]
 => ? = 5 + 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)
 => [6,6,6,6,6,6,6,3,3,2]
 => [10,10,9,7,7,7]
 => ? = 4 + 1
['F',4]
 => ([(0,18),(1,19),(2,18),(2,22),(3,19),(3,22),(4,6),(6,5),(7,11),(8,16),(9,17),(10,13),(10,14),(11,4),(12,23),(13,8),(13,23),(14,9),(14,23),(15,11),(16,15),(17,7),(17,15),(18,20),(19,21),(20,12),(20,13),(21,12),(21,14),(22,10),(22,20),(22,21),(23,16),(23,17)],24)
 => [12,12,12,12,12,12,12,12,4,3,2]
 => [11,11,10,9,8,8,8,8,8,8,8,8]
 => ? = 7 + 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)
 => [12,12,12,12,12,12,12,12,12,6,6,6,4,2]
 => [14,14,13,13,12,12,9,9,9,9,9,9]
 => ? = 1 + 1
['B',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => [10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,2]
 => [26,26,25,25,25,25,25,25,25,25]
 => ? = 8 + 1
['C',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => [10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,2]
 => [26,26,25,25,25,25,25,25,25,25]
 => ? = 8 + 1
['D',5]
 => ([(0,13),(1,16),(2,15),(3,13),(3,17),(4,15),(4,16),(4,17),(6,10),(7,19),(8,19),(9,18),(10,5),(11,7),(11,18),(12,8),(12,18),(13,14),(14,7),(14,8),(15,9),(15,11),(16,9),(16,12),(17,11),(17,12),(17,14),(18,6),(18,19),(19,10)],20)
 => [16,16,16,16,16,16,16,8,8,8,8,8,8,8,8,4,2]
 => [17,17,16,16,15,15,15,15,7,7,7,7,7,7,7,7]
 => ? = 5 + 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)
 => [14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,14,7,7,7,7,7,2]
 => [34,34,33,33,33,33,33,28,28,28,28,28,28,28]
 => ? = 1 + 1

Description

Half the sum of the even parts of a partition.

Matching statistic: St000908
(load all 3 compositions to match this statistic)

Mapping

Mp00148: Finite Cartan types —to root poset⟶ Posets
St000908: Posets ⟶ ℤResult quality: 17% ●values known / values provided: 25%●distinct values known / distinct values provided: 17%

Values

['A',2]
 => ([(0,2),(1,2)],3)
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,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)
 => ? = 3
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ? = 3
['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)
 => ? = 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)
 => ? = 5
['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)
 => ? = 5
['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)
 => ? = 4
['F',4]
 => ([(0,18),(1,19),(2,18),(2,22),(3,19),(3,22),(4,6),(6,5),(7,11),(8,16),(9,17),(10,13),(10,14),(11,4),(12,23),(13,8),(13,23),(14,9),(14,23),(15,11),(16,15),(17,7),(17,15),(18,20),(19,21),(20,12),(20,13),(21,12),(21,14),(22,10),(22,20),(22,21),(23,16),(23,17)],24)
 => ? = 7
['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)
 => ? = 1
['B',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => ? = 8
['C',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => ? = 8
['D',5]
 => ([(0,13),(1,16),(2,15),(3,13),(3,17),(4,15),(4,16),(4,17),(6,10),(7,19),(8,19),(9,18),(10,5),(11,7),(11,18),(12,8),(12,18),(13,14),(14,7),(14,8),(15,9),(15,11),(16,9),(16,12),(17,11),(17,12),(17,14),(18,6),(18,19),(19,10)],20)
 => ? = 5
['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)
 => ? = 1

Description

The length of the shortest maximal antichain in a poset.

Matching statistic: St000911
(load all 2 compositions to match this statistic)

Mapping

Mp00148: Finite Cartan types —to root poset⟶ Posets
St000911: Posets ⟶ ℤResult quality: 17% ●values known / values provided: 25%●distinct values known / distinct values provided: 17%

Values

['A',2]
 => ([(0,2),(1,2)],3)
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,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)
 => ? = 3
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ? = 3
['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)
 => ? = 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)
 => ? = 5
['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)
 => ? = 5
['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)
 => ? = 4
['F',4]
 => ([(0,18),(1,19),(2,18),(2,22),(3,19),(3,22),(4,6),(6,5),(7,11),(8,16),(9,17),(10,13),(10,14),(11,4),(12,23),(13,8),(13,23),(14,9),(14,23),(15,11),(16,15),(17,7),(17,15),(18,20),(19,21),(20,12),(20,13),(21,12),(21,14),(22,10),(22,20),(22,21),(23,16),(23,17)],24)
 => ? = 7
['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)
 => ? = 1
['B',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => ? = 8
['C',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => ? = 8
['D',5]
 => ([(0,13),(1,16),(2,15),(3,13),(3,17),(4,15),(4,16),(4,17),(6,10),(7,19),(8,19),(9,18),(10,5),(11,7),(11,18),(12,8),(12,18),(13,14),(14,7),(14,8),(15,9),(15,11),(16,9),(16,12),(17,11),(17,12),(17,14),(18,6),(18,19),(19,10)],20)
 => ? = 5
['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)
 => ? = 1

Description

The number of maximal antichains of maximal size in a poset.

Matching statistic: St000914
(load all 3 compositions to match this statistic)

Mapping

Mp00148: Finite Cartan types —to root poset⟶ Posets
St000914: Posets ⟶ ℤResult quality: 17% ●values known / values provided: 25%●distinct values known / distinct values provided: 17%

Values

['A',2]
 => ([(0,2),(1,2)],3)
 => 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,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)
 => ? = 3
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ? = 3
['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)
 => ? = 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)
 => ? = 5
['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)
 => ? = 5
['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)
 => ? = 4
['F',4]
 => ([(0,18),(1,19),(2,18),(2,22),(3,19),(3,22),(4,6),(6,5),(7,11),(8,16),(9,17),(10,13),(10,14),(11,4),(12,23),(13,8),(13,23),(14,9),(14,23),(15,11),(16,15),(17,7),(17,15),(18,20),(19,21),(20,12),(20,13),(21,12),(21,14),(22,10),(22,20),(22,21),(23,16),(23,17)],24)
 => ? = 7
['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)
 => ? = 1
['B',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => ? = 8
['C',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => ? = 8
['D',5]
 => ([(0,13),(1,16),(2,15),(3,13),(3,17),(4,15),(4,16),(4,17),(6,10),(7,19),(8,19),(9,18),(10,5),(11,7),(11,18),(12,8),(12,18),(13,14),(14,7),(14,8),(15,9),(15,11),(16,9),(16,12),(17,11),(17,12),(17,14),(18,6),(18,19),(19,10)],20)
 => ? = 5
['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)
 => ? = 1

Description

The sum of the values of the Möbius function of a poset. The Möbius function

$\mu$ of a finite poset is defined as

$\mu (x,y)=\begin{cases} 1& \text{if }x = y\\ -\sum _{z: x\leq z < y}\mu (x,z)& \text{for }x < y\\ 0&\text{otherwise}. \end{cases}$ Since

$\mu(x,y)=0$ whenever

$x\not\leq y$ , this statistic is

$\sum_{x\leq y} \mu(x,y).$ If the poset has a minimal or a maximal element, then the definition implies immediately that the statistic equals

$1$ . Moreover, the statistic equals the sum of the statistics of the connected components. This statistic is also called the magnitude of a poset.

Matching statistic: St000298
(load all 2 compositions to match this statistic)

Mapping

Mp00148: Finite Cartan types —to root poset⟶ Posets
St000298: Posets ⟶ ℤResult quality: 17% ●values known / values provided: 25%●distinct values known / distinct values provided: 17%

Values

['A',2]
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => 2 = 1 + 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => 2 = 1 + 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => 2 = 1 + 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ? = 3 + 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ? = 3 + 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)
 => ? = 1 + 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)
 => ? = 5 + 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)
 => ? = 5 + 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)
 => ? = 4 + 1
['F',4]
 => ([(0,18),(1,19),(2,18),(2,22),(3,19),(3,22),(4,6),(6,5),(7,11),(8,16),(9,17),(10,13),(10,14),(11,4),(12,23),(13,8),(13,23),(14,9),(14,23),(15,11),(16,15),(17,7),(17,15),(18,20),(19,21),(20,12),(20,13),(21,12),(21,14),(22,10),(22,20),(22,21),(23,16),(23,17)],24)
 => ? = 7 + 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)
 => ? = 1 + 1
['B',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => ? = 8 + 1
['C',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => ? = 8 + 1
['D',5]
 => ([(0,13),(1,16),(2,15),(3,13),(3,17),(4,15),(4,16),(4,17),(6,10),(7,19),(8,19),(9,18),(10,5),(11,7),(11,18),(12,8),(12,18),(13,14),(14,7),(14,8),(15,9),(15,11),(16,9),(16,12),(17,11),(17,12),(17,14),(18,6),(18,19),(19,10)],20)
 => ? = 5 + 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)
 => ? = 1 + 1

Description

The order dimension or Dushnik-Miller dimension of a poset. This is the minimal number of linear orderings whose intersection is the given poset.

Matching statistic: St000633
(load all 2 compositions to match this statistic)

Mapping

Mp00148: Finite Cartan types —to root poset⟶ Posets
St000633: Posets ⟶ ℤResult quality: 17% ●values known / values provided: 25%●distinct values known / distinct values provided: 17%

Values

['A',2]
 => ([(0,2),(1,2)],3)
 => 2 = 1 + 1
['B',2]
 => ([(0,3),(1,3),(3,2)],4)
 => 2 = 1 + 1
['G',2]
 => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
 => 2 = 1 + 1
['A',3]
 => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
 => 2 = 1 + 1
['B',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ? = 3 + 1
['C',3]
 => ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
 => ? = 3 + 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)
 => ? = 1 + 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)
 => ? = 5 + 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)
 => ? = 5 + 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)
 => ? = 4 + 1
['F',4]
 => ([(0,18),(1,19),(2,18),(2,22),(3,19),(3,22),(4,6),(6,5),(7,11),(8,16),(9,17),(10,13),(10,14),(11,4),(12,23),(13,8),(13,23),(14,9),(14,23),(15,11),(16,15),(17,7),(17,15),(18,20),(19,21),(20,12),(20,13),(21,12),(21,14),(22,10),(22,20),(22,21),(23,16),(23,17)],24)
 => ? = 7 + 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)
 => ? = 1 + 1
['B',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => ? = 8 + 1
['C',5]
 => ([(0,18),(1,17),(2,18),(2,24),(3,23),(3,24),(4,17),(4,23),(6,15),(7,16),(8,9),(9,5),(10,12),(11,13),(12,11),(13,14),(14,9),(15,7),(15,21),(16,8),(16,14),(17,10),(18,6),(18,19),(19,15),(19,22),(20,12),(20,22),(21,13),(21,16),(22,11),(22,21),(23,10),(23,20),(24,19),(24,20)],25)
 => ? = 8 + 1
['D',5]
 => ([(0,13),(1,16),(2,15),(3,13),(3,17),(4,15),(4,16),(4,17),(6,10),(7,19),(8,19),(9,18),(10,5),(11,7),(11,18),(12,8),(12,18),(13,14),(14,7),(14,8),(15,9),(15,11),(16,9),(16,12),(17,11),(17,12),(17,14),(18,6),(18,19),(19,10)],20)
 => ? = 5 + 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)
 => ? = 1 + 1

Description

The size of the automorphism group of a poset. A poset automorphism is a permutation of the elements of the poset preserving the order relation.

The following 357 statistics, ordered by result quality, also match your data. Click on any of them to see the details.

St000642The size of the smallest orbit of antichains under Panyushev complementation. St000846The maximal number of elements covering an element of a poset. St001301The first Betti number of the order complex associated with the poset. St001399The distinguishing number of a poset. St001534The alternating sum of the coefficients of the Poincare polynomial of the poset cone. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St000310The minimal degree of a vertex of a graph. St000363The number of minimal vertex covers of a graph. St000535The rank-width of a graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000785The number of distinct colouring schemes of a graph. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001071The beta invariant of the graph. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001282The number of graphs with the same chromatic polynomial. St001316The domatic number of a graph. St001333The cardinality of a minimal edge-isolating set of a graph. St001393The induced matching number of a graph. St001395The number of strictly unfriendly partitions of a graph. St001496The number of graphs with the same Laplacian spectrum as the given graph. St001518The number of graphs with the same ordinary spectrum as the given graph. St001657The number of twos in an integer partition. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001743The discrepancy of a graph. St001774The degree of the minimal polynomial of the smallest eigenvalue of a graph. St001933The largest multiplicity of a part in an integer partition. St000095The number of triangles of a graph. St000096The number of spanning trees of a graph. St000268The number of strongly connected orientations of a graph. St000274The number of perfect matchings of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. 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. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by

$4$ . St000311The number of vertices of odd degree in a graph. St000315The number of isolated vertices of a graph. St000322The skewness of a graph. St000323The minimal crossing number of a graph. St000344The number of strongly connected outdegree sequences of a graph. St000351The determinant of the adjacency matrix of a graph. St000368The Altshuler-Steinberg determinant of a graph. St000370The genus of a graph. St000379The number of Hamiltonian cycles in a graph. St000447The number of pairs of vertices of a graph with distance 3. St000449The number of pairs of vertices of a graph with distance 4. St000552The number of cut vertices of a graph. St000671The maximin edge-connectivity for choosing a subgraph. St000699The toughness times the least common multiple of 1,. St000845The maximal number of elements covered by an element in a poset. St000948The chromatic discriminant of a graph. St001029The size of the core of a graph. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001073The number of nowhere zero 3-flows of a graph. St001109The number of proper colourings of a graph with as few colours as possible. St001111The weak 2-dynamic chromatic number of a graph. St001119The length of a shortest maximal path in a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001271The competition number of a graph. St001281The normalized isoperimetric number of a graph. 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. St001307The number of induced stars on four vertices in a graph. St001309The number of four-cliques in a graph. St001310The number of induced diamond graphs in a graph. St001323The independence gap of a graph. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001341The number of edges in the center of a graph. St001352The number of internal nodes in the modular decomposition of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001367The smallest number which does not occur as degree of a vertex in a graph. St001368The number of vertices of maximal degree in a graph. St001477The number of nowhere zero 5-flows of a graph. St001478The number of nowhere zero 4-flows of a graph. St001494The Alon-Tarsi number of a graph. St001510The number of self-evacuating linear extensions of a finite poset. St001561The value of the elementary symmetric function evaluated at 1. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001578The minimal number of edges to add or remove to make a graph a line graph. St001586The number of odd parts smaller than the largest even part in an integer partition. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001618The cardinality of the Frattini sublattice of a lattice. St001624The breadth of a lattice. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. 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. St001692The number of vertices with higher degree than the average degree in a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001716The 1-improper chromatic number of a graph. St001783The number of odd automorphisms of a graph. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001793The difference between the clique number and the chromatic number of a graph. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St001795The binary logarithm of the evaluation of the Tutte polynomial of the graph at (x,y) equal to (-1,-1). St001796The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1). St001797The number of overfull subgraphs of a graph. St001845The number of join irreducibles minus the rank of a lattice. St001871The number of triconnected components of a graph. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001108The 2-dynamic chromatic number of a graph. St000068The number of minimal elements in a poset. St000181The number of connected components of the Hasse diagram for the poset. St000260The radius of a connected graph. St000266The number of spanning subgraphs of a graph with the same connected components. St000267The number of maximal spanning forests contained in a graph. St000272The treewidth of a graph. St000273The domination number of a graph. St000450The number of edges minus the number of vertices plus 2 of a graph. St000456The monochromatic index of a connected graph. St000482The (zero)-forcing number of a graph. St000536The pathwidth of a graph. St000537The cutwidth of a graph. St000544The cop number of a graph. St000553The number of blocks of a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000741The Colin de Verdière graph invariant. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000778The metric dimension of a graph. St000916The packing number of a graph. St000917The open packing number of a graph. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path)

$[c_0,c_1,...,c_{n−1}]$ by adding

$c_0$ to

$c_{n−1}$ . St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. 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. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001270The bandwidth of a graph. St001272The number of graphs with the same degree sequence. St001277The degeneracy of a graph. St001322The size of a minimal independent dominating set in a graph. St001335The cardinality of a minimal cycle-isolating set of a graph. St001339The irredundance number of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001342The number of vertices in the center of a graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001354The number of series nodes in the modular decomposition of a graph. St001358The largest degree of a regular subgraph of a graph. St001363The Euler characteristic of a graph according to Knill. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001481The minimal height of a peak of a Dyck path. St001512The minimum rank of a graph. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001546The number of monomials in the Tutte polynomial of a graph. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001587Half of the largest even part of an integer partition. St001592The maximal number of simple paths between any two different vertices of a graph. St001613The binary logarithm of the size of the center of a lattice. St001621The number of atoms of a lattice. St001644The dimension of a graph. St001672The restrained domination number of a graph. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001689The number of celebrities in a graph. St001691The number of kings in a graph. St001694The number of maximal dissociation sets in a graph. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001739The number of graphs with the same edge polytope as the given graph. St001775The degree of the minimal polynomial of the largest eigenvalue of a graph. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001792The arboricity of a graph. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001826The maximal number of leaves on a vertex of a graph. St001828The Euler characteristic of a graph. St001829The common independence number of a graph. St001881The number of factors of a lattice as a Cartesian product of lattices. St001890The maximum magnitude of the Möbius function of a poset. St001949The rigidity index of a graph. St001962The proper pathwidth of a graph. St000090The variation of a composition. St000093The cardinality of a maximal independent set of vertices of a graph. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. 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. St000244The cardinality of the automorphism group of a graph. St000258The burning number of a graph. St000259The diameter of a connected graph. St000299The number of nonisomorphic vertex-induced subtrees. St000312The number of leaves in a graph. St000335The difference of lower and upper interactions. St000364The exponent of the automorphism group of a graph. St000388The number of orbits of vertices of a graph under automorphisms. St000403The Szeged index minus the Wiener index of a graph. St000448The number of pairs of vertices of a graph with distance 2. St000453The number of distinct Laplacian eigenvalues of a graph. St000455The second largest eigenvalue of a graph if it is integral. St000469The distinguishing number of a graph. St000508Eigenvalues of the random-to-random operator acting on a simple module. St000636The hull number of a graph. St000637The length of the longest cycle in a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000822The Hadwiger number of the graph. St000918The 2-limited packing number of a graph. St000951The dimension of

$Ext^{1}(D(A),A)$ of the corresponding LNakayama algebra. St000955Number of times one has

$Ext^i(D(A),A)>0$ for

$i>0$ for the corresponding LNakayama algebra. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001057The Grundy value of the game of creating an independent set in a graph. St001060The distinguishing index of a graph. St001093The detour number of a graph. St001095The number of non-isomorphic posets with precisely one further covering relation. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001195The global dimension of the algebra

$A/AfA$ of the corresponding Nakayama algebra

$A$ with minimal left faithful projective-injective module

$Af$ . 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$ . St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. 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. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001305The number of induced cycles on four vertices in a graph. St001306The number of induced paths on four vertices in a graph. St001308The number of induced paths on three vertices in a graph. St001311The cyclomatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001320The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001327The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. St001330The hat guessing number of a graph. St001331The size of the minimal feedback vertex set. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001350Half of the Albertson index of a graph. St001351The Albertson index of a graph. St001353The number of prime nodes in the modular decomposition of a graph. St001356The number of vertices in prime modules of a graph. St001374The Padmakar-Ivan index of a graph. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001396Number of triples of incomparable elements in a finite poset. St001459The number of zero columns in the nullspace of a graph. St001479The number of bridges of a graph. St001545The second Elser number of a connected graph. St001570The minimal number of edges to add to make a graph Hamiltonian. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001577The minimal number of edges to add or remove to make a graph a cograph. St001580The acyclic chromatic number of a graph. St001593This is the number of standard Young tableaux of the given shifted shape. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001638The book thickness of a graph. St001642The Prague dimension of a graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. 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. St001734The lettericity of a graph. St001736The total number of cycles in a graph. St001764The number of non-convex subsets of vertices in a graph. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001883The mutual visibility number of a graph. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St001957The number of Hasse diagrams with a given underlying undirected graph. St000264The girth of a graph, which is not a tree. St000452The number of distinct eigenvalues of a graph. St001112The 3-weak dynamic number of a graph. St001200The number of simple modules in

$eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra

$A$ with minimal faithful projective-injective module

$eA$ . St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001110The 3-dynamic chromatic number of a graph. St001248Sum of the even parts of a partition. St000160The multiplicity of the smallest part of a partition. St000454The largest eigenvalue of a graph if it is integral. St000460The hook length of the last cell along the main diagonal of an integer partition. St000481The number of upper covers of a partition in dominance order. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St000706The product of the factorials of the multiplicities of an integer partition. St000759The smallest missing part in an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St000897The number of different multiplicities of parts of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001568The smallest positive integer that does not appear twice in the partition. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St000143The largest repeated part of a partition. St000146The Andrews-Garvan crank of a partition. St000159The number of distinct parts of the integer partition. St000185The weighted size of a partition. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000307The number of rowmotion orbits of a poset. St000346The number of coarsenings of a partition. St000422The energy of a graph, if it is integral. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000475The number of parts equal to 1 in a partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000783The side length of the largest staircase partition fitting into a partition. St000810The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to monomial symmetric functions. St000811The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to Schur symmetric functions. St000929The constant term of the character polynomial of an integer partition. St001091The number of parts in an integer partition whose next smaller part has the same size. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001214The aft of an integer partition. St001432The order dimension of the partition. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000548The number of different non-empty partial sums of an integer partition. St000814The sum of the entries in the column specified by the partition of the change of basis matrix from elementary symmetric functions to Schur symmetric functions. St000511The number of invariant subsets when acting with a permutation of given cycle type. St000225Difference between largest and smallest parts in a partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000480The number of lower covers of a partition in dominance order. St000667The greatest common divisor of the parts of the partition. St000913The number of ways to refine the partition into singletons. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001571The Cartan determinant of the integer partition. St001722The number of minimal chains with small intervals between a binary word and the top element. St001820The size of the image of the pop stack sorting operator. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000256The number of parts from which one can substract 2 and still get an integer partition. St000477The weight of a partition according to Alladi. 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. St000668The least common multiple of the parts of the partition. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. 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. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000995The largest even part of an integer partition. St001128The exponens consonantiae of a partition. St001703The villainy of a graph. St001720The minimal length of a chain of small intervals in a lattice. St001846The number of elements which do not have a complement in the lattice. St000321The number of integer partitions of n that are dominated by an integer partition. St000345The number of refinements of a partition. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St001834The number of non-isomorphic minors of a graph.