Asymptotics for the Length of the Longest Common Subsequences

Combinatorics Seminar
Friday, April 1, 2016 - 3:00pm
1 hour (actually 50 minutes)
Skiles 005
Georgia Tech
Both for random words or random permutations, I will present a panoramic view of  results on the (asymptotic) behavior of the length of the longest common subsequences . Starting with, now, classical results on expectations dating back to the nineteen-seventies I will move to recent results obtained by Ümit Islak and myself giving the asymptotic laws of this length and as such answering a decades-old well know question.