Identifier
Values
['A',1] => ([],1) => [1] => [1,0,1,0] => 2
['A',2] => ([(0,2),(1,2)],3) => [2,1] => [1,0,1,0,1,0] => 2
['B',2] => ([(0,3),(1,3),(3,2)],4) => [3,1] => [1,1,0,1,0,0,1,0] => 3
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => [5,1] => [1,1,1,1,0,1,0,0,0,0,1,0] => 5
['A',3] => ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6) => [3,2,1] => [1,0,1,0,1,0,1,0] => 2
['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] => [1,1,1,0,1,0,0,1,0,0,1,0] => 4
['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] => [1,1,1,0,1,0,0,1,0,0,1,0] => 4
['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] => [1,0,1,0,1,0,1,0,1,0] => 2
['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] => [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0] => 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] => [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0] => 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] => [1,1,0,1,0,0,1,1,0,0,1,0] => 3
['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] => [1,0,1,0,1,0,1,0,1,0,1,0] => 2
['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] => [1,1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0] => 6
['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] => [1,1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0] => 6
['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] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => 2
['B',6] => ([(0,23),(1,22),(2,23),(2,34),(3,33),(3,34),(4,33),(4,35),(5,22),(5,35),(7,20),(8,19),(9,21),(10,11),(11,6),(12,16),(13,15),(14,13),(15,17),(16,14),(17,18),(18,11),(19,9),(19,27),(20,8),(20,28),(21,10),(21,18),(22,12),(23,7),(23,24),(24,20),(24,32),(25,16),(25,31),(26,31),(26,32),(27,17),(27,21),(28,19),(28,29),(29,15),(29,27),(30,13),(30,29),(31,14),(31,30),(32,28),(32,30),(33,25),(33,26),(34,24),(34,26),(35,12),(35,25)],36) => [11,9,7,5,3,1] => [1,1,1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0] => 7
['C',6] => ([(0,23),(1,22),(2,23),(2,34),(3,33),(3,34),(4,33),(4,35),(5,22),(5,35),(7,20),(8,19),(9,21),(10,11),(11,6),(12,16),(13,15),(14,13),(15,17),(16,14),(17,18),(18,11),(19,9),(19,27),(20,8),(20,28),(21,10),(21,18),(22,12),(23,7),(23,24),(24,20),(24,32),(25,16),(25,31),(26,31),(26,32),(27,17),(27,21),(28,19),(28,29),(29,15),(29,27),(30,13),(30,29),(31,14),(31,30),(32,28),(32,30),(33,25),(33,26),(34,24),(34,26),(35,12),(35,25)],36) => [11,9,7,5,3,1] => [1,1,1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0] => 7
search for individual values
searching the database for the individual values of this statistic
/ search for generating function
searching the database for statistics with the same generating function
click to show known generating functions       
Description
The position of the first down step of a Dyck path.
Map
Greene-Kleitman invariant
Description
The Greene-Kleitman invariant of a poset.
This is the partition $(c_1 - c_0, c_2 - c_1, c_3 - c_2, \ldots)$, where $c_k$ is the maximum cardinality of a union of $k$ chains of the poset. Equivalently, this is the conjugate of the partition $(a_1 - a_0, a_2 - a_1, a_3 - a_2, \ldots)$, where $a_k$ is the maximum cardinality of a union of $k$ antichains of the poset.
Map
to root poset
Description
The root poset of a finite Cartan type.
This is the poset on the set of positive roots of its root system where $\alpha \prec \beta$ if $\beta - \alpha$ is a simple root.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.