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 [2025/08/20 08:11] – 82.66.107.61start [2025/09/17 06:29] (current) – 82.66.107.61
Line 22: Line 22:
 ==== Upcoming talks ====  ==== Upcoming talks ==== 
  
-**September 2 2025: Gandhar Joshi** //Monochromatic Arithmetic Progressions in Sturmian sequences// +**October 14 2025: Nicolas Bédaride**
- +
-This is joint work with Dan Rust. We define Monochromatic arithmetic progression (MAP) as the repetition of a symbol (traditionally colour) with a constant difference in a sequence. We study thresholds of the lengths of MAPs in the Fibonacci word in our paper https://doi.org/10.1016/j.tcs.2025.115391, which not only resolves a few problems left open by previous works revolving around MAPs in symbolic sequences but also reveals a straightforward method to find a formula that finds longest lengths of MAPs for all Sturmians. This extension is dealt with in the author's PhD thesis. +
- +
-**September 16 2025: Kaisei Kishi**+
  
 **October 28 2025: Idrissa Kaboré** **October 28 2025: Idrissa Kaboré**
Line 37: Line 33:
  
 **December 23 2025: Savinien Kreczman** **December 23 2025: Savinien Kreczman**
 +
 +**January 6 2025: Louis Marin**
  
  
 ==== Past talks 2025 ==== ==== Past talks 2025 ====
 +
 +**September 16 2025: Kaisei Kishi** //Net Occurrences in Fibonacci and Thue-Morse Words//
 +
 +{{ seminar2025:20250916kishi.pdf |slides}}
 +
 +{{ seminar2025:20250916kishi.mp4 |video of the talk}}
 +
 +In a string $T$, an occurrence of a substring $S=T[i ... j]$ is a net occurrence if $S$ is repeated in $T$, while both left extension $T[i-1, ... j]$ and right extension $T[i, ... j+1]$ are unique in $T$. The number of net occurrences of $S$ in $T$ is called its net frequency. Compared with ordinary frequency, net frequency highlights the more significant occurrences of $S$ in $T$. In this talk, I will present several properties of net occurrences and describe techniques to identify all the net occurrences in Fibonacci and Thue-Morse words. In particular, I will explain the technique to characterize the occurrences of smaller-order Fibonacci and Thue-Morse words. This is a joint work with Peaker Guo.
 +
 +
 +**September 2 2025: Gandhar Joshi** //Monochromatic Arithmetic Progressions in Sturmian sequences//
 +
 +{{ seminar2025:20250902joshi.pdf |slides}}
 +
 +{{ seminar2025:20250902joshi.mp4 |video of the talk}}
 +
 +This is joint work with Dan Rust. We define Monochromatic arithmetic progression (MAP) as the repetition of a symbol (traditionally colour) with a constant difference in a sequence. We study thresholds of the lengths of MAPs in the Fibonacci word in our paper https://doi.org/10.1016/j.tcs.2025.115391, which not only resolves a few problems left open by previous works revolving around MAPs in symbolic sequences but also reveals a straightforward method to find a formula that finds longest lengths of MAPs for all Sturmians. This extension is dealt with in the author's PhD thesis.
 +
  
 **July 15 2025: [[https://apacz.matinf.uj.edu.pl/users/1719-elzbieta-krawczyk|Elżbieta Krawczyk]]**  //Quasi-fixed points of substitutions and substitutive systems// **July 15 2025: [[https://apacz.matinf.uj.edu.pl/users/1719-elzbieta-krawczyk|Elżbieta Krawczyk]]**  //Quasi-fixed points of substitutions and substitutive systems//
Line 220: Line 236:
 ==== Archives 2024 ==== ==== Archives 2024 ====
  
-The talks of 2023 are available [[2024|here]].+The talks of 2024 are available [[2024|here]].
  
 ==== Archives 2023 ==== ==== Archives 2023 ====