Combinatorics on Words Seminar – INSTITUT DE MATHÉMATIQUES DE MARSEILLE

Évènements à venir / Upcoming talks
iCal

2023-10-10	Ľubomíra Dvořáková	String attractors and pseudopalindromic closures
2023-10-24	Herman Goulet-Ouellet	Title to be announced - Herman Goulet-Ouellet
2023-11-07	Svetlana Puzynina	Title to be announced - Svetlana Puzynina
2023-11-21	Seda Albayrak	Quantitative estimates for the size of an intersection of sparse automatic sets

Nature	Séminaire virtuel international / International Virtual Seminar
Responsables	Anna E. Frid, Aix-Marseille Université, Narad Rampersad, University of Winnipeg, Jeffrey O. Shallit, University of Waterloo, Manon Stipulanti, Université de Liège.
Fréquence	Bimensuel (depuis le 29/06/2020)
Jour-Horaire	Lundi, 15h-16h (heure de Paris)
Liens	https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ https://www.youtube.com/channel/UCDYvX3CJpx6TelQCnAnK7jw/videos

If you are interested in giving a talk, you are welcome to contact Narad Rampersad and Manon Stipulanti.

The address of the Zoom meeting is https://zoom.us/j/92245493528 . The password is distributed in announcements. If you want to receive them, or receive them and want to unsubscribe, please write to Anna Frid.

All recorded talks are also available here.

Évènements passés / Past talks (Only from 2022)

2023-09-26	James Currie	The analogs of overlap-freeness for the period-doubling morphism and for the Fibonacci morphism
2023-09-12	Bastián Espinoza	An S-adic characterization of linear-growth complexity subshifts
2023-05-22	Matthieu Rosenfeld	Title to be announced - Matthieu Rosenfeld
2023-05-15	Craig Kaplan	An aperiodic monotile
2023-05-08	Mélodie Lapointe	Perfectly clustering words: Induction and morphisms
2023-04-17	Bastián Espinoza	An S-adic characterization of linear-growth complexity subshifts (POSTPONED)
2023-04-03	Jeffrey O. Shallit	New results in additive number theory via combinatorics on words
2023-03-27	Štěpán Starosta	On a faithful representation of Sturmian morphisms
2023-03-06	Léo Poirier, Wolfgang Steiner	Factor-balanced S-adic languages
2023-02-27	Aline Parreau, Eric Duchêne	Taking and merging games as rewrite games
2023-02-06	Matthew Konefal	Examining the class of formal languages which are expressible via word equations
2023-01-23	Lubomíra Dvořáková	Essential difference between the repetitive thereshold and asymptotic repetitive threshold of balanced sequences
2023-01-09	Pamela Fleischmann	m-Nearly k-Universal Words - Investigating Simon Congruence
2022-12-19	Jason Bell	Noncommutative rational Pólya series
2022-12-05	Josef Rukavicka	Palindromic factorization of rich words
2022-11-21	Sebastián Barbieri	Indistinguishable asymptotic pairs
2022-11-07	Daniel Krenn	q-recursive sequences and their asymptotic analysis
2022-10-24	Natalie Behague	Synchronizing times for k-sets in automata
2022-10-17	Giuseppe Romana	String attractor: a combinatorial object from data compression
2022-10-03	Robbert Fokkink	A few words on games
2022-09-19	Shuo Li	On the number of squares in a finite word
2022-07-11	Zachary Chase	The separating words, k-deck, and trace reconstruction problems
2022-06-27	Pierre Popoli	Maximum order complexity for some automatic and morphic sequences along polynomial values

Archives 2022
Archives 2021
Archives 2020