Maximum overhang

Simple item page
dc.creatorPaterson, Mike
dc.creatorPeres, Yuval
dc.creatorThorup, Mikkel
dc.creatorWinkler, Peter
dc.creatorZwick, Uri
dc.date2007-07-01
dc.date.accessioned2026-07-07T08:13:26Z
dc.date.available2026-07-07T08:13:26Z
dc.descriptionHow far can a stack of $n$ identical blocks be made to hang over the edge of a table? The question dates back to at least the middle of the 19th century and the answer to it was widely believed to be of order $\log n$. Recently, Paterson and Zwick constructed $n$-block stacks with overhangs of order $n^{1/3}$, exponentially better than previously thought possible. We show here that order $n^{1/3}$ is indeed best possible, resolving the long-standing overhang problem up to a constant factor.
dc.description20 pages, 8 figures
dc.identifierhttps://arxiv.org/abs/0707.0093
dc.identifierhttp://arxiv.org/abs/0707.0093
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132770
dc.subjectHistory and Overview
dc.subjectMathematical Physics
dc.subjectCombinatorics
dc.titleMaximum overhang
dc.typetext

Files

Collections

arXiv