Packing Ferrers Shapes

DOI10.1017/S0963548300004223MaRDI QIDQ4500419zbMATH OpenFDO

Authors Noga Alon, Miklós Bóna, Joel Spencer

Publication date 12 February 2001

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9812075

zbMATH Keywords

Ferrers diagramFerrers shapeinteger partitiontiling a rectangle

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of packing and covering (05B40) Combinatorial aspects of tessellation and tiling problems (05B45)

Abstract: Answering a question of Wilf, we show that if $n$ is sufficiently large, then one cannot cover an $nimesp(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 $Theta(p(n)/logn).$

Recommendations

• Cell patterns in integer partitions
• Counting corners in partitions
• Some properties on partitions of positive integer
• Zwei Extreme in der Zinnchemie: Ein nichtbindender Sn–Sn‐Abstand von 285 pm und eine ¹¹⁹ Sn‐NMR‐Verschiebung δ = 3301 in metallorganischen Derivaten von Sn(0)
• Enumeration of generalized hook partitions

Cited in

(1)

• Cell patterns in integer partitions

This page was built for publication: Packing Ferrers Shapes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500419)