Mike Paterson Yuval Peres Mikkel Thorup Peter Winkler Uri Zwick

Slides:



Advertisements
Similar presentations
The Equivalence of Sampling and Searching Scott Aaronson MIT.
Advertisements

Mike Paterson Uri Zwick Overhang. Mike Paterson Uri Zwick Overhang.
Mike Paterson Uri Zwick Overhang. Mike Paterson Uri Zwick Overhang.
Boyce/DiPrima 9th ed, Ch 2.8: The Existence and Uniqueness Theorem Elementary Differential Equations and Boundary Value Problems, 9th edition, by William.
Master Theorem Chen Dan Dong Feb. 19, 2013
One-phase Solidification Problem: FEM approach via Parabolic Variational Inequalities Ali Etaati May 14 th 2008.
Approximate Distance Oracles and Spanners with sublinear surplus Mikkel Thorup AT&T Research Uri Zwick Tel Aviv University.
Mathematics1 Mathematics 1 Applied Informatics Štefan BEREŽNÝ.
Approximation Algorithms Chapter 14: Rounding Applied to Set Cover.
Ch 3.8: Mechanical & Electrical Vibrations
Copyright © 2005 Pearson Education, Inc. Chapter 4 Graphs of the Circular Functions.
Random Geometric Graph Diameter in the Unit Disk Robert B. Ellis, Texas A&M University coauthors Jeremy L. Martin, University of Minnesota Catherine Yan,
JENGA and other wooden block games
Approximation Algorithms Chapter 5: k-center. Overview n Main issue: Parametric pruning –Technique for approximation algorithms n 2-approx. algorithm.
Mike Paterson Overhang Academic Sponsors’ Day, MSRI, March 2, 2012 Peter Winkler Uri Zwick Yuval Peres Mikkel Thorup.
(a) an ordered list of objects.
Validating Streaming XML Documents Luc Segoufin & Victor Vianu Presented by Harel Paz.
1 Chapter 2 Limits and Continuity Rates of Change and Limits.
Variable-Length Codes: Huffman Codes
Error estimates for degenerate parabolic equation Yabin Fan CASA Seminar,
Solving Inequalities We can solve inequalities just like equations, with the following exception: Multiplication or division of an inequality by a negative.
A Simplified View of DCJ-Indel Distance Phillip Compeau A Simplified View of DCJ- Indel Distance Phillip Compeau University of California-San Diego Department.
Center of Mass and Moments of Inertia
Expanders via Random Spanning Trees R 許榮財 R 黃佳婷 R 黃怡嘉.
Joint work with Yuval Peres, Mikkel Thorup, Peter Winkler and Uri Zwick Overhang Bounds Mike Paterson DIMAP & Dept of Computer Science University of Warwick.
1 2.6 – Limits Involving Infinity. 2 Definition The notation means that the values of f (x) can be made arbitrarily large (as large as we please) by taking.
Approximate Distance Oracles Mikkel Thorup and Uri Zwick Presented By Shiri Chechik.
Equilibrium Static Equilibrium.
EXAMPLE 3 Write the standard equation of a circle The point (–5, 6) is on a circle with center (–1, 3). Write the standard equation of the circle. SOLUTION.
Solving Absolute Value Equations and Inequalities.
Planar Graphs Graph Coloring
Overhang bounds Mike Paterson Joint work with Uri Zwick,
Physics. Simple Harmonic Motion - 1 Session Session Objectives.
Applications of Integration 7 Copyright © Cengage Learning. All rights reserved.
Approximation Algorithms based on linear programming.
Applications of Integration Copyright © Cengage Learning. All rights reserved.
Section 10.4 Last Updated: December 2, Hyperbola  The set of all points in a plane whose differences of the distances from two fixed points (foci)
Copyright © Cengage Learning. All rights reserved. 4 Integrals.
Linear program Separation Oracle. Rounding We consider a single-machine scheduling problem, and see another way of rounding fractional solutions to integer.
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Chapter 5 Limits and Continuity.
Markov Chains and Mixing Times
Visual Recognition Tutorial
Copyright © Cengage Learning. All rights reserved.
Boyce/DiPrima 9th ed, Ch 9.6: Liapunov’s Second Method Elementary Differential Equations and Boundary Value Problems, 9th edition, by William E. Boyce.
Haim Kaplan and Uri Zwick
Derivative and properties of functions
Chapter 5. Optimal Matchings
A particle representation for the heat equation solution
Yuval Peres Dmitry Sotnikov Benny Sudakov Uri Zwick (武熠)
Distinct Distances in the Plane
Enumerating Distances Using Spanners of Bounded Degree
Haim Kaplan and Uri Zwick
Randomized Algorithms CS648
Mike Paterson Yuval Peres Mikkel Thorup Peter Winkler Uri Zwick
Chapter 8 Infinite Series.
Simple Linear Regression
Mike Paterson Yuval Peres, Mikkel Thorup, Peter Winkler
Chapter 5. The Duality Theorem
Copyright © Cengage Learning. All rights reserved.
The system consist of three objects.
Quantum Foundations Lecture 3
V12 Menger’s theorem Borrowing terminology from operations research
Clustering.
Inequalities Some problems in algebra lead to inequalities instead of equations. An inequality looks just like an equation, except that in the place of.
Winter 2019 Lecture 11 Minimum Spanning Trees (Part II)
5.1 Integrals Rita Korsunsky.
Autumn 2019 Lecture 11 Minimum Spanning Trees (Part II)
Presentation transcript:

Mike Paterson Yuval Peres Mikkel Thorup Peter Winkler Uri Zwick Maximum Overhang Mike Paterson Yuval Peres Mikkel Thorup Peter Winkler Uri Zwick

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

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

Optimal 30-block stack Blocks = 30 Overhang = 2.70909

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

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

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

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

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

Distributions

Signed distributions

Moments and spread j-th moment Center of mass Spread

Elementary moves (informally) μ1 is obtained from μ0 by an elementary move if they differ only in an interval of length 1 and have the same total mass and first moment

A move is applied by adding it to a distribution. 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

Moves all the mass within the interval to the endpoints 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

“Integral” distributions Simplified setting “Integral” distributions Splitting moves

1 2 3 -3 -2 -1

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 (d3) splits are required

Note that such split moves here have associated interval of length 2. 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 … Can we extend the proof to the general case, with general distributions and moves? Can we get improved bounds for small values of p? Can moves beyond position d help? We did not yet use the lossy nature of moves.

Spread vs. second moment argument

Spread vs. second moment argument

Spread vs. second moment inequalities Plackett (1947): Simple proof by Benjy Weiss If 1 is obtained from0 by an extreme move, then

Spread vs. second moment argument (for extreme moves)

Splitting “Basic” splitting move A single mass is split into arbitrarily many parts, maintaining the total and center of mass iff 1 is obtained from0 by a sequence of splitting moves

Splitting and extreme moves If V is a sequence of moves, we let V* be the corresponding sequence of extreme moves. Lemma: Corollary:

Spread vs. second moment argument (for general moves) extreme

Notation

An extended bound

An almost tight bound

An almost tight bound - Proof

An asymptotically tight bound freezing moves

An asymptotically tight bound - Proof freezing

Open problems Simpler proof ? The right constant ??? Several unresolved issues in 3D