Unique longest increasing subsequences in 132-avoiding permutations (Q6586840)

\textit{M. Bóna} and \textit{E. Dejonge} [Electron. J. Comb. 27, No. 4, Research Paper P4.44, 11 p. (2020; Zbl 1454.05006)] established that as \(n\) tends to infinity, the proportion of \(132\)-avoiding permutations of length \(n\) with a unique longest increasing subsequence (ULIS) approaches \(1/2\), and they posed the question: are there always at least as many \(132\)-avoiding permutations of length \(n\) with a ULIS as without?\N\NThe author answers this question affirmatively by constructing an injection from \(132\)-avoiding permutations of length \(n\) without a ULIS to those with a ULIS. This injection also increases the length of the longest increasing subsequence (LIS) by precisely \(1\).