An Erdős-Szekeres-Type Result on Permutation Patterns

We construct an infinite set of patterns $(p,q)$ where $p$ is an almost increasing permutation and $q$ is an almost decreasing permutation, such that the exponential growth rate of permutations avoiding $(p,q)$ is 2. This extends a classical result of Erdős and Szekeres.