Combinatorics Seminar: An Erdos-Szekeres Permutation Game

Abstract: Consider a two-player game where players take turns building a permutation. The first player to complete an increasing subsequence of length a or a decreasing subsequence of length b loses. While the Erdos-Szekeres Theorem gives an upper bound on how long this game lasts, we analyze strategies for optimal game play, especially in the cases where b is at most 5.

Host: Martha Precup