Differences

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

--- start [2025/10/15 05:40] – 82.66.107.61
+++ start [2025/11/07 11:17] (current) – anna.frid
@@ Line 22: / Line 22: @@
 ==== Upcoming talks ====
+**November 11 2025: [[https://www.utu.fi/en/people/aleksi-vanhatalo|Aleksi Vanhatalo]]** //Exponents of words under injective morphisms//
+A very common problem type in combinatorics on words is to construct words (under constraints) that avoid repetition. This is often done by constructing suitable morphisms.
+Here we flip the setup: we ask how good morphisms are at introducing repetitions into words. Periodic morphisms are trivially very good at this, but how about less trivial classes of morphisms?
+We consider a few variations of this question. We characterize finite words that do not have an upper bound on fractional or integer exponents when mapped via injective morphisms. Then we consider the asymptotic critical exponent of infinite words. While we consider all finite alphabet sizes, these variations are better understood in the binary case.
+This talk is an extended version of the one presented at DLT 2025. It is based on joint work with Eva Foster and Aleksi Saarela, and on ongoing research.
-**October 28 2025: Idrissa Kaboré**
-**November 11 2025: Aleksi Vanhatalo**
 **November 25 2025: Ignacio Mollo**
@@ Line 46: / Line 51: @@
 **March 30 2026: Paulina Cecchi Bernales**
+**April 14 2026: Idrissa Kaboré** //On modulo-recurrence and window complexity in infinite words//
+In this talk, first, I will recall the notions of modulo-recurrent words and of window complexity. These notions are introduced in 2007. Then, I present some properties of these notions. After that, I will present the notions of uniform modulo-recurrence and of strong modulo-recurrence. These notions are defined recently in a joint work with Julien Cassaigne. Sturmian words are uniformly (resp. strongly) modulo-recurrent words. Then, I will address the window complexity of the Thue-Morse. To finish, I will present a recurrent aperiodic word with bounded window complexity.
+**April 28 2026: [[https://kmlinux.fjfi.cvut.cz/~balkolub/| Ľubomíra Dvořáková]]** //Attractors of sequences coding beta-integers//
 ==== Past talks 2025 ====
 **October 14 2025: [[https://www.nord.no/en/about/employees/antoine-laurent-christophe-julien|Antoine Julien]]** //On balance properties of hypercubic billiard words//