The Library
Overhang
Tools
Tools
Tools
Paterson, Michael S. and Zwick, Uri (2009) Overhang. American Mathematical Monthly, Vol.116 (No.1). pp. 19-44. doi:10.4169/000298909x474855 ISSN 0002-9890.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://www.maa.org/pubs/monthly.html
Abstract
How far off the edge of a table can we reach by stacking n identical, homogeneous, frictionless blocks? A classical solution achieving a logarithmic overhang was widely believed to be optimal. We show, however, that this classical solution is exponentially far from optimality.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics | ||||
| Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
| Library of Congress Subject Headings (LCSH): | Logarithms | ||||
| Journal or Publication Title: | American Mathematical Monthly | ||||
| Publisher: | Mathematical Association of America | ||||
| ISSN: | 0002-9890 | ||||
| Official Date: | January 2009 | ||||
| Dates: |
|
||||
| Volume: | Vol.116 | ||||
| Number: | No.1 | ||||
| Number of Pages: | 26 | ||||
| Page Range: | pp. 19-44 | ||||
| DOI: | 10.4169/000298909x474855 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
