Speaker: Chris Cox
Title: Periodic words, common subsequences and frogs

Abstract: The longest common subsequence (LCS) between a pair of random
words is poorly understood. In an attempt to shed some light on this
problem, we focus on the simpler task of understanding the LCS between a
fixed periodic word and a random word. Here, we can formulate the
problem as a new interacting particle system related to the PushASEP,
which we dub the ``frog dynamics''.

Froggies on a pond
They get scared and hop along
Scaring others too.

Their erratic gait
Gives us tools to calculate
LCS of words.

(Joint work with Boris Bukh)