Maximum overhang

  title={Maximum overhang},
  author={Mike Paterson and Yuval Peres and Mikkel Thorup and Peter Winkler and Uri Zwick},
  journal={The American Mathematical Monthly},
  pages={763 - 787}
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

Paper Mentions

Blog Post
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
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
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
Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading
This work considers dynamic loading and unloading problems for heavy geometric objects and gives optimal approaches for several variants that model different loading scenarios that may arise, e.g., in the loading of a transport ship with containers. 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
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


Preliminary Version
The main theorem of this paper is that, for every real number < 1 (e.g., = 0:99), only a measure 0 subset of the languages decidable in exponential time are Pn tt-reducible to languages that are notExpand
Fun with stacking blocks
How can a given number of rigid, rectangular blocks be stacked in a planar arrangement to produce the maximum overhang over a support edge? To answer this question, three cases of increasingExpand
It is shown that the stability of a given stack of blocks corresponds to the feasibility of a <i>linear program</i> and so can be efficiently determined. Expand
American Mathematical Monthly
s for articles or notes should entice the prospective reader into exploring the subject of the paper and should make it clear to the reader why this paper is interesting and important. The abstractExpand
Theory of linear and integer programming
  • A. Schrijver
  • Mathematics, Computer Science
  • Wiley-Interscience series in discrete mathematics and optimization
  • 1999
Introduction and Preliminaries. Problems, Algorithms, and Complexity. LINEAR ALGEBRA. Linear Algebra and Complexity. LATTICES AND LINEAR DIOPHANTINE EQUATIONS. Theory of Lattices and LinearExpand
Sixth book of mathematical games from Scientific American
Both the size and quantity of crystal particles removed from the slurry body are independently regulated, thereby providing product crystals of improved size uniformity. Expand
Mad about physics : braintwisters, paradoxes, and curiosities
Temperature Risin'. Color My World. Splish! Splash! Fly like an Eagle. Good Vibrations. Opposites Attract. Bodies in Motion. Stairway to Heaven. Life in the Fast Lane. Born to Run. Third Stone fromExpand
Mad About Physics: Braintwisters
  • Paradoxes, and Curiosities, John Wiley, New York
  • 2001
Puzzle-Math, Viking, New York, 1958
  • January
  • 2009