### Abstract

Answering a question of Wilf, we show that, if n is sufficiently large, then one cannot cover an n x 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).

Original language | English (US) |
---|---|

Pages (from-to) | 205-211 |

Number of pages | 7 |

Journal | Combinatorics Probability and Computing |

Volume | 9 |

Issue number | 3 |

State | Published - 2000 |

### Fingerprint

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Mathematics(all)
- Discrete Mathematics and Combinatorics
- Statistics and Probability
- Theoretical Computer Science

### Cite this

*Combinatorics Probability and Computing*,

*9*(3), 205-211.

**Packing Ferrers Shapes.** / Alon, Noga; Bóna, Miklós; Spencer, Joel.

Research output: Contribution to journal › Article

*Combinatorics Probability and Computing*, vol. 9, no. 3, pp. 205-211.

}

TY - JOUR

T1 - Packing Ferrers Shapes

AU - Alon, Noga

AU - Bóna, Miklós

AU - Spencer, Joel

PY - 2000

Y1 - 2000

N2 - Answering a question of Wilf, we show that, if n is sufficiently large, then one cannot cover an n x 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).

AB - Answering a question of Wilf, we show that, if n is sufficiently large, then one cannot cover an n x 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).

UR - http://www.scopus.com/inward/record.url?scp=0442311731&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0442311731&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0442311731

VL - 9

SP - 205

EP - 211

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

SN - 0963-5483

IS - 3

ER -