Differences

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

--- start [2026/05/05 18:21] – anna.frid
+++ start [2026/05/13 19:31] (current) – anna.frid
@@ Line 22: / Line 22: @@
 ==== Upcoming talks ====
-**May 12 2026: [[https://www-lmpa.univ-littoral.fr/~lvivion/|Léo Vivion]]** //New examples of words for which binomial complexities and subword complexity coincide//
+**POSTPONED <del>May 26 2026: Reem Yassawi</del>**
-In 2015, Rigo and Salimov introduced a family of complexities that forms a scale between abelian complexity and factor complexity: the $k$-binomial complexities. In particular, they showed that Sturmian words satisfy the following remarkable combinatorial property: their $2$-binomial complexity is equal to their factor complexity. Since then, the only other known example satisfying this property is the Tribonacci word.
-In this talk, I will present some stability results for words whose $k$-binomial complexities coincide with their factor complexity, notably under letter deletion and a coloring operation. These stability properties allow to show that several well-known families of words also have their $2$-binomial complexity equal to their factor complexity.
-**May 26 2026: Reem Yassawi**
 **June 9 2026:  [[https://kmlinux.fjfi.cvut.cz/~balkolub/| Ľubomíra Dvořáková]]** //Attractors of sequences coding beta-integers//
@@ Line 43: / Line 37: @@
 ==== Past talks 2026 ====
+**May 12 2026: [[https://www-lmpa.univ-littoral.fr/~lvivion/|Léo Vivion]]** //New examples of words for which binomial complexities and subword complexity coincide//
+{{ seminar2026:20260512vivion.pdf |slides}}
+(The talk was not recorded at the speaker's request.)
+In 2015, Rigo and Salimov introduced a family of complexities that forms a scale between abelian complexity and factor complexity: the $k$-binomial complexities. In particular, they showed that Sturmian words satisfy the following remarkable combinatorial property: their $2$-binomial complexity is equal to their factor complexity. Since then, the only other known example satisfying this property is the Tribonacci word.
+In this talk, I will present some stability results for words whose $k$-binomial complexities coincide with their factor complexity, notably under letter deletion and a coloring operation. These stability properties allow to show that several well-known families of words also have their $2$-binomial complexity equal to their factor complexity.
 **April 28 2026:  [[https://sites.google.com/ug.uchile.cl/espinoza|Bastiàn Espinoza]]** //The Thue-Morse word in base 3/2//