Saved in:
Bibliographic Details
Main Author: Bui, Hong Duc
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2504.09489
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913791413846016
author Bui, Hong Duc
author_facet Bui, Hong Duc
contents We consider the problem of packing a large square with nonoverlapping unit squares. Let $W(x)$ be the minimum wasted area when a large square of side length $x$ is packed with unit squares. In Roth and Vaughan's paper that proves the lower bound $W(x) \notin o(x^{1/2})$, a good square is defined to be a square with inclination at most $10^{-10}$ with respect to the large square. In this article, we prove that in calculating the asymptotic growth of the wasted space, it suffices to only consider packings with only good squares. This allows the lower bound proof in Roth and Vaughan's paper to be simplified by not having to handle bad squares.
format Preprint
id arxiv_https___arxiv_org_abs_2504_09489
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Square Packing with Asymptotically Smallest Waste Only Needs Good Squares
Bui, Hong Duc
Computational Geometry
We consider the problem of packing a large square with nonoverlapping unit squares. Let $W(x)$ be the minimum wasted area when a large square of side length $x$ is packed with unit squares. In Roth and Vaughan's paper that proves the lower bound $W(x) \notin o(x^{1/2})$, a good square is defined to be a square with inclination at most $10^{-10}$ with respect to the large square. In this article, we prove that in calculating the asymptotic growth of the wasted space, it suffices to only consider packings with only good squares. This allows the lower bound proof in Roth and Vaughan's paper to be simplified by not having to handle bad squares.
title Square Packing with Asymptotically Smallest Waste Only Needs Good Squares
topic Computational Geometry
url https://arxiv.org/abs/2504.09489