Similarities and Differences between the Longest Common and Longest Common and Increasing Subsequences in Random Words

Series
Stochastics Seminar
Time
Thursday, January 22, 2026 - 3:30pm for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Christian Houdré – Georgia Institute of Technology – houdre@math.gatech.edu – https://houdre.math.gatech.edu
Organizer
Benjamin McKenna

Let $LC_n$ be the length of the longest common subsequences of two independent random words whose letters are taken  in a finite alphabet and when the alphabet is totally ordered and let $LCI_n$ be the length of the longest common and increasing subsequences of the words.   Results on the asymptotic means, variances and limiting laws of these well-known random objects will be described and compared.