Differences

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

--- start [2024/01/24 09:12] – 139.124.146.3
+++ start [2024/04/30 22:51] (current) – 139.124.146.3
@@ Line 15: / Line 15: @@
 [[http://ion.uwinnipeg.ca/~nrampers/|Narad Rampersad]], University of Winnipeg,
 [[https://cs.uwaterloo.ca/~shallit/|Jeffrey O. Shallit]], University of Waterloo,
-[[https://sites.google.com/view/manonstipulanti/|Manon Stipulanti]], Université de Liège.
+[[https://www.manon-stipulanti.be/|Manon Stipulanti]], Université de Liège.
 If you are interested in giving a talk, you are welcome to contact Narad Rampersad and Manon Stipulanti.
@@ Line 23: / Line 23: @@
+**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//
-**February 6 2024: Eric Rowland/Reem Yassawi/Manon Stipulanti**
+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$.
-**February 20 2024: [[https://www.uliege.be/cms/c_9054334/fr/repertoire?uid=u240328|Christopher Cabezas]]**
+https://arxiv.org/abs/2312.10061
-**March 5 2024: [[https://finnlidbetter.com/|Finn Lidbetter]]**
-**March 19 2024: [[https://diamweb.ewi.tudelft.nl/~cork/|Cor Kraaikamp]]**
-**April 2 2024: John Campbell** // On 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://dblp.org/pid/215/5120.html|Radosław Piórkowski]]**
-**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]]**
@@ Line 46: / Line 33: @@
 **June 11 2024: [[https://mwhiteland.github.io/|Markus Whiteland]]**
-==== Past talks 2024 ====
+**June 25 2024: [[http://iml.univ-mrs.fr/~cassaign/|Julien Cassaigne]]**
-**January 23 2024: [[https://jakubmichalkonieczny.wordpress.com/|Jakub Konieczny]]** //Arithmetical subword complexity of automatic sequences//
+**July 9 2024: [[https://scholar.google.com.au/citations?user=C_02gXUAAAAJ&hl=en|Jamie Simpson]]**
-{{ seminar2024:20240123konieczny.pdf |slides}}
-{{ seminar2024:20240123konieczny.mp4 |video of the talk}}
+==== Past talks 2024 ====
-It is well-known that the subword complexity of an automatic sequence grows at most linearly, meaning that the number of length-$\ell$ subwords which appear in a given automatic sequence $a = (a(n))_n$ is at most $C \ell$ for a constant $C$ dependent only on $a$. In contrast, arithmetic subword complexity measures the number of subwords which appear along arithmetic progressions, and can grow exponentially even for very simple automatic sequences. Indeed, the classical Thue-Morse sequence has arithmetic subword complexity $2^{\ell}$, which is the maximal possible complexity for $\{0,1\}$-valued sequence.
+**April 30 2024: [[https://www.math.uni-bielefeld.de/baake/|Michael Baake]]** //Hats, CAPs and Spectres//
-Together with Jakub Byszewski and Clemens Müllner we obtained a decomposition result which allows us to express any (complex-valued) automatic sequence as the sum of a structured part, which is easy to work with, and a part which is pseudorandom or uniform from the point of view of higher order Fourier analysis. We now apply these techniques to the study of arithmetic subword complexity of automatic sequences. We show that for each automatic sequence $a$ there exists a parameter $r$ --- which we dub "effective alphabet size" --- such that the arithmetic subword complexity of $a$ is at least $r^{\ell}$ and at most $(r+o(1))^{\ell}$.
+{{ seminar2024:20240430baake.pdf |slides}}
-This talk is based on joint work with Jakub Byszewski and Clemens Müllner, and is closely related to the previous talk of Clemens Müllner at One World Combinatorics on Words Seminar.
+{{ 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.
-**January 9 2024: [[https://dmg.tuwien.ac.at/cmuellner/|Clemens Müllner]]** //Synchronizing automatic sequences along Piatetski-Shapiro sequences//
-{{ seminar2024:20240109muellner.pdf |slides}}
+**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:20240109muellner.mp4 |video of the talk}}
+{{ 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 sequences - that is, sequences computable by finite automata - have long been studied from the point of view of combinatorics on words. A notable property of these sequences is that their subword-complexity is at most linear. Avgustinovich, Fon-Der-Flaass and Frid introduced the notion of arithmetic subword-complexity - that is the number of different subwords of length $n$ that appear along some arithmetic progression.
+While existential quantifiers can be eliminated in linear time by application of a homomorphism, universal quantifiers are commonly eliminated via the identity ∀x. Φ ≡ ¬(∃x. ¬Φ). If Φ is represented in the standard way as an NFA, a priori this approach results in a doubly exponential blow-up. However, the recent literature has shown that there are classes of automatic structures for which universal quantifiers can be eliminated without this blow-up when treated as first-class citizens and not resorting to double complementation. The existing lower bounds for some classes of automatic structures show that a singly exponential blow-up is unavoidable when eliminating a universal quantifier, but it is not known whether there may be better approaches that avoid the naïve doubly exponential blow-up.
-They also showed that a special class of synchronizing automatic sequences have at most linear arithmetic subword-complexity and some other class of automatic sequences on the alphabet $\Sigma$ have maximal possible subword-complexity $|\Sigma|^n$.
+We answer this question negatively.
-Synchronizing automatic sequences can be efficiently approximated using periodic functions and are usually more structured than general automatic sequences. We discuss a recent result showing that the arithmetic (and even polynomial) subword-complexity of synchronizing automatic sequences grows subexponentially. This was a key result to show that the subword-complexity of synchronizing automatic sequences along regularly growing sequences (such as Piatetski-Shapiro sequences) grows subexponentially, which is in stark contrast to other automatic sequences such as the Thue-Morse sequence. Moreover, this was a key ingredient to obtain rather precise estimates for the arithmetic (and polynomial) subword-complexity of general automatic sequences.
+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, and deciding whether this language is empty is ExpSpace-complete.
-This is joint work with Jean-Marc Deshouillers, Michael Drmota, Andrei Shubin and Lukas Spiegelhofer.
-==== Archives 2023 ====
+Based on the paper: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.13
-The talks of 2023 are available [[2023|here]].
+Authors: Christoph Haase, R.P.
-==== Past talks 2023 ====
+Keywords: automatic structures, universal projection, tiling problems, state complexity.
-**December 19 2023: [[https://www.pierrebeaur.fr/|Pierre Béaur]]** //All I want for Christmas is an algorithm to detect a Sturmian word in an ω-regular language//
-{{ seminar2023:20231219beaur.pdf |slides}}
+**April 2 2024: John Campbell** // On the evaluation of infinite products involving automatic sequences//
-{{ seminar2023:20231219beaur.mp4 |video of the talk}}
+{{ seminar2024:20240402campbell.pdf |slides}}
-In the enchanting realm of CoWLand, where computer science wizards and mathematics enchanters gather via the magic of the Internet, a whimsical elf embarks us on a yuletide adventure. Our quest? To detect Sturmian words hidden in the snowy languages of ω-regular automata. As S-adic representations and discrete lines dance around the Christmas tree, I will present the mischevious magic of desubstitution and its algorithmic applications.
+{{ seminar2024:20240402campbell.mp4 |video of the talk}}
-I start from weak ω-automata, that is, labeled graphs that accept infinite words, and characterize when such automata accept a substitutive word, a  fixed point, or a Sturmian word. These methods are effective and provide an algorithm relying on S-adic representations. On the way, we find some other natural applications in combinatorics on words and discrete geometry. Then, I will explain how the methods translate from weak ω-automata to Büchi automata, what the limits of our techniques are, and what are the leads to give this fairytale a proper conclusion.
+We explore and discuss some recently introduced techniques concerning the evaluation of infinite products involving automatic sequences.
-**December 5 2023: [[https://www.lirmm.fr/~mrosenfeld/|Matthieu Rosenfeld]]** //Word reconstruction using queries on subwords or factors//
-{{ seminar2023:20231205rosenfeld.pdf |slides}}
+**March 19 2024: [[https://diamweb.ewi.tudelft.nl/~cork/|Cor Kraaikamp]]** //An introduction to $N$-expansions with a finite set of digits//
-{{ seminar2023:20231205rosenfeld.mp4 |video of the talk}}
+{{ seminar2024:20240319kraaikamp.pdf |slides}}
+{{ seminar2024:20240319kraaikamp.mp4 |video of the talk}}
-I will present some results that we recently obtained about word
-reconstruction problems. In this setting you can ask queries from a
-fixed family of queries about an unknown word $W$ and your goal is to
-reconstruct $W$ by asking the least possible number of queries. We study
-the question for 3 different families of queries:
-- "How many occurrences of $u$ in $W$ as a factor?", for any $u$;
-- "How many occurrences of $u$ in $W$ as a subword?", for any $u$;
-- "Does $u$ occur in $W$ as a subword?", for any $u$.
-Each of these cases had already been studied, and we improve the
+In this talk $N$-expansions, and in particular $N$-expansions with a finite set
-bounds for each of them.
+of digits, will be introduced. Although $N$-expansions were introduced as
-In particular, in the second case, you can ask queries about the
+recent as 2008 by Ed Burger and some of his students, quite a number of
-number of occurrences of any given subword. Fleischmann, Lejeune,
+papers have appeared on these variations of the regular continued fraction
-Manea, Nowotka and Rigo gave an algorithm that reconstructs any
+expansion. By choosing a domain for the underlying Gauss-map which does
-binary word $W$ of length $n$ in at most $n/2 +1$ queries. We prove that
+not contain the origin, a continued fraction with finitely many digits was
-$O((n log n)^{(1/2)})$ queries suffice. In this talk, I will provide a few
+introduced by Niels Langeveld in his MSc-thesis. It turns out that these
-necessary definitions and present our results.
+continued fraction algorithms exhibit a very complicated and surprising rich
+dynamical behavior.
-This is joint work with Gwenaël Richomme.
+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://finnlidbetter.com/|Finn Lidbetter]]** //Improved bound for the Gerver-Ramsey collinearity problem//
-**November 21 2023: [[https://www.researchgate.net/profile/Seda-Albayrak-3|Seda Albayrak]]** //Quantitative estimates for the size of an intersection of
+{{ seminar2024:20240305lidbetter.pdf |slides}}
-sparse automatic sets//
-{{ seminar2023:20231121albayrak.pdf |slides}}
+{{ seminar2024:20240305lidbetter.mp4 |video of the talk}}
-{{ seminar2023:20231121albayrak.mp4 |video of the talk}}
+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,828,126$ points are collinear. Using the same general
+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.
-In 1979, Erdős conjectured that for $k \ge 9$, $2^k$ is
-not the sum of distinct powers of $3$. That is, the set of powers of
-two (which is $2$-automatic) and the $3$-automatic set consisting of
-numbers whose ternary expansions omit $2$ has finite intersection. A
-theorem of Cobham (1969) says that if $k$ and $\ell$ are two
-multiplicatively independent natural numbers then a subset of the
-natural numbers that is both $k$- and $\ell$-automatic is eventually
-periodic.  A multidimensional extension of this theorem was later
-given by Semenov (1977).  Motivated by Erdős’ conjecture and in
-light of Cobham’s theorem, we give a quantitative version of the
-Cobham-Semenov theorem for sparse automatic sets, showing that the
-intersection of a sparse $k$-automatic subset of $\mathbb{N}^d$ and a
-sparse $\ell$-automatic subset of $\mathbb{N}^d$ is finite. Moreover,
-we give effectively computable upper bounds on the size of the
-intersection in terms of data from the automata that accept these
-sets.
+**February 20 2024: [[https://www.uliege.be/cms/c_9054334/fr/repertoire?uid=u240328|Christopher Cabezas]]** //Large normalizer of odometers and higher-dimensional automatic sequences//
-**November 7 2023: [[https://users.math-cs.spbu.ru/~puzynina/|Svetlana Puzynina]]** //Well distributed occurrences property in infinite words//
+{{ seminar2024:20240220cabezas.pdf |slides}}
-{{ seminar2023:20231107-puzynina.pdf |slides}}
+{{ seminar2024:20240220cabezas.mp4 |video of the talk}}
-{{ seminar2023:20231107-puzynina.mp4 |video of the talk}}
+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.
-We say that an infinite word $u$ on a $d$-ary alphabet has the well distributed occurrences  property if, for each factor $w$ of $u$, each positive integer $m$, and each vector $v\in {\mathbb Z}_m^d$, there is an occurrence of $w$ such that the Parikh vector of the prefix of $u$ preceding such occurrence is congruent to $v$ modulo $m$. In this talk we will discuss how aperiodic infinite words with well distributed occurrences can be used to produce aperiodic pseudorandom number generators with good statistical behavior. We study the well distributed occurrences property for certain families of  infinite words including words generated by morphisms, Sturmian words and Arnoux–Rauzy words. The talk is based on new and old results.
+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).
-**October 24 2023: [[https://www.researchgate.net/scientific-contributions/Herman-Goulet-Ouellet-2195681482|Herman Goulet-Ouellet]]** //Density of rational languages under invariant measures//
-{{ seminar2023:20231024goulet-ouellet.pdf |slides}}
+**February 6 2024: [[https://ericrowland.github.io/|Eric Rowland]]** //Algebraic power series and their automatic complexity//
-{{ seminar2023:20231024goulet-ouellet.mp4 |video of the talk}}
+{{ seminar2024:20240206rowland.pdf |slides}}
+{{ seminar2024:20240206rowland.mp4 |video of the talk}}
-The notion of density for languages was studied by Schützenberger in the 60s and by Hansel and Perrin in the 80s. In both cases, the authors focused on densities defined by Bernoulli measures. In this talk, I will present new results about densities of regular languages under invariant measures of minimal shift spaces. We introduce a compatibility condition which implies convergence of the density to a constant which depends only on the given rational language. This result can be seen as a form of equidistribution property. The compatibility condition can be stated either in terms of return words or of a skew product. The passage between the two forms is made more transparent using simple combinatorial tools inspired by ergodic theory and cohomology. This is joint work with Valérie Berthé, Carl-Fredrik Nyberg Brodda, Dominique Perrin and Karl Petersen.
+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's bound that works by converting algebraic sequences to diagonals of rational functions. Crucially for our interests, this approach can be adapted to work not just over a finite field but over the integers modulo a prime power. This is joint work with Manon Stipulanti and Reem Yassawi.
-**October 10 2023: [[https://kmlinux.fjfi.cvut.cz/~balkolub/|Ľubomíra Dvořáková]]** //String attractors and pseudopalindromic closures//
-{{ seminar2023:20231010dvorakova.pdf |slides}}
+**January 23 2024: [[https://jakubmichalkonieczny.wordpress.com/|Jakub Konieczny]]** //Arithmetical subword complexity of automatic sequences//
-{{ seminar2023:20231010dvorakova.mp4 |video of the talk}}
+{{ seminar2024:20240123konieczny.pdf |slides}}
-In this contribution we carry on a study of string attractors of important classes of sequences.
+{{ seminar2024:20240123konieczny.mp4 |video of the talk}}
-Attractors of minimum size of factors/prefixes/particular prefixes of the following sequences have been determined so far: Sturmian sequences (Mantaci, Restivo, Romana, Rosone, Sciortino, 2021, Dvořáková, 2022), episturmian sequences (Dvořáková, 2022), the Tribonacci sequence (Schaeffer and Shallit, 2021), the Thue-Morse sequence (Kutsukake, 2020, Schaeffer and Shallit, 2021, Dolce, 2023), the period-doubling sequence (Schaeffer and Shallit, 2021), the powers of two sequence (Schaeffer and Shallit, 2021, Kociumaka, Navarro, Prezza, 2021), complementary-symmetric Rote sequences (Dvořáková and Hendrychová, 2023).
-Recently, string attractors in fixed points of k-bonacci-like morphisms have been described (Gheeraert, Romana, Stipulanti, 2023).
-In our talk we aim to present the following results:
-Using the fact that standard Sturmian sequences may be obtained when iterating palindromic closure, we were able to find attractors of minimum size of all factors of Sturmian sequences. These attractors were different from the ones found for prefixes by Mantaci et al. It was then straightforward to generalize the result to factors of episturmian sequences.
-Observing usefullness of palindromic closures when dealing with attractors, we turned our attention to pseudopalindromic prefixes of the so-called binary generalized pseudostandard sequences. We determined the minimum size attractors in two cases: for pseudostandard sequences obtained when iterating uniquely the antipalindromic closure (the minimum size is three) and for the complementary-symmetric Rote sequences when iterating both palindromic and antipalindromic closure (the minimum size is two).
+It is well-known that the subword complexity of an automatic sequence grows at most linearly, meaning that the number of length-$\ell$ subwords which appear in a given automatic sequence $a = (a(n))_n$ is at most $C \ell$ for a constant $C$ dependent only on $a$. In contrast, arithmetic subword complexity measures the number of subwords which appear along arithmetic progressions, and can grow exponentially even for very simple automatic sequences. Indeed, the classical Thue-Morse sequence has arithmetic subword complexity $2^{\ell}$, which is the maximal possible complexity for $\{0,1\}$-valued sequence.
+Together with Jakub Byszewski and Clemens Müllner we obtained a decomposition result which allows us to express any (complex-valued) automatic sequence as the sum of a structured part, which is easy to work with, and a part which is pseudorandom or uniform from the point of view of higher order Fourier analysis. We now apply these techniques to the study of arithmetic subword complexity of automatic sequences. We show that for each automatic sequence $a$ there exists a parameter $r$ --- which we dub "effective alphabet size" --- such that the arithmetic subword complexity of $a$ is at least $r^{\ell}$ and at most $(r+o(1))^{\ell}$.
-**September 26 2023:[[https://www.uwinnipeg.ca/mathstats/faculty/james-currie.html}|James Currie]]** //The analogs of overlap-freeness for the period-doubling morphism and
+This talk is based on joint work with Jakub Byszewski and Clemens Müllner, and is closely related to the previous talk of Clemens Müllner at One World Combinatorics on Words Seminar.
-for the Fibonacci morphism//
-{{ seminar2023:20230926currie.pdf |slides}}
-{{ seminar2023:20230926currie.mp4 |video of the talk}}
-The Thue-Morse morphism is the binary map $\mu: 0 \to 01, 1 \to 10$. A word $w$ is
+**January 9 2024: [[https://dmg.tuwien.ac.at/cmuellner/|Clemens Müllner]]** //Synchronizing automatic sequences along Piatetski-Shapiro sequences//
-overlap-free if it has no factor of the form $xyxyx$, where $x$ is
-non-empty. A deep connection between these two concepts is the engine
-behind several results:
--         The precise characterization of finite prefixes of infinite
+{{ seminar2024:20240109muellner.pdf |slides}}
-overlap-free binary words (Fife’s Theorem);
--         A precise enumeration of overlap-free binary words;
+{{ seminar2024:20240109muellner.mp4 |video of the talk}}
--         A characterization of all binary patterns encountered by the
-Thue-Morse word;
--         The determination of the lexicographically least infinite
+Automatic sequences - that is, sequences computable by finite automata - have long been studied from the point of view of combinatorics on words. A notable property of these sequences is that their subword-complexity is at most linear. Avgustinovich, Fon-Der-Flaass and Frid introduced the notion of arithmetic subword-complexity - that is the number of different subwords of length $n$ that appear along some arithmetic progression.
-overlap-free word.
+They also showed that a special class of synchronizing automatic sequences have at most linear arithmetic subword-complexity and some other class of automatic sequences on the alphabet $\Sigma$ have maximal possible subword-complexity $|\Sigma|^n$.
-Given another morphism, is there an analog of overlap-freeness which
+Synchronizing automatic sequences can be efficiently approximated using periodic functions and are usually more structured than general automatic sequences. We discuss a recent result showing that the arithmetic (and even polynomial) subword-complexity of synchronizing automatic sequences grows subexponentially. This was a key result to show that the subword-complexity of synchronizing automatic sequences along regularly growing sequences (such as Piatetski-Shapiro sequences) grows subexponentially, which is in stark contrast to other automatic sequences such as the Thue-Morse sequence. Moreover, this was a key ingredient to obtain rather precise estimates for the arithmetic (and polynomial) subword-complexity of general automatic sequences.
-facilitates the proof of similar results? We show that the answer is
-yes for the period doubling morphism $\delta :0 \to 01, 1\to 00$, and for the
-Fibonacci morphism $\varphi :0\to 01, 1\to 0$.
+This is joint work with Jean-Marc Deshouillers, Michael Drmota, Andrei Shubin and Lukas Spiegelhofer.
+==== Archives 2023 ====
+The talks of 2023 are available [[2023|here]].
-** September 12 2023:**  **[[https://www.researchgate.net/scientific-contributions/Bastian-Espinoza-2179194104|Bastián Espinoza]]** //An $S$-adic characterization of linear-growth complexity subshifts//
-{{ seminar2023:20230912espinoza.pdf |slides}}
-{{ seminar2023:20230912espinoza.mp4 |video of the talk}}
-In the context of symbolic dynamics, the class of "linear-growth complexity subshifts" is of particular relevance as it occurs in a variety of areas, such as geometric dynamical systems, language theory, number theory, and numeration systems, among others. During the intensive study carried out on this subject since the beginning of the 90s, it was proposed that a hierarchical decomposition based on $S$-adic sequences that characterizes linear-growth complexity subshifts would be useful to understand this class. The problem of finding such a characterization was given the name "$S$-adic conjecture" and inspired several influential results in symbolic dynamics. In this talk, I will present an $S$-adic characterization of this class as well as some of its applications, giving in particular a solution to this conjecture.
-**May 15 2023: [[https://cs.uwaterloo.ca/~csk/|Craig Kaplan]]** //An aperiodic monotile//
-{{ seminar2023:20230515kaplan.pdf |slides}}
-{{ seminar2023:20230515kaplan.mp4 |video of the talk}}
-A set of shapes is called aperiodic if the shapes admit tilings of
- the plane, but none that have translational symmetry.  A longstanding
- open problem asks whether a set consisting of a single shape could
- be aperiodic; such a shape is known as an aperiodic monotile or
- sometimes an "einstein".  The recently discovered "hat" monotile
- settles this problem in two dimensions.  In this talk I provide
- necessary background on aperiodicity and related topics in tiling
- theory, review the history of the search for for an aperiodic
- monotile, and then discuss the hat and its mathematical properties.
-Full disclosure: this is the same title and abstract that I just sent to Kevin Hare for the Numeration seminar the week before (May 9th).  I expect that the talks will be largely the same, but if I have a chance to incorporate any connections to combinatorics on words into my talk for you, I will.
-**May 8 2023: [[https://lapointemelodie.github.io/publications/|Mélodie Lapointe]]** //Perfectly clustering words: Induction and morphisms//
-{{ seminar2023:20230508lapointe.pdf |slides}}
-{{ seminar2023:20230508lapointe.mp4 |video of the talk}}
-Perfectly clustering words are special factors in trajectories of discrete interval exchange transformation with symmetric permutation. If the discrete interval exchange transformation has two intervals, they are Christoffel words. Therefore, perfectly clustering words are a natural generalization of Christoffel words. In this talk, an induction on discrete interval exchange transformation with symmetric permutation will be presented. This induction sends a discrete interval exchange transformation with symmetric permutation into another one with the same permutation but smaller intervals. Moreover, the induction leads to morphisms, sending a perfectly clustering word to another perfectly clustering word. Finally, a new bijection between perfectly clustering words and band bricks over certain gentle algebras will be presented.
-** April 3 2023: [[https://cs.uwaterloo.ca/~shallit/|Jeffrey O. Shallit]]** //New Results in Additive Number Theory via Combinatorics on Words//
-{{ seminar2023:20230403shallit.pdf |slides}}
-{{ seminar2023:20230403shallit.mp4 |video of the talk}}
-Additive number theory is the study of the additive properties of integers.
-Surprisingly, we can use techniques from combinatorics on words to prove
-results in this area.
-In this talk I will discuss the number of representations of an integer N as
-a sum of elements from some famous sets, such as the evil numbers, the
-odious
-numbers, the Rudin-Shapiro numbers, Wythoff sequences, etc.
-** Mar 27 2023: [[https://fit.cvut.cz/cs/fakulta/lide/5367-stepan-starosta|Štěpán Starosta]]** //On a faithful representation of Sturmian morphisms//
-{{ seminar2023:20230327starosta.pdf |slides}}
-{{ seminar2023:20230327starosta.mp4 |video of the talk}}
-The set of morphisms mapping any Sturmian sequence to a Sturmian sequence forms together with composition the so-called monoid of Sturm.  For this monoid, we define a faithful representation by $(3\times 3)$-matrices with integer entries. We find three convex cones in $\mathbb{R}^3$ and show that a matrix $R \in  Sl(\mathbb{Z},3)$ is a matrix representing a Sturmian morphism if the three cones are  invariant under multiplication by $R$ or $R^{-1}$. This property offers a new tool to study Sturmian sequences. We provide
-alternative proofs of four known results on Sturmian sequences fixed by a primitive morphism and a new result concerning the square root of a Sturmian sequence.
-** Mar 6 2023: Léo Poirier and [[https://www.irif.fr/~steiner/|Wolfgang Steiner]]** //Factor-balanced $S$-adic languages//
-{{ seminar2023:20230306poirier_steiner.pdf |slides}}
-{{ 20230306poirier_steiner.mp4 |video of the talk}}
-A set of words, also called a language, is letter-balanced if the number of occurrences of each letter only depends on the length of the word, up to a constant. Similarly, a language is factor-balanced if the difference of the number of occurrences of any given factor in words of the same length is bounded. The most prominent example of a letter-balanced but not factor-balanced language is given by the Thue-Morse sequence. We establish connections between the two notions, in particular for languages given by substitutions and, more generally, by sequences of substitutions. We show that the two notions essentially coincide when the sequence of substitutions is proper. For the example of Thue-Morse-Sturmian languages, we give a full characterisation of factor-balancedness.
-** Feb 27 2023: [[https://perso.liris.cnrs.fr/aline.parreau/|Aline Parreau]]** and **[[https://perso.liris.cnrs.fr/eric.duchene/|Eric Duchêne]]** //Taking and merging games as rewrite games // (joint work with V. Marsault and M. Rigo)
-{{ seminar2023:20230227duchene-parreau.pdf |slides}}
-{{ seminar2023:20230227duchene-parreau.mp4 |video of the talk}}
-In this talk, we present some of the links between combinatorial games and language theory. A combinatorial game is a 2-player game with no chance and with perfect information. Amongst them, the family of heap games such as the game of Nim, subtraction or octal games belong to the the most studied ones. Generally, the analysis of such games consist in determining which player has a winning strategy. We will first see how this question is investigated in the case of heap games.
-In a second part of the talk, we will present a generalization of heap games as rewrite games on words. This model was introduced by Waldmann in 2002. Given a finite alphabet and a set of rewriting rules on it, starting from a finite word w, each player alternately applies a rule on w. The first player unable to apply a rule loses the game. In this context, the main question is now about the class of the language formed by the losing and winning positions of the game. For example, for octal games that are solved in polynomial time, the losing positions form a rational language. By using the model of rewrite games, we will investigate here a new family of heap games that consist in merging heaps of tokens, and consider some of the different classes of languages that may emerge according to the rules of the game.
-** Feb 6 2023: Matthew Konefal** //Examining the Class of Formal Languages which are Expressible via Word Equations//
-{{ seminar2023:20230206konefal.pdf |slides}}
-{{ seminar2023:20230206konefal.mp4 |video of the talk}}
-A word equation can be said to express a formal language via each variable occurring in it. The class $WE$ of formal languages which can be expressed in this way is not well understood. I will discuss  a number of necessary and sufficient conditions for a formal language $L$ to belong to $WE$. I will give particular focus to the case in which $L$ is regular, and to the case in which $L$ is a submonoid.
-** Jan 23 2023: [[https://kmlinux.fjfi.cvut.cz/~balkolub/|Lubomíra Dvořáková]]** //Essential difference between the repetitive thereshold and asymptotic repetitive threshold of balanced sequences//
-{{ seminar2023:20230123dvorakova.pdf |slides}}
-{{ seminar2023:20230123dvorakova.mp4 |video of the talk}}
-At first, we will summarize both the history and the state of the art of the critical exponent and the asymptotic critical exponent of balanced sequences.
-Second, we will colour the Fibonacci sequence by suitable constant gap sequences to provide an upper bound on the asymptotic repetitive threshold of $d$-ary balanced sequences. The bound is attained for $d$ equal to $2$, $4$ and $8$ and we conjecture that it happens for infinitely many  even $d$'s.
-Finally, we will reveal an essential difference in behavior of the repetitive threshold and  the asymptotic repetitive threshold of balanced sequences: The repetitive threshold of $d$-ary  balanced sequences is known to be  at least $1+1/(d-2)$ for each $d$ larger than two. In contrast, our bound implies that the asymptotic repetitive threshold of $d$-ary balanced sequences is at most $1+\phi^3/2^{d-3}$ for each $d$ larger than one, where $\phi$ is the golden mean.
-Joint work with Edita Pelantová.
-** Jan 9: [[https://www.tompeteder.org/|Pamela Fleischmann]]** //$m$-Nearly $k$-Universal Words - Investigating Simon Congruence//
-Determining the index of the Simon congruence is a long outstanding open problem. Two words $u$ and $v$ are called Simon congruent if they have the same set of scattered factors, which are parts of the word in the correct order but not necessarily consecutive, e.g., oath is a scattered factor of logarithm. Following the idea of scattered factor $k$-universality, we investigate $m$-nearly $k$-universality, i.e., words where $m$ scattered factors of length $k$ are absent, w.r.t. Simon congruence. We present a full characterisation as well as the index of the congruence for $m = 1$, $2$, and $3$. Moreover, we present a characterisation of the universality of repetitions.
-{{ seminar2023:20230109fleischmann.pdf |slides}}
-{{ seminar2023:20230109fleischmann.mp4 |video of the talk}}