low complexity tilings of the plane
play

Low complexity Tilings of the Plane Jarkko Kari Department of - PowerPoint PPT Presentation

Oct 20, 2022 •213 likes •1.06k views

Low complexity Tilings of the Plane Jarkko Kari Department of Mathematics and Statistics University of Turku, Finland We study how local constraints enforce global regularities This is a common phenomenon is sciences. For example, formation of

  1. Low complexity Tilings of the Plane Jarkko Kari Department of Mathematics and Statistics University of Turku, Finland

  2. We study how local constraints enforce global regularities This is a common phenomenon is sciences. For example, formation of crystals: Atoms attach to each other in a limited number of ways = ⇒ periodic arrangement of the atoms

  3. Our goal is to understand fundamental underlying principles that connect local rules to the global regularities observed in the structures. Our setup: multidimensional symbolic dynamics (=tilings)

  4. Configurations are infinite d -dimensional grids of symbols.

  5. For a fixed finite shape D , we observe the D -patterns in the configuration.

  6. For a fixed finite shape D , we observe the D -patterns in the configuration.

  7. For a fixed finite shape D , we observe the D -patterns in the configuration.

  8. For a fixed finite shape D , we observe the D -patterns in the configuration.

  9. For a fixed finite shape D , we observe the D -patterns in the configuration.

  10. A quantity to measure local complexity: the pattern complexity P ( c, D ) = number of D -patterns in c .

  11. We call c a low complexity configuration if P ( c, D ) ≤ | D | for some finite D ⊆ Z 2 .

  12. Configuration c is periodic if it is invariant under a non-zero translation.

  13. Configuration c is two-periodic if it is invariant under non-zero translations in two different directions. This implies periodicity in every rational direction.

  14. Open problem: Nivat’s conjecture Consider d = 2 and rectangular D . Conjecture (Nivat 1997) If c has low complexity with respect to some rectangle then c is periodic.

  15. Open problem: Nivat’s conjecture Consider d = 2 and rectangular D . Conjecture (Nivat 1997) If c has low complexity with respect to some rectangle then c is periodic. This would extend the one-dimensional case d = 1: Morse-Hedlund theorem: Let c ∈ A Z and n ∈ N . If c has at most n distinct subwords of length n then c is periodic.

  16. Best known general bound in 2D: Theorem (Cyr, Kra): If P ( c, D ) ≤ 1 2 | D | for some rectangle D then c is periodic.

  17. In 3D and higher dimensional cases the conjecture is false Non-periodic c

  18. In 3D and higher dimensional cases the conjecture is false Non-periodic c D is n × n × n cube

  19. In 3D and higher dimensional cases the conjecture is false Non-periodic c D is n × n × n cube P ( c, D ) = 1 + . . .

  20. In 3D and higher dimensional cases the conjecture is false Non-periodic c D is n × n × n cube P ( c, D ) = 1 + n 2 + . . .

  21. In 3D and higher dimensional cases the conjecture is false Non-periodic c D is n × n × n cube P ( c, D ) = 1 + n 2 + n 2

  22. In 3D and higher dimensional cases the conjecture is false Non-periodic c D is n × n × n cube P ( c, D ) = 1 + n 2 + n 2 < n 3 = | D | for large n .

  23. Patterns − → Configurations: Given a set P of allowed D -patterns, the collection X P of all configurations whose D -patterns are allowed is the subshift of finite type (SFT) defined by P .

  24. Patterns − → Configurations: Given a set P of allowed D -patterns, the collection X P of all configurations whose D -patterns are allowed is the subshift of finite type (SFT) defined by P .

  25. Patterns − → Configurations: Given a set P of allowed D -patterns, the collection X P of all configurations whose D -patterns are allowed is the subshift of finite type (SFT) defined by P .

  26. Patterns − → Configurations: Given a set P of allowed D -patterns, the collection X P of all configurations whose D -patterns are allowed is the subshift of finite type (SFT) defined by P .

  27. Famous result by R.Berger (1962): • Undecidability of the domino problem : It is undecidable if a given SFT is empty. • There exist aperiodic SFTs : non-empty SFTs that only contain non-periodic configurations.

  28. Famous result by R.Berger (1962): • Undecidability of the domino problem : It is undecidable if a given SFT is empty. • There exist aperiodic SFTs : non-empty SFTs that only contain non-periodic configurations. We are interested in the analogous problems restricted to low complexity SFTs , where the number of allowed D -patterns is at most | D | .

  29. We study configuration c using algebra, so we first replace symbols by integers:

  30. We study configuration c using algebra, so we first replace symbols by integers: 0 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 0 1 1 0 1 0 1

  31. 0 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 0 1 1 0 1 0 1 D -patterns are viewed as | D | -dimensional vectors.

  32. 0 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 0 1 1 0 1 0 1 D -patterns are viewed as | D | -dimensional vectors. (1 , 1 , 1 , 0)

  33. 0 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 0 1 1 0 1 0 1 D -patterns are viewed as | D | -dimensional vectors. (1 , 1 , 1 , 0) (1 , 1 , 0 , 1)

  34. 0 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 0 1 1 0 1 0 1 D -patterns are viewed as | D | -dimensional vectors. (1 , 1 , 1 , 0) (1 , 1 , 0 , 1) (0 , 0 , 1 , 0)

  35. 0 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 0 1 1 0 1 0 1 D -patterns are viewed as | D | -dimensional vectors. (1 , 1 , 1 , 0) (1 , 1 , 0 , 1) (0 , 0 , 1 , 0) (0 , 0 , 1 , 1)

  36. 0 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 0 1 1 0 1 0 1 • If P ( c, D ) < | D | then there is a vector orthogonal to all D -patterns of c . Indeed: the number P ( c, D ) of distinct vectors is less than the dimension | D | of the linear space.

  37. 0 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 0 1 1 0 1 0 1 • If P ( c, D ) < | D | then there is a vector orthogonal to all D -patterns of c . • Even if P ( c, D ) = | D | there is a vector with constant inner product with all D -patterns of c .

  38. 0 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 0 1 1 0 1 0 1  (1 , 1 , 1 , 0)     (1 , 1 , 0 , 1)   ⊥ (1 , − 1 , 0 , 0) (0 , 0 , 1 , 0)      (0 , 0 , 1 , 1) 

  39. 0 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 1 1 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1 0 1 1 0 1 0 1  (1 , 1 , 1 , 0)     (1 , 1 , 0 , 1)   ⊥ (1 , − 1 , 0 , 0) (0 , 0 , 1 , 0)    1   (0 , 0 , 1 , 1)  -1 0 0

  40. Further algebraization: represent configuration c as a formal Laurent power series (negative exponents included). 0 1 0 1 1 1 0 1 1 0 0 1 1 0 1 1 1 0 1 0 1 0 1 0 1 � c ( i, j ) x i y j c ← → ( i,j ) ∈ Z 2

  41. Further algebraization: represent configuration c as a formal Laurent power series (negative exponents included). 2 -1 1 2 -2 2 0 2 2 0 x y 2 1 x y 0 x y 1 x y 1 x y 1 2 0 1 -2 1 1 1 -1 1 0 x y 1 x y 1 x y 1 x y 0 x y 0 0 1 0 2 0 0 -2 -1 0 1 x y 0 x y 1 x y 1 x y 0 x y -2 -1 -1 -1 -1 1 -1 2 0 -1 1 x y 1 x y 0 x y 1 x y 0 x y -2 1 -2 -1 -2 -2 -2 0 2 -2 1 x y 0 x y 0 x y 1 x y 1 x y � c ( i, j ) x i y j c ← → ( i,j ) ∈ Z 2

  42. Further algebraization: represent configuration c as a formal Laurent power series (negative exponents included). 2 -1 1 2 -2 2 0 2 2 0 x y 2 ...+ + + + + 1 x y 0 x y 1 x y +... 1 x y 1 2 0 1 -2 1 1 1 -1 1 ...+ + + + + 0 x y +... 1 x y 1 x y 1 x y 0 x y 0 0 1 0 2 0 0 -2 -1 0 1 x y 0 x y + + + + 1 x y ...+ 1 x y +... 0 x y -2 -1 -1 -1 -1 1 -1 2 0 -1 + + + ...+ 1 x y 1 x y +... 0 x y 1 x y 0 x y + -2 1 -2 -1 -2 -2 -2 0 2 -2 ...+ 1 x y 0 x y 0 x y + + 1 x y + + 1 x y +... � c ( i, j ) x i y j c ← → ( i,j ) ∈ Z 2

  43. � c I X I c ( X ) = I ∈ Z 2 Notations • X = ( x, y ) • For I = ( i, j ) ∈ Z 2 we denote by X I = x i y j the monomial that represents cell I .

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Software to Produce Fractal Tilings of the Plane University of Wollongong Dr. Samuel Webster and

