Maximum Overhang

DMCA

Maximum Overhang (2007)

Cached

Other Repositories/Bibliography

DBLP

Save to List
Add to Collection
Correct Errors
Monitor Changes

by Mike Paterson , Yuval Peres , Mikkel Thorup , Peter Winkler , Uri Zwick

Citations:

1 - 1 self

BibTeX

@MISC{Paterson07maximumoverhang,
    author = {Mike Paterson and Yuval Peres and Mikkel Thorup and Peter Winkler and Uri Zwick},
    title = {Maximum Overhang},
    year = {2007}
}

OpenURL

Abstract

How 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.

Keyphrases

maximum overhang n-block stack constant factor order log long-standing overhang problem identical block 19th century

DMCA