Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
start [2026/05/12 14:37] – anna.fridstart [2026/05/13 19:31] (current) – anna.frid
Line 22: Line 22:
 ==== Upcoming talks ====  ==== Upcoming talks ==== 
  
-**May 26 2026: Reem Yassawi**+**POSTPONED <del>May 26 2026: Reem Yassawi</del>**
  
 **June 9 2026:  [[https://kmlinux.fjfi.cvut.cz/~balkolub/| Ľubomíra Dvořáková]]** //Attractors of sequences coding beta-integers// **June 9 2026:  [[https://kmlinux.fjfi.cvut.cz/~balkolub/| Ľubomíra Dvořáková]]** //Attractors of sequences coding beta-integers//
Line 43: Line 43:
 {{ seminar2026:20260512vivion.pdf |slides}} {{ seminar2026:20260512vivion.pdf |slides}}
  
-The talk was not recorded at the speaker's request.+(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 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.