Software to Produce Fractal Tilings of the Plane University of Wollongong Dr. Samuel Webster and

Michael Mampusti Software to Produce Fractal Tilings of the Plane University of Wollongong Dr. Samuel Webster and Dr. Michael Whittaker Why make Fractal Tilings? they look so awesome! aperiodic tilings are hard to construct. We can build

670 views • 31 slides
A matrix model for counting plane partitions and tilings Bertrand Eynard, IPHT CEA-SACLAY

A matrix model for counting plane partitions and tilings Bertrand Eynard, IPHT CEA-SACLAY

A matrix model for counting plane partitions and tilings Bertrand Eynard, IPHT CEA-SACLAY STATCOMB, Dimer models and random tilings, oct. 2009 &quot; ! B. Eynard, IPHT-CEA-SACLAY Matrix models and tilings Introduction B. Eynard,

1.17k views • 57 slides
Domino tilings, lattice paths and plane overpartitions Sylvie Corteel LIAFA, CNRS et Universit

Domino tilings, lattice paths and plane overpartitions Sylvie Corteel LIAFA, CNRS et Universit

Domino tilings, lattice paths and plane overpartitions Sylvie Corteel LIAFA, CNRS et Universit e Paris Diderot Etat de la recherche SMF - October 5th, 2009 Aztec diamond Aztec diamond of order n : 4 staircase of height n glued together.

