加载中…
2023-03-06
A Combinatorial Proof for 132-Avoiding Permutations with a Unique Longest Increasing Subsequence
Nicholas Van Nimwegen
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本