Overhang bounds Mike Paterson Joint work with Uri Zwick,

Slides:



Advertisements
Similar presentations
Lower Bounds for Additive Spanners, Emulators, and More David P. Woodruff MIT and Tsinghua University To appear in FOCS, 2006.
Advertisements

Ulams Game and Universal Communications Using Feedback Ofer Shayevitz June 2006.
Mike Paterson Uri Zwick Overhang. Mike Paterson Uri Zwick Overhang.
Mike Paterson Uri Zwick Overhang. Mike Paterson Uri Zwick Overhang.
One-phase Solidification Problem: FEM approach via Parabolic Variational Inequalities Ali Etaati May 14 th 2008.
Chapter 2 Multivariate Distributions Math 6203 Fall 2009 Instructor: Ayona Chatterjee.
On the Density of a Graph and its Blowup Raphael Yuster Joint work with Asaf Shapira.
Approximation Algorithms Chapter 14: Rounding Applied to Set Cover.
Copyright © 2005 Pearson Education, Inc. Chapter 4 Graphs of the Circular Functions.
Bounds on Code Length Theorem: Let l ∗ 1, l ∗ 2,..., l ∗ m be optimal codeword lengths for a source distribution p and a D-ary alphabet, and let L ∗ be.
Moments TUTORIAL 4 to answer just click on the button or image related to the answer Distance Force.
JENGA and other wooden block games
Mike Paterson Overhang Academic Sponsors’ Day, MSRI, March 2, 2012 Peter Winkler Uri Zwick Yuval Peres Mikkel Thorup.
Chain Rules for Entropy
(W= weight!) W = m  g The main force acting on the body is the gravitational force! Gravitational force W applies at the center of gravity CG of the.
Eigenvalues and Eigenvectors
Chapter 12: Static Equilibrium Conditions for equilibrium  First condition for equilibrium When a particle is in equilibrium (no acceleration), in an.
Frank L. H. WolfsDepartment of Physics and Astronomy, University of Rochester Physics 121, April 1, Equilibrium.
Dynamic percolation, exceptional times, and harmonic analysis of boolean functions Oded Schramm joint w/ Jeff Steif.
Number Sequences Lecture 7: Sep 28 (chapter 4.1 of the book and chapter 9 of the notes) ? overhang.
The first exam will be held on Tuesday, September 23, in room 109 Heldenfels from 7 to 9:30 p.m. Section 807 and half of section 808 (students with last.
Reading Quiz 1. Viscous friction is
Physics 106: Mechanics Lecture 07
Minimaxity & Admissibility Presenting: Slava Chernoi Lehman and Casella, chapter 5 sections 1-2,7.
Approximation Algorithms
APPLICATIONS OF INTEGRATION Work APPLICATIONS OF INTEGRATION In this section, we will learn about: Applying integration to calculate the amount.
Expanders Eliyahu Kiperwasser. What is it? Expanders are graphs with no small cuts. The later gives several unique traits to such graph, such as: – High.
1 Chapter 2 Limits and Continuity Rates of Change and Limits.
Copyright © Cengage Learning. All rights reserved.
(work appeared in SODA 10’) Yuk Hei Chan (Tom)
Data reduction lower bounds: Problems without polynomial kernels Hans L. Bodlaender Joint work with Downey, Fellows, Hermelin, Thomasse, Yeo.
Linear Programming Old name for linear optimization –Linear objective functions and constraints Optimum always at boundary of feasible domain First solution.
4.3 Logarithm Functions Recall: a ≠ 1 for the exponential function f(x) = a x, it is one-to-one with domain (-∞, ∞) and range (0, ∞). when a > 1, it is.
Asaf Cohen (joint work with Rami Atar) Department of Mathematics University of Michigan Financial Mathematics Seminar University of Michigan March 11,
Introduction to Statistical Inferences
Solving Linear Equations UC Berkeley Fall 2004, E77 Copyright 2005, Andy Packard. This work is licensed under the.
1 Preliminaries Precalculus Review I Precalculus Review II
A Conjecture for the Packing Density of 2413 Walter Stromquist Swarthmore College (joint work with Cathleen Battiste Presutti, Ohio University at Lancaster)
The importance of sequences and infinite series in calculus stems from Newton’s idea of representing functions as sums of infinite series.  For instance,
APPLICATIONS OF DOUBLE INTEGRALS
Linear Equations, Inequalities, and Absolute Value - Solving Linear Equations METHOD #1 – Inspection Some equations are easy to solve. Ones that have one.
Joint work with Yuval Peres, Mikkel Thorup, Peter Winkler and Uri Zwick Overhang Bounds Mike Paterson DIMAP & Dept of Computer Science University of Warwick.
Number Sequences ? overhang. This Lecture We will study some simple number sequences and their properties. The topics include: Representation of a sequence.
Approximate Distance Oracles Mikkel Thorup and Uri Zwick Presented By Shiri Chechik.
9.6 Fluid Pressure According to Pascal’s law, a fluid at rest creates a pressure ρ at a point that is the same in all directions Magnitude of ρ measured.
Expectation. Let X denote a discrete random variable with probability function p(x) (probability density function f(x) if X is continuous) then the expected.
Fourier series, Discrete Time Fourier Transform and Characteristic functions.
Joint Moments and Joint Characteristic Functions.
1 What happens to the location estimator if we minimize with a power other that 2? Robert J. Blodgett Statistic Seminar - March 13, 2008.
1 Covering Non-uniform Hypergraphs Endre Boros Yair Caro Zoltán Füredi Raphael Yuster.
Module 1.1 – Displacement and Velocity Vectors
Copyright © Cengage Learning. All rights reserved. Sequences and Series.
11.8 Power Series In this section, we will learn about: Power series and testing it for convergence or divergence. INFINITE SEQUENCES AND SERIES.
Chapter 2 Centroids and the center of gravity. Centroids The centroid of an area is situated at its geometrical centre. In each of the following figures.
Applications of Integration Copyright © Cengage Learning. All rights reserved.
Torque & Equilibrium AP Physics.
 Torque is the cross product between a force and the distance of the force from a fulcrum (the central point about which the system turns). τ = r × F.
Linear program Separation Oracle. Rounding We consider a single-machine scheduling problem, and see another way of rounding fractional solutions to integer.
The Addition/Subtraction Principle of Equality
10 Real Numbers, Equations, and Inequalities.
Triangle Inequalities
Mike Paterson Yuval Peres Mikkel Thorup Peter Winkler Uri Zwick
Mike Paterson Yuval Peres Mikkel Thorup Peter Winkler Uri Zwick
Introduction Solving inequalities is similar to solving equations. To find the solution to an inequality, use methods similar to those used in solving.
Applied Combinatorics, 4th Ed. Alan Tucker
Mike Paterson Yuval Peres, Mikkel Thorup, Peter Winkler
A9.2 Graphs of important non-linear functions
Winter 2019 Lecture 11 Minimum Spanning Trees (Part II)
QUESTION 9 The given inequality is
Autumn 2019 Lecture 11 Minimum Spanning Trees (Part II)
Presentation transcript:

Overhang bounds Mike Paterson Joint work with Uri Zwick, Yuval Peres, Mikkel Thorup and Peter Winkler

The classical solution Using n blocks we can get an overhang of Harmonic Stacks

Is the classical solution optimal? Obviously not!

Inverted triangles? Balanced?

???

Inverted triangles? Balanced?

Inverted triangles? Unbalanced!

Inverted triangles? Unbalanced!

Diamonds? Balanced?

The 4-diamond is balanced Diamonds? The 4-diamond is balanced

Diamonds? The 5-diamond is …

Diamonds? … unbalanced!

What really happens?

What really happens!

How do we know this is unbalanced?

… and this balanced?

Equilibrium Force equation Moment equation F1 F2 F3 F4 F5 x1 F1+ x2 F2+ x3 F3 = x4 F4+ x5 F5

Checking balance

Equivalent to the feasibility of a set of linear inequalities: Checking balance F1 F2 F3 F4 F5 F6 F7 F8 F9 F10 F11 F12 F13 F14 F15 F16 Equivalent to the feasibility of a set of linear inequalities: F17 F18

Small optimal stacks Overhang = 1.16789 Blocks = 4 Overhang = 1.30455

Small optimal stacks

Small optimal stacks

Small optimal stacks Overhang = 2.14384 Blocks = 16 Overhang = 2.1909

Support and balancing blocks Principal block Balancing set Support set

Support and balancing blocks Balancing set Principal block Support set

Loaded stacks Stacks with downward external forces acting on them Principal block Size = number of blocks + sum of external forces Support set

Stacks in which the support set contains only one block at each level Spinal stacks Stacks in which the support set contains only one block at each level Principal block Support set

Optimality condition: Optimal spinal stacks … Optimality condition:

A factor of 2 improvement over harmonic stacks! Spinal overhang Let S (n) be the maximal overhang achievable using a spinal stack with n blocks. Let S*(n) be the maximal overhang achievable using a loaded spinal stack on total weight n. Theorem: Conjecture: A factor of 2 improvement over harmonic stacks!

Optimal weight 100 loaded spinal stack

Optimal 100-block spinal stack

Are spinal stacks optimal? No! Support set is not spinal! Blocks = 20 Overhang = 2.32014 Tiny gap

Optimal 30-block stack Blocks = 30 Overhang = 2.70909

Optimal (?) weight 100 construction Blocks = 49 Overhang = 4.2390

“Parabolic” constructions 6-stack Number of blocks: Overhang: Balanced!

“Parabolic” constructions 6-slab 5-slab 4-slab

r-slab r-slab

r-slab within an (r +1)-slab

An exponential improvement over the ln n overhang of spinal stacks !!! So with n blocks we can get an overhang of c n1/3 for some constant c !!! An exponential improvement over the ln n overhang of spinal stacks !!! Note: c n1/3 ~ e1/3 ln n Overhang, Paterson & Zwick, American Math. Monthly Jan 2009

What is really the best design? Some experimental results with optimised “brick-wall” constructions Firstly, symmetric designs

“Vases” Weight = 1151.76 Blocks = 1043 Overhang = 10

“Vases” Weight = 115467. Blocks = 112421 Overhang = 50

then, asymmetric designs

“Oil lamps” Weight = 1112.84 Blocks = 921 Overhang = 10

Theorem: Maximum overhang is less than C n1/3 for some constant C Ωn is a lower bound for overhang with n blocks? Can we do better? Not much! Theorem: Maximum overhang is less than C n1/3 for some constant C Maximum overhang, Paterson, Perez, Thorup, Winkler, Zwick, American Math. Monthly, Nov 2009

Forces between blocks Assumption: No friction. All forces are vertical. Equivalent sets of forces

Distributions

Moments and spread j-th moment Center of mass Spread NB important measure

Signed distributions

Moves A move is a signed distribution  with M0[ ] = M1[ ] = 0 whose support is contained in an interval of length 1 A move is applied by adding it to a distribution. A move can be applied only if the resulting signed distribution is a distribution.

Equilibrium Recall! F1 F2 F3 F4 F5 F1 + F2 + F3 = F4 + F5 Force equation x1 F1+ x2 F2+ x3 F3 = x4 F4+ x5 F5 Moment equation

Moves A move is a signed distribution  with M0[ ] = M1[ ] = 0 whose support is contained in an interval of length 1 A move is applied by adding it to a distribution. A move can be applied only if the resulting signed distribution is a distribution.

Move sequences

Extreme moves Moves all the mass within the interval to the endpoints

Lossy moves If  is a move in [c-½,c+½] then A lossy move removes one unit of mass from position c Alternatively, a lossy move freezes one unit of mass at position c

Overhang and mass movement If there is an n-block stack that achieves an overhang of d, then n–1 lossy moves

Main theorem

Four steps Shift half mass outside interval Shift half mass across interval Shift some mass across interval and no further Shift some mass across interval

Simplified setting “Integral” distributions Splitting moves

-3 -2 -1 1 2 3

Basic challenge Suppose that we start with a mass of 1 at the origin. How many splits are needed to get, say, half of the mass to distance d ? Reminiscent of a random walk on the line O(d3) splits are “clearly” sufficient To prove: (d3) splits are required

Effect of a split Note that such split moves here have associated interval of length 2.

Spread vs. second moment argument

That’s a start! But … That’s another talk! we have to extend the proof to the general case, with general distributions and moves; we need to get improved bounds for small values of p; we have to show that moves beyond position d cannot help; we did not yet use the lossy nature of moves. That’s another talk!

Open problems What is the asymptotic shape of “vases”? What is the asymptotic shape of “oil lamps”? What is the gap between brick-wall stacks and general stacks? Other games! “Bridges” and “seesaws”.

Design the best bridge

Design the best seesaw

A big open area We only consider frictionless 2D constructions here. This implies no horizontal forces, so, even if blocks are tilted, our results still hold. What happens in the frictionless 3D case? With friction, everything changes!

With friction With enough friction we can get overhang greater than 1 with only 2 blocks! With enough friction, all diamonds are balanced, so we get Ω(n1/2) overhang. Probably we can get Ω(n1/2) overhang with arbitrarily small friction. With enough friction, there are possibilities to get exponents greater than 1/2. In 3D, I think that when the coefficient of friction is greater than 1 we can get Ω(n) overhang.

Applications? The end