An increasing subsequence of a permutation of {1, . . . , n} is an increasing sequence of integers between 1 and n whose order is preserved by the permutation. A simple question to ask is: If you select a permutation uniformly at random, how long is the longest increasing subsequence? In this talk we will explore this question and the diverse fields used to answer it, which include the...