Perfect square packings
type: Item
instance of: scholarly article
title: Perfect square packings
zbMATH Open document ID: 0977.52023
author: Adam Chalcraft
published in: Journal of Combinatorial Theory. Series A
publication date: 2002-01-09T00:00:00Z
review text: A packing of all squares of side \(n^{-t}\) (\(n \geq 1\) an integer, \(t>1/2\) fixed) is called perfect if it fits into the square of area \(\sum_{n=1}^{\infty} n^{-2t}\). The author considers an algorithm for the construction of perfect packings for \(1/2<t \leq 3/5\). A part of the proof is computer-generated but successfully implemented for all values of \(t\) the author has tried.
Mathematics Subject Classification ID: 52C15
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 1569471
zbMATH Keywords: square packing
reviewed by: Peter Boyvalenkov
MaRDI profile type: Publication
full work available at URL: jcta.2000.3058
OpenAlex ID: W2032640868
cites work: On packing unequal squares
cites work: Unsolved problems in geometry
cites work: On packing of squares and cubes
cites work: An algorithm for packing squares
DOI: 10.1006/JCTA.2000.3058
description: scientific article; zbMATH DE number 1569471