### Abstract

The following problem arises in connection with certain multidimensional stock cutting problems:. How many nonoverlapping open unit squares may be packed into a large square of side α? Of course, if α is a positive integer, it is trivial to see that α^{2} unit squares can be succesfully packed. However, if α is not an integer, the problem becomes much more complicated. Intuitively, one feels that for α = N + ( 1 100), say (where N is an integer), one should pack N^{2} unit squares in the obvious way and surrender the uncovered border area (which is about α 50) as unusable waste. After all, how could it help to place the unit squares at all sorts of various skew angles? In this note, we show how it helps. In particular, we prove that we can always keep the amount of uncovered area down to at most proportional to α^{ 7 11}, which for large α is much less than the linear waste produced by the "natural" packing above.

Original language | English |
---|---|

Pages (from-to) | 119-123 |

Number of pages | 5 |

Journal | Journal of Combinatorial Theory, Series A |

Volume | 19 |

Issue number | 1 |

DOIs | |

Publication status | Published - Jul 1975 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics

## Fingerprint Dive into the research topics of 'On packing squares with equal squares'. Together they form a unique fingerprint.

## Cite this

*Journal of Combinatorial Theory, Series A*,

*19*(1), 119-123. https://doi.org/10.1016/0097-3165(75)90099-0