Overhang

Paterson, Michael S. and Zwick, Uri, 1961- (2009) Overhang. American Mathematical Monthly, Vol.116 (No.1). pp. 19-44. ISSN 0002-9890

Full text not available from this repository.

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 > Computer Science
Library of Congress Subject Headings (LCSH):	Logarithms
Journal or Publication Title:	American Mathematical Monthly
Publisher:	Mathematical Association of America
ISSN:	0002-9890
Date:	January 2009
Volume:	Vol.116
Number:	No.1
Number of Pages:	26
Page Range:	pp. 19-44
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 to a record

Repository Staff Only: item control page

WRAP: Warwick Research Archive Portal is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.