Packing Ferrers Shapes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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).$
7 pages, 4 figures

Keywords

Combinatorics, 05B45, 05A17

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/77839

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9812075
 http://arxiv.org/abs/math/9812075

Collections

arXiv