PERFECT PACKING OF SQUARES

DOI10.59277/MRAR.2023.25.75.2.221MaRDI QIDQ6125583zbMATH OpenOpenAlexFDO

Authors Antal Joós

Publication date 11 April 2024

Published in Mathematical Reports (Search for Journal in Brave)

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

zbMATH Keywords

packingrectanglesquare

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Abstract: It is known that $sumlimit{s}_{i=1}^{i}nfty1/i^2=p{i}^2/6$. Meir and Moser asked what is the smallest $epsilon$ such that all the squares of sides of length $1$, $1/2$, $1/3$, $ldots$ can be packed into a rectangle of area $p{i}^2/6+epsilon$. A packing into a rectangle of the right area is called perfect packing. Chalcraft packed the squares of sides of length $1$, $2^{-t}$, $3^{-t}$, $ldots$ and he found perfect packing for $1/2<tle3/5$. We will show based on an algorithm by Chalcraft that there are perfect packings if $1/2<tle2/3$. Moreover we show that there is a perfect packing for all $t$ in the range $lo{g}_{3}2letle2/3$.

Recommendations

• Perfectly packing a square by squares of nearly harmonic sidelength
• A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\)
• Perfect square packings
• Perfect packings of squares using the stack-pack strategy
• A note on perfect packing of squares and cubes

Cited in

(5)

• Perfectly packing a square by squares of nearly harmonic sidelength
• Perfect packing by convex and concave polygons
• Perfectly packing an equilateral triangle by equilateral triangles of sidelengths \(n^{-1/2-\epsilon }\)
• Packing isosceles right triangles of legs of harmonic lengths
• Slack-pack algorithm for Meir-Moser packing problem

This page was built for publication: PERFECT PACKING OF SQUARES

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