论文信息 - Packing Ferrers Shapes

Packing Ferrers Shapes

Answering a question of Wilf, we show that, if n is sufficiently large, then one cannot cover an n × p(n) rectangle using each of the p(n) distinct Ferrers shapes of size n exactly once. Moreover, the maximum number of pairwise distinct, non-overlapping Ferrers shapes that can be packed in such a rectangle is only Θ(p(n)/log n):

Noga Alon | Joel H. Spencer | Miklós Bóna

[1] P. Erdös,et al. The distribution of the number of summands in the partitions of a positive integer , 1941 .

[2] P. Turán,et al. On some problems of the statistical theory of partitions with application to characters of the symmetric group. II , 1977 .

[3] N. S. Barnett,et al. Private communication , 1969 .

[4] P. Turán,et al. On some problems of the statistical theory of partitions with application to characters of the symmetric group. III , 1978 .

[5] Boris Pittel,et al. On a Likely Shape of the Random Ferrers Diagram , 1997 .

[6] G. Andrews. The Theory of Partitions: Frontmatter , 1976 .

[7] M. Szalay,et al. On some problems of the statistical theory of partitions with application to characters of the symmetric group. I , 1977 .

[8] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .