Identifier
Values
0 => ([(0,1)],2) => [2] => 1
1 => ([(0,1)],2) => [2] => 1
00 => ([(0,2),(2,1)],3) => [3] => 2
01 => ([(0,1),(0,2),(1,3),(2,3)],4) => [3,1] => 1
10 => ([(0,1),(0,2),(1,3),(2,3)],4) => [3,1] => 1
11 => ([(0,2),(2,1)],3) => [3] => 2
000 => ([(0,3),(2,1),(3,2)],4) => [4] => 3
001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => [4,2] => 2
010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => [4,2] => 2
011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => [4,2] => 2
100 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => [4,2] => 2
101 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6) => [4,2] => 2
110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6) => [4,2] => 2
111 => ([(0,3),(2,1),(3,2)],4) => [4] => 3
0000 => ([(0,4),(2,3),(3,1),(4,2)],5) => [5] => 4
0001 => ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8) => [5,3] => 3
0010 => ([(0,2),(0,3),(1,6),(2,7),(2,8),(3,1),(3,7),(3,8),(5,4),(6,4),(7,5),(8,5),(8,6)],9) => [5,3,1] => 2
0011 => ([(0,3),(0,4),(1,7),(2,6),(3,2),(3,5),(4,1),(4,5),(5,6),(5,7),(6,8),(7,8)],9) => [5,3,1] => 2
0100 => ([(0,2),(0,3),(1,6),(2,7),(2,8),(3,1),(3,7),(3,8),(5,4),(6,4),(7,5),(8,5),(8,6)],9) => [5,3,1] => 2
0101 => ([(0,1),(0,2),(1,6),(1,7),(2,6),(2,7),(4,3),(5,3),(6,4),(6,5),(7,4),(7,5)],8) => [5,3] => 3
0110 => ([(0,2),(0,3),(1,5),(1,6),(2,7),(2,8),(3,1),(3,7),(3,8),(5,4),(6,4),(7,6),(8,5)],9) => [5,3,1] => 2
0111 => ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8) => [5,3] => 3
1000 => ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8) => [5,3] => 3
1001 => ([(0,2),(0,3),(1,5),(1,6),(2,7),(2,8),(3,1),(3,7),(3,8),(5,4),(6,4),(7,6),(8,5)],9) => [5,3,1] => 2
1010 => ([(0,1),(0,2),(1,6),(1,7),(2,6),(2,7),(4,3),(5,3),(6,4),(6,5),(7,4),(7,5)],8) => [5,3] => 3
1011 => ([(0,2),(0,3),(1,6),(2,7),(2,8),(3,1),(3,7),(3,8),(5,4),(6,4),(7,5),(8,5),(8,6)],9) => [5,3,1] => 2
1100 => ([(0,3),(0,4),(1,7),(2,6),(3,2),(3,5),(4,1),(4,5),(5,6),(5,7),(6,8),(7,8)],9) => [5,3,1] => 2
1101 => ([(0,2),(0,3),(1,6),(2,7),(2,8),(3,1),(3,7),(3,8),(5,4),(6,4),(7,5),(8,5),(8,6)],9) => [5,3,1] => 2
1110 => ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8) => [5,3] => 3
1111 => ([(0,4),(2,3),(3,1),(4,2)],5) => [5] => 4
00000 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => [6] => 5
00001 => ([(0,2),(0,5),(1,7),(2,6),(3,4),(3,9),(4,1),(4,8),(5,3),(5,6),(6,9),(8,7),(9,8)],10) => [6,4] => 4
01010 => ([(0,1),(0,2),(1,8),(1,9),(2,8),(2,9),(4,3),(5,3),(6,4),(6,5),(7,4),(7,5),(8,6),(8,7),(9,6),(9,7)],10) => [6,4] => 4
01111 => ([(0,2),(0,5),(1,7),(2,6),(3,4),(3,9),(4,1),(4,8),(5,3),(5,6),(6,9),(8,7),(9,8)],10) => [6,4] => 4
10000 => ([(0,2),(0,5),(1,7),(2,6),(3,4),(3,9),(4,1),(4,8),(5,3),(5,6),(6,9),(8,7),(9,8)],10) => [6,4] => 4
10101 => ([(0,1),(0,2),(1,8),(1,9),(2,8),(2,9),(4,3),(5,3),(6,4),(6,5),(7,4),(7,5),(8,6),(8,7),(9,6),(9,7)],10) => [6,4] => 4
11110 => ([(0,2),(0,5),(1,7),(2,6),(3,4),(3,9),(4,1),(4,8),(5,3),(5,6),(6,9),(8,7),(9,8)],10) => [6,4] => 4
11111 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6) => [6] => 5
000000 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => [7] => 6
111111 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7) => [7] => 6
0000000 => ([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8) => [8] => 7
1111111 => ([(0,7),(2,4),(3,2),(4,6),(5,3),(6,1),(7,5)],8) => [8] => 7
00000000 => ([(0,8),(2,3),(3,5),(4,2),(5,7),(6,4),(7,1),(8,6)],9) => [9] => 8
11111111 => ([(0,8),(2,3),(3,5),(4,2),(5,7),(6,4),(7,1),(8,6)],9) => [9] => 8
000000000 => ([(0,9),(2,4),(3,2),(4,6),(5,3),(6,8),(7,5),(8,1),(9,7)],10) => [10] => 9
111111111 => ([(0,9),(2,4),(3,2),(4,6),(5,3),(6,8),(7,5),(8,1),(9,7)],10) => [10] => 9
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 Dyson rank of a partition.
This rank is defined as the largest part minus the number of parts. It was introduced by Dyson [1] in connection to Ramanujan's partition congruences $$p(5n+4) \equiv 0 \pmod 5$$ and $$p(7n+6) \equiv 0 \pmod 7.$$
Map
poset of factors
Description
The poset of factors of a binary word.
This is the partial order on the set of distinct factors of a binary word, such that $u < v$ if and only if $u$ is a factor of $v$.
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.