From 2e583339a7315eee5463cdcc00561719084c649d Mon Sep 17 00:00:00 2001 From: mwinter Date: Wed, 4 Oct 2023 10:40:40 +0200 Subject: [PATCH] hdp page update based on Gaetan suggestions --- .../pages/a_history_of_the_domino_problem.vue | 40 ++++++++++++------- 1 file changed, 26 insertions(+), 14 deletions(-) diff --git a/portfolio-nuxt/pages/a_history_of_the_domino_problem.vue b/portfolio-nuxt/pages/a_history_of_the_domino_problem.vue index 4d5e6bd..db2d9d8 100644 --- a/portfolio-nuxt/pages/a_history_of_the_domino_problem.vue +++ b/portfolio-nuxt/pages/a_history_of_the_domino_problem.vue @@ -70,7 +70,7 @@ The tilings sonified and visualized in a history of the domino problem are rare because there is no systematic way to find them. This is due to the fact that they are aperiodic. One can think of an aperiodic tiling as an infinite puzzle with a peculiar characteristic: given unlimited copies of dominoes with a finite set of color/pattern combinations for the edges, on can form a tiling that expands infinitely. However, in that solution, any repeating structure in the tiling will eventually be interrupted. This phenomenon is one of the most intriguing aspects of the work. As the music and the visuals are derived from the tilings, the resulting textures are always shifting ever so slightly.

- The original Domino Problem asked if there exists an algorithm/computer program that, when given as input a finite set of dominoes with varying color combinations for the edges, can output a binary answer, `yes' or `no', whether or not copies of that set can form an infinite tiling. The problem was first posed by Hao Wang in 1961, who conjectured that the answer is positive and that such an algorithm does exist. The existence of aperiodic tilings would mean that such an algorithm does not exist. However, in 1966, his student, Robert Berger, proved him wrong by discovering an infinite, aperiodic tiling constructed with copies of a set of 20,426 dominoes. The resolution of Wang's original question led to new questions and mathematicians took on the challenge of finding the smallest set of dominoes that would construct an infinite aperiodic tiling. Over the past 60 years, this number has been continually reduced with the contributions of many different mathematicians until the most recent discovery of a set of 11 dominoes along with a proof that no smaller sets exist. It is a remarkable narrative/history of a particular epistemological problem that challenged a group of people not only to solve it, but to understand it to the extent possible. + The original Domino Problem asked if there exists an algorithm/computer program that, when given as input a finite set of dominoes with varying color combinations for the edges, can output a binary answer, `yes' or `no', whether or not copies of that set can form an infinite tiling. The problem was first posed by Hao Wang in 1961, who conjectured that the answer is positive and that such an algorithm does exist. The existence of aperiodic tilings would mean that such an algorithm does not exist. However, in 1964, his student, Robert Berger, proved him wrong by discovering an infinite, aperiodic tiling constructed with copies of a set of 20,426 dominoes. The resolution of Wang's original question led to new questions and mathematicians took on the challenge of finding the smallest set of dominoes that would construct an infinite aperiodic tiling. Over the past 60 years, this number has been continually reduced with the contributions of many different mathematicians until the most recent discovery of a set of 11 dominoes along with a proof that no smaller sets exist. It is a remarkable narrative/history of a particular epistemological problem that challenged a group of people not only to solve it, but to understand it to the extent possible.

