Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
start [2024/01/24 09:13] – 139.124.146.3 | start [2024/04/30 14:50] – 139.124.146.3 | ||
---|---|---|---|
Line 15: | Line 15: | ||
[[http:// | [[http:// | ||
[[https:// | [[https:// | ||
- | [[https://sites.google.com/ | + | [[https://www.manon-stipulanti.be/|Manon Stipulanti]], |
If you are interested in giving a talk, you are welcome to contact Narad Rampersad and Manon Stipulanti. | If you are interested in giving a talk, you are welcome to contact Narad Rampersad and Manon Stipulanti. | ||
Line 23: | Line 23: | ||
+ | **April 30 2024: [[https:// | ||
- | **February 6 2024: Eric Rowland/ | + | 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. | ||
- | **February 20 2024: [[https:// | ||
- | **March 5 2024: [[https://finnlidbetter.com/|Finn Lidbetter]]** | + | **May 14 2024: [[https:// |
+ | |||
+ | 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, | ||
+ | |||
+ | https:// | ||
+ | |||
+ | **May 28 2024: [[https://www.lirmm.fr/ | ||
+ | |||
+ | **June 11 2024: [[https:// | ||
+ | |||
+ | **June 25 2024: [[http:// | ||
+ | |||
+ | **July 9 2024: [[https:// | ||
+ | |||
+ | |||
+ | ==== Past talks 2024 ==== | ||
+ | |||
+ | **April 16 2024: [[https:// | ||
+ | |||
+ | {{ seminar2024: | ||
+ | |||
+ | 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. | ||
+ | |||
+ | While existential quantifiers can be eliminated in linear time by application of a homomorphism, | ||
+ | We answer this question negatively. | ||
+ | |||
+ | In my talk, following a short introduction to the field of automatic structures, I will present the construction of a family of NFA representing automatic relations for which the minimal NFA recognising the language after a universal projection step is doubly exponential, | ||
+ | |||
+ | |||
+ | Based on the paper: https:// | ||
+ | |||
+ | Authors: Christoph Haase, R.P. | ||
+ | |||
+ | Keywords: automatic structures, universal projection, tiling problems, state complexity. | ||
- | **March 19 2024: [[https:// | ||
**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// | ||
+ | |||
+ | {{ seminar2024: | ||
+ | |||
+ | {{ seminar2024: | ||
+ | |||
We explore and discuss some recently introduced techniques concerning the evaluation of infinite products involving automatic sequences. | We explore and discuss some recently introduced techniques concerning the evaluation of infinite products involving automatic sequences. | ||
- | **April 16 2024: [[https:// | ||
- | **April 30 2024: [[https://www.math.uni-bielefeld.de/baake/|Michael Baake]]** | + | **March 19 2024: [[https://diamweb.ewi.tudelft.nl/~cork/|Cor Kraaikamp]]** //An introduction to $N$-expansions with a finite set of digits// |
- | **May 14 2024: [[https:// | + | {{ seminar2024:20240319kraaikamp.pdf |slides}} |
- | **May 28 2024: [[https:// | + | {{ seminar2024: |
+ | |||
+ | |||
+ | In this talk $N$-expansions, | ||
+ | of digits, will be introduced. Although $N$-expansions were introduced as | ||
+ | recent as 2008 by Ed Burger and some of his students, quite a number of | ||
+ | papers have appeared on these variations of the regular continued fraction | ||
+ | expansion. By choosing a domain for the underlying Gauss-map which does | ||
+ | not contain the origin, a continued fraction with finitely many digits was | ||
+ | introduced by Niels Langeveld in his MSc-thesis. It turns out that these | ||
+ | continued fraction algorithms exhibit a very complicated and surprising rich | ||
+ | dynamical behavior. | ||
+ | |||
+ | This talk is based on joint work with Yufei Chen (Shanghai, Delft), Jaap | ||
+ | de Jonge (UvA, Amsterdam), Karma Dajani (Utrecht), Niels Langeveld | ||
+ | (Montan U., Leoben), Hitoshi Nakada (Keio, Yokohama), and Niels van der | ||
+ | Wekken (Netcompany). | ||
+ | |||
+ | **March 5 2024: [[https:// | ||
+ | |||
+ | {{ seminar2024: | ||
+ | |||
+ | {{ seminar2024: | ||
+ | |||
+ | |||
+ | Let $S$ be a finite subset of $\mathbb{Z}^n$. A vector | ||
+ | sequence $(z_i)$ is an $S$-walk if and only if $z_{i+1}-z_i$ is an | ||
+ | element of $S$ for all $i$. Gerver and Ramsey showed in 1979 that for | ||
+ | $S\subset\mathbb{Z}^3$ there exists an infinite $S$-walk in which no | ||
+ | $5^{11}+1=48, | ||
+ | approach, but with the aid of a computer search, we show how to | ||
+ | improve the bound to $189$. We begin by restating the infinite | ||
+ | $S$-walk as the fixed point of iterating a morphism defined for a $12$ | ||
+ | letter alphabet. | ||
+ | |||
+ | |||
+ | **February 20 2024: [[https:// | ||
+ | |||
+ | {{ seminar2024: | ||
+ | |||
+ | {{ seminar2024: | ||
+ | |||
+ | |||
+ | For a $\mathbb Z^d$ topological dynamical system $(X, T, \mathbb Z^d)$, an isomorphism is a self-homeomorphism $\phi : X\to X$ such that for some matrix $M \in GL(d, \mathbb Z)$ and any $n \in \mathbb Z^d$, $\phi \circ T^n = T^{M_n} \circ \phi$, where $T^n$ denote the self-homeomorphism of $X$ given by the action of $n \in \mathbb Z^d$. The collection of all the isomorphisms forms a group that is the normalizer of the set of transformations $T^n$. In the one-dimensional case isomorphisms correspond to the notion of flip conjugacy of dynamical systems and by this fact are also called reversing symmetries. | ||
+ | |||
+ | These isomorphisms are not well understood even for classical systems. In this talk we will present a description of them for odometers and more precisely for $\mathbb Z^2$-constant base odometers, that is not simple. We deduce a complete description of the isomorphism of some $\mathbb Z^2$ minimal substitution subshifts. Thanks to this, we will give the first known example of a minimal zero-entropy subshift with the largest possible normalizer group. | ||
+ | This is a joint work with Samuel Petite (Universitè de Picardie Jules Verne). | ||
+ | |||
+ | |||
+ | |||
+ | **February 6 2024: [[https:// | ||
+ | |||
+ | {{ seminar2024: | ||
+ | |||
+ | {{ seminar2024: | ||
+ | |||
+ | |||
+ | A theorem of Christol gives a characterization of automatic sequences over a finite field: a sequence is automatic if and only if its generating series is algebraic. Since there are two representations for such a sequence -- as an automaton and as a bivariate polynomial -- a natural question is how the size of one representation relates to the size of the other. Bridy used tools from algebraic geometry to bound the size of the minimal automaton in terms of the size of the minimal polynomial. We have a new proof of Bridy' | ||
- | **June 11 2024: [[https:// | ||
- | ==== Past talks 2024 ==== | ||
**January 23 2024: [[https:// | **January 23 2024: [[https:// |