Abstract: The classical Ulam’s problem asks about the length of a longest increasing subsequence in a uniform random permutation. This problem turned out to be one of the canonical models in the KPZ universality class, with remarkable connections with many different objects including random matrices and growing interfaces. I shall describe some parts of this fascinating story that has emerged in the last two decades, and some of the more recent developments.
