Name
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$. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.4169/193009709X469797 | The American Mathematical Monthly |
DocType | Volume | Issue |
Journal | 116 | 1 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mike Paterson | 1 | 189 | 15.84 |
| Uri Zwick | 2 | 3586 | 257.02 |