Identifier
Values
[1] => [1] => 10 => [1,2] => 1
[2] => [1,1] => 110 => [1,1,2] => 1
[1,1] => [2] => 100 => [1,3] => 1
[3] => [3] => 1000 => [1,4] => 1
[2,1] => [1,1,1] => 1110 => [1,1,1,2] => 1
[1,1,1] => [2,1] => 1010 => [1,2,2] => 1
[4] => [2,2] => 1100 => [1,1,3] => 1
[3,1] => [3,1] => 10010 => [1,3,2] => 1
[2,2] => [1,1,1,1] => 11110 => [1,1,1,1,2] => 1
[2,1,1] => [2,1,1] => 10110 => [1,2,1,2] => 1
[1,1,1,1] => [4] => 10000 => [1,5] => 1
[4,1] => [2,2,1] => 11010 => [1,1,2,2] => 1
[3,1,1] => [3,2] => 10100 => [1,2,3] => 1
[6] => [3,3] => 11000 => [1,1,4] => 1
[4,1,1] => [2,2,2] => 11100 => [1,1,1,3] => 1
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
Description
The dominant dimension of the corresponding Comp-Nakayama algebra.
Map
to binary word
Description
Return the partition as binary word, by traversing its shape from the first row to the last row, down steps as 1 and left steps as 0.
Map
Glaisher-Franklin
Description
The Glaisher-Franklin bijection on integer partitions.
This map sends the set of even part sizes, each divided by two, to the set of repeated part sizes, see [1, 3.3.1].
Map
to composition
Description
The composition corresponding to a binary word.
Prepending $1$ to a binary word $w$, the $i$-th part of the composition equals $1$ plus the number of zeros after the $i$-th $1$ in $w$.
This map is not surjective, since the empty composition does not have a preimage.