We investigate permutations and involutions that avoid a pattern of length three and have a {\em unique} longest increasing subsequence.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。