Slack-Pack algorithm for Meir-Moser packing problem

2024/12/22 by A. D. Kislovskiy, Kislovskiy, A. D., É. Yu. Lerner +3
Engineering · #52C15 #Advanced Manufacturing and Logistics Optimization #Combinatorics (math.CO) #FOS: Mathematics #Optimization and Packing Problems #VLSI and FPGA Design Techniques

paper · pdf · doi:10.48550/arxiv.2412.17151

openalex publication_date 2024/12/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The well-known problem stated by A. Meir and L. Moser consists in tiling the unit square with rectangles (details), whose side lengths equal 1/n× 1/(n+1), where indices~n range from 1 to infinity. Recently, Terence Tao has proved that it is possible to tile with 1/n^t× 1/(n+1)^t rectangles (squares with the side length of 1/n^t), 1/2

Related

• Reducing Moser's Square Packing Problem to a Bounded Number of Squares
• On Greedily Packing Anchored Rectangles
• Compactness Theorems for Geometric Packings
• Square packing with O(x^0.6) wasted area
• Perfect packing of squares