# Maximum overhang

```@article{Paterson2008MaximumO,
title={Maximum overhang},
author={Mike Paterson and Yuval Peres and Mikkel Thorup and Peter Winkler and Uri Zwick},
journal={The American Mathematical Monthly},
year={2008},
volume={116},
pages={763 - 787}
}```
• M. Paterson, +2 authors U. Zwick
• Published 2008
• Computer Science, Mathematics, Physics
• The American Mathematical Monthly
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. However, at SODA'06, Paterson and Zwick constructed n-block stacks with overhangs of order n1/3. Here we complete the solution to the overhang problem, and answer Paterson and Zwick's primary open question, by showing that order n1/3 is best possible. At the heart of the argument is a… Expand
16 Citations

#### Paper Mentions

Blog Post
Reviews
Most of the time we think of a puzzle as an abstract but static thing, namely, a question that requires a clever answer. But puzzles evolve over time, sometimes splitting (like a living organism)Expand
Further Thoughts on a Paradoxical Tower
First, a set of blocks of variable width are stacked so that there is one block at each level, and it is described how they should be stacked to maximize their overhang. Expand
Collapse
• Computer Science
• SODA '11
• 2011
Gauß' principle of least restraint is used to show that rigid-body simulation problems in which many parts touch each other can be reduced to solving a sequence of convex quadratic programs, with linear constraints, corresponding to a discretization of time. Expand
Optimal Control for Diffusions on Graphs
• Mathematics, Computer Science
• SIAM J. Discret. Math.
• 2018
This work investigates the minimum number of controlled diffusion steps needed to transport a constant mass \$p\$ outside of the ball of radius \$n\$ and considers graphs where simple random walk has positive speed and entropy and which satisfy Shannon's theorem. Expand
Meteor process on \$\${\mathbb Z}^d\$\$Zd
The meteor process is a model for mass redistribution on a graph. The case of finite graphs was analyzed in Billey et al. (On meteors, earthworms and WIMPs. Ann Appl Probab, 2014). This paper isExpand
Profile of Yuval Peres
• Sandeep Ravindran
• Sociology, Medicine
• Proceedings of the National Academy of Sciences
• 2018
During a distinguished career, Peres has continued to work on probability and ergodic theory and has tackled numerous other topics, including fractals, random walks, Brownian motion, game theory, and information theory. Expand
Meteor process on \${\mathbb Z}^d\$
The meteor process is a model for mass redistribution on a graph. The case of finite graphs was analyzed in \cite{BBPS}. This paper is devoted to the meteor process on \${\mathbb Z}^d\$. The process isExpand
A Formal Framework for Robot Construction Problems: A Hybrid Planning Approach
• Computer Science
• ArXiv
• 2019
A formal hybrid planning framework to solve a wide range of robot construction problems, based on Answer Set Programming is proposed, which not only decides for a stable final configuration of the structure, but also computes the order of manipulation tasks for multiple autonomous robots to build the structure from an initial configuration. Expand
Efficient Algorithms and Data Structures
The proposed project will address some of the fundamental issues in effi c ent algorithms and data structures, ranging from pseudo-random hashing, to the existenc e of deterministic dictionaries withExpand