424 views • 41 slides
Exactly solvable models of tilings and LittlewoodRichardson coefficients P. Zinn-Justin

Exactly solvable models of tilings and LittlewoodRichardson coefficients P. Zinn-Justin

Introduction Lozenge tilings and Schur functions Square-triangle-rhombus tilings and LR coefficients Inhomogeneities and equivariance Conclusion and prospects Exactly solvable models of tilings and LittlewoodRichardson coefficients P.

864 views • 63 slides
Fractal Tilings Katie Moe and Andrea Brown December 13, 2006 Introduction Examples of Fractal

Fractal Tilings Katie Moe and Andrea Brown December 13, 2006 Introduction Examples of Fractal

Introduction Examples of Fractal Tilings Creating the Tilings Tiles with Radial Symmetry Similarity Maps Variations Fractal Tilings Katie Moe and Andrea Brown December 13, 2006 Introduction Examples of Fractal Tilings Creating the Tilings

769 views • 27 slides
Fixed point aperiodic tilings Bruno Durand, Andrei Romashchenko, Alexander Shen LIF Marseille,

Fixed point aperiodic tilings Bruno Durand, Andrei Romashchenko, Alexander Shen LIF Marseille,

Fixed point aperiodic tilings Bruno Durand, Andrei Romashchenko, Alexander Shen LIF Marseille, CNRS &amp; Univ. AixMarseille, France AMS meeting, Jan. 2009 Tiles and tilings Tiles and tilings Tile set: 1 2 Tiles and tilings Tile set:

853 views • 57 slides
Lets count: Domino tilings Christopher R. H. Hanusa Queens College, CUNY 2 n 3 n n n

Lets count: Domino tilings Christopher R. H. Hanusa Queens College, CUNY 2 n 3 n n n

