Differences

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

--- start [2025/09/16 08:54] – 139.124.6.236
+++ start [2025/09/17 06:29] (current) – 82.66.107.61
@@ Line 21: / Line 21: @@
 ==== Upcoming talks ====
-**September 16 2025: Kaisei Kishi** //Net Occurrences in Fibonacci and Thue-Morse Words//
-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.
 **October 14 2025: Nicolas Bédaride**
@@ Line 42: / Line 38: @@
 ==== 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.