A Combinatorial Proof for 132-Avoiding Permutations with a Unique Longest Increasing Subsequence

Abstract

We provide a simple injective proof that the number of 132-avoiding permutations with a unique longest increasing subsequence is at least as large as the number of 132-avoiding permutations without a unique longest increasing subsequence.