SPEAKERS

Mélodie Andrieu  (Université du Littoral Côte d’Opale)   A new renormalization process on infinite words
Pierre Béaur (Université Paris-Saclay)     String attractors on bi-infinite words
Srecko Brlek (UQAM)  Some open problems on the Fibonacci smooth tiling
Yann Bugeaud (Université de Strasbourg)    Interplay between combinatorics on words and Diophantine approximation
James Currie (University of Winnipeg)    A small morphism giving Abelian repetition threshold less than 2
Alessandro De Luca (University of Naples)   Recent developments on cyclic singular words
L’ubomíra Dvořáková (Czech Technical University)  The repetition threshold of episturmian sequences
Bastián Espinoza (Université de Liège)   The structure of low complexity subshifts
Gabriele Fici (University of Palermo)  Balanced Words and Digital Segments
Paweł Gawrychowski (University of Wroclaw)  Repetitions in 2D strings
France Gheeraert (Université de Liège)    How extensions impact the factor complexity of morphic images
Christoph Haase (University of Oxford)  Small Certificates for Large Solutions
Veronika Hendrychová (ENS Rennes)  String attractors of Rote sequences
Štěpán Holub (Charles University)   Current state of the binary equality words classification
Yohan Hosten (Université du Littoral Côte d’Opale)   On the variation of the sum of digits function in integer bases (or in Zeckendorf representation)
Yining Hu (Harbin Institute of Technology)  Automatic continued fractions in characteristic 2
Damien Jamet (Université de Lorraine)   Frequencies of letter in self-descriptive sequences
Gandhar Girish Joshi (The Open University)   Monochromatic arithmetic progressions in the Fibonacci word
Jakub Konieczny (Université de Lyon) Arithmetical subword complexity of automatic sequences
Tore Koß (University of Göttingen)   Subsequences (to be confirmed)
Elżbieta Krawczyk (Jagiellonian University)    Around Cobham’s theorem
Simon Kristensen (Aarhus University) On the p-adic Littlewood conjecture
Shuo Li (Sorbonne Université)  Block-counting sequences revisited
Yao-Qiang Li (Sorbonne Université)  Bifurcations of digit frequencies in unique expansions
Sergey Luchinin (Saint Petersburg State University)   Symmetry group of infinite words
Florin Manea (University of Göttingen)   Algorithms for subsequence-matching
Clemens Müllner (Université Claude Bernard Lyon 1)  Arithmetical subword complexity of automatic sequences
Pascal Ochem (CNRS, Université de Montpellier)   Extremal letter frequencies in ternary square-free words
Bartłomiej Pawlik (Silesian University of Technology)  Variations on shuffle squares
Svetlana Puzynina (Saint Petersburg State University)   Finite and infinite closed-rich words
Matthieu Rosenfeld (LIRMM, Montpellier Université)  Thue choice number and the counting argument
Stefan Siemer (University of Göttingen)   Matching patterns with variables in approximate settings
Marinella Sciortino (University of Palermo)    String attractor-based complexities for infinite words
Manuel Silva (University of Lisbon)  Distant words
Arseny Shur (Bar-Ilan University)   Random walks in prefix trees
Lukas Spiegelhofer (TU Wien)  Thue–Morse along the sequence of cubes
Pierre-Adrien Tahay (Université de Lorraine)   Characteristic sequences of the sets of sums of squares as columns of cellular automata
Lama Tarsissi (Sorbonne University Abu Dhabi) Digital convexity in a combinatorics on words point of view
Léo Vivion (Université du Littoral Côte d’Opale)  Complexities of hypercubic billiard words
Markus Whiteland (Université de Liège)   Gapped binomial complexities of words