Lets count: Domino tilings Christopher R. H. Hanusa Queens College, CUNY 2 n 3 n n n Aztec Domino Tilings Today well discuss domino tilings, where: Our board is made up of squares. Our dominoes have no spots and all look

1.36k views • 122 slides
Jarkko Kari Mathematics Department, University of Turku, Finland In the Euclidean plane E 2 , the

Jarkko Kari Mathematics Department, University of Turku, Finland In the Euclidean plane E 2 , the

A small strongly aperiodic tile set in H 2 Jarkko Kari Mathematics Department, University of Turku, Finland In the Euclidean plane E 2 , the term aperiodicity refers to the property that a tile set admits valid tilings, but no such tiling is

1.13k views • 73 slides
Embedding computations in tilings (Part 1: fixed point tilings) Andrei Romashchenko 31 May 2016

Embedding computations in tilings (Part 1: fixed point tilings) Andrei Romashchenko 31 May 2016

Embedding computations in tilings (Part 1: fixed point tilings) Andrei Romashchenko 31 May 2016 1 / 18 What is a tile ? 2 / 18 What is a tile ? In this mini-course: Color: an element of a finite set C = { , , , , , , } 2 /

823 views • 42 slides
On the Classification of Brane Tilings John Davey Amihay Hanany, Jurgis Pasukonis Z urich,

On the Classification of Brane Tilings John Davey Amihay Hanany, Jurgis Pasukonis Z urich,

Brane Tilings for D3 branes Brane Tilings for M2 branes Our Algorithm Tilings Generated Conclusion On the Classification of Brane Tilings John Davey Amihay Hanany, Jurgis Pasukonis Z urich, September 11, 2009 John Davey Amihay Hanany,

821 views • 29 slides
linear spaces of tilings Richard Kenyon (Brown University) Thursday, May 12, 16 Rectangle tilings

linear spaces of tilings Richard Kenyon (Brown University) Thursday, May 12, 16 Rectangle tilings

