Packing Ferrers Shapes
| dc.creator | Alon, Noga | |
| dc.creator | Bóna, Miklós | |
| dc.creator | Spencer, Joel | |
| dc.date | 1998-12-11 | |
| dc.date.accessioned | 2026-07-07T05:27:13Z | |
| dc.date.available | 2026-07-07T05:27:13Z | |
| dc.description | Answering a question of Wilf, we show that if $n$ is sufficiently large, then one cannot cover an $n \times 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).$ | |
| dc.description | 7 pages, 4 figures | |
| dc.identifier | https://arxiv.org/abs/math/9812075 | |
| dc.identifier | http://arxiv.org/abs/math/9812075 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/77839 | |
| dc.subject | Combinatorics | |
| dc.subject | 05B45, 05A17 | |
| dc.title | Packing Ferrers Shapes | |
| dc.type | text |