Pattern avoiding permutations and involutions with a unique longest increasing subsequence

Abstract

We investigate permutations and involutions that avoid a pattern of length three and have a {\em unique} longest increasing subsequence.