During the seminar, the professor illustrated a simsun permutation with an example to show how the subsequence of the smallest k elements never contains three consecutive entries in decreasing order for any k.

Many recent papers investigate simsun permutations because they reveal intricate ascent-descent patterns.