- Series
- Combinatorics Seminar
- Time
- Friday, November 21, 2025 - 3:15pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Christian Houdre – Georgia Institute of Technology – houdre@math.gatech.edu – https://houdre.math.gatech.edu/
- Organizer
- Jiaxi Nie
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, 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.