Differences

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

--- start [2026/01/21 18:56] – anna.frid
+++ start [2026/02/10 14:43] (current) – anna.frid
@@ Line 22: / Line 22: @@
 ==== Upcoming talks ====
+**February 17 2026: [[https://sites.google.com/view/stevenrobertson|Steven Robertson]]** //Number walls of automatic sequences//
+Given any one-dimensional sequence S, one can generate a unique two-dimensional sequence by considering the determinants of the Toeplitz matrices defined by S. This is known as the number wall of S. It is conjectured that if S is automatic, then the number wall of S is itself a two-dimensional automatic sequence. In this talk, we will discuss evidence towards this conjecture as well as some recent partial results. The talk aims to be accessible for people with no experience of number walls.
-**February 3 2026: [[https://scholar.google.com/citations?user=65FAE84AAAAJ&hl=de|Annika Huch]] ** //A Word Reconstruction Problem for Polynomial Regular Languages//
-The reconstruction problem concerns the ability to uniquely determine an unknown word from querying information on the number of occurrences of chosen subwords. In the joined work with M. Golafshan and M. Rigo we focused on the reconstruction problem when the unknown word belongs to a known polynomial regular language, i.e.,
-its growth function is bounded by a polynomial. Exploiting the combinatorial and structural properties of these languages, we are able to translate queries into polynomial equations and transfer the problem of unique reconstruction to finding those sets of queries such that their polynomial equations have a unique integer solution.
-**February 17 2026: Steven Robertson**
 **March 03 2026: Ingrid Vukusic**
@@ Line 52: / Line 46: @@
 ==== Past talks 2026 ====
+**February 3 2026: [[https://scholar.google.com/citations?user=65FAE84AAAAJ&hl=de|Annika Huch]] ** //A Word Reconstruction Problem for Polynomial Regular Languages//
+{{ seminar2026:20260203huch.pdf |slides}}
+{{ seminar2026:20260203huch.mp4 |video of the talk}}
+The reconstruction problem concerns the ability to uniquely determine an unknown word from querying information on the number of occurrences of chosen subwords. In the joined work with M. Golafshan and M. Rigo we focused on the reconstruction problem when the unknown word belongs to a known polynomial regular language, i.e.,
+its growth function is bounded by a polynomial. Exploiting the combinatorial and structural properties of these languages, we are able to translate queries into polynomial equations and transfer the problem of unique reconstruction to finding those sets of queries such that their polynomial equations have a unique integer solution.
 **January 20 2026: [[https://orbi.uliege.be/profile?uid=p207127|Savinien Kreczman]]** //Factor complexity and critical exponent of words in a Thue-Morse family//