pith. the verified trust layer for science. sign in

arxiv: 0710.2357 · v1 · submitted 2007-10-12 · 🧮 math.HO · math-ph· math.CO· math.MP

Overhang

classification 🧮 math.HO math-phmath.COmath.MP
keywords overhangsolutionachieveachievesbelievedblockblocksclassical
0
0 comments X p. Extension
read the original abstract

How far off the edge of the table can we reach by stacking $n$ identical, homogeneous, frictionless blocks of length 1? A classical solution achieves an overhang of $1/2 H_n$, where $H_n ~ \ln n$ is the $n$th 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 $n$-block stacks that achieve an overhang of $c n^{1/3}$, for some constant $c>0$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.