Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
Next revisionBoth sides next revision
start [2024/04/11 11:18] – 139.124.146.3start [2024/04/30 22:51] – 139.124.146.3
Line 21: Line 21:
  
 ==== Upcoming talks ====  ==== Upcoming talks ==== 
 +
 +
 +**May 14 2024: [[https://dblp.org/pid/10/10715.html|Josef Rukavicka]]** //Restivo Salemi property for $\alpha$-power free languages with $\alpha \geq 5$ and $k \geq 3$ letters//
 +
 +In 2009, Shur published the following conjecture: Let $L$ be a power-free language and let $e(L)\subseteq L$ be the set of words of $L$ that can be extended to a bi-infinite word respecting the given power-freeness. If $u,v \in e(L)$ then $uwv \in e(L)$ for some word $w$. Let $L_{k,\alpha}$ denote an $\alpha$-power free language over an alphabet with $k$ letters, where $\alpha$ is a positive rational number and $k$ is positive integer. We prove the conjecture for the languages $L_{k,\alpha}$, where $\alpha\geq 5$ and $k \geq 3$.
 +
 +https://arxiv.org/abs/2312.10061
 +
 +**May 28 2024: [[https://www.lirmm.fr/~ochem/|Pascal Ochem]]**
 +
 +**June 11 2024: [[https://mwhiteland.github.io/|Markus Whiteland]]**
 +
 +**June 25 2024: [[http://iml.univ-mrs.fr/~cassaign/|Julien Cassaigne]]**
 +
 +**July 9 2024: [[https://scholar.google.com.au/citations?user=C_02gXUAAAAJ&hl=en|Jamie Simpson]]**
 +
 +
 +==== Past talks 2024 ====
 +
 +
 +**April 30 2024: [[https://www.math.uni-bielefeld.de/baake/|Michael Baake]]** //Hats, CAPs and Spectres//
 +
 +{{ seminar2024:20240430baake.pdf |slides}}
 +
 +{{ seminar2024:20240430baake.mp4 |video of the talk}}
 +
 +The recently discovered Hat is an aperiodic
 +monotile for the Euclidean plane, which needs a reflected
 +version for this property. The Spectre does not have this
 +(tiny) deficiency. We discuss the topological and dynamical
 +properties of the Hat tiling, how the CAP relates to it, and
 +what the long-range order of both tilings is. Finally, we
 +briefly describe the analogous structure for the Spectre tiling.
 +
 +
  
 **April 16 2024: [[https://dblp.org/pid/215/5120.html|Radosław Piórkowski]]** //Universal quantification in automatic structures—an ExpSpace-hard nut to crack// **April 16 2024: [[https://dblp.org/pid/215/5120.html|Radosław Piórkowski]]** //Universal quantification in automatic structures—an ExpSpace-hard nut to crack//
 +
 +{{ seminar2024:20240416piorkowski.mp4 |video of the talk}}
  
 Automatic structures are structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure is decidable.  Automatic structures are structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure is decidable. 
Line 38: Line 75:
 Keywords: automatic structures, universal projection, tiling problems, state complexity. Keywords: automatic structures, universal projection, tiling problems, state complexity.
  
-**April 30 2024: [[https://www.math.uni-bielefeld.de/baake/|Michael Baake]]** 
- 
-**May 14 2024: [[https://dblp.org/pid/10/10715.html|Josef Rukavicka]]** 
- 
-**May 28 2024: [[https://www.lirmm.fr/~ochem/|Pascal Ochem]]** 
- 
-**June 11 2024: [[https://mwhiteland.github.io/|Markus Whiteland]]** 
- 
-**June 25 2024: [[http://iml.univ-mrs.fr/~cassaign/|Julien Cassaigne]]** 
- 
-**July 9 2024: [[https://scholar.google.com.au/citations?user=C_02gXUAAAAJ&hl=en|Jamie Simpson]]** 
- 
- 
-==== Past talks 2024 ==== 
  
 **April 2 2024: John Campbell** // On the evaluation of infinite products involving automatic sequences// **April 2 2024: John Campbell** // On the evaluation of infinite products involving automatic sequences//