@@ -79,6 +79,10 @@
a few thoughts on how things fit together...
+
+ (free entrance) +
+
in collaboration with MAREIKE YIN-YEE LEE
@@ -92,43 +96,50 @@ Exact Gallery hours to be announced soon!
- Lichthof Ost, HU Berlin, Campus Mitte, Unter den Linden 6, U Bahn Unter den Linden oder Museuminsel + Lichthof Ost, HU Berlin Hauptgebäude, Campus Mitte, Unter den Linden 6 (U-Bahn Unter den Linden oder Museuminsel)
- Exhibition Opening - 17 Nov 2023 | 19 Uhr + Exhibition Opening - 17 Nov 2023 | 19 Uhr
- Lichthof Ost, HU Berlin, Campus Mitte, Unter den Linden 6, U Bahn Unter den Linden oder Museuminsel + Lichthof Ost, HU Berlin Hauptgebäude, Campus Mitte, Unter den Linden 6 (U-Bahn Unter den Linden oder Museuminsel)
- Exhibition Closing - 31 Nov 2023 | 19 Uhr + Exhibition Closing - 31 Nov 2023 | 19 Uhr
- Lichthof Ost, HU Berlin, Campus Mitte, Unter den Linden 6, U Bahn Unter den Linden oder Museuminsel + Lichthof Ost, HU Berlin Hauptgebäude, Campus Mitte, Unter den Linden 6 (U-Bahn Unter den Linden oder Museuminsel)
- Lecture-Concert + Public lecture + Concert (free entrance)
- with mathematician JARKKO KARI moderated by GAETAN BOROT + with Prof. JARKKO KARI (Turku University), moderated by Prof. Dr. GAËTAN BOROT (HU Berlin)
performance by KALI ENSEMBLE
22 Nov 2023 | 19:30 Uhr
- Reuter-Saal, HU Berlinm Universitätsgebäude am Hegelplatz, Dorotheentsraße 24, U Bahn Unter den Linden oder Museuminsel + Fritz-Reuter-Saal, HU Berlin Universitätsgebäude (am Hegelplatz), Dorotheentsraße 24 (U-Bahn Unter den Linden oder Museuminsel)
- Concert + Concert
performance by KALI ENSEMBLE
23 Nov 2023 | 20 Uhr
- KM28 + KM28 +
+ Karl-Marx-Str. 28, 12043 Berlin (U-Bahn Karl-Marx-Platz) +
+
+
+ From Wang Tiles to the Domino Problem: A Tale of Aperiodicity +

- Karl-Marx-Str. 28, 12043 Berlin, U Bahn Karl-Marx-Platz + This presentation delves into the remarkable history of aperiodic tilings and the domino problem. Aperiodic tile sets refer to collections of tiles that can only tile the plane in a non-repeating, or non-periodic, manner. Such sets were not believed to exist until 1964 when R. Berger introduced the first aperiodic set consisting of an astonishing 20,426 Wang tiles. Over the years, ongoing research led to significant advancements, culminating in 2015 with the discovery of a mere 11 Wang tiles by E. Jeandel and M. Rao, alongside a computer-assisted proof of their minimality. Simultaneously, researchers found even smaller aperiodic sets composed of polygon-shaped tiles. Notably, Penrose's kite and dart tiles emerged as early examples, and most recently, a groundbreaking discovery was made - a solitary aperiodic tile known as the "hat" that can tile the plane exclusively in a non-periodic manner. Aperiodic tile sets are intimately connected with the domino problem that asserts how certain tile sets can tile the plane without us ever being able to establish their tiling nature with absolute certainty. Moreover, aperiodic tilings hold a distinct visual aesthetic allure. In today's musical presentation, their artistic appeal transcends the visual domain and extends into the realm of music. -Jarkko Kari
@@ -171,15 +182,16 @@
- Jarkko J. Kari is a Finnish mathematician and computer scientist, known for his contributions to the theory of Wang tiles and cellular automata. Kari is currently a professor at the Department of Mathematics, University of Turku. + Jarkko Kari received his MSc and PhD degrees in mathematics from the University of Turku in Finland in 1986 and 1990, respectively. He then worked for the Academy of Finland, and for Iterated Systems Inc. and the University of Iowa in the USA. Since year 2000 he has been a professor of mathematics at the University of Turku. His research interests include automata theory and the theory of computation, with emphasis on cellular automata, tilings and symbolic dynamics. Jarkko Kari has supervised twelve PhD theses, published over one hundred peer reviewed research articles and edited twenty conference proceedings and special issues on these topics. He serves in the editorial boards of eight scientific journals, and is currently a co-editor-in-chief of the journal Natural Computing. Jarkko Kari is a member of the Finnish Academy of Science and Letters since 2014.
- Gaetan Borot - mathematician | organizer | moderator + Gaëtan Borot - mathematician | organizer | moderator
+ Gaëtan Borot was trained at École Normale Supérieure (Paris) in theoretical physicist and progressively moved to pure mathematics. He received his PhD from Universite d'Orsay / CEA Saclay in 2011. After a postdoctorate in Geneva and a visiting scholarship at MIT, he worked as a Group Leader at the Max Planck Institute for Mathematics in Bonn. Since 2020, he holds a bridge professorship between the Institute of Mathematics and the Institute of Physics of the Humboldt University of Berlin. He has worked on enumerative geometry, combinatorics, random matrix theory and mathematical aspects of quantum field theory, and likes to investigate the unexpected relations between seemingly different problems. He is also interested in scientific outreach.