Caged subsequences in permutations

Abstract

Given a sequence $\mathfrak{a}:=(a_1,\ldots,a_n)$ of reals, a subsequence $\mathfrak{b}=(a_{i_1},\ldots,a_{i_k})$ is said to be "caged" if the largest and smallest among the members of $\mathfrak{b}$ are $a_{i_1}$ and $a_{i_k}$, though not necessarily in that order. In this paper, we consider the problem of maximal caged sequences in permutations $\pi\in S_n$. We also consider the same problem for a random permutation, both when the permutation is chosen uniformly at random and also when it is picked uniformly at random from among the permutations of rectangular shape, via the RSK correspondence.