English

Overhang

History and Overview 2007-10-15 v1 Mathematical Physics Combinatorics math.MP

Abstract

How far off the edge of the table can we reach by stacking nn identical, homogeneous, frictionless blocks of length 1? A classical solution achieves an overhang of 1/2Hn1/2 H_n, where Hn lnnH_n ~ \ln n is the nnth harmonic number. This solution is widely believed to be optimal. We show, however, that it is, in fact, exponentially far from optimality by constructing simple nn-block stacks that achieve an overhang of cn1/3c n^{1/3}, for some constant c>0c>0.

Cite

@article{arxiv.0710.2357,
  title  = {Overhang},
  author = {Mike Paterson and Uri Zwick},
  journal= {arXiv preprint arXiv:0710.2357},
  year   = {2007}
}

Comments

27 pages, 24 figures. To appear in American Mathematical Monthly

R2 v1 2026-06-21T09:30:45.614Z