linear spaces of tilings Richard Kenyon (Brown University) Thursday, May 12, 16 Rectangle tilings come in linear families (polytopes) y 2 2 y 1 x 2 x 3 x 1 y 1 &lt; y 2 { P x 1 &lt; x 2 , x 3 Thursday, May 12, 16 GUE minors Given such a

578 views • 20 slides
4. Coordinate geometry A special kind of geometry where the position of points on the plane is

4. Coordinate geometry A special kind of geometry where the position of points on the plane is

D AY 107 A RECTANGLE AND A SQUARE ON THE X - Y PLANE I NTRODUCTION A plane figure in the x-y plane can resemble one of the common quadrilaterals we have come across, but that is not enough to show that the figure meets all the basic

1.45k views • 24 slides
If a plane cuts through a cone such that the plane is not parallel to the sliding side of the cone

If a plane cuts through a cone such that the plane is not parallel to the sliding side of the cone

D AY 138 E QUATION OF ELLIPSE I NTRODUCTION A plane cutting through a circular cone produces different shapes depending on the angle the plane makes with the circular cone. If the plane cuts across the cone such that it is not

811 views • 20 slides
Lozenge tilings and other lattice models via symmetric functions Greta Panova (University of

Lozenge tilings and other lattice models via symmetric functions Greta Panova (University of

Lozenge tilings Probability via Schur functions Free boundary 6-vertex/ASMs Dense loop model Lozenge tilings and other lattice models via symmetric functions Greta Panova (University of Pennsylvania) based on: V.Gorin, G.Panova,

872 views • 55 slides
ON THE COMPLEXITY OF BARRIER RESILIENCE FOR FAT REGIONS Matias Korman Maarten Lffler Rodrigo

ON THE COMPLEXITY OF BARRIER RESILIENCE FOR FAT REGIONS Matias Korman Maarten Lffler Rodrigo

ON THE COMPLEXITY OF BARRIER RESILIENCE FOR FAT REGIONS Matias Korman Maarten Lffler Rodrigo Silveira Darren Strash INTRODUCTION Let t be a desirable point in the plane. Let t be a desirable point in the plane. t Let t be a desirable point

1.45k views • 121 slides
Random tilings and representations of classical Lie groups Alexey Bufetov University of Bonn 21

Random tilings and representations of classical Lie groups Alexey Bufetov University of Bonn 21

Random tilings and representations of classical Lie groups Alexey Bufetov University of Bonn 21 November, 2019 Domino tilings of Aztec diamond The Aztec diamond of size n is the set of all lattice squares which are (fully) contained in { ( x ,

568 views • 31 slides
Function Approximation Wouter J. Den Haan London School of Economics by Wouter J. Den Haan c

Function Approximation Wouter J. Den Haan London School of Economics by Wouter J. Den Haan c

Function Approximation Wouter J. Den Haan London School of Economics by Wouter J. Den Haan c August 18, 2015 Overview Polynomial approximations Splines Extra Goal Obtain an approximation for f ( x ) when f ( x ) is unknown, but we

457 views • 30 slides
Scaling up rou-ng CSCI 466: Networks Keith Vertanen

Scaling up rou-ng CSCI 466: Networks Keith Vertanen

Scaling up rou-ng CSCI 466: Networks Keith Vertanen Fall 2011 Overview Last -me: Intradomain rou-ng Distance-vector (RIP,

606 views • 38 slides
PSNC's Optical Developments Artur Binczewski, Tomasz Szewczyk PSNC TERENA 3rd Network Architects

PSNC's Optical Developments Artur Binczewski, Tomasz Szewczyk PSNC TERENA 3rd Network Architects

PSNC's Optical Developments Artur Binczewski, Tomasz Szewczyk PSNC TERENA 3rd Network Architects Workshop PIONIER in the pill Area 312k sq km Population 38M Main academic

738 views • 25 slides
Matrix Multiplication Rasmus Pagh IT University of Copenhagen ITCS, January 10, 2012 1 Matrix

Matrix Multiplication Rasmus Pagh IT University of Copenhagen ITCS, January 10, 2012 1 Matrix

Matrix Multiplication Rasmus Pagh IT University of Copenhagen ITCS, January 10, 2012 1 Matrix Multiplication Rasmus Pagh IT University of Copenhagen ITCS, January 10, 2012 2 Outline Algorithm and analysis Related work Case

538 views • 27 slides
An extended procedure for extrapolation to the limit Work in progress, not yet finished Michela

An extended procedure for extrapolation to the limit Work in progress, not yet finished Michela

An extended procedure for extrapolation to the limit Work in progress, not yet finished Michela Redivo Zaglia University of Padua - Italy Claude Brezinski University of Lille - France The E algorithm The extended procedure Some

614 views • 23 slides
Team optimal decentralized state estimation Aditya Mahajan and Mohammad Afshari McGill

Team optimal decentralized state estimation Aditya Mahajan and Mohammad Afshari McGill

Team optimal decentralized state estimation Aditya Mahajan and Mohammad Afshari McGill University IEEE Conference on Decision and Control 19 December 2018 Lets revisit separation of estimation and control in centralized systems

977 views • 70 slides
Sign Flip Triangulation of the Amplituhedron Ryota Kojima SOKENDAI, KEK theory centor Based on

Sign Flip Triangulation of the Amplituhedron Ryota Kojima SOKENDAI, KEK theory centor Based on

Sign Flip Triangulation of the Amplituhedron Ryota Kojima SOKENDAI, KEK theory centor Based on RK, JHEP 1904 (2019) 085 arxiv:1812.01822 [hep-th] RK, Cameron Langer, Jaroslav Trnka and Minshan Zheng(UC Davis, QMAP), in progress Strings and

798 views • 26 slides
Optimality-based Domain Reductions for Global Optimization A. Caprara, M. Locatelli, M. Monaci

Optimality-based Domain Reductions for Global Optimization A. Caprara, M. Locatelli, M. Monaci

Optimality-based Domain Reductions for Global Optimization A. Caprara, M. Locatelli, M. Monaci Aussois, January 2013 M. Monaci (uniPD) Optimality-based Domain Reductions 1 / 22 Outline of the talk Settings: global optimization problems

858 views • 22 slides

More recommend