Programme

Programme détaillé à venir.

La conférence commencera lundi 30 juin au matin et se terminera vendredi 4 juillet à midi.

Exposés invités :
– Daniel Gabrić : Combinatorial problems on closed and privileged words
– France Gheeraert : The link between return words and extensions of factors
– Idrissa Kaboré : On the abelian complexity of infinite words
– Martin Lustig : S-adic expansions, invariant measures and substitutional subshifts
– Markus Whiteland : Glimpses into Recent Developments in Subword Combinatorics and Binomial Coefficients

Articles acceptés :
– Kristina Ago, Bojan Bašić: And now there are four: Another brick in the wall of the optimal upper bound on the MP-ratio
– Seda Albayrak: A Characterization of Algebraic Multivariate Power Series with Sparse Support
– Jonathan Andrade, Lucas Mol: Avoiding abelian and additive powers in rich words
– Alexandre Blondin Massé, Alain Goupil, Raphaël L’Heureux, Louis Marin: Maximal 2-dimensional binary words of bounded degree
– Fabio Burderi: Factorizations and Monoids
– Fabio Burderi: Free Product of Formal Series
– Olivier Carton, Jean-Michel Couvreur, Martin Delacourt and Nicolas Ollinger: Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems
– James D. Currie, Narad Rampersad: Words avoiding half-flips
– Alessandro De Luca, Gabriele Fici, Andrea Frosini: Digital Convexity and Combinatorics on Words
– Francesco Dolce, Christian B. Hughes: Clustering of return words in languages of interval exchanges
– Ľubomíra Dvořáková, Edita Pelantová: Symmetries of rich sequences with minimum critical exponent
– Harold Erazo, Carlos Gustavo Moreira: The Heineis spectrum has non-empty interior
– Mehdi Golafshan, Michel Rigo: Binomial Coefficients of Multidimensional Arrays
– Herman Goulet-Ouellet, Karel Klouda, Štěpán Starostam: Circularity and repetitiveness in non-injective DF0L systems
– Jarosław Grytczuk, Bartłomiej Pawlik, Andrzej Ruciński: Shuffle Squares and Nest-Free Graphs
– Savinien Kreczman, Sébastien Labbé, Manon Stipulanti: A succinct study of positionality for Dumont–Thomas numeration systems
– Bastien Laboureix, Eric Domenjoud: About ∆-numeration
– Shuo Li, Narad Rampersad: Purely automatic sequences with the uniform distribution property
– Anuran Maity, Svetlana Puzynina: On the closed-rich constant of infinite words
– Josef Rukavicka: Note on dissecting power of regular languages

Les commentaires sont clos.