Domino Tilings of the Chessboard An Introduction to Sampling and Counting Dana Randall Schools of Computer Science and Mathematics Georgia Tech.

Slides:



Advertisements
Similar presentations
Chessboard problems You don’t have to know chess to solve them.
Advertisements

(Fuzzy Set Operations)
Mathematical Preliminaries
1 Instituto de Sistemas e Robótica 10th IEEE MEDITERRANEAN CONFERENCE ON CONTROL AND AUTOMATION Instituto Superior Técnico – Instituto de Sistemas e Robótica.
Generating Random Spanning Trees Sourav Chatterji Sumit Gulwani EECS Department University of California, Berkeley.
Objectives: Generate and describe sequences. Vocabulary:
By John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
1 Introduction to Algorithms 6.046J/18.401J/SMA5503 Lecture 19 Prof. Erik Demaine.
Introduction to Algorithms 6.046J/18.401J/SMA5503
Introduction to Algorithms
Slow and Fast Mixing of Tempering and Swapping for the Potts Model Nayantara Bhatnagar, UC Berkeley Dana Randall, Georgia Tech.
Polygon Scan Conversion – 11b
GR2 Advanced Computer Graphics AGR
13.1 si31_2001 SI31 Advanced Computer Graphics AGR Lecture 13 An Introduction to Ray Tracing.
Reductions Complexity ©D.Moshkovitz.
A Lesson in the “Math + Fun!” Series
Ashish Goel, 1 A simple analysis Suppose complementary DNA strands of length U always stick, and those of length L never stick (eg:
Discrete Math Recurrence Relations 1.
Clustering in Interfering Binary Mixtures Sarah Miracle, Dana Randall, Amanda Streib Georgia Institute of Technology.
1 The tiling algorithm Learning in feedforward layered networks: the tiling algorithm writed by Marc M é zard and Jean-Pierre Nadal.
Chapter 4 Partition I. Covering and Dominating.
Fibonacci Numbers F n = F n-1 + F n-2 F 0 =0, F 1 =1 – 0, 1, 1, 2, 3, 5, 8, 13, 21, 34 … Straightforward recursive procedure is slow! Why? How slow? Lets.
Randomized Algorithms Randomized Algorithms CS648 1.
Outline Introduction Assumptions and notations
* Reading Assignments:
Equations, Tables and Graphs Graphing Activity. Warm UP xy InputOutput Determine if the following relations are functions.
Business and Economics 6th Edition
5-1 Chapter 5 Theory & Problems of Probability & Statistics Murray R. Spiegel Sampling Theory.
Filling and Wrapping Review Sheet
演 算 法 實 驗 室演 算 法 實 驗 室 On the Minimum Node and Edge Searching Spanning Tree Problems Sheng-Lung Peng Department of Computer Science and Information Engineering.
Surface Area of Irregular Shapes Volume of Irregular Shapes
Text Categorization.
Polynomial Factor Theorem Polynomial Factor Theorem
Scale Free Networks.
CHAPTER 2 – DISCRETE DISTRIBUTIONS HÜSEYIN GÜLER MATHEMATICAL STATISTICS Discrete Distributions 1.
Graphs, Planar graphs Graph coloring
Introduction to Feedback Systems / Önder YÜKSEL Bode plots 1 Frequency response:
Sets Sets © 2005 Richard A. Medeiros next Patterns.
25 seconds left…...
Sorting It All Out Mathematical Topics
Complexity ©D.Moshkovits 1 Where Can We Draw The Line? On the Hardness of Satisfiability Problems.
Technische Universität München Fakultät für Informatik Computer Graphics SS 2014 Sampling Rüdiger Westermann Lehrstuhl für Computer Graphik und Visualisierung.
. Lecture #8: - Parameter Estimation for HMM with Hidden States: the Baum Welch Training - Viterbi Training - Extensions of HMM Background Readings: Chapters.
Abdollah Khodkar Department of Mathematics University of West Georgia Joint work with Arezoo N. Ghameshlou, University of Tehran.
Foundations of Data Structures Practical Session #7 AVL Trees 2.
The Small World Phenomenon: An Algorithmic Perspective Speaker: Bradford Greening, Jr. Rutgers University – Camden.
Bart Jansen 1.  Problem definition  Instance: Connected graph G, positive integer k  Question: Is there a spanning tree for G with at least k leaves?
1 Undirected Graphical Models Graphical Models – Carlos Guestrin Carnegie Mellon University October 29 th, 2008 Readings: K&F: 4.1, 4.2, 4.3, 4.4,
Delta-Oriented Testing for Finite State Machines
Epp, section 10.? CS 202 Aaron Bloomfield
 Theorem 5.9: Let G be a simple graph with n vertices, where n>2. G has a Hamilton circuit if for any two vertices u and v of G that are not adjacent,
The Pumping Lemma for CFL’s
Secret Sharing, Matroids, and Non-Shannon Information Inequalities.
Minimum Vertex Cover in Rectangle Graphs
Discrepancy and SDPs Nikhil Bansal (TU Eindhoven, Netherlands ) August 24, ISMP 2012, Berlin.
Circles in Aztec Diamonds. Aztec Diamonds in Groves. Circles in Groves? Limiting Behavior of Combinatorial Models.
CSE 421 Algorithms Richard Anderson Lecture 4. What does it mean for an algorithm to be efficient?
Mixing Times of Markov Chains for Self-Organizing Lists and Biased Permutations Prateek Bhakta, Sarah Miracle, Dana Randall and Amanda Streib.
Mixing Times of Self-Organizing Lists and Biased Permutations Sarah Miracle Georgia Institute of Technology.
Algorithms to Approximately Count and Sample Conforming Colorings of Graphs Sarah Miracle and Dana Randall Georgia Institute of Technology (B,B)(B,B) (R,B)(R,B)
A graph is a set of vertices and edges between some vertices.. A bipartite graph has two clumps of vertices, with edges going from a vertex in one clump.
Seminar on random walks on graphs Lecture No. 2 Mille Gandelsman,
Homework - hints Problem 1. Node weights  Edge weights
Counting and Sampling in Lattices: The Computer Science Perspective Dana Randall Advance Professor of Computing Georgia Institute of Technology.
Domino Tilings of the Chessboard Dana Randall Computer Science and Mathematics Depts. Georgia Institute of Technology.
Equitable Rectangular Dissections Dana Randall Georgia Institute of Technology Joint with: Sarah Cannon and Sarah Miracle.
Sequential Algorithms for Generating Random Graphs
Slow Mixing of Local Dynamics via Topological Obstructions
Surprising Connections in Math: From the Golden Ratio to Fractals
Presentation transcript:

Domino Tilings of the Chessboard An Introduction to Sampling and Counting Dana Randall Schools of Computer Science and Mathematics Georgia Tech

Building short walls How many ways are there to build a 2 x n wall with 1 x 2 bricks? 2 n 2 1

Building short walls 2 1How many ways are there to build a 2 x n wall with 1 x 2 bricks? 2 n

n=1 : n=2 : n=3 : n=0 : n=4 : Building short walls

n=0 : n=1 : n=2 : n=3 : n=4 : The number of walls equal: f n = 1, 1, 2, 3, 5

Building short walls n=0 : n=1 : n=2 : n=3 : n=4 : The number of walls equal: f n = 1, 1, 2, 3, 5, 8, 13, 21,... ?

Building short walls n=0 : n=1 : n=2 : n=3 : n=4 : The number of walls equals: f n = 1, 1, 2, 3, 5, 8, 13, 21,... ? n 2 2 fn =fn = {

Building short walls n=0 : n=1 : n=2 : n=3 : n=4 : The number of walls equals: f n = 1, 1, 2, 3, 5, 8, 13, 21,... ? n 2 2 fn =fn = {

Building short walls n=0 : n=1 : n=2 : n=3 : n=4 : The number of walls equals: f n = 1, 1, 2, 3, 5, 8, 13, 21,... ? n 2 2 f n-1 f n-2 fn =fn = {

The Fibonacci Numbers The number of walls equals: f n = 1, 1, 2, 3, 5, 8, 13, 21,... f n-1 f n-2 fn =fn = { f n = f n-1 + f n-2, f 0 = f 1 = 1 f n = (φ n + (1-φ) n ) /√5, where: (“golden ratio”) φ = 1+√5 2

Domino Tilings Given a region R on the infinite chessboard, cover with non-overlapping 2 x 1 dominos. Where is a tiling? Do any even exist? How many tilings are there? What does a typical tiling look like? When do we stop our algorithms? Why do we care?

Where is a tiling? Do any exist? n n ★ Only if n is even!

Where is a tiling? Do any exist? The Area of R must be even n n

Where is a tiling? Do any exist? n n ★ There must be an equal number of black and white squares. The Area of R must be even

Where is a tiling? Do any exist? Is this enough? The Area of R must be even With an equal number of white and black squares

Where is a tiling? Do any exist? Is this enough? ?... There is an efficient algorithm to decide if R is tileable and to find one if it is. [Thurston] The Area of R must be even With an equal number of white and black squares

Domino Tilings Where is a tiling? Do any even exist? How many tilings are there? What does a typical tiling look like? When do we stop our algorithms? Why do we care?

How many tilings are there?  φ n Short 2 x n walls

How many tilings are there?  φ n Short 2 x n walls Aztec Diamonds n # = n=0 n=1 n=2 n=3  n(n+1)/2 [Elkies, Kuperberg, Larson, Propp]

How many tilings are there?  φ n Short 2 x n walls Aztec Diamonds n  n(n+1)/2

How many tilings are there?  φ n Short 2 x n walls Aztec Diamonds Square n x n walls n ?  n(n+1)/2

How many tilings are there? Square n x n walls 2 (Area/4) < # < # < 4 (Area) <

How many tilings are there? #  φ n Short 2 x n walls Aztec Diamonds Square n x n walls 2 Area/4 < # < 4 Area #  n(n+1)/2

How many: An Algorithm Mark alternating vertical edges;

How many: An Algorithm Mark alternating vertical edges; Use marked tiles; Markings must line up!

How many: An Algorithm t1t1 t2t2 t3t3 s1s1 s2s2 s3s3

t1t1 t2t2 t3t3 s1s1 s2s2 s3s3 s1s1 s2s2 s3s3 t1t1 t2t2 t3t3 We want to count non-intersecting sets of paths from s i to t i. [R.]

How many: An Algorithm We want to count non-intersecting sets of paths from s i to t i. Let a ij be the number of paths from s i to t j. s1s1 s2s2 s3s3 t1t1 t2t2 t3t3

How many: An Algorithm s1s1 s2s2 s3s3 t1t1 t2t2 t3t3 Let a ij be the number of paths from s i to t j. We want to count non-intersecting sets of paths from s i to t i

How many: An Algorithm s1s1 s2s2 s3s3 t1t1 t2t2 t3t3 We want to count non-intersecting sets of paths from s i to t i Let a ij be the number of paths from s i to t j.

How many: An Algorithm s1s1 s2s2 s3s3 t1t1 t2t2 t3t3 We want to count non-intersecting sets of paths from s i to t i Let a ij be the number of paths from s i to t j.

How many: An Algorithm s1s1 s2s2 s3s3 t1t1 t2t2 t3t3 We want to count non-intersecting sets of paths from s i to t i = [Gessel, Viennot] Let a ij be the number of paths from s i to t j. Det This is the number domino tilings!!

Proof sketch for two paths: a 11 x a 22 counts what we want + extra stuff. a 12 x a 21 also counts the extra stuff. Therefore (a 11 x a 22 ) - (a 12 x a 21 ) counts real tilings. = # (This is the 2 x 2 determinant!)

Domino Tilings Where is a tiling? Do any even exist? How many tilings are there? What does a typical tiling look like? When do we stop our algorithms? Why do we care?

Why Mathematicians Care Arctic Circle Theorem [Jockush, Propp, Shor] The Aztec Diamond

On the chessboard On the hexagonal lat. “Domino tilings” “Lozenge tilings” (little “cubes”) What about tilings on lattices?

Why Mathematicians Care

Why do we care? Mathematics: Discover patterns Chemistry, Biology: Estimate probabilities Physics: Count and calculate other functions to study a physical system Nanotechnology: Model growth processes

Why Physicists Care “Dimer models”: diatomic molecules adhering to the surface of a crystal. The count (“partition function”) determines: specific heat, entropy, free energy, … What does “nature” compute?

Domino Tilings Where is a tiling? Do any even exist? How many tilings are there? What does a typical tiling look like? When do we stop our algorithms? Why do we care?

What does a typical tiling look like?

“Mix” them up!

Markov chain for Lozenge Tilings Repeat :  Pick v in the lattice region;  Add / remove the ``cube’’. at v w.p. ½, if possible. v v

Markov chain for Lozenge Tilings v 1. The state space is connected. 2.If we do this long enough, each tiling will be equally likely. 3. How long is “long enough” ? v

Domino Tilings Where is a tiling? Do any even exist? How many tilings are there? What does a typical tiling look like? When do we stop our algorithms? Why do we care?

When do we stop our algorithms? v v Thm: The lozenge Markov chain is “rapidly mixing.” [Luby, R., Sinclair] 2 n, 3 n n 2, 10 √n, … (exponential) n 2, n log n, n 10, … (polynomial)   3. How long is “long enough” ?

What about other models? Potts model Hardcore model Dimer model Domino tilings k-colorings Independent sets

What about other models? Potts model Hardcore model Dimer model Domino tilings k-colorings Independent sets Pick a 2 x 2 square;

What about other models? Potts model Hardcore model Dimer model Domino tilings k-colorings Independent sets Pick a 2 x 2 square; Rotate, if possible;

What about other models? Potts model Hardcore model Dimer model Domino tilings k-colorings Independent sets Pick a 2 x 2 square; Rotate, if possible; Otherwise do nothing.

What about other models? Potts model Hardcore model Dimer model Domino tilings k-colorings Independent sets Pick a vtx and a color;

What about other models? Potts model Hardcore model Dimer model Domino tilings k-colorings Independent sets Pick a vtx and a color; Recolor, if possible;

What about other models? Potts model Hardcore model Dimer model Domino tilings k-colorings Independent sets Pick a vtx and a color; Recolor, if possible; Otherwise do nothing.

What about other models? Potts model Hardcore model Dimer model Domino tilings k-colorings Independent sets Pick a vtx v and a bit b;

What about other models? Potts model Hardcore model Dimer model Domino tilings k-colorings Independent sets Pick a vtx v and a bit b; If b=1, try to add v

What about other models? Potts model Hardcore model Dimer model Domino tilings k-colorings Independent sets Pick a vtx v and a bit b; If b=1, try to add v; If b=0, try to remove v;

What about other models? Potts model Hardcore model Dimer model Domino tilings k-colorings Independent sets Pick a vtx v and a bit b; If b=1, try to add v; If b=0, try to remove v; O.w. do nothing.

What about other models? Potts model Hardcore model Dimer model Domino tilings k-colorings Independent sets Thm: All of these chains are rapidly mixing.

HOWEVER... Three-colorings: The local chain is fast for 3-colorings in 2-d [LRS] but slow for 3-colorings in sufficiently high dimension. [Galvin, Kahn, R, Sorkin], [Galvin, R] Independent Sets The local chain is fast for sparse Ind Sets in 2-d [Luby, Vigoda],…, [Weitz] but slow for dense Ind Sets. [R.]

Dense Weighted Independent Sets Sparse Fast Phase Transition Slow

Why? n 2 /2   (n 2 /2-n/2)  “Even” “Odd” #R/#B

Summary Where How What When Why

Summary Where How What When Why Algebra Algorithms Combinatorics

Summary Where How What When Why Algebra Algorithms Combinatorics Geometry Probability Physics

Summary Where How What When Why Algebra Algorithms Combinatorics Geometry Probability Physics Chemistry Nanotechnology Biology

THANK YOU ! Math

THANK YOU ! Math+ CS

THANK YOU ! Math+ CS + Biology, Chemistry,

THANK YOU ! + Physics, Nanotechnology,... Math+ CS + Biology, Chemistry,

THANK YOU !