The Erdos and Campbell-Staton conjectures about square packing

Simple item page
dc.creatorPraton, Iwan
dc.date2005-04-16
dc.date.accessioned2026-07-07T05:19:10Z
dc.date.available2026-07-07T05:19:10Z
dc.descriptionPut n open non-overlapping squares inside a unit square, and let f(n) denote the maximum possible value of the sum of the side lengths of the n squares. Campbell and Staton, building on a question of Erdos, conjectured that f(k^2+2c+1)=k+c/k, where c is any integer and k\geq |c|. We show that if this conjecture is true for one value of c, then it is true for all values of c.
dc.description2 pages
dc.identifierhttps://arxiv.org/abs/math/0504341
dc.identifierhttp://arxiv.org/abs/math/0504341
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74923
dc.subjectMetric Geometry
dc.subject51M04
dc.titleThe Erdos and Campbell-Staton conjectures about square packing
dc.typetext

Files

Collections

arXiv