https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ 2026-05-25T21:35:41+00:00 https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/ https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/_media/wiki:dokuwiki-128.png text/html 2021-03-03T09:14:35+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/2020?rev=1614762875&do=diff Here are the talks of One World Combinatorics on Words Seminar dated 2020. 14 December 2020: Sébastien Labbé A characterization of Sturmian sequences by indistinguishable asymptotic pairs [slides] [Video of the talk] We give a new characterization of Sturmian configurations in terms of indistinguishable asymptotic pairs. Two asymptotic configurations on a full $\mathbb{Z}$$1973$$\mathcal{A}$$n$$w \in \mathcal{A}^n$$u_i$$u_i$$w$$u_1, \ldots, u_i$$u_{i+1}$$(u_1, \ldots, u_k)$$w$$k$$k$$w$$m+1$$… text/html 2022-01-10T15:36:37+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/2021?rev=1641828997&do=diff Here are the talks of One World Combinatorics on Words Seminar dated 2021. 20 December 2021: Jakub Konieczny Finitely-valued generalised polynomials [slides] [Video of the talk] Generalised polynomials are expressions constructed from polynomials with the use of the floor function, addition and multiplication, such as $\lfloor \sqrt{2} n \lfloor \sqrt{3} n^2\rfloor + \sqrt{6} + \frac{1}{2}\rfloor$. Despite superficial similarity, generalised polynomials exhibit many phenomena which are impo… text/html 2023-01-25T13:52:14+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/2022?rev=1674654734&do=diff Here are the talks of One World Combinatorics on Words Seminar dated 2022. Dec 19: Jason Bell Noncommutative rational Pólya series [slides] [video of the talk] A Pólya series over a field $K$ is a formal noncommutative power series whose nonzero coefficients are contained in a finitely generated subgroup of the multiplicative group of $K$$w$$\vert w\vert+1$$w$$w_1, w_2,\dots,w_p$$w=w_pw_{p-1}\cdots w_1$$w_i$$w_pw_{p-1}\cdots w_i$$1\leq i\leq p$$luf(w)=p$$w$$c$$w$$n=\vert w\vert$$luf(w)\leq … text/html 2024-01-24T08:15:19+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/2023?rev=1706084119&do=diff Here are the talks of One World Combinatorics on Words Seminar dated 2023. Past talks 2023 December 19 2023: Pierre Béaur All I want for Christmas is an algorithm to detect a Sturmian word in an ω-regular language [slides] [video of the talk] 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… text/html 2025-01-28T18:38:27+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/2024?rev=1738089507&do=diff Here are the talks of One World Combinatorics on Words Seminar dated 2024. Past talks 2024 December 17 2024: Yuto Nakashima On the Number of Non-equivalent Parameterized Squares in a String [slides] [video of the talk] A string $s$ is called a parameterized square when $s = xy$ for strings $x$, $y$ and $x$ and $y$ are parameterized equivalent. Kociumaka et al. showed the number of parameterized squares, which are non-equivalent in parameterized equivalence, in a string of length $n$$\sigma$… text/html 2026-01-20T16:39:13+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/2025?rev=1768927153&do=diff Past talks 2025 Here are the talks of One World Combinatorics on Words Seminar dated 2025. December 9 2025: Florin Manea Linear Time Subsequence and Supersequence Regex Matching [slides by Tina Ringleb (Uni Göttingen)] [video of the talk] It is well-known that checking whether a given string $w$ matches a given regular expression $r$ can be done in quadratic time $O(|w|⋅ |r|)$$O((|w|⋅ |r|)^{1-\varepsilon})$$w$$r$$O(|w| + |r|)$$r$$O(|w|⋅ |r|)$$O(|w| + |r|)$$T$$S=T[i ... j]$$S$$T$$T[i-1, ...… text/html 2025-01-10T15:19:42+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/index.html?rev=1736522382&do=diff Bienvenue sur la page de Clothilde Melot text/html 2023-12-06T11:28:20+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/lectures?rev=1701862100&do=diff Lectures on Combinatorics on Words Here you find some materials of lectures by Anna Frid given in September 2020 at Aix-Marseille Université. Lecture 1: Introduction and connections [slides] [video] Lecture 2: Pattern avoidance [slides] [video] Lecture 3: Examples of automatic words text/html 2022-10-30T22:04:56+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/shorttalksfebruary2021?rev=1667167496&do=diff Day of Short Talks on Combinatorics on Words This mini-event, organized by One World Combinatorics on Words Seminar, is designed to take the place of a small and very informal conference in our field, since many of us miss direct communication of this kind. The event will consist of short talks in 25-minute slots, including your new results, discussions, and open questions. If you are interested in giving such a talk, please send your title and abstract to Anna Frid (anna.e.frid@gmail.com) as … text/html 2022-10-30T21:44:54+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/shorttalksjune2021?rev=1667166294&do=diff Day of Short Talks on Combinatorics on Words, June 21, 2021 This third mini-event, organized by One World Combinatorics on Words Seminar, is designed to take the place of a small and very informal conference in our field, since many of us miss direct communication of this kind. The page of the previous Day of short talks is text/html 2022-10-30T22:01:13+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/shorttalksmarch2021?rev=1667167273&do=diff Day of Short Talks on Combinatorics on Words, March 22, 2021 This second mini-event, organized by One World Combinatorics on Words Seminar, is designed to take the place of a small and very informal conference in our field, since many of us miss direct communication of this kind. The page of the first Day of short talks is $d=2^n-1$$P_{ret}$$P_{ret}$$w$$u$$w$ text/html 2026-05-13T19:31:28+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words-seminar/start?rev=1778700688&do=diff One World Combinatorics on Words Seminar The seminar takes place biweekly on Tuesdays at 15:00 Paris time. In summer, it means 6:00 in California, 9:00 in New-York or Waterloo, 14:00 in London, 15:00 in Paris, 16:00 in Moscow and 22:00 in Tokyo. In winter, some of these numbers change. Please check in advance the time in your time zone.$k$$2$$k$$2$$k$$k$$3/2$$n$$3/2$$n$$3/2$$2$$\binom{w}{u}$$u$$w$$\binom{w}{ab}$$a$$b$$2$$w$$2$$2$$2$$w$$\{a, b\}$$ab$$ba$$(\binom{w}{ab} = \binom{w}{ba})$$01001010…